Digital Commons Network^™

Multiagent Systems To Support Networked Scientific Computing, Anupam Joshi, N. Ramakrishnan, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.

Post-Surgical Passive Response Of Local Environment To Primary Tumor Removal, J. A. Adam, C. Bellomo

Mathematics & Statistics Faculty Publications

Prompted by recent clinical observations on the phenomenon of metastasis inhibition by an angiogenesis inhibitor, a mathematical model is developed to describe the post-surgical response of the local environment to the “surgical” removal of a spherical tumor in an infinite homogeneous domain. The primary tumor is postulated to be a source of growth inhibitor prior to its removal at t = 0; the resulting relaxation wave arriving from the disturbed (previously steady) state is studied, closed form analytic solutions are derived, and the asymptotic speed of the pulse is estimated to be about 2 × 10⁻⁴ cm/sec for the …

A System For Query Comprehension, Hock Chuan Chan, Kwok Kee Wei, Keng Siau

Research Collection School Of Computing and Information Systems

A major difficulty of query writing is that users do not fully understand queries. A system providing feedback is proposed so as to enable users to better understand their queries. It is a multi-functional rule-based system. In addition to providing an English translation for the query, it pin-points syntax errors, and suggests possible solutions. It also finds likely semantic errors, and provides possible solutions. The system was implemented for a query language based on the entity relationship model. It is expected to lead to better user performance. Empirical testing showed significant improvement in user performance with the feedback system. The …

Object Matching Using The Dynamic Programming Algorithm, Rhoda Baggs Koss

Theses and Dissertations

A new algorithm for matching objects between images is developed and investigated. Affine transformations, i.e. those with translation, rotation, scaling and shearing between images are considered. Steps along the way include segmentation of the 2 images (referred to as the reference and inspected images), contour tracing of each segment/object in each image, the creation of objects via a new object representation scheme known as length codes (developed in [3]), and the application of the new dynamic warping algorithm. New original concepts include the use of the dynamic warping algorithm on sequences of length codes in order to determine the k …

Cascade Artmap: Integrating Neural Computation And Symbolic Knowledge Processing, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

This paper introduces a hybrid system termed cascade adaptive resonance theory mapping (ARTMAP) that incorporates symbolic knowledge into neural-network learning and recognition. Cascade ARTMAP, a generalization of fuzzy ARTMAP, represents intermediate attributes and rule cascades of rule-based knowledge explicitly and performs multistep inferencing. A rule insertion algorithm translates if-then symbolic rules into cascade ARTMAP architecture. Besides that initializing networks with prior knowledge can improve predictive accuracy and learning efficiency, the inserted symbolic knowledge can be refined and enhanced by the cascade ARTMAP learning algorithm. By preserving symbolic rule form during learning, the rules extracted from cascade ARTMAP can be compared …

On The Power Of Multi-Objects, Prasad Jayanti, Sanjay Khanna

Computer Science Technical Reports

In the standard ``single-object'' model of shared-memory computing, it is assumed that a process accesses at most one shared object in each of its steps. In this paper, we consider a more powerful variant---the ``multi-object'' model---in which each process may access *any* finite number of shared objects atomically in each of its steps. We present results that relate the synchronization power of a type in the multi-object model to its synchronization power in the single-object model. Although the types fetch&add and swap have the same synchronization power in the single-object model, Afek, Merritt, and Taubenfeld showed that their synchronization powers …

Peak-To-Mean Power Control And Error Correction For Ofdm Transmission Using Golay Sequences And Reed-Muller Codes, James A. Davis, J Jedwab

Department of Math & Statistics Faculty Publications

A coding scheme for OFDM transmission is proposed, exploiting a previously unrecognised connection between pairs of Golay complementary sequences and second-order Reed-Muller codes. The scheme solves the notorious problem of power control in OFDM systems by maintaining a peak-to-mean envelope power ratio of at most 3dB while allowing simple encoding and decoding at high code rates for binary, quaternary or higher-phase signalling together with good error correction.

Agdb: A Debugger For Agent Tcl, Melissa Hirschl, David Kotz

Computer Science Technical Reports

The Agent Tcl language is an extension of Tcl/Tk that supports distributed programming in the form of transportable agents. AGDB is a debugger for the Agent Tcl language. AGDB mixes of traditional and distributed debugging facilities. Traditional debugging features include breakpoints (line-specific, conditional, and once-only), watch conditions and variables, and interrupts. Distributed-debugging features address issues inherent in distributed programming such as migration and communication. These capabilities make debugging distributed programs difficult because they add complexities like race conditions to the set of problems a program can encounter. This paper discusses how AGDB uses distributed debugging features to debug agents.

Some Relationships Between Foies And Sigma 1 1 Arity Hierarchies, Guozhu Dong, Limsoon Wong

Kno.e.sis Publications

No abstract provided.

Ua66/3/2 Computer Science Alumni Newsletter, Vol. 10, Wku Computer Science

WKU Administration Documents

Newsletter created by WKU Computer Science for alumni of the program.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 13, Number 2, February 1997, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Automatic Video Pause Detection Filter, Xiaowen Liu, Charles B. Owen, Fillia S. Makedon

Computer Science Technical Reports

Increasing interest in multimedia research has been drawn upon the development of video indexing and content-based image retrieval techniques. In this report, we proposed several pause detection algorithms, which instead of searching for significant visual transitions, the algorithms detect significant pauses in video streams. A realization of the algorithms was implemented using ImageTcl toolkit developed at Dartmouth Experimental Visualization Laboratory. In addition to proposing and studying the effectiveness of the pause detection algorithms, another major goal will be to incorporate our algorithms into ImageTcl and test the stability and applicability of the ImageTcl environment. Priliminary experiments showed relatively good results …

Asml: Automatic Site Markup Language 1.03, Charles B. Owen, Fillia Makedon, Glen Frank, Michael Kenyon

Computer Science Technical Reports

Creation of large and complex World Wide Web sites is hampered by the "page at a time" approach of many tools and the programming knowledge and custom software development required for automated solutions. This report describes the development of the Automatic Site Markup Language (ASML). ASML is a new markup language designed to produce large, complicated web sites which can include dynamic content. ASML extends HTML with new, high-level features while still preserving complete compatibility with common browser and server technologies. It has powerful indexing and searching facilities, and enables the automatic translation of document formats. Most importantly, ASML provides …

An Efficient Scheme For A Distributed Video Retrieval System For Remote Users, Fillia Makedon, James Matthews, Charles Owen, Samuel Rebelsky

Computer Science Technical Reports

The new era of digital video and multimedia technologies has created the potential for large libraries of digital video. With this new technology come the challenges of creating usable means by which such large and diverse depositories of digital information (digital libraries) can be efficiently queried and accessed so that (a) the response is fast, (b) the communication over the Internet is minimal and (c) the retrieval is characterized by high precision and recall. In this paper we discuss how existing digital video editing tools, together with data compression techniques, can be combined to create a fast, accurate and cost …

Transportable Information Agents, Daniela Rus, Robert Gray, David Kotz

Dartmouth Scholarship

Transportable agents are autonomous programs. They can move through a heterogeneous network of computers under their own control, migrating from host to host. They can sense the state of the network, monitor software conditions, and interact with other agents or resources. The network-sensing tools allow our agents to adapt to the network configuration and to navigate under the control of reactive plans. In this paper we describe the design and implementation of the navigation system that gives our agents autonomy. We also discuss the intelligent and adaptive behavior of autonomous agents in distributed information-gathering tasks.

Disk-Directed I/O For Mimd Multiprocessors, David Kotz

Dartmouth Scholarship

Many scientific applications that run on today's multiprocessors, such as weather forecasting and seismic analysis, are bottlenecked by their file-I/O needs. Even if the multiprocessor is configured with sufficient I/O hardware, the file-system software often fails to provide the available bandwidth to the application. Although libraries and enhanced file-system interfaces can make a significant improvement, we believe that fundamental changes are needed in the file-server software. We propose a new technique, disk-directed I/O, to allow the disk servers to determine the flow of data for maximum performance. Our simulations show that tremendous performance gains are possible both for simple reads …

Dynamic Correlations In Porous Media, J.C. Lee

Faculty Publications

When binary liquid mixtures are infused into various random porous media, past experiment have shown that different media affect the dynamic correlations of concentration fluctuations in different ways. Vycor glasses of relatively small pore size and dilute gels allow the exponential bulk mode to remain in the final ensemble average, but Vycor glasses of vary large pore size do not. We take this to mean that the relaxation time of the bulk mode is spatialIy homogeneous in the two former media but heterogeneous in the latter media. Thus we search for a heterogeneous dynamic mode with an Ising model. We …

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 …

Softlab: A Virtual Laboratory Framework For Computational Science, A. C. Catlin, M. G. Gaitatzes, Elias N. Houstis, Z. Ma, S. Markus, Nien-Hwa Wang, S. Weerawarana

Department of Computer Science Technical Reports

No abstract provided.

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.

Studies Of Qcd In E+E- → Hadrons At Ecm = 130 And 136 Gev, D. Buskulic, M. Thulasidas

Research Collection School Of Computing and Information Systems

Studies of QCD in e+e−→e+e−→ Hadrons at Ecm=Ecm=} 130 and 136 GeV The ALEPH Collaboration An analysis of the properties of hadronic final states produced in electron-positron annihilation at centre-of-mass energies of 130 and 136 GeV is presented. The measurements are based on a data sample of 5.7 pb−1pb−1 collected in November 1995 with the \Aleph detector at LEP. Inclusive charged particle distributions, jet rates and event-shape distributions are measured and the results are compared with the predictions of QCD-based models. From the measured distributions quantities are determined for which the dependence on the centre-of-mass energy can be predicted by …

Minimizing Channel Density With Movable Terminals, Ronald I. Greenberg, Jau-Der Shih

Computer Science: Faculty Publications and Other Works

We give algorithms to minimize density for VLSI channel routing problems with terminals that are movable subject to certain constraints. The main cases considered are channels with linear order constraints, channels with linear order constraints and separation constraints, channels with movable modules containing fixed terminals, and channels with movable modules and terminals. In each case, we improve previous results for running time and space by a factor of L/\lgn and L, respectively, where L is the channel length, and n is the number of terminals.

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 …

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 …

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 …

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 …