ACM '65Pub Date : 1965-08-24DOI: 10.1145/800197.806062
M. Moortgat
{"title":"Analysis of computational systems: An algorithm for Boolean simplification based on three necessary conditions","authors":"M. Moortgat","doi":"10.1145/800197.806062","DOIUrl":"https://doi.org/10.1145/800197.806062","url":null,"abstract":"IN THIS PAPER three necessary conditions, based on index numbers, for a Boolean function to be minimal are stated and proved. These conditions are then used in an algorithm for finding the minimal form of a Boolean function. The algorithm is fast and simple to use.","PeriodicalId":213949,"journal":{"name":"ACM '65","volume":"204 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":"124548719","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ACM '65Pub Date : 1965-08-24DOI: 10.1145/800197.806069
James R. Zieglar
{"title":"Management information systems: A modular approach to business EDP problem solving","authors":"James R. Zieglar","doi":"10.1145/800197.806069","DOIUrl":"https://doi.org/10.1145/800197.806069","url":null,"abstract":"MODULARITY—a requirement in computer hardware for several years—has now become a property of software.\u0000 Early electronic computers were designed for very specific applications. They provided little or no opportunity for use on other operations without radical modifications in structure. As needs grew larger and application possibilities became more numerous, the concept of modularity evolved. Economic necessity, as well as common sense, dictated against building a completely new machine to do a partially new job. Many already well-designed parts of the computer could be lifted intact for inclusion in the new operation. Ultimately, this logic led to the general purpose digital computer.","PeriodicalId":213949,"journal":{"name":"ACM '65","volume":"75 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":"124733212","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ACM '65Pub Date : 1965-08-24DOI: 10.1145/800197.806032
P. Rota, J. H. DePuyt
{"title":"Evaluation and performance of computers: TRAFFICSIM—a design/evaluation tool","authors":"P. Rota, J. H. DePuyt","doi":"10.1145/800197.806032","DOIUrl":"https://doi.org/10.1145/800197.806032","url":null,"abstract":"TRAFFICSIM is a digital computer simulation of the cause, effect, and result of processing system message traffic.\u0000 The cause is simulated by the Message Generation Simulation (MGS) program which provides the capability of simulating system user operations, under various operational conditions, to estimate the message generation loads that are inputted to the system at all input/output (I/O) elements. This represents the basic source of messages, and is accomplished by formulating mathematical models of system user operations. These models are developed on the basis of the number and type of messages that result from the particular operation being simulated. Hence, it relates the messages to their cause (events) and simulates the dual relationships of events and their corresponding message entry to the system.","PeriodicalId":213949,"journal":{"name":"ACM '65","volume":"3 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":"125011279","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ACM '65Pub Date : 1965-08-24DOI: 10.1145/800197.806035
E. C. Milliken
{"title":"Complex information processing: a language for class description and its processor","authors":"E. C. Milliken","doi":"10.1145/800197.806035","DOIUrl":"https://doi.org/10.1145/800197.806035","url":null,"abstract":"IN THE PAST SEVERAL YEARS, several papers1,2 have been written that have developed a description language that can be used to describe classes of objects. A class is a grouping of a number of objects such as all integral numbers, all five card poker hands, or all sentences generated by the rules of a given context free grammar. This description language is useful because all objects in a given class can be described using only one class description; also, many different classes can be described using this one description language. We shall use the word concept to mean the class description. Note that a concept describes a class of objects.\u0000 This paper takes the description language and presents a computer program for reading in an object and a number of concepts; the program then finds whether or not this object belongs to one of the given classes described by a concept. The program was implemented by breaking the language into a series of rules (1), and then writing procedures (i.e. - individual computer sub-programs that are called from the main program) that break down a given string of symbols (the object and the concepts) according to these rules. The answers are of the following form: “yes, object included in (insert class name) class”; “no, object not included in given classes.”\u0000 The objective of this paper is to: (1) - give a review of the Banerji formalism; (2) - formalize an example that will show how the language is used; and (3) - describe the computer program.","PeriodicalId":213949,"journal":{"name":"ACM '65","volume":"6 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":"125797836","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ACM '65Pub Date : 1964-06-05DOI: 10.1145/800197.806040
Dave L. Londe, R. F. Simmons
{"title":"Computers in the study of learning: namer—A pattern-recognition system for generating sentences about relations between line drawings","authors":"Dave L. Londe, R. F. Simmons","doi":"10.1145/800197.806040","DOIUrl":"https://doi.org/10.1145/800197.806040","url":null,"abstract":"THIS PAPER reports on a series of experimental programs which are used to recognize line drawings and the spatial relationships between them. At the pattern-recognition level the programs learn to associate a name with a generalized bit pattern representing a line drawing. At the relation-learning level, the programs abstract characteristics which relate to such spatial concepts as “above,” “left,” “thicker than,” etc. The names that have been learned in association with a drawing, and relation names which the program selects as true for the spatial relations between two drawings, are substituted into a simple generation grammar; variations of sentences that are true for the picture are then generated.","PeriodicalId":213949,"journal":{"name":"ACM '65","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1964-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121512099","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}