Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 11 of 11
Full-Text Articles in Computer Engineering
Comments On Proposed Transport Protocols, Anil Bhatia, James Sterbenz, Gurudatta M. Parulkar
Comments On Proposed Transport Protocols, Anil Bhatia, James Sterbenz, Gurudatta M. Parulkar
All Computer Science and Engineering Research
Over the last few years, a number of research groups have made considerable progress on the design of high speed networks- on the order of a few hundred Mbps to the few Gbps. The emphasis of this work has been on the design of packet switches and on the design of network access protocols. However, this work has not yet addressed the internetworking and transport level issues in the high speed internet. As part of our effort on the design of VHSI model, we considered the appropriateness of recently proposed transport protocols, NETBLT and VMTP, as candidates for the transport …
Relational Completeness Of Show And Tell Visual Programming Language, Takayuki Dan Kimura
Relational Completeness Of Show And Tell Visual Programming Language, Takayuki Dan Kimura
All Computer Science and Engineering Research
In this paper we present the database applications of the Show and Tell Language (STL) and demonstrate the relational completeness of the language. STL is a visual programming language designed for novice computer users who are not familiar with keyboarding. A program can be constructed by using only a pointing device, except for textual data entry. A program can be constructed by using only a pointing device, except for textual data entry. Various programming concepts such as subroutine, iteration, recursion, concurrency, exception, and so forth are represented by two-dimensional graphic patterns and icons. The language is used to test the …
A Graph Browser With Zoom And Roam For Allegro Common Lisp, Steve B. Cousins, J. Andrew Fingerhut
A Graph Browser With Zoom And Roam For Allegro Common Lisp, Steve B. Cousins, J. Andrew Fingerhut
All Computer Science and Engineering Research
This report describes an object-oriented tool that has been developed for viewing graphs on a Macintosh II computer using Allegro Common Lisp. The tool is useful for visualizing data which can be represented in tree or graph form. The graphs can be viewed for far away to get a global view, and from close up so that the labels on the vertices can be discerned. Scrolling can be performed at a nearly infinite number of resolutions, and a search feature makes it easy to find any node rapidly. Although the 'information space' on which the graph is logically plotted is …
A Parallel Distributed Approach To Parsing Natural Language Deterministically, Stan C. Kwasny
A Parallel Distributed Approach To Parsing Natural Language Deterministically, Stan C. Kwasny
All Computer Science and Engineering Research
The Determinism Hypothesis (Marcus, 1980) has given rise to much debate. The hypothesis makes explicit the idea that Natural Language interpretation need not depend in any fundamental way on the use of pseudo-parallelism or backtracking. We are exploring the consequences of this hypothesis in attempting to develop approaches to parsing which integrates current work in parallel distributed adaptive networks. We follow the basic approach of "Wait-and-See" parsing (WASP) which has shown the Natural Language interpretation of all but some varieties of "garden-path" sentences can be deterministically performed using a stack, a buffer for sentence constituents, and partitioned packets of rules. …
Using A Partial Order And A Metric To Analyze A Recursive Trace Set Equation, Jan Tijmen Udding, Tom Verhoeff
Using A Partial Order And A Metric To Analyze A Recursive Trace Set Equation, Jan Tijmen Udding, Tom Verhoeff
All Computer Science and Engineering Research
In Trace Theory the notion of a process is defined in terms of a set of finite-length traces over an alphabet. These processes are used as the semantics for a program notation. The program text for a recursive component naturally gives rise to an equation over trace sets. This paper takes two approaches at the analysis of that equation. The first approach is based on a partial order and it concentrates on the projection operator for processes. This yields a condition under which the greatest solution of that equation can be approximated by iteration. The second approach introduces a metric …
Parallel Simulated Annealing, Roger D. Chamberlain, Mark N. Edelman, Mark A. Franklin, Ellen E. Witte
Parallel Simulated Annealing, Roger D. Chamberlain, Mark N. Edelman, Mark A. Franklin, Ellen E. Witte
All Computer Science and Engineering Research
Since the paper by Kirkpatrick, Gelatt and Vecchi in 1983, the use of Simulated Annealing (SA) in solving combinatoric optimization problems has increased substantially. The SA algorithm has been applied to difficult problems in the difficult problems in the digital design automation such as cell placement and wire routing. While these studies have yielded good or near optimum solutions, they have required very long computer execution times (hours and days). These long times, coupled with the recent availability of the number of commercial parallel processors, has prompted the search for parallel implementations of the SA algorithm. The goal ahs been …
Performance Models For Noahnet, Gurudatta M. Parulkar, Adarshpal S. Sethi, David J. Farber
Performance Models For Noahnet, Gurudatta M. Parulkar, Adarshpal S. Sethi, David J. Farber
All Computer Science and Engineering Research
Noahnet is an experimental flood local area network with features such as high reliability and high performance. Noahnet uses a randomly connected graph topology with four to five interconnections per node and a flooding protocol to route messages. In Noahnet flooding, the routing of a message from a source to the destination node is a two step process: flooding-growth and flooding-contraction. During the growth of flooding, the message propagates to every node which is not occupied with a message and is reachable from the source node. During the contraction of flooding, the nodes that became occupied during the growth of …
Hierarchical Discrete-Event Simulation On Hypercube Architecture, Roger D. Chamberlain, Mark A. Franklin
Hierarchical Discrete-Event Simulation On Hypercube Architecture, Roger D. Chamberlain, Mark A. Franklin
All Computer Science and Engineering Research
This paper presents model of hierarchical discrete-event simulation algorithm running on a hypercube architecture. We assume a static allocation of system components to processors in the hypercube. We also assume a global clock algorithm, with an event-based time increment. Following development of the performance model, we describe an application of the model in the area of digital systems simulation. Hierarchical levels included are gate level (NAND, NOR, and NOT gates) and MSI level (multiplexors, shift registers, etc.). Example values (gathered from simulations running on standard von Neumann architectures) are provided at the model inputs to show the effect of different …
Lsim2 User's Manual, Roger D. Chamberlain, Mark N. Edelman
Lsim2 User's Manual, Roger D. Chamberlain, Mark N. Edelman
All Computer Science and Engineering Research
Lsim2 is gate/switch-level digital logic simulator. It enables users to model digital circuits both at the gate and switch level and incorporates features the support investigation of the simulation task itself. Lsim2 is an augmented version of the original lsim* with the addition of several new MSI-type components models. This user's manual describes procedures for specifying a circuit in lsim2, mechanisms for controlling the simulation, and approaches to modeling systems.
Automatic Interface Generations From Grammar Specifications, Steve B. Cousins
Automatic Interface Generations From Grammar Specifications, Steve B. Cousins
All Computer Science and Engineering Research
This paper presents a method for automatically generating user interfaces to programs. All possible legal strings of input to a moderately interactive program, taken together, specify the input language of that program. A grammar for such a language is fundamentally knowledge about the language, and that knowledge can be used to assist the program's user in constructing legal program input. The set of words which can appear next in an input sentence, the 'Next set', is defined and a technique for calculating it with a modified version of Prologs's Definite Clause Grammar parser is given. One type of interface this …
Evaluation Of 3d Voxel Rendering Algorithms For Real-Time Interaction On A Simd Graphics Processor, Don Schreiter, John B. Zimmerman
Evaluation Of 3d Voxel Rendering Algorithms For Real-Time Interaction On A Simd Graphics Processor, Don Schreiter, John B. Zimmerman
All Computer Science and Engineering Research
The display of three-dimensional medical data is becoming more common, but current hardware and image rendering algorithms do not generally allow real-time interaction with the image by the user. Real-time interactions, such as image rotation, utilize the motion processing capabilities of the human visual system, allowing a better understanding of the structures being imaged. Recent advances in general purpose graphics display equipment could make real-time interaction feasible in clinical setting. We have evaluated the capabilities of one type of advanced display architecture, the PIXAR Imaging Computer, for real-time interaction while displaying three-dimensional medical data as two-dimensional projections. It was discovered …