Information processing in the nervous system is receiving increasing attention from researchers in the communications sciences. Stimulating and effective liaison between neurophysiologists and engineers is apparent on several fronts and is expanding rapidly.
{"title":"Neural analogs","authors":"L. D. Harmon","doi":"10.1145/1460833.1460852","DOIUrl":"https://doi.org/10.1145/1460833.1460852","url":null,"abstract":"Information processing in the nervous system is receiving increasing attention from researchers in the communications sciences. Stimulating and effective liaison between neurophysiologists and engineers is apparent on several fronts and is expanding rapidly.","PeriodicalId":307707,"journal":{"name":"AIEE-IRE '62 (Spring)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1962-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121654040","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}
MH-1 is a motorized and sensitized servomanipulator operated by the TX-O computer at the Massachusetts Institute of Technology. It serves as an experimental vehicle to explore the feasibility of direct relations between a digital computer and the physical world with which this computer is concerned. Usually, a human interpreter stands between the computer and the physical world. Instead, the TX-O computer in the MH-1 system is programmed to perform by itself some of the functions normally assigned to the human intermediary; namely, to perceive the world, to appreciate it, and to determine a reasonable course of action after a goal has been specified for the hand. The data processing tools used are, rather than numerical operations on quantitative signals, pattern recognition and simulation of higher cognitive processes such as awareness and understanding. This paper describes some of the experiments performed with MH-1 and the mechanisms upon which the capabilities of MH-1 are based.
{"title":"MH-1, a computer-operated mechanical hand","authors":"Heinrich A. Ernst","doi":"10.1145/1460833.1460839","DOIUrl":"https://doi.org/10.1145/1460833.1460839","url":null,"abstract":"MH-1 is a motorized and sensitized servomanipulator operated by the TX-O computer at the Massachusetts Institute of Technology. It serves as an experimental vehicle to explore the feasibility of direct relations between a digital computer and the physical world with which this computer is concerned. Usually, a human interpreter stands between the computer and the physical world. Instead, the TX-O computer in the MH-1 system is programmed to perform by itself some of the functions normally assigned to the human intermediary; namely, to perceive the world, to appreciate it, and to determine a reasonable course of action after a goal has been specified for the hand. The data processing tools used are, rather than numerical operations on quantitative signals, pattern recognition and simulation of higher cognitive processes such as awareness and understanding. This paper describes some of the experiments performed with MH-1 and the mechanisms upon which the capabilities of MH-1 are based.","PeriodicalId":307707,"journal":{"name":"AIEE-IRE '62 (Spring)","volume":"174 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1962-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121255240","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}
Experiments have been carried out using on-line control of a digital computer to obtain solutions for certain non-linear integral equations. The computer program did not anticipate any particular method of solution; each user constructed his own method during the solution process. Easy cases, those for which the straight-forward iteration converges, were solved with half as many iterations. Difficult cases that were both globally and locally divergent were solved through careful control by the problem solver. Photographs displaying the solution process for two sample cases are included.
{"title":"Solution of nonlinear integral equations using on-line computer control","authors":"G. Culler, R. W. Huff","doi":"10.1145/1460833.1460848","DOIUrl":"https://doi.org/10.1145/1460833.1460848","url":null,"abstract":"Experiments have been carried out using on-line control of a digital computer to obtain solutions for certain non-linear integral equations. The computer program did not anticipate any particular method of solution; each user constructed his own method during the solution process. Easy cases, those for which the straight-forward iteration converges, were solved with half as many iterations. Difficult cases that were both globally and locally divergent were solved through careful control by the problem solver. Photographs displaying the solution process for two sample cases are included.","PeriodicalId":307707,"journal":{"name":"AIEE-IRE '62 (Spring)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1962-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133965037","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}
F. J. Corbató, Marjorie Merwin-Daggett, Robert C. Daley
It is the purpose of this paper to discuss briefly the need for time-sharing, some of the implementation problems, an experimental timesharing system which has been developed for the contemporary IBM 7090, and finally a scheduling algorithm of one of us (FJC) that illustrates some of the techniques which may be employed to enhance and be analyzed for the performance limits of such a time-sharing system.
{"title":"An experimental time-sharing system","authors":"F. J. Corbató, Marjorie Merwin-Daggett, Robert C. Daley","doi":"10.1145/1460833.1460871","DOIUrl":"https://doi.org/10.1145/1460833.1460871","url":null,"abstract":"It is the purpose of this paper to discuss briefly the need for time-sharing, some of the implementation problems, an experimental timesharing system which has been developed for the contemporary IBM 7090, and finally a scheduling algorithm of one of us (FJC) that illustrates some of the techniques which may be employed to enhance and be analyzed for the performance limits of such a time-sharing system.","PeriodicalId":307707,"journal":{"name":"AIEE-IRE '62 (Spring)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1962-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125636215","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 deals with nonlinear programming. In particular, it summarizes a newly developed program suitable for optimization of a computer-controlled process. The program applies probing and constraint-following algorithms which permit solving the optimization problem in difficult cases. These cases include nonlinear or discontinuous objective functions, constraint functions, and nonconvex domains. The program has become known as the "Poor Man's Optimizer," as it requires relatively little storage for program and data. It is applicable to the relatively small digital computers now popular in process control.
{"title":"A nonlinear digital optimizing program for process control systems","authors":"R. A. Mugele","doi":"10.1145/1460833.1460836","DOIUrl":"https://doi.org/10.1145/1460833.1460836","url":null,"abstract":"This paper deals with nonlinear programming. In particular, it summarizes a newly developed program suitable for optimization of a computer-controlled process. The program applies probing and constraint-following algorithms which permit solving the optimization problem in difficult cases. These cases include nonlinear or discontinuous objective functions, constraint functions, and nonconvex domains.\u0000 The program has become known as the \"Poor Man's Optimizer,\" as it requires relatively little storage for program and data. It is applicable to the relatively small digital computers now popular in process control.","PeriodicalId":307707,"journal":{"name":"AIEE-IRE '62 (Spring)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1962-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114988800","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 theories of classical association psychology (circa 1750-1900) attempted to explain human thought processes in terms of certain mechanistic forces operating on discrete entities called "sensations," "images," and "ideas." Although these theories have become unfashionable since the turn of the century, due primarily to their ambiguity and the difficulty of experimental verification, and whereas they may never prove adequate for human psychology, it is possible that they may, nevertheless, provide a fruitful basis for some types of artificial intelligence. One method of exploring ramifications of the classical theories is the formulation of an abstract "machine" which constitutes an interpretation of the theories and whose behavior can be examined in any desired detail. In this paper such a machine is partially constructed, and some of its behavioral features and problems are discussed.
{"title":"An abstract machine based on classical association psychology","authors":"R. F. Reiss","doi":"10.1145/1460833.1460840","DOIUrl":"https://doi.org/10.1145/1460833.1460840","url":null,"abstract":"The theories of classical association psychology (circa 1750-1900) attempted to explain human thought processes in terms of certain mechanistic forces operating on discrete entities called \"sensations,\" \"images,\" and \"ideas.\" Although these theories have become unfashionable since the turn of the century, due primarily to their ambiguity and the difficulty of experimental verification, and whereas they may never prove adequate for human psychology, it is possible that they may, nevertheless, provide a fruitful basis for some types of artificial intelligence. One method of exploring ramifications of the classical theories is the formulation of an abstract \"machine\" which constitutes an interpretation of the theories and whose behavior can be examined in any desired detail. In this paper such a machine is partially constructed, and some of its behavioral features and problems are discussed.","PeriodicalId":307707,"journal":{"name":"AIEE-IRE '62 (Spring)","volume":"230 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":"122068636","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}
Sampled data techniques were first applied to digital operations by Linvill and Saltzer in order to study the errors resulting from the use of numerical integration techniques. The purpose of this paper is to develop an understanding for the mechanics of errors in the digital differential analyzer and to evolve a conceptually simple error theory. This is accomplished by establishing some of the basic comcepts regarding the applications of sampled data techniques to the integration process; developing the matrix model for the solution of a system of linear differential equations with constant coefficients on a digital differential analyzer and then using the W-transform to finalize the error theory. It is then easily shown that simple adjustments to the coefficient matrix of linear differential equations with constant coefficients will allow one to obtain solutions to these equations the accuracy of which is limited only by round-off errors.
{"title":"DDA error analysis using sampled data techniques","authors":"D. Nelson","doi":"10.1145/1460833.1460875","DOIUrl":"https://doi.org/10.1145/1460833.1460875","url":null,"abstract":"Sampled data techniques were first applied to digital operations by Linvill and Saltzer in order to study the errors resulting from the use of numerical integration techniques. The purpose of this paper is to develop an understanding for the mechanics of errors in the digital differential analyzer and to evolve a conceptually simple error theory. This is accomplished by establishing some of the basic comcepts regarding the applications of sampled data techniques to the integration process; developing the matrix model for the solution of a system of linear differential equations with constant coefficients on a digital differential analyzer and then using the W-transform to finalize the error theory. It is then easily shown that simple adjustments to the coefficient matrix of linear differential equations with constant coefficients will allow one to obtain solutions to these equations the accuracy of which is limited only by round-off errors.","PeriodicalId":307707,"journal":{"name":"AIEE-IRE '62 (Spring)","volume":"10 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":"130764662","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 describes the design of a parallel digital differential analyzer which operates at a rate of one million iterations per second. SPEDAC (Solid-State Parallel Expandable Differential Analyzer Computer) features parallel organization of the integrators, serial-parallel arithmetic within the integration cycle, 26-bit word length, and the integral inclusion of a digital function generator. The computer is programmed in analog computer fashion by means of plugboard interconnection of the integrators. To achieve the one megacycle iteration rate, the arithmetic circuits operate at a six megacycle clock rate performing trapezoidal integration. The use of a parallel magnetic core memory permits direct parallel communication and hybrid operation with external large scale general purpose digital computers.
{"title":"Design of a one-megacycle iteration rate DDA","authors":"R. E. Bradley, J. Genna","doi":"10.1145/1460833.1460874","DOIUrl":"https://doi.org/10.1145/1460833.1460874","url":null,"abstract":"This paper describes the design of a parallel digital differential analyzer which operates at a rate of one million iterations per second. SPEDAC (Solid-State Parallel Expandable Differential Analyzer Computer) features parallel organization of the integrators, serial-parallel arithmetic within the integration cycle, 26-bit word length, and the integral inclusion of a digital function generator. The computer is programmed in analog computer fashion by means of plugboard interconnection of the integrators.\u0000 To achieve the one megacycle iteration rate, the arithmetic circuits operate at a six megacycle clock rate performing trapezoidal integration. The use of a parallel magnetic core memory permits direct parallel communication and hybrid operation with external large scale general purpose digital computers.","PeriodicalId":307707,"journal":{"name":"AIEE-IRE '62 (Spring)","volume":"123 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":"115040581","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 general properties of an associative memory are explained, and their advantages relative to a random access memory discussed. Then, a superconductive mechanization of such a memory is described which is based upon the cross film cryotron. The memory requires 5 cryotrons per bit and 9 cryotrons for a control module associated with each word. Any combination of bits of the word can be used as the key, and any number of records in the memory can be identified and read out as the result of a single association. The speed of various circuits in the memory is approximated and some applications are suggested.
{"title":"A superconductive associative memory","authors":"Paul M. Davies","doi":"10.1145/1460833.1460843","DOIUrl":"https://doi.org/10.1145/1460833.1460843","url":null,"abstract":"The general properties of an associative memory are explained, and their advantages relative to a random access memory discussed. Then, a superconductive mechanization of such a memory is described which is based upon the cross film cryotron. The memory requires 5 cryotrons per bit and 9 cryotrons for a control module associated with each word. Any combination of bits of the word can be used as the key, and any number of records in the memory can be identified and read out as the result of a single association. The speed of various circuits in the memory is approximated and some applications are suggested.","PeriodicalId":307707,"journal":{"name":"AIEE-IRE '62 (Spring)","volume":"143 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":"123164200","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 describes a simulation model of a hypothetical business firm. The model was constructed to include not only the accounting and economic factors of costs, profits, sales, units produced, etc., but also psychological and behavioral concepts. Individuals in the firm have aspiration levels, feel pressure, and react in accordance with behavioral theory. The purpose of the model is to study the effects of informational and organizational factors upon the decisions of a business firm. We have had limited knowledge of such variables as: the effects of tardy information, the effects of different distributions of information within the firm, the effects of differing degrees of centralization or decentralization, etc. A comprehensive model, such as the one proposed, is necessary to answer such questions. Eight specific hypotheses involving changes in the organization and information system of the firm were formulated and tested using a factorial experimental design. The results of this experiment demonstrate the usefulness of this model as a research tool.
{"title":"A simulation of a business firm","authors":"C. P. Bonini","doi":"10.1145/1460833.1460837","DOIUrl":"https://doi.org/10.1145/1460833.1460837","url":null,"abstract":"This paper describes a simulation model of a hypothetical business firm. The model was constructed to include not only the accounting and economic factors of costs, profits, sales, units produced, etc., but also psychological and behavioral concepts. Individuals in the firm have aspiration levels, feel pressure, and react in accordance with behavioral theory.\u0000 The purpose of the model is to study the effects of informational and organizational factors upon the decisions of a business firm. We have had limited knowledge of such variables as: the effects of tardy information, the effects of different distributions of information within the firm, the effects of differing degrees of centralization or decentralization, etc. A comprehensive model, such as the one proposed, is necessary to answer such questions.\u0000 Eight specific hypotheses involving changes in the organization and information system of the firm were formulated and tested using a factorial experimental design. The results of this experiment demonstrate the usefulness of this model as a research tool.","PeriodicalId":307707,"journal":{"name":"AIEE-IRE '62 (Spring)","volume":"28 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":"121622999","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
扫码关注我们
求助内容：
应助结果提醒方式：