Digital Commons Network^™

A Reconstruction Of Context-Dependent Document Processing In Sgml, Allen Brown Jr., T. Wakayama, Howard A. Blair

Electrical Engineering and Computer Science - Technical Reports

SGML achieves a certain degree of context-dependent document processing through attributes and linking. These mechanisms are deficient in several respects. To address these deficiencies we propose augmenting SGML's LINK and ATTLISTconstructs with two new mechanisms, coordination and (rule-based) attribution. The latter can be used to specify the result of context-dependent processing in a uniform fashion while considerably increasing SGML's expressive power. We illustrate this enhanced power by sketching a specification of (the result of) document layout that can be encoded in SGML augmented with coordination and attribution.

Constructively Typed Timed Automata, J. F. Peters Iii

Electrical Engineering and Computer Science - Technical Reports

A new class of communicating automata called typed Timed lnput/Output Automata (tTAi/os) is introduced. A tTAi/o is a predicate automaton used for specifying and reasoning about real-time systems. The typing discipline suggested for predicate automata is in the tradition of Martin-Löf's constructive type theory. A type A is a proposition, which is defined when a prescription for constructing a proof of A is given. A fragment of Girard's linear logic is used in classifying state types. An illustration of the use of tTAi/os in specifying a light-controller is presented. An abstract program is extracted during a proof of an automaton …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 7, Number 8, November 1991, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

An Experimental Sequence Examining The Effect Of Task Type, Memory Condition, And Display Presentation Type On Performance Time And Error Rate, Using Columnar Table Versus Vertical Bar Graph Versus Line Graph, Suparna Das

Theses

A total of 126 subjects at various levels of school and a health related manufacturing firm participated in three experiments that compared Tables, Line graphs and Bar graphs forms of data presentation. The experiments were performed each consisting of a training task followed by answering some questions based on the presented material. The experimental series were presented to six groups. Group 1, 3, 5 viewed Line graphs, Tables or Bar graphs respectively while answering the questions while the other three groups answered questions based on memory of either Line graphs, Table or Bar graph presentation.

The independent variables were:

1. Memory …

Computer Vision, Descriptive Geometry, And Classical Mechanics, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.

How To Compute Offsets Without Self-Intersection, Ching-Shoei Chiang, Christoph M. Hoffmann, Robert E. Lynch

Department of Computer Science Technical Reports

No abstract provided.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 7, Number 7, October 1991, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

On The Question ‘Do We Need Identity?’, William C. Purdy

Electrical Engineering and Computer Science - Technical Reports

Sommers posed the question 'Do We Need Identity?' and answered in the negative. According to Sommers, the need for a special identity relation resulted from an arbitrary distinction between concept and object introduced by Frege and retained in modern predicate logic (MPL). This is reflected in the syntactic distinction between predicate and individual constant. Traditional formal logic (TFL) does not respect this distinction and, as a consequence, has no need for a special identity relation. But Sommers' position has not gained general acceptance. On the contrary, it has received considerable criticism. While it is conceded that TFL can express the …

Constrained-Latency Storage Access: A Survey Of Application Requirements And Storage System Design Approaches, Richard Staehli, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Applications with Constrained Latency Storage Access (CLSA) are those that have large storage needs and hard constraints on the amount of latency they can tolerate. Such applications present a problem when the storage technology that is cost effective and large enough cannot meet their latency constraints for demand fetching. Examples are found in the developing field of multimedia computing and, to a lesser extent, in real-time database literature. This paper examines the nature of timing constraints at the application-storage interface and defines a classification for both the synchronization constraints of the application and the latency characteristics of the storage system. …

Computer Simulation Techniques To Assess Bias And Precision In The Roving Creel Survey Estimator, David L. Wade

Biological Sciences Theses & Dissertations

Fisheries scientists use roving creel survey methods to estimate total catch and total effort of recreational fisheries. Bias in the roving creel estimators had been known to the scientific community, but it had not been quantified. I developed a roving-creel-survey computer simulation model to investigate the bias and precision of roving creel estimators, and estimated parameters for the model based on field observations from the blue crab (Callinectes sapidus) fishery of the Chesapeake Bay. The computer model was used to identify bias in roving-creel effort and catch estimators and to demonstrate survey methods that will reduce this bias. …

Domain Limitations And Interface Requirements For Expert Developed Knowledge Based Systems, Bernard Lee Lewis

Engineering Management & Systems Engineering Theses & Dissertations

The expanded use of graphical, case-based and object oriented techniques in expert systems creation has made it more practical for domain experts to develop their own applications. This thesis focuses on the elements necessary in an expert/developer interface and looks at various forms and techniques that exemplify such an approach. The spreadsheet metaphor is used for an interface or managed set of interfaces that a domain expert can use in building his own expert system or prototype. criteria are established for such interfaces and recent commercial offerings that make expert-created knowledge-bases more practical are reviewed for techniques that qualify. Approaches …

Cascading Space Efficient Variation Of The Lzw Algorithm And Arithmetic Coding, Shobha Raj

Theses

Two known compression algorithms appropriate for communication are LZW and the Arithmetic Coding method. Both are adaptive and require no extra communication from the encoder to the decoder. Here we have considered a space efficient variation of the LZW algorithm which achieves better compression.

We present a scheme to cascade the space efficient variation of the LZW algorithm with Arithmetic Coding into a space efficient data compression algorithm which achieves a higher compression ratio and is appropriate for communication.

Stability Criteria For Yet Another Multidimensional Distributed System, Leonidas Georgiadis, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Shortest Path Computations In S-Graphs, Greg N. Frederickson, Susanne E. Hambrusch, Hung-Yi Tu

Department of Computer Science Technical Reports

No abstract provided.

Fault-Tolerant Parallel Matrix Multiplication With One Iteration Fault Detection Latency, Chul-Eui Hong, Bruce M. Mcmillin

Computer Science Technical Reports

The checksum technique is a low cost method to detect errors in matrix operations performed by processor arrays. The fault detection of this method is done only at problem termination, so this method is not an effective fault tolerance technique for large scale matrix multiplication.

This paper presents a new algorithm, the ID algorithm, which minimizes the fault-detection latency, In the ID algorithm, a fault is detected as soon a5 the fault occurs instead of at problem termination. For 112 processors, the fault-latency time of the ID algorithm is l/11 of that of checksum algorithm with a run-time penalty of …

Composite Stock Cutting Through Simulated Annealing, Pipatpong Poshyanonda, Cihan H. Dagli

Computer Science Technical Reports

This paper explores the use of Simulated Annealing as an optimization technique for the problem Composite Material Stock Cutting. The shapes are not constrained to be convex polygons or even regular shapes. However, due to the composite nature of the material, the orientation of the shapes on the stock is restricted. For placements of various shapes, we show how to determine a cost function, annealing parameters, and performance.

Composite Stock Cutting Through Simulated Annealing, Pipatpong Poshyanonda, Cihan H. Dagli

Computer Science Technical Reports

This paper explores the use of Simulated Annealing as an optimization technique for the problem Composite Material Stock Cutting. The shapes are not constrained to be convex polygons or even regular shapes. However, due to the composite nature of the material, the orientation of the shapes on the stock is restricted. For placements of various shapes, we show how to determine a cost function, annealing parameters, and performance.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 7, Number 6, September 1991, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Reuse And Productivity In Integrated Computer-Aided Software Engineering: An Empirical Study, Rajiv D. Banker, Robert J. Kauffman

Research Collection School Of Computing and Information Systems

Growing competition in the investment banking industry has given rise to increasing demand for high functionality software applications that can be developed in a short period of time. Yet delivering such applications creates a bottleneck in software development activities. This dilemma can be addressed when firms shift to development methods that emphasize software reusability. This article examines the productivity implications of object and repository-based integrated computer-aided software engineering (ICASE) software development in the context of a major investment bank's information systems strategy. The strategy emphasizes software reusability. Our empirical results, based on data from 20 projects that delivered software for …

Computer Viruses And Ethics, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.

Explicit Clock Temporal Logic In Timing Constraints For Real-Time Systems, S. Ramanna, J. F. Peters Iii

Electrical Engineering and Computer Science - Technical Reports

A form of explicit clock temporal logic (called TLrt) useful in specifying timing constraints on controller actions, a real-time database (rtdb) items, and constraints in a real-time constraint base (rtcb), is presented. Timing as well as other forms of constraints are stored in the rtcb. A knowledge-based approach to ensure the integrity of information in an rtdb is given. The rtcb is realized as a logic program called Constrainer, which is a historyless integrity checker for a real-time database. The consistency and integrity issues for an rtcb and rtdb are investigated. The formal bases for a temporally complete rtdb and …

Multi Cast Routing In Unreliable Networks, Martina Schollmeyer, Bruce M. Mcmillin

Computer Science Technical Reports

The efficient routing of messages in a multicomputer interconnection network is the key to the performance of such a network. Multicast communication refers to the delivery of a message from a source node to several destination nodes. Although multicast is highly desirable for many applications, it is not directly supported in most multicomputer architectures. This paper examines existing algorithms for multicast routing in multicomputer networks and groups them into a number of categories such as multicast trees, multicast paths, multicast stars, etc. These algorithms are evaluated in terms of deadlock handling, adaptability and suitability for wormhole routing. Wormhole routing is …

Collision Detection And Analysis In A Physically Based Simulation, William J. Bouma, George Vanĕček

Department of Computer Science Technical Reports

No abstract provided.

Type Reconstruction For Coercion Polymorphism (Technical Summary), Ryan Stansifer, Dan Wetklow

Department of Computer Science Technical Reports

No abstract provided.

Selective Inheritance And Overriding In Statically-Typed Object-Oriented Languages, Ryan Stansifer, Dan Wetklow

Department of Computer Science Technical Reports

No abstract provided.

Constructing Real-Time Systems From Temporal I/O Automata, J. F. Peters Iii, S. Ramanna

Electrical Engineering and Computer Science - Technical Reports

A new class of communicating automata called Temporal Input/Output Automata (TAi/os) is introduced. A TAi/o is a predicate automaton used to specify real-time systems. The specification provided by a TAi/o includes state predicates with proof expressions and abstract program syntax as attributes. An abstract program is extracted during a constructive proof of the specification using the proof expressions. A TAi/o specification also includes hard, real-time constraints on program behavior. The predictability of deterministic, temporally complete TAi/o is investigated. The formulation of real-time system transductions and transduction rules for TAi/os in explicit clock temporal logic is given. An illustration of the …

Philco: Some Recollections Of The Philco Transac S-2000, Saul Rosen

Department of Computer Science Technical Reports

No abstract provided.

Smili-Visualization Of Asynchronous Massively Parallel Programs, Rashi Khanna, Bruce M. Mcmillin

Computer Science Technical Reports

A visualization model has been developed to analyse the performance of a massively parallel algorithm. Most visualization tools that have been developed so far for performance analysis are based generally on individual processor information and communication patterns (eg. processor load, message traffic etc.). These tools, however, are inadequate for massively parallel computations. It is difficult to comprehend the visual information for many processors. The model, SMil...l (Scientific visualization in Multicomputing for Interpretation of Large amounts of Information), addresses this problem by using abstract representations to attain a composite picture which gives better insight to the behavior of the algorithm. Chernoff's …

Comparison Of Three Axiomatic Systems For Csp, Hanan Lutfiyya, Bruce M. Mcmillin

Computer Science Technical Reports

Currently software engineering practices use relatively few formal methods. However, formal methods can be used to find errors earlier in the software cycle and hence reduce software cost. One useful formal method is program verification. The axiomatic approach to program verification uses assertions to characterize properties of program variables and relationships between them at various stages of program execution. In order to verify these assertions, axioms or inference rules are needed for each statement as well as some statement-independent inference rules. The message passing and nondeterminism of a distributed programming language present special difficulties. This paper examines and compares three …

Smili-Visualization Of Asynchronous Massively Parallel Programs, Rashi Khanna, Bruce M. Mcmillin

Computer Science Technical Reports

A visualization model has been developed to analyse the performance of a massively parallel algorithm. Most visualization tools that have been developed so far for performance analysis are based generally on individual processor information and communication patterns (eg. processor load, message traffic etc.). These tools, however, are inadequate for massively parallel computations. It is difficult to comprehend the visual information for many processors. The model, SMil...l (Scientific visualization in Multicomputing for Interpretation of Large amounts of Information), addresses this problem by using abstract representations to attain a composite picture which gives better insight to the behavior of the algorithm. Chernoff's …