Digital Commons Network^™

Quick Ceph™, A Computer Program For Cephalometric Analysis And Treatment Planning, Günther Blaseio

Loma Linda University Electronic Theses, Dissertations & Projects

The quantification of cephalometric radiographs is an integral part of orthodontic treatment planning. Numerous computer programs have been designed to digitize headfilms and to provide accurate graphic output and exact measurements. Yet these early systems were either huge, bulky and expensive or were limited in their practical use. The aim of this development was to combine modern computer and electronic equipment with advanced software engineering. The result is a universal cephalometric program written in the computer language "C" with presently seven standard and virtually limitless user definable analyses, growth forecasting, mouse-driven interactive VTO, arch length calculation, superimpositions, table of values …

A Five Year Plan For Excellence, Mikhail J. Atallah, Douglas E. Comer, Herbert E. Dunsmore, Greg N. Frederickson, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Analytic Modelling Of Cyclic Service Systems And Their Application To Token-Passing Local Networks, Vernon J. Rego, Lionel M. Ni

Department of Computer Science Technical Reports

No abstract provided.

A Semantic Basis For Parallel Algorithm Design, Roger E. Eggen, John R. Metzner

Computer Science Technical Reports

As computing demands increase, emphasis is being placed on parallel architectures- To efficiently use parallel machines, software must be designed to take advantage of these machines. This research concentrates on an abstraction of algorithm design to permit the expression of parallel programs. The abstraction emphasizes thought about algorithms at a high level as opposed to algorithm implementation at a statement level. A model based on data flow allows algorithm expression using flow diagrams. The model specifies operating system requirements that support parallel programming at a module level. Paths are used to carry data between modules. Data enter modules through ports. …

Direct Simulation From A Model Specification Language, Richard Pimentel

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

The purpose of this thesis was to develop a program that would accept, as input, a finite set of algebraic equations and simple if-then conditional expressions that model a natural system, and then produce a continuous computer simulation with graphics and tabular output. The equations and conditionals can be in any order and key elements can be missing. The program can be used to run existing models or as a development tool to produce immediate prototypic computer simulations through synergistic man-machine interactions.

The theoretical aspects of automatic program generation were discussed, as well as the architectural design of the system. …

A Unifying Framework For Systolic Designs, Concettina Guerra

Department of Computer Science Technical Reports

No abstract provided.

Parallel Methods For Pdes, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

A Query Optimization Method For Use In A Generalized Database, Caroline D. Mautz

Masters Theses

Currently proposed methods for retrieval of records from a generalized file organization are not optimal, causing more I\0 retrievals than are necessary. This paper proposes another technique that has near optimal results and has a polynomial order of complexity.

The technique takes as input a query in disjunctive form, sorts the keys in the query in ascending order according to the number of records associated with them, then using a table much like a prime implicant table, systematically searches for a complete cover of the query conjuncts with a minimum total number of records associated with the keys that are …

Ellpack Project Status Report, John R. Rice, Wayne R. Dyksen, Elias N. Houstis, Calvin J. Ribbens

Department of Computer Science Technical Reports

No abstract provided.

Methods Of Factoring Large Integers, Samuel S. Wagstaff Jr, J. W. Smith

Department of Computer Science Technical Reports

No abstract provided.

Lexical Analysis Using Table Look-Up, Brian Keith Smith, Dominic Soda, George Winston Zobrist

Engineering Management and Systems Engineering Faculty Research & Creative Works

No abstract provided.

Performance Evaluation Modeling For Distributed Computing, Catherine E. Houstis, Elias N. Houstis, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Evaluating Storage Management Schemes For Block Structured Languages, Thomas P. Murtagh

Department of Computer Science Technical Reports

No abstract provided.

Ua35/11 Student Honors Research Bulletin, Wku Honors Program

WKU Administration Documents

The WKU Student Honors Research Bulletin is dedicated to scholarly involvement and student research. These papers are representative of work done by students from throughout the university.

• Padilla, Anne. First and Second Language Acquisition: A Comparison
• Scott, Angela. Salted and Unsalted Snacks: Taste Preferences of Second Grade Students in a Rural Area School
• Fuqua, Nancy. Acceptance by High School Students of Muffins Containing Supplemental Soy Polysaccharides
• Mans, Glee. Preference Levels of High School Freshmen for Four Cheese Food Products
• Denney, Pam. Consumer Acceptance of UHT Choclate Lowfat Milk
• Harris, Carla. Jacques-Louis David: Raphael of the Sansculottes
• Vaughn, James. Corporate Reorganization …

Multiprocessor Scheduling With Practical Constraints, Kenneth Burton Donovan

Retrospective Theses and Dissertations

The problem of scheduling tasks onto multiprocessor systems has increasing practical importance as more applications are being addressed with multiprocessor systems. Actual applications and multiprocessor systems have many characteristics which become constraints to the general scheduling problem of minimizing the schedule length. These practical constraints include precedence relations and communication delays between tasks, yet few researchers have considered both these constraints when developing schedulers.

This work examines a more general multiprocessor scheduling problem, which includes these practical scheduling constraints, and develops a new scheduling heuristic using a list scheduler with dynamically computed priorities. The dynamic priority heuristic is compared against …

Epsilon Precedence Grammars And Languages, Masoud T. Milani

Retrospective Theses and Dissertations

The classes of simple and weak precedence grammars are generalized to include ε-rules (productions with the empty right parts). The descriptive power of epsilon simple precedence (ESP) grammars increases directly with the number of ε-rules permitted; the class of ESP grammars with no ε-rules, ESP₀, is identical to the class of simple precedence grammars; ESP grammars with at most one ε-rule, ESP₁, define a class of languages which properly includes the class of ESP₀ languages, but is itself properly included in the class of deterministic, context-free languages. In general, ESP grammars having at most i …

The Assessment Of Software Usability [Abstract], David W. Biers, Samuel M. Bower, Frank J. Dapolito, Donald J. Polzella

Psychology Faculty Publications

The University of Dayton has been exploring the feasibility of establishing a software usability testing laboratory. Usability refers to the ease-of-use of a system, and usability testing is performed to ensure that systems meet the criteria established to determine ease of use. Usability assessment involves both the measurement of user performance and user satisfaction.

Intra Region Routing, Robert Alan Eustace

Retrospective Theses and Dissertations

The custom integrated circuit routing problem normally requires partitioning into rectangular routing regions. Natural partitions usually result in regions that form both "channels" and "areas". This dissertation introduces several new channel and area routing algorithms and measures their performance.

A formal description of the channel routing problem is presented and a relationship is established between the selection of intervals for each track and the number of tracks in the completed channel. This relationship is used as an analysis tool that leads to the development of two new and highly effective channel routing algorithms: the Revised and LCP algorithms. The performance …

Specification And Efficiency Evaluation Of A Data Communications Protocol, Patricia Ann Anderson

Masters Theses

"A data communications protocol for an established operating environment is formally specified. Motivation for the development of this protocol is presented, with consideration for the future communications requirements of the system.

Factors influencing the performance of a protocol are reviewed. Error recovery, network addressing, flow control, traffic prioritization, and initialization and termination sequences are examined in general and with respect to the protocol development.

In conclusion, a mathematical evaluation of the efficiency of the protocol is provided, using Tanenbaum's equations for determining channel utilization. The theoretical channel utilization of a perfect system, without propagation delay or error, is compared with …

Tutorials For Software : A Comparison Of The Appleworks Software Tutorial With Pre-Entered Data And An Experimental Tutorial With User Entered Data, Toni L. Steil

University of the Pacific Theses and Dissertations

The attention directed toward computer software research has been sparse which is quite evident in particular facets such as learning methods, specifically towards tutorials. Some authors have identified various important issues which include cognitive factors, reduction of presentation of superfluous information, and the importance of interaction with software and hardware. The present . study examined two tutorials which were similar except in their level of required user behaviors. Tutorial A required only user manipulation of disk stored data. Tutorial B required the user to enter the data into the computer, design the screen format, and then to manipulate it. It …

Automatic Ordering Of Program Units For Execution, Ronald D. Williams

All Graduate Plan B and other Reports, Spring 1920 to Spring 2023

A program written in today's sequential programming languages must be written according to a rule which states that source instructions must be written in their exact order of execution. A better rule would be to let the programmer write the instructions in any order he wants- - then let a program figure out the proper order of execution. Such a system applies not only to individual instructions in a procedure or program, but to procedures in a program and to programs in a job stream.

This paper and its associated automatic ordering program introduce a method by which instructions can …

Mica: Prototyping An Expert System Consultant, Joseph Howard Marchal

Masters Theses

"The United States, as the world's largest producer and consumer of scrap and flake mica, has an obvious economic interest in applications of artificial intelligence technology that would expedite beneficiation of mica. In the fall of 1985, personnel of the Tuscaloosa and Rolla research centers of the Bureau of Mines and of the University of Missouri--Rolla, Institute for Artificial Intelligence started the following long term research project: Develop an Expert System Consultant for the three basic stages of mica beneficiation: Stage 1: characterization of the material; Stage 2: treatment to obtain a concentrate; and Stage 3: evaluation of the resulting …

A Semantic Basis For Parallel Algorithm Design, Roger E. Eggen

Doctoral Dissertations

"As computing demands increase, emphasis is being placed on parallel architectures- To efficiently use parallel machines, software must be designed to take advantage of these machines. This research concentrates on an abstraction of algorithm design to permit the expression of parallel programs. The abstraction emphasizes thought about algorithms at a high level as opposed to algorithm implementation at a statement level. A model based on data flow allows algorithm expression using flow diagrams. The model specifies operating system requirements that support parallel programming at a module level. Paths are used to carry data between modules. Data enter modules through ports. …

Cycle-Time Distributions And Stability Of Adaptive Token-Passing Bus Networks, Vernon J. Rego, Herman D. Hughes

Department of Computer Science Technical Reports

No abstract provided.

The Design And Implementation Of A High-Speed Incremental Portable Prolog Compiler, Kenneth A. Bowen, Kevin A. Buettner, Ilyas Cicekli, Andrew Turk

Electrical Engineering and Computer Science - Technical Reports

The design and implementation of a relatively portable Prolog compiler achieving 12K LIPS on the standard benchmark is described. The compiler is incremental and uses decompilation to implement retract, clause, and listing, as well as support the needs of its four-port debugger. The system supports modules, garbage collection, database pointers, and a full range of built-ins.

A Communication Sub-System For Mvs/Xa, Dan C. Marinescu

Department of Computer Science Technical Reports

No abstract provided.

A Fast Linear Space Algorithm For Computing Longest Common Subsequences, A. Apostolio, C. Guerra

Department of Computer Science Technical Reports

No abstract provided.

The Aspect Ratio Significant For Finite Element Problems, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Method And Apparatus For Performing Hashing Operations Using Galois Field Multiplication, John L. Carter, George Markowsky, Mark N. Wegman

Computer Science Faculty Research & Creative Works

The invention comprises a method and apparatus for performing a hashing operation on an N bit number under control of a prespecified N bit hashing constant which comprises performing N/K finite field partial multiplications of the object to be hashed by the hashing constant, utilizing K logic and combinatorial circuits all of which operate in parallel to completely evaluate the number in N/K operations.

Another feature of the present invention is that the hashing constant loaded into the system may be changed at will with a resultant changing of the hashing characteristics to suit a particular class of objects to …

Using Supercomputers Today And Tomorrow, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.