6477912
Stress testing a supply chain using simulation
Simulation provides the capability to evaluate performance of a system operating under current or proposed configurations, policies and procedures. It is very applicable to evaluation of strategic and operational level plans for supply chains. It is especially useful for exploring the viability of a supply chain before beginning production. This paper describes the use of simulation for determining the readiness of a supply chain designed by a small company for providing sub-systems to a defense contractor. The supply chain had to be stress tested at surge and mobilization volume levels to meet the requirements. Simulation provided the ideal methodology to identify and demonstrate the behavior of the supply chain under stress and evaluate strategies to meet the defined volumes. It was used to prove the readiness of the supply chain reducing perceived risks in using the virtual operation.
7115385
Integrated simulation and gaming architecture for incident management training
The simulation-based training systems that are available or under development today for incident management are typically focused on macro level sequence of events. A few systems targeted at individual responders are under development using a gaming environment. Separate uses of such systems provide disparate experiences to decision makers and individual responders. There is a need to provide common training experiences to these groups for better effectiveness. This paper presents a novel approach integrating gaming and simulation systems for training of decision makers and responders on the same scenarios preparing them to work together as a team. An integrated systems architecture is proposed for this purpose. Major modules in gaming and simulation subsystems are defined and interaction mechanisms established. Research and standards issues for implementation of the proposed architecture are discussed.
30237295
Crowd Control: Coordinating Processes in Parallel
Tutorials • Bridget Rosewell and Paul Ormerod " Agent Based Models and Social Simulation in the Policy Process " [Room: Aula Magna] This tutorial will focus on practical examples of agent based models which are actually being used as part of the decision making process of policy makers. The tutorial will also address key issues in integrating ABMs and social simulation into the policy making process. The tutorial will introduce the Multi-Agent Simulation Suite (MASS), a novel, integrated simulation environment for agent-based social simulation. MASS was designed with scientific modelers and not professional programmers in mind. Therefore, ease of use and prudent scientific practices were at the focus of the suite's design. The tutorial consists in a brief introductory part providing a generalized definition of the basic elements composing a simulation model. Then, it will be shown how LSD allows users to transparently adopt the theoretical definition, automatically generating all the technical code necessary for developing, running and analysing a simulation model. A series of examples will show the advantages of the definition proposed and the most relevant features of LSD. The tutorial will introduce the Multi-Agent Simulation Suite (MASS), a novel, integrated simulation environment for agent-based social simulation. MASS was designed with scientific modelers and not professional programmers in mind. Therefore, ease of use and prudent scientific practices were at the focus of the suite's design.
5522355
Program Size Restrictions in Computational Learning
Abstract A model for a subject S learning its environment E could be described thus: S , placed in E , receives data about E , and simultaneously conjectures a sequence of hypotheses. S is said to learn E just in case the sequence of hypotheses conjectured by S stabilizes to a final hypothesis which correctly represents E . Computational learning theory provides a framework for studying problems of this nature when the subject is a machine. A natural abstraction for the notion of hypothesis is a computer program. The present paper, in the above framework of learning, presents arguments for the final hypothesis to be succinct , and introduces a plethora of formulations of such succinctness. A revelation of this study is that some of the “natural” notions of succinctness may be uninteresting because learning capability of machines under these seemingly natural constraints is dependent on the choice of programming system used to interpret hypotheses.
621323
Prudence in vacillatory language identification
This paper settles a question about “prudent” “vacillatory” identification of languages. Consider a scenario in which an algorithmic deviceM is presented with all and only the elements of a languageL, andM conjectures a sequence, possibly infinite, of grammars. Three different criteria for success ofM onL have been extensively investigated in formal language learning theory. IfM converges to a single correct grammar forL, then the criterion of success is Gold's seminal notion ofTxtEx-identification. IfM converges to a finite number of correct grammars forL, then the criterion of success is calledTxtFex-identification. Further, ifM, after a finite number of incorrect guesses, outputs only correct grammars forL (possibly infinitely many distinct grammars), then the criterion of success is known asTxtBc-identification. A learning machine is said to beprudent according to a particular criterion of success just in case the only grammars it ever conjectures are for languages that it can learn according to that criterion. This notion was introduced by Osherson, Stob, and Weinstein with a view to investigating certain proposals for characterizing natural languages in linguistic theory. Fulk showed that prudence does not restrictTxtEx-identification, and later Kurtz and Royer showed that prudence does not restrictTxtBc-identification. This paper shows that prudence does not restrictTxtFex-identification.
30434049
Language Learning With Some Negative Information
8323346
The Synthesis of Language Learners
Abstract An index for an r.e. class of languages (by definition) is a procedure which generates a sequence of grammars defining the class. An index for an indexed family of languages (by definition) is a procedure which generates a sequence of decision procedures defining the family. Studied is the metaproblem of synthesizing from indices for r.e. classes and for indexed families of languages various kinds of language learners for the corresponding classes or families indexed. Many positive results, as well as some negative results, are presented regarding the existence of such synthesizers. The negative results essentially provide lower bounds for the positive results. The proofs of some of the positive results yield, as pleasant corollaries, subset-principle or tell-tale style characterizations for the learnability of the corresponding classes or families indexed. For example, the indexed families of recursive languages that can be behaviorally correctly identified from positive data are surprisingly characterized by Angluin's condition 2 (the subset principle for circumventing overgeneralization).