ACM-SE 17Pub Date : 1979-04-09DOI: 10.1145/503506.503510
Mark Alan Darholt
{"title":"An implementation of 'blocks' in SPITBOL","authors":"Mark Alan Darholt","doi":"10.1145/503506.503510","DOIUrl":"https://doi.org/10.1145/503506.503510","url":null,"abstract":"A relatively new datatype, called a block, was designed and implemented by James F. Gimpel in the SNOBOL4 programming language[1,2]. SNOBOL4[3] being an interpreter, requires significantly more execution time and memory than a compiler. To overcome this deficiency, Robert B. K. Dewar and Kenneth E. Belcher, at the Illinois Institute of Technology, designed a speedy implementation of SNOBOL4 known as SPITBOL[4]. SPITBOL is a compiler, it requires less time and memory than SNOBOL4. At the time SPITBOL was written, the block datatype was not included. This paper describes an external routine which was developed to add the block datatype to SPITBOL. The availability of blocks in SPITBOL opens many new paths for data structures in the field of non-numeric applications. Three dimensional data structures can be used in many areas of computer science. For example, l) Computer Graphics, displaying three dimensional geographic locations on a two dimensional surface; 2) Artificial Intelligence, scene analysis and mechanical theorem proving; and 3) Business Applications, displaying reports and statements (overprinting to highlight important items).","PeriodicalId":258426,"journal":{"name":"ACM-SE 17","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129780852","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-SE 17Pub Date : 1979-04-09DOI: 10.1145/503506.503511
Lionel E. Deimel, Tempe Ann Lampe
{"title":"A heuristic for optimizing the multiplication of matrix chains","authors":"Lionel E. Deimel, Tempe Ann Lampe","doi":"10.1145/503506.503511","DOIUrl":"https://doi.org/10.1145/503506.503511","url":null,"abstract":"A consequence of the associative property of matrix multiplication is that the product of n matrices can be calculated in (n-1)! ways. Different choices for the multiplication sequence can cause the numbers of scalar multiplications required to vary by several orders of magnitude. The optimal ordering with respect to number of scalar multiplications can be found in O(n3) time using dynamic programming. A heuristic is presented which finds an optimal or nearly optimal strategy in O(n2) time in its most straightforward implementation. The problem is important in interpretation or code generation for languages which allow high-level manipulation of matrices.","PeriodicalId":258426,"journal":{"name":"ACM-SE 17","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127690185","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-SE 17Pub Date : 1979-04-09DOI: 10.1145/503506.503550
M. Paulk
{"title":"Potentials and problems of the classification space method","authors":"M. Paulk","doi":"10.1145/503506.503550","DOIUrl":"https://doi.org/10.1145/503506.503550","url":null,"abstract":"A technique for representing human knowledge and judgments developed by Ossorio 1 is described. A matrix of judgments obtained from human experts is factor analyzed, and the resulting factors are used to define an n-dimensional space. Items may be assigned positions in the space by a weighted sum of their component factors. Items close to one another geometrically should be close conceptually. Is a significant amount of information lost in the factor analysis? How stable is the technique? Does the factor analysis extract \"conceptually significant\" factors? The technique is \"humanistic\" in approach, and there are ways to determine how well objects are represented in the space. Systems using this method have been promising in information retrieval and medical diagnosis.","PeriodicalId":258426,"journal":{"name":"ACM-SE 17","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128564653","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-SE 17Pub Date : 1979-04-09DOI: 10.1145/503506.503521
N. Niccolai
{"title":"Indirect addressing techniques in the design and implementation of an on-line file access program","authors":"N. Niccolai","doi":"10.1145/503506.503521","DOIUrl":"https://doi.org/10.1145/503506.503521","url":null,"abstract":"This paper considers design criteria for generalized file access program and describes implementation of such a program using indirect addressing techniques in a higher level language. The implementation discussed is an on-line program to create and maintain herbarium records written in PL/I. The author shows that the indirect addressing techniques yield a concise, easily modifiable program which can be used on an arbitrary file by simply modifying initialization parameters.","PeriodicalId":258426,"journal":{"name":"ACM-SE 17","volume":"36 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114040836","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-SE 17Pub Date : 1979-04-09DOI: 10.1145/503506.503538
C. Eastman
{"title":"Lexical characteristics of keywords in COBOL, FORTRAN, Pascal, and PL/I","authors":"C. Eastman","doi":"10.1145/503506.503538","DOIUrl":"https://doi.org/10.1145/503506.503538","url":null,"abstract":"Lexical techniques for the study of texts invvarious forms are based upon the symbols used. Common lexical measures are word counts, word frequency distributions, word length distributions, and character frequency distributions. Lexical analysis involves no direct consideration of the grammatical structure or meaning of the text. Thus, it is less powerful than syntactic or semantic analysis. But, when ~t is applicable, it is usually much easier than the more powerful techniques and thus more likely to lead to practical tools.","PeriodicalId":258426,"journal":{"name":"ACM-SE 17","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127166255","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-SE 17Pub Date : 1979-04-09DOI: 10.1145/503506.503555
D. B. Walters
{"title":"A brief look at a section of a materials management system","authors":"D. B. Walters","doi":"10.1145/503506.503555","DOIUrl":"https://doi.org/10.1145/503506.503555","url":null,"abstract":"A Materials Management System has been developed for the Tennessee Valley Authority (TVA). A short discussion of TVA should help to put the system into perspective. The Tennessee Valley Authority is a corporate agency of the Federal Government created by Act of Congress in 1933, and operates with a reasonable degree of the autonomy and flexibility of a private corporation. Because TVA is charged with improving the navigability and providing for the flood control of the Tennessee River, TVA employs approximately 38,000 people, covers seven states, and expends approximately $1.5 billion annually for operation and maintenance.","PeriodicalId":258426,"journal":{"name":"ACM-SE 17","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123714053","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-SE 17Pub Date : 1979-04-09DOI: 10.1145/503506.503552
William C. Richards
{"title":"Evaluation of the attributes of the computer science graduate","authors":"William C. Richards","doi":"10.1145/503506.503552","DOIUrl":"https://doi.org/10.1145/503506.503552","url":null,"abstract":"The business sector of our economy is responsible for the majority of the demand for current computer science graduates. This paper effectuates an approach at investigating this demand and how it concurs with the supply. To perform this task of serving as a communication link with industry, a questionnaire is to be utilized. Attributes, such as writing skills, documentation ability and planning techniques, are evaluated to determine if the graduate can effectively operate in an industrial environment. The overall purpose is to rate the current computer science graduate in relation to the needs of industry. It is not however, the design nor function of this paper to specifically rate educational institutions but, to provide an output medium to communicate industries needs.","PeriodicalId":258426,"journal":{"name":"ACM-SE 17","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115436597","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-SE 17Pub Date : 1979-04-09DOI: 10.1145/503506.503522
Niket K. Patwardhan
{"title":"Useful and necessary features in a general interprocess communication facility","authors":"Niket K. Patwardhan","doi":"10.1145/503506.503522","DOIUrl":"https://doi.org/10.1145/503506.503522","url":null,"abstract":"Different interprocess communication facilities(IPC) are compared to come up with a set of facilities that will serve most needs. Example facilities and problems are considered. A set of 10 features is found to satisfy almost all requirements. All are discussed at the user level.","PeriodicalId":258426,"journal":{"name":"ACM-SE 17","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125578187","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-SE 17Pub Date : 1979-04-09DOI: 10.1145/503506.503553
Lorna S. Schmittou
{"title":"The use of small computer systems in CAI","authors":"Lorna S. Schmittou","doi":"10.1145/503506.503553","DOIUrl":"https://doi.org/10.1145/503506.503553","url":null,"abstract":"The purpose of this presentation is to discuss how Computer Assisted Instruction modules can be implemented through the use of mini and micro computer storage systems. Various factors will be examined in order to evaluate the extent to which small computer systems bear further investigation. Some aspects to be considered are cost effectiveness for elementary, secondary and higher level education, portability of the software, the languages being used, whether any real improvement in educational quality has been accomplished and which educational uses are giving the best results.A comparison will be made between the relative costs of small computer systems and those of a larger interactive system. The extent to which teachers become involved with the system will be considered, as well as the attitudes of students using the system. The extent to which the small computer system will be able to utilize graphics and implement complex programs will be discussed. Observations will be made concerning the present and possible future impact of micro-computers on Computer Assisted Instruction.","PeriodicalId":258426,"journal":{"name":"ACM-SE 17","volume":"61 2-3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131445524","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-SE 17Pub Date : 1979-04-09DOI: 10.1145/503506.503518
J. Linn
{"title":"Measuring hardware efficiency by distribution of resources within a single program","authors":"J. Linn","doi":"10.1145/503506.503518","DOIUrl":"https://doi.org/10.1145/503506.503518","url":null,"abstract":"A view of efficiency is proposed which tries to account for how much resource is used in the actual problem solution and how much in the control of the instruction stream. Analyses are performed to determine the effects of two architectural modifications -- cache memory and memory mapped registers -- on the efficiency of a simple list merging process.","PeriodicalId":258426,"journal":{"name":"ACM-SE 17","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123340839","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}