Digital Commons Network^™

Sampling And Reconstructing Manifolds Using Alpha-Shapes, Fausto Bernardini, Chandrajit L. Bajaj

Department of Computer Science Technical Reports

No abstract provided.

Active Gateway: A Facility For Video Conferencing Traffic Control, Shunge Li, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.

On The Classification Of Computable Languages, John Case, Efim Kinber, Arun Sharma, Frank Stephan

School of Computer Science & Engineering Faculty Publications

A one-sided classifier converges to 1 on every set inside a given class and outputs infinitely often a 0 on every set outside the class. A two-sided classifier converges in the first case to 1 and in the second to 0. This paper considers one-sided and two-sided classifiers dealing with computable sets as input. It provides theorems from which the classifiability of natural examples can be assessed and investigates the relations of the types of classification to inductive learning theory and structural complexity theory in terms of Turing degrees. Furthermore, it deals with the special cases of classification from positive …

Inductive Neural Logic Network And The Scm Algorithm, Ah-Hwee Tan, Loo-Nin Teow

Research Collection School Of Computing and Information Systems

Neural Logic Network (NLN) is a class of neural network models that performs both pattern processing and logical inferencing. This article presents a procedure for NLN to learn multi-dimensional mapping of both binary and analog data. The procedure, known as the Supervised Clustering and Matching (SCM) algorithm, provides a means of inferring inductive knowledge from databases. In contrast to gradient descent error correction methods, pattern mapping is learned by an inductive NLN using fast and incremental clustering of input and output patterns. In addition, learning/encoding only takes place when both the input and output match criteria are satisfied in a …

Least Space-Time First Scheduling Algorithm : Scheduling Complex Tasks With Hard Deadline On Parallel Machines, Bo-Chao Cheng

Dissertations

Both time constraints and logical correctness are essential to real-time systems and failure to specify and observe a time constraint may result in disaster. Two orthogonal issues arise in the design and analysis of real-time systems: one is the specification of the system, and the semantic model describing the properties of real-time programs; the other is the scheduling and allocation of resources that may be shared by real-time program modules.

The problem of scheduling tasks with precedence and timing constraints onto a set of processors in a way that minimizes maximum tardiness is here considered. A new scheduling heuristic, Least …

Safe Code Transfromations For Speculative Execution In Real-Time Systems, Mohamed Mohamed Younis

Dissertations

Although compiler optimization techniques are standard and successful in non-real-time systems, if naively applied, they can destroy safety guarantees and deadlines in hard real-time systems. For this reason, real-time systems developers have tended to avoid automatic compiler optimization of their code. However, real-time applications in several areas have been growing substantially in size and complexity in recent years. This size and complexity makes it impossible for real-time programmers to write optimal code, and consequently indicates a need for compiler optimization. Recently researchers have developed or modified analyses and transformations to improve performance without degrading worst-case execution times. Moreover, these optimization …

Massively Parallel Reasoning In Transitive Relationship Hierarchies, Yugyung Lee

Dissertations

This research focuses on building a parallel knowledge representation and reasoning system for the purpose of making progress in realizing human-like intelligence. To achieve human-like intelligence, it is necessary to model human reasoning processes by programs. Knowledge in the real world is huge in size, complex in structure, and is also constantly changing even in limited domains. Unfortunately, reasoning algorithms are very often intractable, which means that they are too slow for any practical applications. One technique to deal with this problem is to design special-purpose reasoners. Many past Al systems have worked rather nicely for limited problem sizes, but …

Application Of Geometric Hashing Techniques To Retrieval Of High Dimensional Objects In Scientific Databases, Joyce Ye Lu

Theses

An approach to designing very fast algorithms for tackling the problem of approximate object matching in very large databases of high-dimensional objects is proposed. Given are a target object C and a database D containing information about a set of high-dimensional objects each of which is represented as a set of points. Our algorithms have an off-line object preprocessing (shape representation) phase and a recognition phase. The described algorithms determine those objects from D which are the closest to object C, according to delete or insert some points, move and rotation. All of these can be achieved very efficiently with …

Abstraction Of An Object-Oriented Vocabulary By Providing A Standardized Interface, Hemant Kothavade

Theses

Controlled vocabularies are ubiquitous in varied application fields. They are particularly helpful in the medical field since they can unify disparate terminologies and provide information in a compact, comprehensible manner. In this thesis, we present a mechanism to efficiently retrieve and update knowledge stored in a controlled vocabulary modeled as an Object-Oriented Database (OODB) system. We aim to provide a standardized interface to the vocabulary, such that the implementation details of the vocabulary are transparent to all users. The user of this standardized interface will typically be an application programmer who is trying to provide the vocabulary's knowledge-base to end …

Automated Parallelization Of Discrete State-Space Generation, David M. Nicol, Gianfranco Ciardo

Computer Science Technical Reports

We consider the problem of generating a large state-space in a distributed fashion. Unlike previously proposed solutions that partition the set of reachable states according to a hashing function provided by the user, we explore heuristic methods that completely automate the process. The first step is an initial random walk through the state space to initialize a search tree, duplicated in each processor. Then, the reachability graph is built in a distributed way, using the search tree to assign each newly found state to classes assigned to the available processors. Furthermore, we explore two remapping criteria that attempt to balance …

An Error Handling Framework For The Orbwork Workflow Enactment Service Of Meteor, Davasish Worah, Amit P. Sheth, Krzysztof J. Kochut, John A. Miller

Kno.e.sis Publications

Workflow Management Systems (WFMSs) can be used to re-engineer, streamline, automate, and track organizational processes involving humans and automated information systems. However, the state-of-the-art in workflow technology suffers from a number of limitations that prevent it from being widely used in large-scale mission critical applications. Error handling is one such issue. What makes the task of error handling challenging is the need to deal with errors that appear in various components of a complex distributed application execution environment, including various WFMS components, workflow application tasks of different types, and the heterogeneous computing infrastructure.

In this paper, we discuss a top-down …

Incorporating A Connectionist Vision Module Into A Fuzzy, Behavior-Based Robot Controller, Doug Blank, J. Oliver Ross

Computer Science Faculty Research and Scholarship

This paper describes the initial steps required to incorporate an artificial neural network vision module into an established fuzzy logic, behavior-based mobile robot and controller. This efficient and robust method is demonstrated to show its effectiveness in simple real-world environments.

Semantics Vs. Syntax Vs. Computations: Machine Models For Type-2 Polynomial-Time Bounded Functionals, James S. Royer

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

This paper investigates analogs of the Kreisel-Lacombe-Shoenfield Theorem in the context of the type-2 basic feasible functionals. We develop a direct, polynomial-time analog of effective operation in which the time bounding on computations is modeled after Kapron and Cook's scheme for their basic polynomial-time functionals. We show that if P = NP, these polynomial-time effective operations are strictly more powerful on R (the class of recursive functions) than the basic feasible functions. We also consider a weaker notion of polynomial-time effective operation where the machines computing these functionals have access to the computations of their procedural parameter, but not to …

Concurrent Simulation Of Plasma Reactors, Marc Rieffel, Stephen Taylor, Jerrell Watts, Sadasivan Shankar

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

This paper summarizes the computational techniques behind a novel concurrent simulation method used for studying the neutral flow inside plasma reactors. The technique is intended to cope with low pressure flow (less than 1.5 Torr) in realistic three-dimensional geometries. It is based on the Direct Simulation Monte Carlo method to accurately model rarefied gas flow. The concurrent formulation operates on a broad variety of shared-memory multiprocessors, multicomputers, and networked workstations.

Simulated Annealing And Genetic Algorithms For Partial Shape Matching, Ender Ozcan, Chilukuri K. Mohan

Electrical Engineering and Computer Science - All Scholarship

Partial shape matching may be viewed as an optimization problem, to be solved using methods such as simulated annealing (SA) and genetic algorithms (GAs). We apply and compare both these methods for matching input shapes with model shapes described in terms of features such as line segments and angles. The quality of matching is gauged using a measure derived from attributed shape grammars [10, 11]. Current results show that both SA and GA succeed in the shape matching task; the GA is faster and yields the global optimum more often than the versions of SA implemented.

A Load Balancing Technique For Multiphase Computations, Jerrell Watts, Marc Rieffel, Stephen Taylor

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

Parallel computations comprised of multiple, tightly interwoven phases of computation may require a different approach to dynamic load balancing than single-phase computations. This paper presents a load sharing method based on the view of load as a vector, rather than as a scalar. This approach allows multiphase computations to achieve higher efficiency on large-scale multicomputers than possible with traditional techniques. Results are presented for two large-scale particle simulations running on 128 nodes of an Intel Paragon and on 256 processors of a Cray T3D, respectively.

Standardization Of A Communication Middleware For High-Performance Real-Time Systems, Arkady Kanevsky, Anthony Skjellum, Jerrell Watts

Electrical Engineering and Computer Science - All Scholarship

The last several years saw an emergence of standardization activities for real-time systems including standardization of operating systems (series of POSIX standards [1]), of communication for distributed (POSIX.21 [10]) and parallel systems (MPI/RT [5]) and real-time object management (realtime CORBA [9]). This article describes the ongoing standardization work and implementation of communication middleware for high performance real-time computing. The real-time message passing interface (MPI/RT) advances the non-real-time high-performance communication standard Message Passing Interface Standard (MPI), emphasizing changes that enable and support real-time communication, and is targeted for embedded, fault-tolerant and other real-time systems. MPI/RT is the only communication middleware layer …

Agent-Based Expert Assistance For Visual Problem Solving, Erika Rogers, Robin R. Murphy, Barb Ericson

Computer Science and Software Engineering

This paper presents a domain-independent architecture for facilitating visual problem solving between robots or softbots and humans. The architecture defines virtual and human agents in terms of their inherent cognitive and perceptual abilities, and their weak and strong knowledge sources. It introduces a third agent, an expert assistant called teleVIA, to mediate the flow of information, facilitate cooperation, filter and cache data, and generate the appropriate visual displays. The agent architecture addresses the technical issues of using an expert assistant to coordinate perception, thought, and action, manage sensing and perception, facilitate diagnosis, and to support the collaboration between people and …

The Recursive Multi-Threaded Software Life-Cycle, Scott James Simon

Theses Digitization Project

No abstract provided.

International Student Services Opportunity Database (Issodb), Sailaja Malireddy

Theses Digitization Project

No abstract provided.

Just Which Reality Do You Mean? Users' Experiences Of Virtual Spaces, Woodrow Heath Pollack

Senior Scholar Papers

Virtual Reality is a relatively new technology in the relatively young field of computer science. The design of Virtual Reality has only recently come into discussion, as well as the implications for this sort of design. I hope to determine how a user can work most efficiently and accurately in a Virtual World. By studying this, I hope to help in the standardization of Virtual Reality design.

Mathematics And Values: Can Philosophy Guide Projects?, Michael H. Veatch

ACMS Journal 2004

The philosophy of mathematics has provided insight on questions of foundations and mathematical truth; however, it has not been very fruitful in guiding the practice of mathematics. This paper attempts to find points of contact between a Christian worldview and the choice of mathematical projects and methods. Three areas are considered: (i) dubitability in current research, (ii) the intrinsic value of contemporary mathematics to contemporary society, and (iii) the affirmation of human value in the use of mathematics. Finally, a framework for valuing mathematics is proposed as an encouragement to think more deeply about how a Christian might choose a …

A System For Recognizing A Large Class Of Engineering Drawings, Yuhong Yu, Ashok Samal, Sharad C. Seth

School of Computing: Faculty Publications

We present a system for recognizing a large class of engineering drawings characterized by alternating instances of symbols and connection lines. The class includes domains such as flowcharts, logic and electrical circuits, and chemical plant diagrams. The output of the system, a netlist identifying the symbol types and interconnections, may be used for design simulation or as a compact portable representation of the drawing. The automatic recognition task is divided into two stages: 1) Domain-independent rules are used to segment symbols from connection lines in the drawing image that has been thinned, vectorized, and preprocessed in routine ways. 2) A …

Genetic Algorithms For The Extended Gcd Problem, Jonathan P. Sorenson

Scholarship and Professional Work - LAS

We present several genetic algorithms for solving the extended greatest common divisor problem. After defining the problem and discussing previous work, we will state our results.

Privacy Issues Dealing With Technology : A Review Of The Literature, Kimberly S. Mccoy

Graduate Research Papers

The sophisticated applications of technology are expanding everyday. Unfortunately, so are the many concerns individuals in society are having about their right to privacy. The actual regulations dealing with one's right to privacy has not expand as rapidly as the applications of technology. Individuals using various types of technology are under the assumption their activities are private; however, this is not the case. It does not seem to matter if you are using a computer for communications work, school, or in the "privacy" of your own home, there is absolutely no privacy when dealing with this type of technology.

This …

The Effects Of User Interface Metaphors On The Learnability Of Computer Systems By Field Dependent And Field Independent Computer Users, Robert N. Urwiler Jr.

CCAC Theses and Dissertations

This study was designed to assess the differences in the learning performance (speed and accuracy) with which field dependent and field independent subjects could complete a set of checkbook management tasks using software employing a user interface making strong use of common checkbook management metaphors versus software employing an interface adhering to a defacto industry standard-based graphical user interface design guideline. It was hypothesized that both field dependent and field independent users would complete tasks more quickly and accurately using both user interface types.

From a population of traditional and non-traditional college students, 64 individuals volunteered to participate in the …

Multiprocessor Out-Of-Core Ffts With Distributed Memory And Parallel Disks, Thomas H. Cormen, Jake Wegmann, David M. Nicol

Computer Science Technical Reports

This paper extends an earlier out-of-core Fast Fourier Transform (FFT) method for a uniprocessor with the Parallel Disk Model (PDM) to use multiple processors. Four out-of-core multiprocessor methods are examined. Operationally, these methods differ in the size of "mini-butterfly" computed in memory and how the data are organized on the disks and in the distributed memory of the multiprocessor. The methods also perform differing amounts of I/O and communication. Two of them have the remarkable property that even though they are computing the FFT on a multiprocessor, all interprocessor communication occurs outside the mini-butterfly computations. Performance results on a small …

Development And Evaluation Of Interactive Courseware For Visualization Of Graph Data Structure And Algorithms, Thomas E. Beutel

CCAC Theses and Dissertations

The primary goal of this dissertation was to develop and pilot test interactive, multimedia courseware which would facilitate learning the abstract structures, operations, and concepts associated with graph and network data structures in Computer Science. Learning objectives and prerequisites are presented in an introduction section of the courseware and a variety of learning activities are provided including tutorials, animated demonstrations, interactive laboratory sessions, and self-tests. Courseware development incorporated principles and practices from software engineering, instructional design, and cognitive learning theories. Implementation utilized an easy-to-use authoring tool, NeoBook Professional (1994), to create the overall framework and the user interfaces, and Microsoft …

A Proposed Solution For Word-Recognition Deficit In The Computer Environment, Hyacinth Williams

CCAC Theses and Dissertations

Most college students with reading disabilities have difficulty with word recognition. The purpose of this study was to use an investigator-made cue word list to increase low word recognition skills among college students while creating slides for a university curriculum using a simple presentation tool. The investigator randomly divided fourteen subjects into two groups. One group received the treatment and the other did not. Subjects received fifty minutes to complete a five-slide presentation. The investigator used four different data collection processes for data collection. Beyond this, the investigator presented the results using rank correlation. Results from this study indicated that …

Vertex-Edge Pseudo-Visibility Graphs: Characterization And Recognition, Joseph O'Rourke, Ileana Streinu

Computer Science: Faculty Publications

We extend the notion of polygon visibility graphs to pseudo-polygons defined on generalized configurations of points. We consider both vertex-to-vertex, as well as vertex-to-edge visibility in pseudo-polygons. We study the characterization and recognition problems for vertex-edge pseudo-visibility graphs. Given a bipartite graph G satisfying three simple properties, which can all be checked in polynomial time, we show that we can define a generalized configuration of points and a pseudo-polygon on it, so that its vertex-edge pseudo-visibility graph is G. This provides a full characterization of vertex-edge pseudo-visibility graphs and a polynomial-time algorithm for the decision problem. It also implies that …