Physical Sciences and Mathematics Commons^™

An Api For Choreographing Data Accesses, Elizabeth A.M. Shriver, Leonard F. Wisniewski

Computer Science Technical Reports

Current APIs for multiprocessor multi-disk file systems are not easy to use in developing out-of-core algorithms that choreograph parallel data accesses. Consequently, the efficiency of these algorithms is hard to achieve in practice. We address this deficiency by specifying an API that includes data-access primitives for data choreography. With our API, the programmer can easily access specific blocks from each disk in a single operation, thereby fully utilizing the parallelism of the underlying storage system. Our API supports the development of libraries of commonly-used higher-level routines such as matrix-matrix addition, matrix-matrix multiplication, and BMMC (bit-matrix-multiply/complement) permutations. We illustrate our API …

Intelligent Multimedia Tutoring For Manufacturing Education, Erika Rogers, Yolanda Kennedy, T. Walton, P. Nelms, I. Sherry

Computer Science and Software Engineering

This paper describes current work on the design and implementation of intelligent multimedia tutoring modules which are intended to supplement short training courses in Nondestructive Inspection for the Boeing Defense and Space group.

Multimedia In Manufacturing Education Mime, Chris Thompson, Laurie Hodges, Wayne Daley, Erika Rogers

Computer Science and Software Engineering

This paper describes a project funded by the Technology Reinvestment Project (TRP) under the manufacturing education component (MET) to design, build, and evaluate interactive multimedia courseware for manufacturing education. Interactive multimedia is defined as the combination of computer based text, sound, graphics, animation, video, and simulation, commercial and defense industries along with a professional society are collaborating on the project in an effort to address important dual-use issues. Advanced media technologies are being exploited to create virtual, time shifted, and/or remote visits to real world manufacturing systems. The foundations for our efforts and the experiences in the first year of …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 11, Number 9, November 1995, 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.

Using Passion System On Lu Factorization, Haluk Rahmi Topcuoglu, Alok Choudhary

Electrical Engineering and Computer Science - Technical Reports

Parallel I/0 subsystems are added to massively parallel computers in order to lessen I/0 bottleneck to some extent. Up to now, a few number of parallel software systems have been designed and implemented to assist programmers in I/0 intensive applications; PASSION is one of them. By providing parallel I/0 support at the language, compiler and run-time level, PASSION system explores the large design space of parallel systems. The target of this paper is to show the performance benefits of using PASSION I/0 libraries at runtime in comparison with using conventional parallel I/0 primitives for high performance parallel I/0 in LU …

A Simple Solver For Linear Equations Containing Nonlinear Operators, Norman Ramsey

Department of Computer Science Technical Reports

No abstract provided.

Blending Basic Implicit Shapes Using Trivariate Box Splines, Jörg Peters, Michael Wittman

Department of Computer Science Technical Reports

No abstract provided.

Complexity Of Sequential Pattern Matching Algorithms, Mireille Régnier, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Multi-View Access Protcols For Large-Scale Replication, Xiangning (Sean) Liu, Abdelsalam (Sumi) Helal, Bharat K. Bhargava

Department of Computer Science Technical Reports

No abstract provided.

Optimal P-Cyclic Sor For Complex Spectra, S. Galanis, A. Hadjidimos, D. Noutsos

Department of Computer Science Technical Reports

No abstract provided.

Sequence Alignment In Molecular Biology, Alberto Apostolico, Raffaele Fiancarlo

Department of Computer Science Technical Reports

No abstract provided.

Device And Physical Data Independence For Multimedia Presentations, Richard Staehli, Jonathan Walpole, David Maier

Computer Science Faculty Publications and Presentations

Multimedia computing promises access to any type of visual or aural medium on the desktop. But in this networked future, will every type of media be accessible from every terminal device? Current multimedia standards do not allow content that is authored for high-bandwidth workstations to scale down for low-bandwidth applications. The problem is that application requests are commonly interpreted as requests for the highest possible quality and resource overloads are handled by ad hoc methods. We can begin to solve this problem by specifying Quality of Service (QOS) requirements based on functionality rather than on content encoding and device capabilities.

Intelligent Control Of Vehicles: Preliminary Results On The Application Of Learning Automata Techniques To Automated Highway System, Cem Unsal, John S. Bay, Pushkin Kachroo

Electrical & Computer Engineering Faculty Research

We suggest an intelligent controller for an automated vehicle to plan its own trajectory based on sensor and communication data received. Our intelligent controller is based on an artificial intelligence technique called learning stochastic automata. The automaton can learn the best possible action to avoid collisions using the data received from on-board sensors. The system has the advantage of being able to work in unmodeled stochastic environments. Simulations for the lateral control of a vehicle using this AI method provides encouraging results.

On The Equivalence Of Upward And Downward Inheritance Reasoners, Krishnaprasad Thirunarayan

Kno.e.sis Publications

In this paper, we analyze systematically the downward (property flow) and the upward (individual flow) views of inheritance for different categories of inheritance networks. We observe that both these views assign the same meaning to tree-structured hierarchies, and explain the divergence in the interpretation of more general networks in terms of their expressive power. This simple analysis sheds light on the inherent nature of nonmonotonic inheritance and can form the basis for the design of efficient algorithms for certain classes of queries. In addition, we describe the notion of preferential inheritance to specify additional conflict resolution information that can be …

Customizable Operating Systems, Jonathan Walpole, Crispin Cowan, Andrew P. Black, Jon Inouye, Calton Pu, Shanwei Cen

Computer Science Faculty Publications and Presentations

A customizable operating system is one that can adapt to improve its functionality or performance. The need for customizable and application-specific operating systems has been recognized for many years, but they have yet to appear in the commercial market. This paper explores the notion of operating system customizability and examines the limits of existing approaches. The paper begins by surveying system structuring approaches for the safe and efficient execution of customizable operating systems. Then it discusses the burden that existing approaches impose on application software, and explores techniques for reducing this burden. Finally, support for customizability in the Synthetix project …

Quality Of Service Specification For Multimedia Presentations, Richard Staehli, Jonathan Walpole, David Maier

Computer Science Faculty Publications and Presentations

The bandwidth limitations of multimedia systems force tradeoffs between presentation data fidelity and real-time performance. For example, digital video is commonly encoded with lossy compression to reduce bandwidth and frames may be skipped during playback to maintain synchronization. These tradeoffs depend on device performance and physical data representations that are hidden by a database system. If a multimedia database is to support digital video and other continuous media data types, we argue that the database should provide a Quality of Service (QOS) interface to allow application control of presentation timing and information loss tradeoffs.

This paper proposes a data model …

Device And Physical Data Independence For Multimedia Presentations, Richard Staehli, Jonathan Walpole, David Maier

Computer Science Faculty Publications and Presentations

Multimedia computing promises access to any type of visual or aural medium on the desktop. But in this networked future, will every type of media be accessible from every terminal device? Current multimedia standards do not allow content that is authored for high-bandwidth workstations to scale down for low-bandwidth applications. The problem is that application requests are commonly interpreted as requests for the highest possible quality and resource overloads are handled by ad hoc methods. We can begin to solve this problem by specifying Quality of Service (QOS) requirements based on functionality rather than on content encoding and device capabilities.

Measurement Of The Bs0 Lifetime And Production Rate With Ds- ℓ+ Combinations In Z Decays, D. Buskulic, M. Thulasidas

Research Collection School Of Computing and Information Systems

A precise determination of the effective Bs0→K+K− lifetime can be used to constrain contributions from physics beyond the Standard Model in the Bs0 meson system. Conventional approaches select B meson decay products that are significantly displaced from the B meson production vertex. As a consequence, B mesons with low decay times are suppressed, introducing a bias to the decay time spectrum which must be corrected. This analysis uses a technique that explicitly avoids a lifetime bias by using a neural network based trigger and event selection. Using 1.0fb−1 of data recorded by the LHCb experiment, the effective Bs0→K+K− lifetime is …

On The Impact Of Forgetting On Learning Machines, Rūsiņš Freivalds, Efim Kinber, Carl H. Smith

School of Computer Science & Engineering Faculty Publications

People tend not to have perfect memories when it comes to learning, or to anything else for that matter. Most formal studies of learning, however, assume a perfect memory. Some approaches have restricted the number of items that could be retained. We introduce a complexity theoretic accounting of memory utilization by learning machines. In our new model, memory is measured in bits as a function of the size of the input. There is a hierarchy of learnability based on increasing memory allotment. The lower bound results are proved using an unusual combination of pumping and mutual recursion theorem arguments. For …

Automatic Visual Recognition Using Parallel Machines, Yui-Liang Chen

Dissertations

Invariant features and quick matching algorithms are two major concerns in the area of automatic visual recognition. The former reduces the size of an established model database, and the latter shortens the computation time. This dissertation, will discussed both line invariants under perspective projection and parallel implementation of a dynamic programming technique for shape recognition. The feasibility of using parallel machines can be demonstrated through the dramatically reduced time complexity.

In this dissertation, our algorithms are implemented on the AP1000 MIMD parallel machines. For processing an object with a features, the time complexity of the proposed parallel algorithm is O(n) …

Automatic Office Document Classification And Information Extraction, Xiaolong Hao

Dissertations

TEXPR.OS (TEXt PROcessing System) is a document processing system (DPS) to support and assist office workers in their daily work in dealing with information and document management. In this thesis, document classification and information extraction, which are two of the major functional capabilities in TEXPROS, are investigated.

Based on the nature of its content, a document is divided into structured and unstructured (i.e., of free text) parts. The conceptual and content structures are introduced to capture the semantics of the structured and unstructured part of the document respectively. The document is classified and information is extracted based on the analyses …

Application Of Approximate Graph Matching Techniques For Searching Databases Of Two-Dimensional Chemical Structures, Karen R. Pysniak

Theses

This paper proposes the application of approximate graph matching techniques for best-match searching of two-dimensional chemical structure databases based upon topology. Chemical structures are represented as labeled graphs, each atom a node in the graph and each bond an edge. By inserting; deleting and renaming nodes/edges, one structure may be transformed into another. We define similarity as the weighted sum of the costs of these edit operations. An algorithm for approximating the minimum distance between two graphs based on simulated annealing is applied. Best-match searches are performed utilizing this pre-computed distance information and applying the concepts of triangle inequality to …

Evaluable Functions In The GöDel Programming Language: Parsing And Representing Rewrite Rules, Janet Vorvick

Dissertations and Theses

The integration of a functional component into a logic language extends the expressive power of the language. One logic language which would benefit from such an extension is Gödel, a prototypical language at the leading edge of the research in logic programming. We present a modification of the Gödel parser which enables the parsing of evaluable functions in Gödel. As the first part of an extended Gödel, the parser produces output similar to the output from the original Gödel parser, ensuring that Gödel modules are properly handled by the extended-Gödel parser. Parser output is structured to simplify, as much as …

Complexity Analysis Of Two Permutations Used By Fast Cosine Transform Algorithms, Sean S.B. Moore, Leonard F. Wisniewski

Computer Science Technical Reports

Recently developed fast cosine transform (FCT) algorithms require fewer operations than any other known general algorithm. Similar to related fast transform algorithms (e.g., the FFT), these algorithms permute the data before, during, or after the computation of the transform. The choice of this permutation may be an important consideration in reducing the complexity of the permutation algorithm. In this paper, we derive the complexity to generate the permutation mappings used in these FCT algorithms for power-of-2 data sets by representing them as linear index transformations and translating them into combinational circuits. Moreover, we show that one of these permutations not …

Estimating Time Available For Sensor Fusion Exception Handling, Robin R. Murphy, Erika Rogers

Computer Science and Software Engineering

In previous work, we have developed a generate, test, and debug methodology for detecting, classifying, and responding to sensing failures in autonomous and semi-autonomous mobile robots. An important issue has arisen from these efforts: how much time is there available to classify the cause of the failure and determine an alternative sensing strategy before the robot mission must be terminated?

In this paper, we consider the impact of time for teleoperation applications where a remote robot attempts to autonomously maintain sensing in the presence of failures yet has the option to contact the local for further assistance. Time limits are …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 11, Number 8, October 1995, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Finding Real-Valued Single-Source Shortest Paths In O(N^3) Expected Time, Stavros G. Kolliopoulos, Clifford Stein

Computer Science Technical Reports

Given an $n$-vertex directed network $G$ with real costs on the edges and a designated source vertex $s$, we give a new algorithm to compute shortest paths from $s$. Our algorithm is a simple deterministic one with $O(n^2 \log n)$ expected running time over a large class of input distributions. The shortest path problem is an old and fundamental problem with a host of applications. Our algorithm is the first strongly-polynomial algorithm in over 35 years to improve upon some aspect of the running time of the celebrated Bellman-Ford algorithm for arbitrary networks, with any type of cost assignments.

A Neuro-Fuzzy Approach To Agglomerative Clustering, Anupam Joshi, Narendran Ramakrishnan, John R. Rice, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.

An Evaluation Of Transmitting Compressed Images In A Wide Area Network, Melliyal Annamalai, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.

Www//Pdepack A Web Based Problem Solving Environment For Partial Differential Equations, W. R. Dyksen, Elias N. Houstis, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.