Microprogramming—interpreted as implementing control logic in a high speed control memory of either the read-only or read-write type—cuts across the specialties of logic design and system architecture. Microprogramming is, therefore, a promising means for designing integrated hardware/software systems. Microprogramming has also proved to be a successful pedagogical tool for teaching computer science and system architecture. In this session we will address topics fundamental to microprogramming. The session will provide 1) a tutorial overview of the basic principles of microprogramming, 2) a state-of-art survey of the current microprogrammable computers, their characteristics, problems, and limitations, and 3) a survey of sscurrent and future applications.
{"title":"Microprogramming (Tutorial)","authors":"S. S. Husson","doi":"10.1145/800184.810501","DOIUrl":"https://doi.org/10.1145/800184.810501","url":null,"abstract":"Microprogramming—interpreted as implementing control logic in a high speed control memory of either the read-only or read-write type—cuts across the specialties of logic design and system architecture. Microprogramming is, therefore, a promising means for designing integrated hardware/software systems. Microprogramming has also proved to be a successful pedagogical tool for teaching computer science and system architecture.\u0000 In this session we will address topics fundamental to microprogramming. The session will provide 1) a tutorial overview of the basic principles of microprogramming, 2) a state-of-art survey of the current microprogrammable computers, their characteristics, problems, and limitations, and 3) a survey of sscurrent and future applications.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"40 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":"132088940","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}
This paper describes a scheme for iteratively improving the decomposition of a given matrix A into the product of two matrices B and C. Although B and C may be completely general matrices, the scheme is most practically applicable in the LU and QR decompositions of a matrix. The proposed scheme is first shown to improve perturbed L and U factors of a given matrix A. Next, it is shown that this process will allow for the solution of a badly conditioned system of linear equations when other methods, such as direct triangular decomposition, fail miserably. Finally even when a method such as direct triangular decomposition works, but iterative improvement of the initial solution must be made, the proposed scheme may achieve comparable results and prove to be more economical under certain conditions.
{"title":"Improving iterative improvement","authors":"E. Puccinelli","doi":"10.1145/800184.810539","DOIUrl":"https://doi.org/10.1145/800184.810539","url":null,"abstract":"This paper describes a scheme for iteratively improving the decomposition of a given matrix A into the product of two matrices B and C. Although B and C may be completely general matrices, the scheme is most practically applicable in the LU and QR decompositions of a matrix. The proposed scheme is first shown to improve perturbed L and U factors of a given matrix A. Next, it is shown that this process will allow for the solution of a badly conditioned system of linear equations when other methods, such as direct triangular decomposition, fail miserably. Finally even when a method such as direct triangular decomposition works, but iterative improvement of the initial solution must be made, the proposed scheme may achieve comparable results and prove to be more economical under certain conditions.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"219 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":"124340209","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 LCB (Least Common Bigram) method is a dictionary arrangement technique for computerized natural-language searching, based upon certain statistical characteristics of a data base. Once the distribution of elements (such as bigrams) in the data base is known, the LCB method allows each dictionary entry to be sorted on the element least likely to be found in the data base. Thus the LCB method minimizes the number of dictionary entries examined during text searching. Statistical analysis of a dictionary and data base used in literature searching by IIT Research Institute's Computer Search Center shows the LCB method yields a 400% improvement over the traditional method of dictionary lookup. Applications in machine-assisted translation, indexing, linguistic analysis, and other information storage and retrieval areas are foreseen.
LCB (Least Common Bigram)方法是一种基于数据库某些统计特征的计算机化自然语言搜索的字典排列技术。一旦知道了数据库中元素的分布(比如双元组)，LCB方法就允许根据数据库中最不可能找到的元素对每个字典条目进行排序。因此，LCB方法将文本搜索期间检查的字典条目的数量最小化。对IIT研究院计算机检索中心用于文献检索的词典和数据库的统计分析表明，LCB方法比传统的词典查找方法提高了400%。在机器辅助翻译、索引、语言分析和其他信息存储和检索领域的应用被预见。
{"title":"The Least Common Bigram: A dictionary arrangement technique for computerized natural-language text searching","authors":"Elaine M. Onderisin","doi":"10.1145/800184.810473","DOIUrl":"https://doi.org/10.1145/800184.810473","url":null,"abstract":"The LCB (Least Common Bigram) method is a dictionary arrangement technique for computerized natural-language searching, based upon certain statistical characteristics of a data base. Once the distribution of elements (such as bigrams) in the data base is known, the LCB method allows each dictionary entry to be sorted on the element least likely to be found in the data base. Thus the LCB method minimizes the number of dictionary entries examined during text searching. Statistical analysis of a dictionary and data base used in literature searching by IIT Research Institute's Computer Search Center shows the LCB method yields a 400% improvement over the traditional method of dictionary lookup. Applications in machine-assisted translation, indexing, linguistic analysis, and other information storage and retrieval areas are foreseen.","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":"114246371","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}
Earlier work on interactive graphical approximation of data using linear programming has now been extended to ordinary differential equation multipoint boundary value problems. The approximation is obtained using a suitable spline basis where the degree and uniform knot size is specified by the user. The coefficients of the spline basis are determined so as to minimize the maximum error in the differential equation over a specified discrete grid.
{"title":"Interactive graphical spline approximation to boundary value problems","authors":"J. B. Rosen, Paul S. LaFata","doi":"10.1145/800184.810516","DOIUrl":"https://doi.org/10.1145/800184.810516","url":null,"abstract":"Earlier work on interactive graphical approximation of data using linear programming has now been extended to ordinary differential equation multipoint boundary value problems. The approximation is obtained using a suitable spline basis where the degree and uniform knot size is specified by the user. The coefficients of the spline basis are determined so as to minimize the maximum error in the differential equation over a specified discrete grid.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"57 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":"114861780","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 use of index files for accessing records, on the basis of secondary key values is a common feature of existing information systems. This method, judiciously applied, provides major improvements in response time, is easy to implement and costs relatively little. Moreover, the concepts of secondary indexes are simple, yet powerful and flexible because they provide the power to handle all kinds of queries easily with little loss of efficiency. It is, however, important to carefully select the key fields to be indexed because excessive indexing can result in major performance degradation. This paper presents a quantitative tradeoff analysis for index selection. The problem is formulated mathematically as an optimization problem using an index indicator function which becomes positive when the implementation of an index file is desirable and negative otherwise. The variables of this function are derived from the factors that influences the performance of the system. These factors include file and query statistics, frequency and speed of retrieval, and m maintenance for all the relevant files. Two examples illustrating the principle of application in tradeoff analysis are given.
{"title":"An optimization problem on the selection of secondary keys","authors":"V. Lum, H. Ling","doi":"10.1145/800184.810505","DOIUrl":"https://doi.org/10.1145/800184.810505","url":null,"abstract":"The use of index files for accessing records, on the basis of secondary key values is a common feature of existing information systems. This method, judiciously applied, provides major improvements in response time, is easy to implement and costs relatively little. Moreover, the concepts of secondary indexes are simple, yet powerful and flexible because they provide the power to handle all kinds of queries easily with little loss of efficiency. It is, however, important to carefully select the key fields to be indexed because excessive indexing can result in major performance degradation. This paper presents a quantitative tradeoff analysis for index selection.\u0000 The problem is formulated mathematically as an optimization problem using an index indicator function which becomes positive when the implementation of an index file is desirable and negative otherwise. The variables of this function are derived from the factors that influences the performance of the system. These factors include file and query statistics, frequency and speed of retrieval, and m maintenance for all the relevant files. Two examples illustrating the principle of application in tradeoff analysis are given.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"17 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":"126927969","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 feel that, rather than asking whether biomedical investigators should be supported by centralized or decentralized computers, we should ask how investigators may be given effective access to the various kinds of computing service they require. Optimality of a computer configuration cannot be meaningfully assessed apart from the job-mix priorities it is to serve. It is difficult to think of an area of application wherein requirements would differ more from location to location than in biomedical computing. What is good for control of on-line experiments in a physiological laboratory would tend to be inefficient or altogether inadequate for processing the major statistical computations widely encountered in biology and medicine. Conversely, it would usually be uneconomical to tie up a system well suited to statistical computations for continual monitoring of experiments. Not only do we find a spectrum of biologists whose requirements range from control of experiments to complex modeling and statistical analysis, we also find the entire spectrum represented in the work of a single investigator—often, in fact, in a single study. Thus, after preliminary reduction by the laboratory computer, the neurophysiologist's data may require major statistical analysis. In fact, it is likely that occasional bursts of such major support during the course of an experiment might be desired for more sophisticated guidance of the experiment.
{"title":"A reexamination: Centralized versus decentralized computers in biomedical environments","authors":"T. Kehl","doi":"10.1145/800184.810506","DOIUrl":"https://doi.org/10.1145/800184.810506","url":null,"abstract":"We feel that, rather than asking whether biomedical investigators should be supported by centralized or decentralized computers, we should ask how investigators may be given effective access to the various kinds of computing service they require. Optimality of a computer configuration cannot be meaningfully assessed apart from the job-mix priorities it is to serve. It is difficult to think of an area of application wherein requirements would differ more from location to location than in biomedical computing. What is good for control of on-line experiments in a physiological laboratory would tend to be inefficient or altogether inadequate for processing the major statistical computations widely encountered in biology and medicine. Conversely, it would usually be uneconomical to tie up a system well suited to statistical computations for continual monitoring of experiments. Not only do we find a spectrum of biologists whose requirements range from control of experiments to complex modeling and statistical analysis, we also find the entire spectrum represented in the work of a single investigator—often, in fact, in a single study. Thus, after preliminary reduction by the laboratory computer, the neurophysiologist's data may require major statistical analysis. In fact, it is likely that occasional bursts of such major support during the course of an experiment might be desired for more sophisticated guidance of the experiment.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"28 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":"124637023","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}
A computer-aided design system for layout of printed wiring boards is described, with emphasis on component placement and conductor routing algorithms. The system is designed to operate with a data base; placement and routing may be accomplished automatically using force field techniques and a maze-following procedure, or manually with extensive error checking by the computer. Examples of the system output are given.
{"title":"System for Heuristic and Rapid Processing of Component Layout and Wiring (SHARPCLAW)","authors":"S. Urban, N. C. Randall, T. Harley","doi":"10.1145/800184.810511","DOIUrl":"https://doi.org/10.1145/800184.810511","url":null,"abstract":"A computer-aided design system for layout of printed wiring boards is described, with emphasis on component placement and conductor routing algorithms. The system is designed to operate with a data base; placement and routing may be accomplished automatically using force field techniques and a maze-following procedure, or manually with extensive error checking by the computer. Examples of the system output are given.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"3 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":"114964744","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}
Two symbolic and algebraic manipulation programs written in LISP 1.5 are presented for the solution of differential equations. The program LORDE is based on an exact method for solving higher order linear differential equations with constant coefficients and linear boundary conditions. The program TRIALSOLUTIONS is based on a variational technique for testing and evaluating assumed trial solutions of linear elliptical partial differential equations with variable coefficients. The formula pattern recognition and formula manipulation techniques are discussed, and examples are presented to illustrate the problem solving capabilities of these programs.
{"title":"Symbolic and algebraic manipulation for solving differential equations","authors":"P. J. Ossenbruggen, Andrew K. C. Wong, T. Au","doi":"10.1145/800184.810538","DOIUrl":"https://doi.org/10.1145/800184.810538","url":null,"abstract":"Two symbolic and algebraic manipulation programs written in LISP 1.5 are presented for the solution of differential equations. The program LORDE is based on an exact method for solving higher order linear differential equations with constant coefficients and linear boundary conditions. The program TRIALSOLUTIONS is based on a variational technique for testing and evaluating assumed trial solutions of linear elliptical partial differential equations with variable coefficients. The formula pattern recognition and formula manipulation techniques are discussed, and examples are presented to illustrate the problem solving capabilities of these programs.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"12 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":"132795122","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}
An interactive computer program for the kinematic synthesis of motion or function generating linkages is described. The system has been implemented on an 8K IBM 1130 with a storage tube display and a custom-built “globe” graphical input device. The desired performance of the mechanism at four or five prescribed finitely separated positions is specified to the computer, as is the geometry of the fixed and moving bodies. Graphical input devices, or a keyboard, or cards can be used for this purpose. Interactive graphics capability allows input, modification, and display of a complex moving body and fixed frame. Burmester circlepoint-centerpoint curves or Burmester point pairs are displayed for the specified motion, together with a number of other options such as relative poles of rotation. A dynamic cursor which traverses the circlepoint-centerpoint curves allows selection of input and output links of either a four-bar linkage, a slider-crank mechanism, or a turning-block mechanism capable of satisfying the prescribed input criteria. A flashing display aids in selection of circlepoint-centerpoint pairs by indicating the type of linkage that would result from choice of the link being displayed at that instant Grashof's criteria are used to determine whether such a choice would result in a drag link, double rocker, or crank rocker mechanism. Similar criteria have been developed for the slider and turning block equivalents of these mechanisms. The selected linkage can then be animated on the display screen. Continous display of its transmission angle is optional. Examples are given of the practical use of the program.
描述了用于生成运动或功能的连杆机构的运动学综合的交互式计算机程序。该系统已在8K IBM 1130上实现，具有存储管显示器和定制的“全球”图形输入设备。在四个或五个规定的有限分离位置上，机构的期望性能被指定给计算机，固定和运动物体的几何形状也是如此。图形输入设备、键盘或卡片可用于此目的。交互式图形功能允许输入、修改和显示复杂的移动体和固定框架。为指定的运动显示Burmester圆点-中心点曲线或Burmester点对，以及许多其他选项，如旋转的相对极点。动态游标遍历圆点-中心点曲线，可以选择四杆连杆机构、滑块曲柄机构或能够满足规定输入标准的车削块机构的输入和输出连杆。闪烁的显示有助于选择圆点-中心点对，通过指示在该时刻显示的连杆的选择将导致的连杆类型，使用Grashof标准来确定这种选择是否会导致拖动连杆，双摇杆或曲柄摇杆机构。对于这些机构的滑块和车削块等效物也制定了类似的标准。然后，所选的链接可以在显示屏幕上显示动画。连续显示其传输角度是可选的。给出了该程序的实际应用实例。
{"title":"Interactive linkage synthesis on a small computer","authors":"R. Kaufman, W. G. Maurer","doi":"10.1145/800184.810508","DOIUrl":"https://doi.org/10.1145/800184.810508","url":null,"abstract":"An interactive computer program for the kinematic synthesis of motion or function generating linkages is described. The system has been implemented on an 8K IBM 1130 with a storage tube display and a custom-built “globe” graphical input device. The desired performance of the mechanism at four or five prescribed finitely separated positions is specified to the computer, as is the geometry of the fixed and moving bodies. Graphical input devices, or a keyboard, or cards can be used for this purpose. Interactive graphics capability allows input, modification, and display of a complex moving body and fixed frame. Burmester circlepoint-centerpoint curves or Burmester point pairs are displayed for the specified motion, together with a number of other options such as relative poles of rotation. A dynamic cursor which traverses the circlepoint-centerpoint curves allows selection of input and output links of either a four-bar linkage, a slider-crank mechanism, or a turning-block mechanism capable of satisfying the prescribed input criteria. A flashing display aids in selection of circlepoint-centerpoint pairs by indicating the type of linkage that would result from choice of the link being displayed at that instant Grashof's criteria are used to determine whether such a choice would result in a drag link, double rocker, or crank rocker mechanism. Similar criteria have been developed for the slider and turning block equivalents of these mechanisms. The selected linkage can then be animated on the display screen. Continous display of its transmission angle is optional. Examples are given of the practical use of the program.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"14 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":"134276108","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}
At the ACM Annual Conference in 1970 the Special Interest Group on Computer Uses in Education (SIGCUE) organized two sessions on computers in the instructional process. Recommendations for action by computer professionals were formulated and printed in the October issue of the SIGCUE Bulletin on Computer Uses in Education (v4, No. 5, pp. 26-33). Consistent with program planning for ACM 70 and 71, SIGCUE has organized a session for this year which in part should answer some of the questions raised last year. The Bulletin should again be a vehicle for supplementary statements and reporting of outcomes after the Conference.
{"title":"Computer science contributions to learning and teaching (Panel)","authors":"Karl L. Zinn","doi":"10.1145/800184.810524","DOIUrl":"https://doi.org/10.1145/800184.810524","url":null,"abstract":"At the ACM Annual Conference in 1970 the Special Interest Group on Computer Uses in Education (SIGCUE) organized two sessions on computers in the instructional process. Recommendations for action by computer professionals were formulated and printed in the October issue of the SIGCUE Bulletin on Computer Uses in Education (v4, No. 5, pp. 26-33). Consistent with program planning for ACM 70 and 71, SIGCUE has organized a session for this year which in part should answer some of the questions raised last year. The Bulletin should again be a vehicle for supplementary statements and reporting of outcomes after the Conference.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"259 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":"133122533","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
扫码关注我们
求助内容：
应助结果提醒方式：