AFIPS '70 (Fall)Pub Date : 1899-12-30DOI: 10.1145/1478462.1478552
A. Peskin
{"title":"Associative capabilities for mass storage through array organization","authors":"A. Peskin","doi":"10.1145/1478462.1478552","DOIUrl":"https://doi.org/10.1145/1478462.1478552","url":null,"abstract":"Since computers first came into wide usage, digital systems designers have been intrigued by the possibilities of associative or content addressable memories. The concept is quite easy to understand; whereas, in the conventional case, the address is furnished to the memory and the data stored at that location is the expected result, in the associative reference, the data is furnished and the expected result is a list of all addresses which contain matching data. Up to now, however, the physical systems which exhibit the requisite symmetry to realize this concept have been necessarily very costly because the commonly used, low cost, random access memories do not easily lend themselves to this new operation. Those digital systems designers who predicted widespread use of associative memories by the late 1960's are found in retrospect to have seriously underestimated the difficulty in implementing thin magnetic film or superconducting memory systems, on which these forecasts heavily depended.","PeriodicalId":438698,"journal":{"name":"AFIPS '70 (Fall)","volume":"44 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":"115213708","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}
AFIPS '70 (Fall)Pub Date : 1899-12-30DOI: 10.1145/1478462.1478509
M. Woodfill
{"title":"Teaching digital system design with a minicomputer","authors":"M. Woodfill","doi":"10.1145/1478462.1478509","DOIUrl":"https://doi.org/10.1145/1478462.1478509","url":null,"abstract":"Design education requires a study of the \"art\" involved in a given discipline in addition to the study of its \"science.\" Textbooks tend to concentrate on the science and leave the art as 'an exercise for the student.' One solution to this problem is the use of a \"real\" example of the discipline involved as a teaching aid and laboratory tool. With this approach the art and science can be taught in integrated form and with the given system as a base, these principles can be readily extrapolated to other systems. The \"broad brush\" approach to design education without a base of knowledge tends to leave the student little net gain.","PeriodicalId":438698,"journal":{"name":"AFIPS '70 (Fall)","volume":"41 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":"114839138","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}
AFIPS '70 (Fall)Pub Date : 1899-12-30DOI: 10.1145/1478462.1478501
G. Heyliger
{"title":"Digital frequency modulation as a technique for improving telemetry sampling bandwidth utilization","authors":"G. Heyliger","doi":"10.1145/1478462.1478501","DOIUrl":"https://doi.org/10.1145/1478462.1478501","url":null,"abstract":"A hybrid of Time Division Multiplexing (TDM) and Frequency Division Multiplexing (FDM), both well-established in theory and practice is described herein. While related to TDM and FDM, the particular combinations of techniques and implementations are novel and, indeed, provide a third alternative for signal multiplexing applications. The essence of the idea is to perform all band translation and filtering via numerical or digital techniques.","PeriodicalId":438698,"journal":{"name":"AFIPS '70 (Fall)","volume":"191 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":"116453529","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}
AFIPS '70 (Fall)Pub Date : 1899-12-30DOI: 10.1145/1478462.1478550
S. Sacks, N. Palley, H. Shubin, A. Afifi
{"title":"Concurrent statistical evaluation during patient monitoring","authors":"S. Sacks, N. Palley, H. Shubin, A. Afifi","doi":"10.1145/1478462.1478550","DOIUrl":"https://doi.org/10.1145/1478462.1478550","url":null,"abstract":"The Shock Research Unit, a specialized clinical research facility, has been developed by the University of Southern California's School of Medicine for the purpose of rendering intensive care to seriously ill patients. Included is a medium-sized digital computer with a real-time system which monitors the critically ill patient. In addition, the system is being used to study the underlying mechanisms of the disease process and for developing new techniques of evaluating and treating seriously ill patients.","PeriodicalId":438698,"journal":{"name":"AFIPS '70 (Fall)","volume":"119 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":"130193927","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}
AFIPS '70 (Fall)Pub Date : 1899-12-30DOI: 10.1145/1478462.1478472
D. C. Bossen, D. Ostapko, Arvind M. Patel
{"title":"Optimum test patterns for parity networks","authors":"D. C. Bossen, D. Ostapko, Arvind M. Patel","doi":"10.1145/1478462.1478472","DOIUrl":"https://doi.org/10.1145/1478462.1478472","url":null,"abstract":"The logic related to the error detecting and/or correcting circuitry of digital computers often contains portions which calculate the parity of a collection of bits. A tree structure composed of Exclusive-OR gates is used to perform this calculation. Similar to any other circuitry, the operation of this parity tree is subject to malfunctions. A procedure for testing malfunctions in a parity tree is presented in this report.","PeriodicalId":438698,"journal":{"name":"AFIPS '70 (Fall)","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":"134257366","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}
AFIPS '70 (Fall)Pub Date : 1899-12-30DOI: 10.1145/1478462.1478481
K. Day
{"title":"An efficient algorithm for optimum trajectory computation","authors":"K. Day","doi":"10.1145/1478462.1478481","DOIUrl":"https://doi.org/10.1145/1478462.1478481","url":null,"abstract":"This paper describes a variation to the steepest-descent method for generating optimum trajectories. The steepest-descent approach to trajectory optimization was formulated by Kelley, Bryson et al., for numerically solving a variety of two-point boundary-value problems. The procedure is iterative, requiring repeated forward numerical integrations of the state differential equations and backward integrations of the adjoint equations. In many applications, however, convergence was slow; thus, several techniques for speeding convergence were devised.","PeriodicalId":438698,"journal":{"name":"AFIPS '70 (Fall)","volume":"5 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":"121835276","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}
AFIPS '70 (Fall)Pub Date : 1899-12-30DOI: 10.1145/1478462.1478490
W. A. McCuskey
{"title":"On automatic design of data organization","authors":"W. A. McCuskey","doi":"10.1145/1478462.1478490","DOIUrl":"https://doi.org/10.1145/1478462.1478490","url":null,"abstract":"A number of research efforts have contributed to the beginning of a methodology for the automatic design of large-scale information processing systems (IPS). See for instance Nunamaker. One facet of study in these efforts is the design of data organization.","PeriodicalId":438698,"journal":{"name":"AFIPS '70 (Fall)","volume":"46 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":"125700053","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}
AFIPS '70 (Fall)Pub Date : 1899-12-30DOI: 10.1145/1478462.1478536
G. Pitts, P. B. Crawford, B. Bateman
{"title":"Minimizing computer cost for the solution of certain scientific problems","authors":"G. Pitts, P. B. Crawford, B. Bateman","doi":"10.1145/1478462.1478536","DOIUrl":"https://doi.org/10.1145/1478462.1478536","url":null,"abstract":"Many scientific problems require solution of the Laplace, Poission or Fourier equation. These equations occur in heat flow, fluid flow, diffusion and structural problems. It is well known that these types of problems lead to large sets of simultaneous equations that frequently require a number of iterations consuming a lot of computer dollars before a solution is obtained. Frequently one must solve a few hundred to a few thousand simultaneous equations. Numerical methods likely to be used for solution include: (1) Liebmann, an explicit method, (2) alternating direction implicit procedure and (3) banded matrix inversion technique.","PeriodicalId":438698,"journal":{"name":"AFIPS '70 (Fall)","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":"115183200","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}
AFIPS '70 (Fall)Pub Date : 1899-12-30DOI: 10.1145/1478462.1478529
J. Stuehler
{"title":"Manufacturing process control at IBM","authors":"J. Stuehler","doi":"10.1145/1478462.1478529","DOIUrl":"https://doi.org/10.1145/1478462.1478529","url":null,"abstract":"IBM manufacturing facilities in both the United States and Europe have installed computer systems of essentially identical design to aid in the control of many types of manufacturing processes. The basic structure of the system is depicted in Figure 1. One or two central computer systems (IBM System 360) are attached to several satellite computers (IBM 1130, 1800 and 360 processors) via a high speed Transmission Control Unit (multiplexor).","PeriodicalId":438698,"journal":{"name":"AFIPS '70 (Fall)","volume":"2 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":"130140441","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}
AFIPS '70 (Fall)Pub Date : 1899-12-30DOI: 10.1145/1478462.1478537
B. Beizer
{"title":"Analytical techniques for the statistical evaluation of program running time","authors":"B. Beizer","doi":"10.1145/1478462.1478537","DOIUrl":"https://doi.org/10.1145/1478462.1478537","url":null,"abstract":"The design of large software systems or real-time systems imposes several constraints on the designer. Predominant among these are the running time of the programs, the amount of memory used by these programs, and the input/output channel utilization. A well considered design not only runs, but has optimum efficiency. Efficiency is often measured by the running time of the program.","PeriodicalId":438698,"journal":{"name":"AFIPS '70 (Fall)","volume":"385 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":"122841650","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}