Advanced Distributed Simulation Research Consortium

 
 
 
 
 
 
 

Projects 1996-97

 
 
 
 
 
 
 
 
 
University of Houston-Downtown
Houston, Texas
 
 
 
 
 

 


1.10 A Task Process Description

 

M. Beheshti, A. Berrached, M. Barrientos, A. Guerra (UHD)

 

Objectives and Significance:

A project was undertaken by Drs. Moshen Beheshti and Ali Berrached in consultation with Lt. Col. George Stone of STRICOM to organize the Task descriptions of the Army Units/Missions in such a way that 1) the information is easily accessible and 2) the amount of required storage space are optimized. This project was initiated in August of 1997 and is a current project.

 

Accomplishments:

A survey was conducted to see where the information currently resides and it was found that information is currently stored using a Word Processor (Microsoft Word) and data is being duplicated at different places. Therefore, a large amount of disk space is needed to store this information. A database manager is being designed to take advantage of the hierarchical structure of information (each Unit has a number of missions; each mission consists of a sequence of tasks; each task is made up of a sequence of steps; etc.) and take advantage of the redundancy of information (different units may have similar missions, different missions may have similar tasks, etc.) and to eliminate the redundancy in the information. Visual Basic is used as a window-based front end to allow users to query the database. The first prototype of this software is to be completed by mid-November 1997 for testing. The prototype will include few Units, Missions and Tasks to demonstrate the effectiveness of the software. This software could also be used as a tool to assist users creating scenarios.

 

 

 

1.11 Simulation Information Filtering Tool (SIFT/Janus)

Simulation Information Filtering Tool (SIFT/Janus)

 

M. Beheshti, A. Berrached, M. Carpenter, R. Mata, D. Smith (UHD)

 

Task Objectives and Significance:

A project was undertaken by Drs. Moshen Beheshti and Ali Berrached in consultation with Lt. Col. George Stone and Major Wayne Stillwell of STRICOM to familiarize students with various distributed simulations and software testing procedures. This project was initiated in August of 1997 and is a current project.

 

Accomplishments:

Janus and Simulation Information Filtering Tool (SIFT) software packages were loaded on a HP machine at UHD. SIFT interfaces with Janus and generates simulation analysis dynamically (i.e. while the simulation is running). Both the Janus and SIFT packages were developed at STRICOM and UHD has been designated as one of the testing sites for both packages. Students and faculty learned how to create scenarios during a tutorial session on Janus and SIFT given by LTC Stone and MJR. Stillwell of STRICOM. Currently, students are experimenting with the software and generating test data using Janus and SIFT testing will begin as soon as benchmark test data are available.

 

1.12 Algorithm for Intervisibility Determination

 

R. Aló, A. Guerra, R. Ramirez, C. Trauschke, (UHD)

 

 

Objectives and Significance:

A project was undertaken by Dr. Richard Alo in consultation with Dr. Owen Deutch, SCAD Project Head, Draper Laboratories, Cambridge, Massachusetts to expose and familiarize students with various software testing procedures. This project was conducted in the summer of 1997.

 

Accomplishments:

Intervisibility is the ability to determine line of sight for a particular object. The importance of time complexity with intervisibility stems from being able to identify a friend or foe in real-time. In order to simulate this action, determination of time-complexity for each algorithm is necessary. The purpose of this project was to determine which intervisibility algorithm has the best time-complexity. Three algorithms were suggested, the Timer Algorithm, Sieve Algorithm, and the Draper Algorithm, but only two were used. The Sieve algorithm was pending funding, so access to the code was denied. After careful construction and testing of the Timer and Draper algorithm, it was concluded that the Timer algorithm proved to be the better of the two. The time complexity for the Timer algorithm was considerably less than the Draper algorithm.