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.
{"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}
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.
{"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}
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.
{"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}
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.
{"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}
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.
{"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}
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.
{"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}
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.
{"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}
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.
{"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}
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
在过去的几年中，计算机技术取得了巨大的进步，主要的重点是在数字电路的大规模集成领域。随着价格的不断下降和质量的不断提高，制造商已经将硬件组件的速度提高到了极限。目前的挑战是找到提高计算速度的新方法。并行架构承诺提供这样的增长，但这一承诺关键取决于能够利用并行结构的数值方法的发展。一个显而易见的方法是构建新的算法，使几个独立的计算可以同时进行。现有的求解常微分方程的方法基本上都是串行的。最近在修改和扩展串行方法以用于并行或矢量计算机方面已经有了一些工作。隐式单步方法已经被Stoller和Morrison, Ceschino和Kuntzman, Butcher和其他人研究了在串行计算机上的实现。求解非线性隐式方程的标准技术在每一步都是不平行的。Miranker和Liniger给出了一组适用于任意偶数算术处理器的并行线性多步方法，并给出了一个可以并行使用的显式龙格-库塔公式。Rosser建议同时获取一个新值块，其中可以在块内交换步长信息。每一步所需的函数求值更少，这使得隐式方法更具竞争力。Rosser讨论了在函数求值的每个阶段计算四个新值的过程。Clippinger和Dimsdale提出了类似的程序，但在每个阶段都有两个新的值。Worland对顺序过程进行了修改，使它们能够并行执行。他还展示了如何有效地利用当今可用的并行或矢量计算机。Shampine和Watts对等间隔块隐式单步方法进行了研究，这种方法实际上更适合并行计算。他们建议，基于Lobatto正交公式的不等间距可以像等间距一样有效地使用。这允许获得更高阶的结果。本文的目的是给出一种用非均匀间隔的隐式龙格-库塔单步公式求解常微分方程的方法。我们的主要关注将是开发一个基于高斯的隐式公式，用于微分方程的并行解，可用于矢量计算机(即CDC STAR 100)。其他类似的技术可以基于Lobatto或Radau正交。我们关注高斯形式(不涉及端点)主要是因为当计算要在真正的并行计算机上执行时，它们具有优势。提出了一种算法，该算法可以同时对几个步骤或基本上并行地产生同时逼近。给出了用3点或9点两种高斯隐式形式求解常微分方程的算法。所有计算均在PDP 11/55上以双精度(17位)进行。该算法的主要目的是显示块内并行性的一种方法。由于PDP 11/55是串行计算机，这实际上是串行完成的;然而，该算法是完全并行的。像CDC STAR 100这样的矢量计算机可以使用矢量指令执行这些并行计算。将给出三个测试用例，以显示此方法相对于现有串行方法的质量。
{"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}
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.
{"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：