Over the last few years, a frequently discussed problem in the area of chemical information systems has been the need for some means by which chemists could communicate with the system in terms of their normal chemical language, the structural formula, rather than requiring them to use special, machine-oriented notations. The Walter Reed Army Institute of Research (WRAIR), as part of its Chemical Structures Storage and Retrieval System, has developed an economical and effective computer program to analyze structural formulas as normally written by chemists, producing as output a detailed description, in machine-oriented format, of the atoms in the molecule and their connections to each other. In principle, any trained chemist can prepare compounds for entry in the system master file, or questions for searching it, without any special training in the WRAIR system. The program is now being used in daily operations and is, we believe, the only operational program capable of performing this function without major restrictions on the formulas which can be accepted. As a special case of the general problem of the man-machine interface, the program may well be of interest outside the chemical field, particularly since many of the techniques used have no essential relation to chemistry.
{"title":"Interpretation of organic chemical formulas by computer","authors":"Albert N. DeMott","doi":"10.1145/1468075.1468086","DOIUrl":"https://doi.org/10.1145/1468075.1468086","url":null,"abstract":"Over the last few years, a frequently discussed problem in the area of chemical information systems has been the need for some means by which chemists could communicate with the system in terms of their normal chemical language, the structural formula, rather than requiring them to use special, machine-oriented notations. The Walter Reed Army Institute of Research (WRAIR), as part of its Chemical Structures Storage and Retrieval System, has developed an economical and effective computer program to analyze structural formulas as normally written by chemists, producing as output a detailed description, in machine-oriented format, of the atoms in the molecule and their connections to each other. In principle, any trained chemist can prepare compounds for entry in the system master file, or questions for searching it, without any special training in the WRAIR system. The program is now being used in daily operations and is, we believe, the only operational program capable of performing this function without major restrictions on the formulas which can be accepted. As a special case of the general problem of the man-machine interface, the program may well be of interest outside the chemical field, particularly since many of the techniques used have no essential relation to chemistry.","PeriodicalId":180876,"journal":{"name":"Proceedings of the April 30--May 2, 1968, spring joint computer conference","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1968-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114386274","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}
A variety of schemes for the specification and operation of parallel computation have been described recently (see also references in Gosden). For the most part, the proposed systems are concerned with parallelism on a detailed or statement level. Furthermore, as argued by Wirth, the proposals are not at a truly procedure- or problem-oriented language level but represent transliterations of machine or process-oriented operations. Notable exceptions to this are the and and shared statements of Wirth, and the parallel for Gosden (similarly the DO TOGETHER in Opler).
{"title":"Control of sequence and parallelism in modular programs","authors":"L. Constantine","doi":"10.1145/1468075.1468135","DOIUrl":"https://doi.org/10.1145/1468075.1468135","url":null,"abstract":"A variety of schemes for the specification and operation of parallel computation have been described recently (see also references in Gosden). For the most part, the proposed systems are concerned with parallelism on a detailed or statement level. Furthermore, as argued by Wirth, the proposals are not at a truly procedure- or problem-oriented language level but represent transliterations of machine or process-oriented operations. Notable exceptions to this are the and and shared statements of Wirth, and the parallel for Gosden (similarly the DO TOGETHER in Opler).","PeriodicalId":180876,"journal":{"name":"Proceedings of the April 30--May 2, 1968, spring joint computer conference","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1968-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129934288","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}
Computer implemented parameter search techniques for optimization problems have become useful engineering design tools over the past few years. Many, if not most of the techniques, are based on deterministic schemes which have inherent limitations when the system is nonlinear. Random search techniques have been suggested which propose to overcome some of the difficulties. References 1--3 give good general discussions of the merits of random techniques. Reference 4 develops an algorithm, based on random methods, to solve the difficult mixed two-point boundary value problem that results from an application of the Maximum Principle. The method was shown to be remarkably effective in solving a fairly complex fifth-order, nonlinear orbital-transfer problem. The purpose of this paper is to discuss the application of the random search algorithm to a still more complex problem to demonstrate its feasibility. The example chosen was the three-dimensional, large-angle, single-axis attitude acquisition control problem in which it is desired to minimize fuel expenditure to accomplish the acquisition. The equations are highly nonlinear since small angle assumptions cannot be made; the control torques are assumed to be limited. This problem is more complex than the orbit-transfer problem in that the dimension of the state vector is greater by 1 and the number of degrees of freedom allowed the control action is greater. The same acquisition problem was discussed in Reference 5 but a proportional control law was assumed. A random parameter search was used in that paper to find the optimal set of feedback constants for the given control system structure so as to minimize system performance (fuel). Systems performances will be compared to indicate the striking improvement in performance with optimal nonlinear control.
{"title":"Optimal control of satellite attitude acquisition by a random search algorithm on a hybrid computer","authors":"W. Kavanaugh, E. Stewart, D. Brocker","doi":"10.1145/1468075.1468140","DOIUrl":"https://doi.org/10.1145/1468075.1468140","url":null,"abstract":"Computer implemented parameter search techniques for optimization problems have become useful engineering design tools over the past few years. Many, if not most of the techniques, are based on deterministic schemes which have inherent limitations when the system is nonlinear. Random search techniques have been suggested which propose to overcome some of the difficulties. References 1--3 give good general discussions of the merits of random techniques. Reference 4 develops an algorithm, based on random methods, to solve the difficult mixed two-point boundary value problem that results from an application of the Maximum Principle. The method was shown to be remarkably effective in solving a fairly complex fifth-order, nonlinear orbital-transfer problem. The purpose of this paper is to discuss the application of the random search algorithm to a still more complex problem to demonstrate its feasibility. The example chosen was the three-dimensional, large-angle, single-axis attitude acquisition control problem in which it is desired to minimize fuel expenditure to accomplish the acquisition. The equations are highly nonlinear since small angle assumptions cannot be made; the control torques are assumed to be limited. This problem is more complex than the orbit-transfer problem in that the dimension of the state vector is greater by 1 and the number of degrees of freedom allowed the control action is greater. The same acquisition problem was discussed in Reference 5 but a proportional control law was assumed. A random parameter search was used in that paper to find the optimal set of feedback constants for the given control system structure so as to minimize system performance (fuel). Systems performances will be compared to indicate the striking improvement in performance with optimal nonlinear control.","PeriodicalId":180876,"journal":{"name":"Proceedings of the April 30--May 2, 1968, spring joint computer conference","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1968-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126552610","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}
During the last few years there has been a growing interest in non-binary switching algebras. A number of such algebras have been proposed, but so far they have had little practical application. Requirements for a practical switching algebra include economical circuits for the basic operations, the ability to implement an arbitrary function with a resonable number of basic circuits, and a suitable set of rules to allow the logic designer to form and manipulate expressions without undue mathematical gymnastics. These are rather vague criteria for a "practical" switching algebra, but they do serve as guidelines for attempts to establish suitable algebras.
{"title":"Selection and implementation of a ternary switching algebra","authors":"R. L. Herrmann","doi":"10.1145/1468075.1468118","DOIUrl":"https://doi.org/10.1145/1468075.1468118","url":null,"abstract":"During the last few years there has been a growing interest in non-binary switching algebras. A number of such algebras have been proposed, but so far they have had little practical application. Requirements for a practical switching algebra include economical circuits for the basic operations, the ability to implement an arbitrary function with a resonable number of basic circuits, and a suitable set of rules to allow the logic designer to form and manipulate expressions without undue mathematical gymnastics. These are rather vague criteria for a \"practical\" switching algebra, but they do serve as guidelines for attempts to establish suitable algebras.","PeriodicalId":180876,"journal":{"name":"Proceedings of the April 30--May 2, 1968, spring joint computer conference","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1968-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125713865","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}
Advances in the computer field have been spectacular and profuse. Sophisticated software can lead multiple users through a time-sharing maze while hardware developments offer increasing speed and flexibility. Research into the man-machine interface, however, uncovered serious deficiencies in equipment available to input graphical data into a computer. This fact prompted work by H. Teager at MIT and others, and by the Rand Corporation which resulted in an ingenious device known as the Rand Tablet. This equipment allows the user to enter two-dimensional information with a free moving electronic pen and flat, pad-like tablet. One simply prints alphanumeric data or sketches circuit diagrams, structural diagrams, or waveforms on the tablet. The computer is continuously supplied with X-Y pen coordinates and can therefore "see" what the operator has drawn.
{"title":"The Sylvania data tablet: a new approach to graphic data input","authors":"Jam Teixeira, R. Sallen","doi":"10.1145/1468075.1468123","DOIUrl":"https://doi.org/10.1145/1468075.1468123","url":null,"abstract":"Advances in the computer field have been spectacular and profuse. Sophisticated software can lead multiple users through a time-sharing maze while hardware developments offer increasing speed and flexibility. Research into the man-machine interface, however, uncovered serious deficiencies in equipment available to input graphical data into a computer. This fact prompted work by H. Teager at MIT and others, and by the Rand Corporation which resulted in an ingenious device known as the Rand Tablet. This equipment allows the user to enter two-dimensional information with a free moving electronic pen and flat, pad-like tablet. One simply prints alphanumeric data or sketches circuit diagrams, structural diagrams, or waveforms on the tablet. The computer is continuously supplied with X-Y pen coordinates and can therefore \"see\" what the operator has drawn.","PeriodicalId":180876,"journal":{"name":"Proceedings of the April 30--May 2, 1968, spring joint computer conference","volume":" 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1968-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133122980","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 original impetus behind the work reported here was a conviction that the storage and retrieval of information, granted computer support, did not really have to be as complex as it now is. The ordinary user, the non-programmer, could and should be provided with the kind of support that would enable him to create his own input, manage his own files, and formulate his own queries. In many cases, the user might willingly exchange efficiency of processing, and perhaps some of the machine's capabilities, for the convenience of obtaining simplicity of input, latitude for a variety of information, a degree of generality in the organization of the stored data, absence of coding incompatibilities, and some facility for unpremeditated retrieval.
{"title":"Computer input of forms","authors":"A. Feldman","doi":"10.1145/1468075.1468124","DOIUrl":"https://doi.org/10.1145/1468075.1468124","url":null,"abstract":"The original impetus behind the work reported here was a conviction that the storage and retrieval of information, granted computer support, did not really have to be as complex as it now is. The ordinary user, the non-programmer, could and should be provided with the kind of support that would enable him to create his own input, manage his own files, and formulate his own queries. In many cases, the user might willingly exchange efficiency of processing, and perhaps some of the machine's capabilities, for the convenience of obtaining simplicity of input, latitude for a variety of information, a degree of generality in the organization of the stored data, absence of coding incompatibilities, and some facility for unpremeditated retrieval.","PeriodicalId":180876,"journal":{"name":"Proceedings of the April 30--May 2, 1968, spring joint computer conference","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1968-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114678124","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 time factor involved in the transportation of information is assuming more importance in data processing. Examples of systems that illustrate the growing dependence of the computer industry on communications are: computer complexes, interactive terminals, computer utility, real time processing and management information systems. In these applications the computer hardware and software costs, as well as computer throughput, have been found to be critically dependent on the data communication operation.
{"title":"The advancing communication technology and computer communication systems","authors":"S. Kaplan","doi":"10.1145/1468075.1468095","DOIUrl":"https://doi.org/10.1145/1468075.1468095","url":null,"abstract":"The time factor involved in the transportation of information is assuming more importance in data processing. Examples of systems that illustrate the growing dependence of the computer industry on communications are: computer complexes, interactive terminals, computer utility, real time processing and management information systems. In these applications the computer hardware and software costs, as well as computer throughput, have been found to be critically dependent on the data communication operation.","PeriodicalId":180876,"journal":{"name":"Proceedings of the April 30--May 2, 1968, spring joint computer conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1968-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116275972","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}
W. Mueller, Paul E. Bucktal, Philippos Lambrinidis, Karl E. Schultz, L. Walsh
With the advent of low-cost digital logic modules, discussions on hardware-software trade-off have become popular. Suggestions have been made to construct an analog computer of digital modules and the availability of digital differential analyzer modules is a step in this direction. Further it has been suggested that a re-evaluation of hardware and software organization be made, considering that there has not been any great systems variation in the implementation of computers.
{"title":"BASP: a biomedical analog signal processor","authors":"W. Mueller, Paul E. Bucktal, Philippos Lambrinidis, Karl E. Schultz, L. Walsh","doi":"10.1145/1468075.1468099","DOIUrl":"https://doi.org/10.1145/1468075.1468099","url":null,"abstract":"With the advent of low-cost digital logic modules, discussions on hardware-software trade-off have become popular. Suggestions have been made to construct an analog computer of digital modules and the availability of digital differential analyzer modules is a step in this direction. Further it has been suggested that a re-evaluation of hardware and software organization be made, considering that there has not been any great systems variation in the implementation of computers.","PeriodicalId":180876,"journal":{"name":"Proceedings of the April 30--May 2, 1968, spring joint computer conference","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1968-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123961368","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}
No matter how much speed or capacity you add to your computer system, programmers will develop software which will tax it to its limits. Programmers at Petty Geophysical Engineering are no exception. Two years ago a fast-multiply unit which can multiply and add 2,000,000 times per second was added to their CDC 3200 installation. Soon afterwards they developed a sophisticated program for enhancing seismic signals which depends heavily on the unit's great speed. The program is called "APE", which is an acronym for Automatic Phase Editing. It has proved to be a valuable tool in the search for oil.
{"title":"A major seismic use for the fast-multiply unit","authors":"R. Forester, T. Hollingsworth, James D. Morgan","doi":"10.1145/1468075.1468088","DOIUrl":"https://doi.org/10.1145/1468075.1468088","url":null,"abstract":"No matter how much speed or capacity you add to your computer system, programmers will develop software which will tax it to its limits. Programmers at Petty Geophysical Engineering are no exception. Two years ago a fast-multiply unit which can multiply and add 2,000,000 times per second was added to their CDC 3200 installation. Soon afterwards they developed a sophisticated program for enhancing seismic signals which depends heavily on the unit's great speed. The program is called \"APE\", which is an acronym for Automatic Phase Editing. It has proved to be a valuable tool in the search for oil.","PeriodicalId":180876,"journal":{"name":"Proceedings of the April 30--May 2, 1968, spring joint computer conference","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1968-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127369821","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}
Hundreds of technical papers and reports on associative systems have been published since 1956 when the first electronic associative memory was reported. So far the use of such a system is still very limited because of its cost. But the tremendous technological advances made in the batch fabrication of thin films and integrated circuits for the last few years would evidently reduce the absolute cost of an associative system and enhance its usefulness.
{"title":"A magnetic associative memory","authors":"T. Feng","doi":"10.1145/1468075.1468116","DOIUrl":"https://doi.org/10.1145/1468075.1468116","url":null,"abstract":"Hundreds of technical papers and reports on associative systems have been published since 1956 when the first electronic associative memory was reported. So far the use of such a system is still very limited because of its cost. But the tremendous technological advances made in the batch fabrication of thin films and integrated circuits for the last few years would evidently reduce the absolute cost of an associative system and enhance its usefulness.","PeriodicalId":180876,"journal":{"name":"Proceedings of the April 30--May 2, 1968, spring joint computer conference","volume":"661 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1968-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116092554","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
扫码关注我们
求助内容：
应助结果提醒方式：