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

Computer Sciences Commons

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

1993

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 301 - 330 of 428

Full-Text Articles in Computer Sciences

Runtime Compilation Techniques For Data Partitioning And Communication Schedule Reuse, Ravi Ponnusamy, Joel Saltz, Alok Choudhary Jan 1993

Runtime Compilation Techniques For Data Partitioning And Communication Schedule Reuse, Ravi Ponnusamy, Joel Saltz, Alok Choudhary

Northeast Parallel Architecture Center

In this paper, we describe two new ideas by which HPF compiler can deal with irregular computations effectively. The first mechanism invokes a user specified mapping procedure via a set of compiler directives. The directives allow the user to use program arrays to describe graph connectivity, spatial location of army elements and computational load. The second is a simple conservative method that in many cases enables a compiler to recognize that it is possible to reuse previously computed results from inspectors (e.g. communication schedules, loop iteration partitions, information that associates off-processor data copies with on-processor buffer locations). We present performance …


A Fast Serial Algorithm For The Finite Temperature Quenched Potts Model, Gregory N. Hassold, Elizabeth A. Holm Jan 1993

A Fast Serial Algorithm For The Finite Temperature Quenched Potts Model, Gregory N. Hassold, Elizabeth A. Holm

Physics Publications

An efficient serial algorithm for finite temperature, quenched Potts model simulations of domain evolution has been developed. This ''n‐fold way'' algorithm eliminates unsuccessful spin flip attempts a priori by flipping sites with a frequency proportional to their site activity, defined as the sum of the probability of success for every possible spin flip at that site. Finite temperature efficiency for high‐spin degeneracy systems is achieved by utilizing a new, analytical expression for the portion of the site activity due to flips to non-neighbor spin values. Hence, to determine the activity of a site, only flips to the …


Fast Mapping And Remapping Algorithms For Irregular And Adaptive Problems, Chao Wei Ou, Sanjay Ranka, Geoffrey C. Fox Jan 1993

Fast Mapping And Remapping Algorithms For Irregular And Adaptive Problems, Chao Wei Ou, Sanjay Ranka, Geoffrey C. Fox

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

This paper describes the performance of locality-based mapping and remapping partitioners for unstructured grids. We show that the algorithm produces good mappings at a relatively low cost and can be easily parallelized. Further, the algorithm can provide remapping for incremental problems at a fraction of the total cost.


A Model For Syntactic Control Of Interference, Peter W. O'Hearn Jan 1993

A Model For Syntactic Control Of Interference, Peter W. O'Hearn

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

Two imperative programming language phrases interfere when one writes to a storage variable that the other reads from or writes to. Reynolds has described an elegant linguistic approach to controlling interference in which a refinement of typed λ-calculus is used to limit sharing of storage variables; in particular, different identifiers are required never to interfere. This paper examines semantic foundations of the approach. We describe a category that has (an abstraction of) interference information built into all objects and maps. This information is used to define a “tensor” product whose components are required never to interfere. Environments are defined using …


Distributed Scheduling Of Unstructured Collective Communication On The Cm-5 (1993), Jyu-Chun Wang, Tseng-Hui Lin, Sanjay Ranka Jan 1993

Distributed Scheduling Of Unstructured Collective Communication On The Cm-5 (1993), Jyu-Chun Wang, Tseng-Hui Lin, Sanjay Ranka

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

Parallelization of many irregular applications results in unstructured collective communication. In this paper we present a distributed algorithm for scheduling such communication on parallel machines. We describe the performance of this algorithm on the CM-5 and show that the scheduling algorithm has very small overhead and gives a significant improvement over naive methods.


Ccis Networking - January 1993, Nova University Jan 1993

Ccis Networking - January 1993, Nova University

CCIS Networking / SCIS Networking magazines

No abstract provided.


Functional Representation And Reasoning About The F/A-18 Aircraft Fuel System, M. Pegah, J. Sticklen, William E. Bond Jan 1993

Functional Representation And Reasoning About The F/A-18 Aircraft Fuel System, M. Pegah, J. Sticklen, William E. Bond

Computer Science Faculty Research & Creative Works

Functional reasoning, a subfield of model-based reasoning, is discussed. This approach uses abstractions of a device's purpose to index behaviors that achieve that purpose. Functional modeling, a variation on this method, also uses simulation as a core reasoning strategy. The complex causal knowledge of a device along functional lines is decomposed, then a causal story of how the device will operate in a particular situation given stated boundary conditions is composed. The application of the functional approach to modeling the fuel system of a F/A-18 aircraft is described. The representation of the F/A-18 fuel system includes 89 component devices, 92 …


Georg Cantor And The Battle For Transfinite Set Theory, Joseph Dauben Jan 1993

Georg Cantor And The Battle For Transfinite Set Theory, Joseph Dauben

ACMS Journal 2004

Georg Cantor is well known as the founder of transfinite set theory. Equally celebrated, however, are the obstacles he faced in trying to win acceptance for his seemingly unorthodox views, his acrimonious differences with Leopold Kronecker and his unfortunate but progressively debilitating nervous breakdowns that some authors have linked directly to his many problems with set theory. Above all, Cantor's justification of set theory was all the more urgent because of Kronecker's critical denunciation of Cantor's mathematics. In tracing the evolution of Cantorian set theory, it is necessary to examine the opposition it met, and evaluate the technical, philosophical, psychological, …


Digital Information In The Peel-Harvey Catchment Area, Dennis Van Gool Jan 1993

Digital Information In The Peel-Harvey Catchment Area, Dennis Van Gool

Agriculture reports

This paper presents a summary of the main features of the digital mapping data available in the Peel-Harvey Catchment area. This type of information is essential for Geographic Information System (GIS) users to assess projects involving the use of digital data such as plotting of mapped themes, topological overlays, area calculations and reporting.


Monitoring Shared Memory: A Toolset Prototype For The Informix Online Administrator, Eric Gronholz Jan 1993

Monitoring Shared Memory: A Toolset Prototype For The Informix Online Administrator, Eric Gronholz

Honors Theses, 1963-2015

The "Monitor" Program was developed to assist system administrators for the INFORMIX OnLine Database Server with their evaluation of shared memory components used on their system. Using the Open Software Foundation (OSF)/Motif Widget set for Xt Intrinsics on the X Window System, this program creates scaled dials and pop-up windows to display system information at regular intervals. The program is surprisingly simple to operate and is general enough that with just a few modifications, it can be used to monitor any system information, not just shared memory information for OnLine. This program marks a new way to look at systems …


Software And Hardware Support For Workstation-Based, Salim Hariri, Manish Parashar, Jongbaek Park Jan 1993

Software And Hardware Support For Workstation-Based, Salim Hariri, Manish Parashar, Jongbaek Park

Electrical Engineering and Computer Science - All Scholarship

The proliferation of high performance workstations and the emergence of high speed networks have attracted a lot of interest in workstation-based supercomputing. We project that workstation-based environments with supercomputing capabilities will be available in the not-so-distant future. However a number of hardware and software issues have to be resolved before the full potential of these workstation-based supercomputing environments can be exploited. The presented research has two main objectives: (1) to investigate the limitations of communications techniques used in current workstation-based systems and to identify a set of requirements that must be satisfied to achieve workstation-based supercomputing; (2) to use these …


When Will A Genetic Algorithm Outperform Hill-Climbing?, Melanie Mitchell, John H. Holland Jan 1993

When Will A Genetic Algorithm Outperform Hill-Climbing?, Melanie Mitchell, John H. Holland

Computer Science Faculty Publications and Presentations

In this paper we review some previously published experimental results in which a simple hillclimbing algorithm-Random Mutation Hill-Climbing (RMHC)-significantly outperforms a genetic algorithm on a simple "Royal Road" function. vVe present an analysis of RMHC followed by an analysis of an "idealized" genetic algorithm (IGA) that is in turn significantly faster than RMHC. We isolate the features of the IGA that allow for this speedup, and discuss how these features can be incorporated into a real GA and a fitness landscape, making the GA better approximate the IGA. We use these features to design a modified version of the previously …


Revisiting The Edge Of Chaos: Evolving Cellular Automata To Perform Computations, Melanie Mitchell, Peter T. Hraber, James P. Crutchfield Jan 1993

Revisiting The Edge Of Chaos: Evolving Cellular Automata To Perform Computations, Melanie Mitchell, Peter T. Hraber, James P. Crutchfield

Computer Science Faculty Publications and Presentations

No abstract provided.


On Extremal Nonsupereulerian Graphs With Clique Number M, Zhi-Hong Chen Jan 1993

On Extremal Nonsupereulerian Graphs With Clique Number M, Zhi-Hong Chen

Scholarship and Professional Work - LAS

No abstract provided.


On The Edge Arboricity Of A Random Graph, P. A. Catlin, Zhi-Hong Chen, E. M. Palmer Jan 1993

On The Edge Arboricity Of A Random Graph, P. A. Catlin, Zhi-Hong Chen, E. M. Palmer

Scholarship and Professional Work - LAS

No abstract provided.


Integrated Computer Controlled Sensor Monitor, Tariq Hafeez Malik Jan 1993

Integrated Computer Controlled Sensor Monitor, Tariq Hafeez Malik

Theses : Honours

This research has developed an Integrated Computer Controlled Sensor Monitor (ICCSM) environment, to monitor and analyse alarm events associated with sensors, including an interface between a PC and a number of detectors. Such an environment will help the security industry analyse the factors causing false alarms at particular locations. The ICCSM environment monitors, and records, alarm data. Knowing exactly which sensor has been activated, and its location, is of paramount importance to the effective deployment of response forces and making the identification of causes of spurious alarms easier. The lCCSM environment is a combination of software and general purpose hardware, …


Clock Partitioning For Testability, Kent L. Einspahr, Sharad C. Seth, Vishwani D. Agrawal Jan 1993

Clock Partitioning For Testability, Kent L. Einspahr, Sharad C. Seth, Vishwani D. Agrawal

School of Computing: Conference and Workshop Papers

An implementation of a design for testability model for sequential circuits is presented. The flip-flops in a sequential circuit are partitioned to reduce the number of cycles and the path lengths in each partition, thereby reducing the complexity of test generation. The implementation includes a Podem-based test generator. Preliminary results using the Contest sequential test generator are presented.


A-Hohfeld: A Language For Robust Structural Representation Of Knowledge In The Legal Domain To Build Interpretation-Assistance Expert Systems, Layman E. Allen, Charles S. Saxon Jan 1993

A-Hohfeld: A Language For Robust Structural Representation Of Knowledge In The Legal Domain To Build Interpretation-Assistance Expert Systems, Layman E. Allen, Charles S. Saxon

Book Chapters

The A-Hohfeld language is presented as a set of definitions; it can be used to precisely express legal norms. The usefulness of the AHohfeld language is illustrated in articulating 2560 alternative structural interpretations of the four-sentence 1982 Library Regulations of Imperial College and constructing an interpretation-assistance legal expert system for these regulations by means of the general-purpose Interpretation-Assistance legal expert system builder called MINT. The logical basis for A-Hohfeld is included as an appendix.


Genetic Algorithms With 3-Parent Crossover, L. Vincent Edmondson Jan 1993

Genetic Algorithms With 3-Parent Crossover, L. Vincent Edmondson

Doctoral Dissertations

"A new genetic algorithm which uses a 3-parent uniform crossover operator is developed and analyzed. Uniform crossover operators are shown to be based on the premise that all bit-level genetic information should be passed from parents to children. The 3-parent uniform crossover operator is shown to adhere to this premise. The 3-parent uniform crossover operator is shown to be better than the 2-parent uniform crossover operator on the De Jong test functions.

Two new genetic algorithms which use 3-parent traditional crossover operators are developed and analyzed. The first uses a strategy of randomly selecting 3 of the 6 children resulting …


So Far (Schematically) Yet So Near (Semantically), Amit P. Sheth, Vipul Kashyap Jan 1993

So Far (Schematically) Yet So Near (Semantically), Amit P. Sheth, Vipul Kashyap

Kno.e.sis Publications

In a multidatabase system, schematic conflicts between two objects are usually of interest only when the objects have some semantic affinity. In this paper we try to reconcile the two perspectives. We first define the concept of semantic proximity and provide a semantic taxonomy. We then enumerate and classify the schematic and data conflicts. We discuss possible semantic similarities between two objects that have various types of schematic and data conflicts. Issues of uncertain information and inconsistent information are also addressed.


Observation Of B0 Decay To Two Charmless Mesons, M. Battle, Manoj Thulasidas Jan 1993

Observation Of B0 Decay To Two Charmless Mesons, M. Battle, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

We report results from a search for the decays B0→π+π-, B0→K+π-, and B0→K+K-. We find 90% confidence level upper limits on the branching fractions, Bππ


Detection Of Skin Tumor Boundaries In Color Images, Fikret Erçal, M. Moganti, William V. Stoecker, Randy Hays Moss Jan 1993

Detection Of Skin Tumor Boundaries In Color Images, Fikret Erçal, M. Moganti, William V. Stoecker, Randy Hays Moss

Computer Science Faculty Research & Creative Works

A simple and yet effective method for finding the borders of tumors is presented as an initial step towards the diagnosis of skin tumors from their color images. The method makes use of an adaptive color metric from the red, green, and blue planes that contains information for discriminating the tumor from the background. Using this suitable coordinate transformation, the image is segmented. The tumor portion is then extracted from the segmented image and borders are drawn. Experimental results that verify the effectiveness of this approach are given


On Matching Ann Structure To Problem Domain Structure, George G. Lendaris, Martin Zwick, Karl Mathia Jan 1993

On Matching Ann Structure To Problem Domain Structure, George G. Lendaris, Martin Zwick, Karl Mathia

Complex Systems Faculty Publications and Presentations

To achieve reduced training time and improved generalization with artificial neural networks (ANN, or NN), it is important to use a reduced complexity NN structure. A "problem" is defined by constraints among the variables describing it. If knowledge about these constraints could be obtained a priori, this could be used to reduce the complexity of the ANN before training it. Systems theory literature contains methods for determining and representing structural aspects of constrained data (these methods are herein called GSM, general systems method). The suggestion here is to use the GSM model of the given data as a pattern for …


Nova University Graduate Education Module (Gem) Master's And Educational Specialist Degrees Computer Science Education 1993, Nova University Jan 1993

Nova University Graduate Education Module (Gem) Master's And Educational Specialist Degrees Computer Science Education 1993, Nova University

Abraham S. Fischler College of Education and School of Criminal Justice College Archive

No abstract provided.


Weapon System Integration For The Afit Virtual Cockpit, William E. Gerhard Jr. Jan 1993

Weapon System Integration For The Afit Virtual Cockpit, William E. Gerhard Jr.

Theses and Dissertations

The Air Force Institute of Technology is continuing research in the Virtual Cockpit. The Virtual Cockpit makes use of high performance graphics workstations, Virtual Environment technology, and Distributed Interactive Simulation network protocols to create a flight simulator based on the capabilities of the McDonnell Douglas F-15E Strike Eagle. The work presented in this thesis focuses on the design and implementation issues for integrating a weapons delivery capability. Weapons simulated include: RADAR and IR guided air- to-air missiles, gravity and precision guided bombs, and a 20mm cannon. Virtual Environment displays used include: color NTSC and monochrome high resolution helmet mounted displays …


The Use Of A Factory Simulation To Evaluate A Flexible Control Structure For Integrated Manufacturing, Ling Ling Pan Jan 1993

The Use Of A Factory Simulation To Evaluate A Flexible Control Structure For Integrated Manufacturing, Ling Ling Pan

Engineering Management & Systems Engineering Theses & Dissertations

Once a control structure for an integrated manufacturing system is decided upon, manufacturing activities are limited by that structure. A flexible control structure is presented as an approach for accommodating a variety of manufacturing activities, without being limited to a single control structure. A flexible control structure is one that allows multiple types of control structure in the manufacturing process. For example, both hierarchical and non-hierarchical structures may be used in a flexible structure. The properties of a flexible control structure are discussed from the point of view of graph theory.

Control structures for automated manufacturing are difficult to evaluate …


Asymptotically Tight Bounds For Performing Bmmc Permutations On Parallel Disk Systems, Thomas H. Cormen, Leonard F. Wisniewski Jan 1993

Asymptotically Tight Bounds For Performing Bmmc Permutations On Parallel Disk Systems, Thomas H. Cormen, Leonard F. Wisniewski

Computer Science Technical Reports

No abstract provided.


Vector Layout In Virtual-Memory Systems For Data-Parallel Computing, Thomas H. Cormen Jan 1993

Vector Layout In Virtual-Memory Systems For Data-Parallel Computing, Thomas H. Cormen

Computer Science Technical Reports

In a data-parallel computer with virtual memory, the way in which vectors are laid out on the disk system affects the performance of data-parallel operations. We present a general method of vector layout called banded layout, in which we divide a vector into bands of a number of consecutive vector elements laid out in column-major order, and we analyze the effect of the band size on the major classes of data-parallel operations. We find that although the best band size varies among the operations, choosing fairly small band sizes—at most a track—works well in general.


Videoscheme: A Programmable Video Editing System For Automation And Media Recognition, James Matthews, Peter Gloor, Fillia Makedon Jan 1993

Videoscheme: A Programmable Video Editing System For Automation And Media Recognition, James Matthews, Peter Gloor, Fillia Makedon

Computer Science Technical Reports

The recent development of powerful, inexpensive hardware and software support had made digital video editing possible on personal computers and workstations. To date the video editing application category has been dominated by visual, easy-to-use, direct manipulation interfaces. These systems bring high-bandwidth human-computer interaction to a task formerly characterized by slow, inflexible, indirectly-operated machines. However, the direct manipulation computer interfaces are limited by their manual nature, and can not easily accommodate algorithmically- defined operations. This paper proposes a melding of the common direct manipulation interfaces with a programming language which we have enhanced to manipulate digital audio and video. The result …


Development Of A Hypermedia Database For The Elementary Classroom, Jane Pattison Brown Jan 1993

Development Of A Hypermedia Database For The Elementary Classroom, Jane Pattison Brown

All Graduate Projects

A hypermedia database including selected flora and fauna in Kittitas County, Washington, was developed using HyperCard software for researching information about 400+ species. students had the opportunity to use the database in school libraries and in the author's fifth-grade classroom. The database cards accessed videodisc images where available. On the basis of limited study to date, it appears that when studying the environment, student learning was enhanced by the use of database material created by the author.