{"title":"Nonlinear Operator Equations And Applications To Modelling","authors":"John Jones","doi":"10.1109/SIMSYM.1990.717387","DOIUrl":"https://doi.org/10.1109/SIMSYM.1990.717387","url":null,"abstract":"The main purpose of this paper is to treat the problem of numerical solutions of Lyapunov matrix equations and nonlinear matrix equations such as the Ficcati type which occur in many areas of applications such as in control theory, robotics, mathematical modelling and computer simulation, etc. The main approach is to obtain solutions of such type equations in a more direct manner as in contrast to completely interative methods. Parallel processing of algorithms is made use of in the computation of solutions of such nonlinear matrix equations associated with nonlinear matrix differential equations arising in the study of nonlinear dynamical control systems.","PeriodicalId":399502,"journal":{"name":"1990 Eastern Multiconference. Record of Proceedings. The 23rd Annual Simulation Symposium","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125372402","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Macro Preprocessor For The Simulation Language Network II.5","authors":"D. Thuente, R. Sedlmeyer","doi":"10.1109/SIMSYM.1990.717196","DOIUrl":"https://doi.org/10.1109/SIMSYM.1990.717196","url":null,"abstract":"Network II.5 [Garrison 1989] is a powerful simulation tool for the design and analysis of multiprocessor systems, but lacks features to support modelling-in-the-large. We have developed a macro preprocessor, NETPRE, to aid in the construction and maintenance of large simulation models. NETPRE supports symbolic constants, include files, and macros. We show how these features can reduce model development time, increase the readability of model descriptions, and facilitate experimentation.","PeriodicalId":399502,"journal":{"name":"1990 Eastern Multiconference. Record of Proceedings. The 23rd Annual Simulation Symposium","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116083061","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Numerical Modeling Of The Conformational Transition Of A Spiral Focusing Surface","authors":"R. Steenblik, D. Ho","doi":"10.1145/99633.99653","DOIUrl":"https://doi.org/10.1145/99633.99653","url":null,"abstract":"A new class of focusing reflectors was created by modeling the conformational transitions between a wound spiral focusing surface and its planar, non-focusing, unwound spiral state. Two solutions to the problem were found; one by modeling the process of unwinding the focusing spiral surface, the other by modeling the winding of the planar spiral surface. Both the mathematical derivations and the resulting equations relating the two states of the spiral surface proved markedly different for the two approaches. Implementation of each solution was accomplished by specifying the locations of marker points and tracking them through the conformational transitions. Although the mathematics and the algorithms employed are completely different between the two solutions, both result in identical sets of marker points for a given spiral. However, the solution based on the winding conformational transition is completely general, while the solution based on unwinding is limited to a narrow set of focusing geometries.","PeriodicalId":399502,"journal":{"name":"1990 Eastern Multiconference. Record of Proceedings. The 23rd Annual Simulation Symposium","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125748495","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Model Instantiation For Query Driven Simulation In Active KDL","authors":"J. Miller, W. Potter, K. Kochut, O. R. Weyrich","doi":"10.1109/SIMSYM.1990.717257","DOIUrl":"https://doi.org/10.1109/SIMSYM.1990.717257","url":null,"abstract":"The focus of this paper is on how Active KDL can be used to provide a very powerful simulation support environment. Active KDL (Knowledge/Data Language) is an object-oriented database programming language, which provides access to integrated model, knowledge, and data bases. Simulation inputs and outputs can be stored by Active KDL since it supports complex objects. More importantly, Active KDL also allows users to specify rules to capture heuristic knowledge and methods to specify procedural behavior. Finally, Active KDL provides a simple mechanism for specifying concurrent execution, namely tasks embedded in active objects. These facilities provide a powerful mechanism for building simulation models out of pre-existing model components. These capabilities provide a fight coupling between a SIMODULA-like simulation system and a knowledge/database system, supporting query driven simulation, where model instantiation is used for information generation.","PeriodicalId":399502,"journal":{"name":"1990 Eastern Multiconference. Record of Proceedings. The 23rd Annual Simulation Symposium","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134051502","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Modeling The Cost Of Resource Allocation In Distributed Control","authors":"Martin D. Fraser, R. Gagliano, M. Schaefer","doi":"10.1145/99633.99657","DOIUrl":"https://doi.org/10.1145/99633.99657","url":null,"abstract":"Modifying our previously developed simulation model [FRA89], we study in this paper the costs associated with distributed allocation of computing resources in a multitasking environment. Using funds endowed upon arrival, computing tasks compete for necessary resources through sealed-bid auctions to improve their processing schedules. The costs and times dedicated to auctioning are compared to the costs and times allowed for task processing. Measuring computing resources in terms of processing rates allows the task management, in the form of an auction algorithm, to have its requirements specified in the same way as the requirements for the simulated mission processing. Machine capacity is computed for and assigned to each completing task. Data are then compiled by segmented capacity classes. A unifying theme of past and current research is the efficiency of auctioning to allocate reconfigurable computing resources in a variable capacity machine. We observed that at optimal rates of occurrence of capacity classes which minimize the total costs per successful completion, congestion was resolved through auctions generating endogenously implied prices which substantially exceeded the exogenously imposed price.","PeriodicalId":399502,"journal":{"name":"1990 Eastern Multiconference. Record of Proceedings. The 23rd Annual Simulation Symposium","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132758684","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Simulation Of RAM-Based Asynchronous Sequential Circuits","authors":"A. Goel, A. Kalia","doi":"10.1109/SIMSYM.1990.717385","DOIUrl":"https://doi.org/10.1109/SIMSYM.1990.717385","url":null,"abstract":"We have developed a computer simulator for the asynchronous sequential circuits (ASCs) constructed by using the random access memories (RAMs). This is a generic simulator with respect to the manufacturing technology of the RAM because all the time delays are variables and can be changed by the user. In addition, there is-no restriction on the RAM size. The simulated RAM can be programmed and then the simulator simulates the ASC with its direct feedback connections. The durations of the transition states are generated in a random fashion. The user can change the input state interactively from the keyboard and the output state of the ASC is continuously displayed on the monitor screen.","PeriodicalId":399502,"journal":{"name":"1990 Eastern Multiconference. Record of Proceedings. The 23rd Annual Simulation Symposium","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124208632","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Computer Simulation For A Space-Time Satellite Positioning System","authors":"J. Huntley, D. Tepper","doi":"10.1109/SIMSYM.1990.717280","DOIUrl":"https://doi.org/10.1109/SIMSYM.1990.717280","url":null,"abstract":"This paper concerns the development of an autonomously distributed satellite network synchronization and positioning system. A simulation is developed to study the problem of having the member satellites obtain a system wide space-time coordinate reference system. The simulation models on board clocks for a system of satellites together with transfer via line of sight transmission using an EM signal of time and position data. It accounts for the various errors of measurement together with orbit mechanics that includes relativistic effects. Each satellite keeps a record of the defining equations for the orbits of the other members of the system. The ideal of the simulation is to find an algorithm for transferring timing and postion data that will produce much agreement as possible for these records for all the members of the system.","PeriodicalId":399502,"journal":{"name":"1990 Eastern Multiconference. Record of Proceedings. The 23rd Annual Simulation Symposium","volume":"231 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116194153","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Simulation Of An Expert Model-Based Adaptive Controller","authors":"M. Ma","doi":"10.1109/SIMSYM.1990.717274","DOIUrl":"https://doi.org/10.1109/SIMSYM.1990.717274","url":null,"abstract":"Model-based adaptive controllers have been practiced with numerous successes. The controller is formed in a on line discrete optimal controller and implemented in control computer. Because of the fast and accurate calculation capability of microcomputer, this type of controller has reached their limits. To explore the potentiality of model based adaptive controller, we investigate the adaptive controller with an expert system for selection of identifiers. The model-based adaptive controller usually uses a recursive least squares identifier. This kind of identifier requires a lot of calculations. An alternative for adaptive function can be using an rule-based expert system to decide the need of updating process time series model. In addition, we can use a simplified recursive least squares identifier. This paper presents the formulation of this type of controller. Moreover, the simulations are carried out to test the practicality of such controller. The effect of such rule-based adaptation plus model-based optimization and controller formulation will be presented by accumulated loss versus sampling periods. The improvement of mean and standard deviation of controlled variable indicates the sophistication of combination of artificial intelligence and computation power of control computer.","PeriodicalId":399502,"journal":{"name":"1990 Eastern Multiconference. Record of Proceedings. The 23rd Annual Simulation Symposium","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127931831","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Simulation Of Final Stop Consonants In Speech Perception Using The Bicameral Neural Network Model","authors":"M. Stinson, D. Foster","doi":"10.1145/99633.99642","DOIUrl":"https://doi.org/10.1145/99633.99642","url":null,"abstract":"This paper demonstrates the integration of contextual information in a neural network for speech perception. Neural networks have been unable to integrate such information successfully because they cannot implement conditional rule structures. The Bicameral neural network employs an asynchronous controller which allows conditional rules to choose neurons for update rather than updating them randomly. The Bicameral model is applied to the perception of word-final plosives, an ongoing problem for machine recognition of speech.","PeriodicalId":399502,"journal":{"name":"1990 Eastern Multiconference. Record of Proceedings. The 23rd Annual Simulation Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130284081","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Role Of Simulation In Developing Game Playing Strategies","authors":"Rhys Price Jones, D. Thuente","doi":"10.1145/99633.99647","DOIUrl":"https://doi.org/10.1145/99633.99647","url":null,"abstract":"This paper presents results concerning the use of simulation in the analysis of finite games and the development of strategies for their solution. Programs were developed in the Scheme programming language [Rees and Clinger 1986] to play large numbers of games pitting various strategies against each other. The games discussed here range from the well-known Tic-tac-toe, through versions of ConnectThree for various sized boards, to the commercial ConnectFour game. The ConnectThree game is based on ConnectFour, but was developed as a simplification amenable to play within reasonable time by perfect strategies that look ahead to the end of the game. The game is played on a vertical array with players alternately dropping disks of their color into the array. The first player to create a row, column or diagonal of three disks of their own color wins. The ConnectFour game is similar, but requires completion of a line of four disks of one's own color to win. Conducting tournaments involving optimal strategies enabled us to predict for which board sizes the ConnectThree game is a first-player win and for which it is a draw. Armed with the results from our simulation, we have been able to prove these predictions in almost all cases. Research is continuing on the ConnectFour game in an effort to determine if and when it is a forced draw or whether the first or second player has the advantage. For this game, it is not computationally feasible to play perfect strategies that look ahead right to the end of the game. In order to develop even good strategies, it is necessary to find good heuristics for evaluating non terminal board positions. At this stage of our investigations, the role of simulation is essentially to evaluate various such heuristics by testing them as predictors of the outcome of games.","PeriodicalId":399502,"journal":{"name":"1990 Eastern Multiconference. Record of Proceedings. The 23rd Annual Simulation Symposium","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134146646","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}