Digital Commons Network^™

Eliminating Extraneous Solutions In Curve And Surface Operations, Christoph M. Hoffmann, Pamela J. Vermeer

Department of Computer Science Technical Reports

No abstract provided.

A Framework For 1-D Compaction With Forbidden Region Avoidance, Susanne E. Hambrusch, Hung-Yi Tu

Department of Computer Science Technical Reports

No abstract provided.

Analyzing Availability Of Replicated Database Systems, Bharat Bhargava, Abdelsalam Helal, Karl Friesen

Department of Computer Science Technical Reports

No abstract provided.

Multisearch Techniques: Parallel Data Structures On Mesh-Connected Computers, Mikhail J. Atallah, Frank Dehne, Russ Miller, Andrew Rau-Chaplin, Jyh-Jong Tsay

Department of Computer Science Technical Reports

No abstract provided.

A Robust Intersection Algorithm Based On Delaunay Triangulation, Kokichi Sugihara

Department of Computer Science Technical Reports

No abstract provided.

An Optimal Parallel Algorithm For Detecting Weak Visibility Of A Simple Polygon, Danny Z. Chen

Department of Computer Science Technical Reports

No abstract provided.

Concurrency Control, Version Management And Transactions In Advanced Database Systems, Jonathan Walpole, Muntuck Yap

Computer Science Faculty Publications and Presentations

This document constitutes the final deliverable for the research project titled “An Investigation of Selected Issues in Transaction Mechanism Design for Object Oriented Databases.” The document describes our ideas for extending the traditional transaction concept for use in object oriented databases, and concentrates specifically on providing an underlying model to support the concurrency control and version management aspects of the problem. The ideas presented here are not however restricted to the domain of object oriented databases. They are more generally applicable to database systems that require flexibility in their versioning and concurrency control policies.

In this document we define a …

A Practical Hierarchial Model Of Parallel Computation: The Model, Todd Heywood, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

We introduce a model of parallel computation that retains the ideal properties of the PRAM by using it as a sub-model, while simultaneously being more reflective of realistic parallel architectures by accounting for and providing abstract control over communication and synchronization costs. The Hierarchical PRAM (H-PRAM) model controls conceptual complexity in the face of asynchrony in two ways. First, by providing the simplifying assumption of synchronization to the design of algorithms, but allowing the algorithms to work asynchronously with each other; and organizing this "control asynchrony" via an implicit hierarchy relation. Second, by allowing the restriction of "communication asynchrony" in …

Multiple Expert System, Umesh Kumar Mittal

Theses

In many domains, for example medical diagnosis, there are several sources of knowledge, e.g., several domain experts. These domain experts may have disagreements over some issues in the domain. Research in the area of human decision making suggests that a human decision is not always made based on the advice of a single expert. Many current expert systems, however, expect consistency in their knowledge bases. An expert system does not deliberate by reasoning that "on one hand..." but "on the other hand..." The knowledge engineer, who is not necessarily an expert in the same domain, ensures consistency by eliminating all …

Experiments In Concurrent Stochastic Simulation: The Eclipse Paradigm, Vernon J. Rego, V. S. Sunderam

Department of Computer Science Technical Reports

No abstract provided.

The Parallelization Of Level 2 And 3 Blas Operations On Distributed Memory Machines, M. Aboelaze, N. P. Chrisochoides, Elias N. Houstis, C. E. Houstis

Department of Computer Science Technical Reports

No abstract provided.

Performance Of Pde Sparse Solvers On Hypercubes, Mo Mu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

A Spatial Index For Convex Simplicial Complexes In D Dimensions, George Vanĕček, Vincenzo Ferrucci

Department of Computer Science Technical Reports

No abstract provided.

Analyzing Images Containing Multiple Sparse Patterns With Neural Networks, Rangachari Anand, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka

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

We have addressed the problem of analyzing images containing multiple sparse overlapped patterns. This problem arises naturally when analyzing the composition of organic macromolecules using data gathered from their NMR spectra. Using a neural network approach, we have obtained excellent results in using NMR data to analyze the presence of various amino acids in protein molecules. We have achieved high correct classification percentages (about 87%) for images containing as many as five substantially distorted overlapping patterns.

Scatter Scheduling For Problems With Unpredictable Structures, Min-You Wu, Wei Shu

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

An extended scatter scheduling was applied to problems with unpredictable, asynchronous structures. It has been found that with this simple scheduling strategy, good load balance can be reached without incurring much runtime overhead. This scheduling algorithm has been implemented on hypercube machines, and its performance is compared with other scheduling strategies.

Disjoint Covers In Replicated Heterogeneous Arrays, P.K. Mckinley, N. Hasan, Ran Libeskind-Hadas, C.L. Liu

All HMC Faculty Publications and Research

Reconfigurable chips are fabricated with redundant elements that can be used to replace the faulty elements. The fault cover problem consists of finding an assignment of redundant elements to the faulty elements such that all of the faults are repaired. In reconfigurable chips that consist of arrays of elements, redundant elements are configured as spare rows and spare columns.

This paper considers the problem in which a chip contains several replicates of a heterogeneous array, one or more sets of spare rows, and one or more sets of spare columns. Each set of spare rows is identical to the set …

Selection Networks, Nicholas Pippenger

All HMC Faculty Publications and Research

An upper bound asymptotic to $2n\log _e n$ is established for the number of comparators required in a network that classifies $n$ values into two classes, each containing $n / 2$ values, with each value in one class less than or equal to each value in the other. (The best lower bound known for this problem is asymptotic to $(n / 2)\log _2 n$.)

Performance Prediction For Distributed Load Balancing On Multicomputer Systems, Ishfaq Ahmed, Arif Ghafoor, Kishan Mehrotra

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

This paper presents a performance evaluation approach to compare different distributed load balancing schemes on a unified basis. This approach is an integration of simulation, statistical and analytical models, and takes into account the fundamental system parameters that can possibly affect the performance. We show that all the sender-initiated distributed load balancing strategies can be modeled by a central server open queuing network. Furthermore, these load balancing strategies can be characterized by only two queuing parameters – the average execution queue length and the probability that a newly arrived task is executed locally or migrated to another node. To capture …

Shadow Casting Phenomena At Newgrange, Frank Prendergast

Articles

A digital model of the Newgrange passage tomb and surrounding ring of monoliths known as the Great Circle is used to investigate sunrise shadow casting phenomena at the monument. Diurnal variation in shadow directions and lengths are analysed for their potential use in the Bronze Age to indicate the passage of seasonal time. Computer-aided simulations are developed from a photogrammetric survey to accurately show how three of the largest monoliths, located closest to the tomb entrance and archaeologically coded GC1, GC-1 and GC-2, cast their shadows onto the vertical face of the entrance kerbstone, coded K1. The phenomena occur at …

Curriculum-Oriented Cai Based On Instructional Technology To Be Used For Teaching Secondary School Students Introductory Library Skills, Theresa K. Toohil

CCAC Theses and Dissertations

In 1990, the New York State Education Department presented a syllabus that required the teaching of curriculum-oriented library skills and suggested the use of computers to be integrated with the teaching of these skills whenever possible. Schools in New York State are now trying to implement the suggestions in the syllabus. Many authors of educational articles have written at length concerning the incorporation of computer-assisted instruction (CAl) into the classroom, but clear directions have not been provided in the literature for the design or implementation of the necessary software.

The purpose of this study was to design a program based …

A Meta-Analysis Of Learner Control In Computer-Based Learning Environments, June A. Parsons

CCAC Theses and Dissertations

The objective of this meta-analysis was to integrate the results of a collection of primary research studies on learner control of computer-based environments. The scope for the meta-analysis was limited to inquiry on different learner-control models and their effect on student achievement as represented by posttest scores. Three specific research questions were defined:

1. What are the characteristics of the body of learner-control research which has examined the effect on achievement of learner control?
2. Is there a difference in the achievement of students who are provided with learner control and students who are provided with other control models?
3. Do specific moderator …

Transforming A Rule-Based Program, Rose F. Gamble

All Computer Science and Engineering Research

Conflict resolution is a form of global control used in production systems to achieve an efficient sequential execution of a rule-based program. This type of control is not used to parallel production system models [6,13]. Instead, only those programs that make no assumptions regarding conflict resolution are executed in parallel. Therefore, the initial sequential rule-based programs are either executed in parallel without their conflict resolution strategy, which normally results in incorrect behavior, or the programs are transformed in an ad hoc manner to execute on an particular parallel production system model. As a result, these programs do not exhibit the …

An Expert Inference Engine For Generation Of Nursing Diagnoses, Tom Edgar

UNF Graduate Theses and Dissertations

Expert computer systems for use in the nursing profession are emerging as a potentially viable alternative to manual procedures. As nursing science continues to develop, the intellectual requirements of assessment and diagnosis are demanding that the professional nurse draw on an ever increasing bank of knowledge to interact effectively with clients. An expert system appears a promising tool to assist the nurse in storing and accessing some of the knowledge necessary to perform the assessment and diagnostic functions.

Problems and opportunities In applying artificial intelligence techniques to nursing science are documented and the current state of expert systems for nursing …

Apt Compiler Toolkit User Manual, George K. Thiruvathukal, Ufuk Verun

Computer Science: Faculty Publications and Other Works

The Apt Compiler Toolkit was designed to address the need for structured, efficient, portable, and capable tools to prototype language translators and compilers. In the current release of the toolkit tools are available for the generation of scanners, parsers, and data structures. A robust library of functions is supplied with the toolkit which includes support for the scanner, the parser, abstract data types (which are commonly used in language translators/compilers), and string functions.

Optimal Processor Assignment For Pipeline Computations, David Nicol, Rahul Simha, Alok N. Choudhury, Bhagirath Narahari

Electrical Engineering and Computer Science - All Scholarship

The availability of large-scale multitasked parallel architectures introduces the following processor assignment problem for pipelined computations. Given a set of tasks and their precedence constraints, along with their experimentally determined individual response times for different processor sizes, find an assignment of processors to tasks. Two objectives interest us: minimal response given a throughput requirement, and maximal throughput given a response time requirement. These assignment problems differ considerably from the classical mapping problem in which several tasks share a processor; instead, we assume that a large number of processors are to be assigned to a relatively small number of tasks. In …

Parallel Test Pattern Generation Using Boolean Satisfiability, V. Sivaramakrishnan, Sharad C. Seth, Prathima Agrawal

School of Computing: Conference and Workshop Papers

Recently, Larrabee proposed a sequential test generation algorithm for combinational circuits based on boolean satisfiability and presented results on benchmark circuits in support of the viability of this approach. Parallel implementations of test generation algorithms are attractive in view of the known difficulty (NP-completeness) of the problem. In this paper we suggest parallel versions of Larrabee’s algorithm, suitable for implementation on shared-memory and message-passing multicomputers.

Fuzzy Neural Logic Network And Its Learning Algorithms, Fiona Fui-Hoon Nah, Nah Fiona

Research Collection School Of Computing and Information Systems

The paper introduces the basic features of fuzzy neural logic network. Each fuzzy neural logic network model is trained from a set of knowledge in the form of examples using one of the three learning algorithms introduced. These three learning algorithms are the delta rule controlled learning algorithm and two mathematical construction algorithms, namely, the local learning method and the global learning method. Once the fuzzy neural logic network model is constructed, it is ready to accept any unknown input from the user. With a low percentage of mismatched features, output solution can be obtained.

The Problem Of Mutual Exclusion: A New Distributed Solution, Rajeev Chawla

Theses and Dissertations

In both centralized and distributed systems, processes cooperate and compete with each other to access the system resources. Some of these resources must be used exclusively. It is then required that only one process access the shared resource at a given time. This is referred to as the problem of mutual exclusion. Several synchronization mechanisms have been proposed to solve this problem. In this thesis, an effort has been made to compile most of the existing mutual exclusion solutions for both shared memory and message-passing based systems. A new distributed algorithm, which uses a dynamic information structure, is presented to …

Inclusive Production Of The Charmed Baryon C+ From E+E- Annihilations At S=10.55 Gev, P. Avery, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

We report results on inclusive production of the charmed baryon Λc+ from e+e− annihilations at √s=10.5 GeV. Measurements are presented of the inclusive cross section times branching fraction for the continuum production of Λc+ as observed in six different decay modes, and of a new, improved value of the Λc+ mass. The inclusive cross section times the branching fraction into pK−π+ is measured to be 10.0±1.5±1.5 pb summed over all xp. The branching fractions of Λc+ into p¯K0, p¯K0π+π−, Λπ+, Λπ+π−π+, and Ξ−K+π+ relative to that into pK−π+ are measured to be 0.44±0.07±0.05, 0.43±0.12±0.04, 0.18±0.03±0.03, 0.65±0.11±0.12, and 0.15±0.04±0.03, respectively. The …

On A Unique Tree Representation For P4-Extendible Graphs, B. Jamison, S. Olariu

Computer Science Faculty Publications

Several practical applications in computer science and computational linguistics suggest the study of graphs that are unlikely to have more than a few induced paths of length three. These applications have motivated the notion of a cograph, defined by the very strong restriction that no vertex may belong to an induced path of length three. The class of P₄-extendible graphs that we introduce in this paper relaxes this restriction, and in fact properly contains the class of cographs, while still featuring the remarkable property of admitting a unique tree representation. Just as in the case of cographs, the …