Unconventional methods for matricial compression indicate that large linear programming constraint matrices may comfortably remain core-resident during optimization. Minor changes in the computational aspects of the simplex algorithm coupled with efficient inverse matrix representation show that the major portion of the inverse in product form of a basis may be embedded in the constraint matrix. A method for generating a sparse inverse matrix is presented.
{"title":"Aspects of large-scale in-core linear programming","authors":"James E. Kalan","doi":"10.1145/800184.810500","DOIUrl":"https://doi.org/10.1145/800184.810500","url":null,"abstract":"Unconventional methods for matricial compression indicate that large linear programming constraint matrices may comfortably remain core-resident during optimization. Minor changes in the computational aspects of the simplex algorithm coupled with efficient inverse matrix representation show that the major portion of the inverse in product form of a basis may be embedded in the constraint matrix. A method for generating a sparse inverse matrix is presented.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"373 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133995227","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. Cooperband, William H. Moore, R. Meeker, G. Shure
A previous on-line data analysis system has been generalized and extended on a Digital Equipment PDP-10 computer into an implicit programming system utilizing a special-purpose programming language aimed at behavioral scientists with little or no data processing background who desire to perform special-purpose data analyses or examine their data from an inductive as well as a deductive stance. Central to this new system is a comprehensive data management subsystem that retrieves data from a data base according to implicit associations among data units; that updates the data base with the results of data manipulations in a way that preserves associations among existing data units and establishes such associations with new data units; and that relieves the user of all responsibility for database and file management.
{"title":"TRACE—III: An implicit programming system for inductive data analysis","authors":"A. Cooperband, William H. Moore, R. Meeker, G. Shure","doi":"10.1145/800184.810477","DOIUrl":"https://doi.org/10.1145/800184.810477","url":null,"abstract":"A previous on-line data analysis system has been generalized and extended on a Digital Equipment PDP-10 computer into an implicit programming system utilizing a special-purpose programming language aimed at behavioral scientists with little or no data processing background who desire to perform special-purpose data analyses or examine their data from an inductive as well as a deductive stance. Central to this new system is a comprehensive data management subsystem that retrieves data from a data base according to implicit associations among data units; that updates the data base with the results of data manipulations in a way that preserves associations among existing data units and establishes such associations with new data units; and that relieves the user of all responsibility for database and file management.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123776218","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 is intended to be a guide to the reader interested in new developments in integer programming methods over the past six years. Advances in dual, primal, enumerative and group theoretic procedures are surveyed in an attempt to bring together work that has been scattered over many journals at different times.
{"title":"A guide to recent advances in integer programming methods","authors":"Mary F. McGuire","doi":"10.1145/800184.810518","DOIUrl":"https://doi.org/10.1145/800184.810518","url":null,"abstract":"This paper is intended to be a guide to the reader interested in new developments in integer programming methods over the past six years. Advances in dual, primal, enumerative and group theoretic procedures are surveyed in an attempt to bring together work that has been scattered over many journals at different times.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130596941","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}
Currently, the software technology is not keeping up with the hardware technology. New software must be planned to take advantage of new hardware innovations. This paper describes one such effort. Techniques are described for carrying out the compilation process on a global highly-parallel computer. The problem of data structures and organization within the parallel computer is considered, and two organizations, called the horizontal and the vertical data organizations, are investigated.
{"title":"Parallel compiling techniques","authors":"C. Ellis","doi":"10.1145/800184.810520","DOIUrl":"https://doi.org/10.1145/800184.810520","url":null,"abstract":"Currently, the software technology is not keeping up with the hardware technology. New software must be planned to take advantage of new hardware innovations. This paper describes one such effort. Techniques are described for carrying out the compilation process on a global highly-parallel computer. The problem of data structures and organization within the parallel computer is considered, and two organizations, called the horizontal and the vertical data organizations, are investigated.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130077079","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 PROCSY system uses an IBM 7094 as a front-end computer to provide remote job entry and interactive capabilities for a multiprocessor multiprogramming operating system running on a CDC 6500. It uses a powerful macro-command system on the 7094 to create and edit files which are transmitted to the 6500 for processing. PROCSY now processes more than 4000 jobs per day ranging from short utility jobs to major production jobs. Evaluation and analysis programs on the 7094 and on the 6500 provide performance statistics that help to understand, to debug, and to improve the system.
{"title":"PROCSY: The Purdue Remote On-line Console System","authors":"S. Rosen, J. Steele, R. E. Wagner","doi":"10.1145/800184.810491","DOIUrl":"https://doi.org/10.1145/800184.810491","url":null,"abstract":"The PROCSY system uses an IBM 7094 as a front-end computer to provide remote job entry and interactive capabilities for a multiprocessor multiprogramming operating system running on a CDC 6500. It uses a powerful macro-command system on the 7094 to create and edit files which are transmitted to the 6500 for processing. PROCSY now processes more than 4000 jobs per day ranging from short utility jobs to major production jobs. Evaluation and analysis programs on the 7094 and on the 6500 provide performance statistics that help to understand, to debug, and to improve the system.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"70 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120810417","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 construction of pattern recognition machines may eventually depend upon the development of highly complex preprocessors. This claim is supported by a discussion of the importance of perceptual grouping. Since complex preprocessing will assess more of the basic structure of a visual scene, internal representations will have to be more descriptive in nature. Two approches to descriptive internal representation are mentioned. Two of the author's programs are reviewed. One plays the Oriental game of GO at a human level and the other can recognize digitized hand printed characters. Both programs use a geometry preserving representation of features, so that calculations involving the features can assess the original geometry of the input. In addition, the GO program calculates groups of stones and performs other types of “complex”processing. Practical and philosophical arguments are given for the use of internal representation by pattern recognition programs.
{"title":"Complex preprocessing for pattern recognition","authors":"A. Zobrist","doi":"10.1145/800184.810504","DOIUrl":"https://doi.org/10.1145/800184.810504","url":null,"abstract":"The construction of pattern recognition machines may eventually depend upon the development of highly complex preprocessors. This claim is supported by a discussion of the importance of perceptual grouping. Since complex preprocessing will assess more of the basic structure of a visual scene, internal representations will have to be more descriptive in nature. Two approches to descriptive internal representation are mentioned. Two of the author's programs are reviewed. One plays the Oriental game of GO at a human level and the other can recognize digitized hand printed characters. Both programs use a geometry preserving representation of features, so that calculations involving the features can assess the original geometry of the input. In addition, the GO program calculates groups of stones and performs other types of “complex”processing. Practical and philosophical arguments are given for the use of internal representation by pattern recognition programs.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133100840","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}
GIST, New York City's Geographic Information System, is designed to unify many items of basic information describing the physical, social and environmental features of New York City. Files and programs are being developed for use by all agencies of the city government. The principal files are the Geographic Base File and the Building/Lot File. The GIST Geographic Base File (GBF) has been implemented and has been used by more than 20 city departments. This article describes the present contents of the GBF and related files, significant activities in their development and also describes how the files are being used.
{"title":"Implementation of the GIST Geographic Base File","authors":"R. Amsterdam","doi":"10.1145/800184.810502","DOIUrl":"https://doi.org/10.1145/800184.810502","url":null,"abstract":"GIST, New York City's <underline>G</underline>eographic <underline>I</underline>nformation <underline>S</underline>ys<underline>t</underline>em, is designed to unify many items of basic information describing the physical, social and environmental features of New York City. Files and programs are being developed for use by all agencies of the city government. The principal files are the Geographic Base File and the Building/Lot File. The GIST Geographic Base File (GBF) has been implemented and has been used by more than 20 city departments. This article describes the present contents of the GBF and related files, significant activities in their development and also describes how the files are being used.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"76 5 Pt 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123276394","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 procedure is described to obtain computer oriented solutions to functional organization problems in architectural design. This procedure considers both a satisfactory functional scheme and one that satisfies the dimensional constraints.
{"title":"Rectangular meshes: Their uses and control in computer-produced architectural schemes","authors":"Gonzalo Velez","doi":"10.1145/800184.810540","DOIUrl":"https://doi.org/10.1145/800184.810540","url":null,"abstract":"A procedure is described to obtain computer oriented solutions to functional organization problems in architectural design. This procedure considers both a satisfactory functional scheme and one that satisfies the dimensional constraints.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127333838","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}
Instruction about computers for social scientists centrally involves how to prepare social scientists to behave differently in some manner than they would without instruction. The differences of interest can be helpfully divided into those bearing on the conduct of social science inquiry and those bearing on the social science contribution toward realizing the social benefits and minimizing the social costs of computers. We wish to act so that the intellectual capacity of the social scientists we train will be better than that of their predecessors and the net social value of computers will exceed that of other new and complex technologies. Given these purposes, it seems useful to begin with the performances we want our students to engage in and work backward to the instruction those performances require. The points noted below seem to me to be important, not exhaustive.
{"title":"Social science computing curricula (Panel Session)","authors":"D. Bobrow","doi":"10.1145/800184.810487","DOIUrl":"https://doi.org/10.1145/800184.810487","url":null,"abstract":"Instruction about computers for social scientists centrally involves how to prepare social scientists to behave differently in some manner than they would without instruction. The differences of interest can be helpfully divided into those bearing on the conduct of social science inquiry and those bearing on the social science contribution toward realizing the social benefits and minimizing the social costs of computers. We wish to act so that the intellectual capacity of the social scientists we train will be better than that of their predecessors and the net social value of computers will exceed that of other new and complex technologies. Given these purposes, it seems useful to begin with the performances we want our students to engage in and work backward to the instruction those performances require. The points noted below seem to me to be important, not exhaustive.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"21 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133027925","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}
Witzgall [8], commenting on the gradient projection methods of R. Frisch and J. B. Rosen, states: “More or less all algorithms for solving the linear programming problem are known to be modifications of an algorithm for matrix inversion. Thus the simplex method corresponds to the Gauss-Jordan method. The methods of Frisch and Rosen are based on an interesting method for inverting symmetric matrices. However, this method is not a happy one, considered from the numerical point of view, and this seems to account for the relative instability of the projection methods.” This paper presents an implementation of the gradient projection method which uses a variation of the simplex algorithm. A more detailed exposition is given in [5]; motivation for this approach may be found in [6].
Witzgall[8]在评论R. Frisch和J. B. Rosen的梯度投影方法时指出:“已知所有解决线性规划问题的算法或多或少都是对矩阵反演算法的修改。因此单纯形法对应于高斯-约当法。Frisch和Rosen的方法是基于一个有趣的方法来求对称矩阵的逆。然而，从数值的角度来看，这种方法并不令人满意，这似乎解释了投影方法的相对不稳定性。”本文提出了一种利用单纯形算法的一种变体实现梯度投影法。[5]给出了更详细的说明;这种方法的动机可以在[6]中找到。
{"title":"A simplex algorithm—gradient projection method for nonlinear programming","authors":"L. D. Pyle","doi":"10.1145/800184.810513","DOIUrl":"https://doi.org/10.1145/800184.810513","url":null,"abstract":"Witzgall [8], commenting on the gradient projection methods of R. Frisch and J. B. Rosen, states: “More or less all algorithms for solving the linear programming problem are known to be modifications of an algorithm for matrix inversion. Thus the simplex method corresponds to the Gauss-Jordan method. The methods of Frisch and Rosen are based on an interesting method for inverting symmetric matrices. However, this method is not a happy one, considered from the numerical point of view, and this seems to account for the relative instability of the projection methods.” This paper presents an implementation of the gradient projection method which uses a variation of the simplex algorithm. A more detailed exposition is given in [5]; motivation for this approach may be found in [6].","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128254835","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
扫码关注我们
求助内容：
应助结果提醒方式：