Digital Commons Network^™

Reliability And Throughput Analysis Of A Concatenated Coding System, Robert H. Deng, Daniel J. Costello

Research Collection School Of Computing and Information Systems

The performance of a concatenated coding scheme for error control in ARQ systems is analyzed for both random error and burst-error channels. In particular, the probability of undetected error and the system throughput are calculated. In this scheme, the inner code is used for both error correction and error detection, and the outer code is used for error detection only. Interleaving/deinterleaving of the outer code is assumed. A retransmission is requested if either the inner code or the outer code detects the Presence of errors. Various coding examples are considered. The results show that concatenated coding can provide extremely high …

An Expert System Controlling An Adaptable Distributed Data Base System, Bharat Bhargava, John Riedl, Detlef M. Weber

Department of Computer Science Technical Reports

No abstract provided.

An Experimental Analysis Of Replicated Copy Control During Site Failure And Recovery, Bharat Bhargava, Paul Noll, Donna Sabo

Department of Computer Science Technical Reports

No abstract provided.

Concurrent Checkpointing And Recovery In Distributed Systems, Pei-Jyun Leu, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.

The Evolution Of Text Formatting Languages, Dirk Herr-Hoyman

Masters Theses

Text, as seen in books and magazines, can take on three forms: string, graphic (two-dimensional), and image (digitized pictures). Text formatting processes text into a representation suitable for printing. Since a printer is really a computer, this representation is machine code for the printer. ASCII is one such code.

Six historically significant text formatting languages are surveyed: Runoff, Troff, TeX, Bravo, Scribe, and Postscript. The emphasis is on the text types available and the code generated. The main evolutionary forces are the changes in printers. Comparisons are made with programming languages.

Each of the six languages has ASCII as its …

Implementation Of Case (Common Application Service Element) And Application Interface For Manufacturing Automation Protocol, Amit Limaye

Theses

In 1980 General Motors formed a task force committee to explore solution to incompatibility of computer network on machine floor which control programmable devices, Robots etc. After receiving the various existing standards, the committee came up with first draft of Manufacturing & Automation Protocol (MAP 1.0) in April 1984. Further reviews resulted in different versions of MAP standards and presently, efforts are being made to come up with MAP 3.0.

MAP enables information to be readily transferred between computers, people and equipment and thus truely interconnecting open systems. The ultimate goal of these efforts is to be able to produce …

Designing Networks With Compact Routing Tables Available In A Journal, Greg N. Frederickson, Ravi Janardan

Department of Computer Science Technical Reports

No abstract provided.

A Model For Adaptable Concurrency Control, Bharat Bhargava, John Riedl

Department of Computer Science Technical Reports

No abstract provided.

Algebraic Curves, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.

A Representation For Serial Robotic Tasks, Barry Ross Fox, Arlan R. Dekock

Computer Science Technical Reports

The representation for serial robotic tasks proposed in this thesis is a language of temporal constraints derived directly from a model of the space of serial plans. It was specifically designed to encompass problems that include disjunctive ordering constraints. This guarantees that the proposed language can completely and, to a certain extent, compactly represent all possible serial robotic tasks. The generality of this language carries a penalty. The proposed language of temporal constraints is NP-Complete. Specific methods have been demonstrated for normalizing constraints posed in this language in order to make subsequent sequencing and analysis more tractable. Using this language, …

Triangulating A Polygon In Parallel, Michael T. Goodrich

Department of Computer Science Technical Reports

No abstract provided.

Program Development For Computer Simulation And Analysis For Multiplex Chromatography, Barbara Pawliszyn

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

In this report, the programs developed for the analysis of simulated data in multiplex chromatography are written in the ASYST language. The integration of the program modules into a menu-driven, user-friendly prototype program is outlined. The program is developed to allow for flexibility and easy upgrading of the code.

This report examines the calculation procedures potentially useful in multiplex chromatography. Analysis of the mutliplex chromatograms is done by three mathematical methods, Cross-Correlation, Hadamard Transform and Fast Fourier Transform. The effects of experimental length/chromatogram length and decision sequences on correlation noise present in a single chromatogram, are discussed. As the number …

Shamat: A Matrix Manipulation Program, Shahriyar Dadkhah

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

This report is both a users guide and a programmers manual for running and modifying the program SHAMAT, an interactive matrix calculator. The program is written in Turbo Pascal version 3.0 for MS-DOS computers. This software enables the user to type in matrix equations for solving statistical problems such as multiple regression, analysis of variance, etc. All matrix operations necessary for linear models analysis are included in this program. Since each operation uses a separate subroutine, program enhancement, modification and updating is demonstrated to be easy.

Decompositions Of Objects Bounded By Algebraic Curves, Chanderjit Bajaj, Myung-Soo Kim

Department of Computer Science Technical Reports

No abstract provided.

Three Dimensional Graphics Software In Interactive Ellpack, John P. Bonomo, Wayne R. Dyksen

Department of Computer Science Technical Reports

No abstract provided.

A Comparison Of Two Evidential Reasoning Schemes, Sunny Lee

Department of Computer Science Technical Reports

No abstract provided.

Planar Linear Arrangements Of Outerplanar Graphs, Greg N. Frederickson, Susanne E. Hambrusch

Department of Computer Science Technical Reports

No abstract provided.

Distributed Systems Based Upon A Functional Communication Model With A Timed Token Protocol, Dan C. Marinescu

Department of Computer Science Technical Reports

No abstract provided.

Applying Ai Techniques To Program Optimization For Parallel Computers, Ko-Yang Wang, Dennis Gannon

Department of Computer Science Technical Reports

No abstract provided.

Cascading Divide-And-Conquer: A Technique For Designing Parallel Algorithms, Mikhail J. Atallah, Richard Cole, Michael T. Goodrich

Department of Computer Science Technical Reports

No abstract provided.

Some Experiments With Tcp/Ip Protocols Over An X.25 Network, John T. Korb, Craig E. Wills

Department of Computer Science Technical Reports

No abstract provided.

Parallel And Vector Problems On The Flex/32, H S. Mcfaddin, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

A Software Metrics Survey, S. D. Conte, Herbert E. Dunsmore, V. Y. Shen, W. M. Zage

Department of Computer Science Technical Reports

No abstract provided.

Meta-Level Programming: A Compiled Approach, Hamid Bacha

Electrical Engineering and Computer Science - Technical Reports

There has been some intense research lately focused on the area of meta-level inference systems. In logic programming, the limitations of Prolog are widely recognized and a meta-level approach has been suggested. Unfortunately, only meta-interpreters have been considered so far. Moreover, these meta-interpreters are often themselves written on top of a Prolog interpreter. These cascaded layers of interpreters result in an enormous slow down, rendering the resulting system practically useless for all but a small number of toy applications. This paper will report on the implementation of a fast incremental metaProlog compiler. In the process, it will explore some of …

Lily-A Generator For Compiler Frontends, Thomas J. Sager

Computer Science Technical Reports

In this paper, LILY, a generator for compiler frontends is described. LILY uses a generator of minimal perfect hash functions, MPHF , to create small fast compilers.

An Attribute-Grammar Implementation Of Government-Binding Theory, Nelson Correa

Electrical Engineering and Computer Science - All Scholarship

The syntactic analysis of languages with respect to Government binding (GB) grammar is a problem that has received relatively little attention until recently. This paper describes an attribute grammar specification of the Government binding theory. The paper focuses on the description of the attribution rules responsible for determining antecedent trace relations in phrase-structure trees, and on some theoretical implications of those rules for the GB model. The specification relies on a transformation-le variant of Government "binding theory, briefly discussed by Chomsky (1981), in which the rule move-a is replaced by an interpretive rule. Here the interpretive rule is specified by …

Proof And Intuition, Michael Detlefsen

ACMS Journal 2004

This paper aims to give a clear exposition of two critiques of logicism. The intuitionist, Brouwer, is best known for rejecting the law of the excluded middle (his "special critique.") The paper argues that Brouwer's "general critique" is deeper and more extensive than this. That is, Brouwer is arguing that mathematical knowledge requires a kind of direct mathematical experience, analogous to sensory experience and this cannot be attained simply by linguistic operations independently of experience. It also discusses Poincare's critiques - that there is a huge difference between genuine mathematical insight and an ability to logically manipulate mathematical truths and …

Nova University Doctor Of Education In Computer Education [1987], Nova University

Abraham S. Fischler College of Education and School of Criminal Justice College Archive

No abstract provided.

The Computer As A Collection Management Tool, Suzanne B. Mclaren, Hugh H. Genoways, Duane A. Schlitter

University of Nebraska State Museum: Mammalogy Papers

Since the mid-1960s, discussion of computer use for information retrieval in museum collections has usually focused on research potential. Much attention has been given to the idea of networking and the ability to access data across great distances. However, the potential for collection management usage has also proven to be a legitimate rationale for computerization. Numerous aspects of collection management are discussed for which the computer may be employed. Topics include creating cross-reference files, updating taxonomic and geographic information, pinpointing mismatched specimens, locating lost and uncataloged material, controlling loan procedures, producing accession files for insurance purposes, curating all or part …

Training For The Airland Battle With Modeling And Simulation On The Microcomputer, David Dean Holmes

Masters Theses

"This paper describes a methodology for modifying a combat training simulation model to include a comprehensive data structure and computer software, to allow the model to be implemented on a microcomputer. It begins by developing a topology for combat simulation models and proceeds to define a data structure suitable for describing military units and facilitating the varied aspects of the simulation. An eclectic approach to the development of the model and the implementing software is followed throughout. Appropriate aspects of a number of models are incorporated into a single model suitable for training military commanders and their staffs. PASCAL, a …