ACM '59最新文献

{"title":"Digital simulation of discrete flow systems","authors":"C. J. Moore, T. S. Lewis","doi":"10.1145/612201.612271","DOIUrl":"https://doi.org/10.1145/612201.612271","url":null,"abstract":"The use of digital computers as simulation devices for analysis and synthesis of discrete flow systems is an increasingly important area of computer applications technology. Discrete flow systems are characterized by channeled movement of items according to basic patterns or constraints which are modified by events and elapsed time. In general, mathematical models are not developed for such systems in order that computer simulation be effected; it is more efficient to formulate the simulation flow chart directly from knowledge of the physical system. In this sense, and also in the programming techniques employed, simulation of discrete flow systems is accomplished by a different methodology than is commonly used in the simulation of engineering and scientific problems of the continuous flow type.Two discrete flow problems were programmed for a medium-speed digital computer (IBM 650). One of the models was based on a straightforward time-sequenced, grid-representation of the physical system, and the other, while also time sequenced, used an event-oriented representation of the system.","PeriodicalId":109454,"journal":{"name":"ACM '59","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1959-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126259343","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A boundary value problem with eigenvalue on the boundary","authors":"B. Troesch, L. Ehrlich, J. Riley","doi":"10.1145/612201.612266","DOIUrl":"https://doi.org/10.1145/612201.612266","url":null,"abstract":"Several finite difference procedures will be considered for solving this problem, the first is an iterative approach to the fundamental eigenvalue. The second method transforms the entire finite difference problem into an ordinary eigenvalue problem in matrix theory. The third is a Rayleigh-Ritz procedure of which the second is a special case. The first procedure is obtained b~ replacing the boundary condition involving the eigenvalueby a \"guessed\" set of values for ~ on that part of the boundary. The resulting mixed boundary value problem is then solved by a standard iterative procedure. The normal derivative at the free surface is then computed and the boundary condition there is used to compute the \"eigenvalue\" as a function of position of the free surface. One of several","PeriodicalId":109454,"journal":{"name":"ACM '59","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1959-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130102019","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"On the logical design of formal mixed languages","authors":"S. Gorn","doi":"10.1145/612201.612232","DOIUrl":"https://doi.org/10.1145/612201.612232","url":null,"abstract":"The point of view expressed in this paper makes more tangible two principles accepted intuitively by many programmers and logical designers. They are a) the equivalence of formal languages and machines, b) the equivalence of programming and hardware.","PeriodicalId":109454,"journal":{"name":"ACM '59","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1959-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121267600","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A reliability field surveillance program","authors":"J. Kane","doi":"10.1145/612201.612209","DOIUrl":"https://doi.org/10.1145/612201.612209","url":null,"abstract":"This paper discusses the pertinent factors involved in the development of a comprehensive reliability field surveillance program for complex electronic or electro-mechanical systems through use of a large scale digital computer such as the IBM 704.","PeriodicalId":109454,"journal":{"name":"ACM '59","volume":"s3-5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1959-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127127169","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"ALTAC, the TRANSAC algebraic translator","authors":"S. Rosen, I. B. Goldberg","doi":"10.1145/612201.612275","DOIUrl":"https://doi.org/10.1145/612201.612275","url":null,"abstract":"ALTAC is the translation phase of an algebraic language compiler on the TRANSAC S-2000 computer. The language used is an extension of the FORTRAN language in use on the ?0~ and other computers. Existing programs in FORTRAN language can be compiled into TRANSAC code regardless of the computer for which they were originally written. The principal extensions of the language include the use of four dimensional arrays and the removal of restrictions on the nature of subscripts. Any fixed point expression may be a subscript and subscripts may themselves have subscripts. ALTAC permits the use of compound expressions and permits quite general compound conditional statements in addition to the IF statement in FORTRAN. An example of a compound IF statement is If so~ replace I by I+] and J by J+] and go on to the next statement in the program (NEXT STATEMENT). If-and only if-the first two conditions were not satisfied~ test whether X > Z.","PeriodicalId":109454,"journal":{"name":"ACM '59","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1959-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132738348","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"NO VALU: a program to compute missing values in a designed variance analysis","authors":"C. C. Devalon","doi":"10.1145/612201.612295","DOIUrl":"https://doi.org/10.1145/612201.612295","url":null,"abstract":"A program to compute ~issing va]cues in a designed vari~%ce analysis was developed to increase the value of NO ,(AN by providing an easy ~zay of filling in missing data° No matter how well an experiment is designed or how carefully the tests are carried out~ information may be lost Tfarough malfunction of a rocket motors malfunction of measuring and recording instruments~ etc~ In order to get as much out of the existing information as possible, a method was devised to esthmate the missing values° This made it possible to do the analysis as plarmed; with a loss of one degree of freedom for each missing value° The values computed are those ~hich will make the error term a minimum° If more than one value is missing from an analysis~ the general mean is substituted in the place of all but one of the missing values~ and that one is computed as though it were the only one° The process is re~ peated, in turn~ for each of the other missing values~ each time using all previously calculated approximations until a first approximation is obtained for all. The cycle is repeated until successive approximations are in sufficiently close agreement. The program was set up to be used in conjunction with NO VAN. The input is the same as that for NO VAN, and may be on cards or BCD tape, controlled by the same sense switch. Output can be used directly as input to NO VAaNo If input was on cards, new cards will be punched~ if it was on tape, a new BCD tape will be made° The program has the same limitations of size as NO VAN. Designs may have up to fifteen factors, nine levels of each factor, any amount of multiple and fractional replication° One additional limitation is that the analysis must have no more than one hund~-edmissing values° NO VALU has been in use for several months and has been very helpful in making the most use of what information has been collected. Because of its complete compatibility with NO VAN, it requires no additional time or trouble to prepare the input. The two programs together have been an extremely helpful tool in statistical analyses.","PeriodicalId":109454,"journal":{"name":"ACM '59","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1959-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128368790","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"The bending of rectangular plates with opposite edges simply supported","authors":"H. Kirschbaum, J. Belzer, J. Wetherbee","doi":"10.1145/612201.612281","DOIUrl":"https://doi.org/10.1145/612201.612281","url":null,"abstract":"There are many engineering design problems in which plates under load are encountered~ Among these are reinforced and prestressed concrete slabs under lateral loadings and steel plates used for ship hulls which are exposed to water-pressure loadings. Recently a plate simply supported on two edges was analyzed at Battelle. After a literature survey, it became apparent that the derivation of the deflection equation to meet these conditions would have to be made from the basic equations. These derivations are presented in this paper because it ~s felt that they may be useful to others. One possible application of this paper might be in refining the computational method now used in analyzing such structures as a one-span prestressed concrete-slab bridge simply supported. In discussing the bending of plates, we are limited to problems in which one dimension, the thickness, of the plate can be considered small relative to the other dimensions. The differential equation representing the deflection surface of a plate due to a load acting normal to its surface is: 3 x 2 y4 (1) where w m Deflection of plate in z coordinate. q = Intensity of a continuously distributed load. D = Flexural rigidity of a plate.","PeriodicalId":109454,"journal":{"name":"ACM '59","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1959-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124063901","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A generalized analysis of variance program utilizing binary logic","authors":"P. Real","doi":"10.1145/612201.612294","DOIUrl":"https://doi.org/10.1145/612201.612294","url":null,"abstract":"Analysis of variance is a statistical technique for determining the significant sources of variation of experimental test results where each test result is dependent on a number of different test conditions. The computations required in performing such an analysis are simple and straightforward but extremely tedious when performed manually. For larger experiments manual computation is prohibitive. While the analysis for any single experiment may be easily programmed, the resulting program will be of little use for other experiments involving even slight variations.A completely generalized program is the subject of this paper. The first paragraphs review the conventional notations and formulas. These formulas are then generalized to obtain the unique computational method used for their evaluation.","PeriodicalId":109454,"journal":{"name":"ACM '59","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1959-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117213999","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Formal integration on a digital computer","authors":"J. Slagle","doi":"10.1145/612201.612245","DOIUrl":"https://doi.org/10.1145/612201.612245","url":null,"abstract":"A 704 LISP program, written by the author, is described which~ by means of heuristics, performs, for a reasonably large class of problems~ formal integration of explicit elementary functions of a real variable. This problem was selected not only because it is useful in itself and can be extended directly (for example to differential equations, etc.) but also because it is a well defined problem area which would almost certainly furnish some valuable clues about problem solving in general. The solving of problems manifests intelligence, which may be subdivided into natural (human) and artificial (machine). Knowledge about one often has strong implications about the other. With respect to human intelligence, the integration machine furnishes some clues to improve the teaching of formal integration, math in general, and even to teaching in general. With respect to artificial intelligence, some light is shed on the use of heuristics, languages suitable for machine-human communication, pattern recognition and problem solving. The system will now be described. Some familiarity with LISP is assumed. First are described a few of the more important non-mathematical subroutines. Next are described the representation of numbers and elementary functions (more precisely elementary forms) in the LISP system. Subroutines are written which compose, simplify, and differentiate elementary functions. With these preliminary mathematical tools at our disposal the integration routine is now described. The two inputs and in the location F of an elementary integrand, and the name V of the variable of integration. When successful the output is the location of an elementary form representing the integral; when unsuccessful, either because the integrand does not integrate to an elementary form, or because the program or machine is inadequate, the output is a signal of failure to perform the desired integration.","PeriodicalId":109454,"journal":{"name":"ACM '59","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1959-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115203392","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Outline for a multi-list organized system","authors":"H. Gray, N. Prywes","doi":"10.1145/612201.612251","DOIUrl":"https://doi.org/10.1145/612201.612251","url":null,"abstract":"1. T ic~~o The system is designed around the personnel information retrieval problem. Briefly this problem involves a personnel file consisting of lO 6 names° Each person in the file is described in respect to 15 fields. A field being such as rank, age, etc. A field is broken into lO descriptors° Descriptors in the rank field for example are pvt, cpl, s gt, etc. The retrieval problem involves retrieving names of all persons answering combinations of descriptors in the 15 fields. This problem is used as an example while care is being taken not to detract from the ability of the system to be applied to other information retrieval problems. This block diagram is proposed because of the following considerations. It is required that memory of the system be expandable to the limit of addressing capability. Also the system should be expandable to utilize experimental types of memories and input-output devices. The three bus lines shown, for random access memories, for sequential access memories and for input-output devices, together with the synchrom/zer should allow the desired expandability. Connecting of additional units to the busses is possible within addressing capabilities. The synchronizer is essentially a speed matching unit having sufficient storage capacity to perform its function. It also incorporates the assigning of priorities for the various units of the system. The console provides display for the content of all addressable registers as well as input to these registers. It should also be capable of displaying the error signals and be the main instrument in performing maintenance of the system. The control part of the computer consists of a sufficient number of high speed working registers and a function table to control the flow of data through the operational unit. The latter consists mostly of combinational logic performing functions such as comparing, adding, subtracting and shifting. 3. Core Memory._ Initially two MOBIDIC core memory modules to be used, each having 4096 38 bit words storage with 8~s Read-Write cycle. The choice of this memory is also justified because of cost and delivery considerations. (It should be possible to connect additional memories so as either to increase the number of addressable items or so as to increase the number of catenas per item-this feature is explained later).","PeriodicalId":109454,"journal":{"name":"ACM '59","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1959-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121710398","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}