Physical Sciences and Mathematics Commons^™

Consistent And Recoverable Agent-Based Access To Heterogeneous Mobile Databases, Evaggelia Pitoura, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.

Adapting Distributed Database Systems For High Availability, Xiangning Liu, Evaggelia Pitoura, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.

Multi-Parameterized Schwarz Alternating Methods For Elliptic Boundary Value Problems, S. B. Kim, A. Hadjidimos, Elias N. Houstis, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Active Defense Of A Computer System Using Autonomous Agents, Mark Crosbie, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.

Concurrent And Fail-Safe Replicated Simulations On Heterogeneous Networks: An Introduction To Eclipse, Felipe Knop, Edward Mascarenhas, Vernon J. Rego, V. S. Sunderam

Department of Computer Science Technical Reports

No abstract provided.

Dynamics Of Order-Parameter-Conserving Ising Models At T > Tc, J.C. Lee

Faculty Publications

http://journals.aps.org/prb/pdf/10.1103/PhysRevB.51.2661

A Study Of D*+ Π- Production In Semileptonic B Decay, D. Buskulic, M. Thulasidas

Research Collection School Of Computing and Information Systems

In a sample of 1.5 million hadronic decays of the Z collected by the ALEPH detector, a search is carried out for the decays B→ D10(2420)l−νX and B→ D2∗0(2460)l−νX. The product branching ratio for D10 production is measured to be Br(b →B) × Br(B→ D10l−νX) × Br(D10→ D∗+π−) = (2.04 ± 0.58stat± 0.34syst) × 10−3, and a 95% confidence level limit of Br(b →B) × Br(B→ D2∗0l−νX) × Br(D2∗0→ D∗+π−) ≤ 0.81 × 10−3 is obtained for D2∗0 production.A topological search sensitive to the processes above, but also to wide resonances that decay to D∗+π− and to non-resonant D∗+π− production …

A Type I Hybrid Arq System With Adaptive Code Rates, Robert H. Deng, Michael L. Lin

Research Collection School Of Computing and Information Systems

Type I hybrid ARQ systems use an error-control code of fixed rate for error-correction in each transmitted packet. In such systems, the code rate must be carefully chosen to match the channel bit error rate (BER) in order to maximize system throughput. Whenever there is a mismatch between code rate and channel BER, the throughput suffers. In this paper, we proposed a type I hybrid ARQ system which automatically adjusts its code rates to match channel BERs. The proposed system is very simple to implement and yet performs significantly better than type I hybrid ARQ systems of fixed code rate

Off-Line Hand-Printed Chinese Character Recognition Based On Stroke Matching, Sunshine Chang

Theses

The specific purpose of this thesis is the automated recognition of the off-line Chinese hand-printed characters by using a blue ball-point pen. Through mask processing, the main components in a Chinese character such as vertical, horizontal, and slant strokes can be extracted. Then, the connected components with the coordinates of the top, bottom, leftmost, and rightmost ends of each stroke extracted are found. From these coordinates, the length and position of each stroke can be computed.

According to the number, relative length, and relative position of each stroke, both of the coarse and fine rule-based classification can be made, and …

Requirements, Design And Business Process Reengineering As Vital Parts Of Any System Development Methodology, Alicja Ruszala

Theses

This thesis analyzes different aspects of system development life cycle, concentrating on the requirements and design stages. It describes various methodologies, methods and tools that have been developed over the years. It evaluates them and compares them against each other. Finally a conclusion is made that there is a very important stage missing in the system development life cycle, which is the Business Process Reengineering Stage.

Disk-Directed I/O For An Out-Of-Core Computation, David Kotz

Computer Science Technical Reports

New file systems are critical to obtain good I/O performance on large multiprocessors. Several researchers have suggested the use of collective file-system operations, in which all processes in an application cooperate in each I/O request. Others have suggested that the traditional low-level interface (read, write, seek) be augmented with various higher-level requests (e.g., read matrix), allowing the programmer to express a complex transfer in a single (perhaps collective) request. Collective, high-level requests permit techniques like two-phase I/O and disk-directed I/O to significantly improve performance over traditional file systems and interfaces. Neither of these techniques have been tested on anything other …

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

Dartmouth Scholarship

Many scientific applications that run on today's multiprocessors 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 improved 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, \em disk-directed I/O, that flips the usual relationship between server and client to allow the disks (actually, disk servers) to determine the flow of data for maximum performance. Our simulations show that tremendous performance gains …

1.2, Yolanda Jones

E-lert

No abstract provided.

A Cognitive Theory Of Visual Interaction, Erika Rogers

Computer Science and Software Engineering

No abstract provided.

Knowledge-Based Image Enhancement For Cooperative Tele-Assistance, Erika Rogers, Versonya Dupont, Robin R. Murphy, Nazir Warsi

Computer Science and Software Engineering

There is an increasing need in complex environments for computerized assistance, both for the effective filtering and display of pertinent information or data, and also for the decision-making task itself. The combination of artificial intelligence techniques with image processing and graphics capabilities provides the foundation for building intelligent systems which act as mediaries between the human and the task domain. In the field of tele-assistance, this type of system enables cooperative problem-solving between a remote semi-autonomous robot and a local human supervisor. This paper describes current work on such a system, with an emphasis on the development of knowledge-based image …

Cooperative Assistance For Remote Robot Supervision, Erika Rogers, Robin R. Murphy, A. Stewart, Nazir Warsi

Computer Science and Software Engineering

This paper describes current work on the design of a computer system which provides cooperative assistance for the supervision of remote semi-autonomous robots. It consists of a blackboard-based framework which allows communication between the remote robot, the local human supervisor, and an intelligent mediating system, which aids interactive exception handling when the remote robot requires the assistance of the local operator.

Hga: A Hardware-Based Genetic Algorithm, Stephen D. Scott, Ashok Samal, Sharad C. Seth

CSE Conference and Workshop Papers

A genetic algorithm (GA) is a robust problem-solving method based on natural selection. Hardware's speed advantage and its ability to parallelize offer great rewards to genetic algorithms. Speedups of 1-3 orders of magnitude have been observed when frequently used software routines were implemented in hardware by way of reprogrammable field-programmable gate arrays (FPGAs). Reprogrammability is essential in a general-purpose GA engine because certain GA modules require changeability (e.g. the function to be optimized by the GA). Thus a hardware-based GA is both feasible and desirable. A fully functional hardware-based genetic algorithm (the HGA) is presented here as a proof-of-concept system. …

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

CSE Conference and Workshop Papers

We present a complete system for recognizing a large class of symbolic engineering drawings that includes flowcharts, chemical plant diagrams, and logic & electrical circuits. The output of the system, a netlist identifying the symbol types and interconnections, may be used for design verification or as a compact portable representation of the drawing. The automatic recognition task is done in two stages: (1) domain-independent rules segment symbols from connection lines in the preprocessed drawing image and (2) an understanding subsystem makes use of a set of domain-specific matchers to classify symbols and correct errors automatically. A graphical user interface is …

Parallel Test Generation With Low Communication Overhead, Sivaramakrishnan Venkatraman, Sharad C. Seth, Prathima Agrawal

CSE Conference and Workshop Papers

In this paper we present a method of parallelizing test generation for combinational logic using boolean satisfiability. We propose a dynamic search-space allocation strategy to split work between the available processors. This strategy is easy to implement with a greedy heuristic and is economical in its demand for inter-processor communication. We derive an analytical model to predict the performance of the parallel versus sequential implementations. The effectiveness of our method and analysis is demonstrated by an implementation on a Sequent (shared memory) multiprocessor. The experimental data shows significant performance improvement in parallel implementation, validates our analytical model, and allows predictions …

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

BITs and PCs Newsletter

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

The Genus 22 Crossing Number Of K9, Adrian Riskin

Mathematics

Our main result is that a 1971 conjecture due to Paul Kainen is false. Kainen's conjecture implies that the genus 2 crossing number of K 9 is 3. We disprove the conjecture by showing that the actual value is 4. The method used is a new one in the study of crossing numbers, involving proof of the impossibility of certain genus 2 embeddings of Ks.

Disseminatorik. Zur Dekonstruktion Der Techno-Logik, Rudolf Kaehr

Rudolf Kaehr

POLYKONTEXTURALE LOGIK. Zur Konzeption, Formalisierung und Validierung. PROÖMIK UND DISSEMINATORIK Abbreviaturen transklassischen Denkens. DISKONTEXTURALITATEN: WOZU NEUE FORMEN DES DENKENS? Zur Kritik der logischen Voraussetzungen der Second Order Cybernetics und der Systemtheorie DISSEMINATORIK: ZUR LOGIK DER 'SECOND ORDER CYBERNETICS' Von den 'Laws of Form' zur Logik der Reflexionsform VOM 'SELBST' IN DER SELBSTORGANISATION Reflexionen zu den Problemen der Konzeptionalisierung und Formalisierung selbstbezüglicher Strukturbildungen SUFI´S DRAI: WOZU DISKONTEXTURALITATEN IN DER AI ? KALKÜLE FÜR SELBSTREFERENTIALITAT ODER SELBSTREFERENTIELLE KALKÜLE? SKIZZE EINER GRAPHEMATISCHEN SYSTEMTHEORIE Zur Problematik der Heterarchie verteilter Systeme im Kontext der New „second-order“ Cybernetics EINÜBUNG IN EINE ANDERE LEKTÜRE. Diagramm einer Rekonstruktion …

Technology, Communication And The Future, David Morgan Lochhead

Dr. David Morgan Lochhead

The future in a "society of generalized communications." final reflection at Ecunet '95, Baltimore, Maryland, May 24, 1995

Book Review: Reasoning Agents In A Dynamic World: The Frame Problem. Kenneth M. Ford And Patrick J. Hayes, Eds.,, Jozsef A. Toth

Jozsef A Toth Ph.D.

No abstract provided.

Living In Virtual Un/Reality, David Morgan Lochhead

Dr. David Morgan Lochhead

Reality and Cyberspace. The Opening Address to the Ecunet '95 Conference in Baltimore, Maryland, May 21, 1995

A Single-Stroke Orientation-Orient Gesture System, Yike Hu

All Computer Science and Engineering Research

No abstract provided.

Many-To-Many Personalized Communication With Bounded Traffic, Sanjay Ranka, Ravi V. Shankar, Khaled A. Alsabti

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

This paper presents solutions for the problem of many-to-many personalized communication, with bounded incoming and outgoing traffic, on a distributed memory parallel machine. We present a two-stage algorithm that decomposes the many-to-many communication with possibly high variance in message size into two communications with low message size variance. The algorithm is deterministic and takes time 2tµ (+ lower order terms) when t >= O(p2; + p tau/µ). Here t is the maximum outgoing or incoming traffic at any processor, tau is the startup overhead and µ is the inverse of the data transfer rate. Optimality is achieved when the traffic …

Kripke Logical Relations And Pcf, Peter W. O'Hearn, John G. Riecke

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

Sieber has described a model of PCF consisting of continuous functions that are invariant under certain (finitary) logical relations, and shown that it is fully abstract for closed terms of up to third-order types. We show that one may achieve full abstraction at all types using a form of "Kripke logical relations" introduced by Jung and Tiuryn to characterize λ definability.

Objects, Interference, And The Yoneda Embedding, Peter W. O'Hearn, Uday S. Reddy

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

We present a new semantics for Algol-like languages that combines methods from two prior lines of development: [1] the object-based approach of [28,29], where the meaning of an imperative program is described in terms of sequences of observable actions, and [2] the functor-category approach initiated by Reynolds [31], where the varying nature of the run-time stack is explained using functors from a category of store shapes to a category of cpos. The semantics gives an account of both the phenomena of local state and irreversibility of state change. As an indication of the accuracy obtained, we present a full abstraction …

Syntactic Control Of Interference Revisited, Peter W. O'Hearn, A. J. Power, M. Takeyama, R. D. Tennent

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

In "Syntactic Control of Interference" (POPL, 1978), J. C. Reynolds proposes three design principles intended to constrain the scope of imperative state effects in Algol-like languages. The resulting linguistic framework seems to be a very satisfactory way of combining functional and imperative concepts, having the desirable attributes of both purely functional languages (such as pcf) and simple imperative languages (such as the language of while programs). However, Reynolds points out that the "obvious" syntax for interference control has the unfortunate property that fi-reductions do not always preserve typings. Reynolds has subsequently presented a solution to this problem (ICALP, 1989), but …