ACM-SE 17最新文献

{"title":"A project involving the use of CAI in teaching a programming language","authors":"J. Hodges","doi":"10.1145/503506.503544","DOIUrl":"https://doi.org/10.1145/503506.503544","url":null,"abstract":"Many college instructors play the role of lecturer, having very little interaction with their studenZs on a one-to-one basis. In this type of situation, the instructor is unable to meet the individual needs of his students, nor is he able to accurately measure a student's progress. Research has indicated that individualized instruction is more effective than conventional classroom instruction, and computer-assisted instruction (CAI) is one form of individualized instruction.","PeriodicalId":258426,"journal":{"name":"ACM-SE 17","volume":"67 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":"127459814","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 analysis of mini-computer configurations to fulfill hospital information system requirements","authors":"Robert D. Drummond","doi":"10.1145/503506.503536","DOIUrl":"https://doi.org/10.1145/503506.503536","url":null,"abstract":"Each of the above approaches has failed to win the support of hospital \"users\" and has failed to satisfy the total informational requirements of the particular medical institution. The most successful systems have been those implemented on mlnl-computers; these systems have achieved the highest degree of user satisfaction. They have not, however, provided the hospital with a centralized data base from which required organizational information can be derived and retrieved.","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":"129957340","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":"Functions of a computerized classification subsystem in a materials management system","authors":"R. Todd","doi":"10.1145/503506.503557","DOIUrl":"https://doi.org/10.1145/503506.503557","url":null,"abstract":"Within a Materials Management System, one of the most important functions is the classification of items. At the Tennessee Valley Authority (TVA), the classification subsystem provides support for standardized procedures for identifying, classifying, and describing material and equipment used and purchased throughout the Agency. This paper describes the three major functions performed by that subsystem. First, the items are classified and identified as unique items or duplicates. Second, material information is provided to the user in the form of hard copy catalogs, fiche, and on-line inquiry. Finally, the Classification Subsystem maintains a Materials Data Base for use by other subsystems to obtain descriptive, supply, and other types of information about the item.","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":"132324489","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":"Storage reduction in relational database systems using spanning trees and other graph theoretic methods","authors":"Pentti A. Honkanen","doi":"10.1145/503506.503513","DOIUrl":"https://doi.org/10.1145/503506.503513","url":null,"abstract":"There are three major configurations for data base systems: the network approach, the hierarchical approach, and the relational approach [4]. At present two of these are commercially available. The network approach (as proposed and developed by CODASYL, the conference on data systems languages) has been implemented in Sperry Univac's DMS ii00, Honeywell's IDS, Cullinane's IDMS, Cincom's TOTAL and others. The hierarchical approach has been implemented by IBM in its Information Management System (IMS), MRI's System 2000, and others. The third approach is essentially in the research and exploratory development stage. Some prototypes of the relational approach, IBM's System R and INGRES, have been developed and tested [2], but mainly for research and study purposes.","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":"130473080","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":"TVA's materials management system (MAMS) project","authors":"D. C. Nowading","doi":"10.1145/503506.503556","DOIUrl":"https://doi.org/10.1145/503506.503556","url":null,"abstract":"The system provides support for the typical activities in the materials cycle: identifying materials needed for construction and maintenance projects, procurement and receipt of those materials, management of inventories at storerooms and plant sites, and materials-related accounting functions. It also provides for uniform numbering of TVA materials, and for the collection, computer storage, and use of consistent descriptive and technical information about those materials. The functions of the system depend heavily on daily computer processing and on on-line access to computer files. Several of the computer-stored files are used by multiple subsystems and by multiple TVA organizations. Sharing the data in this way was a major objective of the design and is one of the strengths of the system.","PeriodicalId":258426,"journal":{"name":"ACM-SE 17","volume":"262 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":"123474978","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":"Formulation of a Markovian model of the major processing delays of the VUCC DECsystem-1099","authors":"P.L. Bennett, D. Foster","doi":"10.1145/503506.503507","DOIUrl":"https://doi.org/10.1145/503506.503507","url":null,"abstract":"For several years there has been widespread interest in optimizing time sharing system performance through the analysis of probability models. In this paper the construction of a simple closed Markovian model of the Vanderbilt University Computer Center DECsystem-1099 is discussed and such a model is presented. The steps which remain in the development of the model - i.e., parameterization, verification, validation, and the use of the model for prediction - are discussed and methods for implementing these steps are proposed.","PeriodicalId":258426,"journal":{"name":"ACM-SE 17","volume":"38 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":"132195551","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":"Some properties of relational expressions","authors":"Martin K. Solomon","doi":"10.1145/503506.503525","DOIUrl":"https://doi.org/10.1145/503506.503525","url":null,"abstract":"We obtain certain results concerning the power of expressions in relational (calculus and algebra) database sublanguages. Our main results state the undecidability of the equivalence and finite equivalence problems for relational expressions. We also observe that the type of join used in a relational algebra affects the complexity of problems for that algebra. For example, using equi-joins instead of natural joins leads to unnecessarily complex expressions. We relate these results to the problems of query optimization and concurrency control.","PeriodicalId":258426,"journal":{"name":"ACM-SE 17","volume":"27 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":"114359636","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":"Spatial operators in natural language understanding: the prepositions","authors":"L. Boggess","doi":"10.1145/503506.503508","DOIUrl":"https://doi.org/10.1145/503506.503508","url":null,"abstract":"The paper describes the operation of a LISP program which accepts English sentences involving spatial prepositions and creates a three dimensional model of the objects described, with emphasis on the appropriate spatial relations between the objects. A sequence of such sentences can result in a fairly elaborate model. The program can then answer questions about the relationship of the objects, even though the relationship in question between two objects in the model may not have been explicit in the original description.","PeriodicalId":258426,"journal":{"name":"ACM-SE 17","volume":"26 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":"126261921","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 parallel implicit Runge-Kutta method for solving ordinary differential equations","authors":"M. Green","doi":"10.1145/503506.503540","DOIUrl":"https://doi.org/10.1145/503506.503540","url":null,"abstract":"Within the past few years, great advances have been made in computer technology, with a major emphasis being in the area of the large-scale integration of digital circuits. As prices continue to decrease and quality continues to increase, manufacturers have increased the speed of hardware components almost to the limit. The present challenge is to find new approaches to increased computational speed. Parallel architecture promises to provide such an increase, but this promise depends critically upon the development of numerical methods that can take advantage of the parallel structure. An obvious approach is to structure new algorithms in such a way that several independent computations can be carried out simultaneously.Most of the existing methods for solving ordinary differential equations are serial in nature. There has been some recent work in the area of modifying and extending serial methods for use on parallel or vector computers. Implicit single-step methods have been studied by Stoller and Morrison, Ceschino and Kuntzman, Butcher and others for implementation on serial computers. The standard techniques for solving the nonlinear implicit equations during each step are not parallel in nature. Miranker and Liniger, who give a general set of parallel linear multistep methods for any even number of arithmetic processors, also give an explicit Runge-Kutta formula which can be used in parallel. Rosser suggested obtaining a block of new values simultaneously, in which step information could be interchanged within the block. Fewer function evaluations per step are needed which makes the implicit methods more competitive. Rosser discusses a procedure for calculating four new values at each stage or function evaluation. Clippinger and Dimsdale have suggested a similar procedure, but with two new values at each stage. Worland has given modifications to sequential procedures which allow them to be executed in parallel. He also shows how these can capitalize effectively on the use of parallel or vector computers available today. Shampine and Watts have made studies on evenly-spaced block implicit single-step methods which are actually more suitable for parallel computation. They suggested that unequal spacing based upon a Lobatto quadrature formula might be used as effectively as equal spacing. This allows a higher-order result to be attained.The purpose of this paper is to present a method for solving ordinary differential equations using an implicit Runge-Kutta single-step formula with uneven spacing.Our primary concern will be the development of a Gauss-based implicit formula for the parallel solution of differential equations that could be used on vector computers (i.e., CDC STAR 100). Other similar techniques could be based on Lobatto or Radau quadrature.We focus on the Gauss forms (where no end points are involved) mainly because they have advantages when the computations are to be carried out on a truely parallel computer.An algorithm is devel","PeriodicalId":258426,"journal":{"name":"ACM-SE 17","volume":"27 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":"126412238","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":"Top-down design of a system summary program","authors":"Mark Waits, E. M. Strand, D. Zissermann","doi":"10.1145/503506.503558","DOIUrl":"https://doi.org/10.1145/503506.503558","url":null,"abstract":"The design of a software system is a complex process involving consideration of several levels and varying amounts of detail within each level. This paper discusses a top-down design of an on-line system summary application. The design is presented in the following fashion: System description providing the background information necessary for further design development and a functional description of the desired application system.","PeriodicalId":258426,"journal":{"name":"ACM-SE 17","volume":"23 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":"124529662","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}