{"title":"Test-site evaluation of ICU/PLANIT","authors":"T. Frederick","doi":"10.1145/800192.805724","DOIUrl":"https://doi.org/10.1145/800192.805724","url":null,"abstract":"PLANIT (<underline>P</underline>rogramming <underline>LAN</underline>guage for <underline>I</underline>nteractive <underline>T</underline>eaching) is a language used by authors to generate instructional sequences which are accessed by students via a computer. The Instructor's Computer Utility or ICU/PLANIT is the complete software system which makes PLANIT operational. This system is intended to function either as the sole operating system for the target machine or in co-operation with other operating systems.\u0000 In August 1972, the National Science Foundation selected Purdue University as a test-site for an analysis and evaluation of ICU/PLANIT. Near the end of 1972, the Northwest Regional Educational Laboratory and Dr. Frye contracted with NSF for further PLANIT development and interaction between the test-site and PLANIT development was established.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"8 1","pages":"316-319"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84514184","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":"Computational aspects of data fitting with a new multivariate spline","authors":"P. B. Zwart","doi":"10.1145/800192.805747","DOIUrl":"https://doi.org/10.1145/800192.805747","url":null,"abstract":"The multivariate splines considered are piecewise polynomials of total degree s, with continuous derivatives of order s-1. The piecewise domains consist of the polyhedra obtained by partitioning En with any k hyperplanes. For nondegenerate partitions, the splines have data fitting power which is greater than a single polynomial and less than the standard tensor product splines. An especially simple canonical form represents these splines. This representation, although numerically ill-conditioned, can be effectively used with standard software on problems with 1≤s≤3, 1≤n≤3, 1≤k≤8. Fixed partition problems can be solved with IBM's Scientific Subroutine Package programs for min-max or least squares fitting. Variable partitions can be handled with Marquardt's method, modified to avoid redundant placement of partitions.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"145 1","pages":"409-414"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89067012","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 survey of compiler optimization techniques","authors":"P. Schneck","doi":"10.1145/800192.805690","DOIUrl":"https://doi.org/10.1145/800192.805690","url":null,"abstract":"This survey describes the major optimization techniques of compilers and groups them into three categories: machine dependent, architecture dependent, and architecture independent. Machine-dependent optimizations tend to be local and are performed upon short spans of generated code by using particular properties of an instruction set to reduce the time or space required by a program. Architecture-dependent optimizations are global and are performed while generating code. These optimizations consider the structure of a computer, but not its detailed instruction set. Architecture-independent optimizations are also global but are based on analysis of the program flow graph and the dependencies among statements of source program. The paper also presents a conceptual review of a universal optimizer that performs architecture-independent optimizations at source-code level.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"26 1","pages":"106-113"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79020477","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 applications in a cable television environment","authors":"H. Buckholtz, Eileen Buckholtz","doi":"10.1145/800192.805674","DOIUrl":"https://doi.org/10.1145/800192.805674","url":null,"abstract":"The intention of this paper is to survey the field of cable television and computer applications.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"2 1","pages":"20-26"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73190911","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":"An experimental comparison of relevance-feedback techniques","authors":"R. W. Elliott, Lee E. Cashman","doi":"10.1145/800192.805714","DOIUrl":"https://doi.org/10.1145/800192.805714","url":null,"abstract":"This paper describes an experiment in which seven relevance feedback document retrieval techniques are compared. It is shown that for the set of parameters and indexed document collection used, two of the techniques performed worse than the initial queries and that the greatest gains in precision for the others occur at low levels of recall. At the extreme recall levels no significant differences were found among any of the techniques while over all recall levels no significant differences were found among five of the techniques.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"39 1","pages":"256-261"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75975467","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":"On-line index term predictions using bigram-term associations","authors":"Jon T. Rickman, H. W. Gardner","doi":"10.1145/800192.805715","DOIUrl":"https://doi.org/10.1145/800192.805715","url":null,"abstract":"Predicting index terms (or keywords) by examining a word's component letter strings is investigated. The weights or string-term associations for the letter strings are determined by using relative frequencies computed from a representative sample of the total abstract (or document) collection. The experimental results indicate that the terms predicted by using bigrams (letter pairs) are effectively the same as those predicted by using bigrams and longer letter strings.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"56 1","pages":"262-270"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76165608","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 step toward quality control in computer programming: Understanding the psychology of the management of computer programmers","authors":"R. Littrell","doi":"10.1145/800192.805749","DOIUrl":"https://doi.org/10.1145/800192.805749","url":null,"abstract":"AT THE 1972 ANNUAL MEETING OF THE AMERICAN ASSOCIATION FOR THE ADVANCEMENT OF SCIENCE, SPEAKING BEFORE THE ACM-SPONSORED SESSION ON BETTER COMPUTING FOR RESEARCHERS, DR. RUTH DAVIS, DIRECTOR OF THE CENTER FOR COMPUTER SCIENCE AND TECHNOLOGY OF THE NATIONAL BUREAU OF STANDARDS, STATED THAT THERE WERE SOME 2000 TYPES' OF COMPUTER APPLICATIONS, SUCH AS PAYROLL, WRITING MUSIC, SOLVING DIFFERENTIAL EQUATIONS, ETC. OF THESE, FORTY PERCENT WERE SCIENTIFIC AND ENGINEERING APPLICATIONS (AND THIS KIND OF APPLICATION IS DECREASING RELATIVE TO THE TOTAL), BUSINESS AND MANUFACTURING ACCOUNTED FOR THIRTY PERCENT, AND HUMANITIES APPLICATIONS ALSO TOTALED THIRTY PERCENT. THE ONE COMMON THREAD IN EACH APPLICATION IS THAT MANAGERS CANNOT CONTROL THE QUALITY OF THE PROGRAMS, AND THEY CANNOT CONTROL THE KINDS OF TESTING EMPLOYED, THE PROGRAMS THAT ARE PRODUCED USUALLY HAVE NOT BEEN TESTED THROUGHOUT THE FULL RANGE OF POSSIBLE INPUTS.\u0000 THE TIME HAS COME, DUE TO THE OFTEN TREMENDOUS COSTS OF SYSTEM FAILURES, TO EMPLOY QUALITY CONTROL PROCEDURES DURING PRODUCTION OF PROGRAMS, SINCE QUALITY CONTROL PROCEDURES ARE AN INTEGRAL PART OF MOST BUSINESS AND PRODUCTION ORGANIZATIONS, ONE MIGHT WONDER WHY SIMILAR PROCEDURES HAVE NOT BEEN USED IN DATA PROCESSING SO FAR.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"56 1","pages":"419-423"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77491108","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":"Janus: A data management and analysis system for the behavioral sciences","authors":"J. Stamen, R. M. Wallace","doi":"10.1145/800192.805717","DOIUrl":"https://doi.org/10.1145/800192.805717","url":null,"abstract":"This paper describes the Janus data management and analysis system which has been designed at the Cambridge Project. A prototype of Janus is currently running on the Multics time-sharing system at M.I.T. The data model for the design of Janus is very general and should be usable as a model for data handling in general, as well as for Janus in particular. The Janus command language is an English-like language based on procedural functions - such as define, display, and delete - which act on logical objects from the data model, such as datasets, attributes and entities. For example, delete-attribute, define-attribute and define-dataset are all commands. The implementation of Janus is interesting for a number of reasons: it runs on the Multics system which has segmented and paged memory; it is based almost entirely on datasets (tables), which describe each other as well as themselves; and it is organized in a functionally modular way that is often talked about, but less often done.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"81 1","pages":"273-282"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84309713","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 people and their attitudes toward computerization: A social survey of the ACM'70 Conference","authors":"Ronald E. Anderson, Kay Troost","doi":"10.1145/800192.805686","DOIUrl":"https://doi.org/10.1145/800192.805686","url":null,"abstract":"During the 1970 ACM Annual Conference, a sample of persons were interviewed as they wandered through the exhibit hall. Both computer people and others were asked how they felt about computers and databanks. Although computer people are less negative in their orientation toward computers than the general public, both groups include a suprisingly large number of persons who express negative attitudes toward computers. It appears that the gap between the computer world and the public is less than some have assumed.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"30 1","pages":"87-91"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91249587","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":"An adaptive microscheduler for a multiprogrammed computer system","authors":"Edgar M. Pass, J. Gwynn","doi":"10.1145/800192.805726","DOIUrl":"https://doi.org/10.1145/800192.805726","url":null,"abstract":"The objective of this paper is the description of the development and verification of a new, adaptive method of internal scheduling of resources, with the goal of the optimization of computer system performance. A general system effectiveness measure is defined which parametrically encompasses the prototypical system effectiveness measures to be considered. The adaptive internal scheduler then selects such tasks for resource allocation request fulfillment that a local system effectiveness measure, derived from the general measure, is optimized, leading to semi-optimization of the general measure. The adaptive scheduler functions, as a second-order exponential estimator. A predicator-corrector algorithm functions as the adaptive controller by varying the estimator's parameters and the time of application of the estimator in response to the nature of the sequence of deviations between the predicted and actual values of resource utilization. In order to validate the new scheduler, a workload description in the form of task profile distributions was gathered by a software monitor on the Georgia Tech B5700 running a live job stream. A simulator was developed to allow the comparison of the new scheduler with other nonadaptive schedulers shown to be good by various researchers, under various general system effectiveness measure prototypes. The simulators was validated by running it with the B5700 TSSMCP scheduler against the B5700 workload job profiles. Values resulting from the simulation checked against those of the measured B5700 system quite well. The results of other simulation runs show that the new adaptive scheduler is clearly statistically superior to other schedulers under most measures considered and is inferior to no other scheduler under any measure considered, at least in that environment. Only the new internal scheduler is described here.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"1 1","pages":"327-331"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89749645","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}