07.02.2013 Views

Scientific and Technical Aerospace Reports Volume 39 April 6, 2001

Scientific and Technical Aerospace Reports Volume 39 April 6, 2001

Scientific and Technical Aerospace Reports Volume 39 April 6, 2001

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

planning with the Remote Agent experiment in 1999. KSC has pioneered model-based diagnosis <strong>and</strong> demonstrated its utility for<br />

ground support operations. KSC <strong>and</strong> ARC are cooperating in research to improve the state of the art of this technology. This paper<br />

highlights model-based reasoning applications for Moon <strong>and</strong> Mars missions including in-situ resource utilization <strong>and</strong> enhanced<br />

vehicle health monitoring.<br />

Author<br />

Autonomy; Software Engineering; Mars Exploration; Computer Systems Programs; Artificial Intelligence; Moon<br />

<strong>2001</strong>0024860 Colorado Univ., Dept. of Electrical <strong>and</strong> Computer Engineering, Boulder, CO USA<br />

Channel Reduction <strong>and</strong> Applications to Image Processing<br />

Wach, Hans B., Colorado Univ., USA; Dowski, Edward R., Jr., Colorado Univ., USA; Cathey, W. Thomas, Colorado Univ., USA;<br />

Applied Optics; 2000; ISSN 0003-6935; <strong>Volume</strong> <strong>39</strong>, No. 11, pp. 1794-1798; In English; Copyright; Avail: Defense <strong>Technical</strong><br />

Information Center (DTIC)<br />

Oftentimes when one is dealing with digital color images it is desired that some sort of image processing be performed on<br />

the spatial information. Current methods require that one process each of the channels (also called planes or colors) of an image<br />

separately, which increases the number of computations significantly. A novel, to our knowledge, approach to reducing the number<br />

of channels in a color image is presented. The channel-reduction process is intended to facilitate such color image-processing<br />

situations essentially by the separation of the spectral information from the spatial information, as in a paint-by-numbers picture.<br />

In this case the image processing need be applied only to a single channel of data <strong>and</strong> the color added afterward. With a compression<br />

ratio of slightly less than 3:1 the method is not intended to compete with existing compression methods but rather to permit<br />

the processing of images in a compressed state.<br />

DTIC<br />

Color; Image Processing; Images<br />

<strong>2001</strong>0024882 Naval Postgraduate School, Monterey, CA USA<br />

A Path-Based Network Policy Language<br />

Stone, Gary N.; Sep. 2000; 187p; In English<br />

Contract(s)/Grant(s): DARPA ORDER-G417<br />

Report No.(s): AD-A384623; No Copyright; Avail: CASI; A09, Hardcopy; A02, Microfiche<br />

Network policies are ”traffic regulations” for the networks which make up the Internet. These are necessary for managing<br />

the flow of data, for access control to the network, <strong>and</strong> for managing the network to achieve other types of quality of service goals.<br />

However, with the myriad of different policies <strong>and</strong> networks, all with varying needs, conflicts can arise between network policies.<br />

Detecting <strong>and</strong> correcting these conflicts can be quite difficult for human administrators. Thus, there is a need for a theoretically<br />

sound method for specifying policy <strong>and</strong> for automatically detecting policy conflicts. This dissertation presents a path-based policy<br />

language that is more comprehensive than earlier languages for describing network policy. The Path-based Policy Language (PPL)<br />

is a formal language for constructing models of Internet service <strong>and</strong> access control. This path-based language is extensible <strong>and</strong><br />

allows for an unambiguous representation of network policies based on both the static <strong>and</strong> dynamic attributes of today’s networks.<br />

to support this language, both a compiler <strong>and</strong> policy conflict tester were developed. These tools accept network policies specified<br />

in PPL, translate them into formal logic, <strong>and</strong> using a theorem prover to test for policy conflicts. PPL allows for the efficient representation<br />

of large networks with its abbreviated path format. This path format allows multiple paths to be represented with one<br />

statement.<br />

DTIC<br />

High Level Languages; Internets; Compilers<br />

<strong>2001</strong>0025067 Naval Postgraduate School, Monterey, CA USA<br />

Re-Purposing Commercial Entertainment Software for Military Use<br />

DeBrine, Jeffrey D.; Morrow, Donald E.; Sep. 2000; 146p; In English<br />

Report No.(s): AD-A384622; No Copyright; Avail: CASI; A07, Hardcopy; A02, Microfiche<br />

Virtual environments have achieved widespread use in the military in applications such as theater planning, training, <strong>and</strong><br />

architectural walkthroughs. These applications are generally expensive <strong>and</strong> inflexible in design <strong>and</strong> implementation. Re-purposing<br />

these applications to meet the dynamic modeling <strong>and</strong> simulation needs of the military can be awkward or impossible. Video<br />

games are designed to be both technologically advanced <strong>and</strong> flexible in design. We evaluated current games <strong>and</strong> modified Quake<br />

3 Arena(Q3A) to serve as both an architectural walkthrough <strong>and</strong> a primitive team trainer. to accomplish this, we incorporated a<br />

real Naval Postgraduate School building into Q3A. We also modified the game’s source code, characters <strong>and</strong> their behaviors,<br />

weapons models <strong>and</strong> characteristics, <strong>and</strong> overall game play. by re-purposing commercial entertainment software, we have pro-<br />

251

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!