首页 > 最新文献
paperpass

ACM '65最新文献

英文 中文
Programming Languages for Non-Numeric Processing—1: examples of symbol manipulation in the AMBIT Programming Language 用于非数字处理的编程语言- 1:AMBIT编程语言中的符号操作示例
Pub Date : 1965-08-24 DOI: 10.1145/800197.806049
C. Christensen
THE AMBIT PROGRAMMING language has been applied to problems in two areas. In the area of algebraic symbol manipulation, programs have been written in AMBIT for elementary arithmetic, elementary algebra, formal differentiation, set operations, and propositional calculus. In the area of list processing, a variety of programs have been written for syntactic analysis, including both “top-down” and “bottom-up” analysis. This paper is intended to exhibit the important features of AMBIT without entering into a complete and formal definition of AMBIT. The paper contains a brief informal definition of the language and several examples of programs written in the language. The informal definition discusses primarily those facilities of the language which are used in the example programs; other facilities currently available in AMBIT are not mentioned. The definition depends on the example programs for the illustration and clarification of difficult points, and the reader is advised to defer a detailed examination of the definition until he has read through the example programs.
AMBIT编程语言已经应用于两个领域的问题。在代数符号操作领域,已经用AMBIT编写了用于初等算术、初等代数、形式微分、集合运算和命题演算的程序。在列表处理领域,已经编写了各种用于语法分析的程序,包括“自顶向下”和“自底向上”分析。本文旨在展示AMBIT的重要特征,而不进入AMBIT的完整和正式定义。本文包含了该语言的一个简短的非正式定义和几个用该语言编写的程序示例。非正式定义主要讨论示例程序中使用的语言功能;AMBIT目前可用的其他设施未提及。定义依赖于示例程序来说明和澄清难点,建议读者推迟对定义的详细检查,直到他通读了示例程序。
{"title":"Programming Languages for Non-Numeric Processing—1: examples of symbol manipulation in the AMBIT Programming Language","authors":"C. Christensen","doi":"10.1145/800197.806049","DOIUrl":"https://doi.org/10.1145/800197.806049","url":null,"abstract":"THE AMBIT PROGRAMMING language has been applied to problems in two areas. In the area of algebraic symbol manipulation, programs have been written in AMBIT for elementary arithmetic, elementary algebra, formal differentiation, set operations, and propositional calculus. In the area of list processing, a variety of programs have been written for syntactic analysis, including both “top-down” and “bottom-up” analysis.\u0000 This paper is intended to exhibit the important features of AMBIT without entering into a complete and formal definition of AMBIT. The paper contains a brief informal definition of the language and several examples of programs written in the language. The informal definition discusses primarily those facilities of the language which are used in the example programs; other facilities currently available in AMBIT are not mentioned. The definition depends on the example programs for the illustration and clarification of difficult points, and the reader is advised to defer a detailed examination of the definition until he has read through the example programs.","PeriodicalId":213949,"journal":{"name":"ACM '65","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1965-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127994601","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}
引用次数: 10
Invited papers—1: basic concepts of automata theory 邀请论文1:自动机理论的基本概念
Pub Date : 1965-08-24 DOI: 10.1145/800197.806039
R. J. Nelson
I WAS INVITED to present a survey of the theory of automata. Since there are already several surveys, especially the very competent ones of Chomsky 10, McNaughton 37, and Rogers 54, all of which deal with various aspects of the theory of automata and more, I shall confine myself to an exposition of what might loosely be called a “philosophy of automata”. On the way, however, I hope to touch upon certain developments of the subject which have come about since McNaughton's 1961 paper. Readers who feel they are up on the theory may wish to omit sections 2 and 3.
我应邀作自动机理论综述报告。由于已经有一些调查,特别是乔姆斯基10、麦克诺顿37和罗杰斯54的非常有能力的调查,所有这些调查都涉及自动机理论的各个方面以及更多,我将把自己限制在一个可以被松散地称为“自动机哲学”的阐述上。不过,在此过程中,我希望能触及自McNaughton 1961年的论文以来这个主题的某些发展。那些觉得自己已经掌握了理论的读者可能希望省略第二和第三节。
{"title":"Invited papers—1: basic concepts of automata theory","authors":"R. J. Nelson","doi":"10.1145/800197.806039","DOIUrl":"https://doi.org/10.1145/800197.806039","url":null,"abstract":"I WAS INVITED to present a survey of the theory of automata. Since there are already several surveys, especially the very competent ones of Chomsky <supscrpt>10</supscrpt>, McNaughton <supscrpt>37</supscrpt>, and Rogers <supscrpt>54</supscrpt>, all of which deal with various aspects of the theory of automata and more, I shall confine myself to an exposition of what might loosely be called a “philosophy of automata”. On the way, however, I hope to touch upon certain developments of the subject which have come about since McNaughton's 1961 paper. Readers who feel they are up on the theory may wish to omit sections 2 and 3.","PeriodicalId":213949,"journal":{"name":"ACM '65","volume":"264 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1965-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123039028","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}
引用次数: 2
Computers in the study of learning: BOGART—A discovery and induction program for games 学习研究中的计算机:游戏的BOGART-A发现和归纳程序
Pub Date : 1965-08-24 DOI: 10.1145/800197.806041
C. Newman, L. Uhr
BOGART consists of a set of board game playing routines written in MAD (Michigan Algorithm Decoder) which is capable of learning to play board games. Examples of board games BOGART can learn to play, with widely varying degrees of proficiency, include Tic-Tac-Toe, hexapawn, GOMOKU, and checkers, and it can solve missionary and cannibal problems. The objective in constructing BOGART is to illustrate that it is possible to solve a large class of dissimilar problems by the use of learning techniques. Proficiency at solving any one problem was not an objective, nor was general proficiency that did not depend on the use of learning. Consistent with this philosophy of relying on learning techniques, no use is made of lookahead procedures, although they have been shown to be of great value in game-playing programs.
BOGART由一套用MAD(密歇根算法解码器)编写的棋盘游戏例程组成,能够学习玩棋盘游戏。鲍嘉可以学习的棋盘游戏的例子,熟练程度各不相同,包括井字棋、六爪棋、GOMOKU和跳棋,它可以解决传教士和食人族的问题。构建BOGART的目的是为了说明,通过使用学习技术来解决一大类不同的问题是可能的。精通解决任何一个问题都不是目标,不依赖于学习的全面精通也不是目标。与这种依赖于学习技术的理念相一致的是,没有使用前瞻性程序,尽管它们已被证明在游戏程序中具有很大的价值。
{"title":"Computers in the study of learning: BOGART—A discovery and induction program for games","authors":"C. Newman, L. Uhr","doi":"10.1145/800197.806041","DOIUrl":"https://doi.org/10.1145/800197.806041","url":null,"abstract":"BOGART consists of a set of board game playing routines written in MAD (Michigan Algorithm Decoder) which is capable of learning to play board games. Examples of board games BOGART can learn to play, with widely varying degrees of proficiency, include Tic-Tac-Toe, hexapawn, GOMOKU, and checkers, and it can solve missionary and cannibal problems. The objective in constructing BOGART is to illustrate that it is possible to solve a large class of dissimilar problems by the use of learning techniques. Proficiency at solving any one problem was not an objective, nor was general proficiency that did not depend on the use of learning. Consistent with this philosophy of relying on learning techniques, no use is made of lookahead procedures, although they have been shown to be of great value in game-playing programs.","PeriodicalId":213949,"journal":{"name":"ACM '65","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1965-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115968919","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}
引用次数: 8
Programming languages for non-numeric processing—2: A universal assembly mapping language 用于非数字处理的编程语言- 2:一种通用的汇编映射语言
Pub Date : 1965-08-24 DOI: 10.1145/800197.806063
M. L. Graham, P. Z. Ingerman
THE PRIMEVAL ASSEMBLY LANGUAGES generally provided a one-to-one mapping from the symbolic to the numeric version of a program, that is, from assembly language to machine language. The second major step in the development of assembly languages was the inclusion of a one-to-many capability, in the form of the macro, which allows the user to build several machine words in a systematic, parameterized manner with a one line call. HalpernH64 has implemented an assembly meta-language which expects virtually every line of a program to be either a macro call or a contribution to the definition of a macro. In Halpern's system, the parameterization is performed in terms of symbolic quantities. FergusonF64, on the other hand, has implemented an assembly meta-language in which the parameterization process operates in terms of the allocation-time values of the symbols used. The present paper specifies an assembly meta-language, based on the work of Ferguson, but in which the parameterization can at any point be either by symbol or by value. This system is currently being implemented at the Westinghouse Defense and Space Center.
原始汇编语言通常提供从符号到数字的一对一映射,即从汇编语言到机器语言。汇编语言发展的第二个主要步骤是以宏的形式包含一对多功能,它允许用户通过一行调用以系统的、参数化的方式构建几个机器单词。HalpernH64实现了一种汇编元语言,它期望程序的几乎每一行都是宏调用或对宏定义的贡献。在Halpern的系统中,参数化是根据符号量进行的。另一方面,FergusonF64实现了一种汇编元语言,其中参数化过程根据所使用符号的分配时间值进行操作。本文以Ferguson的工作为基础,指定了一种汇编元语言,但其中的参数化可以在任何点上通过符号或值进行。该系统目前正在西屋国防和航天中心实施。
{"title":"Programming languages for non-numeric processing—2: A universal assembly mapping language","authors":"M. L. Graham, P. Z. Ingerman","doi":"10.1145/800197.806063","DOIUrl":"https://doi.org/10.1145/800197.806063","url":null,"abstract":"THE PRIMEVAL ASSEMBLY LANGUAGES generally provided a one-to-one mapping from the symbolic to the numeric version of a program, that is, from assembly language to machine language. The second major step in the development of assembly languages was the inclusion of a one-to-many capability, in the form of the macro, which allows the user to build several machine words in a systematic, parameterized manner with a one line call. HalpernH64 has implemented an assembly meta-language which expects virtually every line of a program to be either a macro call or a contribution to the definition of a macro. In Halpern's system, the parameterization is performed in terms of symbolic quantities. FergusonF64, on the other hand, has implemented an assembly meta-language in which the parameterization process operates in terms of the allocation-time values of the symbols used. The present paper specifies an assembly meta-language, based on the work of Ferguson, but in which the parameterization can at any point be either by symbol or by value. This system is currently being implemented at the Westinghouse Defense and Space Center.","PeriodicalId":213949,"journal":{"name":"ACM '65","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1965-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126144862","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}
引用次数: 1
Programming languages for non-numeric processing—1: TMG—a syntax directed compiler 用于非数字处理的编程语言- 1:tmg -语法定向编译器
Pub Date : 1965-08-24 DOI: 10.1145/800197.806050
R. McClure
THIS PAPER reports on a compiler writing system called TMG, basically a syntax directed system. It has, however, some interesting differences which make it easier to handle errors and declarative information. The original objective of this system was to make it as easy as possible to construct a simple one-pass translator for some specialized language. In TMG, emphasis is placed on scanning and analysis of input text and efficient production of straightforward translation of the input. For this reason, there are substantially no facilities for handling program topology, efficient register assignment, common subexpression removal, or complicated storage assignment. It was felt that, if required, these should be handled by a specially written post-processor. To explain how one writes a translator in TMGL, we will describe in some detail a compiler which translates a simple algebraic language (SAL) into symbolic machine code for the IBM 7040.
本文报告了一个叫做TMG的编译器编写系统,它基本上是一个语法导向系统。但是,它有一些有趣的区别,使处理错误和声明性信息变得更容易。该系统的最初目标是尽可能容易地为某些特定语言构建一个简单的一次性翻译器。在TMG中,重点放在对输入文本的扫描和分析以及对输入文本的直接翻译的高效生产上。由于这个原因,基本上没有处理程序拓扑、有效的寄存器赋值、公共子表达式删除或复杂的存储赋值的工具。有人认为,如有需要,这些应由专门编写的后处理程序处理。为了解释如何在TMGL中编写翻译程序,我们将详细描述一个编译器,它将简单的代数语言(SAL)翻译成IBM 7040的符号机器码。
{"title":"Programming languages for non-numeric processing—1: TMG—a syntax directed compiler","authors":"R. McClure","doi":"10.1145/800197.806050","DOIUrl":"https://doi.org/10.1145/800197.806050","url":null,"abstract":"THIS PAPER reports on a compiler writing system called TMG, basically a syntax directed system. It has, however, some interesting differences which make it easier to handle errors and declarative information. The original objective of this system was to make it as easy as possible to construct a simple one-pass translator for some specialized language.\u0000 In TMG, emphasis is placed on scanning and analysis of input text and efficient production of straightforward translation of the input. For this reason, there are substantially no facilities for handling program topology, efficient register assignment, common subexpression removal, or complicated storage assignment. It was felt that, if required, these should be handled by a specially written post-processor.\u0000 To explain how one writes a translator in TMGL, we will describe in some detail a compiler which translates a simple algebraic language (SAL) into symbolic machine code for the IBM 7040.","PeriodicalId":213949,"journal":{"name":"ACM '65","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1965-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126532088","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}
引用次数: 1
Numerical applications: Cycle algorithms for undirected linear graphs and some immediate applications 数值应用:无向线性图的循环算法和一些直接应用
Pub Date : 1965-08-24 DOI: 10.1145/800197.806053
J. T. Welch
THE ANALYSIS OF GRAPHICALLY presented data, such as the structural diagram of a chemical compound, or a model of information flow in a system design, is becoming increasingly important as technology advances. In the interests of accuracy and lower costs, it is often desirable to mechanize the analysis completely. Here we shall present a mechanical procedure which finds all cycles (i.e., simple elementary cycles1) of a finite undirected linear graph, given an array called the incidence matrix of the graph. The procedure consists of three algorithms: algorithm 1, which determines a basic set of cycles from which all others can be generated; algorithm 2, which assigns an ordering to the basic cycles; and algorithm 3, which generates all remaining cycles. An immediate application of algorithm 1 will be illustrated, and the same will be done for algorithm 3. The examples used must necessarily be simplified. This should not obscure the objective, which is to suggest algorithms of sufficient generality for computer, or at least mechanical, application. A more complete treatment of the algorithms themselves, with necessary proofs, will follow in a later paper5.
随着技术的进步,对图形化数据的分析,如化合物的结构图,或系统设计中的信息流模型,正变得越来越重要。为了提高准确性和降低成本,通常需要将分析完全机械化。在这里,我们将给出一个机械的程序,在给定一个称为图的关联矩阵的数组下,求出有限无向线性图的所有循环(即简单初等循环1)。该过程由三个算法组成:算法1,它确定了一组基本的循环,所有其他的循环都可以从这些循环中生成;算法2,对基本循环进行排序;算法3,生成所有剩余的循环。将说明算法1的直接应用,并对算法3进行同样的应用。使用的例子必须简化。这不应该模糊我们的目标,我们的目标是为计算机或至少是机械应用提供足够的通用性算法。对算法本身的更完整的处理,以及必要的证明,将在后面的论文中进行。
{"title":"Numerical applications: Cycle algorithms for undirected linear graphs and some immediate applications","authors":"J. T. Welch","doi":"10.1145/800197.806053","DOIUrl":"https://doi.org/10.1145/800197.806053","url":null,"abstract":"THE ANALYSIS OF GRAPHICALLY presented data, such as the structural diagram of a chemical compound, or a model of information flow in a system design, is becoming increasingly important as technology advances. In the interests of accuracy and lower costs, it is often desirable to mechanize the analysis completely. Here we shall present a mechanical procedure which finds all cycles (i.e., simple elementary cycles1) of a finite undirected linear graph, given an array called the incidence matrix of the graph.\u0000 The procedure consists of three algorithms: algorithm 1, which determines a basic set of cycles from which all others can be generated; algorithm 2, which assigns an ordering to the basic cycles; and algorithm 3, which generates all remaining cycles. An immediate application of algorithm 1 will be illustrated, and the same will be done for algorithm 3. The examples used must necessarily be simplified. This should not obscure the objective, which is to suggest algorithms of sufficient generality for computer, or at least mechanical, application. A more complete treatment of the algorithms themselves, with necessary proofs, will follow in a later paper5.","PeriodicalId":213949,"journal":{"name":"ACM '65","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1965-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125052192","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}
引用次数: 7
Invited papers—1: classification in information storage and retrieval 特邀论文1:信息存储与检索中的分类
Pub Date : 1965-08-24 DOI: 10.1145/800197.806038
O. Taulbee
WHEN I WAS ASKED to give a tutorial paper on information storage and retrieval, my first thought was to give a state-of-the-art survey of the field. But then it was evident that much of the paper would be a “state-of-the 'state-of-the-art'” survey since there have been several recent review papers1, 2, 3. Classification is a much used, and sometimes abused, concept not only in information storage and retrieval but in many other endeavors. Since this is the case, it seems appropriate to attempt a definitive review paper covering the concept which pervades almost all aspects of the field of information storage and retrieval.
当我被要求写一篇关于信息存储和检索的指导论文时,我的第一个想法是对这个领域做一个最新的调查。但很明显,这篇论文的大部分内容将是一项“最先进的”调查,因为最近有几篇综述论文。分类不仅在信息存储和检索中,而且在许多其他工作中都是一个经常使用(有时被滥用)的概念。既然是这种情况,似乎应该尝试编写一份确定的审查文件,涵盖几乎遍及信息储存和检索领域所有方面的概念。
{"title":"Invited papers—1: classification in information storage and retrieval","authors":"O. Taulbee","doi":"10.1145/800197.806038","DOIUrl":"https://doi.org/10.1145/800197.806038","url":null,"abstract":"WHEN I WAS ASKED to give a tutorial paper on information storage and retrieval, my first thought was to give a state-of-the-art survey of the field. But then it was evident that much of the paper would be a “state-of-the 'state-of-the-art'” survey since there have been several recent review papers1, 2, 3. Classification is a much used, and sometimes abused, concept not only in information storage and retrieval but in many other endeavors. Since this is the case, it seems appropriate to attempt a definitive review paper covering the concept which pervades almost all aspects of the field of information storage and retrieval.","PeriodicalId":213949,"journal":{"name":"ACM '65","volume":"21 9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1965-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116374637","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}
引用次数: 4
Evaluation and performance of computers: interaction of hardware and software parameters in tape operations 计算机的评价和性能:磁带操作中硬件和软件参数的相互作用
Pub Date : 1965-08-24 DOI: 10.1145/800197.806033
W. Edwards
THE PRIMARY REASON for specifying increased capabilities in tape transports is, ostensibly, to improve the system performance in some manner, such as: (a) - storage capacity; (b) - access time/transfer rate; and (c) - error incidence and severity. The currently familiar NRZI tape transports are available in a wide variety of characteristics. Tape speeds vary from 3 to 150 ips, recording densities from 200 to 1100 bpi, and tape lengths up to 6200 feet. The performance obtained from a tape transport in an operational atmosphere depends to a large extent upon the interplay between the hardware parameters and the software characteristics. It is the purpose of this paper to explore these interactions and their influence upon the system performance.
指定增加磁带传输能力的主要原因,表面上看,是为了以某种方式提高系统性能,例如:(a) -存储容量;(b) -存取时间/传送速率;(c)差错发生率和严重程度。目前熟悉的NRZI磁带传输有各种各样的特性。磁带速度从3到150 ips不等,记录密度从200到1100 bpi,磁带长度可达6200英尺。在操作环境中,磁带传输的性能在很大程度上取决于硬件参数和软件特性之间的相互作用。本文的目的是探讨这些相互作用及其对系统性能的影响。
{"title":"Evaluation and performance of computers: interaction of hardware and software parameters in tape operations","authors":"W. Edwards","doi":"10.1145/800197.806033","DOIUrl":"https://doi.org/10.1145/800197.806033","url":null,"abstract":"THE PRIMARY REASON for specifying increased capabilities in tape transports is, ostensibly, to improve the system performance in some manner, such as: (a) - storage capacity; (b) - access time/transfer rate; and (c) - error incidence and severity.\u0000 The currently familiar NRZI tape transports are available in a wide variety of characteristics. Tape speeds vary from 3 to 150 ips, recording densities from 200 to 1100 bpi, and tape lengths up to 6200 feet. The performance obtained from a tape transport in an operational atmosphere depends to a large extent upon the interplay between the hardware parameters and the software characteristics. It is the purpose of this paper to explore these interactions and their influence upon the system performance.","PeriodicalId":213949,"journal":{"name":"ACM '65","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1965-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134008215","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}
引用次数: 0
Programming languages for non-numeric processing—2: Time sequenced logical simulation based on circuit delay and selective tracing of active network paths 非数字处理的程序设计语言- 2:基于电路延迟和主动网络路径选择性跟踪的时序逻辑仿真
Pub Date : 1965-08-24 DOI: 10.1145/800197.806065
E. Ulrich
MANY PUBLISHED efforts in the field of logical simulation indicate that the programming concept of “compiling and executing” is the most frequently used foundation for the construction of simulation programs. The technique to be described here represents a complete departure from the concept of “compiling and executing”. The basic framework for the simulation method to be presented is simply a close imitation of the structure and operation of a logical network. Applying this concept leads to a realistically operating “general purpose” simulator. The resulting simulation possibilities are—at least with respect to the field of logical simulation—relatively unexplored and unexploited. Simulation in other fields, e.g., the simulation of nerve nets by Reiss1, has preceded the field of logical simulation in taking advantage of the structure and operation of (neural) networks. The first success in applying these methods to the field of logical simulation has been reported by Case, et al2.
在逻辑仿真领域发表的许多成果表明,“编译和执行”的编程概念是构建仿真程序最常用的基础。这里描述的技术完全背离了“编译和执行”的概念。所提出的仿真方法的基本框架是简单地对逻辑网络的结构和操作进行严密的模仿。应用这一概念将导致一个实际操作的“通用”模拟器。由此产生的模拟可能性——至少就逻辑模拟领域而言——相对来说尚未被探索和开发。其他领域的仿真,例如Reiss1对神经网络的仿真,在利用(神经)网络的结构和操作方面,早于逻辑仿真领域。Case等人报道了将这些方法首次成功应用于逻辑仿真领域。
{"title":"Programming languages for non-numeric processing—2: Time sequenced logical simulation based on circuit delay and selective tracing of active network paths","authors":"E. Ulrich","doi":"10.1145/800197.806065","DOIUrl":"https://doi.org/10.1145/800197.806065","url":null,"abstract":"MANY PUBLISHED efforts in the field of logical simulation indicate that the programming concept of “compiling and executing” is the most frequently used foundation for the construction of simulation programs.\u0000 The technique to be described here represents a complete departure from the concept of “compiling and executing”. The basic framework for the simulation method to be presented is simply a <underline>close imitation of the structure and operation of a logical network</underline>. Applying this concept leads to a realistically operating “general purpose” simulator. The resulting simulation possibilities are—at least with respect to the field of logical simulation—relatively unexplored and unexploited. Simulation in other fields, e.g., the simulation of nerve nets by Reiss<supscrpt>1</supscrpt>, has preceded the field of logical simulation in taking advantage of the structure and operation of (neural) networks. The first success in applying these methods to the field of logical simulation has been reported by Case, et al<supscrpt>2</supscrpt>.","PeriodicalId":213949,"journal":{"name":"ACM '65","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1965-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131745745","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}
引用次数: 27
Evaluation and performance of computers: application benchmarks: the key to meaningful computer evaluations 计算机的评估和性能:应用基准:有意义的计算机评估的关键
Pub Date : 1965-08-24 DOI: 10.1145/800197.806031
E. O. Joslin
THE MOST IMPORTANT QUESTION in any evaluation of a computer should be, “How long will it take this system to process my workload?” If the system cannot do the workload, there is no point in asking how much it costs or any other facts about the system. With this thought in mind, it then becomes apparent why the technique used to determine the answer to this “how long” question becomes the most important item in any computer evaluation. Time does not permit a detailed discussion of both: why application benchmarks are the best of the timing techniques available, and of the method for setting up application benchmarks which will be truly representative of the applications to be run. Therefore, the second topic (Setting Up Application Benchmarks) has been chosen, because I believe most who have tried other timing techniques know there must be something better. I also feel that those who have used application benchmarks have limited their thinking to sequential processing systems and should now consider the preparation of application benchmarks for systems capable of multi-processing and/or multi-programming.
在评估一台计算机时,最重要的问题应该是:“这个系统需要多长时间来处理我的工作量?”如果系统不能完成工作负载,那么询问它的成本或关于系统的任何其他事实是没有意义的。有了这个想法,那么为什么用于确定“多长时间”问题的答案的技术成为任何计算机评估中最重要的项目就变得很明显了。时间不允许详细讨论这两个问题:为什么应用程序基准测试是可用的最佳计时技术,以及设置应用程序基准测试的方法,它将真正代表要运行的应用程序。因此,选择了第二个主题(设置应用程序基准测试),因为我相信大多数尝试过其他计时技术的人都知道肯定有更好的方法。我还觉得,那些使用应用程序基准测试的人将他们的思维局限于顺序处理系统,现在应该考虑为能够进行多处理和/或多编程的系统准备应用程序基准测试。
{"title":"Evaluation and performance of computers: application benchmarks: the key to meaningful computer evaluations","authors":"E. O. Joslin","doi":"10.1145/800197.806031","DOIUrl":"https://doi.org/10.1145/800197.806031","url":null,"abstract":"THE MOST IMPORTANT QUESTION in any evaluation of a computer should be, “How long will it take this system to process my workload?” If the system cannot do the workload, there is no point in asking how much it costs or any other facts about the system. With this thought in mind, it then becomes apparent why the technique used to determine the answer to this “how long” question becomes the most important item in any computer evaluation.\u0000 Time does not permit a detailed discussion of both: why application benchmarks are the best of the timing techniques available, and of the method for setting up application benchmarks which will be truly representative of the applications to be run. Therefore, the second topic (Setting Up Application Benchmarks) has been chosen, because I believe most who have tried other timing techniques know there must be something better. I also feel that those who have used application benchmarks have limited their thinking to sequential processing systems and should now consider the preparation of application benchmarks for systems capable of multi-processing and/or multi-programming.","PeriodicalId":213949,"journal":{"name":"ACM '65","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1965-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115368896","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}
引用次数: 22
期刊
ACM '65
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
﹀
mjeditor
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1