Digital Commons Network^™

Agent Based Network Systems For Multi- Physics Problems, Tzvetan Drashansky, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Parallel (//) Ellpack: A Problem Solving Environment For Pde Based Applications On Multicomputer Platforms, Elias N. Houstis, John R. Rice, S. Weerawarana, A. C. Catlin, P. Papachiou, M. Gaitatzes

Department of Computer Science Technical Reports

No abstract provided.

Oodini 2.1 : An Enhanced Graphical Schema Representation For Object-Oriented Database, Rajashekar Rao

Theses

The graphical representation of an object-oriented database (OODB) schema is useful for the designers and users of a database system. The purpose of my thesis was to enhance the existing version of OOdini, an interactive graphical tool for editing an OODB schema. The new features include interactive modification and description of objects in the schema. Data structures for representing classes and attributes have been altered to incorporate object/data types as well as a descriptive string. The software has been implemented using the ObjectMaker toolkit to design our own methodology using the ObjectMaker Extension Language.

Applications Of Parallel I/O, David Kotz

Computer Science Technical Reports

Scientific applications are increasingly being implemented on massively parallel supercomputers. Many of these applications have intense I/O demands, as well as massive computational requirements. This paper is essentially an annotated bibliography of papers and other sources of information about scientific applications using parallel I/O. It will be updated periodically.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 8, October 1996, 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.

Procedurally Rational Decision-Making And Control, Richard L. Frost, Michael A. Goodrich, Wynn C. Stirling

Faculty Publications

Substantive rationality requires a decision-maker to be a utility maximizer; under this paradigm, the decision is paramount, and not dependent on the computational process used to obtain it. Procedural rationality is dependent on the method used to make the decision; reasonableness of the procedure is paramount. Well-formed problems are amenable to substantive rationality; ill-formed problems are not, but are amenable to procedural rationality. To qualify as being procedurally rational, a methodology must possess a sound epistemological basis, it must be amenable to a formal design synthesis procedure, and it must be consistent with substantive rationality. Epistemic utility theory forms the …

A Fast Parallel Implementation Of The Wavelet Packet Best Basis Algorithm On The Mp-2 For Real-Time Mri, Sumit Chawla, Dennis M. Healy Jr

Computer Science Technical Reports

Adaptive signal representations such as those determined by best-basis type algorithms have found extensive application in image processing, although their use in real-time applications may be limited by the complexity of the algorithm. In contrast to the wavelet transform which can be computed in O(n) time, the full wavelet packet expansion required for the standard best basis search takes O(n log n) time to compute. In the parallel world, however, both transforms take O(log n) to compute when the number of processors equal the number of data elements, making the wavelet packet expansion attractive to implement. This note describes near …

On The Portability Of Behavioral Vhdl-93, Krishnaprasad Thirunarayan, Robert Ewing

Kno.e.sis Publications

Goossens defined a structural operational semantics for a subset of VHDL-87 and proved that the parallelism present in VHDL is benign. We extend this work to include shared variables in VHDL-93 that changes the underlying semantic model. In the presence of shared variables, non-deterministic execution of VHDL-93 processes destroys the unique meaning property. We identify and characterize a class of portable VHDL-93 descriptions for which unique meaning property can be salvaged.

A Computational Paradigm On Network-Based Models Of Computation, Venkatavasu Bokka

Computer Science Theses & Dissertations

The maturation of computer science has strengthened the need to consolidate isolated algorithms and techniques into general computational paradigms. The main goal of this dissertation is to provide a unifying framework which captures the essence of a number of problems in seemingly unrelated contexts in database design, pattern recognition, image processing, VLSI design, computer vision, and robot navigation. The main contribution of this work is to provide a computational paradigm which involves the unifying framework, referred to as the multiple Query problem, along with a generic solution to the Multiple Query problem.

To demonstrate the applicability of the paradigm, a …

Techniques Of The Average Case Analysis Of Algorithms, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

An Algorithm For Estimating All Matches Between Two Strings, Mikhail J. Atallah, Frédéric Chyzak, Philippe Dumas

Department of Computer Science Technical Reports

No abstract provided.

Scene Change Detection For Video Database Management Systems-A Survey, Haitao Jiang, Abdelsalam (Sumi) Helal, Ahmed K. Elmagarmid, Anupam Joshi

Department of Computer Science Technical Reports

No abstract provided.

A Reference Model For Firewall Technology And Its Implications For Connection Signaling, J. Bryan Lyles, Christoph L. Scuba

Department of Computer Science Technical Reports

No abstract provided.

An Empirical Comparison Of Networks And Routing Strategies For Parallel Computation, Ronald I. Greenberg, Lee Guan

Computer Science: Faculty Publications and Other Works

This paper compares message routing capabilities of important networks proposed for general-purpose parallel computing. All the networks have been proven to have some type of universality property, i.e., an ability to simulate other networks of comparable cost with modest slowdown, using appropriate cost and communication models. But in this paper we seek an empirical comparison of communication capability under typical direct use rather than an analysis of worst-case results for simulating message traffic of another network.

Resource/Dataflow Graph Operating System Development, Sriram J. Coimbatore

Electrical & Computer Engineering Theses & Dissertations

Implementation of a new dataflow schedule model is the objective of this thesis. The dataflow model algorithm called the resource/dataflow graph model is implemented on a peer-to-peer communication network comprising of six personal computers. This dataflow model is implemented making use of an earlier dataflow model called ATAMM (Algorithm to Architecture Mapping Model) developed by ODU and National Aeronautics and Space Administration (NASA). Development issues include modification of the RDFG testbed operating system and a scheme to transfer data buffers using the ethernet channel from one processor to another processor. This, in turn, equips each sub-module of an application with …

Ua12/2/1 College Heights Herald, Vol. 72, No. 9, Wku Student Affairs

WKU Administration Documents

WKU campus newspaper reporting campus, athletic and Bowling Green, Kentucky news.

Regular features include:

• Just a Second
• Campus Line
• For the Record / Crime Reports
• People Poll
• Sports
• Diversions
• Movie Reviews
• Classifieds

Articles in this issue:

• Brewer, Jerry. NAACP: Blacks Have Obligation to Vote
• VanWinkle, Cara. Houses Hub of Activities – Fraternities & Sororities
• Brown, Karen. Gordon Parks’ Struggle to Success Provides Encouragement
• Stamper, John. Police Continue Hunt for Gunman
• Government Shouldn’t Regulate Morality
• Harbaugh, Jack. School Spirit Strong
• Wilson, Randy. Military Still Needed
• Craig, Ryan. Love is More Than Tight Jeans
• Flanagan, Beth. Greed: The Downfall of America
• Krenzin, …

Run-Time Security Evaluation: Can We Afford It?, Cristina Serban, Bruce M. Mcmillin

Computer Science Faculty Research & Creative Works

The use of the run-time security evaluation (RTSE) method for a distributed application takes a toll in overall application performance. The associated overhead and its major sources are discussed, along with possible solutions for improvements, and questions that remain still open.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 7, September 1996, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Early Experiences In Evaluating The Parallel Disk Model With The Vic* Implementation, Thomas H. Cormen, Melissa Hirschl

Computer Science Technical Reports

Although several algorithms have been developed for the Parallel Disk Model (PDM), few have been implemented. Consequently, little has been known about the accuracy of the PDM in measuring I/O time and total time to perform an out-of-core computation. This paper analyzes timing results on a uniprocessor with several disks for two PDM algorithms, out-of-core radix sort and BMMC permutations, to determine the strengths and weaknesses of the PDM. The results indicate the following. First, good PDM algorithms are usually not I/O bound. Second, of the four PDM parameters, two (problem size and memory size) are good indicators of I/O …

Use Of A Taxonomy Of Security Faults, Taimur Aslam, Ivan Krsul, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.

Residency Check Elimination For Object- Oriented Persistent Languages, Antony L. Hosking

Department of Computer Science Technical Reports

No abstract provided.

Mccogen, A C Code Generator From Mathematica Language, Chang-Hyeon Song

Department of Computer Science Technical Reports

No abstract provided.

Analysis Of An Asymmetric Leader Election Algorithm, Svante Janson, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Multi-Pass Transmission Policy: An Effective Method Of Transmitting Large Multimedia Objects In The Wide-Area Network, Sheng-Yih Wang, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.

Parallel Reuse Methodologies For Elliptic Boundary Value Problems, S. Markus, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.

An Empirical Comparison Of Area-Universal And Other Parallel Computing Networks, Ronald I. Greenberg, Lee Guan

Computer Science: Faculty Publications and Other Works

This paper provides empirical comparison of the communication capabilities of two area-universal networks, the fat-tree and the fat-pyramid, to the popular mesh and hypercube networks for parallel computation. While area-universal networks have been proven capable of simulating, with modest slowdown, any computation of any other network of comparable area, prior work has generally left open the question of how area-universal networks compare to other networks in practice. Comparisons are performed using techniques of throughput and latency analysis that have previously been applied to k-ary n-cube networks and using various existing models to equate the hardware cost of the networks being …

Physical Modeling For Interaction In Real-Time Simulation, Curtis Lisle

Link Foundation Modeling, Simulation and Training Fellowship Reports

The goal of this project was to model objects in a simulated environment with a method which allows physically-correct behavior to be calculated in real-time. Our approach studied the interaction between differing object types and used object-oriented software design to create a class hierarchy of objects suitable for interactive speed virtual environment simulation. We studied physical modeling systems and constraint systems as techniques to control the behavior of objects in our simulations. We also studied two different ways to achieve distributed execution of an object-oriented simulation. In our first approach, we designed a set of simulation software which ran built …

Search For Cp Violation In The Decay Z → B B̄ G, Buskulic, D.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

About three million hadronic decays of the Z collected by ALEPH in the years 1991 to 1994 are used to search for anomalous CP violation beyond the Standard Model in the decay Z → bb̄g. The study is performed by analyzing angular correlations between the two quarks and the gluon in three-jet events and by measuring the differential two-jet rate. No signal of CP violation is found. For the combinations of anomalous CP violating couplings, ĥb = ĥAbgVh - ĥVbgAb and hb* = √ĥVb2 + ĥAb2, limits of | ĥb | b*

Development Of A Standard Set Of Indicators And Metrics For Artificial Intelligence (Ai) And Expert System (Es) Software Development Efforts, Derek F. Cossey

Theses and Dissertations

The purpose of this research was to identify a standard set of indicators and metrics that can be used by program managers to improve their abilities to direct development efforts involving Artificial Intelligence (AI) and Expert Systems (ES). This research addresses two objectives. The first objective is to identify an appropriate set of software indicators and metrics to be used by government program offices for the management of development efforts involving software systems for AI and ES. The second objective is to demonstrate how the resources of the National Software Data and Information Repository (NSDIR) can be used in order …

Frequency Computation And Bounded Queries, Richard Beigel, William I. Gasarch, Efim Kinber

School of Computer Science & Engineering Faculty Publications

There have been several papers over the last ten years that consider the number of queries needed to compute a function as a measure of its complexity. The following function has been studied extensively in that light: Ft(xl,. . .,x0) = ,4(x,). .A(x,). We are interested in the complexity (in terms of the number of queries) of approximating Fi. Let b