Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Physical Sciences and Mathematics
A Method For Populating The Knowledge Base Of Aptas, A Domain-Oriented Application Composition System, Raleigh A. Sandy Iii
A Method For Populating The Knowledge Base Of Aptas, A Domain-Oriented Application Composition System, Raleigh A. Sandy Iii
Theses and Dissertations
A formal process is described for populating the knowledge base of the Automatic Programming Technologies for Avionics Software APTAS system. This process was developed using a general knowledge base population process that applies to many knowledge-based software engineering systems. This general process is also described. The formal process for APTAS was demonstrated by storing new information from the radar tracking domain into the knowledge base of APTAS. Several procedures some automatic and some manual were implemented to support the formal process.
Using Discovery-Based Learning To Prove The Behavior Of An Autonomous Agent, David N. Mezera
Using Discovery-Based Learning To Prove The Behavior Of An Autonomous Agent, David N. Mezera
Theses and Dissertations
Computer-generated autonomous agents in simulation often behave predictably and unrealistically. These characteristics make them easy to spot and exploit by human participants in the simulation, when we would prefer the behavior of the agent to be indistinguishable from human behavior. An improvement in behavior might be possible by enlarging the library of responses, giving the agent a richer assortment of tactics to employ during a combat scenario. Machine learning offers an exciting alternative to constructing additional responses by hand by instead allowing the system to improve its own performance with experience. This thesis presents NOSTRUM, a discovery-based learning DBL system …
A Decision Criteria To Select An Associative-Memory Organization That Minimizes The Execution Time Of A Mix Of Associative-Search Operations, David W. Banton
A Decision Criteria To Select An Associative-Memory Organization That Minimizes The Execution Time Of A Mix Of Associative-Search Operations, David W. Banton
Theses and Dissertations
The dissertation develops a decision criteria to select an associative-memory organization that minimizes the execution time of a mix of associative-search operations and a decision criteria to estimate the layout dimensions of each organization for a specified memory size. The dissertation reclassifies Feng's associative-search operations into three hardware-influenced categories: bit-position independent (BPI), record-content independent (RCI); bit-position dependent (BPD), RCI; and BPD, record-content dependent (RCD). It develops a relationship between the categories and three associative-memory organizations: the CAM, the bit-serial word-parallel associative memory (BSWPAM) , and the extreme-search associative memory (ESAM). A version of the CAM, three versions of the BSWPAM, …