Three problems associated with structured data sets -- description, allocation, and retrieval -- are briefly considered. The first is a problem in describing data to a compiler in a formal manner that will allow the compiler program to allocate storage and retrieve data when the data is referenced. The second is the problem of providing contiguous storage for the data set in such a way that when suitably described pieces of the data are required at run time, the positions of these pieces of data relative to some base will be determinable. The third problem is that of referencing or describing subsets of the data set. A class of data structures is defined. This class is shown to be a generalization of the class of structures which are representable as n-dimensional rectangular arrays. These structures are termed generalized structures; a formal method of describing these structures (by descriptors) is defined. The formal entities, called reference expressions, that describe the data to be retrieved from storage, are also defined for this class of structures. Finally, the appropriate form of the storage mapping function is derived. The storage mapping function is the mathematical expression which relates the description of an item of data to its position in memory. The manner in which this function is derived from the descriptor is shown. In every case, the work performed for generalized structures is shown to be a direct generalization of the corresponding considerations for rectangular arrays. Finally, an ALGOL program for the Burroughs 220 computer is briefly described. The program simulates the actions that a compiler would take upon receiving a descriptor in forming the storage mapping function, and the actions that would be carried out at run time when a reference expression is presented.
{"title":"Data structures that generalize rectangular arrays","authors":"S. A. Hoffman","doi":"10.1145/1460833.1460870","DOIUrl":"https://doi.org/10.1145/1460833.1460870","url":null,"abstract":"Three problems associated with structured data sets -- <u>description, allocation</u>, and <u>retrieval</u> -- are briefly considered. The first is a problem in describing data to a compiler in a formal manner that will allow the compiler program to allocate storage and retrieve data when the data is referenced. The second is the problem of providing contiguous storage for the data set in such a way that when suitably described pieces of the data are required at run time, the positions of these pieces of data relative to some base will be determinable. The third problem is that of referencing or describing subsets of the data set. A class of data structures is defined. This class is shown to be a generalization of the class of structures which are representable as n-dimensional rectangular arrays. These structures are termed generalized structures; a formal method of describing these structures (by descriptors) is defined. The formal entities, called reference expressions, that describe the data to be retrieved from storage, are also defined for this class of structures. Finally, the appropriate form of the storage mapping function is derived. The storage mapping function is the mathematical expression which relates the description of an item of data to its position in memory. The manner in which this function is derived from the descriptor is shown. In every case, the work performed for generalized structures is shown to be a direct generalization of the corresponding considerations for rectangular arrays. Finally, an ALGOL program for the Burroughs 220 computer is briefly described. The program simulates the actions that a compiler would take upon receiving a descriptor in forming the storage mapping function, and the actions that would be carried out at run time when a reference expression is presented.","PeriodicalId":307707,"journal":{"name":"AIEE-IRE '62 (Spring)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121139528","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}
The basic problem considered here is the computation of the reentry trajectory of a single ballistic missile warhead as well as the trajectories of a number of decoys which originate from the warhead trajectory. Suitable three dimensional equations of motion are presented for a reentry vehicle with arbitrary drag coefficient, mass, and area, and the analog computer circuit for solving these equations in real time is given. Then a method of using several such circuits to compute simultaneously the trajectories of multiple targets with variations in all three initial velocity components as well as variations in ballistic coefficient is presented.
{"title":"Analog simulation of the re-entry of a ballistic missile warhead and multiple decoys","authors":"L. Fogarty, R. Howe","doi":"10.1145/1460833.1460863","DOIUrl":"https://doi.org/10.1145/1460833.1460863","url":null,"abstract":"The basic problem considered here is the computation of the reentry trajectory of a single ballistic missile warhead as well as the trajectories of a number of decoys which originate from the warhead trajectory. Suitable three dimensional equations of motion are presented for a reentry vehicle with arbitrary drag coefficient, mass, and area, and the analog computer circuit for solving these equations in real time is given. Then a method of using several such circuits to compute simultaneously the trajectories of multiple targets with variations in all three initial velocity components as well as variations in ballistic coefficient is presented.","PeriodicalId":307707,"journal":{"name":"AIEE-IRE '62 (Spring)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128080384","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}
Simulation of a system by digital computer requires: • A model of the system which is intelligible to the student of the system while compatible with the limitations of the computer. • Translation of the model to computer code. • Movement of the model through time. • Recording the performance of the model. SIMPAC, a "simulation package," incorporates coherent techniques and devices for the accomplishment of these objectives: modeling concepts for building a computer-compatible model, a vocabulary for encoding the model, a computer program for moving the model through time and recording its performance, and an output presentation program. A model of a hypothetical business system has been implemented with the first version of SIMPAC for the purpose of studying management controls in a complex system. This paper discusses digital simulation and SIMPAC and introduces modeling concepts which may lead to a set of simulation systems, called 'Muse', which would assemble models of varying complexity from descriptive statements and analyze the models prior to simulation.
{"title":"Toward a general simulation capability","authors":"M. Lackner","doi":"10.1145/1460833.1460835","DOIUrl":"https://doi.org/10.1145/1460833.1460835","url":null,"abstract":"Simulation of a system by digital computer requires:\u0000 • A model of the system which is intelligible to the student of the system while compatible with the limitations of the computer.\u0000 • Translation of the model to computer code.\u0000 • Movement of the model through time.\u0000 • Recording the performance of the model.\u0000 SIMPAC, a \"simulation package,\" incorporates coherent techniques and devices for the accomplishment of these objectives: modeling concepts for building a computer-compatible model, a vocabulary for encoding the model, a computer program for moving the model through time and recording its performance, and an output presentation program.\u0000 A model of a hypothetical business system has been implemented with the first version of SIMPAC for the purpose of studying management controls in a complex system.\u0000 This paper discusses digital simulation and SIMPAC and introduces modeling concepts which may lead to a set of simulation systems, called 'Muse', which would assemble models of varying complexity from descriptive statements and analyze the models prior to simulation.","PeriodicalId":307707,"journal":{"name":"AIEE-IRE '62 (Spring)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129389058","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}
On the basis of a specific conceptual model of signal processing in neurons, together with some fragmentary arguments and evidence in physiological literature, an elementary theory of a "multivibrator effect" producible by reciprocally inhibiting neurons is developed. The results of exploratory simulation experiments are described, and speculations on the possible role of the multivibrator effect in semiautomatic muscle control systems are presented.
{"title":"A theory and simulation of rhythmic behavior due to reciprocal inhibition in small nerve nets","authors":"R. F. Reiss","doi":"10.1145/1460833.1460854","DOIUrl":"https://doi.org/10.1145/1460833.1460854","url":null,"abstract":"On the basis of a specific conceptual model of signal processing in neurons, together with some fragmentary arguments and evidence in physiological literature, an elementary theory of a \"multivibrator effect\" producible by reciprocally inhibiting neurons is developed. The results of exploratory simulation experiments are described, and speculations on the possible role of the multivibrator effect in semiautomatic muscle control systems are presented.","PeriodicalId":307707,"journal":{"name":"AIEE-IRE '62 (Spring)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126876801","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}
On-line man-computer communication requires much development before men and computers can work together effectively in formulative thinking and intuitive problem solving. This paper examines some of the directions in which advances can be made and describes on-going programs that seek to improve man-machine interaction in teaching and learning, in planning and design, and in visualizing the internal processes of computers. The paper concludes with a brief discussion of basic problems involved in improving man-computer communication.
{"title":"On-line man-computer communication","authors":"J. Licklider, W. Clark","doi":"10.1145/1460833.1460847","DOIUrl":"https://doi.org/10.1145/1460833.1460847","url":null,"abstract":"On-line man-computer communication requires much development before men and computers can work together effectively in formulative thinking and intuitive problem solving. This paper examines some of the directions in which advances can be made and describes on-going programs that seek to improve man-machine interaction in teaching and learning, in planning and design, and in visualizing the internal processes of computers. The paper concludes with a brief discussion of basic problems involved in improving man-computer communication.","PeriodicalId":307707,"journal":{"name":"AIEE-IRE '62 (Spring)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126294316","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}
An Analog Computer technique for the solution of certain classes of boundary-value problems of partial differential equation based on Finite Fourier Transforms is presented, which requires considerably less computer components than conventional finite difference methods. The derivation of the Finite Fourier Transform method is briefly stated and then applied to analog computer simulations of heat transfer equations with linear and nonlinear boundary conditions.
{"title":"The application of finite fourier transforms to analog computer simulations","authors":"E. Liban","doi":"10.1145/1460833.1460862","DOIUrl":"https://doi.org/10.1145/1460833.1460862","url":null,"abstract":"An Analog Computer technique for the solution of certain classes of boundary-value problems of partial differential equation based on Finite Fourier Transforms is presented, which requires considerably less computer components than conventional finite difference methods. The derivation of the Finite Fourier Transform method is briefly stated and then applied to analog computer simulations of heat transfer equations with linear and nonlinear boundary conditions.","PeriodicalId":307707,"journal":{"name":"AIEE-IRE '62 (Spring)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127913258","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}
The paper describes a succinct problem-oriented programming language. The language is broad in scope, having been developed for, and applied effectively in, such diverse areas as microprogramming, switching theory, operations research, information retrieval, sorting theory, structure of compilers, search procedures, and language translation. The language permits a high degree of useful formalism. It relies heavily on a systematic extension of a small set of basic operations to vectors, matrices, and trees, and on a family of flexible selection operations controlled by logical vectors. Illustrations are drawn from a variety of applications.
{"title":"A programming language","authors":"Kenneth E. Iverson","doi":"10.1145/1460833.1460872","DOIUrl":"https://doi.org/10.1145/1460833.1460872","url":null,"abstract":"The paper describes a succinct problem-oriented programming language. The language is broad in scope, having been developed for, and applied effectively in, such diverse areas as microprogramming, switching theory, operations research, information retrieval, sorting theory, structure of compilers, search procedures, and language translation. The language permits a high degree of useful formalism. It relies heavily on a systematic extension of a small set of basic operations to vectors, matrices, and trees, and on a family of flexible selection operations controlled by logical vectors. Illustrations are drawn from a variety of applications.","PeriodicalId":307707,"journal":{"name":"AIEE-IRE '62 (Spring)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133598048","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}
This paper presents a detailed account of the analog simulation of particle trajectories in a two-dimensional fluid flow field governed by Laplace's equation. A conductive surface is used as a direct analog of the two-dimensional fluid flow field in conjunction with an electronic analog computer to determine the trajectories of particles in the presence of fluid flow. Emphasis is placed on the concept of accuracy of the particle trajectories as well as error criteria by which trajectory accuracy can be judged; and on the sources of error inherent in their determination. A detailed error analysis is presented in which a suitable error model is derived and certain inaccuracies in the computing equipment are assumed in order to predict their effect on the particle trajectories. An example is presented to illustrate the types and magnitudes of errors that exist in a typical problem. The analog simulation is also used to obtain trajectories in a potential flow field distorted by the presence of a cylinder and the results are then compared to a similar case obtained by other authors using a different approach. These results were comparable, with suitable explanations for the differences.
{"title":"Analog simulation of particle trajectories in fluid flow","authors":"V. Norum, M. Adelberg, R. Farrenkopf","doi":"10.1145/1460833.1460861","DOIUrl":"https://doi.org/10.1145/1460833.1460861","url":null,"abstract":"This paper presents a detailed account of the analog simulation of particle trajectories in a two-dimensional fluid flow field governed by Laplace's equation. A conductive surface is used as a direct analog of the two-dimensional fluid flow field in conjunction with an electronic analog computer to determine the trajectories of particles in the presence of fluid flow. Emphasis is placed on the concept of accuracy of the particle trajectories as well as error criteria by which trajectory accuracy can be judged; and on the sources of error inherent in their determination.\u0000 A detailed error analysis is presented in which a suitable error model is derived and certain inaccuracies in the computing equipment are assumed in order to predict their effect on the particle trajectories. An example is presented to illustrate the types and magnitudes of errors that exist in a typical problem. The analog simulation is also used to obtain trajectories in a potential flow field distorted by the presence of a cylinder and the results are then compared to a similar case obtained by other authors using a different approach. These results were comparable, with suitable explanations for the differences.","PeriodicalId":307707,"journal":{"name":"AIEE-IRE '62 (Spring)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128709358","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}
As an introduction this paper considers some of the problems in data handling in a modern hospital. Next, the needs of the users of the data are considered. The principle area of interest is indicated as that hospital function dealing with the storage and retrieval of the clinical record after the patient's hospitalization. The types of terms used in medicine are examined and two currently used schemes for the indexing of diseases are described. Next a storage and retrieval system that permits the medical researcher to examine or browse through clinical records or abstracts of the records is described. The paper concludes with observations on the need for applied research and system development to acquire pilot systems for the storage and retrieval of physiological data.
{"title":"The storage and retrieval of physiological and medical data in a modern hospital","authors":"Paul C. Tiffany","doi":"10.1145/1460833.1460866","DOIUrl":"https://doi.org/10.1145/1460833.1460866","url":null,"abstract":"As an introduction this paper considers some of the problems in data handling in a modern hospital. Next, the needs of the users of the data are considered. The principle area of interest is indicated as that hospital function dealing with the storage and retrieval of the clinical record after the patient's hospitalization. The types of terms used in medicine are examined and two currently used schemes for the indexing of diseases are described. Next a storage and retrieval system that permits the medical researcher to examine or browse through clinical records or abstracts of the records is described. The paper concludes with observations on the need for applied research and system development to acquire pilot systems for the storage and retrieval of physiological data.","PeriodicalId":307707,"journal":{"name":"AIEE-IRE '62 (Spring)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127745659","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}
The design of a total computing system built in the cryogenic medium and with an associative memory is discussed. Topics include instruction sequencing, addressing, indexing, input-output, multi-programming and system programming considerations. The iterative nature of the design of this computer, removing the necessity for much special-purpose hardware, increases its reliability. The associative memory makes it a very flexible and powerful computer.
{"title":"An organization of an associative cryogenic computer","authors":"R. Rosin","doi":"10.1145/1460833.1460857","DOIUrl":"https://doi.org/10.1145/1460833.1460857","url":null,"abstract":"The design of a total computing system built in the cryogenic medium and with an associative memory is discussed. Topics include instruction sequencing, addressing, indexing, input-output, multi-programming and system programming considerations. The iterative nature of the design of this computer, removing the necessity for much special-purpose hardware, increases its reliability. The associative memory makes it a very flexible and powerful computer.","PeriodicalId":307707,"journal":{"name":"AIEE-IRE '62 (Spring)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126159814","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：