Digital Commons Network^™

Computing About Physical Objects, Chanderjit Bajaj, Christoph M. Hoffmann, Elias N. Houstis, John T. Korb, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Algorithms And Data Structures For An Expanded Family Of Matroid Intersection Problems, Greg N. Frederickson, Mandayam A. Srinivas

Department of Computer Science Technical Reports

No abstract provided.

Software Tools For Performance Evaluation Of Concurrent Processing, Rodrogo A. Obando

Electrical & Computer Engineering Theses & Dissertations

The development and use of software tools for performance evaluation of concurrent processing is presented in this thesis. The particular concurrent processing architecture proposed by Stoughton and Mielke is investigated. The modelling of this architecture is based on Petri net theory and it can be studied making use of circuit theory. Computation of lower bounds for Time Between Outputs (TBO) and Time Between Input and Output (TBIO) can be accomplished by using principles of circuit theory, among others. This new modelling needs to be deeply evaluated and studied. This evaluation and study is accomplished with the tools developed and presented …

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 …

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

Department of Computer Science Technical Reports

No abstract provided.

Reachability Graphs And Invariants For Stochastic High Level Petri Nets, Jing Dong, Dan C. Marinescu, Chuang Lin

Department of Computer Science Technical Reports

No abstract provided.

An M/Sm/1 View Of A Token Ring Queue, Vernon J. Rego, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Non Homogeneous Parallel Computations I. Synchronization Analysis Of Parallel Algorithms, Dan C. Marinescu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

On The Variance Of The External Path Length In A Binary Digital Trie, Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Ethernet Performance: Design And Implementation Study, Michael M. Chaney, Tachen L. Lo, Daniel C. St. Clair

Computer Science Technical Reports

General concepts concerning local area network designs, functions and topologies will be presented. Ethernet as a multipoint bus topology local area network will be presented in detail. The Carrier Sense Multiple Access/Collision Detect (CSMA/CD) method of fairly regulating access to the shared network bus is studied. The Ethernet Network in relation to the Open Systems Interconnect (OSI) is reviewed, but only the layers pertaining to Ethernet are discussed throughout the majority of the paper. The specifications as described by Xerox, Digital and Intel are presented to help the designer understand the network's physical limitations. Analytical models are used to predict …

Triangulating A Polygon In Parallel, Michael T. Goodrich

Department of Computer Science Technical Reports

No abstract provided.

On An Alternative Sum Useful In The Analysis Of Some Data Structures, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

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

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.

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.

Closed-Network Duals Of Multiques With Application To Token-Passing Systems, Vernon J. Rego, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

An Experimental Implementation Of The Tilde Naming System, Douglas E. Comer, Ralph E. Droms, Thomas P. Murtagh

Department of Computer Science Technical Reports

No abstract provided.

A Routing Algorithm For Three Stage Rearrangeable Clos Networks, Ralph W. Wilkerson

Computer Science Faculty Research & Creative Works

No abstract provided.

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.

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 Gradient Model Load Balancing Method, Frank C. H. Lin, Robert M. Keller

All HMC Faculty Publications and Research

A dynamic load balancing method is proposed for a class of large-diameter multiprocessor systems. The method is based on the "gradient model," which entails transferring backlogged tasks to nearby idle processors according to a pressure gradient indirectly established by requests from idle processors. The algorithm is fully distributed and asynchronous. Global balance is achieved by successive refinements of many localized balances. The gradient model is formulated so as to be independent of system topology.