Digital Commons Network^™

Automatic Identification Of Icosahedral Virus Particles In Electron Micrographs, Ioana Maria Martin, Dan C. Marinescu

Department of Computer Science Technical Reports

No abstract provided.

The Clam Approach To Multithreaded Communication On Shared-Memory Multiprocessors: Design And Experiments, Joan Carlos Gomez, Edward Mascarenhas, Vernon J. Rego

Department of Computer Science Technical Reports

No abstract provided.

Supporting Search For Reusable Software Objects, T. Isakowitz, Robert J. Kauffman

Research Collection School Of Computing and Information Systems

Prior research has shown that achieving high levels of software reuse in the presence of repository and object-based computer-aided software engineering (CASE) development methods presents interesting human, managerial and technical challenges. This article presents research that seeks to enhanced software development performance through reuse. We propose automated support for developers who search large repositories for the appropriate reusable software objects. We characterize search for repository objects in terms of a multistage model involving screening, identification, and the subsequent choice between new object construction or reusable object implementation. We propose automated support tools, including ORCA, a software Object Reuse Classification Analyzer, …

Measurement Of Hadron And Lepton-Pair Production From E+E- Annihilation At Centre-Of-Mass Energies Of 130 And 136 Gev, Buskulic, D.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

A Methodology For Reengineering Relational Databases To An Object-Oriented Database, Pedro A. Linhares Lima

Theses and Dissertations

This research proposes and evaluates a methodology for reengineering a relational database to an object-oriented database. We applied this methodology to reengineering the Air Force Institute of Technology Student Information System (AFITSIS) as our test case. With this test case, we could verify the applicability of the proposed methodology, especially because AFITSIS comes from an old version of Oracle RDBMS. We had the opportunity to implement part of the object model using an object-oriented database, and we present some peculiarities encountered during this implementation. The most important result of this research is that it demonstrated that the proposed methodology can …

Towards Designing A Knowledge-Based Tutoring System : Sql-Tutor As An Example, Gang Zhou

Dissertations

A Knowledge-Based Tutoring System, also sometimes called an Intelligent Tutoring System, is a computer based instructional system that uses artificial intelligence techniques to help people learn some subject. The goal of the system is to provide private tutoring to its students based on their different backgrounds, requests, and interests. The system knows what subject materials it should teach, when and how to teach them, and can diagnose the mistakes made by the students and help them correct the mistakes.

The major objective of this dissertation is to investigate and develop a generic framework upon which we can build a Knowledge-Based …

Integrating Hypertext With Information Systems Through Dynamic Mapping, Jiangling Wan

Dissertations

This dissertation presents a general hypertext model (GHMI) supporting integration of hypertext and information systems through dynamic mapping. Information systems integrated based on this model benefit from hypertext function-alities (such as linking, backtracking, history, guided tours, annotations, etc.) while preserving their own computation capabilities. Although systems supporting integration of hypertext and interface-oriented information systems do exist in hypertext literature, there is no existing model or system effectively supporting integration of hypertext and computation-oriented information systems. GHMI makes its major contributions by both extending and specifying the well-known Dexter Hypertext Reference Model. GHMI extends the Dexter model to overcome its limitations. …

Theory And Design Of Portable Parallel Programs For Heterogeneous Computing Systems And Networks, Ying-Chieh Wu

Dissertations

A recurring problem with high-performance computing is that advanced architectures generally achieve only a small fraction of their peak performance on many portions of real applications sets. The Amdahl's law corollary of this is that such architectures often spend most of their time on tasks (codes/algorithms and the data sets upon which they operate) for which they are unsuited. Heterogeneous Computing (HC) is needed in the mid 90's and beyond due to ever increasing super-speed requirements and the number of projects with these requirements. HC is defined as a special form of parallel and distributed computing that performs computations using …

Contention-Free Scheduling Of Communication Induced By Array Operations On 2d Meshes, Andreas Bernhard Georg Eberhart

Dissertations and Theses

Whole array operations and array section operations are important features of many data-parallel languages. Efficient implementation of these operations on distributed-memory multicomputers is critical to the scalability and high-performance of data-parallel programs. This thesis presents an approach for analyzing communication patterns induced by array operations and for using run-time information to schedule the message flow. The distributed, dynamic scheduling algorithms guarantee link-contention-free data transfer and utilize network resources almost optimally. They incur little overhead, which is important in order not to reduce the speedup gained by the parallel execution. The algorithms can be used by compilers for the generation of …

A Brief Introduction To Formal Methods, Paul E. Black, Kelly M. Hall, Michael D. Jones, Trent N. Larson, Phillip J. Windley

Faculty Publications

As hardware designs grow in size and complexity, current design methods are proving less adequate. Current methods for specification, design, and test are typically empirical or informal, that is, they are based on experience and argument. Formal methods are solidly based on mathematical logic systems and precise rules of inference. Formal methods offer a discipline which complements current methods so designers can successfully meet the demand for high performance systems. Formal methods covers a broad and diverse set of techniques aimed at improving computer correctness. This paper explains the role of specifications and implementation models in formal methods, and different …

Communication Games, Kimberly I. Noonan

Honors Theses

A communication game combines traditional n-person game theory with graph theory. The result is a model of a bargaining situation where communication is restricted. The game's multilinear extension (MLE), a polynomial that summarizes the solutions of the game, is well known for the case where the graph is a tree or simple cycle. This paper simplifies the computation of MLE of the communication game in the case when the graph is a series of simple cycles. The results are then applied to studying the power of each Canadian province in passing an amendment to the constitution, taking geographic location into …

Mobile Agents For Mobile Computing, Robert Gray, David Kotz, Saurab Nog, Daniela Rus, George Cybenko

Computer Science Technical Reports

Mobile agents are programs that can move through a network under their own control, migrating from host to host and interacting with other agents and resources on each. We argue that these mobile, autonomous agents have the potential to provide a convenient, efficient and robust programming paradigm for distributed applications, particularly when partially connected computers are involved. Partially connected computers include mobile computers such as laptops and personal digital assistants as well as modem-connected home computers, all of which are often disconnected from the network. In this paper, we describe the design and implementation of our mobile-agent system, Agent Tcl, …

Computer Technology Skills Of Preservice And Inservice Elementary School Teachers, Sheila M. Bailey

Electronic Dissertations and Theses

The major purpose of this investigation is to determine the level of computer technology competencies held by both preservice and present teachers. A computer technology survey will be issued to preservice teachers and present teachers to assess their level of computer skills. The results will be grouped into three levels of computer knowledge: awareness, literacy, and application. Secondly this study would like to determine if more computer instruction is being received in the preservice or in the inservice environment. It is hypothesized that most preserved and present teachers will fall into the levels of awareness and literacy. It is also …

Probabilistic Analysis Of The Median Rule: Asymptotics And Applications, Anil Ravindran Menon, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

The solution of integer optimization problems by relaxation methods consists of three parts. First, the discrete problem is converted into a continuous optimization problem, which is generally more tractable. Second, the relaxed problem is solved efficiently, yielding a optimal solution in the continuous space. Finally, an assignment procedure is used to map this solution to a "suitable" discrete solution. One heuristic - we call it the relaxation heuristic - that often guides the choice and design of assignment algorithms is: "given a continuous optimal solution, the corresponding integer optimal solution is likely to be nearby" (with respect to some well …

Proof Strategies For Hardware Verification, Robert Eastham, Krishnaprasad Thirunarayan

Kno.e.sis Publications

Ascertaining correctness of digital hardware designs through simulation does not scale-up for large designs because of the sheer combinatorics of the problem. Formal verification of hardware designs holds promise because its computational complexity is of the order of number of different types of components (and not number of components in the design). This approach requires the specification of the behavior and the design in a formal language, and reason with them using a theorem prover. In this paper we attempt to develop a methodology for writing and using these specifications for some important classes of hardware circuits. We examine digital …

The Use Of Non-Commutative Algebra In Cryptographically Secure Pseudo-Random Number Generators, Brian M. Mckeever

Honors Theses

This thesis begins with a general overview of pseudo-random number generators and some of their applications. This thesis then describes their applications to cryptography, and some additional requirements imposed by cryptography. This thesis then provides an introduction to the ring of quaternions, and discusses how they can be included in pseudo-random number generators. Finally, this thesis provides a description of the performance of these generators.

Error Correction Via A Post-Processor For Continuous Speech Recognition, Eric K. Ringger, James F. Allen

Faculty Publications

This paper presents a new technique for overcoming several types of speech recognition errors by post-processing the output of a continuous speech recognizer. The post-processor output contains fewer errors, thereby making interpretation by higher-level modules, such as a parser, in a speech understanding system more reliable. The primary advantage to the post-processing approach over existing approaches for overcoming SR errors lies in its abilityto introduce options that are not available in the SR module’s output. This work provides evidence for the claim that a modern continuous speech recognizer can be used successfully in “black-box” fashion for robustly interpreting spontaneous utterances …

Dartflow: A Workflow Management System On The Web Using Transportable Agents, Ting Cai, Peter A. Gloor, Saurab Nog

Computer Science Technical Reports

Workflow management systems help streamline business processes and increase productivity. This paper describes the design and implementation of the DartFlow workflow management system. DartFlow uses Web-browser embedded Java applets as its front end and transportable agents as the backbone. While Java applets provide a safe and platform independent GUI, the use of transportable agents makes DartFlow highly flexible and scalable. This paper describes the design and implementation of DartFlow, as well as a workflow application that exploits DartFlow's agent-based design.

The Galley Parallel File System, Nils Nieuwejaar, David Kotz

Computer Science Technical Reports

Most current multiprocessor file systems are designed to use multiple disks in parallel, using the high aggregate bandwidth to meet the growing I/O requirements of parallel scientific applications. Many multiprocessor file systems provide applications with a conventional Unix-like interface, allowing the application to access multiple disks transparently. This interface conceals the parallelism within the file system, increasing the ease of programmability, but making it difficult or impossible for sophisticated programmers and libraries to use knowledge about their I/O needs to exploit that parallelism. In addition to providing an insufficient interface, most current multiprocessor file systems are optimized for a different …

The Emergence Of Alife, P.D. Quick

SWITCH

Interview with Kenneth E. Rinaldo, an artist who is on the Board of Directors of YLEM. Within this interview, many topics are covered, including artificial life, simulations, the meaning of art, spirituality, and television. The interview also goes into the personal work and life of Rinaldo, whose focus includes many of these subjects. Some of the more specific subjects include intelligence without consciousness, the combination of science and art, and Ken Rinaldo’s The Flock, an interactive A-Life sculpture.

Dynamic Scheduling Of Process Groups, Kuei Yu Wang, Dan C. Marinescu, Octavian F. Carbunar

Department of Computer Science Technical Reports

No abstract provided.

Multi-Agent Simulation Of Complex Heterogeneous Models In Scientific Computing, Anupam Joshi, Tzvetan Drashansky, John R. Rice, Sanjiva Weerawarana, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.

A Color-Based Technique For Measuring Visible Loss For Use In Image Data Communication, Melliyal Annamalai, Aurobindo Sundaram, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.

Integrated Multimedia Timeline Of Medical Images And Data For Thoracic Oncology Patients, Denise R. Aberle, John David N. Dionisio, Michael F. Mcnitt-Gray, Ricky K. Taira, Alfonso F. Cárdenas, Jonathan G. Goldin, Kathleen Brown, Robert A. Figlin, Wesley W. Chu

Computer Science Faculty Works

A prototype multimedia medical database has been developed to provide image and textual data for thoracic oncology patients undergoing treatment of advanced malignancies. The database integrates image data from the hospital pieture archiving and communication system with textual reports from the radiology information system, alphanumeric data contained in the hospital information system, and other electronic medical data. The database presents information in a timeline format and also contains visualization programs that permit the user to view and annotate radiographic measurements in tabular or graphic form. The database provides an efficient and intuitive display of the changing status of oncology patients. …

New Methods In Finite First-Order Model Search, Olga Shumsky, Fikret Ercal, Ralph W. Wilkerson

Computer Science Technical Reports

An automated first-order theorem prover, armed with appropriate strategies, will find a proof of a true conjecture, but will, in theory, run indefinitely if no proof exists. In reality, if no proof exists, the execution will be terminated by user-defined constraints, such as running time or memory usage limit. In this case the the question of validity of the conjecture remains unanswered. An automated first-order model generator gives one the ability to find counterexamples, if any exist, showing that the conjecture is invalid. A model generator also helps find the illustrations of previously proved theorems. It can be viewed as …

Computer Assisted Control Of Robotic Rock Drilling Equipment Using Rock Face Image Mapping, William Robert Macneil, Peter (C. Y.)(Chung You) Ho

Computer Science Technical Reports

Use of a totally unmanned mining robot is an ideal solution in removing humans from the dangerous underground mining environment. However, a complete autonomous system is a long way from reality. In the meantime, steps towards that goal can be made and integrated into current mining technology to take away some of the risk and stress from the miner making him more alert and the environment safer for those that do have to be undergroμnd. For our purposes here, the machine will be an automated robotic platform with the intelligence necessary for accurate placement of the drill tip on an …

Software Engineering And Hypermedia Application Design: The Classic Life Cycle Vs. Relationship Management Methodology, Stacy Lukins

Honors Capstone Projects and Theses

No abstract provided.

Visibility-Related Problems On Parallel Computational Models, Himabindu Gurla

Computer Science Theses & Dissertations

Visibility-related problems find applications in seemingly unrelated and diverse fields such as computer graphics, scene analysis, robotics and VLSI design. While there are common threads running through these problems, most existing solutions do not exploit these commonalities. With this in mind, this thesis identifies these common threads and provides a unified approach to solve these problems and develops solutions that can be viewed as template algorithms for an abstract computational model. A template algorithm provides an architecture independent solution for a problem, from which solutions can be generated for diverse computational models. In particular, the template algorithms presented in this …

Low-Degree Spanning Trees Of Small Weight, Samir Khuller, Balaji Raghavachari, Neal Young

Dartmouth Scholarship

Given n points in the plane, the degree-K spanning-tree problem asks for a spanning tree of minimum weight in which the degree of each vertex is at most K. This paper addresses the problem of computing low-weight degree-K spanning trees for $K > 2$. It is shown that for an arbitrary collection of n points in the plane, there exists a spanning tree of degree 3 whose weight is at most 1.5 times the weight of a minimum spanning tree. It is shown that there exists a spanning tree of degree 4 whose weight is at most 1.25 times …

An Improved Hypercube Bound For Multisearching And Its Applications, Mikhail J. Atallah

Department of Computer Science Technical Reports

No abstract provided.