{"title":"A new stable computing method for the serial hybrid computer integration of partial differential equations","authors":"R. Vichnevetsky","doi":"10.1145/1468075.1468098","DOIUrl":"https://doi.org/10.1145/1468075.1468098","url":null,"abstract":"Partial differential equations involving one space dimension and time can be solved by hybrid computers using the serial (or continuous space-discrete time) method. In so doing, the continuous integration capability of the analog computer is used along the space axis while integration along the time axis is performed in a discrete fashion by making use of finite differences.","PeriodicalId":180876,"journal":{"name":"Proceedings of the April 30--May 2, 1968, spring joint computer conference","volume":"33 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":"125590454","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":"Fourth generation computer systems","authors":"C. Walter, Arline Bohl Walter, Marilyn Bohl","doi":"10.1145/1468075.1468138","DOIUrl":"https://doi.org/10.1145/1468075.1468138","url":null,"abstract":"This paper is presented as a discussion of fourth generation computer systems. To predict future developments in the computer industry is to speculate -- to theorize on the basis of observable trends and anticipated needs. Numerous questions arise. We do not know the answers to all questions nor do we know how to obtain all the answers. The intent of this paper is to suggest reasonable approaches to developments and to offer a solution to a fundamental EDP problem. How can computers and applications be integrated within a communication and control system?","PeriodicalId":180876,"journal":{"name":"Proceedings of the April 30--May 2, 1968, spring joint computer conference","volume":"71 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":"131083027","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":"Universal logic circuits and their modular realizations","authors":"S. Yau, Calvin K. Tang","doi":"10.1145/1468075.1468120","DOIUrl":"https://doi.org/10.1145/1468075.1468120","url":null,"abstract":"In order to achieve the great economic advantage of utilizing integrated circuits in computer circuitry, it is desirable to design a circuit which can realize any logic function of a fixed number of variables by simply varying its input terminal connections. Such a circuit is called a universal logic circuit (ULC). When the number of variables becomes large, a ULC may be too complex to be built in a single package economically. Hence, it is preferred to use ULC's of a small number of variables as the modules to build a ULC of a large number of variables. Such modules are called universal logic modules (ULM's). In this paper, we shall first present a three-variable ULC, which has a fan-in for each logic gate not exceeding four, and consists of only 7 I/O pins. Then, we shall extend the ULC's to four or more variables. There are 12 I/O pins in a ULC of four variables, and several models with different fan-in limitations will be given. The logic gates in the ULC's may be all NAND or all NOR gates. Then, a simple technique for designing a ULC of any large number of variables using the ULC's of a small number of variables, say three variables, as the ULM's will be established. It will be seen that the ULC obtained by this technique will require a small number of ULM's. Moreover, the fault-detection tests for ULM's and a diagnostic procedure for locating all the faulty ULM's in the modular realization of a ULC realizing a given logic function will be presented. Finally, a method for improving the reliability of a ULC using an error-correcting code will be demonstrated.","PeriodicalId":180876,"journal":{"name":"Proceedings of the April 30--May 2, 1968, spring joint computer conference","volume":"61 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":"125635528","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":"Procedures and standards for inter-computer communications","authors":"A. Bhushan, R. Stotz","doi":"10.1145/1468075.1468092","DOIUrl":"https://doi.org/10.1145/1468075.1468092","url":null,"abstract":"In recent years there has been considerable discussion on computer communication networks, information service systems and the computer utility. Sophisticated displays maintained by small processors connected to remote multi-access computers are also being developed. Such applications involving interaction and exchange of information between computers are increasing in number and pointing to the widening need for reliable computer-to-computer communications. In order to allow communication between many arbitrary computers, a uniform agreed-upon manner for exchanging information is needed. This requires the establishment of a standard message format (i.e., character code structure and message syntax) and common communications protocol procedures (i.e., the agreed-upon manner of exchanging messages).","PeriodicalId":180876,"journal":{"name":"Proceedings of the April 30--May 2, 1968, spring joint computer conference","volume":"199 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":"133782762","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 generalized linear model for optimization of architectural planning","authors":"R. J. Aguilar, James E. Hand","doi":"10.1145/1468075.1468089","DOIUrl":"https://doi.org/10.1145/1468075.1468089","url":null,"abstract":"In the realm of architectural planning there exists a type of problem with which designers are frequently confronted where financial return is the most appropriate measure of the system's effectiveness. In this category can be included all rental and speculative housing (single and multiple family dwellings), office buildings, warehouses, stores, many industrial facilities, etc., and building complexes which combine some or all of these to provide comprehensive services to the tenant.","PeriodicalId":180876,"journal":{"name":"Proceedings of the April 30--May 2, 1968, spring joint computer conference","volume":"40 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":"116310597","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 system for interactive graphical programming","authors":"W. Newman","doi":"10.1145/1468075.1468083","DOIUrl":"https://doi.org/10.1145/1468075.1468083","url":null,"abstract":"A system is described in this paper for developing graphical problem-oriented languages. This topic is of great importance in computer-aided design, but has hitherto received only sketchy documentation, with few attempts at a comparative study. Meanwhile displays are beginning to be used for design, and the results of such a study are badly needed. What has held back experimentation with computer graphics has been the difficulty of specifying new graphic techniques using the available programming languages; the method described in this paper appears to avoid this difficulty.","PeriodicalId":180876,"journal":{"name":"Proceedings of the April 30--May 2, 1968, spring joint computer conference","volume":"122 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":"122578026","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":"Computer scheduling methods and their countermeasures","authors":"E. Coffman, L. Kleinrock","doi":"10.1145/1468075.1468078","DOIUrl":"https://doi.org/10.1145/1468075.1468078","url":null,"abstract":"The simultaneous demand for computer service by members from a population of users generally results in the formation of queues. These queues are controlled by some computer scheduling method which chooses the order in which various users receive attention. The goal of this priority scheduling algorithm is to provide the population of users with a high grade of service (rapid response, resource availability, etc.(, at the same time maintaining an acceptable throughput rate. The object of the present paper is to discuss most of the priority scheduling procedures that have been considered in the past few years, to discuss in a coherent way their effectiveness and weaknesses in terms of the performance measures mentioned above, to describe what the analysis of related queueing models has been able to provide in the way of design aids, and in this last respect, to point out certain unsolved problems. In addition we discuss the countermeasures which a customer might use in an attempt to defeat the scheduling algorithm by arranging his requests in such a way that he appears as a high priority user. To the extent that we can carry out such an undertaking, the single most important value of this consolidation of the results of analysis, experimentation, and experience will be in the potential reduction of the uncertainty connected with the design of a workable service discipline.","PeriodicalId":180876,"journal":{"name":"Proceedings of the April 30--May 2, 1968, spring joint computer conference","volume":"35 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":"125920611","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":"Error estimate of a fourth-order Runge-Kutta method with only one initial derivative evaluation","authors":"byA. S. Chai","doi":"10.1145/1468075.1468144","DOIUrl":"https://doi.org/10.1145/1468075.1468144","url":null,"abstract":"In the numerical solution of differential equations it is desirable to have estimates of the local discretization (or truncation) errors of solutions at each step. The estimate may be used not only to provide some idea of the errors, but also to indicate when to adjust the step size. If the magnitude of the estimate is greater than the preassigned upper bound, the step size is reduced to achieve smaller local errors. If the magnitude of the estimate is less than the preassigned lower bound, the step size is increased to save the computing time.","PeriodicalId":180876,"journal":{"name":"Proceedings of the April 30--May 2, 1968, spring joint computer conference","volume":"105 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":"122049859","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":"Standards for user procedures and data formats in automated information systems and networks","authors":"John L. Little, C. Mooers","doi":"10.1145/1468075.1468091","DOIUrl":"https://doi.org/10.1145/1468075.1468091","url":null,"abstract":"At the present time, a low-cost, suitably connected teletypewriter, and a telephone call, is the \"passport\" that can permit a person to make direct contact with any of more than two dozen computer-based information storage and processing capabilities within academic and research establishments scattered across the country. By the same method of access, one can in addition make contact with at least as many commercial services offering similar capabilities. By any reasonable estimate, there are now (Spring 1968) in operation more than two thousand such teletypewriter units which are being used by students, faculty, scientists, engineers, secretaries, and administrators. New accessible computer facilities, both academic and commercial, are being announced with regularity. In addition, large projects, both privately and governmentally sponsored, are under way with the purpose of creating vast topical information stores with associated processors. An important part of some of these plans is the linking of the stores into large networks, both for the exchange of information among the stores, as well as for presentation of the information to, and service to, the directly-connected ultimate user.","PeriodicalId":180876,"journal":{"name":"Proceedings of the April 30--May 2, 1968, spring joint computer conference","volume":"14 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":"132411738","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 applications in computer center management","authors":"Thomas F. McHugh, E. Scott","doi":"10.1145/1468075.1468106","DOIUrl":"https://doi.org/10.1145/1468075.1468106","url":null,"abstract":"Significant developments occurred during the 1960's in the use of computer-based simulation models for management analysis. Data processing personnel contributed extensively to these developments. However, the role characteristically attributed to them emphasized programming and machine operations. Relatively few models have been concerned with management aspects of computer center operations.","PeriodicalId":180876,"journal":{"name":"Proceedings of the April 30--May 2, 1968, spring joint computer conference","volume":"65 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":"124879954","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}