Digital Commons Network^™

Partitioning Pde Computations: Methods And Performance Evaluation, Catherine E. Houstis, Elias N. Houstis, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

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.

Progressive Coding And Transmission Of Digital Diagnostic Pictures, Sharaf E. Elnahas, Kou-Hu Tsou, Jerome R. Cox, Rexford L. Hill, R. Gilbert Jost

All Computer Science and Engineering Research

In radiology, as a result if the increased utilization of digital imaging modalities, such as computed tomography (CT) and magnetic resonance imaging (MRI), over a third of the images produced in a typical radiology department are currently in digital form, and this percentage is steadily increasing, Image compression provides a means for the economical storage and efficient transmission of these diagnostic pictures. The level of coding distortion than can be accepted for clinical diagnosis purposes is not yet well-defined. In this paper we introduce some constraints on the design of existing transform codes in order to achieve progressive image transmission …

Application Of Modified Predicate Transition Nets To Modeling And Simulation Of Communication Protocols, Chuang Lin, Dana Cristian Marinescu

Department of Computer Science Technical Reports

No abstract provided.

Generation Of Configuration Spaces Iii: The Case Of Moving Algebraic Curves, Changerjit Bajaj, Myung-Soo Kim

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. …

Generic Specifications In Lil And In Ada Via Analogies, George Chester Harrison

Computer Science Theses & Dissertations

We address the problem of .making verifiable specifications in generic program units in the Ada Programming Language*. We illustrate the methodologies of LIL proposed by Joseph Goguen and Justify the use of such a specification languages using analogy programming originally proposed by Nachum Dershowitz. The work in these areas is new and noticeably incomplete. We address our concern about the reusability of Ada software in a programming environment that includes a specification language like LIL. * Ada is a registered trademark of the U.S. Government (Ada Joint Program Office)

Command Execution In A Heterogeneous Environment, John T. Korb, Craig E. Wills

Department of Computer Science Technical Reports

No abstract provided.

Syntactic Representation And Analysis Of The Cognitive Structures Underlying Ritual Acts, Robert G. Hardin

Masters Theses

A formal grammar was proposed by Lawson and McCauley (1980) to model the cognitive structures underlying an informant's representation of religious ritual acts. This study classifies the language generated by that grammar as context-sensitive, presents an LR(1) parser for the language, and specifies a computer program to implement that model. The system functions as an Intelligent assistant using techniques involving rule-based systems, non-monotonic logic, and multiple levels of abstraction. Knowledge is represented in a parse tree, rules stored as patterns, and the inference engine uses a pattern matcher. The consequences of an act change over time and can change previous …

Deterministic Linear Predictors For Bit Rate Improvement, Dhanvant H. Goradia

Electrical & Computer Engineering Theses & Dissertations

This thesis addresses the application of deterministic linear predictor s for telemetry based systems. Deterministic linear predictors are considered as a viable alternative to block transform coding in order to achieve bit rate reduction. A method of calculating the predictor coefficients of a deterministic linear predictor is presented. The system model is developed parametrically with respect to the bandwidth, polynomial order, signal class and predictor length. Two classes of signals, deterministic and random are analyzed and bounds on the performance of the deterministic linear predictor are established. A family of six pole Butterworth filters are used as presample filters in …

Interactive Ellpack, Wayne R. Dyksen, Calvin J. Ribbens

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 …

The Costs And Benefits Of A Teaching Laboratory For The Operating Systems Course, Douglas E. Comer

Department of Computer Science Technical Reports

No abstract provided.

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.

Show And Tell User's Manual, Peter Mclain, Takayuki Dan Kimura

All Computer Science and Engineering Research

The purpose of this report is to introduce essential features of the Show and Tell Language system to those computer users who are already familiar with some high-level programming language such as FORTRAN, BASIC or PASCAL. This manual is not intended for school children. Some familiarity with the Macintosh user interface and the MacPaint application program is assumed. It is also assumed that the Show and Tell application program disk and the Sample program are available to the reader. The basic programming concepts in Show and Tell are introduced in Chapter Three. The reader may find it easer to start …

A Systolic Parsing Algorithm For A Visual Programming Language, Adam W. Bojanczyk, Takayuki Dan Kimura

All Computer Science and Engineering Research

In this paper we consider a problem of parsing a two-dimensional visual programming language Show and Tell on a two-dimensional array of processors. A program in Show and Tell is a bit-mapped, two-dimensional pattern satisfying a certain set of grammatical rules. The pattern consists of partially ordered set of rectilinear boxes and arrows distributed over the space of nxn pixel area. The corresponding directed graph, the box graph, where boxes are nodes and arrows are directed edges, may not have a cycle in a Show and Tell program. The cycle detection is the most computationally intensive stage of the parsing …

Computing The Largest Empty Rectangle, B. Chazelle, R. L. Drysdale, D. T. Lee

Dartmouth Scholarship

We consider the following problem: Given a rectangle containing N points, find the largest area subrectangle with sides parallel to those of the original rectangle which contains none of the given points. If the rectangle is a piece of fabric or sheet metal and the points are flaws, this problem is finding the largest-area rectangular piece which can be salvaged. A previously known result [13] takes $O(N^2 )$ worst-case and $O(N\log ^2 N)$ expected time. This paper presents an $O(N\log ^3 N)$ time, $O(N\log N)$ space algorithm to solve this problem. It uses a divide-and-conquer approach similar to the ones …

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.

An Architecture For A Local Network Providing Multiple Supercomputer Access, Dan Cristian Marinescu, Vernon J. Rego, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

The Ellpack Performance Evaluation System, John P. Bonomo, Wayne R. Dyksen, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Analysis Of A Class Of Real-Time Control Systems, Dan Cristian Marinescu

Department of Computer Science Technical Reports

No abstract provided.

Scheduling Protocols Based Upon Limited Contention Multiple Access, Dan Cristian Marinescu

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 …

The Pairwise Intersection Problem For Monotone Polygons, David B. Levine

Computer Science Technical Reports

Geometric intersection problems arise in a number of areas of computer science including graphics and VLSI design rule checking. Previous work has concentrated on solving the pairwise intersection problem for line segments and iso-oriented rectangles. This thesis extends that work by presenting efficient algorithms to solve the pairwise intersection problem for monotone polygons. For general segments, the problem has been solved in O(N+I)*logN) time using a sweeping line technique, where N is the number of segments and I is the number of intersections reported. We combine this technique with approaches taken to solve the iso-oriented rectangle problem to yield an …

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.

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 …