ACM '65 Pub Date : 1965-08-24 DOI: 10.1145/800197.806067

O. I. Franksen, M. D. Rømer

{"title":"Management information systems: Industrial production and digital computers","authors":"O. I. Franksen, M. D. Rømer","doi":"10.1145/800197.806067","DOIUrl":"https://doi.org/10.1145/800197.806067","url":null,"abstract":"SOME OF THE MAIN problems in automating total data processing systems in industry, arise from the more complex problem areas. These areas include many of the so-called engineering design problems and also a majority of the higher level management decision processes in an industrial enterprise. These problem areas are normally dealt with by highly qualified personnel and are quite often presumed not to be automatable. The fact is that many theoretical schools are working on the development of more generalized approaches to handle these areas by means of computers.\u0000 This paper suggests that the experiences from engineering design problems could be extended to a much broader class of problems including management decision processes. This broader class of problems is identified in terms of an abstract formulation of a concept of design. For a design problem, in the above sense, it is possible to state the prerequisites for obtaining a computerized solution in part or totally. When, in a specific industrial enterprise, the different problem areas are divided into elements, definable as design problems, it is possible to state the technically practicable, but not necessarily economically feasible, applications of computers in the enterprise concerned.","PeriodicalId":213949,"journal":{"name":"ACM '65","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1965-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130877742","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}

引用次数: 0

System optimization: Mathematical programming techniques for optimal computer use 系统优化:优化计算机使用的数学规划技术

ACM '65 Pub Date : 1965-08-24 DOI: 10.1145/800197.806071

H. Thiess

{"title":"System optimization: Mathematical programming techniques for optimal computer use","authors":"H. Thiess","doi":"10.1145/800197.806071","DOIUrl":"https://doi.org/10.1145/800197.806071","url":null,"abstract":"IN THIS PAPER we consider the application of mathematical programming techniques for the solution of allocation, assignment, or selection problems of digital computer uses involving large amounts of data input and output in a series of computer runs. Files may be input to several runs in a series of machine runs; further, a file may originally be an output of one of the computer runs. We seek to optimize the allocation or selection of computer memory to blocks of records for each file. Also, we shall seek to optimize the assignment of input-output devices if more than one type of such devices is available. Aside from other applications, we have a memory allocation problem. The minimization of use of memory locations for mostly scientific computing problems was the subject of the ACM Storage Allocation Symposium held in Princeton, N. J. on June 23 - 24, 19611. Wolman2 discusses memory allocation in situations where, e.g., “a general-purpose computer performs the control, switching, and storage functions in a data communication system with message storage.” White3 describes the “Relative Effects of Central Processor and Input-Output Speeds Upon Throughput on the Large Computer.” Delgalvis and Davison4 derive a computational procedure to evaluate the input-output buffer storage requirements of a real-time system.","PeriodicalId":213949,"journal":{"name":"ACM '65","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1965-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130406812","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}

引用次数: 7

Information retrieval: the relevant response theory of information storage and retrieval 信息检索:信息存储与检索的相关反应理论

ACM '65 Pub Date : 1965-08-24 DOI: 10.1145/800197.806042

P. J. Gleason

引用次数: 0

Programming languages for non-numeric processing—1: TRAC, a text handling language 用于非数字处理的编程语言- 1:TRAC，一种文本处理语言

ACM '65 Pub Date : 1965-08-24 DOI: 10.1145/800197.806048

C. Mooers, L. Deutsch

引用次数: 10

Recent study of teaching: machine aids in rehabilitation therapy 教学机器辅助康复治疗的研究进展

ACM '65 Pub Date : 1965-08-24 DOI: 10.1145/800197.806029

G. Rose, M. Woodbury, E. S. Fergusson

引用次数: 1

Information retrieval: information storage and retrieval using AVL trees 信息检索:利用AVL树进行信息存储和检索

ACM '65 Pub Date : 1965-08-24 DOI: 10.1145/800197.806043

C. Foster

{"title":"Information retrieval: information storage and retrieval using AVL trees","authors":"C. Foster","doi":"10.1145/800197.806043","DOIUrl":"https://doi.org/10.1145/800197.806043","url":null,"abstract":"ALTHOUGH TREES have long been used for the storage and retrieval of information 1,2, unfortunately there is a tradeoff between storage (construction) time and retrieval time. To keep retrieval time at a minimum, the tree must be balanced; but posting a new item under this constraint can require a complete reorganization of the tree. Conversely, if the tree is allowed to grow without restriction on its structure, the average number of probes (that is, references to main memory) required for retrieval can approach N/2, depending on the order of arrival of the items.\u0000 Recently, Adel'son-Vel'skiy and Landis presented a tree structure that provides a good compromise between the two extremes of complete balancing and unrestricted growth 3. Their structures - called AVL trees here - are characterized by the constraint that the two subtrees dependent from any node will have maximum path lengths that will differ at most by one.\u0000 This paper reviews the results of Adel'son-Vel'skiy and Landis, presenting somewhat expanded versions of their proofs. It then goes on to derive the mean number of probes for posting and retrieval in these structures. Finally, it shows that the number of probes required to post items on or retrieve items from AVL trees are few enough to permit a suitably organized computer, using only conventional components, to keep up with the delivery of requests from a buffered hypertape.","PeriodicalId":213949,"journal":{"name":"ACM '65","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1965-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120958750","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}

引用次数: 59

Undergraduate research in computer sciences: Computer analysis of musical style 计算机科学本科研究:音乐风格的计算机分析

ACM '65 Pub Date : 1965-08-24 DOI: 10.1145/800197.806054

Andrew J. Gabura

引用次数: 2

Programming languages for non-numeric processing—2: An extended ALGOL based language 用于非数字处理的编程语言- 2:一种扩展的基于ALGOL的语言

ACM '65 Pub Date : 1965-08-24 DOI: 10.1145/800197.806066

G. E. Haynam

引用次数: 0

Numerical applications: updating the product form of the inverse for the revised simplex method 数值应用:更新了修正单纯形法的逆积形式

ACM '65 Pub Date : 1965-08-24 DOI: 10.1145/800197.806052

G. Dantzig, R. P. Harvey, R. D. McKnight

{"title":"Numerical applications: updating the product form of the inverse for the revised simplex method","authors":"G. Dantzig, R. P. Harvey, R. D. McKnight","doi":"10.1145/800197.806052","DOIUrl":"https://doi.org/10.1145/800197.806052","url":null,"abstract":"COMPUTER CODES for solving linear programs by the simplex method usually use one of three forms in representing the problem during the course of solution. These are: (a) - the standard form or original simplex method; (b) - the revised simplex method with explicit inverse; and (c) - the revised simplex method with inverse in product form1. [For a comparison of the relative efficiencies of the three methods, see text by Wolfe and Cutler2.] It is hoped that the method to be proposed will at least partially alleviate one of the principal disadvantages of (c), the product form algorithm, namely the need for frequent reinversion of the basis to reduce the number of transformations, without sacrificing too much of some of its advantages, such as the sparseness of the inverse and the ease with which the inverse is kept current. The chief advantage of this proposal is that the number of non-zeros in the inverse representation is conserved and remains approximately constant after the initial buildup.\u0000 The product form of an inverse with which we are concerned here is the indicated product of a number of elementary m×m transformation matrices, each such matrix being an identity matrix with the exception of one column, the so-called transformation column. Computer codes using the product form of the inverse need to store only these exceptional columns and their column indices; usually only the non-zero elements of these columns and their row positions are stored.","PeriodicalId":213949,"journal":{"name":"ACM '65","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1965-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125007381","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}

引用次数: 0

Complex information processing: a file structure for the complex, the changing and the indeterminate 复杂信息处理:文件结构为复杂的、变化的和不确定的

ACM '65 Pub Date : 1965-08-24 DOI: 10.1145/800197.806036

T. Nelson

引用次数: 440

ACM '65最新文献