Digital Commons Network^™

A Common Architecture For Simulation Viewing Over Multiple Protocol Environments, Glenn G. Jacquot

Theses and Dissertations

This study discusses an architecture used for displaying data results in a graphical format. This data is obtained via internet connection or from a direct connection to a battlefield simulator known as BattleSim. This architecture utilizes several graphics packages for displaying the output along with two different approaches to receiving commands from the user. Furthermore, the design was built to easily incorporate other graphics packages and communication protocols in order to increase its portability.

Graphical Display Of A Missile Endgame Scenario, Joseph E. Moritz

Theses and Dissertations

Traditionally, computer programs to model and simulate air-to-air missile endgame engagements have focused on improving the underlying probability of kill models. This focus, however, understates the benefits of current computer graphics technology for visualization and direct manipulation of missile endgame parameters and building engagement understanding through real-time, three dimensional simulation of the endgame. Our research has been to develop a versatile simulation system to display the missile endgame parameters and allow graphical interaction with these parameters. This program also allows the user to view animated engagements of previously designed endgames. The current project scope is to provide user feedback of …

A Specific Network Link And Path Likelihood Prediction Tool, Gary K. Moy

Theses and Dissertations

Communications have always been a crucial part of any military operation. As the pace of warfare and the technological complexity of weaponry have increased, so has the need for rapid information to assess battlefield conditions. Message passing across a network of communication nodes allowed commanders to communicate with their forces. It is clear that an accurate prediction of communication usage through a network will provide commanders with useful intelligence of friendly and unfriendly activities. Providing a specific network link and path likelihood prediction tool gives strategic military commanders additional intelligence information and enables them to manage their limited resources more …

Speaker Recognition By Hidden Markov Models And Neural Networks, Erik J. Zeek

Theses and Dissertations

As humans, we develop the ability to identify people by their voice at an early age. Getting computers to perform the same task has proven to be an interesting problem. Speaker recognition involves two applications, speaker identification and speaker verification. Both applications are examined in this effort. Two methods are employed to perform speaker recognition. The first is an enhancement of hidden Markov models. Rather than alter some part of the model itself, a single-layer perceptron is added to perform neural post-processing. The second solution is the novel application of an enhanced Feature Space Trajectory Neural Network to speaker recognition. …

A Software Architecture For Computer Generated Forces In Complex Distributed Virtual Environments, Vincent B. Zurita

Theses and Dissertations

Complex Distributed Virtual Environments (DVEs) present an outstanding opportunity for the Department of Defense to train geographically separated units within a single realistic threat environment with minimal logistical considerations or safety concerns. To increase the fidelity of these simulations, minimize cost, and thereby maximize the training potential, DVEs must be populated with a realistic number of Computer Generated Forces (CGFs). These are currently expensive to design and build due to a lack of standard COF architectures. A solution to this problem is presented in the form of a CGF Architecture that is applicable to CGFs that model any weapon system. …

An Incremental Language Conversion Method To Convert C++ Into Ada95, Ding-Yuan Sheu

Theses and Dissertations

This thesis develops a methodology to incrementally convert a legacy object oriented C++ application into Ada95. Using the experience of converting a graphic application, called Remote Debriefing Tool (RDT), in the Graphics Lab of the Air Force Institute of Technology (AFIT), this effort defined a process to convert a C++ application into Ada95. The methodology consists of five phases: (1) reorganizing the software application, (2) breaking mutual dependencies, (3) creating package specifications to interface the existing C++ classes, (4) converting C++ code into Ada programs, and (5) embellishing. This methodology used the GNAT's C++ low level interface capabilities to support …

Efficient Parallel Algorithms On Reconfigurable Mesh Architectures, His-Chieh Lee, Fikret Ercal

Computer Science Technical Reports

This dissertation describes a number of novel parallel algorithms for solving maze-routing problems and string matching problems on a proposed reconfigurable mesh architecture.

Section I reviews the field of reconfigurable parallel computing. This includes an introduction to a number of reconfigurable architectures proposed in the literature and a list of references to the current literature on algorithms in the field of reconfigurable computing.

Section II presents a number of time-efficient algorithms to solve the mazerouting problem. Maze-routing algorithms are used in VLSI routing and robot path planning. In that section, definitions for absolute shortest path (ASP), shortest duplex-path (SDP), shortest …

Parallel Fast Multipole Algorithms For N-Body Simulations, Jui-Lin Lu, Daniel Okunbor

Computer Science Technical Reports

The computer simulation of N-Body problems has a wide range of applications. It is known that simulations can take years to complete. This can be greatly improved by using efficient algorithms in force calculations and in applying the computing power of parallel computers to the problem. A tremendous amount of work has been devoted to parallelization of the fast multipole algorithm (FMA) which is one of the fastest algorithms in force calculations. However, most parallel implementations target a specific machine. We developed an efficient communication scheme for parallel FMA in a message passing environment and implemented it by using Message …

A Strategy For Distributed Relational Database Design, Ismail Omar Hababeh

Masters Theses

This thesis presents a strategy for the fragmentation and allocation of data in a distributed relational database. The strategy introduces a way to fragment and allocate data to accomplish the benefits of allocating each fragment independently for each site. Some fragments may be allocated to multiple sites in order to achieve some constraints such as availability, consistency, and integrity. The strategy is appropriate for different types of computers at various sites connected to a network, with different costs of retrieval, update, and communication.

To increase the system 1/0 performance, sites having similar communication costs are grouped into clusters to which …

Master Of Science In Computing Technology In Education 1996, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.

Re-Engineering Technical Education In Industry Through Interactive Multimedia Computer-Based Training, Yolanda Kennedy, Erika Rogers

Computer Science and Software Engineering

This paper describes current work on re-engineering a short technical course in the area of Non-Destructive Evaluation/Inspection (NDE/I) sponsored by Boeing’s Defense and Space Group. The subject of the course is Eddy Current Testing, and is currently taught over a period of two days using traditional view foils and hand-built artifacts. An overview of some of the course material is presented together with how techniques such as task analysis and storyboarding are being used to design interactive multimedia training modules to support this course.

Interactive Student Support For Introductory Computer Science Courses, Barb Ericson, Erika Rogers

Computer Science and Software Engineering

This paper describes the development of interactive multimedia modules which provide supplementary tutorials on basic topics covered in introductory computer science classes. Two such modules were implemented on the topics of number conversions and basic operating system information. The first versions of the tutorials were evaluated in a study using protocol collection and a post-test with a number of student participants. Results from this study led to the re-design of several portions of the tutorials, which now have a greater level of interaction and progressive assistance for problem-solving.

The Dark Side Of Risk (What Your Mother Never Told You About Time Warp), David M. Nicol, Xiaowen Liu

Computer Science Technical Reports

This paper is a reminder of the danger of allowing ``risk'' when synchronizing a parallel discrete-event simulation: a simulation code that runs correctly on a serial machine may, when run in parallel, fail catastrophically. This can happen when Time Warp presents an ``inconsistent'' message to an LP, a message that makes absolutely no sense given the LP's state. Failure may result if the simulation modeler did not anticipate the possibility of this inconsistency. While the problem is not new, there has been little discussion of how to deal with it; furthermore the problem may not be evident to new users …

Multimedia Applications Require Adaptive Cpu Scheduling, Veronica Baiceanu, Crispin Cowan, Dylan Mcnamee, Calton Pu, Jonathan Walpole

Computer Science Faculty Publications and Presentations

CPU scheduling and admission testing for multimedia applications have been extensively studied, and various solutions have been proposed using assorted simplifying assumptions. However, we believe that the complexity and dynamic behavior of multimedia applications and systems make static solutions hard to apply in real-world situations. We are analyzing the difficulties that arise when applying the rate-monotonic (RM) scheduling algorithm and the corresponding admission tests for CPU management, in the context of real multimedia applications running on real systems. RM requires statically predictable, periodic workloads, and while multimedia applications appear to be periodic, in practice they exhibit numerous variabilities in workload. …

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

A Critique Of The Telecommunications Description Language (Ted), Brian J. Premore, David M. Nicol, Xiaowen Liu

Computer Science Technical Reports

TeD is an object-oriented description language designed to facilitate the modeling of large scale telecommunication networks, with simulation on parallel and distributed platforms. TeD models are mapped to the Georgia Tech Time Warp engine (GTW) for execution. In this paper we outline the features of TeD, pointing out its strengths and identifying characteristics that gave us trouble as we used TeD to model detailed networks. Our issues are motivated specifically by a model of TCP and a model of multicast resource allocation. Our intention is to illustrate by example what TeD can do, and characteristics that a potential TeD user …

Galley: A New Parallel File System For Parallel Applications, Nils Nieuwejaar

Dartmouth College Ph.D Dissertations

Most current multiprocessor file systems are designed to use multiple disks in parallel, using the high aggregate bandwidth to meet the growing I/O requirements of parallel scientific applications. Most multiprocessor file systems provide applications with a conventional Unix-like interface, allowing the application to access those multiple disks transparently. This interface conceals the parallelism within the file system, increasing the ease of programmability, but making it difficult or impossible for sophisticated application and library programmers to use knowledge about their I/O to exploit that parallelism. In addition to providing an insufficient interface, most current multiprocessor file systems are optimized for a …

High Quality Alias Free Image Rotation, Charles B. Owen, Fillia Makedon

Dartmouth Scholarship

This paper presents new algorithms for the rotation of images. The primary design criteria for these algorithms is very high quality. Common methods for image rotation, including convolutional and separable approaches, are examined and shown to exhibit significant high frequency aliasing problems. A new resampling filter design methodology is presented which minimizes the problem for conventional convolution-based image rotation. The paper also presents a new separable image rotation algorithm which exhibits improved performance in term of reduction in artifacts and an efficient $O(N^{2} log N)$ running time.

Quality Of Service Test By Codec Performance, Shunge Li, Bharat Bhargava, Dawei Wang

Department of Computer Science Technical Reports

No abstract provided.

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

Department of Computer Science Technical Reports

No abstract provided.

Finanzia: An Option Valuation Library, Konstantinos N. Pantazopoulos, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.

Pattern Matching Image Compression With Predication Loop: Preliminary Experimental Results, Denis Arnaud, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Annotated Statistical Indices For Sequence Analysis, Alberto Apostolico, Mary Ellen Bock, Xuyan Xu

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.

Four-Fermion Production In E+E- Collisions At Centre-Of-Mass Energies Of 130 And 136 Gev, D. Buskulic, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

Four-fermion events have been selected in a data sample of 5.8 pb−1 collected with the aleph detector at centre-of-mass energies of 130 and 136 GeV. The final states ℓ+ℓ−qq, ℓ+ℓ−ℓ+ℓ−, ννqq, and ννℓ+ℓ− have been examined. Five events are observed in the data, in agreement with the Standard Model predictions of 6.67±0.38 events from four-fermion processes and 0.14−0.05+0.19 from background processes.

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.

Effective And Appropriate Use Of Controlled Experimentation In Software Development Research, Mark Alan Johnson

Dissertations and Theses

Although there is a large body of research and publication on software development, only a limited amount of this work includes empirical demonstration of its effectiveness. Yet, it is this empirical understanding which will help move software development from a craft to an engineering discipline. Of the empirical methods for research, controlled experiments are the most commonly thought of in scientific studies, and yet the least used to study software development.

This thesis begins with a brief review of the different empirical methods commonly used to study software development. This review provides a quick introduction to each empirical method, compares …

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.

Tuning Starfish, David Kotz

Computer Science Technical Reports

STARFISH is a parallel file-system simulator we built for our research into the concept of disk-directed I/O. In this report, we detail steps taken to tune the file systems supported by STARFISH, which include a traditional parallel file system (with caching) and a disk-directed I/O system. In particular, we now support two-phase I/O, use smarter disk scheduling, increased the maximum number of outstanding requests that a compute processor may make to each disk, and added gather/scatter block transfer. We also present results of the experiments driving the tuning effort.

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.