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

Digital Commons Network™

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

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 61381 - 61410 of 63040

Full-Text Articles in Entire DC Network

Athena: A Knowledge Base System For //Ellpack, C. E. Houstis, Elias N. Houstis, M. Katzouraki, T. S. Papatheodorou, John R. Rice Feb 1990

Athena: A Knowledge Base System For //Ellpack, C. E. Houstis, Elias N. Houstis, M. Katzouraki, T. S. Papatheodorou, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, February 1990, College Of Engineering And Computer Science, Wright State University Feb 1990

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, February 1990, 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.


//Ellpack: A Numerical Simulation Programming Environment For Parallel Mimd Machines, Elias N. Houstis, John R. Rice, N. P. Chrisochoides, H. C. Karathanasis, P. N. Papochiou, E. A. Vavalis, Ko Yang Wang Jan 1990

//Ellpack: A Numerical Simulation Programming Environment For Parallel Mimd Machines, Elias N. Houstis, John R. Rice, N. P. Chrisochoides, H. C. Karathanasis, P. N. Papochiou, E. A. Vavalis, Ko Yang Wang

Department of Computer Science Technical Reports

No abstract provided.


Towards Automatic Grid Generation Using Binary Space Partition Trees, George Vanecek Jan 1990

Towards Automatic Grid Generation Using Binary Space Partition Trees, George Vanecek

Department of Computer Science Technical Reports

No abstract provided.


Computational Complexity Of Geometric Symmetry Detection In Graphs, Joseph Manning Jan 1990

Computational Complexity Of Geometric Symmetry Detection In Graphs, Joseph Manning

Computer Science Technical Reports

Constructing a visually informative drawing of an abstract graph is a problem of considerable practical importance, and has recently been the focus of much investigation. Displaying symmetry has emerged as one of the foremost criteria for achieving good drawings. Linear-time algorithms are already known for the detection and display of symmetry in trees, outerplanar graphs, and embedded planar graphs. The central results of this paper show that for general graphs, however, detecting the presence of even a single axial or rotational symmetry is NP-complete. A number of related results are also established, including the #P-completeness of counting the axial or …


G1 Interpolation Using Piecewise Quadric And Cubic Surfaces, Chanderjit L. Bajaj Jan 1990

G1 Interpolation Using Piecewise Quadric And Cubic Surfaces, Chanderjit L. Bajaj

Department of Computer Science Technical Reports

No abstract provided.


An Abstract Data Model For The Idef0 Graphical Analysis Language, Gerald R. Morris, Thomas C. Hartrum, Mark A. Roth Jan 1990

An Abstract Data Model For The Idef0 Graphical Analysis Language, Gerald R. Morris, Thomas C. Hartrum, Mark A. Roth

AFIT Documents

IDEF0 is the United States Air Force's ICAM (Integrated Computer Aided Manufacturing) Definition Method Zero graphical analysis language, a subset of Ross' Structured Analysis (SA) language. The language is also an excellent methodology for performing a requirements-phase analysis for any software development project. We present an abstract data model for IDEF0 using entity-relationship diagrams. This model helps to mitigate some of the ambiguities inherent in IDEF0. The model is divided into two parts representing the analysis data (the essential data model) and the graphical data (the drawing data model). This dual modeling approach allows for the …


A Functional Language With Classes, Mike Veaven, Ryan Stanisfer, Dan Wetklow Jan 1990

A Functional Language With Classes, Mike Veaven, Ryan Stanisfer, Dan Wetklow

Department of Computer Science Technical Reports

No abstract provided.


Queueing Models Of Secondary Storage Devices, Edward G. Coffman Jan 1990

Queueing Models Of Secondary Storage Devices, Edward G. Coffman

Department of Computer Science Technical Reports

No abstract provided.


Geometric Computations With Algebraic Varieties Of Bounded Degree, Chanderjit L. Bajaj Jan 1990

Geometric Computations With Algebraic Varieties Of Bounded Degree, Chanderjit L. Bajaj

Department of Computer Science Technical Reports

No abstract provided.


Algebraic Surface Design With Hermite Interpolation, Chandrajit L. Bajaj, Insung Ihm Jan 1990

Algebraic Surface Design With Hermite Interpolation, Chandrajit L. Bajaj, Insung Ihm

Department of Computer Science Technical Reports

No abstract provided.


Mapping Finite Element Graphs On Hypercubes, Yeh-Ching Chung, Sanjay Ranka Jan 1990

Mapping Finite Element Graphs On Hypercubes, Yeh-Ching Chung, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

In parallel computing, it is important to map a parallel program onto a parallel computer such that the total execution time of a parallel program is minimized. In general, a parallel program and a parallel computer can be represented by a task graph (TG) and a processor graph (PG), respectively. For a TG, nodes represent tasks of a parallel program and edges denote the data communication needed between tasks. The weights associated with nodes and edges represent the computational load and communication cost, respectively. For a PG, nodes and edges denote processors and communication channels, respectively. By using the graph …


An Architecture For Distributed Multimedia Database Systems, P. B. Berra, C.Y.R. Chen, A. Ghafoor, C. C. Lin Jan 1990

An Architecture For Distributed Multimedia Database Systems, P. B. Berra, C.Y.R. Chen, A. Ghafoor, C. C. Lin

Electrical Engineering and Computer Science - All Scholarship

In the past few years considerable demand for user oriented multimedia information systems has developed. These systems must provide a rich set of functionality so that new, complex, and interesting applications can be addressed. This places considerable importance on the management of diverse data types including text, images, audio and video. These requirements generate the need for a new generation of distributed heterogeneous multimedia database systems. In this paper we identify a set of functional requirements for a multimedia server considering database management, object synchronization and integration, and multimedia query processing. A generalization of the requirements to a distributed system …


Using Annotated C++, Marshall P. Cline, Doug Lea Jan 1990

Using Annotated C++, Marshall P. Cline, Doug Lea

Electrical Engineering and Computer Science - All Scholarship

A++ (‘‘Annotated C++’’) is both a formalism and a proposed CASE tool for annotating C++ code with object-oriented specifications, assertions, and related semantic information. Annotations provide programmers with a useful means for approaching class design, exceptions, correctness, standardization, software reusability and related issues in software engineering with C++. This paper shows how A++ provides arbitrarily fine granularity to the C++ type system, how it automates and streamlines exception testing, how it can aid in standardization of software components, and how it can safely remove redundant exception tests.


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, January 1990, College Of Engineering And Computer Science, Wright State University Jan 1990

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, January 1990, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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


An Underwater Science And Resource Database Management System And Proposed Applications To Marine Geographic Information Systems, Ivar Babb Jan 1990

An Underwater Science And Resource Database Management System And Proposed Applications To Marine Geographic Information Systems, Ivar Babb

Marine Affairs Theses and Major Papers

The National Undersea Research Program (NURP) is a federally-funded program that provides scientists with modern in situ technology that allows them to conduct research that goes beyond the constraints of traditional oceanographic methodology. NURP is comprised of five regional centers that administer underwater science, and through the principal investigators that are supported generate a vast quantity of diverse data. This data and information bank consists of the following: raw environmental data, logistical data, locational data, information about the scientists, video and still photograph documentation, and publication information. This paper describes the theory behind the implementation of a Database Management System …


The Use Of Remote Sensing Techniques And Geographic Information Systems By Coastal Managers In Rhode Island, Margaret H. Sano Jan 1990

The Use Of Remote Sensing Techniques And Geographic Information Systems By Coastal Managers In Rhode Island, Margaret H. Sano

Marine Affairs Theses and Major Papers

Planners and managers must understand the physical and anthropogenic changes taking place within the coastal zone to provide effective management. Remote sensing techniques and Geographic Information Systems (GIS) are excellent tools for contributing data and analytical capabilities to identify possible conflicts within the coastal zone. This study examines the potential and actual use of these technologies by coastal managers within Rhode Island. Potential usage is discussed in terms of the range of data available and the feasibility of using the data for coastal problems. Also, GIS capabilities in Rhode Island are explored. Finally a survey designed to measure the actual …


Arithmetic Classification Of Perfect Models Of Stratified Programs (Addendum), Krzysztof R. Apt, Howard A. Blair Jan 1990

Arithmetic Classification Of Perfect Models Of Stratified Programs (Addendum), Krzysztof R. Apt, Howard A. Blair

Electrical Engineering and Computer Science - Technical Reports

RECURSION-FREE PROGRAMS The following section completes the analysis of arithmetic complexity of perfect models and has been inadvertently omitted in the previous version of the paper. We say that a general program P is recursion-free if in its dependency graph Dp there is no cycle. Clearly recursion-free programs form a subclass of stratified programs. Recursion-free programs form a very simple generalization of the class of hierarchical programs introduced in [C78]. Hierarchical programs satisfy an additional condition on variable occurrences in clauses that prevents floundering, i.e. a forced selection of a non-ground negative literal in an SLDNF- derivation. In this section …


Pumps : A Method Of Financially Assessing Groundwater Pumping Used To Mitigate Salinity In South-Western Australia, Richard J. George Dr Jan 1990

Pumps : A Method Of Financially Assessing Groundwater Pumping Used To Mitigate Salinity In South-Western Australia, Richard J. George Dr

Resource management technical reports

No abstract provided.


Ua66/3/3 Journal Of The A. C. M., Wku Association For Computing Machinery Jan 1990

Ua66/3/3 Journal Of The A. C. M., Wku Association For Computing Machinery

Student Organizations

Journal created by and about the WKU Association for Computing Machinery a student organization sponsored by WKU Computer Science.


Highland: A Graph-Based Parallel Processing Environment For Heterogeneous Local Area Networks, Ralph W. Wilkerson, Douglas E. Meyer Jan 1990

Highland: A Graph-Based Parallel Processing Environment For Heterogeneous Local Area Networks, Ralph W. Wilkerson, Douglas E. Meyer

Computer Science Faculty Research & Creative Works

No abstract provided.


Computational Intelligence In Cad/Cam Applications, Chaman Sabharwal, Thomas G. Melson, Martin D. Fraser Jan 1990

Computational Intelligence In Cad/Cam Applications, Chaman Sabharwal, Thomas G. Melson, Martin D. Fraser

Computer Science Faculty Research & Creative Works

This paper presents a fundamental, direct, and powerful approach to the surface/surface intersection problem in CAD/CAM applications. The algorithm is designed and implemented in three steps: a) Preprocessing- locate the potentially intersecting sections of the surfaces and decompose the surfaces into surface elements within specified flatness tolerance; b) Intersection- decompose the possibly intersecting pairs of surface elements into continuous surface triangulations to find the approximate intersections between the pairs of surface elements; c) Postprocessing-assemble the intersection primitives into curves of intersection, refine the accuracy of computed intersection points, and compact the intersection curves. This surface/surface intersection algorithm is applicable to …


Benchmarking Parallel Machines Via A Software Architecture, Srikanth Kambhatla, Jon Inouye, Jonathan Walpole Jan 1990

Benchmarking Parallel Machines Via A Software Architecture, Srikanth Kambhatla, Jon Inouye, Jonathan Walpole

Computer Science Faculty Publications and Presentations

The diversity in parallel architectures and the programming styles induced thereof, make benchmarking of parallel machines a hard problem. Current benchmarking techniques are limited in applicability due to the issues of portability. We present a different approach to benchmarking parallel machines, which would make the resulting benchmarks portable, easy to use and widely applicable. The approach involves the use of a software architecture to mask the diversities of the underlying architectures. The benchmarks are based on the Linda Tuple Space, and is called BeLinda. In this report, we motivate the use of a software architecture, give a specification of the …


Faster Circuits And Shorter Formulas For Multiple Addition, Multiplication And Symmetric Boolean Functions, Michael Paterson, Uri Zwick, Nicholas Pippenger Jan 1990

Faster Circuits And Shorter Formulas For Multiple Addition, Multiplication And Symmetric Boolean Functions, Michael Paterson, Uri Zwick, Nicholas Pippenger

All HMC Faculty Publications and Research

A general theory is developed for constructing the shallowest possible circuits and the shortest possible formulas for the carry-save addition of n numbers using any given basic addition unit. More precisely, it is shown that if BA is a basic addition unit with occurrence matrix N, then the shortest multiple carry-save addition formulas that could be obtained by composing BA units are of size n1p+o(1)/, where p is the unique real number for which the Lp norm of the matrix N equals 1. An analogous result connects the delay matrix M of the basic addition unit BA and the minimal …


Role Of Term Symmetry In E-Completion Procedures, Ralph W. Wilkerson, Blayne E. Mayfield Jan 1990

Role Of Term Symmetry In E-Completion Procedures, Ralph W. Wilkerson, Blayne E. Mayfield

Computer Science Faculty Research & Creative Works

No abstract provided.


Dawgs - A Distributed Compute Server Utilizing Idle Workstations, Henry Clark, Bruce M. Mcmillin Jan 1990

Dawgs - A Distributed Compute Server Utilizing Idle Workstations, Henry Clark, Bruce M. Mcmillin

Computer Science Faculty Research & Creative Works

A collection of powerful workstations interconnected by a local area network can be utilized as compute servers when left idle by their owners. DAWGS allows users to submit jobs for execution on an idle workstation somewhere on a local area network. DAWGS uses a distributed scheduler and a bidding scheme to determine on which machine to run a process. DAWGS can properly redirect all the I/O of a remotely executing process and can checkpoint and then subsequently restart the process, even if the restart is on a different machine than the checkpoint. Our method is different from other work in …


Distributed Evaluation Of An Iterative Function For All Object Pairs On A Simd Hypercube, Fikret Erçal Jan 1990

Distributed Evaluation Of An Iterative Function For All Object Pairs On A Simd Hypercube, Fikret Erçal

Computer Science Faculty Research & Creative Works

An efficient distributed algorithm for evaluating an iterative function on all pairwise combinations of C objects on an SIMD hypercube is presented. The algorithm achieves uniform load distribution and minimal, completely local interprocessor communication.


Experimentation With Large-Grained Parallelism Using Local Area Networks, Ralph W. Wilkerson, Douglas E. Meyer Jan 1990

Experimentation With Large-Grained Parallelism Using Local Area Networks, Ralph W. Wilkerson, Douglas E. Meyer

Computer Science Faculty Research & Creative Works

HIGHLAND, a distributed-memory parallel processing environment for heterogeneous local area networks, has been developed. Designed as both a teaching and a research tool, its purpose is to provide an effective mechanism by which a number of networked UNIX workstations, dissimilar in both vendor and performance, can be directly manipulated as a single, unified, multiprocessing system. Utilizing the MIT X-windows environment, HIGHLAND supports a highly interactive graphical interface through which a programmer can create, modify, and control complex systems of communicating processes


Experimental Comparison Of Bidding And Drafting Load Sharing Protocols, Andrew Ross, Bruce M. Mcmillin Jan 1990

Experimental Comparison Of Bidding And Drafting Load Sharing Protocols, Andrew Ross, Bruce M. Mcmillin

Computer Science Faculty Research & Creative Works

In recent years, a dramatic rise in the number of personal workstations interconnected via local area networks has occurred in the workplace. These can be organized as distributed computing systems. The combined computing power of these systems are often greater than mainframes of a decade ago, and usually less expensive. There is a growing interest in harnessing this often-underutilized power. Researchers are focusing their attention on remote execution of processes as one solution. An additional topic of research is to balance a workload among a series of computers. Remote execution is made possible because the distributed operating system provides migration …


Data Acquisition And Control Program For Chromatographic And Spectroscopic Studies, M. Keith Hudson, William G. Hood, Robert Henson Jan 1990

Data Acquisition And Control Program For Chromatographic And Spectroscopic Studies, M. Keith Hudson, William G. Hood, Robert Henson

Journal of the Arkansas Academy of Science

An IBMPC compatible computer was interfaced to an Ithaco 3962 lock-in-amplifier. The computer controlled the functions of the lock-in-amplifier, acquired and stored data, and allowed for real time or off-line processing of data. Computer/amplifier connection was made via RS-232-C serial interface. Programmed in Microsoft Quick BASIC, the computer assumed the role of a dedicated chromatographic integrator. This reduced the overall instrumentation expense by eliminating a dedicated chromatographic integrator. The computer program supplied much greater flexibility in control and data interpretation. To show its utility, the program was applied to a study of the infrared emission from a flame upon the …