Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network™

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 62101 - 62130 of 63018

Full-Text Articles in Entire DC Network

Macip Sources And Applications, Mark Sherman, Tim Maroney Jan 1986

Macip Sources And Applications, Mark Sherman, Tim Maroney

Computer Science Technical Reports

The MacIP set consists of three disks, all single-sided, MFS formatted. Two disks contain the Lisa Pascal/Lisa Assembler sources for the network libraries and application programs; the third disk contains the runnable applications along with an AppleTalk configured system. The current version by Tim Maroney fixes all reported bugs mentioned in the MacIP Technical Report and includes the TCP library and Telnet program.


Multiprocessor Scheduling With Practical Constraints, Kenneth Burton Donovan Jan 1986

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 Jan 1986

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, ESP0, is identical to the class of simple precedence grammars; ESP grammars with at most one ε-rule, ESP1, define a class of languages which properly includes the class of ESP0 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 Jan 1986

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 Jan 1986

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 …


Senior Honors Project, Kelly Dyksterhouse Jan 1986

Senior Honors Project, Kelly Dyksterhouse

Honors Theses

The Statistical Analysis Project is a computer program that interacts with a person to discover the type of statistical test that person should use. Essentially, this program is intended to assist students, faculty and researchers in choosing the correct statistical procedure to use in a particular situation. For example, there are many different types of tests a person can use to test the mean of data but each test is used in a different situation. This program will tell you which test to use based on the situation you give it. This project was started by Anika Forsblad in 1985.


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

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 …


Genesis Of An Expert System For Umr Degree Auditing, Ruth Sue Dare Jan 1986

Genesis Of An Expert System For Umr Degree Auditing, Ruth Sue Dare

Masters Theses

"This paper describes the features, design, and development of an expert system for degree auditing at the University of Missouri--Rolla. It summarizes artificial intelligence as it is known today while specifically addressing expert systems. It describes selected expert systems currently in existence.

The present audit procedure utilized at the University of Missouri--Rolla is discussed. A description is given of the design and development of an expert system, written in LISP, to conduct a degree audit. Finally there are concluding remarks which include an analysis of the system and a discussion of possible system enhancement"--Abstract, page ii.


Mica: Prototyping An Expert System Consultant, Joseph Howard Marchal Jan 1986

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 Data Structure For The Use Of Patterns In The Perceptual Ordering Of The Game Of Chess, Russ L. Hanna Jan 1986

A Data Structure For The Use Of Patterns In The Perceptual Ordering Of The Game Of Chess, Russ L. Hanna

Masters Theses

"It is well known that the way one perceives a problem can influence the difficulty of solving the problem in a profound way. In the case of computer chess playing programs, one finds that most programs perceive the game in much the same way. They are all based on Shannon's original proposal for chess playing programs. His approach was to generate all of the possible combinations of moves up to a certain number of plays and then a subset of all combinations to a deeper level thereafter. Each of these moves would then be evaluated as to its relative worth. …


A Computerized Audio-Visual Speech Model, Joaquin Alberto Vila Ruiz Jan 1986

A Computerized Audio-Visual Speech Model, Joaquin Alberto Vila Ruiz

Masters Theses

"This thesis describes an expert system able to animate (graphically) and reproduce (acoustically) a text in any language which uses the Latin alphabet. A rule editor has been developed to create and modify the set of letter-to-sound rules of the target language. A parser has been implemented to apply the set of rules and translate text-to-speech. Each phoneme has a unique sound and thus requires its particular positioning of the vocal organs which are displayed in two different projections: a front view and a profile cross view of a human face in synchronization with the output sounds of the speech …


The Application Of A Sequence Notation To The Design Of Systolic Computations, Rami Melhem, Conceltina Guerra Jan 1986

The Application Of A Sequence Notation To The Design Of Systolic Computations, Rami Melhem, Conceltina Guerra

Department of Computer Science Technical Reports

No abstract provided.


An Exact Analysis For Efficient Computation Of Random-Pattern Testability In Combinational Circuits, Sharad C. Seth, Bhargab B. Bhattacharya, Vishwani Agrawal Jan 1986

An Exact Analysis For Efficient Computation Of Random-Pattern Testability In Combinational Circuits, Sharad C. Seth, Bhargab B. Bhattacharya, Vishwani Agrawal

School of Computing: Conference and Workshop Papers

Experimental evidence shows that low testability in a typical circuit is much more likely due to poor observability than poor controllability. Thus, from theoretical and practical standpoints, it is important to develop an accurate model for observability computation. One such model, in terms of supergates, is proposed in the first part of this paper thus complimenting our earlier work. It is now possible to obtain exact random-pattern testability for each line in a circuit.

The second part of the paper analyzes the supegate structure of a circuit from a graph theoretic viewpoint. Finding a supergate is related to determining the …


Lsim User Manual, Roger D. Chamberlain Jan 1986

Lsim User Manual, Roger D. Chamberlain

All Computer Science and Engineering Research

Lsim is a gate/switch level digital logic similar. It enables users to model digital circuits both at the gate and switch level and incorporates features that support investigation of the simulation task itself. This user's manual describes the procedures used to specify a circuit to lsim and control the simulation of the circuit (i.e., specifying inputs vectors, running the simulation, and monitoring output signals).


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 Jan 1986

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 …


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

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


Structure Of A Rigid Smooth Space Curve, Chia-Hoang Lee Dec 1985

Structure Of A Rigid Smooth Space Curve, Chia-Hoang Lee

Department of Computer Science Technical Reports

No abstract provided.


Generation Of Configuration Space Obstacles I: The Case Of A Moving Sphere, Chanderjit Bajaj, Myung-Soo Kim Dec 1985

Generation Of Configuration Space Obstacles I: The Case Of A Moving Sphere, Chanderjit Bajaj, Myung-Soo Kim

Department of Computer Science Technical Reports

No abstract provided.


Site Recovery In Replicated Distributed Database Systems, Bharat Bhargava Dec 1985

Site Recovery In Replicated Distributed Database Systems, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.


Efficient Plane Sweeping In Parallel, Mikhail J. Atallah, Michael T. Goodrich Dec 1985

Efficient Plane Sweeping In Parallel, Mikhail J. Atallah, Michael T. Goodrich

Department of Computer Science Technical Reports

No abstract provided.


Fast Detection And Display Of Symmetry In Trees, Joseph Manning, Mikhail J. Atallah Dec 1985

Fast Detection And Display Of Symmetry In Trees, Joseph Manning, Mikhail J. Atallah

Department of Computer Science Technical Reports

No abstract provided.


Industrial Simulation With Animation, Edward T. Hammerand, Chung You Ho Dec 1985

Industrial Simulation With Animation, Edward T. Hammerand, Chung You Ho

Computer Science Technical Reports

This thesis examines and evaluates the new simulation language PCModel. Prior to the arrival of PCModel, simulation via computer typically resulted in pages of statistics compiled over the duration of the simulation. PCModel's approach is to simulate the model on the display before the user in real time. Additionally, user interaction is supported to allow changes to be made throughout the simulation run.

The evaluation of PCModel is accomplished through inspection of a pair of examples already simulated in a conventional simulation language. The examples show the relative strong and weak points of the language, as well as demonstrating how …


Research Note: Getting Graphic: Computer Graphics In Biochemistry, Wilmon B. Chipman Dec 1985

Research Note: Getting Graphic: Computer Graphics In Biochemistry, Wilmon B. Chipman

Bridgewater Review

No abstract provided.


Optimal Simulations Between Mesh-Connected Arrays Of Processors, S. Rao Kosaraju, Mikhail J. Atallah Nov 1985

Optimal Simulations Between Mesh-Connected Arrays Of Processors, S. Rao Kosaraju, Mikhail J. Atallah

Department of Computer Science Technical Reports

No abstract provided.


A Generalized Information Structure To Be Used In A Human-Factors Knowledge Base, Bruce J. Wachlin Nov 1985

A Generalized Information Structure To Be Used In A Human-Factors Knowledge Base, Bruce J. Wachlin

Theses and Dissertations

The purpose of this thesis is to design a generalized information structure that can be used in a human-factors knowledge base. The information structure will take into account the human factors requirements and the hardware characteristics of the system. In this thesis the design and implementation of several prototype systems of a generalized information structure to be used in a human-factors knowledge base are presented.


A Queueing Model For Token-Passing Computer Networks, Vernon J. Rego, Lionel M. Ni Nov 1985

A Queueing Model For Token-Passing Computer Networks, Vernon J. Rego, Lionel M. Ni

Department of Computer Science Technical Reports

No abstract provided.


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

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.


Stability Problems In Local Area Networks: A Qualitative Approach, Wojciech Szpankowski, Dan Marinsecu, Vernon J. Rego Nov 1985

Stability Problems In Local Area Networks: A Qualitative Approach, Wojciech Szpankowski, Dan Marinsecu, Vernon J. Rego

Department of Computer Science Technical Reports

No abstract provided.


On A Recurrence Equation Arising In The Analysis Of Conflict Resolution Algorithms, Wojciech Szpankowski Nov 1985

On A Recurrence Equation Arising In The Analysis Of Conflict Resolution Algorithms, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


Performance Evaluation Of Interval-Searching Conflict Resolution Algorithms, Wojciech Szpankowski Nov 1985

Performance Evaluation Of Interval-Searching Conflict Resolution Algorithms, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.