ACM '71Pub Date : 1900-01-01DOI: 10.1145/800184.810532
HaroldT. Kay, C. Mundt, Barbara S. Van Yserloo, A. Rimm
{"title":"SCALPEL: Prototype for a computer assisted finite language for data screening","authors":"HaroldT. Kay, C. Mundt, Barbara S. Van Yserloo, A. Rimm","doi":"10.1145/800184.810532","DOIUrl":"https://doi.org/10.1145/800184.810532","url":null,"abstract":"No one has yet been able to devise a computerized method for using a natural language to analyze large data files. As a result scientists and physicians have been limited to using record forms and questionnaires for their information collection. On large studies where computer assistance is required the researcher may lose the opportunity to communicate directly with his own data. Many times he is forced to communicate with a computer programmer/analyst, who then operates on his data.\u0000 We feel that a finite language based on a questionnaire format is an excellent means of allowing the researcher to interrogate his own computerized data. We have created SCALPEL as a prototype language system for multiple statistical inquiries for the non-computer oriented medical scientist; particularily the epidemiologist. The data used to demonstrate this finite language is from a national study of obese persons.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"30 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":"133519163","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}
ACM '71Pub Date : 1900-01-01DOI: 10.1145/800184.810503
H. Lucas
{"title":"A user-oriented approach to systems design","authors":"H. Lucas","doi":"10.1145/800184.810503","DOIUrl":"https://doi.org/10.1145/800184.810503","url":null,"abstract":"The most serious problems in advancing the use of computer-based systems are described as organizational instead of technical. The operations of a computer department are examined to show how the relationship between computer users and professionals often fits the conditions of' a general model of conflict. It is argued that a user-oriented approach to systems design is needed which helps to reduce conflict and promote cooperation. The results of a study of conflict between users and data processing departments are briefly described. It is suggested that the questionnaire and interview techniques used in this study be applied to the process of system design. The recommended procedure includes obtaining data on attitudes and information for use in the design of a new computer system directly from users. Both the data collected and the involvement of users as a result of adopting the approach should help to improve the acceptance and quality of computer-based systems.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"228 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":"124513679","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}
ACM '71Pub Date : 1900-01-01DOI: 10.1145/800184.810469
Henry Pikner
{"title":"Programmed restarts","authors":"Henry Pikner","doi":"10.1145/800184.810469","DOIUrl":"https://doi.org/10.1145/800184.810469","url":null,"abstract":"It can happen to the computer programs that require long execution times that their runs are interrupted due to various reasons lying outside the programs. Part 1 of this paper estimates how much time we shall probably need to run a job, provided that we know the frequency of system halts and how long it takes to run the job smoothly. Mean time for programs that have to start from the very beginning after each halt, is compared with the mean time of the same jobs whose additional (restarting) code allows previous results to be saved and used at a restart. Part 2 states some features the restarting code should have, and finds places in the simplified program structure most suitable for locating parts of the restarting code.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"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":"131527475","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}
ACM '71Pub Date : 1900-01-01DOI: 10.1145/800184.810495
G. Dantzig, S. Eisenstat, T. Magnanti, Steven F. Maier, Michael B. McGrath
{"title":"The Mathematical Programming Language (MPL)","authors":"G. Dantzig, S. Eisenstat, T. Magnanti, Steven F. Maier, Michael B. McGrath","doi":"10.1145/800184.810495","DOIUrl":"https://doi.org/10.1145/800184.810495","url":null,"abstract":"The Mathematical Programming Language (MPL) is a high-level user-oriented programming language intended particularly for developing, testing, and communicating mathematical algorithms. Presented here is an introductory discussion of the language. The major emphasis is on the need for MPL, the resulting design philosophy, and those characteristics that make the language read like mathematics. An example has been included.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"54 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":"127570896","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}
ACM '71Pub Date : 1900-01-01DOI: 10.1145/800184.810497
Bruce O. Larsen
{"title":"A linear programming system for use on time sharing","authors":"Bruce O. Larsen","doi":"10.1145/800184.810497","DOIUrl":"https://doi.org/10.1145/800184.810497","url":null,"abstract":"A linear programming system, NYLPS, designed for batch processing has been adapted for use under time sharing. The new system is called ECLIPS. The system is both conversational, in that it prompts the user for information, and interactive in that the user may interrupt an optimization, change data and continue optimizing without losing the current basis. These features are discussed along with the programming techniques used to accomplish them.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"13 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":"125554072","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}
ACM '71Pub Date : 1900-01-01DOI: 10.1145/800184.810533
E. Laska, G. Logemann
{"title":"Computing at the Information Sciences Division, Rockland State Hospital","authors":"E. Laska, G. Logemann","doi":"10.1145/800184.810533","DOIUrl":"https://doi.org/10.1145/800184.810533","url":null,"abstract":"The activities of the Information Sciences Division include research in bio-mathematics, statistics and computer science, development of information systems, and service to the Research Center in such areas as programming, statistical analyses of data, business and administrative applications of computer technology and on-line data collection.\u0000 The major project of the Information Sciences Division is the Multi-State Information System for Psychiatric Patients. This record keeping system collects information on all phases of patient experience. Data is collected at terminals located in participating facilities on optical scan forms and transmitted to the central computing facility at Rockland State Hospital. Reports reflecting the information collected are returned to the terminal.\u0000 Terminals consisting of an optical mark page reader, a card reader, a line printer, and a keypunch are located in Connecticut, Maine, Massachusetts, New York, Vermont and Washington, D.C. Rhode Island also participates but mails its data to New York for processing.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"32 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":"129338010","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}
ACM '71Pub Date : 1900-01-01DOI: 10.1145/800184.810522
Tatsuya Hayashi
{"title":"On the construction of LR(k) analyzers","authors":"Tatsuya Hayashi","doi":"10.1145/800184.810522","DOIUrl":"https://doi.org/10.1145/800184.810522","url":null,"abstract":"A method for constructing almost optimal Floyd-Evans type Productions for LR(k) grammars is described here. Knuth has given the algorithm for constructing the analyzer. But its parsing table is too large and unacceptable for practical use. The concept of route indexes is used in our method. Using the concept it is possible to transform the transition diagram of Knuth's analyzer into another equivalent one whose number of statuses is much less than that of Knuth's transition diagram. As the result, we can get Productions which are optimal concerning both the time and the space efficiency, at the cost of the constructor complexity.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"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":"125882899","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号
