Physical Sciences and Mathematics Commons^™

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 4, April 1994, 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.

Tcp Buffering And Performance Over An Atm Network, Douglas E. Comer, John C. Lin

Department of Computer Science Technical Reports

No abstract provided.

Maintaining Consistency Of Data In Mobile Distributed Environments, Evaggelia Pitoura, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.

Supporting Complex Data Types In A Relational Distributed Database System, Bharat Bhargava, Yin-He Jiang

Department of Computer Science Technical Reports

No abstract provided.

Authorship Analysis: Identifying The Author Of A Program, Ivan Krsul

Department of Computer Science Technical Reports

No abstract provided.

Countering Abuse Of Name-Based Authentication, Christoph L. Schuba, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.

A Performance-Driven Routing Approach For Mcm-C, Qiong Yu

Masters Theses

In this paper, a new routing methodology for Ceramic MultiChip Module (MCM-C) is presented. In the proposed approach, the routing space is partitioned into several towers and the routing process is decomposed into three phases, namely, routing distribution, terminal assignment, and tower routing. During the routing distribution phase, the routing is uniformly distributed among towers. The locations of nets on the faces of each tower are assigned during the terminal assignment phase whereas the exact paths for the nets in each tower are determined during the tower routing phase.

The existing approaches to MCM routing are extensions of two-dimensional approaches …

Polylog Depth Circuits For Integer Factoring And Discrete Logarithms, Jonathan P. Sorenson

Scholarship and Professional Work - LAS

AbstractIn this paper, we develop parallel algorithms for integer factoring and for computing discrete logarithms. In particular, we give polylog depth probabilistic boolean circuits of subexponential size for both of these problems, thereby solving an open problem of Adleman and Kompella.

Existing sequential algorithms for integer factoring and discrete logarithms use a prime base which is the set of all primes up to a bound B. We use a much smaller value for B for our parallel algorithms than is typical for sequential algorithms. In particular, for inputs of length n, by setting B = nlogdn with d a positive …

Global Picture Archiving And Communication Systems (Gpacs): An Overview, Russell C. Ellis

Theses and Dissertations

The world is currently experiencing a computer revolution. With the expansion and development of new computer technology, the age of video is upon us. The medical world is also currently undergoing a dramatic change. With the development and perfection of non-invasive techniques of probing the body, large amounts of computer data is collected and much of it is used to generate images. The organization and management of these images is the topic of this thesis. The discussion of storage schemes, databases, communications and data compression techniques gives the reader a background and some insight to the current state of the …

Genetic Algorithms And Artificial Life, Melanie Mitchell, Stephanie Forrest

Computer Science Faculty Publications and Presentations

Genetic algorithms are computational models of evolution that play a central role in many artificial-life models. We review the history and current scope of research on genetic algorithms in artificial life, giving illustrative examples in which the genetic algorithm is used to study how learning and evolution interact, and to model ecosystems, immune system, cognitive systems, and social systems. We also outline a number of open questions and future directions for genetic algorithms in artificial-life research

Dynamic Task Scheduling For The Atamm Multicomputer Operating System Using Embedded Firmware On Microcontrollers, Sudhir Sastry

Electrical & Computer Engineering Theses & Dissertations

A dynamic task scheduling strategy for the distributed processing of large grain dataflow algorithms using embedded firmware on an ATAMM testbed consisting of interconnected microcontrollers is presented in this thesis. The ODU/NASA developed Algorithm to Architecture Mapping Model, ATAMM, uses marked graph models to specify data and control flow for the execution of iterative, deterministic large grain dataflow algorithms in a multicomputing environment. The testbed consists of a bank of four 68HC11 microcontrollers that communicate over a token bus. The token bus arbitration scheme used is contention free and well suited for real-time computing applications. The execution of data flow …

Performance Analysis Of Disk Mirroring Techniques, Taysir Abdalla

FIU Electronic Theses and Dissertations

Unequaled improvements in processor and I/O speeds make many applications such as databases and operating systems to be increasingly I/O bound. Many schemes such as disk caching and disk mirroring have been proposed to address the problem. In this thesis we focus only on disk mirroring. In disk mirroring, a logical disk image is maintained on two physical disks allowing a single disk failure to be transparent to application programs. Although disk mirroring improves data availability and reliability, it has two major drawbacks. First, writes are expensive because both disks must be updated. Second, load balancing during failure mode operation …

Rule-Based Run Control And Evaluation For Simulation, Robert F. Gordon Ph.D., Kow C. Chang, Edward A. Macnair

Faculty Works: MCS (1984-2023)

RC 19494 (84719)

Modeling projects are often faced with a large parameter space that has to be explored in order to produce a set of performance measures representing the behavior of the systems under study. In this paper, we describe a software component that provides the analyst with the functionality to specify a design of experiments and execute a search algorithm over the resulting parameter space. The component invokes the associated simulation runs and compares the results to a goal to determine the solution. This component has been implemented as the run control mechanism in the RESearch Queueing Modeling Environment …

A Multi-Chip Module Implementation Of A Neural Network, Tony R. Martinez, George L. Rudolph, Linton G. Salmon, Matthew G. Stout

Faculty Publications

The requirement for dense interconnect in artificial neural network systems has led researchers to seek high-density interconnect technologies. This paper reports an implementation using multi-chip modules (MCMs) as the interconnect medium. The specific system described is a self-organizing, parallel, and dynamic learning model which requires a dense interconnect technology for effective implementation; this requirement is fulfilled by exploiting MCM technology. The ideas presented in this paper regarding an MCM implementation of artificial neural networks are versatile and can be adapted to apply to other neural network and connectionist models.

Decoding Linear Block Codes Using A Priority-First Search: Performance Analysis And Suboptimal Version, Yunghsiang S. Han, Carlos R.P. Hartmann, Kishan Mehrotra

Electrical Engineering and Computer Science - Technical Reports

An efficient maximum-likelihood soft-decision decoding algorithm for linear block codes using a generalized Dijkstra's Algorithm was proposed by Han, Hartmann, and Chen. In this report we prove that this algorithm is efficient for most practical communication systems where the probability of error is less than 10-3 by finding an upper bound of the computation performance of the algorithm. A suboptimal decoding algorithm is also proposed. The performance of this suboptimal decoding algorithm is within 0.25 dB and 0.5 dB of the performance of an optimal decoding algorithm for the (104, 52) binary extended quadratic residue code and the (128, 64) …

A Topology-Aware Collision Resolution Algorithm, Lewis Barnett Iii

Department of Math & Statistics Technical Report Series

A new collision resolution algorithm called the Space Division Multiple Access protocol (SDMA) is presented. SDMA gains a performance advantage over similar protocols by using information about the positions of stations on the network. The protocol can operate asynchrononsly on a broadcast bus, allowing variable sized packet traffic. Through simulation the protocol is demonstrated to have better performance than Ethernet and the Capetanakis Tree protocol, a similar collision resolution protocol, under some traffic conditions. In particular, under heavy loads, SDMA displays better average throughput and lower variance of delay than Ethernet. The protocol demonstrates a performance bias based on the …

Quickest Paths: Faster Algorithms And Dynamization, Dimitrios Kagaris, Grammati E. Pantziou, Spyros Tragoudas, Christos D. Zaroliagis

Computer Science Technical Reports

Given a network $N=(V,E,{c},{l})$, where $G=(V,E)$, $|V|=n$ and $|E|=m$, is a directed graph, ${c}(e) > 0$ is the capacity and ${l}(e) \ge 0$ is the lead time (or delay) for each edge $e\in E$, the quickest path problem is to find a path for a given source--destination pair such that the total lead time plus the inverse of the minimum edge capacity of the path is minimal. The problem has applications to fast data transmissions in communication networks. The best previous algorithm for the single--pair quickest path problem runs in time $O(r m+r n \log n)$, where $r$ is the number …

Videoscheme: A Research, Authoring, And Teaching Tool For Multimedia, J Matthews, F Makedon, P Gloor

Computer Science Technical Reports

The availability of digital multimedia technology poses new challenges to researchers, authors, and educators, even as it creates new opportunities for rich communication. This paper suggests interactive computer programming as a fruitful approach to these challenges. VideoScheme, a prototype video programming environment, is described along with promising applications.

Efficient Sequential And Parallel Algorithms For The Negative Cycle Problem, Dimitris Kavvadias, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis

Computer Science Technical Reports

We present here an algorithm for detecting (and outputting, if exists) a negative cycle in an $n$-vertex planar digraph $G$ with real edge weights. Its running time ranges from $O(n)$ up to $O(n^{1.5}\log n)$ as a certain topological measure of $G$ varies from $1$ up to $\Theta(n)$. Moreover, an efficient CREW PRAM implementation is given. Our algorithm applies also to digraphs whose genus $\gamma$ is $o(n)$.

Conference On A Disk: A Successful Experiment In Hypermedia Publishing (Extended Abstract), M Cheyney, P Gloor, D B. Johnson, F Makedon, J Matthews, P Metaxas

Computer Science Technical Reports

Academic conferences are a long-standing and effective form of multimedia communication. Conference participants can transmit and recieve information through sight, speech, gesture, text, and touch. This same-time, same-place communication is sufficiently valuable to justify large investments in time and travel funds. Printed conference proceedings are attempts to recapture the value of a life conference, but they are limited by a fragmented and inefficient approach to the problem. We addressed this problem in the multimedia proceedings of the DAGS'92 conference. The recently published CD-ROM delibers text, graphic, audio, and video information as an integrated whole, with extensive provisions for random access …

A Study Of Distributed Transaction Processing In Wide Area Network, Bharat Bhargava, Yongguang Zhang

Department of Computer Science Technical Reports

No abstract provided.

The Parallel Envelope, M.G. Rossmann, M. A. Cornea-Hasegan, D. C. Marinsecu, Z. Zhang, Robert E. Lynch, J. Muckelbauer, R. Mckenna, S. Munshi, J-B. Dai

Department of Computer Science Technical Reports

No abstract provided.

Average Profile And Limiting Distribution For A Phrase Size In The Lempel-Ziv Parsing Algorithm, Guy Louchard, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Writing, Supporting, And Evaluating Tripwire: A Publically Available Security Tool, Gene H. Kim, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.

Re-Evaluating Indexing Schemes For Nested Objects, Yin-He Jiang, Xiangning Liu, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.

A Geometric Approach To Molecular Docking And Similarity, Chandrajit Bajaj, Fausto Bernardini, Kokichi Sugihara

Department of Computer Science Technical Reports

No abstract provided.

Pdelab: An Object-Oriented Framework For Building Problem Solving Environments For Pde Based Applications, Sanjiva Weerawarana, Elias N. Houstis, John. R. Rice, Ann Christine Catlin, Cheryl L. Crabill, Chi Ching Chui

Department of Computer Science Technical Reports

No abstract provided.

Edge Weight Reduction Problems In Directed Acyclic Graphs, Susanne E. Hambrusch, Hung-Yi Tu

Department of Computer Science Technical Reports

No abstract provided.

Recognition In Science And Engineering, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Thread Migration On Heterogeneous Systems Via Compile-Time Transformations, Janche Sang, Geoffrey W. Peters, Vernon J. Rego

Department of Computer Science Technical Reports

No abstract provided.