Computer Sciences Commons^™

New Computer Methods For Protein Crystallography, Martin Zwick

Complex Systems Faculty Publications and Presentations

New Computer Methods for Protein Crystallography, by Martin Zwick. Submitted to the Department of Biology on 30 August 1968 in partial fulfillment of the requirements for the degree of Doctor of Philosophy. The section, "MYOGLOBIN REFINEMENT," describes the fitting of an idealized polypeptide chain to a set of approximate backbone coordinates for the protein, sperm whale myoglobin. This procedure refines the structure by imposing upon it known bond distances and angles, and simultaneously derives a representation of the polypeptide conformation in terms of the values of the rotation angles about its single bonds. The overall rms and mean deviation between …

Numerical Analysis For The Consumer, D. Dodson, J. Ewing, P. Miller, W. Nylin, E. Petarik, S. Prues

Department of Computer Science Technical Reports

No abstract provided.

Terminal Talk - The Wofford Connection - August 1968, Wofford College Computer Center

Terminal Talk

No abstract provided.

Ptss User's Manual, E. J. Desautels

Department of Computer Science Technical Reports

No abstract provided.

Terminal Talk - The Wofford Connection - July 1968, Wofford College Computer Center

Terminal Talk

No abstract provided.

Electronic Computers - A Historical Survey In Print, Saul Rosen

Department of Computer Science Technical Reports

No abstract provided.

An Evaluation Of Five Polynomial Zero Finders, David S. Dodson, Phillip A. Miller, William C. Nylin, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Least Squares Cubic Spline Approximation I - Fixed Knots, Carl De Boor, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Least Squares Cubic Spline Approximation, Ii - Variable Knots, Carl De Boor, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Ortnrm - A Fortran Subroutine Package For The Solution Of Linear Two-Point Boundary Value Problems, S. Silverston

Department of Computer Science Technical Reports

No abstract provided.

Qslin - A Fortran Subroutine Package For The Solution Of Non-Linear Two-Point Boundary Value Problems, S. Silverston

Department of Computer Science Technical Reports

No abstract provided.

Economic Analysis Of Flood Detention Storage By Digital Computer, James Ray Villines, L. Douglas James

KWRRI Research Reports

The objective of this study was to develop a digital computer procedure for preliminary analysis of the economic justification of reservoir detention storage for flood control and to present a sample study illustrating its application. A computer program called the University of Kentucky Flood Control Planning Program III was developed and tested on the flood plain of the South Fork of the Licking River in northeastern Kentucky.

Given a specified reservoir site and a downstream flood plain divided into planning units, Program III selects the economically efficient combination of reservoir detention storage and the associated combination of channel improvement, flood …

Planning Flood Control Measures By Digital Computer, James Norris Cline, L. Douglas James

KWRRI Research Reports

The purpose of this study was to develop adequate guidelines whereby those interested in flood control planning would be able to apply a pair of digital computer programs known as the University of Kentucky Flood Control Planning Programs to ease the computational burden of evaluating specific flood control situations. Program II determines the economically optimum combination of channel improvement, land use restriction, and flood proofing for flood damage abatement. Program III also incorporates reservoir storage into the planning process. The Programs are not intended to provide a finished design but rather to select the optimum combination of flood control measures …

A Comparison Of Three Numerical Techniques Used For The Solution Of The Two-Point Boundary Value Problem, William Richard Krall

Masters Theses

"Three numerical approximation techniques, called the Initial step, Shooting, and Direct Finite Difference Techniques, respectively, are compared and discussed as they apply to the solution of both linear and non-linear boundary-value problems of the form y"=f(x,y,y') with endpoint conditions y(x_o)=y_o and y(x_n)=y_n. The techniques are compared with respect to speed and accuracy by comparing the solution of each problem considered four times, each time for a different increment value, and comparing the errors at four pivotal points chosen at equally spaced distances over the domain of the function, to give an indication of …

A Development Of Regression Models For Predicting Temperature, Salinity And Sound Velocity In Sea Water, Darwin Wayne Brown

Masters Theses

"There are in existence today some reasonably good numerical procedures for predicting sound velocity, but these procedures require that certain initial data such as temperature and salinity be given before a sound velocity may be computed. Eliminating the need for on-location observations of temperature and salinity, which are used in computing sound velocity, was the primary objective of this study. Stepwise multiple regression was applied in the search for suitable models to predict temperature and salinity, and ultimately sound entirely in terms of controllable variables, such as latitude, longitude, depth, and day-of-year"--Abstract, page ii.

Problems Encountered With Control Networks In Highly-Restructurable Digital Systems, Donald F. Wann, Robert A. Ellis, Mishell J. Stucki, Robert M. Keller

All HMC Faculty Publications and Research

This paper discusses problems encountered with control networks in highly restructurable digital systems. In particular the treatment of implementation errors is covered with emphasis on concurrent processing. The implementation of concurrent processing networks may result in errors which will be quite complex to detect and systematic methods are warranted. Four meta control elements are employed in obtaining convenient concurrent structures. We analyze several error detecting schemes and conclude that the arc-node method with node partitioning appears to be the most realistic approach at this time.

Definability In The Monadic Second-Order Theory Of Successor, J. Richard Buchi, Lawrence H. Landweber

Department of Computer Science Technical Reports

No abstract provided.

Solving Sequential Conditions By Finite State Strategies, J. Richard Buchi, Lawrence H. Landweber

Department of Computer Science Technical Reports

No abstract provided.

Air Force Rotc At The University Of Richmond, 1951-1957, Robert J. Dandridge

Honors Theses

In the summer of 1950, after the seriousness of the Korean conflict had become evident, a special committee appointed three years earlier by the Executive Committee of the Board of Trustees was reactivated for the purpose of considering "the feasibility of applying for a Reserve Office Training Corps unit" for the University of Richmond. This special committee, called the ROTC Committee, after thorough study, rendered a unanimous recommendation to the Board that a unit of Army ROTC be applied for. The application was completed and mailed to the Department of the Army. Approval of the application was not long in …

The Generalized Inverse In Linear Programming: An Intersection Projection Method, L. Duane Pyle

Department of Computer Science Technical Reports

No abstract provided.

Structure Of A Language For A Numerical Analysis Problem Solving Systems, Lawrence R. Symes, Roger V. Roman

Department of Computer Science Technical Reports

No abstract provided.

Rational Arithmetic As A Means Of Matrix Inversion, Jay Roland Peterson

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

The solution to a set of simultaneous equations is of the form A^-1 B = X where A^-1 is the inverse of A in the equation AX= B. The purpose of this study is to obtain an exact A^-1 through the use of rational arithmetic, and to study the behavior of rational numbers when used in arithmetic calculations.

This study describes a matrix inversion program written in SPS II, utilizing the concept of rational arithmetic. This program, using the Gaussian elimination matrix inversion method, is compared to the same method written in Fortran. Gaussian elimination …

Comparative Analysis Of Polynomial Root Finding Techniques, Charles Ray O'Daniel

Masters Theses

"The purpose of this study was to investigate and recommend various methods instrumental in finding the roots of a polynomial p(x) = 0. Many different methods are present today, and each has its advantages and disadvantages.

Through thorough investigation, the author has ascertained the key methods to be the method of Bisection, the Newton-Raphson method, and the Bairstow method. Special support in the form of algebraic theorems on the locations and kind of roots are extremely helpful. This combination of theorems and methods provides assurance, speed, and the ability to obtain complex roots.

The Bisnewbar method developed by this author …

Economic Analysis Of Alternative Flood Control Measures By Digital Computer, Thomas M. Rachford

KWRRI Research Reports

The purpose of this project was to develop a digital computer program for selecting the optimum combination of flood proofing, flood-plain land use, channel improvement, and residual flood damage for a given floodplain. Based on economic efficiency, the optimum policy is selected for each planning unit of the total flood-plain for each period of time called a planning stage. The program was written in Fortran IV for the IBM 7040 and the University of Kentucky Computing Center compiler. The program requires about 23,000 words of core storage and about 30 seconds of execution time per planning-unit-stage for typical conditions. The …

Stable Predictor-Corrector Methods For First Order Ordinary Differential Equations, Terrell Lester Carlson

Masters Theses

"Because of the wide variety of differential equations, there seems to be no numerical method which will affect the solution best for all problems. Predictor-corrector methods have been developed which utilize more ordinates in the predictor and corrector equations in the search for a better method.

These methods are compared for stability and convergence with the well known methods of Milne, Adams, and Hamming"--Abstract, page ii.

A Comparison Of The Lr And Qr Transformations For Finding The Eigenvalues For Real Nonsymmetric Matrices, Susan Clara Hanson

Masters Theses

"The LR and QR algorithms, two of the best available iterative methods for finding the eigenvalues of a nonsymmetric matrix associated with a system of linear homogeneous equations, are studied. These algorithms are discussed as they apply to the determination of the eigenvalues of real nonsymmetric matrices.

A comparison of the speed and accuracy of these transformations is made. A detailed discussion of the criterion for convergence and the numerical difficulties which may occur in the computation of multiple and complex conjugate eigenvalues are included.

The results of this study indicate that the QR algorithm is the more successful method …

A Simulation Study Of A Proposed Computer Installation, John Edward Hawthorne

Masters Theses

"The operation of a data processing center has been studied with the objective of investigating the effect of various facilities, job loads, and operating policies as measured by job turnaround time. The mechanism for study was digital computer simulation.

This thesis purports to review the technology of simulation and the associated computer techniques, defines the problem and the alternatives available, and analyzes the results derived from the experiments.

Conclusions drawn from this study support the current practice of a functioning data processing center"--Abstract, page ii.

Comparative Analysis Of Numerical Integration Techniques, Edward Lee Sartore

Masters Theses

"When integrating numerically, if the integrand can be expressed exactly as a polynomial of degree n, over a finite interval; then either Simpson's rule, Romberg integration, Legendre-Gauss or Jacobi-Gauss quadrature formulas provide good results. However, if the integrand can not be expressed exactly as an nth degree polynomial, then perhaps it can be expressed as a function f(x) divided by √1-x ², or as a function g(x) times (1-x)^α (l+x)^ß , where α and ß are some real numbers >1, or as a function h(x) times one. If this is the case then the Chebyshev-Gauss, Jacobi-Gauss, and …

A Study Of The Development Of A Heuristic Program That Solves Symbolic Laplace Transformation Problems, Arthur E. Zackrison

Masters Theses

"A medium-speed general purpose digital computer (IBM 1620 Model II) was programmed to solve symbolic Laplace transformation problems. Although the applied mathematician and modern engineer has many uses for the symbolic solution of a problem, the potential of symbolic manipulation by a computer has not yet been sufficiently developed to help them because of many problems. This paper discusses the program and based on the author’s experience with it’s [sic] performance, clarifies the position of several of these difficulties and reaches some conclusions concerning computer solution of such problems"--Abstract, page ii.

Error Analysis Of Rational Approximations Of Functions With Emphasis On Minimax Techniques, Mary Frances Good

Masters Theses

"This study examines the various considerations which are made when a function is approximated by a rational function. None of the four approximations considered here gives both a rapidly calculated approximation and one in which the maximum magnitude of the error function over a given interval is a minimum.

The second algorithm of Remes produces a sequence of rational approximations which converge to the rational approximation that minimizes the maximum magnitude of the error function for a given number of parameters to be calculated if the initial approximation in the sequence is chosen properly. Several rational function approximations are investigated …