Computer Sciences Commons^™

Magnetic Tape Portability, James Alf Iverson

Department of Computer Science Technical Reports

No abstract provided.

Cephalometrics For The Oral Surgeon In The Diagnosis Of Facial Deformities, Frederick J. Mantz

Loma Linda University Electronic Theses, Dissertations & Projects

Surgical orthodontics presents a challenge to the oral surgeon. By the nature of the oral surgeon's training and discipline he should be the one best qualified to treat the surgical aspect of the surgical orthodontic case. The establishment of a proper diagnosis and means of communication between the oral surgeon and orthodontist are essential in achieving a good final result for the surgically treated case. Fortunately, a scientific method of diagnosis is available that can provide both specialties with a common language. Computerized cephalometric analysis can provide the diagnosis and link of communication for the discussion of goals and treatment. …

Digital Computer Solution Of Electromagnetic Transients In Large Power Systems, Bijan Navidbakhsh

Dissertations and Theses

This thesis is an introduction to the solution of electromagnetic transients by a combination of the Bergeran method of characteristics and the application of trapezoidal rule of integration.

Three test examples solved by digital computer illustrate the step by step solution and computer programming.

To compare this method with the Laplace transformation technique, a test problem solved by both methods and also digital computer is illustrated. In conclusion, the advantages and disadvantages of both methods are compared.

The Education Of A Computer: Development Of Computer-Assisted Instruction Of German Grammar, Karen Wintringham

Senior Scholar Papers

Characteristic of the acquisition of most skills, the learning of a foreign language requires formalized, systematic training. Computer-assisted instruction provides the necessary individualized drill with accompanying reinforcement. The "BASIC" CAI course, MODALS, represents the culmination of nine months of research and programming of the instruction of German modal auxiliaries; the complex of sixty seven interconnected sub -programs provide drill of all six modals in five different tenses. Subsequent to the in-class introduction of new lecture material concerning the modals, any student may then proceed to the computer terminal, there undertaking further study of the subject. MODALS lacks an answer recording …

The Monadic Second-Order Theory Of Ordinals W Sub 2, J. Richard Buchi, Charles Zaiontz

Department of Computer Science Technical Reports

No abstract provided.

Modeling A Large Online File System, John Pomeranz

Department of Computer Science Technical Reports

No abstract provided.

Terminal Talk - The Wofford Connection - February 1973, Wofford College Computer Center

Terminal Talk

No abstract provided.

Finite Dimensional Group Rings, Ralph W. Wilkerson

Computer Science Faculty Research & Creative Works

A Ring is Right Finite Dimensional If It Contains No Infinite Direct Sum of Right Ideals. We Prove that If a Group G is Finite, Free Abelian, or Finitely Generated Abelian, then a Ring R is Right Finite Dimensional If and Only If the Group Ring RG is Right Finite Dimensional. a Ring R is a Self-Injective Cogenerator Ring If Rn is Injective and RR is a Cogenerator in the Category of Unital Right /{-Modules; This Means that Each Right Unital A-Module Can Be Embedded in a Direct Product of Copies of R. Let G Be a Finite Group Where …

A Novel Method Of Constructing Sorting Networks, Robert M. Keller

All HMC Faculty Publications and Research

The construction of sorting networks has been a topic of much recent discussion. In view of the apparent difficulty of verifying whether a reasonably large proposed sorting network actually does sort, the most useful approach for constructing large networks seems to be to devise a recursive scheme which constructs a network which is guaranteed to sort, obviating the verification phase. In this note, another such approach is presented.

Monte Carlo Simulation Of Confidence Intervals For Reliability, Kathryn Palisch Berkbigler

Masters Theses

"A computer program which computes fiducial confidence intervals for reliability by Monte Carlo simulation has been written. The program has the capability of computing these intervals for general systems of series, parallel, and mixed series and parallel subsystems which have failure time distributions which are either exponential, Weibull, gamma, normal, or lognormal.

Comparison of the simulation technique with a Bayesian technique for computing confidence intervals in the case of a series of exponentially distributed components shows that the two methods agree quite well when a fiducial prior distribution for reliability is used in the Bayesian technique. A uniform prior distribution …

Mando : A Computer Program For Symbolic Manipulation Of Differential Operators Generating Continuous Transformations, David Kenneth Davison

University of the Pacific Theses and Dissertations

The program MANDO efficiently performs computations involving pairs of operators, a single operator, and operators applied to functions, saving time and cost over pencil-·and-paper methods.

A versatile but compact data structure, defined under SPIT-BOL's facility for creation of datatypes, contains the operators (and functions) and provides a means for systematically referencing their relevant parts.

On input, functions and operators are written in a restricted but natural string format, for which the program can readily convert them to the internal data structure.

Central to the method of operation of the derivative routine is its ability to differentiate a function written as …

On The Decomposition Of Asynchronous Systems, Robert M. Keller

All HMC Faculty Publications and Research

This paper reports of part of a continuing investigation of parallel computation, in particular, efforts toward understanding the nature of different types of parallel control. The first section defines an asynchronous system to be a simple type of state machine. This was arrived at in an attempt to generalize from the types of control in parallel program schemata and networks of asynchronous modules without bounded delays. Asynchronous systems with output are also defined in a familiar way. The deviation from standard work comes in the definition of a parallel decomposition of asynchronous systems. Some preliminary work on compositions of this …

Terminal Talk - The Wofford Connection - September 1972, Wofford College Computer Center

Terminal Talk

No abstract provided.

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

Terminal Talk

No abstract provided.

Moment-Curvature-Thrust Relationships In Hybrid Members, Douglas Wrenn Fiala

Dissertations and Theses

In order to overcome the difficulties encountered in closed form solutions, moment-curvature-thrust relationships are developed for hybrid and nonhybrid cross sections utilizing an open form method. The use of horizontal sectors permits the inclusion of residual stresses and/or nonbilinear stress-strain relationships, if desired. Theoretical and experimental data are compared. Applications to circular tubes and other cross sections are discussed. Results indicate that open form solutions are feasible for calculating moment-curvature-thrust data. Hybrid cross sections are easily treated by open form solutions.

Terminal Talk - The Wofford Connection - June 1972, Wofford College Computer Center

Terminal Talk

No abstract provided.

A Planning And Cost Allocation Procedure For Computer System Management, J. Nunamaker, A. Whinston

Department of Computer Science Technical Reports

No abstract provided.

Generalized Finite-Geometry Codes, Carlos R.P. Hartmann, Luther D. Rudolph

Electrical Engineering and Computer Science - Technical Reports

A technique is presented for constructing cyclic codes that retain many of the combinatorial properties of finite-geometry codes, but are often superior to geometry codes. It is shown that L-step orthogonalization is applicable to certain subclasses of these codes.

Digital Computer Modeling Of Limestone Groundwater Systems, John Thrailkill, David P. Beiter

KWRRI Research Reports

Because limestone groundwater flows mainly In discrete openings, limestone aquifers are fundamentally different from aquifers In granular rocks. A digital computer program which simulates flow in a limestone aquifer as a pipe network was written and compared with the Sinkhole Plain aquifer of west-central Kentucky.

A reasonably good fit between observed parameters of the aquifer and those calculated were obtained under assumed conditions of both laminar and turbulent now In the aquifer. The Indicated gross permeablllty of the aquifer is 5600 melnzers with an assumed aquifer thickness of 100 feet. The location and discharge of springs along the streams bounding …

Digital Video Display System Using Cathode-Ray Tube, George M. Low, Arthur I. Zygielbaum, Warren L. Martin, Alexander Engel

School of Natural Resources: Faculty Publications

A digital video display system (DWDS) is disclosed for display of image, alphanumeric and other data on a cathode-ray tube (CRT) with sequential raster scan and two, four or eight gray shades. The DVDS includes a central processing unit for ac tivating the system, selecting the X (horizontal axis) and Z (in tensity modulation) modes, and designating the starting loca tion of two successive rasters of data from a memory accessed by a data multiplexer subsystem (DMS). At the end of each raster, the DMS interrupts the computer for a new starting lo cation of a raster of data to …

Decoding By Sequential Code Reduction, Luther D. Rudolph, Carlos R.P. Hartmann

Electrical Engineering and Computer Science - Technical Reports

A general decoding method for cyclic codes is presented which gives promise of substantially reducing the complexity of decoders at the cost of a modest increase in decoding time (or delay). Significant reductions in decoder complexity for binary cyclic finite-geometry codes are demonstrated, and two decoding options for the Golay code are presented.

Software Simulation Of The D17b Computer, Bruce Chatterton

Theses and Dissertations

A software program has been written which simulates the functions of the Minuteman D17B computer at the register transfer level. The simulation program is written in the FORTRAN Extended language to be used on the Intercom System (teletype) of a CDC 6600 computer system. The simulation program consists of a main program and eight subroutines. A programming language for the D17B simulation was formed which contains numbers and load codes, switches, and miscellaneous commands. Example programs run on the simulated computer have been included to show the types of output available.

Terminal Talk - The Wofford Connection - February 1972, Wofford College Computer Center

Terminal Talk

No abstract provided.

Some Results On The Best Match Problem, Luther D. Rudolph, Kishan Mehrotra, Ralph J. Longobardi

Electrical Engineering and Computer Science - Technical Reports

The "best-match problem" is concerned with the complexity of finding the best match between a randomly chosen query word and the members of a randomly chosen set of data words. Of principal interest is whether it is possible to significantly reduce the search time required, as compared to exhaustive comparison, by use of memory redundancy (file structure). Minskv and Papert conjecture that "the speed-up values of large memory redundancies is very small, and for large data sets with long word lengths there are no practical alternatives to large searches that inspect large parts of memory". For this report we present …

A Methodology For The Design And Optimization Of Information Processing Systems, J. F. Nunamaker

Department of Computer Science Technical Reports

No abstract provided.

A Note On Orders Of Enumeration, John Helm, Albert Meyer, Paul Young

Department of Computer Science Technical Reports

No abstract provided.

Computerized Registration For High Schools, Kenneth Lee Fore

Masters Theses

"The guidance personnel in a high school are often burdened with the duty of hand scheduling the student's courses. Using the computer as a sub-optimizing tool in the registration of students, however, can cut scheduling time dramatically and relieve the guidance department of an onerous chore. The technique described in this investigation uses a conflict matrix that schedules the student's request and keeps the class load level within the course sections. A search of the schedule array for each course request may uncover a conflict. If no conflict occurs the course is scheduled and the remaining courses for this student …

The Myhill Functor, Input-Reduced Machines, And Generalised Krohn-Rhodes Theory, Robert H. Yacobellis

Computer Science: Faculty Publications and Other Works

No abstract provided.

Terminal Talk - The Wofford Connection - December 1971, Wofford College Computer Center

Terminal Talk

No abstract provided.

Symmetric Binary B-Trees: Data Structure And Algorithms For Random And Sequential Information Processing, Rudolf Bayer

Department of Computer Science Technical Reports

No abstract provided.