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

Physical Sciences and Mathematics Commons

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

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 56671 - 56700 of 57952

Full-Text Articles in Physical Sciences and Mathematics

Parallel Simulated Annealing, Roger D. Chamberlain, Mark N. Edelman, Mark A. Franklin, Ellen E. Witte Apr 1988

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 Apr 1988

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 …


Algorithms For Planar Geometric Models, Chanderjit Bajaj, Myung-Soo Kim Mar 1988

Algorithms For Planar Geometric Models, Chanderjit Bajaj, Myung-Soo Kim

Department of Computer Science Technical Reports

No abstract provided.


Potential Evaluation Directions For Ellpack, John R. Rice Mar 1988

Potential Evaluation Directions For Ellpack, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Exploiting Parallelism Across Program Execution: A Unification Technique And Its Analysis, Vernon J. Rego, Aditya P. Mathur Mar 1988

Exploiting Parallelism Across Program Execution: A Unification Technique And Its Analysis, Vernon J. Rego, Aditya P. Mathur

Department of Computer Science Technical Reports

No abstract provided.


On The Effects Of Synchronization In Parallel Computing, Dan C. Marinescu, John R. Rice Mar 1988

On The Effects Of Synchronization In Parallel Computing, Dan C. Marinescu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Sequences And Digital Trees: A Symbiosis, Wojciech Szpankowski Mar 1988

Sequences And Digital Trees: A Symbiosis, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


Motion Estimation Of A Rigid Planar Patch: A Robust Computational Technique, Chia-Hoang Lee Mar 1988

Motion Estimation Of A Rigid Planar Patch: A Robust Computational Technique, Chia-Hoang Lee

Department of Computer Science Technical Reports

No abstract provided.


Deduction Of A Functional Dependency From A Set Of Functional Dependencies, James M. Richardson, Daniel C. St. Clair Mar 1988

Deduction Of A Functional Dependency From A Set Of Functional Dependencies, James M. Richardson, Daniel C. St. Clair

Computer Science Technical Reports

This paper describes an algorithm called the Deduction Tracing Algorithm (DTA) which utilizes basic properties of functional dependencies from database systems and a modification of a tree search algorithm from artificial intelligence. The algorithm takes a set of functional dependencies, F, along with a specific functional dependency L → R as input and produces a list of functional dependencies from F that can be used to deduce L → R. The resulting algorithm is easily automated to provide relational database users with a tool for organizing their queries.


Intensity Blending Of Computer Image Generation-Based Displays, Elizabeth Scheppler Reidelberger, Daniel C. St. Clair Mar 1988

Intensity Blending Of Computer Image Generation-Based Displays, Elizabeth Scheppler Reidelberger, Daniel C. St. Clair

Computer Science Technical Reports

State-of-the-art combat simulators require a 360 degree field of view, allowing the pilot and radar intercept officer to have the same visibility in the simulator that they would experience in the aircraft. The sky/earth display must be computer - generated and displayed with a minimum of two channels to provide the most realistic display possible. The two channels of display come together in the dome, forming an equator, that must be as indiscernible to the aircrew as possible. To accomplish this, an algorithm has been developed for controlling the video output which makes the two separate channel displays appear as …


A Lexical Extension Of Montague Semantics, William C. Purdy Mar 1988

A Lexical Extension Of Montague Semantics, William C. Purdy

Electrical Engineering and Computer Science - Technical Reports

Montague's linguistic theory provides a completely formalized account of language in general and natural language in particular. It would appear to be especially applicable to the problem of natural language understanding by computer systems. However the theory does not deal with meaning at the lexical level. As a result, deduction in a system based on Montague semantics is severely restricted. This paper considers lexical extension of Montague semantics as a way to remove this restriction. Representation of lexical semantics by a logic program or semantic net is complex. An alternative representation, called a semantic space, is described. This alternative lacks …


A Schwarz Splitting Variant Of Cubic Spline Collocation Methods For Elliptic Pdes, Elias N. Houstis, John R. Rice, E.A. Vavalis Mar 1988

A Schwarz Splitting Variant Of Cubic Spline Collocation Methods For Elliptic Pdes, Elias N. Houstis, John R. Rice, E.A. Vavalis

Department of Computer Science Technical Reports

No abstract provided.


Hierarchical Discrete-Event Simulation On Hypercube Architecture, Roger D. Chamberlain, Mark A. Franklin Mar 1988

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 …


Higher Level Modeling In Resqme, Robert F. Gordon Ph.D., Kurtiss J. Gordon Feb 1988

Higher Level Modeling In Resqme, Robert F. Gordon Ph.D., Kurtiss J. Gordon

Faculty Works: MCS (1984-2023)

RC 13554 (#60544)

The RESearch Queueing Package Modeling Environment (RESQME) is a graphical workstation environment for iteratively constructing, running and analyzing models of resource contention systems. It is built on top of the RESearch Queueing Package (RESQ) which provides the functionality to evaluate extended queueing networks. In this paper we describe the high-level building component design for RESQME. The modeler is provided with tools to create his own icons and to associate them with submodels. He then uses ilicsc building blocks to construct his model. This capability extends the funtlaiiicnlal building blocks of RESQ and allows the user to create …


Efficient Interprocess Communication Using Shared Memory, Douglas E. Comer, Steven B. Munson Feb 1988

Efficient Interprocess Communication Using Shared Memory, Douglas E. Comer, Steven B. Munson

Department of Computer Science Technical Reports

No abstract provided.


A Note On Two Simulation Benchmarks, Vernon J. Rego Feb 1988

A Note On Two Simulation Benchmarks, Vernon J. Rego

Department of Computer Science Technical Reports

No abstract provided.


A Tool For Integrating Conceptual Schemas And User Views, Amit P. Sheth, James A. Larson, Aloysius Cornelio, Shamkant B. Navathe Feb 1988

A Tool For Integrating Conceptual Schemas And User Views, Amit P. Sheth, James A. Larson, Aloysius Cornelio, Shamkant B. Navathe

Kno.e.sis Publications

An interactive tool has been developed to assist database designers and administrators (DDA) in integrating schemas. It collects the information required for integration from a DDA, performs essential bookkeeping, and integrates schemas according to the semantics provided. The authors present the capabilities of this tool by discussing the integration methodology and the user interface of the tool.


Implementation Of Cross Intersection Between Triangular Surfaces, Chaman Sabharwal, Thomas G. Melson Feb 1988

Implementation Of Cross Intersection Between Triangular Surfaces, Chaman Sabharwal, Thomas G. Melson

Computer Science Faculty Research & Creative Works

No abstract provided.


An Inherently Parallel Large Grained Data Flow Environment, Roger E. Eggen, John R. Metzner Feb 1988

An Inherently Parallel Large Grained Data Flow Environment, Roger E. Eggen, John R. Metzner

Computer Science Faculty Research & Creative Works

A parallel programming environment based on data flow is described. Programming in the environment involves use with an interactive graphic editor which facilitates the construction of a program graph consisting of modules, ports, paths and triggers. Parallelism is inherent since data presence allows many modules to execute concurrently. The graph is executed directly without transformation to traditional representations. The environment supports programming at a very high level as opposed to parallelism at the individual instruction level.


Lsim2 User's Manual, Roger D. Chamberlain, Mark N. Edelman Feb 1988

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 Feb 1988

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 …


An Experimental Performance Analysis For The Rate Of Convergence Of 5-Point Star On General Domains, John R. Rice, Mo Mu Jan 1988

An Experimental Performance Analysis For The Rate Of Convergence Of 5-Point Star On General Domains, John R. Rice, Mo Mu

Department of Computer Science Technical Reports

No abstract provided.


Software Engineering Team Project Group Member Evaluations: Some Empirical Results, Herbert E. Dunsmore, David P. Moffett, Steven T. Ward Jan 1988

Software Engineering Team Project Group Member Evaluations: Some Empirical Results, Herbert E. Dunsmore, David P. Moffett, Steven T. Ward

Department of Computer Science Technical Reports

No abstract provided.


Concurrency Enhancement Through Program Unification: A Performance Analysis, Vernon J. Rego, Aditya P. Mathur Jan 1988

Concurrency Enhancement Through Program Unification: A Performance Analysis, Vernon J. Rego, Aditya P. Mathur

Department of Computer Science Technical Reports

No abstract provided.


An Experimental Performance Analysis For The Rate Of Convergence On Collocation On General Domains, Mo Mu, John R. Rice Jan 1988

An Experimental Performance Analysis For The Rate Of Convergence On Collocation On General Domains, Mo Mu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


A Linear-Processor Algorithm For Depth-First Search In Planar Graphs, Gregory E. Shannon Jan 1988

A Linear-Processor Algorithm For Depth-First Search In Planar Graphs, Gregory E. Shannon

Department of Computer Science Technical Reports

No abstract provided.


A Parallel Spline Collocation-Capacitance Method For Elliptic Parallel Differential Equations, C. C. Christara, Elias N. Houstis, John R. Rice Jan 1988

A Parallel Spline Collocation-Capacitance Method For Elliptic Parallel Differential Equations, C. C. Christara, Elias N. Houstis, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Structure And Motion From Two Perspective Views Via Planar Patch, Chia-Hoang Lee Jan 1988

Structure And Motion From Two Perspective Views Via Planar Patch, Chia-Hoang Lee

Department of Computer Science Technical Reports

No abstract provided.


Comments On Mohr And Henderson's Path Consistency, Ching-Chih Han, Chia-Hoang Lee Jan 1988

Comments On Mohr And Henderson's Path Consistency, Ching-Chih Han, Chia-Hoang Lee

Department of Computer Science Technical Reports

No abstract provided.


The Development Of Context Sensitivity In The Midiforth Computer Music System, Bruno Degazio Jan 1988

The Development Of Context Sensitivity In The Midiforth Computer Music System, Bruno Degazio

Publications and Scholarship

This paper reports on the development in the MIDIFORTH computer music system of context-sensitive editing features, such as the ability to highlight MIDI events based on their position within a melodic or rhythmic pattern, and on pitch or other relationships to surrounding events. The software mechanism that implements this is discussed, and some examples of the musical desirability of such features are presented.