.I 1 .T Preliminary Report-International Algebraic Language .B CACM December, 1958 .A Perlis, A. J. Samelson,K. .N CA581203 JB March 22, 1978 8:28 PM .X 100 5 1 123 5 1 164 5 1 1 5 1 1 5 1 1 5 1 205 5 1 210 5 1 214 5 1 1982 5 1 398 5 1 642 5 1 669 5 1 1 6 1 1 6 1 1 6 1 1 6 1 1 6 1 1 6 1 1 6 1 1 6 1 1 6 1 1 6 1 165 6 1 196 6 1 196 6 1 1273 6 1 1883 6 1 324 6 1 43 6 1 53 6 1 91 6 1 410 6 1 3184 6 1 .I 2 .T Extraction of Roots by Repeated Subtractions for Digital Computers .B CACM December, 1958 .A Sugai, I. .N CA581202 JB March 22, 1978 8:29 PM .X 2 5 2 2 5 2 2 5 2 .I 3 .T Techniques Department on Matrix Program Schemes .B CACM December, 1958 .A Friedman, M. D. .N CA581201 JB March 22, 1978 8:30 PM .X 3 5 3 3 5 3 3 5 3 .I 4 .T Glossary of Computer Engineering and Programming Terminology .B CACM November, 1958 .N CA581103 JB March 22, 1978 8:32 PM .X 4 5 4 4 5 4 4 5 4 .I 5 .T Two Square-Root Approximations .B CACM November, 1958 .A Wadey, W. G. .N CA581102 JB March 22, 1978 8:33 PM .X 5 5 5 5 5 5 5 5 5 .I 6 .T The Use of Computers in Inspection Procedures .B CACM November, 1958 .A Muller, M. E. .N CA581101 JB March 22, 1978 8:33 PM .X 6 5 6 6 5 6 6 5 6 477 5 6 6 6 6 .I 7 .T Glossary of Computer Engineering and Programming Terminology .B CACM October, 1958 .N CA581003 JB March 22, 1978 8:35 PM .X 7 5 7 7 5 7 7 5 7 .I 8 .T On The Equivalence and Transformation of Program Schemes .B CACM October, 1958 .A Friedman, M. D. .N CA581002 JB March 22, 1978 8:36 PM .X 8 5 8 8 5 8 8 5 8 .I 9 .T Proposal for an UNCOL .B CACM October, 1958 .A Conway, M. E. .N CA581001 JB March 22, 1978 8:37 PM .X 9 5 9 9 5 9 9 5 9 .I 10 .T Glossary of Computer Engineering and Programming Terminology .B CACM September, 1958 .N CA580903 JB March 22, 1978 8:39 PM .X 10 5 10 10 5 10 10 5 10 .I 11 .T The Problem of Programming Communication with Changing Machines A Proposed Solution-Part 2 .B CACM September, 1958 .A Strong, J. Wegstein, J. Tritter, A. Olsztyn, J. Mock, O. Steel, T. .N CA580902 JB March 22, 1978 8:41 PM .X 1781 5 11 1988 5 11 11 5 11 11 5 11 11 5 11 123 6 11 196 6 11 919 6 11 990 6 11 1007 6 11 1046 6 11 1131 6 11 1139 6 11 1140 6 11 1149 6 11 1198 6 11 1215 6 11 1223 6 11 1265 6 11 1303 6 11 1323 6 11 1358 6 11 1366 6 11 1421 6 11 1460 6 11 1462 6 11 1463 6 11 1467 6 11 1468 6 11 1477 6 11 1491 6 11 1496 6 11 1496 6 11 1531 6 11 1535 6 11 1565 6 11 1601 6 11 1602 6 11 1613 6 11 1614 6 11 1626 6 11 1641 6 11 1787 6 11 1788 6 11 205 6 11 224 6 11 249 6 11 288 6 11 316 6 11 381 6 11 381 6 11 398 6 11 11 6 11 11 6 11 14 6 11 404 6 11 410 6 11 463 6 11 464 6 11 483 6 11 3184 6 11 3188 6 11 584 6 11 600 6 11 680 6 11 691 6 11 763 6 11 799 6 11 .I 12 .T Error Estimation in Runge-Kutta Procedures .B CACM September, 1958 .A Call, D. H. Reeves, R. F. .N CA580901 JB March 22, 1978 8:56 PM .X 12 5 12 12 5 12 12 5 12 .I 13 .T Glossary of Computer Engineering and Programming Terminology .B CACM August, 1958 .N CA580805 JB March 22, 1978 8:57 PM .X 13 5 13 13 5 13 13 5 13 .I 14 .T The Problem of Programming Communication with Changing Machines A Proposed Solution (Part 1) .B CACM August, 1958 .A Strong, J. Wegstein, J. Tritter, A. Olsztyn, J. Mock, O. Steel, T. .N CA580804 JB March 22, 1978 9:02 PM .X 1159 5 14 1988 5 14 381 5 14 14 5 14 14 5 14 14 5 14 1496 6 14 381 6 14 11 6 14 14 6 14 14 6 14 14 6 14 .I 15 .T Recursive Curve Fitting Technique .B CACM August, 1958 .A Giblin, J. .N CA580803 JB March 22, 1978 9:02 PM .X 15 5 15 15 5 15 15 5 15 75 5 15 15 6 15 94 6 15 .I 16 .T Secant Modification of Newton's Method .B CACM August, 1958 .A Jeeves, T. A. .N CA580802 JB March 22, 1978 9:03 PM .X 16 5 16 16 5 16 16 5 16 39 5 16 16 6 16 .I 17 .T On Programming of Arithmetic Operations .B CACM August, 1958 .A Ershov, A. P. .N CA580801 JB March 22, 1978 9:04 PM .X 1134 5 17 17 5 17 17 5 17 17 5 17 83 5 17 17 6 17 17 6 17 77 6 17 408 6 17 .I 18 .T Simple Automatic Coding Systems .B CACM July, 1958 .A Adams, E. S. Schlesinger, S. I. .N CA580701 JB March 22, 1978 9:06 PM .X 18 5 18 18 5 18 18 5 18 .I 19 .T Glossary of Computer Engineering and Programming Terminology .B CACM June, 1958 .N CA580603 JB March 22, 1978 9:07 PM .X 19 5 19 19 5 19 19 5 19 .I 20 .T Accelerating Convergence of Iterative Processes .W A technique is discussed which, when applied to an iterative procedure for the solution of an equation, accelerates the rate of convergence if the iteration converges and induces convergence if the iteration diverges. An illustrative example is given. .B CACM June, 1958 .A Wegstein, J. H. .N CA580602 JB March 22, 1978 9:09 PM .X 20 5 20 20 5 20 20 5 20 .I 21 .T Algebraic Formulation of Flow Diagrams .B CACM June, 1958 .A Voorhees, E. A. .N CA580601 JB March 22, 1978 9:10 PM .X 21 5 21 21 5 21 21 5 21 679 5 21 21 6 21 407 6 21 3184 6 21 .I 22 .T Unusual Applications Department--Automatic Implementation of Computer Logic .B CACM May, 1958 .A Morris, E. F. Wohr, T. E. .N CA580506 JB March 22, 1978 9:11 PM .X 22 5 22 22 5 22 22 5 22 .I 23 .T Binary and Truth-Function Operations on a Decimal Computer with an Extract Command .B CACM May, 1958 .A Kautz, W. H. .N CA580505 JB March 22, 1978 9:12 PM .X 23 5 23 23 5 23 23 5 23 .I 24 .T An Improved Decimal Redundancy Check .B CACM May, 1958 .A Sisson, R. L. .N CA580504 JB March 22, 1978 9:13 PM .X 24 5 24 24 5 24 24 5 24 .I 25 .T General Purpose Programming Systems .B CACM May, 1958 .A Holt, A. W. .N CA580503 JB March 22, 1978 9:14 PM .X 25 5 25 25 5 25 25 5 25 .I 26 .T A Subroutine Method for Calculating Logarithms .B CACM May, 1958 .A Bemer, R. W. .N CA580502 JB March 22, 1978 9:16 PM .X 26 5 26 26 5 26 26 5 26 848 5 26 26 6 26 35 6 26 .I 27 .T Note On Empirical Bounds For Generating Bessel Functions .B CACM May, 1958 .A Randels, J. B. Reeves, R. F. .N CA580501 JB March 22, 1978 9:17 PM .X 27 5 27 27 5 27 27 5 27 .I 28 .T Request for Methods or Programs .B CACM April, 1958 .A Corley, H. P. T. .N CA580402 JB March 22, 1978 9:18 PM .X 28 5 28 28 5 28 28 5 28 .I 29 .T Need for an Algorithm .B CACM April, 1958 .A Selden, W. .N CA580401 JB March 22, 1978 9:19 PM .X 29 5 29 29 5 29 29 5 29 .I 30 .T Algorithm for Analyzing Logical Statements to Produce a Truth Function Table .B CACM March, 1958 .A Wolpe, H. .N CA580302 JB March 22, 1978 9:20 PM .X 30 5 30 30 5 30 30 5 30 .I 31 .T IBM 704 Code-Nundrums .B CACM March, 1958 .A Grumette, M. .N CA580301 JB March 22, 1978 9:21 PM .X 31 5 31 31 5 31 31 5 31 .I 32 .T Variable-Width Tables with Binary-Search Facility .B CACM February, 1958 .A Halpern, M. .N CA580201 JB March 22, 1978 9:22 PM .X 32 5 32 32 5 32 32 5 32 .I 33 .T A Programmed Binary Counter For The IBM Type 650 Calculator .B CACM January, 1958 .A Kenny, B. C. Hunter, J. A. .N CA580103 JB March 22, 1978 9:25 PM .X 33 5 33 33 5 33 33 5 33 .I 34 .T Tables for Automatic Computation .B CACM January, 1958 .A Wilf, H. S. .N CA580102 JB March 22, 1978 9:26 PM .X 34 5 34 34 5 34 34 5 34 .I 35 .T A Machine Method for Square-Root Computation .B CACM January, 1958 .A Bemer, R. W. .N CA580101 JB March 22, 1978 9:27 PM .X 35 5 35 35 5 35 35 5 35 848 5 35 26 6 35 35 6 35 .I 36 .T A Queue Network Simulator for the IBM 650 and Burroughs 220 .B CACM December, 1959 .A Conway, R. W. Johnson, B. M. Maxwell, W. L. .N CA591206 JB March 22, 1978 3:35 PM .X 36 5 36 36 5 36 36 5 36 .I 37 .T Impact of Computer Developments .B CACM December, 1959 .A Humphrey, S. M. .N CA591205 JB March 22, 1978 3:36 PM .X 37 5 37 37 5 37 37 5 37 .I 38 .T A Proposed Interpretation in ALGOL .B CACM December, 1959 .A Irons, E. T. Acton, F. S. .N CA591204 JB March 22, 1978 3:37 PM .X 38 5 38 38 5 38 38 5 38 .I 39 .T The Secant Method for Simultaneous Nonlinear Equations .W A procedure for the simultaneous solution of a system of not-necessarily-linear equations, a generalization of the secant method for a single function of one variable, is given. .B CACM December, 1959 .A Wolfe, P. .N CA591203 JB March 22, 1978 3:39 PM .X 39 4 39 16 5 39 39 5 39 39 5 39 39 5 39 .I 40 .T Fingers or Fists? (The Choice of Decimal or Binary Representation) .W The binary number system offers many advantages over a decimal representation for a high-performance, general-purpose computer. The greater simplicity of a binary arithmetic unit and the greater compactness of binary numbers both contribute directly to arithmetic speed. Less obvious and perhaps more important is the way binary addressing and instruction formats can increase the overall performance. Binary addresses are also essential to certain powerful operations which are not practical with decimal instruction formats. On the other hand, decimal numbers are essential for communicating between man and the computer. In applications requiring the processing of a large volume of inherently decimal input and output data, the time for decimal-binary conversion needed by a purely binary computer may be significant. A slower decimal adder may take less time than a fast binary adder doing an addition and two conversions. A careful review of the significance of decimal and binary addressing and both binary and decimal data arithmetic, supplemented by efficient conversion instructions. .B CACM December, 1959 .A Buchholz, W. .N CA591202 JB March 22, 1978 3:47 PM .X 40 5 40 40 5 40 40 5 40 .I 41 .T Some Notes on Computer Research in Eastern Europe .B CACM December, 1959 .A Nadler, M. .N CA591201 JB March 22, 1978 3:48 PM .X 41 4 41 41 5 41 41 5 41 41 5 41 67 5 41 .I 42 .T A New Method of Computation of Square Roots Without Using Division .B CACM November, 1959 .A Sarafyan, D. .N CA591106 JB March 22, 1978 3:50 PM .X 42 5 42 42 5 42 42 5 42 .I 43 .T A Technique for Handling Macro Instructions .B CACM November, 1959 .A Greenwald, I. D. .N CA591105 JB March 22, 1978 3:51 PM .X 205 5 43 43 5 43 43 5 43 43 5 43 1 6 43 43 6 43 .I 44 .T RUNCIBLE-Algebraic Translation on a Limited Computer .B CACM November, 1959 .A Knuth, D. E. .N CA591104 JB March 22, 1978 3:52 PM .X 1134 4 44 1141 4 44 364 4 44 405 4 44 438 4 44 561 4 44 44 4 44 222 5 44 364 5 44 44 5 44 44 5 44 44 5 44 77 5 44 100 6 44 224 6 44 44 6 44 44 6 44 77 6 44 82 6 44 98 6 44 .I 45 .T Flow Outlining-A Substitute for Flow Charting .B CACM November, 1959 .A Gant, W. T. .N CA591103 JB March 22, 1978 3:53 PM .X 45 5 45 45 5 45 45 5 45 728 5 45 920 6 45 45 6 45 .I 46 .T Multiprogramming STRETCH: Feasibility Considerations .W The tendency towards increased parallelism in computers is noted. Exploitation of this parallelism presents a number of new problems in machine design and in programming systems. Minimum requirements for successful concurrent execution of several independent problem programs are discussed. These requirements are met in the STRETCH system by a carefully balanced combination of built-in and programmed logic. Techniques are described which place the burden of the programmed logic on system programs (supervisory program and compiler) rather than on problem programs. .B CACM November, 1959 .A Codd, E. F. Lowry, E. S. McDonough, E. Scalzi, C. A. .N CA591102 JB March 22, 1978 3:57 PM .X 168 5 46 491 5 46 46 5 46 46 5 46 46 5 46 168 6 46 185 6 46 196 6 46 46 6 46 46 6 46 .I 47 .T Russian Visit to U.S. Computers .B CACM November, 1959 .A Zaitzeff, E. M. Astrahan, M. M. .N CA591101 JB March 22, 1978 3:59 PM .X 47 5 47 47 5 47 47 5 47 .I 48 .T Shift-Register Code for Indexing Applications .W In this communication the use of a shift-register code with n = 10 is described for calling 64 wireless telemetering stations in a fixed cyclical order. A high degree of redundancy is used, permitting a single-error correcting code ("minimum-distance-three" code) with 64 10-bit code words to be employed as the station identification code. Embedding this in the shift-register code with period 1023 permits the code to be employed without punctuation, each of the telemetering station receivers simply putting received ones and zeros into a shift register. Each time the given code combination arises identifying the particular station (barring for tuitous error combinations of very low probability) it has been called. The communication describes the properties and application of the code in some detail and the finding of the particular example to be employed on URAL, the Soviet-built drum computer donated to the Indian Statistical Institute by the United Nations Technical Aid Administration (UNTAA). .B CACM October, 1959 .A Nadler, M. Sengupta, A. .N CA591011 JB March 22, 1978 4:07 PM .X 48 5 48 48 5 48 48 5 48 .I 49 .T Scientific and Business Applications (Oracle Curve Plotter) .B CACM October, 1959 .A Fike, C. T. .N CA591010 JB March 22, 1978 4:08 PM .X 49 5 49 49 5 49 49 5 49 .I 50 .T Statistical Programs for the IBM 650-Part II .B CACM October, 1959 .A Hamblen, J. W. .N CA591009 JB March 22, 1978 4:09 PM .X 50 5 50 50 5 50 50 5 50 .I 51 .T On the Construction of Micro-Flowcharts .B CACM October, 1959 .A Gorn, S. Ingerman, P. Z. Crozier, J. B. .N CA591008 JB March 22, 1978 4:10 PM .X 249 5 51 51 5 51 51 5 51 51 5 51 196 6 51 303 6 51 51 6 51 .I 52 .T An Efficient Method for Generating Uniformly Distributed Points on the Surface on an n-Dimensional Sphere (Corrigendum) .B CACM October, 1959 .A Cook, J. M. .N CA591007 JB March 22, 1978 4:12 PM .X 52 5 52 52 5 52 52 5 52 .I 53 .T Recommendations of the SHARE ALGOL Committee .B CACM October, 1959 .N CA591006 JB March 22, 1978 4:13 PM .X 214 5 53 53 5 53 53 5 53 53 5 53 1 6 53 53 6 53 91 6 53 .I 54 .T SALE, a Simple Algebraic Language for Engineers .B CACM October, 1959 .A Brittenham, W. R. Clark, K. Kuss, G. Thompson, H. Smith, A. O. .N CA591005 JB March 22, 1978 4:14 PM .X 405 4 54 54 4 54 54 5 54 54 5 54 54 5 54 93 5 54 .I 55 .T An Algebraic Translator .B CACM October, 1959 .A Kaner, H. .N CA591004 JB March 22, 1978 4:15 PM .X 405 5 55 55 5 55 55 5 55 55 5 55 224 6 55 55 6 55 77 6 55 93 6 55 .I 56 .T Proposed Standard Flow Chart Symbols .B CACM October, 1959 .N CA591003 JB March 22, 1978 4:16 PM .X 56 5 56 56 5 56 56 5 56 .I 57 .T J.E.I.D.A. and Its Computer Center .B CACM October, 1959 .N CA591002 JB March 22, 1978 4:17 PM .X 57 5 57 57 5 57 57 5 57 .I 58 .T LEM-1, Small Size General Purpose Digital Computer Using Magnetic (Ferrite) Elements .W The paper examines some of the questions of development and construction of a general purpose digital computer using contactless magnetic (ferrite) and capacitive "DEZU" (long duration capacitive memory) elements, developed at the Laboratory of Electrical Modeling VINITYI AN SSSR, under the supervision of Professor L.I. Gutenmacher. .B CACM October, 1959 .A Machmudov, U. A. .N CA591001 JB March 22, 1978 4:21 PM .X 215 5 58 58 5 58 58 5 58 58 5 58 58 6 58 .I 59 .T Survey of Progress and Trend of Development and Use of Automatic Data Processing in Business and Management control Systems of the Federal Government, as of December 1957-III .B CACM September, 1959 .N CA590910 JB March 22, 1978 4:41 PM .X 59 5 59 59 5 59 59 5 59 .I 60 .T The Alpha Vector Transformation of a System of Linear Constraints .B CACM September, 1959 .A Wersan, S. J. .N CA590909 JB March 22, 1978 4:42 PM .X 60 5 60 60 5 60 60 5 60 .I 61 .T IBM 709 Tape Matrix Compiler .B CACM September, 1959 .A Hornick, S. D. .N CA590908JB March 22, 1978 4:43 PM .X 61 5 61 61 5 61 61 5 61 .I 62 .T Multi-Dimensional Least-Squares Polynomial Curve Fitting .B CACM September, 1959 .A Lesh, F. H. .N CA590907 JB March 22, 1978 4:44 PM .X 62 5 62 62 5 62 62 5 62 .I 63 .T Octal Diagrams of Binary Conception and Their Applicability to Computer Design Logic .W This paper dates back the genesis of binary conception circa 5000 years ago, and octal diagrams about 4800 years ago, as derived by the Chinese ancients. It analyzes the applicability of binary trinities of the octal diagrams to modern electronic-digital-computer design logic. .B CACM September, 1959 .A Li, S. T. .N CA590906 JB March 22, 1978 4:47 PM .X 63 5 63 63 5 63 63 5 63 .I 64 .T Remarks on ALGOL and Symbol Manipulation .B CACM September, 1959 .A Green, J. .N CA590905 JB March 22, 1978 4:47 PM .X 206 5 64 207 5 64 64 5 64 64 5 64 64 5 64 64 6 64 64 6 64 .I 65 .T ALGOL Sub-Committee Report - Extensions .B CACM September, 1959 .A Dijkstra, E. W. Heise, W. Perlis, J. A. Samelson, K. .N CA590904 JB March 22, 1978 4:49 PM .X 65 5 65 65 5 65 65 5 65 .I 66 .T A Proposal for a Generalized Card Code for 256 Characters .B CACM September, 1959 .A Bemer, R. W. .N CA590903 JB March 22, 1978 4:50 PM .X 66 5 66 66 5 66 66 5 66 .I 67 .T Central-European Computers .B CACM September, 1959 .A Blachman, N. M. .N CA590902 JB March 22, 1978 4:52 PM .X 67 4 67 41 5 67 67 5 67 67 5 67 67 5 67 79 5 67 67 6 67 .I 68 .T The Role of the University in Computers, Data Processing and Related Fields .W A study was made of university programs in the United States in the fields of computers, data processing, operations research, and other closely related fields. University policies, organization, administration, faculties, students, researches, curricula, equipment, and financing were investigated. An integrated university program is recommended reflecting the conviction that many present activities related to computers will develop into disciplines and as such are the legitimate province of the university scholar. Details on a recommended Graduate School of "Computer Sciences" are given. .B CACM September, 1959 .A Fein, L. .N CA590901 JB March 22, 1978 6:05 PM .X 1205 5 68 68 5 68 68 5 68 68 5 68 1100 6 68 1104 6 68 1107 6 68 68 6 68 .I 69 .T Statistical Programs for the IBM 650-Part I .W A collection is given of brief descriptions of statistical programs now in use in university computing centers which have IBM 650's. .B CACM August, 1959 .A Hamblen, J. W. .N CA590804 JB March 22, 1978 6:07 PM .X 69 5 69 69 5 69 69 5 69 .I 70 .T Construction of a Set of Test Matrices .W This paper develops the equations and properties of a set of test matrices which are useful in the determination of the accuracy of routines for finding the inverse, determinant and/or eigenvalues of a matrix. .B CACM August, 1959 .A Aegerter, M. J. .N CA590803 JB March 22, 1978 6:09 PM .X 70 5 70 70 5 70 70 5 70 .I 71 .T Proposal for a Feasible Programming System .W This paper proposes designing a programming facility (itself involving a digital computer and a program) which will assist the preparation of large-scale real-time programs. This facility is to be capable of preparing programs for any of a variety of machines having characteristics similar to those of the facility's computer. One of the basic assumptions is that there will be enough random-access storage available to avoid the necessity for segmenting a constructed program in any fashion other than a trivial one. While this assumption is somewhat unrealistic, it is intended to provide an opportunity to concentrate on the other aspects of program construction. The programming system should stress the discovery in source program statements of as many errors as possible, before attempting to construct an object program. Among the computer characteristics which are advocated are a program interrupt scheme, a large set of characters, and indirect addressing. .B CACM August, 1959 .A Bagley, P. R. .N CA590802 JB March 22, 1978 6:16 PM .X 71 5 71 71 5 71 71 5 71 .I 72 .T An Educational Program in Computing .B CACM August, 1959 .A Hollingsworth, J. .N CA590801 JB March 22, 1978 6:18 PM .X 72 5 72 72 5 72 72 5 72 .I 73 .T A Real Time Data Assimilator .B CACM July, 1959 .A Gschwind, H. W. .N CA590705 JB March 22, 1978 6:19 PM .X 73 5 73 73 5 73 73 5 73 .I 74 .T A High-Speed Sorting Procedure .B CACM July, 1959 .A Shell, D. L. .N CA590704 JB March 22, 1978 6:20 PM .X 1919 5 74 74 5 74 74 5 74 74 5 74 852 5 74 864 5 74 865 5 74 864 6 74 1175 6 74 232 6 74 232 6 74 308 6 74 309 6 74 309 6 74 74 6 74 74 6 74 74 6 74 74 6 74 3187 6 74 .I 75 .T Parameter Estimation for Simple Nonlinear Models .B CACM July, 1959 .A Chow, W. M. .N CA590703 JB March 22, 1978 6:22 PM .X 75 4 75 75 4 75 15 5 75 75 5 75 75 5 75 75 5 75 94 5 75 .I 76 .T Binary Conversion, With Fixed Decimal Precision, Of a Decimal Fraction .B CACM July, 1959 .A Taranto, D. .N CA590702 JB March 22, 1978 6:23 PM .X 76 5 76 76 5 76 76 5 76 .I 77 .T On GAT and the Construction of Translators .B CACM July, 1959 .A Arden, B. Graham, R. .N CA590701 JB March 22, 1978 6:24 PM .X 1134 5 77 1141 5 77 364 5 77 405 5 77 438 5 77 44 5 77 77 5 77 77 5 77 77 5 77 561 5 77 100 6 77 224 6 77 224 6 77 224 6 77 224 6 77 249 6 77 303 6 77 393 6 77 17 6 77 44 6 77 55 6 77 77 6 77 77 6 77 77 6 77 77 6 77 77 6 77 77 6 77 77 6 77 93 6 77 98 6 77 408 6 77 .I 78 .T Remarks on the Practical Solution of Characteristic Value Problems .W This paper is concerned with the practical solution of characteristic value problem for an ordinary differential equation. It is at once apparent that sequential computers, be they digital or analog, solve initial value problems, rather than boundary value problems, and some mathematical process must be found to compensate for the machine's inadequacy. (Compensating for machine imperfection is, of course, the normal activity of the numerical analyst.) A number of other papers have applied particular devices to particular problems. The purpose of this note is to establish a mathematical framework or model for these practical procedures and thus assist in the use and extension of the ideas in other particular problems. .B CACM June, 1959 .A Wouk, A. .N CA590606 JB March 22, 1978 6:30 PM .X 78 5 78 78 5 78 78 5 78 .I 79 .T Programming for a Machine With an Extended Address Calculational Mechanism .B CACM June, 1959 .A Schecher, H. .N CA590605 JB March 22, 1978 6:31 PM .X 67 5 79 79 5 79 79 5 79 79 5 79 79 6 79 .I 80 .T A Technique for Computing Critical Rotational Speeds of Flexible Shafts on an Automatic Computer .B CACM June, 1959 .A Schwartz, B. L. .N CA590604 JB March 22, 1978 6:35 PM .X 80 5 80 80 5 80 80 5 80 .I 81 .T NORC High-Speed Printer .B CACM June, 1959 .A Gleissner, G. H. .N CA590603 JB March 22, 1978 6:36 PM .X 81 5 81 81 5 81 81 5 81 .I 82 .T Handling Identifiers as Internal Symbols in Language Processors .W Substitution of computer-oriented symbols for programmer-oriented symbols in language processors is examined and a feasible method for doing so is presented. .B CACM June, 1959 .A Williams, F. A. .N CA590602 JB March 22, 1978 6:38 PM .X 222 5 82 82 5 82 82 5 82 82 5 82 799 5 82 945 6 82 399 6 82 44 6 82 82 6 82 82 6 82 404 6 82 .I 83 .T A Visit to Computation Centers in the Soviet Union .B CACM June, 1959 .A Carr III, J. W. .N CA590601 JB March 22, 1978 6:39 PM .X 1134 4 83 83 4 83 1349 5 83 17 5 83 83 5 83 83 5 83 83 5 83 236 6 83 323 6 83 83 6 83 415 6 83 .I 84 .T Survey of Progress and Trend of Development and Use of Automatic Data Processing in Business and Management Control Systems of the Federal Government, as of December 1957-II (Part 2 see CA590406) .B CACM May, 1959 .N CA590502 JB March 22, 1978 6:42 PM .X 84 5 84 84 5 84 84 5 84 .I 85 .T Error Analysis in Floating Point Arithmetic .B CACM May, 1959 .A Carr III, J. W. .N CA590501 JB March 22, 1978 6:43 PM .X 1148 5 85 85 5 85 85 5 85 85 5 85 85 6 85 .I 86 .T Survey of Progress and Trend of Development and Use of Automatic Data Processing in Business and Management Control Systems of the Federal Government, as of December 1957 .B CACM April, 1959 .A Controller General of the United States to the Congress of the United States .N CA590406 JB March 22, 1978 6:48 PM .X 86 5 86 86 5 86 86 5 86 .I 87 .T A Note on a Method for Generating Points Uniformly on N-Dimensional Spheres .B CACM April, 1959 .A Muller, M. E. .N CA590405 JB March 22, 1978 7:04 PM .X 2333 4 87 87 4 87 2333 5 87 87 5 87 87 5 87 87 5 87 88 5 87 1793 6 87 87 6 87 88 6 87 .I 88 .T An Efficient Method for Generating Uniformly Distributed Points on the Surface of an n-Dimensional Sphere .B CACM April, 1959 .A Hicks, J. S. Wheeling, R. F. .N CA590404 JB March 22, 1978 7:10 PM .X 2333 5 88 87 5 88 88 5 88 88 5 88 88 5 88 1793 6 88 87 6 88 88 6 88 88 6 88 .I 89 .T A Routine to Find the Solution of Simultaneous Linear Equations with Polynomial Coefficients .B CACM April, 1959 .A Larson, E. H. Marshall, D. P. .N CA590403 JB March 22, 1978 7:12 PM .X 89 5 89 89 5 89 89 5 89 .I 90 .T Binary Arithmetic for Discretely Variable Word Length in a Serial Computer .B CACM April, 1959 .A Ercoli, P. Vacca, R. .N CA590402 JB March 22, 1978 7:13 PM .X 107 5 90 90 5 90 90 5 90 90 5 90 90 6 90 .I 91 .T A Mathematical Procedure for Machine Division .B CACM April, 1959 .A Gilman, R. E. .N CA590401 JB March 22, 1978 7:14 PM .X 214 5 91 1593 5 91 91 5 91 91 5 91 91 5 91 1 6 91 1292 6 91 53 6 91 91 6 91 91 6 91 .I 92 .T A Checklist of Intelligence for Programming Systems .W A remarkable variation exists in the degree of sophistication of various programming systems. A particular manifestation is the jungle of assorted devices for reproducing limited human decision procedures. An attempt is made here to begin a systematic classification of the various devices for educating the computer to take over the decision-making functions of one or many human operators, both those that have been demonstrated feasible to date and those that are highly desirable for the future. .B CACM March, 1959 .A Bemer, R. W. .N CA590304 JB March 22, 1978 8:01 PM .X 92 5 92 92 5 92 92 5 92 .I 93 .T From Formulas to Computer Oriented Language .W A technique is shown for enabling a computer to translate simple algebraic formulas into a three address computer code. .B CACM March, 1959 .A Wegstein, J. H. .N CA590303 JB March 22, 1978 8:03 PM .X 405 5 93 54 5 93 93 5 93 93 5 93 93 5 93 224 6 93 55 6 93 77 6 93 93 6 93 93 6 93 .I 94 .T An Iterative Method for Fitting the Logistic Curve .W An iterative method is given for finding a logistic curve of best least squares fit to a set of two-dimensional points. .B CACM March, 1959 .A Howell, J.R. .N CA590302 JB March 22, 1978 8:04 PM .X 75 5 94 94 5 94 94 5 94 94 5 94 15 6 94 94 6 94 .I 95 .T Elimination of Special Functions from Differential Equations .W A set of ordinary differential equations which contains mathematical functions requiring the use of subroutines for numerical solution by electronic computer, tabular data for numerical solution by hand calculation or function generators when analog methods are applied can sometimes be expanded to an equivalent set of equations which do not contain the functions. This is practical if these functions satisfy sufficiently simple differential equations. Thus among those functions which can be eliminated by this procedure are the trigonometric, inverse trigonometric, exponential, and many other transcendental functions. .B CACM March, 1959 .A Powers, J. E. .N CA590301 JB March 22, 1978 8:08 PM .X 95 5 95 95 5 95 95 5 95 .I 96 .T On Computing Radiation Integrals .W The relative merit and cost of four ways of evaluating typical radiation integrals containing spherical Bessel functions are investigated. These methods are desk machine evaluation of a finite series, integration of the appropriate differential equation by a Reeves Electronic Analog Computer and by a Litton 40 IBM 704 computer. Results are generally applicable to equations separated from a Helmholtz or wave equation. .B CACM February, 1959 .A Hansen, R. C. Bailin, L. L. Rutishauser, R. W. .N CA590205 JB March 22, 1978 8:16 PM .X 96 5 96 96 5 96 96 5 96 .I 97 .T Signal Corps Research and Development on Automatic Programming of Digital Computers .B CACM February, 1959 .A Luebbert, Capt. W. F. Collom Jr., Capt. P. W. .N CA590204 JB March 22, 1978 8:19 PM .X 97 5 97 97 5 97 97 5 97 .I 98 .T The Arithmetic Translator-Compiler of the IBM FORTRAN Automatic Coding System .B CACM February, 1959 .A Sheridan, P. B. .N CA590203 JB March 22, 1978 8:21 PM .X 224 5 98 364 5 98 98 5 98 98 5 98 98 5 98 100 6 98 224 6 98 44 6 98 77 6 98 98 6 98 98 6 98 .I 99 .T Possible Modifications to the International Algebraic Language .B CACM February, 1959 .A Green, J. .N CA590202 JB March 22, 1978 8:22 PM .X 99 5 99 99 5 99 99 5 99 .I 100 .T Recursive Subscripting Compilers and List-Types Memories .B CACM February, 1959 .A Carr III, J. W. .N CA590201 JB March 22, 1978 8:23 PM .X 205 4 100 210 4 100 214 4 100 1982 4 100 398 4 100 642 4 100 669 4 100 100 4 100 123 4 100 164 4 100 100 5 100 100 5 100 100 5 100 1 5 100 364 5 100 100 6 100 224 6 100 44 6 100 77 6 100 98 6 100 .I 101 .T Nuclear Reactor Codes .B CACM January, 1959 .A Nather, V. Sangren, W. .N CA590101 JB March 22, 1978 8:24 PM .X 101 5 101 101 5 101 101 5 101 .I 102 .T A Comparison of 650 Programming Methods .B CACM December, 1960 .A Curtz, T. B. Riordan, J. F. Spohn,M. .N CA601214 JB March 20, 1978 6:18 PM .X 102 5 102 102 5 102 102 5 102 .I 103 .T COPE (Console Operator Proficiency Examination)* .W Each year electronic computers become more sophisticated, and the programs they must process become more complex. Because of this,dependence of those in computing on the skill and experience of operators is increasing. At the same time, selection and training of qualified operators grows more difficult. To meet the need for a quick, accurate, uniform operator test and training aid, the authors have developed COPE (Console Operator Proficiency Examination), outlined below. While this examination is programmed specifically for the IBM 705 Model II with two Tape Record Coordinators, similar programs could be developed for other computers. .B CACM December, 1960 .A Farbman, D. Ketover, R. .N CA601213 JB March 20, 1978 6:23 PM .X 103 5 103 103 5 103 103 5 103 .I 104 .T Digital Simulation of Discrete Flow Systems* .W The discrete flow systems discussed are characterized by the movement of randomly arriving items along interacting channels. Programing a digital computer to simulate such systems utilizes some techniques not common in other approaches to physical problems. The principal portion of the paper is a discussion of two simulation studies that illustrate some of the programming problems involved. One is of an extensive package-handling plant, with the objective being optimization of parameters such as storage capacities and processing rates. In the other, air traffic flow and control procedures are simulated to compare the effects of alternative control decisions. .B CACM December, 1960 .A Moore, C. J. Lewis, T. S. .N CA601212 JB March 20, 1978 6:27 PM .X 104 5 104 104 5 104 104 5 104 .I 105 .T Two Methods for Word Inversion on the IBM 709 .B CACM December, 1960 .A Price, R. A. Jardins, P. D. .N CA601211 JB March 20, 1978 6:28 PM .X 105 5 105 105 5 105 105 5 105 .I 106 .T A Method for Overlapping and Erasure of Lists .W An important property of the Newell-Shaw-Simon scheme for computer storage of lists is that data having multiple occurrences need not be stored at more than one place in the computer. That is, lists may be "overlapped." Unfortunately, overlapping poses a problem for subsequent erasure. Given a list that is no longer needed, it is desired to erase just those parts that do not overlap other lists. In LISP, McCarthy employs an elegant but inefficient solution to the problem. The present paper describes a general method which enables efficient erasure. The method employs interspersed reference counts to describe the extent of the overlapping. .B CACM December, 1960 .A Collins, G. E. .N CA601210 JB March 20, 1978 6:33 PM .X 1024 4 106 1051 4 106 1102 4 106 1132 4 106 1390 4 106 1486 4 106 1549 4 106 1706 4 106 1826 4 106 1878 4 106 378 4 106 2060 4 106 2155 4 106 2168 4 106 2719 4 106 2723 4 106 2838 4 106 2842 4 106 2855 4 106 2879 4 106 3077 4 106 3080 4 106 3106 4 106 627 4 106 106 4 106 106 5 106 106 5 106 106 5 106 1050 5 106 210 5 106 1393 5 106 1549 5 106 2023 5 106 3112 5 106 627 5 106 849 6 106 106 6 106 106 6 106 106 6 106 106 6 106 106 6 106 106 6 106 196 6 106 1051 6 106 1380 6 106 209 6 106 1826 6 106 210 6 106 210 6 106 1878 6 106 296 6 106 1972 6 106 367 6 106 2438 6 106 2723 6 106 2736 6 106 2833 6 106 2838 6 106 406 6 106 627 6 106 627 6 106 731 6 106 731 6 106 731 6 106 753 6 106 .I 107 .T Multiple Precision Arithmetic .B CACM December, 1960 .A Pope, D. A. Stein, M. L. .N CA601209 JB March 20, 1978 6:34 PM .X 107 4 107 107 5 107 107 5 107 107 5 107 1026 5 107 1258 5 107 1292 5 107 1497 5 107 90 5 107 107 6 107 107 6 107 107 6 107 107 6 107 1026 6 107 1026 6 107 1026 6 107 1292 6 107 1593 6 107 .I 108 .T Programmed Error Correction in Project Mercury .B CACM December, 1960 .A Dimsdale, B. Weinberg, G. M. .N CA601208 JB March 20, 1978 6:35 PM .X 108 5 108 108 5 108 108 5 108 361 5 108 108 6 108 .I 109 .T A Note on Approximating e^x .B CACM December, 1960 .A Lubkin, S. .N CA601207 JB March 20, 1978 6:37 PM .X 109 5 109 109 5 109 109 5 109 .I 110 .T Fibonaccian Searching .B CACM December, 1960 .A Ferguson, D. E. .N CA601206 JB March 20, 1978 6:38 PM .X 110 5 110 110 5 110 110 5 110 .I 111 .T On Programming the Numerical Solution of Polynomial Equations .W Numerical techniques are presented for computing the roots of polynomial equations. By applying the recommended scaling and inversion rules, the basic Bairstow and Newton-Raphson iterative techniques can be applied with great reliability. Both a high degree of accuracy and rapid convergence are realized. Numerical examples are shown to illustrate the pitfalls and to show how these are circumvented by application of the recommended procedures. .B CACM December, 1960 .A Ellenberger, K. W. .N CA601205 JB March 20, 1978 6:41 PM .X 111 5 111 111 5 111 111 5 111 .I 112 .T Numerical Solution of the Polynomial Equation (Algorithm 30) .B CACM December, 1960 .A Ellenberger, K. W. .N CA601204 JB March 20, 1978 6:44 PM .X 112 5 112 112 5 112 112 5 112 .I 113 .T Survey of Coded Character Representation .B CACM December, 1960 .A Bemer, R. W. .N CA601203 JB March 20, 1978 6:44 PM .X 113 5 113 113 5 113 113 5 113 .I 114 .T Survey of Punched Card Codes .B CACM December, 1960 .A Smith, H. J. Williams, F. A. .N CA601202 JB March 20, 1978 6:45 PM .X 114 5 114 114 5 114 114 5 114 .I 115 .T Optimizers: Their Structure .B CACM December, 1960 .A Wheeling, R. F. .N CA601201 JB March 20, 1978 6:46 PM .X 115 5 115 115 5 115 115 5 115 .I 116 .T The Sumador Chino .W On a recent motor trip through Mexico, the writer came across on adding device which was referred to as a sumador chino (Chinese adder). A survey of the more available literature on the history of mathematics and on instruments of calculation has uncovered no reference to such a device. The purpose of this communication is to enlist the help of other members in bringing to light whatever may be known concerning the evolution and present status of the sumador chino. .B CACM November, 1960 .A Rogers, J. L. .N CA601119 JB March 20, 1978 6:50 PM .X 116 5 116 116 5 116 116 5 116 .I 117 .T An Estimation of the Relative Efficiency of Two Internal Sorting Methods .B CACM November, 1960 .A Nagler, H. .N CA601118 JB March 20, 1978 6:51 PM .X 117 5 117 117 5 117 117 5 117 .I 118 .T Character Scanning on the IBM 7070 .B CACM November, 1960 .A Speckhard, A. E. .N CA601117 JB March 20, 1978 6:52 PM .X 118 5 118 118 5 118 118 5 118 .I 119 .T Note on Eigenvalue Computation .B CACM November, 1960 .A Andrus, J. F. .N CA601116 JB March 20, 1978 6:53 PM .X 119 5 119 119 5 119 119 5 119 .I 120 .T A Simple Technique for Coding Differential Equations .B CACM November, 1960 .A Sefton, P. Vaillancourt, R. .N CA601115 JB March 20, 1978 6:57 PM .X 120 4 120 120 5 120 120 5 120 120 5 120 175 5 120 .I 121 .T Over-all Computation Control and Labelling .B CACM November, 1960 .A Holt, A. .N CA601114 JB March 20, 1978 6:58 PM .X 121 4 121 121 5 121 121 5 121 121 5 121 221 5 121 .I 122 .T Least Squares Fitting of a Great Circle Through Points on a Sphere .B CACM November,1960 .A DeWitte, L. .N CA601113 JB March 20, 1978 6:59 PM .X 122 5 122 122 5 122 122 5 122 297 5 122 122 6 122 .I 123 .T Compilation for Two Computers with NELIAC .W NELIAC, a compiler based on ALGOL, was developed at the U.S. Navy Electronics Laboratory, San Diego,California, as a"boot-strap" compiler for the Remington Rand Univac COUNTESS computer. This compiler was used to generate a version of itself which, running as a COUNTESS program, generated machine code for the Control Data Corporation CDC-1604. All three versions of NELIAC accepted essentially identical input language. .B CACM November, 1960 .A Masterson Jr., K. S. .N CA601112 JB March 20, 1978 7:03 PM .X 205 4 123 210 4 123 214 4 123 249 4 123 254 4 123 272 4 123 1102 4 123 1109 4 123 1140 4 123 1188 4 123 1306 4 123 1464 4 123 1491 4 123 1767 4 123 1781 4 123 1787 4 123 1949 4 123 1982 4 123 321 4 123 398 4 123 2059 4 123 2126 4 123 435 4 123 437 4 123 463 4 123 483 4 123 491 4 123 2732 4 123 560 4 123 583 4 123 3073 4 123 627 4 123 631 4 123 632 4 123 637 4 123 642 4 123 642 4 123 644 4 123 653 4 123 669 4 123 680 4 123 761 4 123 762 4 123 763 4 123 100 4 123 123 4 123 123 4 123 123 4 123 140 4 123 164 4 123 919 4 123 989 4 123 123 5 123 123 5 123 123 5 123 165 5 123 196 5 123 1 5 123 1781 5 123 637 5 123 123 6 123 123 6 123 165 6 123 196 6 123 919 6 123 990 6 123 1007 6 123 1046 6 123 1131 6 123 1139 6 123 1140 6 123 1149 6 123 1198 6 123 1215 6 123 1223 6 123 1265 6 123 1303 6 123 1323 6 123 1358 6 123 1366 6 123 1421 6 123 1460 6 123 1462 6 123 1463 6 123 1467 6 123 1468 6 123 1477 6 123 1491 6 123 1496 6 123 1531 6 123 1535 6 123 1565 6 123 1601 6 123 1602 6 123 1613 6 123 1614 6 123 1626 6 123 1641 6 123 1787 6 123 1788 6 123 205 6 123 224 6 123 249 6 123 288 6 123 316 6 123 381 6 123 398 6 123 11 6 123 404 6 123 410 6 123 463 6 123 464 6 123 483 6 123 3184 6 123 3188 6 123 584 6 123 600 6 123 680 6 123 691 6 123 763 6 123 799 6 123 .I 124 .T An Algorithm for the Assignment Problem .W The assignment problem is formulated and briefly discussed. An efficient algorithm for its solution is presented in ALGOL code. An empirical relation between solution time and the size of the problem is given, based on extensive experiments carried out on a digital computer. .B CACM November, 1960 .A Silver, R. .N CA601111 JB March 20, 1978 7:05 PM .X 124 5 124 124 5 124 124 5 124 2133 5 124 2134 5 124 124 6 124 124 6 124 2134 6 124 .I 125 .T Polynomial Transformer (Algorithm 29) .B CACM November, 1960 .A Mackinney, J. G. .N CA601110 JB March 20, 1978 7:06 PM .X 125 5 125 125 5 125 125 5 125 1816 5 125 125 6 125 .I 126 .T Least Squares Fit By Orthogonal polynomials (Algorithm 28) .B CACM November, 1960 .A Mackinney, J. G. .N CA601109 JB March 20, 1978 7:08 PM .X 126 5 126 126 5 126 126 5 126 .I 127 .T ASSIGNMENT (Algorithm 27) .B CACM November, 1960 .A Silver, R. .N CA601108 JB March 20, 1978 7:09 PM .X 127 5 127 127 5 127 127 5 127 .I 128 .T ROOTFINDER III (Algorithm 26) .B CACM November, 1960 .A Herroit, J. G. .N CA601107 JB March 20, 1978 7:57 PM .X 128 5 128 128 5 128 128 5 128 .I 129 .T ROOTFINDER II (Algorithm 15) .B CACM November, 1960 .A Forsythe, G. E. Herriot, J. G. .N CA601106 JB March 20, 1978 7:59 PM .X 129 5 129 129 5 129 129 5 129 .I 130 .T Real Zeros of an Arbitrary Function (Algorithm 25) .B CACM November, 1960 .A Leavenworth, B. .N CA601105 JB March 20, 1978 8:00 PM .X 130 5 130 130 5 130 130 5 130 .I 131 .T Solution of Tri-Diagonal Linear Equations (Algorithm 24) .B CACM November, 1960 .A Leavenworth, B. .N CA601104 JB March 20, 1978 8:01 PM .X 131 5 131 131 5 131 131 5 131 .I 132 .T Math Sort (Algorithm 23) .B CACM November, 1960 .A Feurzeig, W. .N CA601103 JB March 20, 1978 8:03 PM .X 132 5 132 132 5 132 132 5 132 .I 133 .T Riccati-Bessel Functions of First And Second Kind (Algorithm 22) .B CACM November, 1960 .A Oser, H. .N CA601102 JB March 20, 1978 8:04 PM .X 133 5 133 133 5 133 133 5 133 .I 134 .T Bessel Function for a Set of Integer Orders(Algorithm 21) .B CACM November, 1960 .A Borsch-Supan, W. .N CA601101 JB March 20, 1978 8:05 PM .X 134 5 134 134 5 134 134 5 134 1909 5 134 134 6 134 1023 6 134 1284 6 134 1316 6 134 .I 135 .T Digital Computers in Universities-IV .B CACM October, 1960 .A Reeves, R. F. .N CA601013 JB March 20, 1978 8:07 PM .X 135 5 135 135 5 135 135 5 135 .I 136 .T A Note on the Calculation of Interest .B CACM October, 1960 .A Ingerman, P. Z. .N CA601012 JB March 20, 1978 8:09 PM .X 136 5 136 136 5 136 136 5 136 .I 137 .T Evaluating Numbers Expressed as Strings of English Words .B CACM October, 1960 .A Swift, C. J. .N CA601011 JB March 20, 1978 8:11 PM .X 137 5 137 137 5 137 137 5 137 .I 138 .T Some Thoughts on Reconciling Various Character Set Proposals (Corrigenda) .B CACM October, 1960 .A Voorhees, E. A. .N CA601010 JB March 20, 1978 8:13 PM .X 138 5 138 138 5 138 138 5 138 .I 139 .T Binomial Coefficients (Algorithm 19) .B CACM October, 1960 .A Kenyon, R. R. .N CA601009 JB March 20, 1978 8:14 PM .X 139 5 139 139 5 139 139 5 139 .I 140 .T Crout with Pivoting (Algorithm 16) .B CACM October, 1960 .A Forsythe, G. E. .N CA601008 JB March 20, 1978 8:15 PM .X 249 4 140 254 4 140 272 4 140 1102 4 140 1109 4 140 1140 4 140 1188 4 140 1306 4 140 1319 4 140 1464 4 140 1491 4 140 1767 4 140 1781 4 140 1787 4 140 1949 4 140 321 4 140 2059 4 140 2126 4 140 435 4 140 437 4 140 454 4 140 463 4 140 483 4 140 491 4 140 2732 4 140 560 4 140 583 4 140 3073 4 140 627 4 140 631 4 140 632 4 140 642 4 140 644 4 140 653 4 140 680 4 140 761 4 140 762 4 140 763 4 140 123 4 140 140 4 140 140 4 140 919 4 140 989 4 140 140 5 140 140 5 140 140 5 140 152 5 140 196 5 140 .I 141 .T Some Thoughts on Parallel Processing .B CACM October, 1960 .A Yarbrough, L. D. .N CA601007 JB March 20, 1978 8:16 PM .X 141 5 141 141 5 141 141 5 141 .I 142 .T Comments on a Technique for Counting Ones .B CACM October, 1960 .A Sherman, P. M. .N CA601006 JB March 20, 1978 8:18 PM .X 2952 4 142 2952 4 142 2952 4 142 142 4 142 142 4 142 142 4 142 142 5 142 142 5 142 142 5 142 162 5 142 163 5 142 192 5 142 362 5 142 2952 5 142 142 6 142 142 6 142 162 6 142 163 6 142 192 6 142 2185 6 142 2727 6 142 .I 143 .T A List of Computer Systems Programs for the IBM 650, DATATRON 205, and UNIVAC SS-80 .B CACM October, 1960 .A Romberg, A. .N CA601005 JB March 20, 1978 8:21 PM .X 143 5 143 143 5 143 143 5 143 .I 144 .T Do It by the Numbers-Digital Shorthand .W Present communications systems transmit single characters in groups of coded pulses between simple terminal equipments. Since English words form only a sparse set of all possible alphabetic combinations, present methods are inefficient when computer systems are substituted for these terminals. Using numeric representations of entire words or common phrases (rather than character-by-character representations) requires approximately one-third of present transmission time. This saving is reflected in overall costs. Other benefits accrue in code and language translation schemes. Provision is made for transmission of purely numeric and/or binary streams, and for single character-transmission of non-dictionary words such as the names of people or places. .B CACM October, 1960 .A Bemer, R. W. .N CA601004 JB March 20, 1978 8:27 PM .X 144 5 144 144 5 144 144 5 144 .I 145 .T Automatic Graders for Programming Classes .B CACM October, 1960 .A Hollingsworth, J. .N CA601003 JB March 20, 1978 8:28 PM .X 145 5 145 145 5 145 145 5 145 1270 5 145 1902 5 145 145 6 145 145 6 145 1270 6 145 3184 6 145 .I 146 .T The Use of Computers in Engineering Classroom Instruction .W On April 29-30, the Computer Committee of the College of Engineering, University of Michigan, which acts as a steering committee for The Ford Foundation Project on the Use of Computers in Engineering Education, held a special conference to discuss certain timely topics pertinent to the Ford Project. This report contains a condensed transcription of the key ideas offered by the conference attendees on selected topics. .B CACM October, 1960 .A Katz, D. L. .N CA601002 JB March 20, 1978 8:37 PM .X 146 5 146 146 5 146 146 5 146 .I 147 .T Report on a Conference of University Computing Center Directors .B CACM October, 1960 .N CA601001 JB March 20, 1978 8:38 PM .X 147 5 147 147 5 147 147 5 147 .I 148 .T Digital Computers in Universities-III .B CACM September, 1960 .A Reeves, R. F. .N CA600909 JB March 20, 1978 8:41 PM .X 148 5 148 148 5 148 148 5 148 .I 149 .T A Decision Rule for Improved Efficiency in Solving Linear Programming Problems with the Simplex Algorithm .B CACM September, 1960 .A Dickson, J. C. Frederick, F. P. .N CA600908 JB March 20, 1978 8:43 PM .X 149 5 149 149 5 149 149 5 149 .I 150 .T Rational Interpolation by Continued Fractions (Algorithm 18) .B CACM September, 1960 .A Floyd, R. W. .N CA600907 JB March 20, 1978 8:44 PM .X 150 5 150 150 5 150 150 5 150 .I 151 .T TRDIAG (Algorithm 17) .B CACM September, 1960 .A Sprague III, C. D. .N CA600906 JB March 20, 1978 8:45 PM .X 151 5 151 151 5 151 151 5 151 .I 152 .T CROUT With Pivoting (Algorithm 16) .B CACM September, 1960 .A Forsythe, G. E. .N CA600905 JB March 20, 1978 8:47 PM .X 140 5 152 152 5 152 152 5 152 152 5 152 1319 5 152 454 5 152 152 6 152 152 6 152 152 6 152 196 6 152 1128 6 152 586 6 152 .I 153 .T Comments from a FORTRAN User .B CACM September, 1960 .A Blatt, J. M. .N CA600904 JB March 20, 1978 8:48 PM .X 153 5 153 153 5 153 153 5 153 754 5 153 153 6 153 .I 154 .T Rapidly Convergent Expressions for Evaluating e^x .B CACM September, 1960 .A Berin, A. .N CA600903 JB March 20, 1978 8:49 PM .X 154 5 154 154 5 154 154 5 154 .I 155 .T Trie Memory .B CACM September, 1960 .A Fredkin, E. .N CA600902 JB March 20, 1978 8:50 PM .X 155 5 155 155 5 155 155 5 155 944 5 155 2846 5 155 849 5 155 155 6 155 155 6 155 155 6 155 615 6 155 .I 156 .T An Introductory Problem in Symbol Manipulation for the Student .B CACM September, 1960 .A Rosin, R. F. .N CA600901 JB March 20, 1978 8:51 PM .X 156 5 156 156 5 156 156 5 156 .I 157 .T Digital Computers in Universities -II .B CACM August, 1960 .A Reeves, R. F. .N CA600809 JB March 20, 1978 8:54 PM .X 157 5 157 157 5 157 157 5 157 .I 158 .T ROOTFINDER II (Algorithm 15) .B CACM August, 1960 .A Thacher Jr., H. C. .N CA600808 JB March 20, 1978 8:55 PM .X 158 5 158 158 5 158 158 5 158 .I 159 .T ROOTFINDER (Algorithm 2) .B CACM August, 1960 .A Thacher Jr., H. C. .N CA600807 JB March 20, 1978 8:56 PM .X 159 5 159 159 5 159 159 5 159 .I 160 .T ROOTFINDER II (Algorithm 15) .B CACM August, 1960 .A Thacher Jr., H. C. .N CA600806 JB March 20, 1978 8:57 PM .X 160 5 160 160 5 160 160 5 160 .I 161 .T Abbreviating Words Systematically (Corrigendum) .B CACM August, 1960 .A Barrett, J. A. Grems, M. .N CA600805 JB March 20, 1978 8:58 PM .X 161 5 161 161 5 161 161 5 161 .I 162 .T A Variant Technique for Counting Ones .B CACM August, 1960 .A Frieden, H. .N CA600804 JB March 20, 1978 9:00 PM .X 142 5 162 162 5 162 162 5 162 162 5 162 2952 5 162 142 6 162 162 6 162 162 6 162 163 6 162 163 6 162 192 6 162 192 6 162 2185 6 162 2727 6 162 .I 163 .T Counting Ones on the IBM 7090 .B CACM August, 1960 .A Kutler, S. S. .N CA600803 JB March 20, 1978 9:01 PM .X 142 5 163 163 5 163 163 5 163 163 5 163 2952 5 163 142 6 163 162 6 163 162 6 163 163 6 163 163 6 163 192 6 163 192 6 163 2185 6 163 2727 6 163 .I 164 .T A Short Study of Notation Efficiency .B CACM August, 1960 .A Smith Jr., H. J. .N CA600802 JB March 20, 1978 9:02 PM .X 205 4 164 210 4 164 214 4 164 1982 4 164 398 4 164 642 4 164 669 4 164 100 4 164 123 4 164 164 4 164 164 5 164 164 5 164 164 5 164 1 5 164 .I 165 .T NELIAC-A Dialect of ALGOL .B CACM August, 1960 .A Huskey, H. D. Halstead, M. H. .N CA600801 JB March 20, 1978 9:03 PM .X 123 5 165 165 5 165 165 5 165 165 5 165 637 5 165 1 6 165 123 6 165 165 6 165 165 6 165 196 6 165 .I 166 .T Programming Compatibility in a Family of Closely Related Digital Computers .B CACM July, 1960 .A Luebbert, W. F. .N CA600707 JB March 20, 1978 9:14 PM .X 166 5 166 166 5 166 166 5 166 .I 167 .T Combining ALGOL Statement Analysis with Validity Checking .B CACM July, 1960 .A McIsaac, P. .N CA600706 JB March 20, 1978 9:15 PM .X 167 5 167 167 5 167 167 5 167 .I 168 .T Multiprogram Scheduling Parts 3 and 4 Scheduling Algorithm and External Constraints .B CACM July, 1960 .A Codd, E. F. .N CA600705 JB March 20, 1978 9:16 PM .X 491 4 168 168 4 168 168 5 168 168 5 168 168 5 168 1713 5 168 1901 5 168 491 5 168 46 5 168 168 6 168 168 6 168 168 6 168 185 6 168 185 6 168 185 6 168 196 6 168 1751 6 168 1754 6 168 46 6 168 .I 169 .T The Multilingual Terminology Project .B CACM July, 1960 .A Holmstrom, J. E. .N CA600704 JB March 20, 1978 9:17 PM .X 169 5 169 169 5 169 169 5 169 .I 170 .T Some Thoughts on Reconciling Various Character Set Proposals .B CACM July, 1960 .A Voorhees, E. A. .N CA600703 JB March 20, 1978 9:18 PM .X 170 5 170 170 5 170 170 5 170 .I 171 .T Digital Computers in Universities (Part I) .B CACM July, 1960 .A Reeves, R. F. .N CA600702 JB March 20, 1978 9:20 PM .X 171 5 171 171 5 171 171 5 171 .I 172 .T Complex Exponential Integral (Algorithm 13) .B CACM July, 1960 .A Beam, A. .N CA600701 JB March 20, 1978 9:21 PM .X 172 5 172 172 5 172 172 5 172 .I 173 .T ATLAS a new concept in large computer design .B CACM June, 1960 .N CA600617 JB March 20, 1978 9:22 PM .X 173 5 173 173 5 173 173 5 173 .I 174 .T Interval Estimation of the Time in One State to Total Time Ratio in a DoubleExponential Process .B CACM June, 1960 .A Neal, W. R. .N CA600616 JB March 20, 1978 9:24 PM .X 174 5 174 174 5 174 174 5 174 .I 175 .T The Solution of Simultaneous Ordinary Differential Equations Using a General Purpose Digital Computer .B CACM June, 1960 .A Anderson, W. H. .N CA600615 JB March 20, 1978 9:25 PM .X 120 5 175 175 5 175 175 5 175 175 5 175 175 6 175 .I 176 .T Symbol Manipulation by Threaded Lists (Corrigendum) .B CACM June, 1960 .A Perlis, A. J. Thornton, C. .N CA600614 JB March 20, 1978 9:26 PM .X 176 5 176 176 5 176 176 5 176 .I 177 .T Solution of Polynomial Equation by Bairstow Hitchcock Method, A. A. Grau Communications ACM, February, 1960 (Algorithm) .B CACM June, 1960 .A Thacher Jr., H. C. .N CA600613 JB March 20, 1978 9:31 PM .X 177 5 177 177 5 177 177 5 177 .I 178 .T ROOTFINDER (Algorithm) .B CACM June, 1960 .A Thacher Jr., H. C. .N CA600612 JB March 20, 1978 9:32 PM .X 178 5 178 178 5 178 178 5 178 1667 5 178 178 6 178 1242 6 178 327 6 178 .I 179 .T Evaluation of the Legendre Polynomial Pn(X) by Recursion (Algorithm) .B CACM June, 1960 .A Galler, G. M. .N CA600611 JB March 20, 1978 9:35 PM .X 179 5 179 179 5 179 179 5 179 .I 180 .T Evaluation of the Laguerre Polynomial Ln(X) by Recursion (Algorithm) .B CACM June, 1960 .A Galler, G. M. .N CA600610 JB March 20, 1978 9:36 PM .X 180 5 180 180 5 180 180 5 180 .I 181 .T Evaluation of the Hermite Polynomial Hn(X) by Recursion (Algorithm) .B CACM June, 1960 .A Galler, G. M. .N CA600609 JB March 20, 1978 9:37 PM .X 181 5 181 181 5 181 181 5 181 .I 182 .T Evaluation of the Chebyshev Polynomial Tn(X) by Recursion (Algorithm) .B CACM June, 1960 .A Galler, G. M. .N CA600608 JB March 20, 1978 9:38 PM .X 182 5 182 182 5 182 182 5 182 .I 183 .T Conversion Between Floating Point Representations .B CACM June, 1960 .A Perry, C. .N CA600607 JB March 20, 1978 9:40 PM .X 183 5 183 183 5 183 183 5 183 .I 184 .T A Short Method for Measuring Error in a Least-Squares Power Series .B CACM June, 1960 .A Robinson, S. M. Struble, G. W. .N CA600606 JB March 20, 1978 9:41 PM .X 184 5 184 184 5 184 184 5 184 .I 185 .T Multiprogram Scheduling Parts 1 and 2. Introduction and Theory* .W In order to exploit fully a fast computer which possesses simultaneous processing abilities, it should to a large extent schedule its own workload. The scheduling routine must be capable of extremely rapid execution if it is not to prove self-defeating. The construction of a schedule entails determining which programs are to be run concurrently and which sequentially with respect to each other. A concise scheduling algorithm is described which tends to minimize the time for executing the entire pending workload (or any subset of it), subject to external constraints such as precedence, urgency, etc. The algorithm is applicable to a wide class of machines. .B CACM June, 1960 .A Codd, E. F. .N CA600605 JB March 20, 1978 9:46 PM .X 185 5 185 185 5 185 185 5 185 1713 5 185 1901 5 185 491 5 185 168 6 185 168 6 185 168 6 185 185 6 185 185 6 185 185 6 185 196 6 185 1751 6 185 1754 6 185 46 6 185 .I 186 .T An Algorithm Defining ALGOL Assignment Statements (Addendum) .B CACM June, 1960 .A Floyd, R. W. .N CA600604 JB March 20, 1978 9:47 PM .X 186 5 186 186 5 186 186 5 186 .I 187 .T Compiling Connectives .B CACM June, 1960 .A Swift, C. J. .N CA600603 JB March 20, 1978 9:54 PM .X 187 5 187 187 5 187 187 5 187 .I 188 .T The Department of Computer Mathematics at Moscow State University .B CACM June, 1960 .A Berezin, I. S. .N CA600602 JB March 20, 1978 9:56 PM .X 188 5 188 188 5 188 188 5 188 .I 189 .T The Future of Automatic Digital Computers .B CACM June, 1960 .A Booth, A. D. .N CA600601 JB March 20, 1978 9:57PM .X 189 5 189 189 5 189 189 5 189 .I 190 .T Bendix G-20 System .B CACM May, 1960 .N CA600507 JB March 22, 1978 1:28 PM .X 190 5 190 190 5 190 190 5 190 .I 191 .T Abbreviating Words Systematically .B CACM May, 1960 .A Barrett, J. A. Grems, M. .N CA600506 JB March 22, 1978 1:29 PM .X 191 5 191 191 5 191 191 5 191 .I 192 .T A Technique for Counting Ones in a Binary Computer .B CACM May, 1960 .A Wegner, P. .N CA600505 JB March 22, 1978 1:30 PM .X 142 5 192 192 5 192 192 5 192 192 5 192 2952 5 192 142 6 192 162 6 192 162 6 192 163 6 192 163 6 192 192 6 192 192 6 192 2185 6 192 2727 6 192 .I 193 .T A Start at Automatic Storage Assignment .B CACM May, 1960 .A Patrick, R. L. .N CA600504 JB March 22, 1978 1:31 PM .X 193 5 193 193 5 193 193 5 193 .I 194 .T Divisionless Computation of Square Roots Through Continued Squaring .B CACM May, 1960 .A Sarafyan, D. .N CA600503 JB March 22, 1978 1:32 PM .X 194 5 194 194 5 194 194 5 194 .I 195 .T What is a Code? .B CACM May, 1960 .A Patterson, G. W. .N CA600502 JB March 22, 1978 1:33 PM .X 195 5 195 195 5 195 195 5 195 .I 196 .T Report on the Algorithmic Language ALGOL 60 .A Naur, P. Backus, J. .B CACM May, 1960 .N CA600501 JB March 22, 1978 1:34 PM .X 123 5 196 140 5 196 196 5 196 196 5 196 196 5 196 919 5 196 989 5 196 1102 5 196 1109 5 196 1140 5 196 1188 5 196 1306 5 196 249 5 196 254 5 196 272 5 196 1464 5 196 1491 5 196 1767 5 196 1781 5 196 1787 5 196 1949 5 196 321 5 196 2059 5 196 2126 5 196 2732 5 196 435 5 196 437 5 196 463 5 196 483 5 196 491 5 196 560 5 196 583 5 196 3073 5 196 627 5 196 631 5 196 632 5 196 642 5 196 644 5 196 653 5 196 680 5 196 761 5 196 762 5 196 763 5 196 1 6 196 1 6 196 823 6 196 106 6 196 123 6 196 152 6 196 165 6 196 168 6 196 185 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 196 6 196 919 6 196 946 6 196 947 6 196 990 6 196 1007 6 196 1046 6 196 1131 6 196 1139 6 196 1140 6 196 1140 6 196 1141 6 196 1149 6 196 1198 6 196 1215 6 196 1215 6 196 1223 6 196 1265 6 196 1303 6 196 1303 6 196 1323 6 196 1358 6 196 1366 6 196 1421 6 196 1460 6 196 1462 6 196 1463 6 196 1467 6 196 1467 6 196 1468 6 196 1468 6 196 1477 6 196 1491 6 196 1491 6 196 1496 6 196 1496 6 196 1496 6 196 1531 6 196 1535 6 196 1565 6 196 1601 6 196 1602 6 196 1613 6 196 1614 6 196 1614 6 196 1626 6 196 1641 6 196 1693 6 196 1781 6 196 1787 6 196 1788 6 196 205 6 196 206 6 196 207 6 196 209 6 196 210 6 196 210 6 196 1834 6 196 224 6 196 224 6 196 224 6 196 249 6 196 249 6 196 271 6 196 288 6 196 288 6 196 303 6 196 316 6 196 321 6 196 381 6 196 387 6 196 398 6 196 11 6 196 46 6 196 51 6 196 2732 6 196 400 6 196 401 6 196 402 6 196 404 6 196 404 6 196 404 6 196 404 6 196 404 6 196 404 6 196 404 6 196 406 6 196 410 6 196 412 6 196 463 6 196 463 6 196 464 6 196 483 6 196 483 6 196 483 6 196 3184 6 196 3184 6 196 3184 6 196 3184 6 196 3184 6 196 3188 6 196 584 6 196 600 6 196 615 6 196 631 6 196 642 6 196 680 6 196 691 6 196 729 6 196 763 6 196 763 6 196 799 6 196 799 6 196 799 6 196 .I 197 .T An Imaginary Number System .B CACM April, 1960 .A Knuth, D. E. .N CA600414 JB March 22, 1978 1:35 PM .X 197 5 197 197 5 197 197 5 197 .I 198 .T A High-Speed Multiplication Process for Digital Computers .B CACM April, 1960 .A Gurzi, F. .N CA600413 JB March 22, 1978 1:36 PM .X 198 5 198 198 5 198 198 5 198 .I 199 .T Euclidian Algorithm (Algorithm 7) .B CACM April, 1960 .A Claussen, R. .N CA600412 JB March 22, 1978 1:37 PM .X 199 5 199 199 5 199 199 5 199 .I 200 .T Bessel Function I, Asymptotic Expansion (Algorithm 6) .B CACM April, 1960 .A Clarke, D. S. .N CA600411 JB March 22, 1978 1:39 PM .X 200 5 200 200 5 200 200 5 200 .I 201 .T Bessel Funtion I, Series Expansion (Algorithm 5) .B CACM April, 1960 .A Clarke, D. S. .N CA600410 JB March 22, 1978 1:40 PM .X 201 5 201 201 5 201 201 5 201 .I 202 .T A Control System For Logical Block Diagnosis With Data Loading .W This paper describes a section of an integrated diagnostic monitor system which facilitates the checking of sections of instructions or subroutines anywhere in the object program. A new method of specifying all diagnostic operations in a format similar to a computer program makes the system convenient to use and relatively simple to understand. The paper also describes a number of other novel diagnostic features which can be included in the system. .B CACM April, 1960 .A Senko, M. E. .N CA600409 JB March 22, 1978 1:45 PM .X 931 5 202 202 5 202 202 5 202 202 5 202 202 6 202 396 6 202 634 6 202 .I 203 .T Decoding Combinations of the First n Integers Taken k at a Time .B CACM April, 1960 .A Brown, R. M. .N CA600408 JB March 22, 1978 1:46 PM .X 203 5 203 203 5 203 203 5 203 2690 5 203 203 6 203 579 6 203 .I 204 .T Proving Theorems by Pattern Recognition I .B CACM April, 1960 .A Wang, H. .N CA600407 JB March 22, 1978 1:47 PM .X 204 4 204 204 5 204 204 5 204 204 5 204 3194 5 204 .I 205 .T Macro Instruction Extensions of Compiler Languages .W Macroinstruction compilers constructed from a small set of functions can be made extremely powerful. In particular, conditional assembly, nested definitions, and parenthetical notation serve to make a compiler capable of accepting very general extensions to its ground language. .B CACM April, 1960 .A McIlroy, M. D. .N CA600406 JB March 22, 1978 1:49 PM .X 205 4 205 205 4 205 210 4 205 214 4 205 1982 4 205 398 4 205 642 4 205 669 4 205 100 4 205 123 4 205 164 4 205 1 5 205 205 5 205 205 5 205 205 5 205 1358 5 205 1565 5 205 1781 5 205 1788 5 205 43 5 205 123 6 205 196 6 205 919 6 205 990 6 205 1006 6 205 1007 6 205 1007 6 205 1046 6 205 1131 6 205 1139 6 205 1140 6 205 1149 6 205 1162 6 205 1198 6 205 1215 6 205 1223 6 205 1265 6 205 1303 6 205 1323 6 205 1358 6 205 1358 6 205 1366 6 205 1421 6 205 1455 6 205 1460 6 205 1460 6 205 1462 6 205 1463 6 205 1467 6 205 1468 6 205 1477 6 205 1491 6 205 1496 6 205 1531 6 205 1535 6 205 1565 6 205 1601 6 205 1602 6 205 1613 6 205 1614 6 205 1626 6 205 1641 6 205 1787 6 205 1788 6 205 205 6 205 205 6 205 205 6 205 205 6 205 224 6 205 249 6 205 288 6 205 316 6 205 381 6 205 398 6 205 11 6 205 404 6 205 410 6 205 463 6 205 464 6 205 483 6 205 3184 6 205 3184 6 205 3188 6 205 3189 6 205 584 6 205 600 6 205 680 6 205 691 6 205 729 6 205 763 6 205 799 6 205 799 6 205 .I 206 .T Symbol Manipulation in XTRAN .B CACM April, 1960 .A Green, J. .N CA600405 JB March 22, 1978 1:50 PM .X 206 4 206 207 4 206 206 5 206 206 5 206 206 5 206 64 5 206 644 5 206 196 6 206 206 6 206 207 6 206 .I 207 .T Syntactic and Semantic Augments to ALGOL .B CACM April, 1960 .A Smith, J. W. .N CA600404 JB March 22, 1978 1:54 PM .X 206 4 207 207 4 207 207 5 207 207 5 207 207 5 207 64 5 207 644 5 207 196 6 207 206 6 207 207 6 207 .I 208 .T An Introduction to Information Processing Language V .B CACM April, 1960 .A Newell, A. Tonge, F. M. .N CA600403 JB March 22, 1978 1:55 PM .X 208 5 208 208 5 208 208 5 208 378 5 208 208 6 208 209 6 208 210 6 208 .I 209 .T Symbol Manipulation by Threaded Lists .B CACM April, 1960 .A Perlis, A. J. Thornton, C. .N CA600402 JB March 22, 1978 1:56 PM .X 1050 5 209 1102 5 209 209 5 209 209 5 209 209 5 209 378 5 209 3008 5 209 731 5 209 798 5 209 849 6 209 106 6 209 196 6 209 208 6 209 209 6 209 209 6 209 209 6 209 209 6 209 209 6 209 209 6 209 210 6 209 210 6 209 367 6 209 406 6 209 483 6 209 627 6 209 627 6 209 .I 210 .T Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I .B CACM April, 1960 .A McCarthy, J. .N CA600401 JB March 22, 1978 1:57 PM .X 205 4 210 210 4 210 214 4 210 1982 4 210 398 4 210 642 4 210 669 4 210 100 4 210 123 4 210 164 4 210 106 5 210 1 5 210 1024 5 210 1051 5 210 1102 5 210 1132 5 210 210 5 210 210 5 210 210 5 210 1390 5 210 1486 5 210 1549 5 210 1706 5 210 1826 5 210 1878 5 210 378 5 210 2060 5 210 2155 5 210 2168 5 210 2719 5 210 2723 5 210 2838 5 210 2842 5 210 2855 5 210 2879 5 210 3077 5 210 3080 5 210 3106 5 210 627 5 210 106 6 210 106 6 210 196 6 210 196 6 210 1051 6 210 1180 6 210 1303 6 210 1380 6 210 1389 6 210 1421 6 210 1469 6 210 1477 6 210 1491 6 210 1549 6 210 1549 6 210 1549 6 210 1626 6 210 1626 6 210 1626 6 210 1749 6 210 208 6 210 209 6 210 209 6 210 1826 6 210 1826 6 210 1826 6 210 210 6 210 210 6 210 210 6 210 210 6 210 210 6 210 210 6 210 210 6 210 210 6 210 210 6 210 210 6 210 210 6 210 210 6 210 210 6 210 210 6 210 210 6 210 210 6 210 210 6 210 210 6 210 210 6 210 210 6 210 210 6 210 210 6 210 210 6 210 210 6 210 210 6 210 1834 6 210 1869 6 210 1878 6 210 1972 6 210 1972 6 210 378 6 210 378 6 210 2046 6 210 2060 6 210 2060 6 210 2060 6 210 2110 6 210 2148 6 210 2151 6 210 2167 6 210 2192 6 210 2210 6 210 2457 6 210 2513 6 210 2645 6 210 2651 6 210 2657 6 210 2665 6 210 2723 6 210 2766 6 210 2766 6 210 2833 6 210 2850 6 210 2855 6 210 2954 6 210 2998 6 210 2998 6 210 406 6 210 406 6 210 406 6 210 483 6 210 3184 6 210 3184 6 210 627 6 210 627 6 210 731 6 210 731 6 210 731 6 210 731 6 210 731 6 210 731 6 210 753 6 210 793 6 210 794 6 210 .I 211 .T Share Standard Flow Chart Symbols .B CACM March, 1960 .A Grems, M. .N CA600307 JB March 22, 1978 1:58 PM .X 211 5 211 211 5 211 211 5 211 .I 212 .T Bisection Routine (Algorithm 4) .B CACM March, 1960 .A Gorn,S. .N CA600306 JB March 22, 1978 1:59 PM .X 212 5 212 212 5 212 212 5 212 .I 213 .T Numerical Inversion of Laplace Transforms .B CACM March, 1960 .A Schmittroth, L. A. .N CA600305 JB March 22, 1978 2:00 PM .X 213 5 213 213 5 213 213 5 213 .I 214 .T An Algorithm Defining ALGOL Assignment Statements .B CACM March, 1960 .A Floyd, R. W. .N CA600304 JB March 22, 1978 2:01 PM .X 205 4 214 210 4 214 214 4 214 214 4 214 214 4 214 1593 4 214 1982 4 214 398 4 214 642 4 214 669 4 214 100 4 214 123 4 214 164 4 214 1 5 214 214 5 214 214 5 214 214 5 214 53 5 214 91 5 214 .I 215 .T The Execute Operations-A Fourth Mode of Instruction Sequencing .B CACM March, 1960 .A Brooks, F. P. .N CA600303 JB March 22, 1978 2:02 PM .X 215 4 215 215 5 215 215 5 215 215 5 215 58 5 215 .I 216 .T A Note on the Use of the Abacus in Number Conversion .B CACM March, 1960 .A Kanner, H. .N CA600302 JB March 22, 1978 2:03 PM .X 216 5 216 216 5 216 216 5 216 .I 217 .T Soviet Computer Technology-1959 .B CACM March, 1960 .N CA600301 JB March 22, 1978 2:04 PM .X 217 5 217 217 5 217 217 5 217 323 5 217 689 5 217 217 6 217 217 6 217 323 6 217 3197 6 217 .I 218 .T Computer Preparation of a Poetry Concordance .B CACM February, 1960 .A Painter, J. A. .N CA600214 JB March 22, 1978 2:05 PM .X 218 5 218 218 5 218 218 5 218 .I 219 .T Marriage-with Problems .B CACM February, 1960 .A Shuchter, J. P. .N CA600213 JB March 22, 1978 2:06 PM .X 219 5 219 219 5 219 219 5 219 .I 220 .T A New Method of Computation of Square Roots Without Using Division .B CACM February, 1960 .A Traub, J. F. .N CA600212 JB March 22, 1978 2:08 PM .X 220 5 220 220 5 220 220 5 220 .I 221 .T The Basic Side of Tape Labeling .B CACM February, 1960 .A Logan, W. A. .N CA600211 JB March 22, 1978 2:09 PM .X 121 5 221 221 5 221 221 5 221 221 5 221 221 6 221 .I 222 .T Coding Isomorphisms .W The coding of external symbols into symbols internal to a compute can sometimes be carried out in such a way that relevant informational properties are preserved, but in a form much more easily dealt with. A case in point is presented. .B CACM February, 1960 .A Lynch, W. C. .N CA600210 JB March 22, 1978 2:12 PM .X 222 4 222 222 4 222 364 4 222 799 4 222 222 5 222 222 5 222 222 5 222 44 5 222 82 5 222 .I 223 .T Selfcipher: Programming .B CACM February, 1960 .A Pelta, H. N. .N CA600209 JB March 22, 1978 2:13 PM .X 223 5 223 223 5 223 223 5 223 .I 224 .T Sequential Formula Translation .W The syntax of an algorithmic language such as ALGOL is conveniently described as a sequence of states indicated by an element called cellar. Transitions are controlled by admissible state-symbol pairs which may be represented by a transition matrix. This description of syntax furnishes at the same time an extremely simple rule for translating into machine programs statements in the algorithmic language. Sequential treatment, however, is not feasible in the case of certain optimizing processes such as recursive address calculation. .B CACM February, 1960 .A Samelson, K. Bauer, F. L. .N CA600208 JB March 22, 1978 2:17 PM .X 224 4 224 364 4 224 1139 5 224 1141 5 224 1215 5 224 1223 5 224 224 5 224 224 5 224 224 5 224 267 5 224 1647 5 224 1781 5 224 1787 5 224 1792 5 224 364 5 224 405 5 224 438 5 224 98 5 224 763 5 224 100 6 224 123 6 224 196 6 224 196 6 224 196 6 224 919 6 224 990 6 224 1007 6 224 1025 6 224 1046 6 224 1131 6 224 1139 6 224 1140 6 224 1141 6 224 1149 6 224 1179 6 224 1198 6 224 1215 6 224 1215 6 224 1223 6 224 1265 6 224 1303 6 224 1323 6 224 1358 6 224 1366 6 224 1421 6 224 1460 6 224 1462 6 224 1463 6 224 1467 6 224 1468 6 224 1477 6 224 1491 6 224 1491 6 224 1496 6 224 1496 6 224 1531 6 224 1535 6 224 1565 6 224 1601 6 224 1602 6 224 1605 6 224 1613 6 224 1614 6 224 1626 6 224 1641 6 224 1781 6 224 1787 6 224 1788 6 224 205 6 224 224 6 224 224 6 224 224 6 224 224 6 224 224 6 224 224 6 224 224 6 224 224 6 224 224 6 224 224 6 224 224 6 224 224 6 224 224 6 224 249 6 224 249 6 224 288 6 224 303 6 224 316 6 224 381 6 224 398 6 224 399 6 224 11 6 224 44 6 224 55 6 224 77 6 224 77 6 224 77 6 224 77 6 224 93 6 224 98 6 224 404 6 224 404 6 224 404 6 224 405 6 224 410 6 224 412 6 224 438 6 224 463 6 224 464 6 224 464 6 224 483 6 224 3184 6 224 3188 6 224 584 6 224 600 6 224 631 6 224 631 6 224 680 6 224 691 6 224 763 6 224 763 6 224 763 6 224 799 6 224 799 6 224 .I 225 .T A Techniquefor Handling Macro Instructions (Corrigendum) .B CACM February, 1960 .A Greenwald, I. D. .N CA600207 JB March 22, 1978 2:18 PM .X 225 5 225 225 5 225 225 5 225 .I 226 .T Solution of Polynomial Equation by Bairstow-Hitchcock Method (Algorithm 3) .B CACM February, 1960 .A Grau, A. A. .N CA600206 JB March 22, 1978 2:20 PM .X 226 5 226 226 5 226 226 5 226 .I 227 .T ROOTFINDER (Algorithm 2) .B CACM February, 1960 .A Wegstein, J. .N CA600205 JB March 22, 1978 2:20 PM .X 227 5 227 227 5 227 227 5 227 .I 228 .T QUADI (Algorithm 1) .B CACM February, 1960 .A Herbold, R. J. .N CA600204 JB March 22, 1978 2:21 PM .X 228 5 228 228 5 228 228 5 228 .I 229 .T A Terminology Proposal .B CACM February, 1960 .A Gruenberger, F. .N CA600203 JB March 22, 1978 2:24 PM .X 229 5 229 229 5 229 229 5 229 .I 230 .T A Proposal for Character Code Compatibility .B CACM February, 1960 .A Bemer, R. W. .N CA600202 JB March 22, 1978 2:25 PM .X 230 5 230 230 5 230 230 5 230 333 5 230 230 6 230 .I 231 .T A Proposal for a Set of Publication Standards for Use by the ACM .B CACM February, 1960 .A Kent, E. R. .N CA600201 JB March 22, 1978 2:26 PM .X 231 5 231 231 5 231 231 5 231 .I 232 .T A High-Speed Sorting Procedure .B CACM January, 1960 .A Frank, R. M. Lazarus, R. B. .N CA600104 JB March 22, 1978 2:27 PM .X 232 5 232 232 5 232 232 5 232 852 5 232 864 5 232 232 6 232 232 6 232 309 6 232 74 6 232 74 6 232 .I 233 .T Abstracts-Additional Nuclear Reactor Codes .B CACM January, 1960 .A Nather, V. Sangren, W. .N CA600103 JB March 22, 1978 2:29 PM .X 233 5 233 233 5 233 233 5 233 .I 234 .T A SAP-Like Assembly Program for the IBM 650 .B CACM January, 1960 .A Speckhard, A. E. .N CA600102JB March 22, 1978 2:30 PM .X 234 5 234 234 5 234 234 5 234 .I 235 .T Two Think Pieces .B CACM January, 1960 .A Bagley, P. R. .N CA600101 JB March 22, 1978 2:30 PM .X 235 5 235 235 5 235 235 5 235 .I 236 .T Soviet Cybernetics and Computer .W This article records observations on Soviet research and technology in cybernetics and computer science, made by the author during a visit to the Soviet Union as a delegate to the IFAC Congress on Automatic Control held in Moscow in the summer of 1960. .B CACM December, 1961 .A Feigenbaum, E. A. .N CA611214 JB March 15, 1978 10:06 PM .X 1349 5 236 236 5 236 236 5 236 236 5 236 236 6 236 323 6 236 83 6 236 415 6 236 .I 237 .T Computer Production of Peek-A-Boo Sheets .B CACM December, 1961 .A Robbins, D. .N CA611213 JB March 15, 1978 10:07 PM .X 237 5 237 237 5 237 237 5 237 .I 238 .T Simulation and Analysis of Biochemical Systems .B CACM December, 1961 .A Garfinkel, D. Rutledge, J. D. Higgins, J. J. .N CA611212 JB March 15, 1978 10:09 PM .X 238 4 238 238 4 238 633 4 238 643 4 238 238 5 238 238 5 238 238 5 238 633 5 238 643 5 238 238 6 238 238 6 238 633 6 238 643 6 238 .I 239 .T Inefficiency of the Use of Boolean Functions for Information Retrieval Systems .B CACM December, 1961 .A Verhoeff, J. Goffman, W. Belzer, J. .N CA611211 JB March 15, 1978 10:10 PM .X 239 5 239 239 5 239 239 5 239 .I 240 .T Processing Magnetic Tape Files with Variable Blocks .B CACM December, 1961 .A Graham, J. W. Sprott, D. A. .N CA611210 JB March 15, 1978 10:11 PM .X 240 5 240 240 5 240 240 5 240 .I 241 .T Machine Calculation of Moments of a Probability Distribution .W A method is presented for the calculation on a machine of the moments of a probability distribution, necessitating little more than n additions and n references to memory for each moment, instead of the minimum of n multiplication, 2n additions, and 2n references to memory required by the most straightforward method (where n is the number of entries in the probability distribution). The method is directly applicable when a tabulated distribution exists, as when it has been computed by repeated convolution; but in this case it conserves both time and accuracy. .B CACM December, 1961 .A Lechner, J. A. .N CA611209 JB March 15, 1978 10:15 PM .X 241 5 241 241 5 241 241 5 241 .I 242 .T Notes on Geometric Weighted Check Digit Verification .W This note describes a method for utilizing geometric weight modulus 11 checking digits on a computer which does not have either multiplication or division. In addition some attempt has been made to show some limitations of this system. .B CACM December, 1961 .A Wilson, J. G. .N CA611208 JB March 15, 1978 10:17 PM .X 242 5 242 242 5 242 242 5 242 .I 243 .T N-Dimensional Codes for Detecting and Correcting Multiple Errors .W The paper introduces a new family of codes for detecting and correcting multiple errors in a binary-coded message. The message itself is arranged (conceptually) into a multidimensional rectangular array. The processes of encoding and error detection are based upon parity evaluations along prescribed dimensions of the array. Effectiveness of the codes is increased by introducing a "system check bit", which is essentially a parity check on the other parity bits. Only three-dimensional codes are discussed in this paper with parity evaluations along the horizontal, the vertical, and one main diagonal. However, the family of codes is not restricted to three dimensions, as evidenced by the discussion by Minnick and Ashenhurst on a similar multidimensional single-bit selection plan used for another purpose [6]. A four-dimensional code, correcting three and detecting four errors, has been developed; the extension to higher-dimensional codes with greater correction power is straightforward. .B CACM December, 1961 .A Rubinoff, M. .N CA611207 JB March 15, 1978 10:23 PM .X 243 5 243 243 5 243 243 5 243 .I 244 .T Incomplete Elliptic Integrals (Algorithm 73) .B CACM December, 1961 .A Kriebel, D. C. .N CA611206 JB March 15, 1978 10:24 PM .X 244 5 244 244 5 244 244 5 244 .I 245 .T A Set of Associate Legendre Polynomials of the Second Kind (Algorithm 62) .B CACM December, 1961 .A Herndon, J. R. .N CA611205 JB March 15, 1978 10:25 PM .X 1222 5 245 245 5 245 245 5 245 245 5 245 1130 6 245 245 6 245 310 6 245 .I 246 .T Least-Squares Fit by Orthogonal Polynomials (Algorithm 28) .B CACM December, 1961 .A MacMillan, D. B. .N CA611204 JB March 15, 1978 10:27 PM .X 246 5 246 246 5 246 246 5 246 .I 247 .T Incomplete Elliptic Integrals (Algorithm 73) .B CACM December, 1961 .A Jefferson, D. K. .N CA611203 JB March 15, 1978 10:27 PM .X 247 5 247 247 5 247 247 5 247 .I 248 .T What is Proprietary In Mathematical Programming?-Impressions of a Panel Discussion .W A panel discussion on "What is Proprietary in Mathematical Programming?" was sponsored by the Special Interest Committee on Mathematical Programming of the ACM during a Hall of Discussion/on September 7th at the 16th National ACM meeting in Los Angeles. This note consists solely of the impressions garnered by the moderator of the panel and does not necessarily represent the position of any of the panelists or other participants in the discussion. .B CACM December, 1961 .A Smith, L. W. .N CA611202 JB March 15, 1978 10:31 PM .X 248 5 248 248 5 248 248 5 248 .I 249 .T Specification Languages for Mechanical Languages and Their Processors*-A Baker's Dozen .B CACM December, 1961 .A Gorn, S. .N CA611201 JB March 15, 1978 10:32 PM .X 249 4 249 249 4 249 249 4 249 254 4 249 272 4 249 1102 4 249 1109 4 249 1140 4 249 1188 4 249 1306 4 249 1464 4 249 1491 4 249 1767 4 249 1781 4 249 1787 4 249 1949 4 249 321 4 249 2059 4 249 2126 4 249 435 4 249 437 4 249 438 4 249 463 4 249 483 4 249 491 4 249 2732 4 249 560 4 249 583 4 249 3073 4 249 3185 4 249 627 4 249 631 4 249 632 4 249 642 4 249 644 4 249 653 4 249 680 4 249 761 4 249 762 4 249 763 4 249 123 4 249 140 4 249 919 4 249 989 4 249 196 5 249 249 5 249 249 5 249 249 5 249 1425 5 249 1781 5 249 303 5 249 438 5 249 51 5 249 762 5 249 123 6 249 196 6 249 196 6 249 919 6 249 990 6 249 1007 6 249 1046 6 249 1131 6 249 1139 6 249 1140 6 249 1149 6 249 1198 6 249 1215 6 249 1223 6 249 1265 6 249 1303 6 249 1323 6 249 1358 6 249 1366 6 249 1421 6 249 1460 6 249 1462 6 249 1463 6 249 1467 6 249 1468 6 249 1477 6 249 1491 6 249 1496 6 249 1531 6 249 1535 6 249 1565 6 249 1601 6 249 1602 6 249 1613 6 249 1614 6 249 1626 6 249 1641 6 249 1787 6 249 1788 6 249 205 6 249 224 6 249 224 6 249 249 6 249 249 6 249 249 6 249 249 6 249 288 6 249 303 6 249 316 6 249 381 6 249 398 6 249 11 6 249 77 6 249 404 6 249 410 6 249 463 6 249 464 6 249 483 6 249 483 6 249 3184 6 249 3188 6 249 584 6 249 600 6 249 680 6 249 691 6 249 763 6 249 799 6 249 .I 250 .T An Engineering Application of Logic-Structure Tables .B CACM November, 1961 .A Nickerson, R. C. .N CA611118 JB March 15, 1978 10:34 PM .X 250 4 250 1237 4 250 1237 5 250 250 5 250 250 5 250 250 5 250 320 5 250 2220 5 250 753 5 250 1172 6 250 1237 6 250 1327 6 250 1354 6 250 1489 6 250 1548 6 250 250 6 250 250 6 250 250 6 250 320 6 250 753 6 250 .I 251 .T Ballistic Cam Design .W This paper presents a digital computer program for the rapid calculation of manufacturing data essential to the design of preproduction cams which are utilized in ballistic computers of tank fire control systems. The cam profile generated introduces the superelevation angle required by tank main armament for a particular type ammunition. .B CACM November, 1961 .A Archambault, M. .N CA611117 JB March 15, 1978 10:37 PM .X 251 5 251 251 5 251 251 5 251 .I 252 .T Programming a Duplex Computer System .W This paper describes a method of duplex-computer programming that has been used with two computers in a military defense system. The method combines special programs with a basic data processing program package. The duplex operation gives the system greater reliability. After achieving the required level of integration, both computers do similar processing on the same inputs and continually cross-check the intermediate and final results. .B CACM November, 1961 .A Dow, J. .N CA611116 JB March 15, 1978 10:40 PM .X 252 5 252 252 5 252 252 5 252 .I 253 .T On a Program for Ray-Chaudhuri's Algorithm for a Minimum Cover of an Abstract Complex .B CACM November, 1961 .A Foata, D. C. .N CA611115 JB March 15, 1978 10:41 PM .X 253 5 253 253 5 253 253 5 253 .I 254 .T SMALGOL-61 .W Prior to and during the 1961 Western Joint Computer Conference, several people in the Joint Users Groups had expressed interest in defining a "smalgol" language. This is to be an ALGOL language for use with compilers on relatively small size computers. A preliminary report resulted. At the ACM National Conference four months later, after considering several counter proposals, a final version was agreed upon by a subcommittee. The recommendations of the Subcommittee for a standard subset of ALGOL 60 for use on small computers is presented here. .B CACM November, 1961 .A Bachelork, G. A. Dempster, J. R. H. Knuth, D. E. Speroni, J. .N CA611114 JB March 15, 1978 10:44 PM .X 249 4 254 254 4 254 254 4 254 254 4 254 272 4 254 1102 4 254 1109 4 254 1140 4 254 1188 4 254 1234 4 254 1306 4 254 1464 4 254 1491 4 254 1767 4 254 1781 4 254 1787 4 254 1949 4 254 321 4 254 2059 4 254 2126 4 254 435 4 254 437 4 254 463 4 254 483 4 254 491 4 254 2732 4 254 560 4 254 583 4 254 3073 4 254 627 4 254 631 4 254 632 4 254 642 4 254 644 4 254 653 4 254 680 4 254 761 4 254 762 4 254 763 4 254 123 4 254 140 4 254 919 4 254 989 4 254 196 5 254 254 5 254 254 5 254 254 5 254 321 5 254 387 5 254 794 5 254 254 6 254 .I 255 .T Augmentation (Algorithm 68) .B CACM November, 1961 .A Breed, L. M. .N CA611113 JB March 15, 1978 10:45 PM .X 255 5 255 255 5 255 255 5 255 .I 256 .T A Set of Test Matrices (Algorithm 52) .B CACM November, 1961 .A Dubay, G. H. .N CA611112 JB March 15, 1978 10:46 PM .X 256 5 256 256 5 256 256 5 256 .I 257 .T Invert (Algorithm 42) .B CACM November, 1961 .A Knapp, A. W. Shaman, P. .N CA611111 JB March 15, 1978 10:47 PM .X 257 5 257 257 5 257 257 5 257 .I 258 .T Composition Generator (Algorithm 72) .B CACM November, 1961 .A Hellerman, O. Ogden, S. .N CA611110 JB March 15, 1978 10:48 PM .X 258 5 258 258 5 258 258 5 258 .I 259 .T Permutation (Algorithm 71) .B CACM November, 1961 .A Coveyou, R. R. Sullivan, J. G. .N CA611109 JB March 15, 1978 10:52 PM .X 259 5 259 259 5 259 259 5 259 .I 260 .T Interpolation By Aitken (Algorithm 70) .B CACM November, 1961 .A Mifsud, C. J. .N CA611108 JB March 15, 1978 10:53 PM .X 260 5 260 260 5 260 260 5 260 .I 261 .T Tape Splitting .B CACM November, 1961 .A Moore, D. P. .N CA611107 JB March 15, 1978 10:54 PM .X 261 5 261 261 5 261 261 5 261 .I 262 .T MAP .B CACM November, 1961 .A Moore, C. L. Ruwe, M. L. .N CA611106 JB March 15, 1978 10:54 PM .X 262 5 262 262 5 262 262 5 262 .I 263 .T Library Loading with Alternate Routine Selection .B CACM November, 1961 .A Moore, D. P. .N CA611105 JB March 15, 1978 10:55 PM .X 263 5 263 263 5 263 263 5 263 .I 264 .T A Generalized Polyphase Merge Algorithm .B CACM November, 1961 .A Reynolds, S. W. .N CA611104 JB March 15, 1978 10:56 PM .X 264 5 264 264 5 264 264 5 264 479 5 264 264 6 264 299 6 264 .I 265 .T Low Level Language Subroutines for Use Within Fortran .W This paper describes some subroutines, coded in symbolic languages and for use within Fortran coded programs, to deal with "special arithmetic" (e.g. multi-precision arithmetic), symbol manipulation, bit manipulation and expanded character set input-output, and visual display. .B CACM November, 1961 .A Barnett, M. P. .N CA611103 JB March 15, 1978 10:59 PM .X 265 5 265 265 5 265 265 5 265 464 5 265 720 5 265 265 6 265 265 6 265 404 6 265 464 6 265 474 6 265 .I 266 .T Fitting Spheres by the Method of Least Squares .B CACM November, 1961 .A Robinson, S. M. .N CA611102 JB March 15, 1978 11:00 PM .X 266 5 266 266 5 266 266 5 266 .I 267 .T Some Proposals for Improving the Efficiency of ALGOL 60 .B CACM November, 1961 .A Wilkes, M. V. .N CA611101 JB March 15,1978 11:01 PM .X 267 4 267 1139 4 267 1141 4 267 1215 4 267 1223 4 267 1647 4 267 1781 4 267 1787 4 267 1792 4 267 364 4 267 405 4 267 438 4 267 763 4 267 1323 5 267 224 5 267 267 5 267 267 5 267 267 5 267 267 6 267 3184 6 267 799 6 267 .I 268 .T Stochastic Evaluation of a Static Storage Allocation .B CACM October, 1961 .A Cohen, L. J. .N CA611013 JB March 16, 1978 12:48 PM .X 268 5 268 268 5 268 268 5 268 .I 269 .T Core Allocation Based on Probability .B CACM October, 1961 .A Riskin, B. N. .N CA611012 JB March 16, 1978 12:49 PM .X 269 5 269 269 5 269 269 5 269 .I 270 .T Techniques for Storage Allocation Algorithms .B CACM October, 1961 .A Kelley Jr., J. E. .N CA611011 JB March 16, 1978 12:50 PM .X 270 5 270 270 5 270 270 5 270 678 5 270 270 6 270 .I 271 .T A Semi-Automatic Storage Allocation System at Loading Time .B CACM October, 1961 .A Heising, W. P. Larner, R. A. .N CA611010 JB March 16, 1978 12:51 PM .X 972 5 271 271 5 271 271 5 271 271 5 271 1774 5 271 560 5 271 800 6 271 196 6 271 1173 6 271 271 6 271 271 6 271 271 6 271 273 6 271 276 6 271 .I 272 .T A Storage Allocation Scheme for ALGOL 60 .W A storage allocation scheme for a machine with a 2048 instruction core store and a magnetic drum is described. The use of the drum for storing program blocks and/or data must be directed by the programmer through auxiliary information in the ALGOL program. The administrative routines controlling the storage at run time are described in full. A detailed example is given. .B CACM October, 1961 .A Jensen, J. Mondrup, P. Naur, P. .N CA611009 JB March 16, 1978 12:54 PM .X 249 4 272 254 4 272 272 4 272 1102 4 272 1109 4 272 1140 4 272 1188 4 272 1306 4 272 1464 4 272 1491 4 272 1767 4 272 1781 4 272 1787 4 272 1949 4 272 321 4 272 2059 4 272 2126 4 272 435 4 272 437 4 272 463 4 272 483 4 272 491 4 272 2732 4 272 560 4 272 583 4 272 3073 4 272 627 4 272 631 4 272 632 4 272 642 4 272 644 4 272 653 4 272 680 4 272 761 4 272 762 4 272 763 4 272 123 4 272 140 4 272 919 4 272 989 4 272 196 5 272 272 5 272 272 5 272 272 5 272 .I 273 .T Experience in Automatic Storage Allocation .B CACM October, 1961 .A Collins Jr., G. O. .N CA611008 JB March 16, 1978 12:55 PM .X 972 5 273 273 5 273 273 5 273 273 5 273 2911 5 273 1879 6 273 271 6 273 273 6 273 273 6 273 276 6 273 2435 6 273 2498 6 273 2734 6 273 2773 6 273 2983 6 273 .I 274 .T Dynamic Storage Allocation in the Atlas Computer, Including an Automatic Use of a Backing Store .B CACM October, 1961 .A Fotheringham, J. .N CA611007 JB March 16, 1978 12:57 PM .X 274 5 274 274 5 274 274 5 274 1754 5 274 2358 5 274 488 5 274 1746 6 274 1751 6 274 1753 6 274 274 6 274 274 6 274 274 6 274 376 6 274 .I 275 .T Dynamic Storage Allocation for an Information Retrieval System .B CACM October, 1961 .A Sams, B. H. .N CA611006 JB March 16, 1978 12:58 PM .X 275 5 275 275 5 275 275 5 275 .I 276 .T Program Organization and Record Keeping for Dynamic Storage Allocation .W The material presented in this paper is part of the design plan of the core allocation portion of the ASCII-MATIC Programming System. Project ASCII-MATIC is concerned with the application of computer techniques to the activities of certain headquarters military intelligence operations of the U.S. Army. .B CACM October, 1961 .A Holt, A. W. .N CA611005 JB March 16, 1978 1:02 PM .X 972 5 276 276 5 276 276 5 276 276 5 276 1471 5 276 800 6 276 271 6 276 273 6 276 276 6 276 276 6 276 .I 277 .T Problems of Storage Allocation in a Multiprocessor Multiprogrammed System .B CACM October, 1961 .A Maher, R. J. .N CA611004 JB March 16, 1978 1:12 PM .X 277 5 277 277 5 277 277 5 277 .I 278 .T A General Formulation of storage Allocation .W Formalization of a general computer storage allocation process is attempted. With a given computer M is associated a fictitious computer M' essentially identical to M except in respect to possession of unbounded primary storage. Mappings of the total storage set (internal and external) of M into the direct address set of M' are introduced. A program sequence P for M' is termed M-admissible (relative to a specific execution time period) if there is a mapping underwhich P and its effective data referents are all located in the direct address set of M. Storage allocation is considered as a process of establishing for an arbitrary M' program a sequence of mappings, a decoupling of the program into M-admissible subprograms and a linking set of interludes. An existence proof in terms of a completely interpretive M program as indicated. Some special cases are discussed. Various restrictions on generality of M' programs are considered under which more practical realization of allocation processes becomes tractable. .B CACM October, 1961 .A Roberts Jr., A. E. .N CA611003 JB March 16, 1978 1:22 PM .X 278 5 278 278 5 278 278 5 278 .I 279 .T The Case for Dynamic storage Allocation .B CACM October, 1961 .A Sams, B. H. .N CA611002 JB March 16, 1978 1:23 PM .X 279 5 279 279 5 279 279 5 279 657 5 279 279 6 279 409 6 279 .I 280 .T A Preplanned Approach to a Storage Allocating Compiler .B CACM October, 1961 .A O'Neil, R. W. .N CA611001 JB March 16, 1978 1:24 PM .X 280 5 280 280 5 280 280 5 280 .I 281 .T Putting a Hex on e^x .W Recent notes on approximate natural antilogy have not considered indirect formulations for describing e^x. In this note we produce a particular family of very fast, high precision and eminently practical exponential evaluation formulas derived from one such formulation. .B CACM October, 1961 .A Feurzeig, W. .N CA610913 JB March 16, 1978 1:27 PM .X 281 5 281 281 5 281 281 5 281 .I 282 .T Optimum Tape-Writing Procedures .W Consider a magnetic tape system with a read check after writing. Where an error occurs in writing a record, a programmed error routine may either bypass some or all of the area on tape or try to rewrite the record on the same area. This paper evaluates these two procedures on the basis of expected loss of computer time and develops a decision rule for selecting the optimum procedure. The rule depends critically on the number of times the tape being written will be used in the future. In the case where the optimum procedure is to bypass an area, a second decision-the size of the area to be bypassed-is necessary. A formula is developed to determine the optimum area to be bypassed for each procedure. .B CACM September, 1961 .A Hutchinson, K. .N CA610912 JB March 16, 1978 1:32 PM .X 282 5 282 282 5 282 282 5 282 .I 283 .T Inversion of a Complex Matrix .B CACM September, 1961 .A Tornheim, L. .N CA610911 JB March 16, 1978 1:44 PM .X 283 5 283 283 5 283 283 5 283 .I 284 .T Manipulation of Algebraic Expressions .W An algorithm for algebraically manipulating expressions of the form SUM{CiPi, i=1,...,n}; has been developed in conjunction with the development of programs for systems analysis problems. This algorithm enablesus to derive over-all system transfer functions from algebraically described block diagrams of any linear continuous multi-loop feedback system. The machine representation of the derived expression, is, by virtue of the algorithm, in a form which simplifies the task of compiling. The algorithm was developed for a particular purpose in connection with system analysis studies. However, its application as a mathematical device extends far beyond the confines of the original problem. .B CACM September, 1961 .A Rom, A. R. M. .N CA610910 JB March 16, 1978 9:36 PM .X 964 5 284 1396 5 284 284 5 284 284 5 284 284 5 284 964 6 284 1028 6 284 1029 6 284 1083 6 284 1132 6 284 1214 6 284 1278 6 284 1334 6 284 1365 6 284 1386 6 284 1387 6 284 1388 6 284 1392 6 284 1393 6 284 1394 6 284 1395 6 284 1396 6 284 1397 6 284 1496 6 284 284 6 284 284 6 284 407 6 284 3199 6 284 3200 6 284 3201 6 284 3202 6 284 3203 6 284 3204 6 284 561 6 284 561 6 284 730 6 284 759 6 284 .I 285 .T Solution of Tridiagonal Matrices .B CACM September, 1961 .A Wenrick, R. C. Houghton, A. V. .N CA610909 JB March 16, 1978 9:39 PM .X 285 5 285 285 5 285 285 5 285 .I 286 .T An Iterative Method for Inversion of Power Series .B CACM September, 1961 .A Bramhall, J. N. .N CA610908 JB March 16, 1978 9:41 PM .X 286 5 286 286 5 286 286 5 286 .I 287 .T The Generalized Important Event Technique .B CACM September, 1961 .A Shapiro, N. Vreenegoor, H. .N CA610907 JB March 16, 1978 9:42 PM .X 287 5 287 287 5 287 287 5 287 .I 288 .T A Syntactical Chart of ALGOL 60 .B CACM September, 1961 .A Taylor, W. Turner, L. Waychoff, R. .N CA610906JB March 16, 1978 9:43 PM .X 989 5 288 288 5 288 288 5 288 288 5 288 1781 5 288 729 5 288 123 6 288 196 6 288 196 6 288 919 6 288 990 6 288 1007 6 288 1046 6 288 1131 6 288 1139 6 288 1140 6 288 1149 6 288 1198 6 288 1215 6 288 1223 6 288 1265 6 288 1303 6 288 1323 6 288 1358 6 288 1366 6 288 1421 6 288 1460 6 288 1462 6 288 1463 6 288 1467 6 288 1468 6 288 1477 6 288 1491 6 288 1496 6 288 1531 6 288 1535 6 288 1565 6 288 1601 6 288 1602 6 288 1613 6 288 1614 6 288 1626 6 288 1641 6 288 1787 6 288 1788 6 288 205 6 288 224 6 288 249 6 288 288 6 288 288 6 288 288 6 288 316 6 288 381 6 288 398 6 288 11 6 288 404 6 288 410 6 288 463 6 288 464 6 288 483 6 288 3184 6 288 3184 6 288 3188 6 288 584 6 288 600 6 288 616 6 288 680 6 288 691 6 288 763 6 288 799 6 288 .I 289 .T Critical Path Scheduling (Algorithm 40) .B CACM September, 1961 .A Alexander, N. P. .N CA610905 JB March 16, 1978 9:44 PM .X 289 5 289 289 5 289 289 5 289 .I 290 .T Chain Tracing (Algorithm 69) .B CACM September, 1961 .A Mayoh, B. H. .N CA610904 JB March 16, 1978 9:45 PM .X 290 5 290 290 5 290 290 5 290 .I 291 .T Use of MOBOL in PreparingRetrieval Programs .B CACM September, 1961 .A Hoffman, J. Opler, A. .N CA610903 JB March 16, 1978 9:50 PM .X 291 5 291 291 5 291 291 5 291 .I 292 .T An Information Retrieval Language for Legal Studies .B CACM September, 1961 .A Kehl, W. B. Horty, J. F. Bacon, C. R. T. Mitchell, D. S. .N CA610902 JB March 16, 1978 9:51 PM .X 292 5 292 292 5 292 292 5 292 .I 293 .T The Applied Mathematics Laboratory of the David W. Taylor Model Basin .B CACM September, 1961 .A Richstone, M. .N CA610901 JB March 16, 1978 10:01 PM .X 293 5 293 293 5 293 293 5 293 .I 294 .T An Imaginary Number System .B CACM August, 1961 .A Knuth, D. .N CA610810 JB March 16, 1978 10:02 PM .X 294 5 294 294 5 294 294 5 294 .I 295 .T Rational Approximations for the Error Function and for Similar Functions .B CACM August, 1961 .A Clendenin, W. W. .N CA610809 JB March 16, 1978 10:03 PM .X 295 5 295 295 5 295 295 5 295 .I 296 .T A Note on Multiple Precision Arithmetic .B CACM August, 1961 .A Cox, A. G. Luther, H. A. .N CA610808 JB March 16, 1978 10:04 PM .X 1393 5 296 296 5 296 296 5 296 296 5 296 106 6 296 296 6 296 731 6 296 .I 297 .T A Note on Fitting Great Circles by Least Squares .B CACM August, 1961 .A Marcus, C. F. .N CA610807 JB March 16, 1978 10:05 PM .X 297 4 297 122 5 297 297 5 297 297 5 297 297 5 297 .I 298 .T A 48-Bit Pseudo-Random Number Generator .W A new 48-bit pseudo-random number generator, suitable for several computers, was tested statistically for randomness to determine its adequacy for use in Monte Carlo programs. Frequency tests, distributions of certain low-order moments, runs up and down, and runs above and below the mean were applied to one-half million generated numbers lying within the interval (0,1) and to three sets of integers obtained from specified bits within the generated numbers. These tests substantiated the randomness of all numbers except for the set of integers coming from the least significant bits. .B CACM August, 1961 .A Kuehn, H. G. .N CA610806 JB March 16, 1978 10:09 PM .X 298 5 298 298 5 298 298 5 298 .I 299 .T A Generalized Polyphase Merge Algorithm .B CACM August, 1961 .A Reynolds, S. W. .N CA610805 JB March 16, 1978 10:10 PM .X 299 5 299 299 5 299 299 5 299 2146 5 299 479 5 299 862 5 299 863 5 299 861 6 299 862 6 299 863 6 299 264 6 299 299 6 299 299 6 299 299 6 299 299 6 299 479 6 299 .I 300 .T COBOL: A Sample Problem .W A simplified Merchandise Control problem has been chosen for presenting COBOL to users and potential users of computing systems. A mythical department store, "E. Language Bros., Inc.", is programming in the COBOL language one of the many runs on its computer. .B CACM August, 1961 .A Mackinson, T. N. .N CA610804 JB March 16, 1978 10:12 PM .X 300 5 300 300 5 300 300 5 300 638 5 300 300 6 300 .I 301 .T A Set of Test Matrices (Algorithm 52) .B CACM August, 1961 .A Gilbert, H. E. .N CA610803 JB March 16, 1978 10:13 PM .X 301 5 301 301 5 301 301 5 301 .I 302 .T Augmentation (Algorithm 68) .B CACM August, 1961 .A Rice, H. G. .N CA610802 JB March 16, 1978 10:14 PM .X 302 5 302 302 5 302 302 5 302 .I 303 .T Some Basic Terminology Connected With Mechanical Languages and Their Processors .W The suggestions in this paper are part of the terminology used in work for the University of Pennsylvania's Office of computer Research and Education. The work is jointly supported by the National Science Foundation and the Air Force Office of Scientific Research. .B CACM August, 1961 .A Gorn, S. .N CA610801 JB March 16, 1978 10:16 PM .X 249 5 303 303 5 303 303 5 303 303 5 303 438 5 303 3185 5 303 196 6 303 224 6 303 249 6 303 303 6 303 303 6 303 303 6 303 51 6 303 77 6 303 438 6 303 .I 304 .T Nth Roots of a Complex Number (Algorithm 53) .B CACM July, 1961 .A Nestor Jr., C. W. .N CA610713 JB March 16, 1978 10:17 PM .X 304 5 304 304 5 304 304 5 304 .I 305 .T CRAM (Algorithm 67) .B CACM July, 1961 .A Caffrey, J. .N CA610712 JB March 16, 1978 10:18 PM .X 305 5 305 305 5 305 305 5 305 .I 306 .T INVRS (Algorithm 66) .B CACM July, 1961 .A Caffery, J. .N CA610711 JB March 16, 1978 10:19 PM .X 306 5 306 306 5 306 306 5 306 .I 307 .T FIND (Algorithm 65) .B CACM July, 1961 .A Hoare, C. A. R. .N CA610710 JB March 16, 1978 10:20 PM .X 307 5 307 307 5 307 307 5 307 2227 5 307 2783 5 307 3054 5 307 1175 6 307 1834 6 307 1880 6 307 1919 6 307 1969 6 307 1980 6 307 1997 6 307 307 6 307 307 6 307 307 6 307 308 6 307 309 6 307 309 6 307 2017 6 307 2679 6 307 776 6 307 .I 308 .T QUICKSORT (Algorithm 64) .B CACM July, 1961 .A Hoare, C. A. R. .N CA610709 JB March 16, 1978 10:21 PM .X 1175 5 308 1919 5 308 1969 5 308 1997 5 308 308 5 308 308 5 308 308 5 308 2191 5 308 2388 5 308 2679 5 308 3054 5 308 3121 5 308 864 6 308 864 6 308 970 6 308 1175 6 308 1175 6 308 1175 6 308 1175 6 308 1190 6 308 1228 6 308 1312 6 308 1880 6 308 1919 6 308 1969 6 308 1969 6 308 1969 6 308 1980 6 308 1997 6 308 1997 6 308 307 6 308 308 6 308 308 6 308 308 6 308 308 6 308 308 6 308 308 6 308 308 6 308 308 6 308 308 6 308 309 6 308 309 6 308 309 6 308 309 6 308 309 6 308 2017 6 308 2042 6 308 2456 6 308 2679 6 308 2709 6 308 74 6 308 3187 6 308 3187 6 308 507 6 308 716 6 308 776 6 308 783 6 308 .I 309 .T PARTITION (Algorithm 63) .B CACM July, 1961 .A Hoare, C. A. R. .N CA610708 JB March 16, 1978 10:22 PM .X 1919 5 309 309 5 309 309 5 309 309 5 309 2191 5 309 2388 5 309 2783 5 309 2784 5 309 3054 5 309 3121 5 309 864 5 309 864 6 309 1175 6 309 1175 6 309 1312 6 309 1729 6 309 232 6 309 1880 6 309 1919 6 309 1969 6 309 1980 6 309 1997 6 309 307 6 309 307 6 309 308 6 309 308 6 309 308 6 309 308 6 309 308 6 309 309 6 309 309 6 309 309 6 309 309 6 309 309 6 309 309 6 309 309 6 309 309 6 309 2017 6 309 2456 6 309 2679 6 309 2709 6 309 74 6 309 74 6 309 2783 6 309 3187 6 309 776 6 309 .I 310 .T A Set of Associate Legendre Polynomials of the Second Kind (Algorithm 62) .B CACM July, 1961 .A Herndon, J. R. .N CA610707 JB March 16, 1978 10:23 PM .X 1222 5 310 310 5 310 310 5 310 310 5 310 1130 6 310 245 6 310 310 6 310 .I 311 .T Procedures for Range Arithmetic (Algorithm 61) .B CACM July, 1961 .A Gibb, A. .N CA610706 JB March 16, 1978 10:25 PM .X 1524 5 311 1931 5 311 311 5 311 311 5 311 311 5 311 2214 5 311 2544 5 311 879 6 311 1177 6 311 1197 6 311 1524 6 311 311 6 311 311 6 311 311 6 311 311 6 311 2214 6 311 .I 312 .T A Further Note on Approximating e^x .B CACM July, 1961 .A Olivier, D. .N CA610705 JB March 16, 1978 10:26 PM .X 312 5 312 312 5 312 312 5 312 .I 313 .T An Iterative Method for Inversion of Power Series .B CACM July, 1961 .A Bramhall, J. N. .N CA610704 JB March 16, 1978 10:26 PM .X 313 5 313 313 5 313 313 5 313 .I 314 .T A Divisionless Method of Integer Conversion .B CACM July, 1961 .A Clarkson, W. K. Prince, B. M. .N CA610703 JB March 16, 1978 10:27 PM .X 314 5 314 314 5 314 314 5 314 .I 315 .T Solution of Tridiagonal Matrices .B CACM July, 1961 .A Wenrick, R. C. .N CA610702 JB March 16, 1978 10:28 PM .X 315 5 315 315 5 315 315 5 315 .I 316 .T An Algorithm for Equivalence Declarations .B CACM July, 1961 .A Arden, B. W. Galler, A. Graham, R. M. .N CA610701 JB March 16, 1978 10:29 PM .X 1072 5 316 1781 5 316 316 5 316 316 5 316 316 5 316 123 6 316 196 6 316 919 6 316 990 6 316 1007 6 316 1046 6 316 1131 6 316 1139 6 316 1140 6 316 1149 6 316 1198 6 316 1215 6 316 1223 6 316 1265 6 316 1303 6 316 1323 6 316 1358 6 316 1366 6 316 1421 6 316 1460 6 316 1462 6 316 1463 6 316 1467 6 316 1468 6 316 1477 6 316 1491 6 316 1496 6 316 1531 6 316 1535 6 316 1565 6 316 1601 6 316 1602 6 316 1613 6 316 1614 6 316 1626 6 316 1641 6 316 1787 6 316 1788 6 316 205 6 316 224 6 316 249 6 316 288 6 316 316 6 316 316 6 316 381 6 316 398 6 316 11 6 316 404 6 316 410 6 316 463 6 316 464 6 316 483 6 316 3184 6 316 3188 6 316 584 6 316 600 6 316 680 6 316 691 6 316 763 6 316 799 6 316 .I 317 .T On The Approximation of Curves by Line Segments Using Dynamic Programming .B CACM June, 1961 .A Bellman, R. .N CA610608 JB March 16, 1978 10:31 PM .X 317 5 317 317 5 317 317 5 317 497 5 317 867 5 317 317 6 317 317 6 317 497 6 317 .I 318 .T Combat Vehicle Firing Stability (Active Suspension) .B CACM June, 1961 .A Fischer, C. M. .N CA610607 JB March 16, 1978 10:32 PM .X 318 5 318 318 5 318 318 5 318 .I 319 .T On a Class of Iteration Formulas and Some Historical Notes .W The class of iteration formulas obtainable by rational approximations of "Euler's formula" is derived with the corresponding error estimates. Some historical notes on iterative procedures are followed by a derivation of Euler's formula with the associated error estimate in a new notation which simplifies the error estimate and suggests generalizations. The final section considers the Pade approximants to the "Euler polynomial" and shows how a number of known formulas may be derived from this unified approach. There is a short discussion of the "best" formula. .B CACM June, 1961 .A Traub, J. F. .N CA610606 JB March 16, 1978 10:36 PM .X 319 4 319 319 5 319 319 5 319 319 5 319 380 5 319 .I 320 .T Logic-Structure Tables .W Logic tables are an excellent way of developing and expressing the logic required in procedures, operations, systems and circuits. A set of rules for writing and using logic tables is explained by means of some simple examples. Then the logic structure of a vending machine is given in which two logic tables are used. Logic tables are two-dimensional in nature, enabling us to fully express and consider both the sequential and parallel aspects of logic. They can be compiled directly into a computer program and so eliminate the need for flow charting and hand coding. .B CACM June, 1961 .A Cantrell, H. N. King, J. King, F. E. H. .N CA610605 JB March 16, 1978 10:40 PM .X 1237 5 320 250 5 320 320 5 320 320 5 320 320 5 320 250 6 320 320 6 320 320 6 320 753 6 320 .I 321 .T ALGOL 60 Confidential .W The ALGOL 60 Report,* when first encountered, seems to describe a very complex language which will be difficult to learn. The "metalinguistic formulae" admirably serve the purpose of precisely specifying a language, but they are certainly not very readable for a beginner. However, experience has shown that once the report is explained it is in fact easy to learn ALGOL and to write algorithms in it. The language is so general and powerful it can handle an enormous class of problems. It is not hard to learn those parts of ALGOL present in other compiler languages: how to write assignment and go to and for statements, etc. Indeed, a lot of the unnecessary restrictions imposed by other compiling languages have finally been lifted. But ALGOL also allows many unobvious things to be written, as we will see later, and herein lies a problem: ALGOL seems to have become too general. So many restrictions have been lifted that a lot of technical details crop up which are hard to learn and to use correctly. In this paper some of the more obscure features of the language are considered and their usefulness is discussed. Remarks are based on the authors' interpretations of the ALGOL 60 Report. .B CACM June, 1961 .A Knuth, D. E. Merner, J. N. .N CA610604 JB March 16, 1978 10:48 PM .X 249 4 321 254 4 321 272 4 321 1102 4 321 1109 4 321 1140 4 321 1188 4 321 1234 4 321 1234 4 321 1306 4 321 1464 4 321 1491 4 321 1767 4 321 1781 4 321 1787 4 321 1949 4 321 321 4 321 321 4 321 321 4 321 321 4 321 2059 4 321 2126 4 321 435 4 321 437 4 321 463 4 321 483 4 321 491 4 321 2732 4 321 560 4 321 583 4 321 3073 4 321 627 4 321 631 4 321 632 4 321 642 4 321 644 4 321 653 4 321 680 4 321 761 4 321 762 4 321 763 4 321 123 4 321 140 4 321 919 4 321 989 4 321 196 5 321 1234 5 321 254 5 321 321 5 321 321 5 321 321 5 321 400 5 321 401 5 321 402 5 321 196 6 321 944 6 321 321 6 321 321 6 321 385 6 321 387 6 321 400 6 321 402 6 321 404 6 321 3184 6 321 729 6 321 .I 322 .T Operational Compatibility of Systems-CONVENTIONS .W The General Standards Committee of the SHARE organization has devoted considerable effort to the problem of operating a computer efficiently in view of the growing number of programming systems available. Each of these programming systems has been coded to utilize a fixed set of hardware components without recognizing the fact that others may be occupying a storage medium required by the first. These incompatibilities are currently resolved by manually setting up the computer for each system as required. The following set of conventions is being considered to minimize computer set-up time. They are of sufficiently broad interest that we feel other computer users should be aware of them. -George F. Ryckman, Chairman .B CACM June, 1961 .A Bright, H. S. .N CA610603 JB March 16, 1978 10:55 PM .X 322 5 322 322 5 322 322 5 322 .I 323 .T The State of Digital Computer Technology in Europe .B CACM June, 1961 .A Blachman, N. M. .N CA610602 JB March 16, 1978 10:56 PM .X 323 4 323 689 4 323 1349 5 323 217 5 323 323 5 323 323 5 323 323 5 323 689 5 323 217 6 323 236 6 323 323 6 323 323 6 323 83 6 323 415 6 323 3197 6 323 .I 324 .T Romberg Integration (Algorithm 60) .B CACM June, 1961 .A Bauer, F. L. .N CA610601 JB March 16, 1978 10:57 PM .X 1352 5 324 1982 5 324 324 5 324 324 5 324 324 5 324 2040 5 324 1 6 324 834 6 324 872 6 324 1040 6 324 1092 6 324 1241 6 324 1241 6 324 1273 6 324 1273 6 324 1273 6 324 1352 6 324 1356 6 324 1883 6 324 324 6 324 324 6 324 324 6 324 429 6 324 570 6 324 621 6 324 621 6 324 786 6 324 .I 325 .T Numerical Solution of the Polynomial Equation (Algorithm 30) .B CACM May, 1961 .A Alexander, W. J. .N CA610509 JB March 16, 1978 10:58 PM .X 325 5 325 325 5 325 325 5 325 .I 326 .T MATHSORT (Algorithm 23) .B CACM May, 1961 .A Ranshaw, R. W. .N CA610508 JB March 16, 1978 10:59 PM .X 326 5 326 326 5 326 326 5 326 .I 327 .T Zeros of a Real Polynomial by Resultant Procedure (Algorithm 59) .B CACM May, 1961 .A Bareiss, E. H. Fisherkeller, M. A. .N CA610507 JB March 16, 1978 11:01 PM .X 1667 5 327 327 5 327 327 5 327 327 5 327 178 6 327 1242 6 327 327 6 327 .I 328 .T Matrix Inversion (ALgorithm 58) .B CACM May, 1961 .A Cohen, D. .N CA610506 JB March 16, 1978 11:03 PM .X 328 5 328 328 5 328 328 5 328 .I 329 .T Automatic Abstracting and Indexing Survey and Recommendations .W In preparation for the widespread use of automatic scanners which will read documents and transmit their contents to other machines for analysis, this report presents a new concept in automatic analysis: the relative-frequency approach to measuring the significance of words, word groups, and sentences. The relative-frequency approach is discussed in detail, as is its application to problems of automatic indexing and automatic abstracting. Included in the report is a summary of automatic analysis studies published as of the date of writing. Conclusions are that point toward more sophisticated mathematical and linguistic techniques for the solution of problems of automatic analysis. .B CACM May, 1961 .A Edmundson, H. P. Wyllys, R. E. .N CA610505 JB March 16, 1978 11:08 PM .X 1087 5 329 329 5 329 329 5 329 329 5 329 634 5 329 329 6 329 329 6 329 .I 330 .T A Method for Evaluating the Area of the Normal Function .B CACM May, 1961 .A Baker, F. B. .N CA610504 JB March 16, 1978 11:09 PM .X 330 5 330 330 5 330 330 5 330 .I 331 .T Successive Approximations and Computer Storage Problems in Ordinary Differential Equations .B CACM May, 1961 .A Bellman, R. .N CA610503 JB March 16, 1978 11:10 PM .X 331 5 331 331 5 331 331 5 331 .I 332 .T An Indirect Chaining Method for Addressing on Secondary Keys .W Methods for entering random access files on the basis of one key are briefly surveyed. The widely used chaining method, based on a pseudo-random key transformation, is reviewed in more detail. An efficient generalization of the chaining method which permits recovery on additional keys is then presented. .B CACM May, 1961 .A Johnson, L. R. .N CA610502 JB March 16, 1978 11:13 PM .X 911 5 332 1271 5 332 1785 5 332 332 5 332 332 5 332 332 5 332 2543 5 332 2552 5 332 911 6 332 911 6 332 1785 6 332 1785 6 332 1786 6 332 1973 6 332 332 6 332 332 6 332 332 6 332 332 6 332 332 6 332 2107 6 332 2109 6 332 2203 6 332 492 6 332 492 6 332 .I 333 .T Design of an Improved* Transmission/Data Processing Code .B CACM May, 1961 .A Bemer, R. W. Smith Jr., H. J. Williams Jr., F. A. .N CA610501 JB March 16, 1978 11:14 PM .X 333 4 333 230 5 333 333 5 333 333 5 333 333 5 333 .I 334 .T Division and Square Root in the Quater-Imaginary Number System .B CACM April, 1961 .A Nadler, M. .N CA610334 JB March 16, 1978 11:16 PM .X 334 5 334 334 5 334 334 5 334 .I 335 .T Some Numerical Experiments Using Newton's Method for Nonlinear Parabolic and EllipticBoundary-Value Problems .W Using a generalization of Newton's method, a nonlinear parabolic equation of the form U(t)-U(xx)=g(U) and a nonlinear elliptic equation U(xx)+U(yy)=exp(U) are solved numerically Comparison of these results with results obtained using the Picard iteration procedure show that in many cases the quisi linearization method offers substantial advantages in both time and accuracy. .B CACM April, 1961 .A Bellman, R. Juncosa, M. L. Kalaba, R. .N CA610433 JB March 16, 1978 11:20 PM .X 335 5 335 335 5 335 335 5 335 .I 336 .T A Practical Technique for the Determination of the Optimum Relaxation Factor of the Successive Over-Relaxation Method .B CACM April, 1961 .A Kulsrud, H. E. .N CA610432 JB March 16, 1978 11:27 PM .X 336 5 336 336 5 336 336 5 336 .I 337 .T Further Survey of Punched Card Codes .B CACM April, 1961 .A Ross, H. M. .N CA610431 JB March 16, 1978 11:34 PM .X 337 5 337 337 5 337 337 5 337 .I 338 .T GROUT II (Algorithm 43) .B CACM April, 1961 .A Thacher Jr., H.C. .N CA610430 JB March 16, 1978 11:35 PM .X 338 5 338 338 5 338 338 5 338 .I 339 .T Real Exponential Integral (Algorithm 20) .B CACM April, 1961 .A Alexander, W. J. Thacher Jr., H. C. .N CA610429 JB March 16, 1978 11:36 PM .X 339 5 339 339 5 339 339 5 339 .I 340 .T Legendre Polynomial (Algorithm 13) .B CACM April, 1961 .A Herndon, J. .N CA610428 JB March 16, 1978 11:37 PM .X 1611 5 340 340 5 340 340 5 340 340 5 340 1295 6 340 340 6 340 .I 341 .T Chebyschev Polynomial (Algorithm 10) .B CACM April, 1961 .A Herndon, J. .N CA610427 JB March 16, 1978 11:38 PM .X 341 5 341 341 5 341 341 5 341 .I 342 .T Solution of Polynomial Equation by Barstow-Hitchcock (Algorithm 3) .B CACM April, 1961 .A Herndon, J. .N CA610426 JB March 16, 1978 11:39 PM .X 342 5 342 342 5 342 342 5 342 .I 343 .T On Frequently Occurring Errors in ALGOL 60 Programs (Algorithm 25) .B CACM April, 1961 .A Herndon, J. .N CA610425 JB March 16, 1978 11:40 PM .X 343 5 343 343 5 343 343 5 343 .I 344 .T Ber or Bei Function (Algorithm 57) .B CACM April, 1961 .A Herndon, J. R. .N CA610424 JB March 16, 1978 11:42 PM .X 344 5 344 344 5 344 344 5 344 .I 345 .T Complete Elliptic Integral of the Second Kind (Algorithm 56) .B CACM April, 1961 .A Herndon, J. R. .N CA610423 JB March 16, 197811:43 PM .X 345 5 345 345 5 345 345 5 345 .I 346 .T Complete Elliptic Integral of the First Kind (Algorithm 55) .B CACM April, 1961 .A Herndon, J. R. .N CA610422 JB March 16, 1978 11:44 PM .X 346 5 346 346 5 346 346 5 346 .I 347 .T Gamma Function for Range 1 to 2 (Algorithm 54) .B CACM April, 1961 .A Herndon, J. R. .N CA610421 JB March 16, 1978 11:45 PM .X 347 5 347 347 5 347 347 5 347 .I 348 .T Nth Roots of a Complex Number (Algorithm 53) .B CACM April, 1961 .A Herndon, J. R. .N CA610420 JB March 16, 1978 11:47 PM .X 348 5 348 348 5 348 348 5 348 .I 349 .T A Set of Test Matrices .B CACM April, 1961 .A Herndon, J. R. .N CA610419 JB March 16, 1978 11:47 PM .X 349 5 349 349 5 349 349 5 349 .I 350 .T Adjust Inverse of a Matrix When an Element is Perturbed (Algorithm 51) .B CACM April, 1961 .A Herndon, J. R. .N CA610418 JB March 16, 1978 11:49 PM .X 350 5 350 350 5 350 350 5 350 .I 351 .T Inverse of a Finite Segment of the Hilbert Matrix (Algorithm 50) .B CACM April, 1961 .A Herndon, J. R. .N CA610417 JB March 16, 1978 11:50 PM .X 351 5 351 351 5 351 351 5 351 .I 352 .T Spherical Neumant Function (Algorithm 49) .B CACM April, 1961 .A Herndon, J. R. .N CA610416 JB March 16, 1978 11:51 PM .X 352 5 352 352 5 352 352 5 352 .I 353 .T Logarithm of A Complex Number (Algorithm 48) .B CACM April, 1961 .A Herndon, J. R. .N CA610415 JB March 16, 1978 11:53 PM .X 353 5 353 353 5 353 353 5 353 .I 354 .T Associated Legendre Functions of the First Kind for Real or Imaginary Arguments (Algorithm 47) .B CACM April, 1961 .A Herndon, J. R. .N CA610414 JB March 16, 1978 11:57 PM .X 354 5 354 354 5 354 354 5 354 .I 355 .T Exponential of a Complex Number (Algorithm 46) .B CACM April, 1961 .A Herndon, J. R. .N CA610413 JB March 16, 1978 11:59 PM .X 355 5 355 355 5 355 355 5 355 .I 356 .T INTEREST (Algorithm 45) .B CACM April, 1961 .A Ingerman, P. Z. .N CA610412 JB March 17, 1978 12:00 AM .X 356 5 356 356 5 356 356 5 356 .I 357 .T Bessel Functions Computed Recursively (Algorithm 44) .B CACM April, 1961 .A Wojcicki, M. E. .N CA610411 JB March 17, 1978 12:01 AM .X 357 5 357 357 5 357 357 5 357 .I 358 .T Crout with Pivoting II (Algorithm 43) .B CACM April, 1961 .A Thacher Jr., H. C. .N CA610410 JB March 17, 1978 12:02 AM .X 358 5 358 358 5 358 358 5 358 .I 359 .T INVERT (Algorithm 42) .B CACM April, 1961 .A Wood, T. C. .N CA610409 JB March 17, 1978 12:03 AM .X 359 5 359 359 5 359 359 5 359 .I 360 .T Evaluation of Determinant (Algorithm 41) .B CACM April, 1961 .A Solomon, J. G. .N CA610408 JB March 17, 1978 12:04 AM .X 1946 5 360 360 5 360 360 5 360 360 5 360 878 6 360 902 6 360 1093 6 360 1177 6 360 1387 6 360 1393 6 360 360 6 360 731 6 360 .I 361 .T Programmed Error Correction on a Decimal Computer .B CACM April, 1961 .A Weinberg, G. M. .N CA610407 JB March 17, 1978 12:05 AM .X 361 4 361 108 5 361 361 5 361 361 5 361 361 5 361 .I 362 .T Table Look-At Techniques .B CACM April, 1961 .A Sherman, P. M. .N CA610406 JB March 17, 1978 12:08 AM .X 362 4 362 2952 4 362 142 5 362 362 5 362 362 5 362 362 5 362 .I 363 .T On Approximating Transcendental Numbers by Continued Fractions .B CACM April, 1961 .A Karst, E. .N CA610405 JB March 17, 1978 12:09 AM .X 363 5 363 363 5 363 363 5 363 .I 364 .T On the Compilation of Subscripted Variables .B CACM April, 1961 .A Nather, R. E. .N CA610404 JB March 17, 1978 12:10 AM .X 222 4 364 224 4 364 267 4 364 1134 4 364 1139 4 364 1141 4 364 1141 4 364 1215 4 364 1223 4 364 1647 4 364 1781 4 364 1787 4 364 1792 4 364 364 4 364 364 4 364 364 4 364 364 4 364 364 4 364 405 4 364 405 4 364 438 4 364 438 4 364 561 4 364 44 4 364 763 4 364 100 5 364 224 5 364 364 5 364 364 5 364 364 5 364 44 5 364 77 5 364 98 5 364 .I 365 .T Bessel Functions of Integral Order and Complex Argument .B CACM April, 1961 .A Gray, M. C. .N CA610403 JB March 17, 1978 12:13 AM .X 365 5 365 365 5 365 365 5 365 .I 366 .T Eigenvalues of a Symmetric 3 x 3 Matrix .B CACM April, 1961 .A Smith, O. K. .N CA610402 JB March 17, 1978 12:14 AM .X 366 5 366 366 5 366 366 5 366 .I 367 .T Topological Ordering of a List of Randomly-Numbered Elements of a Network .W A network of directed line segments free of circular elements is assumed. The lines are identified by their terminal nodes and the nodes are assumed to be numbered by a non-topological system. Given a list of these lines in numeric order, a simple technique can be used to create at high speed a list in topological order. .B CACM April, 1961 .A Lasser, D. J. .N CA610401 JB March 17, 1978 12:17 AM .X 1050 5 367 1226 5 367 367 5 367 367 5 367 367 5 367 441 5 367 758 5 367 849 6 367 106 6 367 209 6 367 367 6 367 367 6 367 367 6 367 367 6 367 441 6 367 627 6 367 .I 368 .T Real Zeros of an Arbitrary Function (Algorithm 25) .B CACM March, 1961 .A Collinge, R. M. .N CA610314 JB March 17, 1978 12:31 AM .X 368 5 368 368 5 368 368 5 368 .I 369 .T Crout with Pivoting (Algorithm 16) .B CACM March, 1961 .A Thacher Jr., H. C. .N CA610313 JB March 17, 1978 12:32 AM .X 369 5 369 369 5 369 369 5 369 .I 370 .T Bisection Routine (Algorithm 4) .B CACM March, 1961 .A Rader, P. J. .N CA610312 JB March 17, 1978 12:33 AM .X 370 5 370 370 5 370 370 5 370 .I 371 .T Remarks on Algorithms 2 and 3, Algorithm 15 and Algorithms 25 and 26 .B CACM March, 1961 .A Wilkinson, J. H. .N CA610311 JB March 17, 1978 12:35 AM .X 371 5 371 371 5 371 371 5 371 .I 372 .T Critical Path Scheduling (Algorithm 40) .B CACM March, 1961 .A Leavenworth, B. .N CA610310 JB March 17, 1978 12:36 AM .X 372 5 372 372 5 372 372 5 372 .I 373 .T Correlation Coefficients with Matrix Multiplication (Algorithm 39) .B CACM March, 1961 .A Sassouni, P. .N CA610309 JB March 17, 1978 12:37 AM .X 373 5 373 373 5 373 373 5 373 .I 374 .T Telescope2 (Algorithm 38) .B CACM March, 1961 .A Brons, K. A. .N CA610308 JB March 17, 1978 12:38 AM .X 374 5 374 374 5 374 374 5 374 .I 375 .T Telescope1 (Algorithm 37) .B CACM March, 1961 .A Brons, K. A. .N CA610307 JB March 17, 1978 12:39 AM .X 375 5 375 375 5 375 375 5 375 .I 376 .T Tchebycheff (Algorithm 36) .B CACM March, 1961 .A Gianni, A. J. .N CA610306 JB March 17, 1978 12:40 AM .X 1754 5 376 376 5 376 376 5 376 376 5 376 274 6 376 376 6 376 .I 377 .T SIEVE (Algorithm 35) .B CACM March, 1961 .A Wood, T. C. .N CA610305 JB March 17, 1978 12:41 AM .X 1841 5 377 377 5 377 377 5 377 377 5 377 2120 5 377 1537 6 377 1539 6 377 1539 6 377 1841 6 377 377 6 377 377 6 377 .I 378 .T A Generalized Technique for Symbol Manipulation and Numerical Calculation .B CACM March, 1961 .A Ross, D. T. .N CA610304 JB March 17, 1978 12:42 AM .X 1024 4 378 1050 4 378 1051 4 378 1102 4 378 1102 4 378 1132 4 378 1390 4 378 1486 4 378 1549 4 378 1706 4 378 1826 4 378 1878 4 378 378 4 378 378 4 378 378 4 378 2060 4 378 2155 4 378 2168 4 378 2719 4 378 2723 4 378 2838 4 378 2842 4 378 2855 4 378 2879 4 378 3008 4 378 3077 4 378 3080 4 378 3106 4 378 627 4 378 731 4 378 798 4 378 106 4 378 1051 5 378 208 5 378 209 5 378 210 5 378 1552 5 378 1665 5 378 1860 5 378 378 5 378 378 5 378 378 5 378 2155 5 378 1184 6 378 1366 6 378 1389 6 378 1389 6 378 1421 6 378 1421 6 378 1496 6 378 1626 6 378 1641 6 378 1781 6 378 1785 6 378 1786 6 378 210 6 378 210 6 378 378 6 378 378 6 378 378 6 378 378 6 378 378 6 378 2046 6 378 2060 6 378 406 6 378 3184 6 378 631 6 378 731 6 378 793 6 378 794 6 378 799 6 378 .I 379 .T Bitwise Operations .B CACM March, 1961 .A Strachey, C. .N CA610303 JB March 17, 1978 12:42 AM .X 379 5 379 379 5 379 379 5 379 .I 380 .T Comparison of Iterative Methods for the Calculation of nth Roots .W Three iterative methods for calculation of nth roots (including one proposed by the author) are compared in two ways: (1) Theoretical convergence estimates are given. (2) A new macrocompiler which estimates machine running time is used to compare the running time of the three methods for a variety of input data. .B CACM March, 1961 .A Traub, J. F. .N CA610302 JB March 17, 1978 12:45 AM .X 319 5 380 380 5 380 380 5 380 380 5 380 380 6 380 .I 381 .T An Alternate Form of the "UNCOL Diagram" .B CACM March, 1961 .A Bratman, H. .N CA610301 JB March 17, 1978 12:46 AM .X 1159 4 381 1988 4 381 381 4 381 1781 5 381 1988 5 381 381 5 381 381 5 381 381 5 381 14 5 381 123 6 381 196 6 381 919 6 381 990 6 381 1007 6 381 1046 6 381 1131 6 381 1139 6 381 1140 6 381 1149 6 381 1198 6 381 1215 6 381 1223 6 381 1265 6 381 1303 6 381 1323 6 381 1358 6 381 1366 6 381 1421 6 381 1460 6 381 1462 6 381 1463 6 381 1467 6 381 1468 6 381 1477 6 381 1491 6 381 1496 6 381 1496 6 381 1531 6 381 1535 6 381 1565 6 381 1601 6 381 1602 6 381 1613 6 381 1614 6 381 1626 6 381 1641 6 381 1787 6 381 1788 6 381 205 6 381 224 6 381 249 6 381 288 6 381 316 6 381 381 6 381 381 6 381 398 6 381 11 6 381 11 6 381 14 6 381 404 6 381 410 6 381 463 6 381 464 6 381 483 6 381 3184 6 381 3188 6 381 584 6 381 600 6 381 680 6 381 691 6 381 763 6 381 799 6 381 .I 382 .T Statistical Programs at the University of North Carolina .B CACM February, 1961 .A Bush, N. .N CA610216 JB March 17, 1978 12:48 AM .X 382 5 382 382 5 382 382 5 382 .I 383 .T On Finding Minimum Routes in a Network With Turn Penalties .B CACM February, 1961 .A Caldwell, T. .N CA610215 JB March 17, 1978 12:49 AM .X 383 5 383 383 5 383 383 5 383 .I 384 .T Gamma Function (Algorithm 34) .B CACM February, 1961 .A Lipp, M. F. .N CA610214 JB March 17, 1978 12:49 AM .X 384 5 384 384 5 384 384 5 384 .I 385 .T FACTORIAL (Algorithm 33) .B CACM February, 1961 .A Lipp, M. F. .N CA610213 JB March 17, 1978 12:50 AM .X 1234 5 385 385 5 385 385 5 385 385 5 385 944 6 385 321 6 385 385 6 385 400 6 385 402 6 385 404 6 385 3184 6 385 729 6 385 .I 386 .T MULTINT (Algorithm 32) .B CACM February, 1961 .A Freeman Jr., R. D. .N CA610212 JB March 17, 1978 12:52 AM .X 1146 5 386 386 5 386 386 5 386 386 5 386 386 6 386 .I 387 .T Gamma Function (Algorithm 31) .B CACM February, 1961 .A Collinge,R. M. .N CA610211 JB March 17, 1978 12:53 AM .X 254 5 387 387 5 387 387 5 387 387 5 387 196 6 387 321 6 387 387 6 387 .I 388 .T Solution of Polynomial Equations by Bairstow Hitchcock Method (Algorithm 3) .B CACM February, 1961 .A Vandergraft, J. S. .N CA610210 JB March 17, 1978 12:54 AM .X 388 5 388 388 5 388 388 5 388 .I 389 .T Real Exponential Integral (Algorithm 20) .B CACM February, 1961 .A Peavy, S. .N CA610209 JB March 17, 1978 12:55 AM .X 389 5 389 389 5 389 389 5 389 .I 390 .T Complex Exponential Integral (Algorithm 13) .B CACM February, 1961 .A Rader, P. J. Thacher Jr., H. C. .N CA610208 JB March 17, 1978 12:56 AM .X 390 5 390 390 5 390 390 5 390 .I 391 .T The BKS System for the Philco-2000 .B CACM February, 1961 .A Smith, R. B. .N CA610207 JB March 17, 1978 12:57 AM .X 391 5 391 391 5 391 391 5 391 .I 392 .T Comment on A Paper on Parallel Processing .B CACM February, 1961 .A Nekora, M. R. .N CA610206 JB March 17, 1978 12:58 AM .X 392 5 392 392 5 392 392 5 392 .I 393 .T Two Subroutines for Symbol Manipulation with an Algebraic Compiler .B CACM February, 1961 .A Carr III, J. W. Hanson, J. W. .N CA610205 JB March 17, 1978 12:59 AM .X 393 5 393 393 5 393 393 5 393 561 5 393 393 6 393 77 6 393 .I 394 .T Multiple Programming Data Processing .B CACM February, 1961 .A Ryle, B. L. .N CA610204 JB March 17, 1978 1:00 AM .X 394 5 394 394 5 394 394 5 394 .I 395 .T Multiple-Precision Division .B CACM February, 1961 .A Rabinowitz, P. .N CA610202 JB March 17, 1978 1:01 AM .X 395 5 395 395 5 395 395 5 395 .I 396 .T Automation of Program Debugging .W Automatic Debugging can substantially reduce lead-time between the coding and the effective use of a complex program. It also enforces analysis of debugging criteria, resulting in verifiably accurate programs. The programmer specifies the program to be debugged, memory areas, set of input data, maximum repetition of loops, and checkpoint information for each set of data. The executive debugging program the runs the program to be debugged, performing checking functions and creating a trace record of its own later analysis and location of errors. Applications are quite flexible, and the system can be used alone or in conjunction with other debugging techniques. .B CACM July, 1961 .A Jacoby, K. Layton, H. .N CA610714 ES March 17, 1982 10:10 AM .X 931 5 396 396 5 396 396 5 396 396 5 396 202 6 396 396 6 396 634 6 396 .I 397 .T A Card Format for Reference Files in Information Processing .W This paper proposes a card format suitable for a variety of reference files in information processing. An 80-column IBM card is divided into two fields-reference material field (columns 1-67) and identification field (columns 68-80). The format for the reference material is flexible, while the format for the identification is rigid. The reference material includes basically an index, title, source, class, summary and cross reference for each entry. The identification includes basically codes for a matrix of descriptors, an entry number, and the kind, major interest, and source of the reference. The identification also provides a choice to identify material for personal as well as general files. Since this card format is sufficient to identify the material normally associated with reference files for books, articles, programming terms, hardware terms, equipment, machine systems, abbreviations, etc., it is suitable as a standard for card reference files in information processing. .B CACM February, 1961 .A Grems, M. .N CA610201 JB March 17, 1978 1:08 AM .X 929 5 397 397 5 397 397 5 397 397 5 397 397 6 397 .I 398 .T The SLANG System .B CACM January, 1961 .A Sibley, R. A. .N CA610116 JB March 17, 1978 1:10 AM .X 205 4 398 210 4 398 214 4 398 1982 4 398 398 4 398 642 4 398 669 4 398 100 4 398 123 4 398 164 4 398 1 5 398 1781 5 398 398 5 398 398 5 398 398 5 398 123 6 398 196 6 398 919 6 398 990 6 398 1007 6 398 1046 6 398 1131 6 398 1139 6 398 1140 6 398 1149 6 398 1198 6 398 1215 6 398 1223 6 398 1265 6 398 1303 6 398 1323 6 398 1358 6 398 1366 6 398 1421 6 398 1460 6 398 1462 6 398 1463 6 398 1467 6 398 1468 6 398 1477 6 398 1491 6 398 1496 6 398 1531 6 398 1535 6 398 1565 6 398 1601 6 398 1602 6 398 1613 6 398 1614 6 398 1626 6 398 1641 6 398 1787 6 398 1788 6 398 205 6 398 224 6 398 249 6 398 288 6 398 316 6 398 381 6 398 398 6 398 11 6 398 404 6 398 410 6 398 463 6 398 464 6 398 483 6 398 3184 6 398 3188 6 398 584 6 398 600 6 398 680 6 398 691 6 398 763 6 398 799 6 398 .I 399 .T Compiling Techniques for Boolean Expressions and Conditional Statements in ALGOL 60 .B CACM January, 1961 .A Huskey, H. D. Wattenburg, W. H. .N CA610115 JB March 17, 1978 1:12 AM .X 1139 5 399 1947 5 399 399 5 399 399 5 399 399 5 399 556 5 399 799 5 399 945 6 399 1134 6 399 1223 6 399 1248 6 399 224 6 399 399 6 399 399 6 399 399 6 399 399 6 399 82 6 399 404 6 399 404 6 399 438 6 399 464 6 399 631 6 399 .I 400 .T Comments on the Implementation of Recursive Procedures and Blocks in ALGOL 60 .B CACM January, 1961 .A Irons, E. T. Feurzeig, W. .N CA610114 JB March 17, 1978 1:13 AM .X 1234 5 400 321 5 400 400 5 400 400 5 400 400 5 400 196 6 400 944 6 400 321 6 400 385 6 400 400 6 400 400 6 400 401 6 400 402 6 400 402 6 400 404 6 400 3184 6 400 729 6 400 .I 401 .T Allocation of Storage for Arrays in ALGOL 60 .B CACM January, 1961 .A Sattley, K. .N CA610113 JB March 17, 1978 1:14 AM .X 321 5 401 401 5 401 401 5 401 401 5 401 196 6 401 400 6 401 401 6 401 402 6 401 .I 402 .T Dynamic Declarations .B CACM January, 1961 .A Ingerman, P. Z. .N CA610112 JB March 17, 1978 1:14 AM .X 1234 5 402 321 5 402 402 5 402 402 5 402 402 5 402 196 6 402 944 6 402 321 6 402 385 6 402 400 6 402 400 6 402 401 6 402 402 6 402 402 6 402 404 6 402 3184 6 402 729 6 402 .I 403 .T Thunks -- A Way of Compiling Procedure Statements with Some Comments on Procedure Declarations .B CACM January, 1961 .A Ingerman, P. Z. .N CA610111 JB March 17, 1978 1:16 AM .X 403 5 403 403 5 403 403 5 403 .I 404 .T A Syntax Directed Compiler for ALGOL 60 .B CACM January, 1961 .A Irons, E. T. .N CA610110 JB March 17, 1978 1:16 AM .X 945 5 404 1046 5 404 1105 5 404 1139 5 404 1140 5 404 1234 5 404 1263 5 404 1265 5 404 1496 5 404 1781 5 404 1824 5 404 2126 5 404 2546 5 404 404 5 404 404 5 404 404 5 404 464 5 404 584 5 404 631 5 404 653 5 404 680 5 404 763 5 404 795 5 404 799 5 404 823 6 404 123 6 404 196 6 404 196 6 404 196 6 404 196 6 404 196 6 404 196 6 404 196 6 404 919 6 404 931 6 404 944 6 404 945 6 404 989 6 404 990 6 404 1007 6 404 1046 6 404 1131 6 404 1137 6 404 1139 6 404 1140 6 404 1141 6 404 1149 6 404 1198 6 404 1215 6 404 1223 6 404 1265 6 404 1303 6 404 1323 6 404 1358 6 404 1358 6 404 1366 6 404 1421 6 404 1460 6 404 1462 6 404 1463 6 404 1467 6 404 1468 6 404 1477 6 404 1477 6 404 1491 6 404 1491 6 404 1496 6 404 1531 6 404 1535 6 404 1565 6 404 1601 6 404 1602 6 404 1613 6 404 1614 6 404 1614 6 404 1614 6 404 1626 6 404 1641 6 404 1693 6 404 1781 6 404 1787 6 404 1788 6 404 205 6 404 224 6 404 224 6 404 224 6 404 249 6 404 265 6 404 288 6 404 316 6 404 321 6 404 381 6 404 385 6 404 398 6 404 399 6 404 399 6 404 11 6 404 2126 6 404 82 6 404 400 6 404 402 6 404 404 6 404 404 6 404 404 6 404 404 6 404 404 6 404 404 6 404 404 6 404 404 6 404 404 6 404 404 6 404 404 6 404 404 6 404 404 6 404 404 6 404 404 6 404 404 6 404 404 6 404 404 6 404 404 6 404 404 6 404 404 6 404 410 6 404 412 6 404 438 6 404 463 6 404 464 6 404 464 6 404 464 6 404 483 6 404 3184 6 404 3184 6 404 3184 6 404 3184 6 404 3184 6 404 3188 6 404 584 6 404 600 6 404 631 6 404 631 6 404 631 6 404 635 6 404 680 6 404 691 6 404 729 6 404 763 6 404 799 6 404 .I 405 .T An Algorithm for Coding Efficient Arithmetic Operations .W Most existing formula translation schemes yield inefficient coding. A method is described which reduces the number of store and fetch operations, evaluates constant subexpressions during compilation, and recognizes many equivalent subexpressions. .B CACM January, 1961 .A Floyd, R. W. .N CA610109 JB March 17, 1978 1:19 AM .X 267 4 405 1134 4 405 1139 4 405 1141 4 405 1141 4 405 1215 4 405 1223 4 405 1647 4 405 1781 4 405 1787 4 405 1792 4 405 364 4 405 364 4 405 405 4 405 405 4 405 405 4 405 405 4 405 438 4 405 438 4 405 561 4 405 44 4 405 54 4 405 763 4 405 1223 5 405 224 5 405 1388 5 405 405 5 405 405 5 405 405 5 405 436 5 405 55 5 405 77 5 405 93 5 405 224 6 405 405 6 405 405 6 405 405 6 405 731 6 405 .I 406 .T The Use of Threaded Lists in Constructing a Combined ALGOL and Machine-Like Assembly Processor .B CACM January, 1961 .A Evans Jr., A. Perlis, A. J. Van Zoeren, H. .N CA610108 JB March 17, 1978 1:20 AM .X 1051 5 406 1102 5 406 1549 5 406 406 5 406 406 5 406 406 5 406 106 6 406 196 6 406 1051 6 406 209 6 406 210 6 406 210 6 406 210 6 406 378 6 406 406 6 406 406 6 406 406 6 406 483 6 406 627 6 406 731 6 406 731 6 406 753 6 406 793 6 406 794 6 406 .I 407 .T MADCAP: A Scientific Compiler for a Displayed Formula Textbook Language .B CACM January, 1961 .A Wells, M. B. .N CA610107 JB March 17, 1978 1:21 AM .X 1083 5 407 1396 5 407 407 5 407 407 5 407 407 5 407 679 5 407 964 6 407 1028 6 407 1029 6 407 1083 6 407 1132 6 407 1214 6 407 1278 6 407 1334 6 407 1365 6 407 1386 6 407 1387 6 407 1388 6 407 1392 6 407 1393 6 407 1394 6 407 1395 6 407 1396 6 407 1397 6 407 1496 6 407 284 6 407 21 6 407 407 6 407 407 6 407 407 6 407 3184 6 407 3192 6 407 3193 6 407 3199 6 407 3200 6 407 3201 6 407 3202 6 407 3203 6 407 3204 6 407 561 6 407 730 6 407 730 6 407 .I 408 .T The Internal Organization of the MAD Translator .B CACM January, 1961 .A Arden, B. W. Galler, B. A. Graham, R. M. .N CA610106 JB March 17, 1978 1:22 AM .X 1134 5 408 1179 5 408 1861 5 408 408 5 408 408 5 408 408 5 408 830 6 408 1614 6 408 1781 6 408 17 6 408 77 6 408 408 6 408 408 6 408 408 6 408 .I 409 .T CL-1, An Environment for a Compiler .W A flexible, large-scale programming system to facilitate the solution of information processing problems and to provide intercommunication between programs and/or programmers has been developed and realized on the IBM 709/7090 computer. The system is based on a master file concept and has provisions for accepting, storing, and retrieving both descriptions and instances of large and complex data sets, as well as algorithms defined on these data sets. Both data and algorithms may be expressed in a family of command and descriptive languages. The concept of distinct data descriptions and the content and use of such descriptions are discussed in some detail. .B CACM January, 1961 .A Cheatham Jr., T. E. Collins Jr., G. O. Leonard, G. F. .N CA610105 JB March 17, 1978 1:26 AM .X 409 5 409 409 5 409 409 5 409 657 5 409 279 6 409 409 6 409 .I 410 .T The CLIP Translator .B CACM January, 1961 .A Englund, D. Clark, E. .N CA610104 JB March 17, 1978 1:27 AM .X 1781 5 410 410 5 410 410 5 410 410 5 410 669 5 410 1 6 410 123 6 410 196 6 410 919 6 410 990 6 410 1007 6 410 1046 6 410 1131 6 410 1139 6 410 1140 6 410 1149 6 410 1198 6 410 1215 6 410 1223 6 410 1265 6 410 1303 6 410 1323 6 410 1358 6 410 1366 6 410 1421 6 410 1460 6 410 1462 6 410 1463 6 410 1467 6 410 1468 6 410 1477 6 410 1491 6 410 1496 6 410 1531 6 410 1535 6 410 1565 6 410 1601 6 410 1602 6 410 1613 6 410 1614 6 410 1626 6 410 1641 6 410 1787 6 410 1788 6 410 205 6 410 224 6 410 249 6 410 288 6 410 316 6 410 381 6 410 398 6 410 11 6 410 404 6 410 410 6 410 410 6 410 463 6 410 464 6 410 483 6 410 3184 6 410 3184 6 410 3188 6 410 584 6 410 600 6 410 680 6 410 691 6 410 763 6 410 799 6 410 .I 411 .T Use of Magnetic Tape for Data Storage in the ORACLE-ALGOL Translator .B CACM January, 1961 .A Bottenbruch, H. .N CA610103 JB March 17, 1978 1:28 AM .X 411 5 411 411 5 411 411 5 411 .I 412 .T Recursive Processes and ALGOL Translation .B CACM January, 1961 .A Gray, A. A. .N CA610102 JB March 17, 1978 1:29 AM .X 412 5 412 412 5 412 412 5 412 763 5 412 196 6 412 224 6 412 404 6 412 412 6 412 631 6 412 .I 413 .T A Basic Compiler for Arithmetic Expressions .B CACM January, 1961 .A Huskey, H. D. Wattenburg, W. H. .N CA610101 JB March 17, 1978 1:30 AM .X 413 5 413 413 5 413 413 5 413 .I 414 .T IBM 1440 Data Processing System Features Five New Units .W The IBM 1440 data processing system, announced recently by the International Business Machines Corporation, not only features the 1311 disk storage drive with interchangeable disk packs but four other newly developed units. .B CACM December, 1961 .A Wheeling, R. .N CA621225 JB March 17,1978 4:30 PM .X 414 5 414 414 5 414 414 5 414 .I 415 .T The Use of Digital Computers in Western Germany .B CACM December, 1962 .A Schuff, H. K. .N CA621224 JB March 17, 1978 4:32 PM .X 1349 5 415 415 5 415 415 5 415 415 5 415 236 6 415 323 6 415 83 6 415 415 6 415 .I 416 .T Multiple Shooting Method for Two-Point Boundary Value Problems .B CACM December, 1962 .A Morrison, D. D. Riley, J. D. Zancanaro, J. F. .N CA621223 JB March 17, 1978 4:33 PM .X 1049 5 416 416 5 416 416 5 416 416 5 416 416 6 416 .I 417 .T Legal Implications of Computer Use .W This paper points out a variety of ways computer systems used in business and industry can be involved in legal entanglements and suggests that computer specialists have a responsibility to call for assistance in forestalling or minimizing those entanglements during the planning stage. Techniques are suggested for making legal clearance effective with the least burden on the new technology and for achieving a favorable legal climate for it generally. Computer specialists also are alerted to potential opportunities to interpret to lawyers the technical aspects of computer systems involved in legal situations. .B CACM December, 1962 .A Freed, R. N. .N CA621222 JB March 17, 1978 4:37 PM .X 417 5 417 417 5 417 417 5 417 .I 418 .T RANDOM (Algorithm 133) .B CACM December, 1962 .A Behrenz, P. G. .N CA621221 JB March 17, 1978 4:38 PM .X 418 5 418 418 5 418 418 5 418 .I 419 .T Magic Square (Algorithm 118) .B CACM December, 1962 .A Thacher Jr., H. C. .N CA621220 JB March 17, 1978 4:52 PM .X 419 5 419 419 5 419 419 5 419 .I 420 .T PERM (Algorithm 115) .B CACM December, 1962 .A Phillips, E. S. .N CA621219 JB March 17, 1978 4:53 PM .X 420 5 420 420 5 420 420 5 420 .I 421 .T Position of Point Relative to Polygon (Algorithm 112) .B CACM December, 1962 .A Hacker, R. .N CA621218 JB March 17, 1978 4:54 PM .X 1804 5 421 2987 5 421 421 5 421 421 5 421 421 5 421 1326 6 421 1630 6 421 2125 6 421 2547 6 421 2633 6 421 421 6 421 421 6 421 524 6 421 524 6 421 .I 422 .T COMBINATION (Algorithm 94) .B CACM December, 1962 .A Grench, R. E. .N CA621217 JB March 17, 1978 4:56 PM .X 422 5 422 422 5 422 422 5 422 .I 423 .T Matrix Inversion (Algorithm 58) .B CACM December, 1962 .A Behrenz, P. G. .N CA621216 JB March 17, 1978 4:57 PM .X 423 5 423 423 5 423 423 5 423 .I 424 .T Gamma Function (Algorithm 31) .B CACM December, 1962 .A Behrenz, P. G. .N CA621215 JB March 17, 1978 4:58 PM .X 424 5 424 424 5 424 424 5 424 .I 425 .T Complete Elliptic Integral (Algorithm 149) .B CACM December, 1962 .A Merner, J. N. .N CA621214 JB March 17,1978 4:59 PM .X 425 5 425 425 5 425 425 5 425 .I 426 .T Term of Magic Square (Algorithm 148) .B CACM December, 1962 .A Collison, D. M. .N CA621213 JB March 17, 1978 5:00 PM .X 426 5 426 426 5 426 426 5 426 .I 427 .T PSIF (Algorithm 147) .B CACM December, 1962 .A Amit, D. .N CA621212 JB March 17, 1978 5:03 PM .X 427 5 427 427 5 427 427 5 427 .I 428 .T Multiple Integration (Algorithm 146) .B CACM December, 1962 .A McKeeman, W. M. .N CA621211 JB March 17, 1978 5:04 PM .X 428 5 428 428 5 428 428 5 428 .I 429 .T Adaptive Nimerical Integration by Simpson's Rule (Algorithm 145) .B CACM December, 1962 .A McKeeman, W. M. .N CA621210 JB March 17, 1978 5:06 PM .X 1352 5 429 2048 5 429 2074 5 429 2093 5 429 2550 5 429 429 5 429 429 5 429 429 5 429 834 6 429 834 6 429 834 6 429 834 6 429 872 6 429 872 6 429 872 6 429 1040 6 429 1092 6 429 1092 6 429 1241 6 429 1273 6 429 1298 6 429 1573 6 429 1573 6 429 324 6 429 2074 6 429 429 6 429 429 6 429 429 6 429 429 6 429 429 6 429 570 6 429 621 6 429 786 6 429 786 6 429 786 6 429 .I 430 .T TREESORT2 (Algorithm 144) .B CACM December, 1962 .A Kaupe Jr.,A. F. .N CA621209 JB March 17, 1978 5:07 PM .X 430 5 430 430 5 430 430 5 430 .I 431 .T TREESORT1 (Algorithm 143) .B CACM December, 1962 .A Kaupe Jr., A. F. .N CA621208 JB March 17, 1978 5:08 PM .X 431 5 431 431 5 431 431 5 431 .I 432 .T Triangular Regression (Algorithm 142) .B CACM December, 1962 .A Hafley, W. L. Lewis, J. S. .N CA621207 JB March 17,1978 5:09 PM .X 432 5 432 432 5 432 432 5 432 .I 433 .T Fixed-World-Length Arrays in Variable-Word-Length Computers .B CACM December, 1962 .A Sonquist, J. A. .N CA621206 JB March 17, 1978 5:10 PM .X 433 5 433 433 5 433 433 5 433 .I 434 .T Character Manipulation in 1620 Fortran II .B CACM December, 1962 .A Poore Jr., J. H. .N CA621205 JB March 17, 1978 5:11 PM .X 434 5 434 434 5 434 434 5 434 .I 435 .T A Decision Matrix as the Basis for a Simple Data Input Routine .W Currently a great deal of time and effort is being spent on the development of bigger and better compiler languages, multiprogram executive systems, etc. Since the implementation of of new methods and procedures is not instantaneous, but rather occurs by an evolutionary process, we should be concerned also with the problem of maintaining, improving and incorporating new ideas into existing systems. It is with this somewhat neglected area that the author is interested. A method employing a decision matrix is presented for the handling of a standard systems programming problem,that of providing a data input routine. .B CACM December, 1962 .A Vasilakos, G. J. .N CA621204 JB March 17, 1978 5:15 PM .X 249 4 435 254 4 435 272 4 435 1102 4 435 1109 4 435 1140 4 435 1188 4 435 1306 4 435 1464 4 435 1491 4 435 1767 4 435 1781 4 435 1787 4 435 1949 4 435 321 4 435 2059 4 435 2126 4 435 435 4 435 435 4 435 437 4 435 463 4 435 483 4 435 491 4 435 2732 4 435 560 4 435 583 4 435 3073 4 435 627 4 435 631 4 435 632 4 435 642 4 435 644 4 435 653 4 435 680 4 435 761 4 435 762 4 435 763 4 435 849 4 435 123 4 435 140 4 435 919 4 435 989 4 435 196 5 435 1053 5 435 435 5 435 435 5 435 435 5 435 615 5 435 435 6 435 474 6 435 718 6 435 720 6 435 .I 436 .T Evaluation of Polynomials by Computer .B CACM December, 1962 .A Knuth, D. E. .N CA621203 JB March 17, 1978 5:16 PM .X 1223 4 436 1388 4 436 436 4 436 1620 5 436 405 5 436 436 5 436 436 5 436 436 5 436 819 5 436 819 6 436 436 6 436 436 6 436 .I 437 .T Compiling Matrix Operations .B CACM December, 1962 .A Galler, B. A. Perlis, A. J. .N CA621202 JB March 17, 1978 5:17 PM .X 249 4 437 254 4 437 272 4 437 1102 4 437 1109 4 437 1140 4 437 1188 4 437 1306 4 437 1464 4 437 1491 4 437 1767 4 437 1781 4 437 1787 4 437 1949 4 437 321 4 437 2059 4 437 2126 4 437 435 4 437 437 4 437 463 4 437 483 4 437 491 4 437 2732 4 437 560 4 437 583 4 437 3073 4 437 627 4 437 631 4 437 632 4 437 642 4 437 644 4 437 653 4 437 680 4 437 761 4 437 762 4 437 763 4 437 123 4 437 140 4 437 919 4 437 989 4 437 196 5 437 1614 5 437 2253 5 437 2557 5 437 437 5 437 437 5 437 437 5 437 2081 6 437 437 6 437 437 6 437 437 6 437 3184 6 437 .I 438 .T Mechanical Pragmatics: A Time-Motion Study of a Miniature Mechanical Linguistic System .B CACM December, 1962 .A Gorn, S. .N CA621201 JB March 17, 1978 5:19 PM .X 249 4 438 267 4 438 1134 4 438 1139 4 438 1141 4 438 1141 4 438 1215 4 438 1223 4 438 1425 4 438 1647 4 438 1781 4 438 1781 4 438 1787 4 438 1792 4 438 364 4 438 364 4 438 405 4 438 405 4 438 438 4 438 438 4 438 438 4 438 438 4 438 561 4 438 44 4 438 3185 4 438 762 4 438 763 4 438 1139 5 438 224 5 438 249 5 438 303 5 438 438 5 438 438 5 438 438 5 438 77 5 438 3185 5 438 224 6 438 303 6 438 399 6 438 404 6 438 438 6 438 438 6 438 464 6 438 631 6 438 .I 439 .T On-Line Digital Computer for Measurement of a Neurological Control System .B CACM November, 1962 .A Stark, L. Payne, R. Okabe, Y. .N CA621122 JB March 17, 1978 5:20 PM .X 439 5 439 439 5 439 439 5 439 .I 440 .T Record Linkage .W Special difficulties are encountered in devising reliable systems for searching and updating any large files of documents that must be identified primarily on the basis of names and other personal particulars. The underlying problem is that of making nearly maximum use of items of identifying information that are individually unreliable but that may collectively be of considerable discriminating power. Rules that can be applied generally to name retrieval systems have been developed in a methodological study of the linkage of vital and health records into family groupings for demographic research purposes. These rules are described, and the ways in which information utilization for matching may be optimized are discussed. .B CACM November, 1962 .A Newcombe, H. B. Kennedy, J. M. .N CA621121 JB March 17, 1978 5:51 PM .X 1112 4 440 1592 4 440 2111 4 440 2339 4 440 440 4 440 2339 5 440 440 5 440 440 5 440 440 5 440 619 5 440 1112 6 440 1592 6 440 440 6 440 619 6 440 .I 441 .T Topological Sorting of Large Networks .W Topological Sorting is a procedure required for many problems involving analysis of networks. An example of one such problem is PERT. The present paper presents a very general method for obtaining topological order. It permits treatment of larger networks than can be handled on present procedures and achieves this with greater efficiency. Although the procedure can be adapted to any machine, it is discussed in terms of the 7090. A PERT network of 30,000 activities can be ordered in less than one hour of machine time. The method was developed as a byproduct of procedures needed by Westinghouse, Baltimore. It has not been programmed and at present there are no plans to implement it. In regard to the techniques described, Westinghouse's present and anticipated needs are completely served by the Lockheed program, which is in current use. .B CACM November, 1962 .A Kahn, A. B. .N CA621120 JB March 17, 1978 5:58 PM .X 1050 4 441 1226 4 441 441 4 441 758 4 441 1723 5 441 367 5 441 441 5 441 441 5 441 441 5 441 758 5 441 367 6 441 441 6 441 441 6 441 .I 442 .T Crout with Equilibration and Iteration (Algorithm 135) .B CACM November, 1962 .A McKeeman, W. M. .N CA621119 JB March 17, 1978 5:59 PM .X 442 5 442 442 5 442 442 5 442 .I 443 .T Complex Number to a Real Power (Algorithm 106) .B CACM December, 1962 .A Erwin Jr.,G. W. .N CA621118 JB March 17, 1978 6:01 PM .X 443 5 443 443 5 443 443 5 443 .I 444 .T Evaluation of Jacobi Symbol (Algorithm 99) .B CACM November, 1962 .A May, R. W. .N CA621117 JB March 17, 1978 6:02 PM .X 444 5 444 444 5 444 444 5 444 .I 445 .T COMBINATION (Algorithm 94) .B CACM November, 1962 .A May, R. W. .N CA621116 JB March 17, 1978 6:03 PM .X 445 5 445 445 5 445 445 5 445 .I 446 .T Simpson's Integration (Algorithm 84) .B CACM November, 1962 .A Behrenz, P. G. .N CA621115 JB March 17, 1978 6:04 PM .X 446 5 446 446 5 446 446 5 446 .I 447 .T Certification of the Calculation of Easter .B CACM November, 1962 .A Williams, M. R. .N CA621114 JB March 17, 1978 6:05 PM .X 447 5 447 447 5 447 447 5 447 .I 448 .T Path Matrix (Algorithm 141) .B CACM November, 1962 .A Ingerman, P. Z. .N CA621113 JB March 17, 1978 6:06 PM .X 448 5 448 448 5 448 448 5 448 .I 449 .T Matrix Inversion(Algorithm 140) .B CACM November, 1962 .A Ingerman, P. Z. .N CA621112 JB March 17, 1978 6:12 PM .X 449 5 449 449 5 449 449 5 449 .I 450 .T Solution of the Diophantine Equation (Algorithm 139) .B CACM November, 1962 .A Peck, J. E. L. .N CA621111 JB March 17, 1978 6:13 PM .X 2031 5 450 450 5 450 450 5 450 450 5 450 1022 6 450 450 6 450 .I 451 .T Nesting of for Statement II (Algorithm 138) .B CACM November, 1962 .A Dahm, D. M. Wells, M. .N CA621110 JB March 17, 1978 6:14 PM .X 451 5 451 451 5 451 451 5 451 .I 452 .T Nesting of for Statement I (Algorithm 137) .B CACM November, 1962 .A Dahm, D. M. Wells, M. .N CA621109 JB March 17, 1978 6:15 PM .X 452 5 452 452 5 452 452 5 452 .I 453 .T Enlargement of a Group (Algorithm 136) .B CACM November, 1962 .A Wells, M. .N CA621108 JB March 17, 1978 6:17 PM .X 453 5 453 453 5 453 453 5 453 .I 454 .T Crout with Equilibration and Iteration (Algorithm 135) .B CACM November, 1962 .A McKeeman, W. M. .N CA621107 JB March 17, 1978 6:51 PM .X 1319 4 454 454 4 454 454 4 454 140 4 454 152 5 454 1177 5 454 454 5 454 454 5 454 454 5 454 586 5 454 806 5 454 932 6 454 454 6 454 454 6 454 .I 455 .T Exponentiation of Series (Algorithm 134) .B CACM November, 1962 .A Fettis, H. E. .N CA621106 JB March 17, 1978 6:52 PM .X 455 5 455 455 5 455 455 5 455 .I 456 .T RANDOM (Algorithm 133) .B CACM November, 1962 .A Behrenz, P. G. .N CA621105 JB March 17, 1978 6:53 PM .X 1190 5 456 456 5 456 456 5 456 456 5 456 456 6 456 .I 457 .T Quantum Mechanical Integrals Over all Slater-Type Integrals .B CACM November, 1962 .A Browne, J. C. .N CA621104 JB March 17, 1978 6:54 PM .X 457 5 457 457 5 457 457 5 457 .I 458 .T Coefficient Determination (Algorithm 131) .B CACM November, 1962 .A Smith, V. H. Allen, M. L. .N CA621103 JB March 17, 1978 6:56 PM .X 458 5 458 458 5 458 458 5 458 .I 459 .T PERMUTE (Algorithm 130) .B CACM November, 1962 .A Eaves, Lt. B. C. .N CA621102 JB March 17, 1978 6:57 PM .X 459 5 459 459 5 459 459 5 459 .I 460 .T MINIFUN (Algorithm 129) .B CACM November, 1962 .A Whitley, V. W. .N CA621101 JB March 17, 1978 6:58 PM .X 460 5 460 460 5 460 460 5 460 .I 461 .T Coding of Medical Case History Data for Computer Analysis .B CACM October, 1962 .A Lipkin, M. Woodbury, M. A. .N CA621019 JB March 17, 1978 6:59 PM .X 461 5 461 461 5 461 461 5 461 .I 462 .T Computer Pattern Recognition Techniques: Electrocardiographic Diagnosis .W The use of programmed digital computers as general pattern classification and recognition devices is one phase of the current lively interest in artificial intelligence. It is important to choose a class of signals which is, at present, undergoing a good deal of visual inspection by trained people for the purpose of pattern recognition. In this way comparisons between machine and human performance may be obtained. A practical result also serves as additional motivation. Clinical electrocardiograms make up such a class of signals. The approach to the problem presented here centers upon the use of multiple adaptive matched filters that classify normalized signals. The present report fives some of the background for the application of this method. .B CACM October, 1962 .A Stark,L. Okajima, M. Whipple, G. H. .N CA621018 JB March 17, 1978 7:04 PM .X 1325 5 462 462 5 462 462 5 462 462 5 462 462 6 462 .I 463 .T On Ambiguity in Phrase Structure Languages .B CACM October, 1962 .A Floyd, R. W. .N CA621017 JB March 17, 1978 7:05 PM .X 249 4 463 254 4 463 272 4 463 1102 4 463 1109 4 463 1140 4 463 1188 4 463 1306 4 463 1464 4 463 1491 4 463 1767 4 463 1781 4 463 1787 4 463 1949 4 463 321 4 463 2059 4 463 2126 4 463 435 4 463 437 4 463 463 4 463 483 4 463 491 4 463 2732 4 463 560 4 463 583 4 463 3073 4 463 627 4 463 631 4 463 632 4 463 642 4 463 644 4 463 653 4 463 680 4 463 761 4 463 762 4 463 763 4 463 123 4 463 140 4 463 919 4 463 989 4 463 196 5 463 1306 5 463 1781 5 463 463 5 463 463 5 463 463 5 463 123 6 463 196 6 463 196 6 463 919 6 463 990 6 463 1007 6 463 1046 6 463 1131 6 463 1139 6 463 1140 6 463 1149 6 463 1198 6 463 1215 6 463 1223 6 463 1265 6 463 1303 6 463 1323 6 463 1358 6 463 1366 6 463 1421 6 463 1460 6 463 1462 6 463 1463 6 463 1467 6 463 1468 6 463 1477 6 463 1491 6 463 1496 6 463 1531 6 463 1535 6 463 1565 6 463 1601 6 463 1602 6 463 1613 6 463 1614 6 463 1626 6 463 1641 6 463 1787 6 463 1788 6 463 205 6 463 224 6 463 249 6 463 288 6 463 316 6 463 381 6 463 398 6 463 11 6 463 404 6 463 410 6 463 463 6 463 463 6 463 464 6 463 483 6 463 3184 6 463 3188 6 463 584 6 463 600 6 463 680 6 463 691 6 463 763 6 463 799 6 463 .I 464 .T Syntactic Analysis by Digital Computer .W This paper provides an account of the Shadow language that is used to describe syntax and of a corresponding subroutine that enables a computer to perform syntactic analysis. The input to this subroutine consists of a string to be analyzed and a description of the syntax that is to be used. The syntax is expressed in the Shadow language. The output consists of a trace table that expresses the results of the syntactic analysis in a tabular form. Several versions of the subroutine and some associated programs have been in use now for over three years. The present account of the language and the subroutine contains a summary of material that has been described previously in unpublished reports and also some additional discussion of the work in relation to the more general questions of problem-oriented languages and string transformations. .B CACM October, 1962 .A Barnett, M. P. Futrelle, R. P. .N CA621016 JB March 17, 1978 7:11 PM .X 1046 4 464 1105 4 464 1139 4 464 1140 4 464 1234 4 464 1263 4 464 1265 4 464 1496 4 464 1781 4 464 1824 4 464 2126 4 464 2546 4 464 464 4 464 464 4 464 584 4 464 631 4 464 653 4 464 680 4 464 720 4 464 763 4 464 795 4 464 799 4 464 945 4 464 1062 5 464 1121 5 464 1139 5 464 1265 5 464 265 5 464 1781 5 464 404 5 464 464 5 464 464 5 464 464 5 464 720 5 464 759 5 464 123 6 464 196 6 464 919 6 464 990 6 464 1007 6 464 1046 6 464 1131 6 464 1139 6 464 1140 6 464 1149 6 464 1198 6 464 1215 6 464 1223 6 464 1265 6 464 1303 6 464 1323 6 464 1358 6 464 1366 6 464 1421 6 464 1460 6 464 1462 6 464 1463 6 464 1467 6 464 1468 6 464 1477 6 464 1491 6 464 1496 6 464 1531 6 464 1535 6 464 1565 6 464 1601 6 464 1602 6 464 1613 6 464 1614 6 464 1626 6 464 1641 6 464 1787 6 464 1788 6 464 205 6 464 224 6 464 224 6 464 249 6 464 265 6 464 288 6 464 316 6 464 381 6 464 398 6 464 399 6 464 11 6 464 404 6 464 404 6 464 404 6 464 410 6 464 438 6 464 463 6 464 464 6 464 464 6 464 464 6 464 464 6 464 464 6 464 464 6 464 464 6 464 474 6 464 483 6 464 3184 6 464 3184 6 464 3188 6 464 584 6 464 600 6 464 631 6 464 631 6 464 635 6 464 680 6 464 691 6 464 759 6 464 763 6 464 794 6 464 799 6 464 .I 465 .T PERM (Algorithm 115) .B CACM October, 1962 .A Schrack, G. F. .N CA621015 JB March 17, 1978 7:12 PM .X 465 5 465 465 5 465 465 5 465 .I 466 .T General Order Arithmetic (Algorithm 93) .B CACM October, 1962 .A George, R. .N CA621014 JB March 17, 1978 7:13 PM .X 466 5 466 466 5 466 466 5 466 .I 467 .T Permutation Generator (Algorithm 87) .B CACM October, 1962 .A Schrack, G. F. Shimrat, M. .N CA621013 JB March 17, 1978 7:14 PM .X 467 5 467 467 5 467 467 5 467 .I 468 .T Incomplete Elliptic Integrals (Algorithm 73) .B CACM October, 1962 .A Jefferson, D. K. .N CA621012 JB March 17, 1978 7:14 PM .X 468 5 468 468 5 468 468 5 468 .I 469 .T Critical Path Scheduling (Algorithm 40) .B CACM October, 1962 .A Hellberg, L. .N CA621011 JB March 17, 1978 7:15 PM .X 469 5 469 469 5 469 469 5 469 .I 470 .T Summation of Fourier Series (Algorithm 128) .B CACM October, 1962 .A Wells, M. .N CA621010 JB March 17, 1978 7:16 PM .X 470 5 470 470 5 470 470 5 470 .I 471 .T ORTHO (Algorithm 127) .B CACM October, 1962 .A Walsh, P. J. .N CA621009 JB March 17, 1978 7:17 PM .X 471 5 471 471 5 471 471 5 471 .I 472 .T Gauss' Method (Algorithm 126) .B CACM October, 1962 .A Counts, J. W. .N CA621008 JB March 17, 1978 7:18 PM .X 2075 5 472 472 5 472 472 5 472 472 5 472 472 6 472 .I 473 .T WEIGHTCOEFF (Algorithm 125) .B CACM October, 1962 .A Rutishauser, H. .N CA621007 JB March 17, 1978 7:19 PM .X 473 5 473 473 5 473 473 5 473 .I 474 .T Input Data Organization in Fortran .B CACM October, 1962 .A Yarbrough, L.D. .N CA621006 JB March 17, 1978 7:20 PM .X 1053 5 474 474 5 474 474 5 474 474 5 474 720 5 474 265 6 474 435 6 474 464 6 474 474 6 474 474 6 474 718 6 474 720 6 474 .I 475 .T A Test Matrix for Inversion Procedures .B CACM October, 1962 .A Pei, M. L. .N CA621005 JB March 17, 1978 7:21 PM .X 1963 5 475 475 5 475 475 5 475 475 5 475 909 6 475 475 6 475 750 6 475 .I 476 .T Further Remarks on Sampling a Tape File-II .B CACM October, 1962 .A Nadler, M. .N CA621004 JB March 17, 1978 7:22 PM .X 476 5 476 476 5 476 476 5 476 .I 477 .T Further Remarks on Sampling a Tape File-I .B CACM October, 1962 .A Muller, M. E. .N CA621003 JB March 17, 1978 7:23 PM .X 477 4 477 6 5 477 477 5 477 477 5 477 477 5 477 .I 478 .T Implementing a Stack .B CACM October, 1962 .A Baecker, H.D. .N CA621002 JB March 17, 1978 7:25 PM .X 478 5 478 478 5 478 478 5 478 .I 479 .T A Dispersion Pass Algorithm for the Polyphase Merge .W This paper presents a new manner of dispersing strings for a Polyphase merge. If the number of strings dispersed is between two levels acceptable by Polyphase merge, a more economical technique of reaching the next level for Polyphase merge is shown and proved. .B CACM October, 1962 .A Mendoza, A. G. .N CA621001 JB March 17, 1978 7:27 PM .X 2146 4 479 479 4 479 479 4 479 862 4 479 863 4 479 264 5 479 299 5 479 479 5 479 479 5 479 479 5 479 860 5 479 862 5 479 861 6 479 299 6 479 479 6 479 479 6 479 .I 480 .T Quick Calculation of Jacobian Elliptic Functions (Corrigendum) .B CACM September, 1962 .A Salzer, H. E. .N CA620912 JB March 17, 1978 7:28 PM .X 480 5 480 480 5 480 480 5 480 .I 481 .T A One-Day Look At Computing .B CACM September, 1962 .A Armerding, G. W. Gruenberger, F. J. Marks, S. L. Parkin, T. R. .N CA620911 JB March 17, 1978 7:30 PM .X 481 5 481 481 5 481 481 5 481 .I 482 .T TALL-A List Processor for the Philco 200 Computer .B CACM September, 1962 .A Feldman, J. .N CA620910 JB March 17, 1978 7:31 PM .X 482 5 482 482 5 482 482 5 482 .I 483 .T On the Nonexistence of a Phrase Structure Grammar for ALGOL 60 .W ALGOL 60 is defined partly by formal mechanisms of phrase structure grammar, partly by informally stated restrictions. It is shown that no formal mechanisms of the type used are sufficient to define ALGOL 60. .B CACM September, 1962 .A Floyd, R. W. .N CA620909 JB March 17, 1978 7:33 PM .X 249 4 483 254 4 483 272 4 483 1102 4 483 1109 4 483 1140 4 483 1188 4 483 1306 4 483 1464 4 483 1491 4 483 1767 4 483 1781 4 483 1787 4 483 1949 4 483 321 4 483 2059 4 483 2126 4 483 435 4 483 437 4 483 463 4 483 483 4 483 491 4 483 2732 4 483 560 4 483 583 4 483 3073 4 483 627 4 483 631 4 483 632 4 483 642 4 483 644 4 483 653 4 483 680 4 483 761 4 483 762 4 483 763 4 483 123 4 483 140 4 483 919 4 483 989 4 483 196 5 483 949 5 483 1102 5 483 1142 5 483 1781 5 483 1945 5 483 483 5 483 483 5 483 483 5 483 762 5 483 823 6 483 123 6 483 196 6 483 196 6 483 196 6 483 914 6 483 915 6 483 917 6 483 919 6 483 984 6 483 989 6 483 990 6 483 990 6 483 1007 6 483 1012 6 483 1046 6 483 1084 6 483 1098 6 483 1122 6 483 1131 6 483 1138 6 483 1139 6 483 1139 6 483 1140 6 483 1141 6 483 1149 6 483 1198 6 483 1200 6 483 1215 6 483 1223 6 483 1223 6 483 1265 6 483 1265 6 483 1303 6 483 1323 6 483 1336 6 483 1358 6 483 1366 6 483 1396 6 483 1421 6 483 1455 6 483 1460 6 483 1462 6 483 1463 6 483 1467 6 483 1468 6 483 1477 6 483 1477 6 483 1487 6 483 1491 6 483 1491 6 483 1496 6 483 1496 6 483 1531 6 483 1535 6 483 1565 6 483 1601 6 483 1602 6 483 1613 6 483 1614 6 483 1626 6 483 1641 6 483 1787 6 483 1788 6 483 205 6 483 209 6 483 210 6 483 224 6 483 249 6 483 249 6 483 288 6 483 316 6 483 381 6 483 398 6 483 11 6 483 404 6 483 406 6 483 410 6 483 463 6 483 464 6 483 483 6 483 483 6 483 483 6 483 483 6 483 483 6 483 483 6 483 3184 6 483 3184 6 483 3188 6 483 584 6 483 584 6 483 584 6 483 600 6 483 669 6 483 680 6 483 680 6 483 691 6 483 763 6 483 763 6 483 799 6 483 .I 484 .T Hankel Function (Algorithm 124) .B CACM September, 1962 .A Schaefer, L. J. .N CA620908 JB March 17, 1978 7:34 PM .X 484 5 484 484 5 484 484 5 484 .I 485 .T Real Error Function, ERF(x) (Algorithm 123) .B CACM September, 1962 .A Crawford, M. Techo, R. .N CA620907 JB March 17, 1978 7:35 PM .X 1157 5 485 485 5 485 485 5 485 485 5 485 836 6 485 1081 6 485 485 6 485 714 6 485 .I 486 .T Tridiagonal Matrix (Algorithm 122) .B CACM September, 1962 .A Dietzel, G. F. .N CA620906 JB March 17, 1978 7:36 PM .X 486 5 486 486 5 486 486 5 486 .I 487 .T NORMDEV (Algorithm 121) .B CACM September, 1962 .A Shafer,D. .N CA620905 JB March 17, 1978 7:38 PM .X 487 5 487 487 5 487 487 5 487 .I 488 .T A Heuristic for Page Turning In a Multiprogrammed Computer .B CACM September, 1962 .A Weil, J. W. .N CA620904 JB March 17, 1978 7:40 PM .X 1754 4 488 2358 4 488 488 4 488 274 5 488 488 5 488 488 5 488 488 5 488 .I 489 .T Current Status of IPL-V for the Philco 2000 Computer (June 1962) .B CACM September, 1962 .A Shaffer, S. S. .N CA620903 JB March 17, 1978 7:41 PM .X 489 5 489 489 5 489 489 5 489 .I 490 .T Programmed Methods for Printer Graphical Output .B CACM September, 1962 .A Garfinkel, D. .N CA620902 JB March 17, 1978 8:56 PM .X 490 5 490 490 5 490 490 5 490 .I 491 .T Use of Multiprogramming in the Design of a Low Cost Digital Computer .B CACM September, 1962 .A Penny, J. P. Pearcey, T. .N CA620901 JB March 17, 1978 8:57 PM .X 249 4 491 254 4 491 272 4 491 1102 4 491 1109 4 491 1140 4 491 1188 4 491 1306 4 491 1464 4 491 1491 4 491 1713 4 491 1713 4 491 1767 4 491 1781 4 491 1787 4 491 1901 4 491 1901 4 491 1949 4 491 321 4 491 2059 4 491 2126 4 491 435 4 491 437 4 491 463 4 491 483 4 491 491 4 491 491 4 491 491 4 491 491 4 491 2732 4 491 560 4 491 583 4 491 3073 4 491 627 4 491 631 4 491 632 4 491 642 4 491 644 4 491 653 4 491 680 4 491 761 4 491 762 4 491 763 4 491 123 4 491 140 4 491 168 4 491 919 4 491 989 4 491 168 5 491 185 5 491 196 5 491 491 5 491 491 5 491 491 5 491 46 5 491 3193 5 491 796 5 491 491 6 491 491 6 491 .I 492 .T Analysis of a File Addressing Method .W This paper presents a new file addressing method based on the calculation of an address from the identification of a record. For large recirculating type files, it seems to be more advantageous than customary ones. The probability distribution of the displacement of records from their calculated address, which is one less than the number of probes required to address a record, is computed on the basis of a Markov chain model. For the reader not interested in the mathematics, the introduction and the summary should be sufficient. .B CACM August, 1962 .A Schay Jr., G. Spruth, W. G. .N CA620836 JB March 17, 1978 9:02 PM .X 911 5 492 1785 5 492 2203 5 492 2860 5 492 492 5 492 492 5 492 492 5 492 911 6 492 911 6 492 1328 6 492 1785 6 492 1786 6 492 332 6 492 332 6 492 2107 6 492 2109 6 492 2203 6 492 492 6 492 492 6 492 492 6 492 492 6 492 .I 493 .T The Property Classification Method of File Design and Processing .B CACM August, 1962 .A McGee, W. C. .N CA620835 JB March 17, 1978 9:03 PM .X 1135 4 493 1136 4 493 493 4 493 2710 4 493 2765 4 493 2888 4 493 2906 4 493 729 4 493 1136 5 493 493 5 493 493 5 493 493 5 493 616 5 493 493 6 493 616 6 493 657 6 493 .I 494 .T A Finite Sequentially Compact Process for the Adjoints of Matrices Over Arbitrary Integral Domains .B CACM August, 1962 .A Luther, H. A. Guseman Jr., L. F. .N CA620834 JB March 17, 1978 9:04 PM .X 494 5 494 494 5 494 494 5 494 .I 495 .T A Procedure for Inverting Large Symmetric Matrices .W In the least squares method for simultaneous adjustment of several parameters, the coefficients of the normal equations are the elements of a symmetric positive-definite matrix. In order to solve the normal equations and evaluate the precision measures of the resulting parameters, inversion of this matrix of coefficients is required. Many available procedures for matrix inversion do not take advantage of the symmetry. Thus, when programmed for a high-speed computer, all n^2 elements must be stored and manipulated, whereas only (n + 1)/2 of them are independent. In order to allow a computer of given memory capacity to handle a larger matrix, the following procedure for inverting a symmetric matrix has been devised. .B CACM August, 1962 .A Busing, W. R. Levy, H. S. .N CA620833 JB March 17, 1978 9:09 PM .X 495 5 495 495 5 495 495 5 495 .I 496 .T A Set of Matrices for Testing Computer Programs .B CACM August, 1962 .A Brenner, J. L. .N CA620832 JB March 17, 1978 9:10 PM .X 1047 5 496 496 5 496 496 5 496 496 5 496 496 6 496 .I 497 .T Further Remarks on Line Segment Curve-Fitting Using Dynamic Programming .W In a recent paper, Bellman showed how dynamic programming could be used to determine the solution to a problem previously considered by Stone. The problem comprises the determination, given N, of the N points of subdivision of a given interval (a,B) and the corresponding line segments, that give the best least squares fit to a function g(x) in the interval. Bellman confined himself primarily to the analytical derivation, suggesting briefly, however, how the solution of the equation derived for each particular point of subdivision u(i) could be reduced to a discrete search. In this paper, the computational procedure is considered more fully, and the similarities to some of Stone's equations are indicated. It is further shown that an equation for u(i) involving no minimization may be found. In addition, it is shown how Bellman's method may be applied to the curve-fitting problem when the additional constraints are added that the ends of the line segments must be on the curve. .B CACM August, 1962 .A Gluss, B. .N CA620831 JB March 17, 1978 9:19 PM .X 497 4 497 867 4 497 317 5 497 497 5 497 497 5 497 497 5 497 867 5 497 317 6 497 497 6 497 .I 498 .T Magic Square (Algorithm 117 & 118) .B CACM August, 1962 .A Collison, D. M. .N CA620830 JB March 17, 1978 9:20 PM .X 498 5 498 498 5 498 498 5 498 .I 499 .T Permutation Generator (Algorithm 87) .B CACM August, 1962 .A Collison, D. M. .N CA620829 JB March 17, 1978 9:22 PM .X 499 5 499 499 5 499 499 5 499 .I 500 .T PERMUTE (Algorithm 86) .B CACM August, 1962 .A Collison, D. M. .N CA620828 JB March 17, 1978 9:23 PM .X 500 5 500 500 5 500 500 5 500 .I 501 .T JACOBI (Algorithm 85) .B CACM August, 1962 .A Hillmore, J. S. .N CA620827 JB March 17, 1978 9:24 PM .X 2349 5 501 501 5 501 501 5 501 501 5 501 1648 6 501 1716 6 501 1794 6 501 1894 6 501 2043 6 501 501 6 501 613 6 501 774 6 501 .I 502 .T Simpson's Integration (Algorithm 84) .B CACM August, 1962 .A George, R. .N CA620826 JB March 17, 1978 9:25 PM .X 502 5 502 502 5 502 502 5 502 .I 503 .T Rational Roots of Polynomials with Integer Coefficients (Algorithm 78) .B CACM August, 1962 .A Collison, D. M. .N CA620825 JB March 17, 1978 9:27 PM .X 503 5 503 503 5 503 503 5 503 .I 504 .T FACTORS (Algorithm 75) .B CACM August, 1962 .A Hillmore, J. S. .N CA620824 JB March 17, 1978 9:28 PM .X 504 5 504 504 5 504 504 5 504 .I 505 .T Composition Generator (Algorithm 72) .B CACM August, 1962 .A Collison, D. M. .N CA620823 JB March 17, 1978 9:29 PM .X 505 5 505 505 5 505 505 5 505 .I 506 .T PERMUTATION (Algorithm 71) .B CACM August, 1962 .A Hillmore, J. S. .N CA620822 JB March 17, 1978 9:30 PM .X 506 5 506 506 5 506 506 5 506 .I 507 .T Partition, Quicksort, Find (Algorithm 63, 64, 65) .B CACM August, 1962 .A Hillmore, J. S. .N CA620821 JB March 17, 1978 9:32 PM .X 2679 5 507 507 5 507 507 5 507 507 5 507 970 6 507 1175 6 507 1190 6 507 1228 6 507 1969 6 507 1997 6 507 308 6 507 2042 6 507 3187 6 507 507 6 507 716 6 507 783 6 507 .I 508 .T Matrix Inversion (Algorithm 58) .B CACM August, 1962 .A George, R. .N CA620820 JB March 17, 1978 9:32 PM .X 508 5 508 508 5 508 508 5 508 .I 509 .T Matrix Inversion (Algorithm 58) .B CACM August, 1962 .A Struble, G. .N CA620819 JB March 17, 1978 9:33 PM .X 509 5 509 509 5 509 509 5 509 .I 510 .T Ber or Bei Function (Algorithm 57) .B CACM August, 1962 .A Thacher Jr., H. C. .N CA620818 JB March 17, 1978 9:34 PM .X 510 5 510 510 5 510 510 5 510 .I 511 .T A Set of Test Matrices (Algorithm 52) .B CACM August, 1962 .A Hillmore, J. S. .N CA620817 JB March 17, 1978 9:35 PM .X 1707 5 511 511 5 511 511 5 511 511 5 511 1047 6 511 511 6 511 .I 512 .T Telescope 1 (Algorithm 37) .B CACM August, 1962 .A Thacher Jr., H. C. .N CA620816 JB March 17, 1978 9:36 PM .X 512 5 512 512 5 512 512 5 512 .I 513 .T SIEVE (Algorithm 35) .B CACM August, 1962 .A Hillmore, J. S. .N CA620815 JB March 17, 1978 9:37 PM .X 513 5 513 513 5 513 513 5 513 .I 514 .T Binomial Coefficients (Algorithm 19) .B CACM August, 1962 .A George, R. .N CA620814 JB March 17, 1978 9:40 PM .X 514 5 514 514 5 514 514 5 514 .I 515 .T Rational Interpolation by Continued Fractions (Algorithm 18) .B CACM August, 1962 .A Thacher Jr., H. C. .N CA620813 JB March 17, 1978 9:41 PM .X 515 5 515 515 5 515 515 5 515 .I 516 .T Matrix Inversion II (Algorithm 120) .B CACM August, 1962 .A George, R. .N CA620812 JB March 17, 1978 9:42 PM .X 516 5 516 516 5 516 516 5 516 .I 517 .T Evaluation of Pert Network (Algorithm 119) .B CACM August, 1962 .A Eisenman, B. Shapiro, M. .N CA620811 JB March 17, 1978 9:44 PM .X 517 5 517 517 5 517 517 5 517 .I 518 .T Magic Square (Odd Order) (Algorithm 118) .B CACM August, 1962 .A Collison, D. M. .N CA620810 JB March 17, 1978 9:45 PM .X 2082 5 518 518 5 518 518 5 518 518 5 518 1491 6 518 518 6 518 .I 519 .T Magic Square (Even Order) (Algorithm 117) .B CACM August, 1962 .A Collison, D. M. .N CA620809 JB March 17, 1978 9:46 PM .X 519 5 519 519 5 519 519 5 519 .I 520 .T Complex Division (Algorithm 116) .B CACM August, 1962 .A Smith, R. L. .N CA620808 JB March 17, 1978 9:47 PM .X 520 5 520 520 5 520 520 5 520 .I 521 .T PERM (Algorithm 115) .B CACM August, 1962 .A Trotter, H. F. .N CA620807 JB March 17, 1978 9:57 PM .X 2044 5 521 2189 5 521 2417 5 521 2505 5 521 2874 5 521 2908 5 521 521 5 521 521 5 521 521 5 521 996 6 521 1558 6 521 1594 6 521 1682 6 521 2087 6 521 2189 6 521 2227 6 521 2230 6 521 2292 6 521 2317 6 521 2505 6 521 2683 6 521 2871 6 521 2884 6 521 3191 6 521 521 6 521 521 6 521 521 6 521 521 6 521 521 6 521 521 6 521 .I 522 .T Generation of Partitions with Constraints (Algorithm 114) .B CACM August, 1962 .A Stockmal, F. .N CA620806 JB March 17, 1978 7:28 PM .X 522 5 522 522 5 522 522 5 522 .I 523 .T TREESORT (Algorithm 113) .B CACM August, 1962 .A Floyd,R. W. .N CA620805 JB March 17, 1978 7:29 PM .X 523 5 523 523 5 523 523 5 523 .I 524 .T Position of Point Relative to Polygon (Algorithm 112) .B CACM August, 1962 .A Shimrat, M. .N CA620804 JB March 17, 1978 7:30 PM .X 1804 5 524 2987 5 524 524 5 524 524 5 524 524 5 524 1326 6 524 1630 6 524 2125 6 524 2547 6 524 2633 6 524 421 6 524 421 6 524 524 6 524 524 6 524 .I 525 .T A Computer Technique for Handling Analysis of Variance .B CACM August, 1962 .A Howell, J. R. .N CA620803 JB March 17, 1978 7:32 PM .X 525 5 525 525 5 525 525 5 525 .I 526 .T Character Manipulation in Fortran .B CACM August, 1962 .A Pyle, I. C. .N CA620802 JB March 17, 1978 7:33 PM .X 526 5 526 526 5 526 526 5 526 .I 527 .T The Description List of Concepts .W A concept is defined as a class of objects whose members can be distinguished by processing its properties. Property is defined to mean a partition of the set of all objects into disjoint classes. The formal definition of a concept is recursive in nature. A concept is described by a list structure. A one-to-one correspondence is established between the recursive definition of a concept and its description list structure. Like the definition, the description list structure of a concept is also built up from elementary list structures by a recursive process. The list structures obtained this way are compared with the description list structure discussed by the author in a previous publication. .B CACM August, 1962 .A Banerji, R. B. .N CA620801 JB March 17, 1978 7:39 PM .X 527 5 527 527 5 527 527 5 527 .I 528 .T FORTRAN for Business Data Processing .B CACM July, 1962 .A Robbins, D. K. .N CA620733 JB March 17, 1978 7:41 PM .X 1330 5 528 528 5 528 528 5 528 528 5 528 528 6 528 728 6 528 .I 529 .T Regression and Coded Patterns in Data Editing .B CACM July, 1962 .A Robison, D. E. Aroian, L. A. .N CA620732 JB March 17, 1978 7:42 PM .X 529 5 529 529 5 529 529 5 529 .I 530 .T A Computer Method for Radiation Treatment Planning .B CACM July, 1962 .A Siler, W. Laughlin, J. S. .N CA620731 JB March 17, 1978 7:43 PM .X 530 5 530 530 5 530 530 5 530 .I 531 .T Person-Matching by Electronic Methods .W Record linkage in the updating of files is accomplished in many establishments through the use of a preassigned number, such as payroll number, customer number, or social security number. In vital and health records, however, a unique number is generally not preassigned to an individual for purposes of reporting services received to the health department. In order to determine whether different physician reports refer to the same individual, name and other identification must be compared. This is a laborious operation which is subject to various errors because of name misspellings, changes of name upon marriage, and other problems. We are interested in the maintenance of a psychiatric case register in Maryland, where many of the reports from over a hundred psychiatric agencies refer to the same patient. These records must be linked in order to provide unduplicated counts of individuals under care and longitudinal records of psychiatric history. An earlier paper [1] describes our general procedures for register maintenance by use of a digital computer (Honeywell 800). Here we present in more detail our initial procedures for the person-matching process in order to elicit comments and suggestions from persons who have had experience in matching. .B CACM July, 1962 .A Phillips Jr., W. Bahn, A. K. Miyasaki, M. .N CA620730 JB March 17, 1978 7:51 PM .X 531 5 531 531 5 531 531 5 531 .I 532 .T On the Computation of Rational Approximations to Continuous Functions .B CACM July, 1962 .A Fraser, W. HArt, J. F. .N CA620729 JB March 17, 1978 7:52 PM .X 951 5 532 1015 5 532 1346 5 532 1440 5 532 1645 5 532 532 5 532 532 5 532 532 5 532 951 6 532 962 6 532 532 6 532 532 6 532 532 6 532 532 6 532 532 6 532 .I 533 .T Digital Synthesis of Correlated Stationary Noise .W In this note we propose a method of generating stationary noise with a prescribed auto-covariance function by digital methods. The need for such a technique often arises in testing the performance of data processing and engineering systems, where inputs corrupted with correlated noise (of a known form) are required. The technique is quite simple and produces strict-sense stationary noise which agrees approximately with R(t), the prescribed auto-covariance function (acf), over an interval [-T(0), T(0)]. The method consists of approximating the spectral density by a periodic process with spectral lines, and then synthesizing the periodic noise with random phases and appropriate amplitudes. In order to simplify discussion of the statistical properties of the noise generated, the technique is first presented in terms of exact harmonic analysis. In practice, discrete harmonic analysis as presented in the third section is used. .B CACM July, 1962 .A Peabody, P. R. Adorno, D. S. .N CA620728 JB March 17, 1978 7:59 PM .X 533 5 533 533 5 533 533 5 533 .I 534 .T Quick Calculation of Jacobian Elliptic Functions .B CACM July, 1962 .A Salzer, H. E. .N CA620727 JB March 17, 1978 8:01 PM .X 534 5 534 534 5 534 534 5 534 .I 535 .T Triangular Walk Pattern for the Down-hill Method of Solving a Transcendental Equation .B CACM July, 1962 .A Onoe, M. .N CA620726 JB March 17, 1978 8:02 PM .X 1806 5 535 535 5 535 535 5 535 535 5 535 535 6 535 .I 536 .T Nonlinear Regression and the Solution of Simultaneous Equations .W If one has a set of observables (Z1,...,Zm) which are bound in a relation with certain parameters (A1,...,An) by an equation S(Z1,...;A1,...)=0, one frequently has the problem of determining a set of values of the Ai which minimizes the sum of squares of differences between observed and calculated values of a distinguished observable, say Zm. If the solution of the above equation for Zm, Zm=N(Z1,...;A1,...) gives rise to a function N which is nonlinear in the Ai, then one may rely on a version of Gaussian regression [1,2] for an iteration scheme that converges to a minimizing set of values. It is shown here that this same minimization technique may be used for the solution of simultaneous (not necessarily linear) equations. .B CACM July, 1962 .A Baer, R. M. .N CA620725 JB March 17, 1978 8:09 PM .X 536 5 536 536 5 536 536 5 536 .I 537 .T A Machine Program for Theorem-Proving .W The program of a proof procedure is discussed in connection with trial runs and possible improvements. .B CACM July, 1962 .A Davis, M. Logemann, G. Loveland, D. .N CA620724 JB March 17, 1978 8:11 PM .X 537 5 537 537 5 537 537 5 537 .I 538 .T Quantum Mechanical Integrals of Slater-Type Orbitals (Algorithm 110) .B CACM July, 1962 .A Kruglyak, Y. A. Whitman, D. R. .N CA620723 JB March 17, 1978 8:13 PM .X 538 5 538 538 5 538 538 5 538 .I 539 .T Definite Exponential Integrals B (Algorithm 109) .B CACM July, 1962 .A Kruglyak, Y. A. Whitman, D. R. .N CA620722 JB March 17, 1978 8:15 PM .X 539 5 539 539 5 539 539 5 539 .I 540 .T Definite Exponential Integrals A (Algorithm 108) .B CACM July, 1962 .A Kruglyak, Y. A. Whitman, D. R. .N CA620721 JB March 17, 1978 8:16 PM .X 540 5 540 540 5 540 540 5 540 .I 541 .T Simpson's Integration (Algorithm 84) .B CACM July, 1962 .A Relph, A. P. .N CA620720 JB March 17, 1978 8:17 PM .X 541 5 541 541 5 541 541 5 541 .I 542 .T FACTORS (Algorithm 75) .B CACM July, 1962 .A Relph, A. P. .N CA620719 JB March 17, 1978 8:18 PM .X 542 5 542 542 5 542 542 5 542 .I 543 .T Interpolation by Aitken (Algorithm 70) .B CACM July, 1962 .A Relph, A. P. .N CA620718 JB March 17, 1978 8:19 PM .X 543 5 543 543 5 543 543 5 543 .I 544 .T Ber or Bei Function (Algorithm 57) .B CACM July, 1962 .A Relph, A. P. .N CA620717 JB March 17, 1978 8:21 PM .X 544 5 544 544 5 544 544 5 544 .I 545 .T Adjust Inverse of a Matrix when an Element is Perturbed (Algorithm 51) .B CACM July, 1962 .A George, R. .N CA620716 JB March 17, 1978 8:22 PM .X 545 5 545 545 5 545 545 5 545 .I 546 .T Logarithm of a Complex Number (Algorithm 48) .B CACM July, 1962 .A Johnson, M. L. Sangren, W. .N CA620715 JB March 17, 1978 8:23 PM .X 546 5 546 546 5 546 546 5 546 .I 547 .T Gamma Function (Algorithm 34) .B CACM July, 1962 .A Johnson, M. L. Sangren, W. .N CA620714 JB March 17, 1978 8:25 PM .X 547 5 547 547 5 547 547 5 547 .I 548 .T Molecular-Orbital Calculation of Molecular Interactions .B CACM July, 1962 .A Kruglyak, Y. A. Whitman, D. R. .N CA620713 JB March 17, 1978 8:26 PM .X 548 5 548 548 5 548 548 5 548 .I 549 .T Quantum Mechanical Integrals of Slater-Type Orbitals .B CACM July, 1962 .A Kruglyak, Y. A. Whitman, D. R. .N CA620712 JB March 17, 1978 8:27 PM .X 549 5 549 549 5 549 549 5 549 .I 550 .T Definite Exponential Integrals B (Algorithm 109) .B CACM July, 1962 .A Kruglyak, Y. A. Whitman, D. R. .N CA620711 JB March 17, 1978 8:30 PM .X 550 5 550 550 5 550 550 5 550 .I 551 .T Definite Exponential Integrals A (Algorithm 108) .B CACM July, 1962 .A Kruglyak, Y. A. Whitman, D. R. .N CA620710 JB March 17, 1978 8:31 PM .X 551 5 551 551 5 551 551 5 551 .I 552 .T Gauss's Method (Algorithm 107) .B CACM July, 1962 .A Counts, J. W. .N CA620709 JB March 17, 1978 8:33 PM .X 552 5 552 552 5 552 552 5 552 .I 553 .T Complex Number to a Real Power (Algorithm 106) .B CACM July, 1962 .A Johnson, M. L. Sangren, W. .N CA620708 JB March 17, 1978 8:34 PM .X 553 5 553 553 5 553 553 5 553 .I 554 .T Newton Maehly, (Algorithm 105) .B CACM July, 1962 .A Bauer, F. L. Stoer, J. .N CA620707 JB March 17, 1978 8:44 PM .X 554 5 554 554 5 554 554 5 554 .I 555 .T Reduction to Jacobi (Algorithm 104) .B CACM July, 1962 .A Rutishausr, H. .N CA620706 JB March 17, 1978 8:45 PM .X 555 5 555 555 5 555 555 5 555 .I 556 .T On Translation of Boolean Expressions .B CACM July, 1972 .A Bottenbirruch, H. H Grau, A. A. .N CA620705 JB March 17, 1978 8:52 PM .X 1139 4 556 1947 4 556 556 4 556 799 4 556 399 5 556 556 5 556 556 5 556 556 5 556 .I 557 .T Simulation of Computer Timing Device .B CACM July, 1962 .N CA620704 JB March 17, 1978 8:57 PM .X 1380 4 557 1552 4 557 1693 4 557 1781 4 557 1854 4 557 1860 4 557 2060 4 557 557 4 557 1421 5 557 557 5 557 557 5 557 557 5 557 3184 5 557 1198 6 557 1749 6 557 557 6 557 .I 558 .T A Modified Inversion Procedure for Product Form of the Inverse Linear Programming Codes .W This paper describes a new algorithm for the selection of the pivot row in matrix inversion when using the product form of the inverse. This algorithm has been developed for linear programming codes; however, it would be valuable for the inversion of any non-dense matrix. The procedures described in this paper have been thoroughly tested and have been in operation on the Esso Research and Engineering IBM 7090 computer for nine months. Substantial computer cost savings have been realized because of this procedure. .B CACM July,1962 .A Larsen, L. J. .N CA620703 JB March 17, 1978 9:07 PM .X 558 5 558 558 5 558 558 5 558 .I 559 .T Solution of Eigenvalue Problems With Approximately Known Eigenvectors .B CACM July, 1962 .A Appel, K. .N CA620702 JB March 17, 1978 9:10 PM .X 559 5 559 559 5 559 559 5 559 .I 560 .T Communication Between Independently Translated Blocks .B CACM July, 1962 .A Wegner, P. .N CA620701 JB March 17, 1978 9:11 PM .X 249 4 560 254 4 560 272 4 560 1102 4 560 1109 4 560 1140 4 560 1188 4 560 1306 4 560 1464 4 560 1491 4 560 1767 4 560 1774 4 560 1781 4 560 1787 4 560 1949 4 560 321 4 560 2059 4 560 2126 4 560 435 4 560 437 4 560 463 4 560 483 4 560 491 4 560 2732 4 560 560 4 560 560 4 560 583 4 560 3073 4 560 627 4 560 631 4 560 632 4 560 642 4 560 644 4 560 653 4 560 680 4 560 761 4 560 762 4 560 763 4 560 123 4 560 140 4 560 919 4 560 972 4 560 989 4 560 196 5 560 271 5 560 560 5 560 560 5 560 560 5 560 .I 561 .T Analytic Differentiation By Computer .B CACM June, 1962 .A Hanson, J. W. Caviness, J. S. Joseph, C. .N CA620624 JB March 17, 1978 9:12 PM .X 1134 4 561 1141 4 561 364 4 561 405 4 561 438 4 561 561 4 561 561 4 561 44 4 561 964 5 561 1028 5 561 1216 5 561 1396 5 561 1392 5 561 393 5 561 77 5 561 561 5 561 561 5 561 561 5 561 964 6 561 1028 6 561 1028 6 561 1029 6 561 1029 6 561 1029 6 561 1083 6 561 1132 6 561 1214 6 561 1278 6 561 1334 6 561 1365 6 561 1386 6 561 1387 6 561 1388 6 561 1392 6 561 1393 6 561 1394 6 561 1395 6 561 1396 6 561 1397 6 561 1496 6 561 284 6 561 284 6 561 407 6 561 3199 6 561 3200 6 561 3201 6 561 3202 6 561 3203 6 561 3204 6 561 561 6 561 561 6 561 561 6 561 561 6 561 561 6 561 730 6 561 759 6 561 .I 562 .T AVINT (Algorithm 77) .B CACM June, 1962 .A Whittier, V. E. .N CA620623 JB March 17, 1978 9:14 PM .X 562 5 562 562 5 562 562 5 562 .I 563 .T Sorting Procedures (Algorithm 76) .B CACM June, 1962 .A Randell, B. .N CA620622 JB March 17, 1978 9:15 PM .X 563 5 563 563 5 563 563 5 563 .I 564 .T CRAM (Algorithm 67) .B CACM June, 1962 .A Relph, A. P. .N CA620621 JB March 17, 1978 9:17 PM .X 564 5 564 564 5 564 564 5 564 .I 565 .T INVRS (Algorithm 66) .B CACM June, 1962 .A Caffrey, J. .N CA620620 JB March 17, 1978 9:18 PM .X 565 5 565 565 5 565 565 5 565 .I 566 .T Matrix Inversion (Algorithm 58) .B CACM June, 1962 .A Conger, R. A. .N CA620619 JB March 17, 1978 9:19 PM .X 566 5 566 566 5 566 566 5 566 .I 567 .T Logarithm of a Complex Number (Algorithm 48) .B CACM June, 1962 .A Relph, A. P. .N CA620618 JB March 17, 1978 9:20 PM .X 567 5 567 567 5 567 567 5 567 .I 568 .T Exponential of a Complex Number (Algorithm 46) .B CACM June, 1962 .A Relph, A. P. .N CA620617 JB March 17, 1978 9:21 PM .X 568 5 568 568 5 568 568 5 568 .I 569 .T Binomial Coefficients (Algorithm 19) .B CACM June, 1962 .A Steck, B. .N CA620616 JB March 17, 1978 9:22 PM .X 569 5 569 569 5 569 569 5 569 .I 570 .T Simpson's Rule Integrator (Algorithm 103) .B CACM June, 1962 .A Kuncir, G. F. .N CA620615 JB March 17, 1978 9:24 PM .X 1352 5 570 570 5 570 570 5 570 570 5 570 834 6 570 872 6 570 1040 6 570 1092 6 570 1241 6 570 1273 6 570 324 6 570 429 6 570 570 6 570 621 6 570 786 6 570 .I 571 .T Permutation in Lexicographical Order (Algorithm 102) .B CACM June, 1962 .A Schrack, G. F. Shimrat, M. .N CA620614 JB March 17, 1978 9:25 PM .X 571 5 571 571 5 571 571 5 571 .I 572 .T Add Item to Chain-Linked List (Algorithm 100) .B CACM June, 1962 .A Kiviat, P. J. .N CA620612 JB March 17, 1978 9:26 PM .X 572 5 572 572 5 572 572 5 572 .I 573 .T Remove Item From Chain-Linked List (Algorithm 101) .B CACM June, 1962 .A Kiviat, P. J. .N CA620613 JB March 17, 1978 9:27 PM .X 573 5 573 573 5 573 573 5 573 .I 574 .T Evaluation of Jacobi Symbol (Algorithm 99) .B CACM June, 1962 .A Garland, S. J. Knapp, A. W. .N CA620611 JB March 17, 1978 9:28 PM .X 574 5 574 574 5 574 574 5 574 .I 575 .T Evaluation of Definite Complex Line Integrals (Algorithm 98) .B CACM June, 1962 .A Pfaltz, J. L. .N CA620610 JB March 17, 1978 9:29 PM .X 575 5 575 575 5 575 575 5 575 .I 576 .T Shortest Path (Algorithm 97) .B CACM June, 1962 .A Floyd, R. W. .N CA620609 JB March 17, 1978 9:30 PM .X 1846 5 576 2630 5 576 2650 5 576 576 5 576 576 5 576 576 5 576 830 6 576 1380 6 576 1424 6 576 1484 6 576 1572 6 576 2111 6 576 576 6 576 576 6 576 576 6 576 680 6 576 .I 577 .T ANCESTOR (Algorithm 96) .B CACM June, 1962 .A Floyd, R. W. .N CA620608 JB March 17, 19789:31 PM .X 1836 5 577 577 5 577 577 5 577 577 5 577 1191 6 577 1477 6 577 1491 6 577 1781 6 577 577 6 577 .I 578 .T Generation of Partitions in Part-Count Form (Algorithm 95) .B CACM June, 1962 .A Stockmal, F. .N CA620607 JB March 17, 1978 9:32 PM .X 578 5 578 578 5 578 578 5 578 .I 579 .T COMBINATION (Algorithm 94) .B CACM June, 1962 .A Kurtzberg, J. .N CA620606 JB March 17, 1978 9:33 PM .X 2690 5 579 2853 5 579 579 5 579 579 5 579 579 5 579 3115 5 579 907 6 579 203 6 579 2045 6 579 2417 6 579 2466 6 579 2690 6 579 2884 6 579 579 6 579 579 6 579 579 6 579 785 6 579 .I 580 .T General Order Arithmetic (Algorithm 93) .B CACM June, 1962 .A Perstein, M. H. .N CA620605 JB March 17, 1978 9:34 PM .X 580 5 580 580 5 580 580 5 580 .I 581 .T A Note on Sampling a Tape-File .B CACM June, 1962 .A Jones, T. G. .N CA620604 JB March 17, 1978 9:35 PM .X 581 5 581 581 5 581 581 5 581 .I 582 .T One Lost Bit .B CACM June, 1962 .A Oster, C. A. .N CA620603 JB March 17, 1978 9:36 PM .X 582 5 582 582 5 582 582 5 582 .I 583 .T A Redundancy Check for ALGOL Programs .B CACM June, 1962 .A Thacher Jr., H. C. .N CA620602 JB March 17, 1978 9:37 PM .X 249 4 583 254 4 583 272 4 583 1102 4 583 1109 4 583 1140 4 583 1188 4 583 1306 4 583 1464 4 583 1491 4 583 1767 4 583 1781 4 583 1787 4 583 1949 4 583 321 4 583 2059 4 583 2126 4 583 435 4 583 437 4 583 463 4 583 483 4 583 491 4 583 2732 4 583 560 4 583 583 4 583 3073 4 583 627 4 583 631 4 583 632 4 583 642 4 583 644 4 583 653 4 583 680 4 583 761 4 583 762 4 583 763 4 583 123 4 583 140 4 583 919 4 583 989 4 583 196 5 583 583 5 583 583 5 583 583 5 583 .I 584 .T Report on the Algorithmic Language FORTRAN II .B CACM June, 1962 .A Rabinowitz, I. N. .N CA620601 JB March 17, 1978 9:38 PM .X 1046 4 584 1105 4 584 1139 4 584 1140 4 584 1234 4 584 1263 4 584 1265 4 584 1496 4 584 1781 4 584 1824 4 584 2126 4 584 2546 4 584 464 4 584 584 4 584 631 4 584 653 4 584 680 4 584 763 4 584 795 4 584 799 4 584 945 4 584 949 5 584 1781 5 584 1945 5 584 404 5 584 584 5 584 584 5 584 584 5 584 823 6 584 123 6 584 196 6 584 914 6 584 915 6 584 917 6 584 919 6 584 984 6 584 989 6 584 990 6 584 990 6 584 1007 6 584 1012 6 584 1046 6 584 1084 6 584 1098 6 584 1122 6 584 1131 6 584 1138 6 584 1139 6 584 1139 6 584 1140 6 584 1141 6 584 1149 6 584 1198 6 584 1200 6 584 1215 6 584 1223 6 584 1223 6 584 1265 6 584 1265 6 584 1303 6 584 1323 6 584 1336 6 584 1358 6 584 1366 6 584 1396 6 584 1421 6 584 1455 6 584 1460 6 584 1462 6 584 1463 6 584 1467 6 584 1468 6 584 1477 6 584 1477 6 584 1487 6 584 1491 6 584 1491 6 584 1496 6 584 1496 6 584 1531 6 584 1535 6 584 1565 6 584 1601 6 584 1602 6 584 1613 6 584 1614 6 584 1626 6 584 1641 6 584 1787 6 584 1788 6 584 205 6 584 224 6 584 249 6 584 288 6 584 316 6 584 381 6 584 398 6 584 11 6 584 404 6 584 410 6 584 463 6 584 464 6 584 483 6 584 483 6 584 483 6 584 3184 6 584 3184 6 584 3188 6 584 584 6 584 584 6 584 584 6 584 600 6 584 669 6 584 680 6 584 680 6 584 691 6 584 763 6 584 763 6 584 799 6 584 .I 585 .T Initial Experience With an Operating Multiprogramming System .W The Lewis Research Center has been using various forms and degrees of program simultaneity in the operation of its modified Sperry-Rand Univac Scientific Model 1103 computer during the last five years. This simultaneity has evolved from an initial achievement of self-searching input and output to the automatic time sharing of independently coded problems. Several important machine and program system modifications were necessary to accomplish this evolution. Several additional modifications, although not required, were added to facilitate ease of coding and operation. All modifications had to proceed at a relatively temperate pace to insure that the basic data-reduction work load of the computing center was completed on schedule. Some educationally valuable mistakes were made, and their suggested cures often pointed the way to useful future improvements or emphasized some of the basic principles of a multiprogramming system. The material that follows is a description of the evolution of the programming and hardware system which has developed into the present multiprogramming system at Lewis research Center. .B CACM May, 1962 .A Landis, N. Manos, A. Turner, L. R. .N CA620520 JB March 17, 1978 9:45 PM .X 585 5 585 585 5 585 585 5 585 .I 586 .T Simultaneous System of Equations and Matrix Inversion Routine (Algorithm 92) .B CACM May, 1962 .A Roek, D. J. .N CA620519 JB March 20, 1978 1:31 PM .X 454 5 586 586 5 586 586 5 586 586 5 586 152 6 586 586 6 586 .I 587 .T Romberg Integration (Algorithm 60) .B CACM May, 1962 .A Buchner, K. H. .N CA620518 JB March 20, 1978 1:33 PM .X 1040 5 587 587 5 587 587 5 587 587 5 587 885 6 587 587 6 587 621 6 587 .I 588 .T Chebyshev Curve-Fit (Algorithm 91) .B CACM May, 1962 .A Newhouse, A. .N CA620517 JB March 20, 1978 1:34 PM .X 588 5 588 588 5 588 588 5 588 .I 589 .T Evaluation of the Fresnel Cosine Integral (Algorithm 90) .B CACM May, 1962 .A Cundiff, J. L. .N CA620516 JB March 20, 1978 1:35 PM .X 589 5 589 589 5 589 589 5 589 .I 590 .T Evaluation of the Fresnel Sine Integral (Algorithm 89) .B CACM May, 1962 .A Cundiff, J. L. .N CA620515 JB March 20, 1978 1:36 PM .X 590 5 590 590 5 590 590 5 590 .I 591 .T Evaluation of Asymptotic Expression for the Fresnel Sine and Cosine Integrals (Algorithm 88) .B CACM May, 1962 .A Cundiff, J. L. .N CA620514 JB March 20, 1978 1:37 PM .X 591 5 591 591 5 591 591 5 591 .I 592 .T COBOL Batching Problems .B CACM May, 1962 .A Mullen, J. W. .N CA620513 JB March 20, 1978 1:38 PM .X 592 5 592 592 5 592 592 5 592 .I 593 .T An Introduction to a Machine-Independent Data Division .B CACM May, 1962 .A Mullin, J. P. .N CA620512 JB March 20, 1978 1:39 PM .X 593 5 593 593 5 593 593 5 593 .I 594 .T An Advanced Input-Output System for a COBOL Compiler .B CACM May, 1962 .A Bouman, C. A. .N CA620511 JB March 20, 1978 1:40 PM .X 594 5 594 594 5 594 594 5 594 .I 595 .T Guides to Teaching COBOL .W The teaching of COBOL can be divided into three main subject areas. They are the syntax of COBOL, the use of such syntax in solving any given problem, and programming concepts. It is generally accepted that some knowledge of the hardware and computer logic must be possessed by the programmer. The teaching problem arises in determining how thoroughly a student must know the hardware and logic for that computer for which he will write COBOL programs. Unfortunately, historical data concerning students' programming proficiency is almost non-existent and, at best, difficult to measure. How then might we approach solving this problem? .B CACM May, 1962 .A Greene, I. .N CA620510 JB March 20, 1978 1:44 PM .X 595 5 595 595 5 595 595 5 595 .I 596 .T Floating-Point Arithmetic in COBOL .W In this paper the basic operations of floating-point arithmetic are examined and COBOL procedures for carrying these out are given, along with specification of working storage. The paper concludes with an example in which these procedures are used. .B CACM May, 1962 .A Kesner, O. .N CA620509 JB March 20, 1978 1:46 PM .X 596 5 596 596 5 596 596 5 596 .I 597 .T Modular Data Processing Systems Written in COBOL .B CACM May, 1962 .A Emery, J. C. .N CA620508 JB March 20, 1978 1:47 PM .X 597 5 597 597 5 597 597 5 597 .I 598 .T The COBOL Librarian - A Key to Object Program Efficiency .W Many answers to the question "How may a COBOL Compiler be forced into the generation of an efficient object program?" The purpose of this article is to present one possible answer: the creation and full utilization of a well-constructed COBOL Library. .B CACM May, 1962 .A Hicks, W. .N CA620507 JB March 20, 1978 1:50 PM .X 598 5 598 598 5 598 598 5 598 .I 599 .T A Report Writer For COBOL .B CACM May, 1962 .A Donally, W. L. .N CA620506 JB March 20, 1978 1:51 PM .X 599 5 599 599 5 599 599 5 599 .I 600 .T Syntactical Charts of COBOL 61 .B CACM May, 1962 .A Berman, R. Sharp, J. Sturges, L. .N CA620505 JB March 20, 1978 1:52 PM .X 1781 5 600 600 5 600 600 5 600 600 5 600 123 6 600 196 6 600 919 6 600 990 6 600 1007 6 600 1046 6 600 1131 6 600 1139 6 600 1140 6 600 1149 6 600 1198 6 600 1215 6 600 1223 6 600 1265 6 600 1303 6 600 1323 6 600 1358 6 600 1366 6 600 1421 6 600 1460 6 600 1462 6 600 1463 6 600 1467 6 600 1468 6 600 1477 6 600 1491 6 600 1496 6 600 1531 6 600 1535 6 600 1565 6 600 1601 6 600 1602 6 600 1613 6 600 1614 6 600 1626 6 600 1641 6 600 1787 6 600 1788 6 600 205 6 600 224 6 600 249 6 600 288 6 600 316 6 600 381 6 600 398 6 600 11 6 600 404 6 600 410 6 600 463 6 600 464 6 600 483 6 600 3184 6 600 3188 6 600 584 6 600 600 6 600 680 6 600 691 6 600 763 6 600 799 6 600 .I 601 .T Interim Report on Bureau of Ships COBOL Evaluation Program .B CACM May, 1962 .A Siegel, M. Smith, A. E. .N CA620504 JB March 20, 1978 1:53 PM .X 601 5 601 601 5 601 601 5 601 .I 602 .T COBOL and Compatibility .B CACM May, 1962 .A Lippitt, A. .N CA620503 JB March 20, 1978 1:54 PM .X 602 5 602 602 5 602 602 5 602 .I 603 .T Basic Elements of COBOL 61 .B CACM May, 1962 .A Sammet, J. E. .N CA620502 JB March 20, 1978 1:54 PM .X 1084 5 603 603 5 603 603 5 603 603 5 603 868 6 603 603 6 603 644 6 603 669 6 603 791 6 603 797 6 603 .I 604 .T Why COBOL? .B CACM May, 1962 .A Cunningham, J. F. .N CA620501 JB March 20, 1978 1:55 PM .X 604 5 604 604 5 604 604 5 604 .I 605 .T Computer Simulation Of City Traffic .W In simulating traffic flow on city streets, the National Bureau of Standards has used data processing techniques to tabulate and make motion pictures of vehicle movements in the model. Each vehicle is assigned a digital identification giving points of entry and exit, type of vehicle, desired speed, and actual speed, in proportions simulating field data. Changes in the model can be made to observe their consequences and to determine the ability of a real street to carry loads expected in the future. .B CACM April, 1962 .N CA620412 JB March 20, 1978 2:00 PM .X 605 5 605 605 5 605 605 5 605 .I 606 .T A Method for Eliminating Ambiguity Due to Signal Coincidence in Digital Design .B CACM April, 1962 .A Kaiser, C. J. .N CA620411 JB March 20, 1978 2:16 PM .X 606 5 606 606 5 606 606 5 606 .I 607 .T The Calculation of Easter... .B CACM April, 1962 .A Knuth, D. .N CA620410 JB March 20, 1978 2:17 PM .X 607 5 607 607 5 607 607 5 607 .I 608 .T Permutation (Algorithm 71) .B CACM April, 1962 .A Peck, J. E. L. Schrack, G. F. .N CA620409 JB March 20, 1978 2:18 PM .X 608 5 608 608 5 608 608 5 608 .I 609 .T Permutation (Algorithm 71) .B CACM April, 1962 .A Brown, P. J. .N CA620408 JB March 20, 1978 2:19 PM .X 609 5 609 609 5 609 609 5 609 .I 610 .T SIEVE (Algorithm 35) .B CACM April, 1962 .A Brown, P. J. .N CA620407 JB March 20, 1978 2:20 PM .X 610 5 610 610 5 610 610 5 610 .I 611 .T Permutation Generator (Algorithm 87) .B CACM April, 1962 .A Howell, J. R. .N CA620406 JB March 20, 1978 2:20 PM .X 611 5 611 611 5 611 611 5 611 .I 612 .T Permute (Algorithm 86) .B CACM April, 1962 .A Peck, J. E. L. Schrack, G. F. .N CA620405 JB March 20, 1978 2:21 PM .X 3188 5 612 612 5 612 612 5 612 612 5 612 1594 6 612 612 6 612 .I 613 .T JACOBI (Algorithm 85) .B CACM April, 1962 .A Evans, T. G. .N CA620404 JB March 20, 1978 2:22 PM .X 2349 5 613 613 5 613 613 5 613 613 5 613 1648 6 613 1716 6 613 1794 6 613 1894 6 613 2043 6 613 501 6 613 613 6 613 774 6 613 .I 614 .T Simpson's Integration (Algorithm 84) .B CACM April, 1962 .A Hennion, P. E. .N CA620403 JB March 20, 1978 2:25 PM .X 614 5 614 614 5 614 614 5 614 .I 615 .T Addressing Multidimensional Arrays .W A useful method of representing a function of n variables is to consider the function to assume its values at selected points in n-dimensional space. Although this picture is of value to the analyst, the elements of an n-dimensional array must exist in conventional storage as a linear array or vector. The means of performing the transformation of a set of indices locating on array element in n-space to the location (address) of the element in its storage vector is the subject of this paper. It is noted that the index address transformation is computationally identical to the conversion of a number from a fixed to a mixed radix number system. Several ways of implementing the transformation are described. .B CACM April, 1962 .A Hellerman, H. .N CA620402 JB March 20, 1978 2:29 PM .X 435 5 615 615 5 615 615 5 615 615 5 615 849 5 615 155 6 615 196 6 615 615 6 615 615 6 615 .I 616 .T An Information Algebra - Phase I Report-Language Structure Group of the CODASYL Development Committee .W This report represents the results of the first phase of the work of the Language Structure Group. The goal of this work is to arrive at a proper structure for a machine-independent problem-defining language, at the systems level of data processing. The report is based, for the most part, on a mathematical model called "An Information Algebra" developed primarily by R. Bosak. It is hoped that this report will be read (a) with avid interest by programming language designers and implementors, and all those interested in developing a theoretical approach to data processing; (b) with interest and understanding by professional programmers and systems analysts; and (c) with appreciation by the businessman-analyst-manager. The authors have not attempted an exhaustive discourse in this report. Rather, they have tried to present a philosophy to the professional people who are vitally concerned with providing a working language for the systems analyst's use. They trust that the ideas in this report will stimulate others to think along similar lines. Questions and comments will be welcomed, and can be addressed to any of the members of the Language Structure Group: Robert Bosak, System Development Corporation; Richard F. Clippinger, Honeywell EDP Division; Carey Dobbs, Remington Rand Univac Division; Roy Goldfinger (Chairman), IBM Corporation; Renee B. Jasper, Navy Management Office; William Keating, National Cash Register; George Kendrick, General Electric Company; Jean E. Sammet, IBM Corporation. .B CACM April, 1962 .N CA620401 JB March 20, 1978 2:40 PM .X 1135 5 616 1136 5 616 2710 5 616 2765 5 616 2888 5 616 2906 5 616 493 5 616 616 5 616 616 5 616 616 5 616 729 5 616 1515 6 616 288 6 616 1936 6 616 1976 6 616 2046 6 616 2046 6 616 2046 6 616 2451 6 616 2452 6 616 2715 6 616 493 6 616 616 6 616 616 6 616 616 6 616 616 6 616 616 6 616 616 6 616 616 6 616 616 6 616 657 6 616 .I 617 .T POSEIDON .W Any computer that forms part of a control system-whether completely automatic or partly human-must work at the same speed as the control system. It must perform its calculations or data processing fast enough for the results to be available at the required instants in the action of the control system. This known as working in "real time." .B CACM March, 1962 .A Wheeling, R. F. .N CA620315 JB March 20, 1978 2:51 PM .X 617 5 617 617 5 617 617 5 617 .I 618 .T Computers- The Key to Total Systems Control: An Industrial Viewpoint .W Man-Man-machine processes are characterized in five main types, and the markets for each type are shown for 1950 and 1960 and estimated for 1970. .B CACM March, 1962 .A Carlson, W. M. .N CA620314 JB March 20, 1978 2:53 PM .X 618 5 618 618 5 618 618 5 618 .I 619 .T Retrieval of Misspelled Names in an Airlines Passenger Record System .W This paper discusses the limited problem of recognition and retrieval of a given misspelled name from among a roster of several hundred names, such as the reservation inventory for a given flight of a large jet airliner. A program has been developed and operated on the Telefile (a stored-program core and drum memory solid-state computer) which will retrieve passengers' records successfully, despite significant misspellings either at original entry time or at retrieval time. The procedure involves an automatic scoring technique which matches the names in a condensed form. Only those few names most closely resembling the requested name, with their phone numbers annexed, are presented for the agents final manual selecton. The program has successfully isolated and retrieved names which were subjected to a number of unusual (as well as usual) misspellings. .B CACM March, 1962 .A Davidson, L. .N CA620313 JB March 20, 1978 2:59 PM .X 1112 5 619 1592 5 619 2111 5 619 2339 5 619 440 5 619 619 5 619 619 5 619 619 5 619 830 6 619 982 6 619 1112 6 619 1112 6 619 1112 6 619 1592 6 619 1592 6 619 440 6 619 619 6 619 619 6 619 619 6 619 619 6 619 619 6 619 .I 620 .T RATFACT (Algorithm 78) .B CACM March, 1962 .A Halstead, M. H. .N CA620312 JB March 20, 1978 3:00 PM .X 620 5 620 620 5 620 620 5 620 .I 621 .T Romberg Integration (Algorithm 60) .B CACM March, 1962 .A Thacher Jr., H. C. .N CA620311 JB March 20, 1978 3:01 PM .X 1040 5 621 1352 5 621 2040 5 621 621 5 621 621 5 621 621 5 621 834 6 621 872 6 621 885 6 621 1040 6 621 1092 6 621 1241 6 621 1241 6 621 1273 6 621 1273 6 621 1352 6 621 1356 6 621 324 6 621 324 6 621 429 6 621 570 6 621 587 6 621 621 6 621 621 6 621 621 6 621 786 6 621 .I 622 .T Optimal Classification of Objects (Algorithm 83) .B CACM March, 1962 .A Mayoh, B. H. .N CA620310 JB March 20, 1978 3:02 PM .X 622 5 622 622 5 622 622 5 622 .I 623 .T Economising a Sequence 2 (Algorithm 82) .B CACM March, 1962 .A Mayoh, B. H. .N CA620309 JB March 20, 1978 3:03 PM .X 623 5 623 623 5 623 623 5 623 .I 624 .T Economising a Sequence 1 (Algorithm 81) .B CACM March, 1962 .A Mayoh, B. H. .N CA620308 JB March 20, 1978 3:04 PM .X 624 5 624 624 5 624 624 5 624 .I 625 .T Reciprocal Gamma Function of Real Argument (Algorithm 80) .B CACM March, 1962 .A Holsten, W. .N CA620307 JB March 20, 1978 3:05 PM .X 625 5 625 625 5 625 625 5 625 .I 626 .T A Method of Representation, Storage and Retrieval of 13 Random Codes in a 4-Digit Number or 16 Random Codes in a 5-Digit Number .B CACM March, 1962 .A Foster, M. B. .N CA620306 JB March 20, 1978 3:07 PM .X 626 5 626 626 5 626 626 5 626 .I 627 .T Knotted List Structures .B CACM March, 1962 .A Weizenbaum, J. .N CA620305 JB March 20, 1978 3:07 PM .X 249 4 627 254 4 627 272 4 627 1024 4 627 1050 4 627 1051 4 627 1102 4 627 1102 4 627 1109 4 627 1132 4 627 1140 4 627 1188 4 627 1306 4 627 1390 4 627 1393 4 627 1464 4 627 1486 4 627 1491 4 627 1549 4 627 1549 4 627 1706 4 627 1767 4 627 1781 4 627 1787 4 627 1826 4 627 1878 4 627 1949 4 627 321 4 627 378 4 627 2023 4 627 2059 4 627 2060 4 627 2126 4 627 2155 4 627 2168 4 627 435 4 627 437 4 627 463 4 627 483 4 627 491 4 627 2719 4 627 2723 4 627 2732 4 627 2838 4 627 2842 4 627 2855 4 627 2879 4 627 560 4 627 583 4 627 3073 4 627 3077 4 627 3080 4 627 3106 4 627 3112 4 627 627 4 627 627 4 627 627 4 627 631 4 627 632 4 627 642 4 627 644 4 627 653 4 627 680 4 627 761 4 627 762 4 627 763 4 627 106 4 627 123 4 627 140 4 627 919 4 627 989 4 627 106 5 627 196 5 627 1050 5 627 210 5 627 1549 5 627 2723 5 627 2882 5 627 627 5 627 627 5 627 627 5 627 731 5 627 793 5 627 849 6 627 106 6 627 106 6 627 1051 6 627 1549 6 627 1749 6 627 209 6 627 209 6 627 1826 6 627 210 6 627 210 6 627 367 6 627 2198 6 627 2452 6 627 2651 6 627 406 6 627 627 6 627 627 6 627 627 6 627 627 6 627 627 6 627 627 6 627 731 6 627 731 6 627 753 6 627 .I 628 .T On a Floating-Point Number Representation For Use with Algorithmic Languages .B CACM March, 1962 .A Grau, A. A. .N CA620304 JB March 20, 1978 3:09 PM .X 628 5 628 628 5 628 628 5 628 .I 629 .T On a Wired-In Binary-to-Decimal Conversion Scheme .B CACM March, 1962 .A Lynch, W. C. .N CA620303 JB March 20, 1978 3:10 PM .X 629 5 629 629 5 629 629 5 629 .I 630 .T An Evaluation of Autocode Readability .W Of the many requirements of an autocode, the pair of requirements "easy to read" and "easy to write" are not often compatible. This paper argues that readability can be added automatically in the translation process so that the programmer can enjoy the utmost economy of expression, while for management a full and valid COBOL version is printed to give all the advantages of readability and compatibility. .B CACM March, 1962 .A Ellis, P. V. .N CA620302 JB March 20, 1978 3:15 PM .X 630 5 630 630 5 630 630 5 630 .I 631 .T Automatic-Programming-Language Translation Through Syntactical Analysis* .B CACM March, 1962 .A Ledley, R.S. Wilson, J. B. .N CA620301 JB March 20, 1978 3:17 PM .X 249 4 631 254 4 631 272 4 631 1046 4 631 1102 4 631 1105 4 631 1109 4 631 1139 4 631 1140 4 631 1140 4 631 1188 4 631 1234 4 631 1263 4 631 1265 4 631 1306 4 631 1464 4 631 1491 4 631 1496 4 631 1767 4 631 1781 4 631 1781 4 631 1787 4 631 1824 4 631 1949 4 631 321 4 631 2059 4 631 2126 4 631 2126 4 631 2546 4 631 435 4 631 437 4 631 463 4 631 464 4 631 483 4 631 491 4 631 2732 4 631 560 4 631 583 4 631 584 4 631 3073 4 631 627 4 631 631 4 631 631 4 631 632 4 631 642 4 631 644 4 631 653 4 631 653 4 631 680 4 631 680 4 631 761 4 631 762 4 631 763 4 631 763 4 631 795 4 631 799 4 631 123 4 631 140 4 631 919 4 631 945 4 631 989 4 631 196 5 631 1139 5 631 1265 5 631 1665 5 631 404 5 631 631 5 631 631 5 631 631 5 631 763 5 631 196 6 631 1781 6 631 224 6 631 224 6 631 378 6 631 399 6 631 404 6 631 404 6 631 404 6 631 412 6 631 438 6 631 464 6 631 464 6 631 3184 6 631 631 6 631 631 6 631 631 6 631 631 6 631 635 6 631 799 6 631 .I 632 .T Vectorcardiographic Diagnosis With The Aid of ALGOL .B CACM February, 1962 .A Forsythe, G. E. Von Der Groeben, J. Toole, J. G. .N CA620211 JB March 20, 1978 3:41 PM .X 249 4 632 254 4 632 272 4 632 1102 4 632 1109 4 632 1140 4 632 1188 4 632 1306 4 632 1464 4 632 1491 4 632 1767 4 632 1781 4 632 1787 4 632 1949 4 632 321 4 632 2059 4 632 2126 4 632 435 4 632 437 4 632 463 4 632 483 4 632 491 4 632 2732 4 632 560 4 632 583 4 632 3073 4 632 627 4 632 631 4 632 632 4 632 642 4 632 644 4 632 653 4 632 680 4 632 761 4 632 762 4 632 763 4 632 123 4 632 140 4 632 919 4 632 989 4 632 196 5 632 632 5 632 632 5 632 632 5 632 .I 633 .T Simulation and Analysis of Biochemical Systems (III. Analysis and Pattern Recognition) .B CACM February, 1962 .A Garfinkel, D. Polk, W. Higgins, J. J. Ochser, R. T. .N CA620210 JB March 20, 1978 3:43 PM .X 238 4 633 633 4 633 633 4 633 643 4 633 238 5 633 633 5 633 633 5 633 633 5 633 643 5 633 238 6 633 633 6 633 633 6 633 643 6 633 .I 634 .T Manipulation of Trees in Information Retrieval* .B CACM February, 1962 .A Salton, G. .N CA620209 JB March 20, 1978 3:44 PM .X 1087 4 634 634 4 634 931 5 634 1324 5 634 329 5 634 634 5 634 634 5 634 634 5 634 202 6 634 396 6 634 634 6 634 634 6 634 652 6 634 653 6 634 .I 635 .T A Note on Multiplying Boolean Matrices .B CACM February, 1962 .A Baker, J. J. .N CA620208 JB March 20, 1978 3:45 PM .X 1151 5 635 1265 5 635 2769 5 635 635 5 635 635 5 635 635 5 635 404 6 635 464 6 635 3184 6 635 631 6 635 635 6 635 635 6 635 635 6 635 .I 636 .T Tape Splitting in an Iterative Program .B CACM February, 1962 .A Weisert, C. .N CA620207 JB March 20, 1978 3:46 PM .X 1117 5 636 636 5 636 636 5 636 636 5 636 861 6 636 862 6 636 636 6 636 .I 637 .T A NELIAC-Generated 7090-1401 Compiler .W NELIAC systems for several different machines have been generated using the original NELIAC system developed at the Naval Electronics Laboratory, San Diego, in 1958. A basic "bootstrap" process was used to generate all but the first, i.e. the systems were described in the NELIAC language and generated by an existing NELIAC compiler. This experience has shown there is no inherent difficulty in "building compilers with compilers"; indeed, it pointed out many advantages in using a POL for constructing programming systems. This report presents the results of a project completed in May, 1961 in which the NELIAC system was used to generate a compiler for the IBM 1401. The 1401 compiler, which runs on the 7090 and produces 1401 programs, was described in the NELIAC language and generated with 7090 NELIAC system. The reduction in programming time and the improvement in documentation of the system were very significant. .B CACM February, 1962 .A Watt, J. B. Wattenburg, W. H. .N CA620206 JB March 20, 1978 3:52 PM .X 1781 4 637 637 4 637 637 4 637 123 4 637 123 5 637 165 5 637 637 5 637 637 5 637 637 5 637 .I 638 .T SURGE: A Recoding of the COBOL Merchandise Control Algorithm .B CACM February, 1962 .A Longo, L. F. .N CA620205 JB March 20, 1978 3:53 PM .X 638 4 638 300 5 638 638 5 638 638 5 638 638 5 638 .I 639 .T Difference Expression Coefficients (Algorithm 79) .B CACM February, 1962 .A Giammo, T. P. .N CA620204 JB March 20, 1978 3:54 PM .X 639 5 639 639 5 639 639 5 639 .I 640 .T Rational Roots of Polynomials with Integer Coefficients (Algorithm 78) .B CACM February, 1962 .A Perry, C. .N CA620203 JB March 20, 1978 3:55 PM .X 640 5 640 640 5 640 640 5 640 .I 641 .T Interpolation, Differentiation, and Integration (Algorithm 77) .B CACM February, 1962 .A Hennion, P. E. .N CA620202 JB March 20, 1978 3:56 PM .X 641 5 641 641 5 641 641 5 641 .I 642 .T An Introduction to ALGOL .B CACM February, 1962 .A Schwarz, H. R. .N CA620201 JB March 20, 1978 3:57 PM .X 205 4 642 210 4 642 214 4 642 249 4 642 254 4 642 272 4 642 1102 4 642 1109 4 642 1140 4 642 1188 4 642 1306 4 642 1464 4 642 1491 4 642 1767 4 642 1781 4 642 1787 4 642 1949 4 642 1982 4 642 321 4 642 398 4 642 2059 4 642 2126 4 642 435 4 642 437 4 642 463 4 642 483 4 642 491 4 642 2732 4 642 560 4 642 583 4 642 3073 4 642 627 4 642 631 4 642 632 4 642 642 4 642 642 4 642 644 4 642 653 4 642 669 4 642 680 4 642 761 4 642 762 4 642 763 4 642 100 4 642 123 4 642 123 4 642 140 4 642 164 4 642 919 4 642 989 4 642 196 5 642 1 5 642 1173 5 642 1188 5 642 642 5 642 642 5 642 642 5 642 196 6 642 642 6 642 642 6 642 .I 643 .T Simulation and Analysis of Biochemcial Systems (II. Solution of Differential Equations) .B CACM January, 1962 .A Larson, R. Sellers, P. Meyer, R. .N CA620116 JB March 20, 1978 3:58 PM .X 238 4 643 633 4 643 643 4 643 643 4 643 238 5 643 633 5 643 643 5 643 643 5 643 643 5 643 238 6 643 633 6 643 643 6 643 643 6 643 .I 644 .T A String Language for Symbol Manipulation Based on ALGOL 60 .W An artificial computer programming language is proposed for describing the manipulation of strings of characters and symbols. The concept of strings, introduced in the ALGOL 60 report, is extended by adding: (1) the declaration of strings, substrings, and string arrays with explicit lengths; (2) the ability to concatenate and shift strings; and (3) the ranking of symbols for comparing stings in Boolean relations. A primer or informal description of the language is followed by examples, a description of experiments with the language on an IBM 704 computer, and a formal description which, taken with the ALGOL 60 Report, defines the proposed string language. .B CACM January, 1962 .A Wegstein, J. H. Youden, W. W. .N CA620115 JB March 20, 1978 4:02 PM .X 249 4 644 254 4 644 272 4 644 1102 4 644 1109 4 644 1140 4 644 1188 4 644 1306 4 644 1464 4 644 1491 4 644 1767 4 644 1781 4 644 1787 4 644 1949 4 644 321 4 644 2059 4 644 2126 4 644 435 4 644 437 4 644 463 4 644 483 4 644 491 4 644 2732 4 644 560 4 644 583 4 644 3073 4 644 627 4 644 631 4 644 632 4 644 642 4 644 644 4 644 644 4 644 644 4 644 653 4 644 680 4 644 761 4 644 762 4 644 763 4 644 123 4 644 140 4 644 919 4 644 989 4 644 196 5 644 1084 5 644 206 5 644 207 5 644 644 5 644 644 5 644 644 5 644 868 6 644 603 6 644 644 6 644 669 6 644 791 6 644 797 6 644 .I 645 .T INVRS (Algorithm 66) .B CACM January, 1962 .A Randell, B. Broyden, C. G. .N CA620114 JB March 20, 1978 4:04 PM .X 645 5 645 645 5 645 645 5 645 .I 646 .T Inverse of a Finite Segment of the Hilbert Matrix (Algorithm 50) .B CACM January, 1962 .A Randell, B. .N CA620113 JB March 20, 1978 4:31 PM .X 646 5 646 646 5 646 646 5 646 .I 647 .T Numerical Solution of the Polynomial Equation (Algorithm 30) .B CACM January, 1962 .A Cohen, K. J. .N CA620112 JB March 20, 1978 4:32 PM .X 647 5 647 647 5 647 647 5 647 .I 648 .T Sorting Procedures (Algorithm 76) .B CACM January, 1962 .A Flores, I. .N CA620111 JB March 20, 1978 4:33 PM .X 648 5 648 648 5 648 648 5 648 .I 649 .T FACTORS (Algorithm 75) .B CACM January, 1962 .A Peck, J. E. L. .N CA620110 JB March 20, 1978 4:34 PM .X 649 5 649 649 5 649 649 5 649 .I 650 .T Curve Fitting with Constraints (Algorithm 74) .B CACM January, 1962 .A Peck, J. E. L. .N CA620109 JB March 20, 1978 4:35 PM .X 650 5 650 650 5 650 650 5 650 .I 651 .T A Survey of Languages and Systems for Information Retrieval .B CACM January, 1962 .A Grems, M. .N CA620108 JB March 20, 1978 4:36 PM .X 651 5 651 651 5 651 651 5 651 .I 652 .T Use of Semantic Structure in Information Systems .B CACM January, 1962 .A Sable, J. D. .N CA620107 JB March 20, 1978 4:37 PM .X 1324 5 652 652 5 652 652 5 652 652 5 652 634 6 652 652 6 652 653 6 652 .I 653 .T Translation of Retrieval Requests Couched in a "Semiformal" English-Like Language* .B CACM January, 1962 .A Cheatham Jr., T. E. Warshall, S. .N CA620106 JB March 20, 1978 4:39 PM .X 249 4 653 254 4 653 272 4 653 1046 4 653 1102 4 653 1105 4 653 1109 4 653 1139 4 653 1140 4 653 1140 4 653 1188 4 653 1234 4 653 1263 4 653 1265 4 653 1306 4 653 1464 4 653 1491 4 653 1496 4 653 1767 4 653 1781 4 653 1781 4 653 1787 4 653 1824 4 653 1949 4 653 321 4 653 2059 4 653 2126 4 653 2126 4 653 2546 4 653 435 4 653 437 4 653 463 4 653 464 4 653 483 4 653 491 4 653 2732 4 653 560 4 653 583 4 653 584 4 653 3073 4 653 627 4 653 631 4 653 631 4 653 632 4 653 642 4 653 644 4 653 653 4 653 653 4 653 680 4 653 680 4 653 761 4 653 762 4 653 763 4 653 763 4 653 795 4 653 799 4 653 123 4 653 140 4 653 919 4 653 945 4 653 989 4 653 196 5 653 1324 5 653 404 5 653 653 5 653 653 5 653 653 5 653 892 5 653 634 6 653 652 6 653 653 6 653 653 6 653 656 6 653 .I 654 .T Language Problems Posed by Heavily Structured Data .B CACM January, 1962 .A Barnes, R. F. .N CA620105 JB March 20, 1978 4:40 PM .X 654 5 654 654 5 654 654 5 654 .I 655 .T COMIT as an IR Language .W Many of the features that make COMIT a good all around symbol manipulation language also render it well suited to various types of information retrieval programs. Presented here is a general discussion of this unique and different programming language and an examination of some of its applications. .B CACM January, 1962 .A Yngve, V. H. .N CA620104 JB March 20, 1978 4:46 PM .X 1145 5 655 655 5 655 655 5 655 655 5 655 655 6 655 .I 656 .T An Information System With The Ability To Extract Intelligence From Data .B CACM January, 1962 .A Wang, T. L. .N CA620103 JB March 20, 1978 4:47 PM .X 1309 5 656 656 5 656 656 5 656 656 5 656 892 5 656 653 6 656 656 6 656 656 6 656 .I 657 .T Information Structures for Processing and Retrieving .B CACM January, 1962 .A Colilla, R. A. Sams, B. H. .N CA620102 JB March 20, 1978 4:48 PM .X 657 4 657 657 4 657 1136 5 657 279 5 657 409 5 657 657 5 657 657 5 657 657 5 657 493 6 657 616 6 657 657 6 657 .I 658 .T Discussion-The Pros and Cons of a Special IR Language .B CACM January, 1962 .A Sammet, J. E. Ohlman, H. Bohnest, H. G. .N CA620101 JB March 20, 1978 4:50 PM .X 658 5 658 658 5 658 658 5 658 .I 659 .T Reversion of Series (Algorithm 193) .B CACM December, 1963 .A Thacher Jr., H. C. .N CA631215 JB March 23, 1978 8:08 PM .X 1121 4 659 659 4 659 964 4 659 659 5 659 659 5 659 659 5 659 759 5 659 .I 660 .T More Test Matrices for Determinants and Inverses (Pracnique) .B CACM December, 1963 .A Englar, T. S. .N CA631214 JB March 13, 1978 2:46 PM .X 660 5 660 660 5 660 660 5 660 .I 661 .T Indexing and the Lambda-Notation .W Some methods of indexing sequentially stored elements of sparse multi-dimensional arrays are described in the scheme A notation. .B CACM December, 1963 .A Barnett, M. P. .N CA631213 JB March 13, 1978 2:51 PM .X 661 5 661 661 5 661 661 5 661 .I 662 .T Shuttle Sort (Algorithm 175) .B CACM December, 1963 .A Juelich, O. C. .N CA631212 JB March 13, 1978 2:52 PM .X 662 5 662 662 5 662 662 5 662 .I 663 .T Determinant (Algorithm 159) .B CACM December, 1963 .A Lapidus, A. .N CA631211 JB March 13, 1978 2:53 PM .X 663 5 663 663 5 663 663 5 663 .I 664 .T Assignment (Algorithm 27) .B CACM December, 1963 .A Witty, R. D. .N CA631210 JB March 13, 1978 2:54 PM .X 664 5 664 664 5 664 664 5 664 .I 665 .T Gauss-Seidel (Algorithm 220) .B CACM December, 1963 .A Shantz, P. W. .N CA631209 JB March 13, 1978 2:55 PM .X 665 5 665 665 5 665 665 5 665 .I 666 .T Topological Ordering for Pert Networks (Algorithm 219) .B CACM December, 1963 .A Kase, R. H. .N CA631208 JB March 13, 1978 2:56 PM .X 1916 5 666 666 5 666 666 5 666 666 5 666 1533 6 666 666 6 666 .I 667 .T Kutta Merson (Algorithm 218) .B CACM December, 1963 .A Lukehart, P. M. .N CA631207 JB March 13, 1978 2:57 PM .X 667 5 667 667 5 667 667 5 667 .I 668 .T Minimum Excess Cost Curve (Algorithm 217) .B CACM December, 1963 .A Briggs, W. A. .N CA631206 JB March 13, 1978 2:58 PM .X 668 5 668 668 5 668 668 5 668 .I 669 .T A Specification of JOVIAL .B CACM December, 1963 .A Shaw, C. J. .N CA631205 JB March 13, 1978 2:59 PM .X 205 4 669 210 4 669 214 4 669 1086 4 669 1132 4 669 1234 4 669 1263 4 669 1265 4 669 1270 4 669 1323 4 669 1358 4 669 1379 4 669 1380 4 669 1453 4 669 1464 4 669 1484 4 669 1491 4 669 1498 4 669 1613 4 669 1614 4 669 1781 4 669 1781 4 669 1825 4 669 1860 4 669 1982 4 669 398 4 669 2083 4 669 2178 4 669 2179 4 669 2252 4 669 2325 4 669 2341 4 669 2546 4 669 2645 4 669 2652 4 669 2684 4 669 2842 4 669 2929 4 669 2934 4 669 3069 4 669 642 4 669 669 4 669 669 4 669 669 4 669 679 4 669 691 4 669 761 4 669 100 4 669 123 4 669 164 4 669 949 4 669 989 4 669 1 5 669 1084 5 669 1379 5 669 1625 5 669 1945 5 669 410 5 669 3184 5 669 669 5 669 669 5 669 669 5 669 823 6 669 868 6 669 914 6 669 915 6 669 917 6 669 984 6 669 989 6 669 990 6 669 1012 6 669 1084 6 669 1098 6 669 1122 6 669 1138 6 669 1139 6 669 1141 6 669 1200 6 669 1223 6 669 1248 6 669 1263 6 669 1265 6 669 1336 6 669 1396 6 669 1455 6 669 1477 6 669 1477 6 669 1487 6 669 1491 6 669 1496 6 669 483 6 669 3184 6 669 584 6 669 603 6 669 644 6 669 669 6 669 669 6 669 669 6 669 669 6 669 680 6 669 761 6 669 763 6 669 791 6 669 797 6 669 .I 670 .T Some Legal Implications of the Use of Computers in the Banking Business .W The introduction of computers in to the banking business has a wide variety of legal implications that merit careful attention at this very early stage. The industry is highly regulated by government and, hence, is subject to many statutes and regulations. It also is affected by important common law rules established by courts. The legal ramifications involve not only the mechanization itself, but also the very significant, economically attractive phenomenon of off premises processing. It is essential to identify and provide for many legal aspects right now, before systems and practices crystallize, in order to avoid the later impact of unanticipated physical complications and expense. The legal aspects of computerization in the banking business are especially diverse. In some states, there might be the basic question whether banks are authorized by law to invest in the new facilities, either directly or through cooperatives. More challenging are questions relating to off-premises processors, particularly with respect to the obligation not to disclose information concerning a bank's customers, the adequacy of fidelity bond coverage, the extent of liability for improper refusal to pay a check, and susceptibility to regulation by government agencies. Also pertinent is the propriety of data processing by banks for nonbank entities and particularly of the rendering of that service without charge for bank depositors. .B CACM December, 1963 .A Freed, R. N. .N CA631204 JB March 13, 1978 3:09 PM .X 670 5 670 670 5 670 670 5 670 .I 671 .T TELEFILE-A Case Study of an On-Line Savings Bank Application .W The development of an on-line computer system for a savings bank institution is traced from the early conceptual needs of the bank to the consummation of design by The Teleregister Corporation. Both bank and equipment criteria are specified which led to the development of the Telefile System of The Teleregister Corporation. Operation of the on-line and off-line programs are described and statistics are cited for reliability and performance of the system. Benefits to the bank are discussed from the banker's point of view; an indication of future trends in the on-line savings bank field is also discussed. .B CACM December, 1963 .A Sanders, M. .N CA631203 JB March 13, 1978 3:13 PM .X 671 5 671 671 5 671 671 5 671 .I 672 .T Recent Developments Affecting ADP in Tax Administration .B CACM December, 1963 .A Leibowitz, G. J. .N CA631202 JB March 13, 1978 3:14 PM .X 672 5 672 672 5 672 672 5 672 .I 673 .T Account Classification at Automating Banks .B CACM December, 1963 .A Eckert, J. B. .N CA631201 JB March 13, 1978 3:15 PM .X 673 5 673 673 5 673 673 5 673 .I 674 .T Application of IBM 1620 EDP Methods to the Calculation of the Formation Constants of Complex Irons .B CACM November, 1963 .A Andrews, A. C. Hassler, J. DeCou, F. .N CA631118 JB March 13, 1978 3:18 PM .X 674 5 674 674 5 674 674 5 674 .I 675 .T Coding Clinical Laboratory Data For Automatic Storage and Retrieval .W A series of clinical laboratory codes have been developed to accept and store urin analysis, blood chemistry, and hematology test results for automatic data processing. The codes, although constructed as part of a computerized hospital simulation, have been able to handle the results of every laboratory test that they have encountered. The unique feature of these codes is that they can accept conventionally recorded qualitative as well as quantitative test results. Consequently, clinical test results need not be arbitrarily stratified, standardized, or altered in any way to be coded. This paper describes how the codes were developed and presents a listing of the urin analysis codes. Five criteria used in developing the codes are outlined and the problem of multiple-synonymous terminology is discussed. A solution to the problem is described. Flexible, computer-produced, composite laboratory reports are also discussed, along with reproduction of such a report. The paper concludes that even though many problems remain unsolved, the next ten years could witness the emergence of a practical automated information system in the laboratory. .B CACM November, 1963 .A Gross, L. D. .N CA631117 JB March 13, 1978 3:26 PM .X 675 5 675 675 5 675 675 5 675 .I 676 .T On the Computation of a Certain Type of IncompleteBeta Functions .B CACM November, 1963 .A Tang, I. C. .N CA631116 JB March 13, 1978 3:27 PM .X 676 5 676 676 5 676 676 5 676 .I 677 .T Length of Strings for a Merge Sort .W Detailed statistics are given on the length of maximal sorted strings which result form the first (internal sort) phase of a merge sort onto tapes. It is shown that the strings produced by an alternating method (i.e. one which produces ascending and descending strings alternately) tend to be only three-fourths as long as those in a method which produces only ascending strings, contrary to statements which have appeared previously in the literature. A slight modification of the read-backward polyphase merge algorithm is therefore suggested. .B CACM November, 1963 .A Knuth, D. E. .N CA631115 JB March 13, 1978 3:31 PM .X 1117 4 677 2017 4 677 2146 4 677 677 4 677 860 4 677 1638 5 677 2176 5 677 2272 5 677 677 5 677 677 5 677 677 5 677 861 5 677 1638 6 677 677 6 677 677 6 677 677 6 677 .I 678 .T Optimizing Bit-time Computer Simulation .W A major component of a bit-time computer simulation program is the Boolean compiler. The compiler accepts the Boolean functions representing the simulated computer's digital circuits, and generates corresponding sets of machine instructions which are subsequently executed on the "host" computer. Techniques are discussed for increasing the sophistication of the Boolean compiler so as to optimize bit-time computer simulation. The techniques are applicable to any general-purpose computer. .B CACM November, 1963 .A Katz,J. H. .N CA631114 JB March 13, 1978 3:34 PM .X 678 4 678 1030 5 678 270 5 678 1886 5 678 1939 5 678 678 5 678 678 5 678 678 5 678 1030 6 678 678 6 678 678 6 678 678 6 678 .I 679 .T Recent Improvements in MADCAP .W MADCAP is a programming language admitting subscripts, superscripts and certain forms of displayed formulas. The basic implementation of this language was described in a previous paper [MADCAP: A scientific compiler for a displayed formula textbook language, Comm. ACM 4 (Jan. 61), 31-36]. This paper discusses recent improvements in the language in three areas: complex display, logical control, and subprogramming. In the area of complex display, the most prominent improvements are a notation for integration and for the binomial coefficients. In the area of logical control the chief new feature is a notation for variably nested looping. The discussion of subprogramming is focused on MADCAP's notation for and use of "procedures." .B CACM November, 1963 .A Wells, M. B. .N CA631113 JB March 13, 1978 3:39 PM .X 1083 4 679 1086 4 679 1132 4 679 1234 4 679 1263 4 679 1265 4 679 1270 4 679 1323 4 679 1358 4 679 1379 4 679 1380 4 679 1396 4 679 1453 4 679 1464 4 679 1484 4 679 1491 4 679 1498 4 679 1613 4 679 1614 4 679 1781 4 679 1825 4 679 1860 4 679 2083 4 679 2178 4 679 2179 4 679 2252 4 679 2325 4 679 2341 4 679 2546 4 679 2645 4 679 2652 4 679 2684 4 679 2842 4 679 2929 4 679 2934 4 679 3069 4 679 669 4 679 679 4 679 679 4 679 679 4 679 691 4 679 761 4 679 949 4 679 989 4 679 407 5 679 21 5 679 3184 5 679 679 5 679 679 5 679 679 5 679 .I 680 .T An Error-Correcting Parse Algorithm .B CACM November, 1963 .A Irons, E. T. .N CA631112 JB March 13, 1978 3:40 PM .X 249 4 680 254 4 680 272 4 680 1046 4 680 1102 4 680 1105 4 680 1109 4 680 1139 4 680 1140 4 680 1140 4 680 1188 4 680 1234 4 680 1263 4 680 1265 4 680 1306 4 680 1464 4 680 1491 4 680 1496 4 680 1767 4 680 1781 4 680 1781 4 680 1787 4 680 1824 4 680 1949 4 680 321 4 680 2059 4 680 2126 4 680 2126 4 680 2546 4 680 435 4 680 437 4 680 463 4 680 464 4 680 483 4 680 491 4 680 2732 4 680 560 4 680 583 4 680 584 4 680 3073 4 680 627 4 680 631 4 680 631 4 680 632 4 680 642 4 680 644 4 680 653 4 680 653 4 680 680 4 680 680 4 680 761 4 680 762 4 680 763 4 680 763 4 680 795 4 680 799 4 680 123 4 680 140 4 680 919 4 680 945 4 680 989 4 680 196 5 680 1225 5 680 1350 5 680 1646 5 680 1781 5 680 1945 5 680 2650 5 680 2698 5 680 2708 5 680 404 5 680 3093 5 680 680 5 680 680 5 680 680 5 680 823 6 680 830 6 680 830 6 680 123 6 680 196 6 680 914 6 680 915 6 680 917 6 680 919 6 680 984 6 680 987 6 680 989 6 680 990 6 680 990 6 680 1007 6 680 1012 6 680 1012 6 680 1012 6 680 1046 6 680 1072 6 680 1084 6 680 1098 6 680 1122 6 680 1131 6 680 1138 6 680 1139 6 680 1139 6 680 1140 6 680 1141 6 680 1149 6 680 1179 6 680 1198 6 680 1200 6 680 1215 6 680 1223 6 680 1223 6 680 1225 6 680 1265 6 680 1265 6 680 1265 6 680 1303 6 680 1323 6 680 1336 6 680 1358 6 680 1366 6 680 1396 6 680 1399 6 680 1421 6 680 1455 6 680 1460 6 680 1462 6 680 1463 6 680 1467 6 680 1468 6 680 1477 6 680 1477 6 680 1477 6 680 1477 6 680 1487 6 680 1491 6 680 1491 6 680 1491 6 680 1491 6 680 1491 6 680 1496 6 680 1496 6 680 1531 6 680 1535 6 680 1565 6 680 1601 6 680 1602 6 680 1613 6 680 1614 6 680 1626 6 680 1641 6 680 1647 6 680 1781 6 680 1787 6 680 1787 6 680 1788 6 680 205 6 680 224 6 680 249 6 680 288 6 680 316 6 680 381 6 680 398 6 680 2110 6 680 2111 6 680 2111 6 680 11 6 680 2179 6 680 2534 6 680 2556 6 680 2556 6 680 2708 6 680 404 6 680 410 6 680 463 6 680 464 6 680 483 6 680 483 6 680 3184 6 680 3188 6 680 576 6 680 584 6 680 584 6 680 600 6 680 669 6 680 680 6 680 680 6 680 680 6 680 680 6 680 680 6 680 680 6 680 680 6 680 680 6 680 680 6 680 691 6 680 763 6 680 763 6 680 799 6 680 799 6 680 .I 681 .T Flexible Abbreviation of Words in a Computer Language .B CACM November, 1963 .A Lomis, R. G. Rubin, J. .N CA631111 JB March 13, 1978 3:42 PM .X 681 5 681 681 5 681 681 5 681 .I 682 .T Recursive programming in FORTRAN II .B CACM November, 1963 .A Ayers, J. A. .N CA631110 JB March 13, 1978 3:43 PM .X 682 5 682 682 5 682 682 5 682 .I 683 .T A Serial Technique to Determine Minimum Paths .B CACM November, 1963 .A Weimer, D. L. .N CA631109 JB March 13, 1978 3:44 PM .X 683 5 683 683 5 683 683 5 683 .I 684 .T Interpolation, Differentiation, and Integration (Algorithm 77) .B CACM November, 1963 .A Hennion, P. E. .N CA631108 JB March 13, 1978 3:45 PM .X 684 5 684 684 5 684 684 5 684 .I 685 .T Euler Summation (Algorithm 8) .B CACM November, 1963 .A Thacher Jr., H. C. .N CA631108 JB March 13, 1978 3:46 PM .X 685 5 685 685 5 685 685 5 685 .I 686 .T Smooth (Algorithm 216) .B CACM November, 1963 .A George, R. .N CA631106 JB March 13, 1978 3:47 PM .X 686 5 686 686 5 686 686 5 686 .I 687 .T Shanks (Algorithm 215) .B CACM November, 1963 .A Thacher Jr., H. C. .N CA631105 JB March 13, 1978 3:48 PM .X 687 5 687 687 5 687 687 5 687 .I 688 .T q-Bessel Functions In(t)(Algorithm 214) .B CACM November, 1963 .A Simoes Pereira, J. M. S. .N CA631104 JB March 13, 1978 3:49 PM .X 688 5 688 688 5 688 688 5 688 .I 689 .T Report of a Visit to Discuss Common Programming Languages in Czechoslovakia and Poland, 1963 .B CACM November, 1963 .A Gosden, J. A. Merner, J. N. Gay, R. E. Jones, J. L. Christopher, J. S. .N CA631103 JB March 13, 1978 3:51 PM .X 1349 4 689 323 4 689 689 4 689 689 4 689 689 4 689 217 5 689 323 5 689 3197 5 689 689 5 689 689 5 689 689 5 689 .I 690 .T USA Participation in an International Standard glossary on Information Processing .B CACM November, 1963 .A Traub, J. F. .N CA631102 JB March 13, 1978 3:52 PM .X 690 4 690 690 4 690 690 4 690 929 5 690 3195 5 690 690 5 690 690 5 690 690 5 690 890 5 690 .I 691 .T A Description of the APT Language .W The APT (Automatically Programmed Tools) language for numerical control programming is described using the metalinguistic notation introduced in the ALGOL 60 report. Examples of APT usage are included. Presented also are an historical summary of the development of APT and a statement concerning its present status. .B CACM November, 1963 .A Brown, S. A. Drayton, C. E. Mittman, B. .N CA631101 JB March 13, 1978 3:59 PM .X 1086 4 691 1132 4 691 1234 4 691 1263 4 691 1265 4 691 1270 4 691 1323 4 691 1358 4 691 1379 4 691 1380 4 691 1453 4 691 1464 4 691 1484 4 691 1491 4 691 1498 4 691 1613 4 691 1614 4 691 1781 4 691 1825 4 691 1860 4 691 1945 4 691 2083 4 691 2126 4 691 2178 4 691 2179 4 691 2252 4 691 2325 4 691 2341 4 691 2546 4 691 2645 4 691 2652 4 691 2684 4 691 2842 4 691 2929 4 691 2934 4 691 3069 4 691 669 4 691 679 4 691 691 4 691 691 4 691 761 4 691 949 4 691 989 4 691 1781 5 691 3184 5 691 691 5 691 691 5 691 691 5 691 823 5 691 123 6 691 196 6 691 919 6 691 990 6 691 1007 6 691 1046 6 691 1131 6 691 1139 6 691 1140 6 691 1149 6 691 1198 6 691 1215 6 691 1223 6 691 1265 6 691 1303 6 691 1323 6 691 1358 6 691 1366 6 691 1421 6 691 1460 6 691 1462 6 691 1463 6 691 1467 6 691 1468 6 691 1477 6 691 1491 6 691 1496 6 691 1531 6 691 1535 6 691 1565 6 691 1601 6 691 1602 6 691 1613 6 691 1614 6 691 1626 6 691 1641 6 691 1787 6 691 1788 6 691 205 6 691 224 6 691 249 6 691 288 6 691 316 6 691 381 6 691 398 6 691 11 6 691 404 6 691 410 6 691 463 6 691 464 6 691 483 6 691 3184 6 691 3188 6 691 584 6 691 600 6 691 680 6 691 691 6 691 763 6 691 799 6 691 .I 692 .T On the Inverse of a Test Matrix .B CACM October, 1963 .A Stockmal, F. J. .N CA631033 JB March 27, 1978 9:00 PM .X 692 5 692 692 5 692 692 5 692 .I 693 .T An Extension of Fibonaccian Search To Several Variables .W A technique which uses Fibonaccian search concepts has been developed to solve optimization problems involving unimodal functions of several variables. The technique has not been proven to be optimal in the sense that the one-dimensional Fibonaccian search is. However, it is valuable for certain kinds of calculations. .B CACM October, 1963 .A Krolak, P. Cooper, L. .N CA631032 JB March 13, 1978 4:19 PM .X 693 5 693 693 5 693 693 5 693 .I 694 .T A Comparison of Disks and Tapes .W The principal characteristics of current magnetic disks and tape units are summarized and compared. Some of the characteristics of disk files are illustrated in a sorting example and compared to a tapesort. The conclusion is presented that disk files are competitive to tapes in some important applications. .B CACM October, 1963 .A Hess, H. .N CA631031 JB March 13, 1978 4:21 PM .X 694 5 694 694 5 694 694 5 694 .I 695 .T Use of the Disk File on Stretch .W The paper begins by briefly describing the Stretch (IBM 7030) computer with special emphasis given to the organization and operation of its input-output equipment. Physical characteristics of the two-disk system (4,194,304 72-bit words, 8 usec-per-word transmission rate, etc.) are noted. Timing limitations due to arm motion and disk rotation are discussed. Applications of disk usage are discussed separately for problem programs and for systems programs such as compilers and the supervisory program. Approximately 260,000 words of disk storage are reserved for the storage of systems programs and the subroutine library. Problem programs, however, are not currently filed on the disk. Certain programming techniques are discussed for transmitting words between disk and core storage with minimum delaying and interruption of the arithmetic unit. Dumps on disk are considered for both recovery from computer malfunction and for mathematical or physical developments during the calculation. Some comments are made regarding the reliability, economics, utility and weaknesses or limitations of the disk system. Several possible future applications are noted which appear to have disk connotations. .B CACM October, 1963 .A Carlson, B. G. Voorhes, E. A. .N CA631030 JB March 13, 1978 4:28 PM .X 695 5 695 695 5 695 695 5 695 .I 696 .T An Automatic Data Acquisition and Inquiry System Using Disk Files .W Lockheed Missiles and Space Company has installed a large-scale Automatic Data Acquisition (ADA) system which ties together the Company's manufacturing facilities located in Van Nuys and Sunnyvale, California. The system includes over 200 remote Input Stations which collect and transmit Company operating data to a central Data Processing Center. Two RCA 301 EDP Systems are used to record and control the flow of data transmitted to the Data Processing Center. A large capacity RCA 366 Data Disc File is used to store information required to provide up-to-date information in response to inquiries received from remotely located Inquiry Stations. In addition to storage of data on the disk files, the system automatically records all incoming and outgoing data on magnetic tape to be used as input to the Company's conventional off-line business data processing applications. .B CACM October, 1963 .A Edwards, J. D. .N CA631029 JB March 13, 1978 4:34 PM .X 696 5 696 696 5 696 696 5 696 .I 697 .T A Numerical Method for the Determination of Moving Field Isodose Curves for Treatment Planning in Radiotherapy .B CACM October, 1963 .A Dalrymple, G. V. Perez-Tamayo, R. .N CA631028 JB March 13, 1978 5:19 PM .X 697 5 697 697 5 697 697 5 697 .I 698 .T DATA-DIAL: Two-Way Communication with Computers From Ordinary dial Telephones .W An operating system is described which allows users to call up a remotely located computer from ordinary dial telephones. No special hardware or connections are required at the users' telephones. Input to the computer is through the telephone dial;output from the computer is in spoken form. Results of a test with telephones in the Boston area are reported. .B CACM October, 1963 .A Marill, T. Edwards, D. Feurzeig, W. .N CA631027 JB March 13, 1978 5:23 PM .X 1181 5 698 698 5 698 698 5 698 698 5 698 698 6 698 .I 699 .T A Contour-Map Program for X-Ray Crystallography .W A FORTRAN program is described for use with the IBM 7090 system and an X, Y-plotter to produce a contour map. A matrix of points evenly spaced in each dimension is contoured. Scale factors along the axes may be different and the axes need not be perpendicular. .B CACM October, 1963 .A Dayhoff, M. O. .N CA631026 JB March 13, 1978 5:26 PM .X 2633 5 699 699 5 699 699 5 699 699 5 699 699 6 699 .I 700 .T Hermite Interpolation (Algorithm 210) .B CACM October, 1963 .A Dwyer, T. A. .N CA631025 JB March 13, 1978 5:27 PM .X 700 5 700 700 5 700 700 5 700 .I 701 .T Shuttle Sort (Algorithm 175) .B CACM October, 1963 .A Schubert, G. R. .N CA631024 JB March 13, 1978 5:29 PM .X 701 5 701 701 5 701 701 5 701 .I 702 .T Assign (Algorithm 173) .B CACM October, 1963 .A Filsak, Z. Vrchovecka, L. .N CA631023 JB March 13, 1978 5:31 PM .X 702 5 702 702 5 702 702 5 702 .I 703 .T Assign (Algorithm 173) .B CACM October, 1963 .A Scowen, R. S. .N CA631022 JB March 13, 1978 5:32 PM .X 703 5 703 703 5 703 703 5 703 .I 704 .T Combinatorial of M Things Taken One At A Time Two At A Time, Up To N At A Time (Algorithm 161) .B CACM October, 1963 .A Collins, D. H. .N CA631021 JB March 13, 1978 5:34 PM .X 704 5 704 704 5 704 704 5 704 .I 705 .T Combinatorial Of M Things Taken N At A Time (Algorithm 160) .B CACM October, 1963 .A Blakely, R. E. .N CA631020 JB March 13, 1978 5:36 PM .X 705 5 705 705 5 705 705 5 705 .I 706 .T Fourier Series Approximation (Algorithm 157) .B CACM October, 1963 .A Schubert, G. R. .N CA631019 JB March 13, 1978 5:37 PM .X 706 5 706 706 5 706 706 5 706 .I 707 .T Erf(x) (Algorithm 123) .B CACM October, 1963 .A Ibbetson, D. .N CA631018 JB March 13, 1978 5:40 PM .X 1583 5 707 707 5 707 707 5 707 707 5 707 831 6 707 967 6 707 1126 6 707 707 6 707 .I 708 .T Evaluation of the Fresnel Integrals (Algorithm 88, 89, 90) .B CACM October, 1963 .A Gray, M. D. .N CA631017JB March 13, 1978 5:45 PM .X 708 5 708 708 5 708 708 5 708 .I 709 .T Assignment (Algorithm 27) .B CACM October, 1963 .A Newhouse, A. .N CA631016 JB March 13, 1978 5:46 PM .X 709 5 709 709 5 709 709 5 709 .I 710 .T Fresnel Integrals (Algorithm 213) .B CACM October, 1963 .A Gray, M. D. .N CA631015 JB March 13, 1978 5:47 PM .X 710 5 710 710 5 710 710 5 710 .I 711 .T Frequency Distribution (Algorithm 212) .B CACM October, 1963 .A Gray, M. D. .N CA631014 JB March 13, 1978 5:50 PM .X 711 5 711 711 5 711 711 5 711 .I 712 .T Hermite Interpolation (Algorithm 211) .B CACM October, 1963 .A Schubert, G. R. .N CA631013 JB March 13, 1978 5:51 PM .X 712 5 712 712 5 712 712 5 712 .I 713 .T Lagrangian Interpolation (Algorithm 210) .B CACM October, 1963 .A Schubert, G. R. .N CA631012 JB March 13, 1978 5:52 PM .X 713 5 713 713 5 713 713 5 713 .I 714 .T Gauss (Algorithm 209) .B CACM October, 1963 .A Ibbetson, D. .N CA631011 JB March 13, 1978 5:52 PM .X 1157 5 714 1779 5 714 1920 5 714 1944 5 714 1987 5 714 2548 5 714 714 5 714 714 5 714 714 5 714 836 6 714 1081 6 714 1561 6 714 1581 6 714 1778 6 714 1779 6 714 1779 6 714 1944 6 714 485 6 714 714 6 714 714 6 714 714 6 714 714 6 714 714 6 714 714 6 714 .I 715 .T Discrete Convolution (Algorithm 208) .B CACM October, 1963 .A Foreman Jr., W. T. .N CA631010 JB March 13, 1978 5:53 PM .X 715 5 715 715 5 715 715 5 715 .I 716 .T Stringsort (Algorithm 207) .B CACM October, 1963 .A Boothroyd, J. .N CA631009 JB March 13,1978 5:54 PM .X 2679 5 716 716 5 716 716 5 716 716 5 716 970 6 716 1175 6 716 1190 6 716 1228 6 716 1969 6 716 1997 6 716 308 6 716 2042 6 716 3187 6 716 507 6 716 716 6 716 783 6 716 .I 717 .T Partitioning Algorithms for Finite Sets .W The partitions of a set with n elements are represented by certain n-tuples of positive integers. Algorithm are described which generate without repetitions the n-tuples corresponding to: (1) all partitions of the given set, (2) all partitions of the given set into m or fewer sets (1 <= m <= n), and (3) all partitions of the given set into exactly m sets (1 <= m <= n). .B CACM October, 1963 .A Hutchinson, G. .N CA631008 JB March 13, 1978 5:57 PM .X 717 5 717 717 5 717 717 5 717 .I 718 .T An Experiment in Automatic Verification of Programs .W How effective is a compiler at replacing explicit verification, and what is the cost of this technique? .B CACM October, 1963 .A Weinberg, G. M. Gressett, G. L. .N CA631007 JB March 13, 1978 5:59 PM .X 1053 5 718 718 5 718 718 5 718 718 5 718 435 6 718 474 6 718 718 6 718 720 6 718 .I 719 .T Variable Width Stacks .W Character addressable, variable field computers permit ready establishment and manipulation of variable width stacks. Single machine commands may push variable field items down into such stacks or pop them up. The availability of a variety of field delimiters allows the machine to push down or pop up more than one variable width item with one command. Since these stacking operations can be made the basis of compiler decoding algorithms the proper use of machines of this class for compilation has advantages over machines with fixed-length words. .B CACM October, 1963 .A Rotenberg, N. Opler, A. .N CA631006 JB March 13, 1978 6:25 PM .X 719 5 719 719 5 719 719 5 719 .I 720 .T Format-Free Input in FORTRAN .B CACM October, 1963 .A Bailey, M. J. Barnett, M. P. Futrelle, R. P. .N CA631005 JB March 13, 1978 6:26 PM .X 1053 4 720 1062 4 720 1121 4 720 1139 4 720 1265 4 720 1781 4 720 464 4 720 720 4 720 720 4 720 720 4 720 759 4 720 1053 5 720 265 5 720 464 5 720 474 5 720 720 5 720 720 5 720 720 5 720 435 6 720 474 6 720 718 6 720 720 6 720 .I 721 .T Report on Proposed American Standard Flowchart Symbols for Information Processing .W This paper presents the essential contents of the Proposed American Standard Flowchart Symbols for Information Processing. This is the first proposed standard prepared by Subcommittee X3.6 on Problem Description and Analysis of the American Standards Association (ASA). .B CACM October, 1963 .A Rossheim, R. J. .N CA631004 JB March 13, 1978 6:33 PM .X 2961 5 721 721 5 721 721 5 721 721 5 721 721 6 721 .I 722 .T ALCOR Group Representation of ALGOL Symbols .B CACM October, 1963 .N CA631003 JB March 13, 1978 6:36 PM .X 722 5 722 722 5 722 722 5 722 .I 723 .T ECMA Subset of ALGOL 60 .B CACM October, 1963 .N CA631002 JB March 13, 1978 6:38 PM .X 723 5 723 723 5 723 723 5 723 .I 724 .T A Profile of the Programmer .W Synopsis: 549 members of the ACM participated in a study concerned primarily with the attitudes of programmers toward their careers and jobs. A very high percentage of programmers have apparently entered their careers by accident; it has proven a happy choice for most and they expect to remain in the field during the next five years. Their principal job satisfactions relate to the nature of their work, and mostfind their jobs offer high level of professional interest and good working conditions. Salary and advancement prospects, however,are not as satisfactory. More than half report a positive attitude toward programmers and programming on the part of their organizations. Turnover among themselves is attributed primarily to poor management-salary is seen as the principal motivating factor in turnover among other programmers. Nature of the work offered and salary are principal determinants in accepting a new job. Programmers are less mobile than expected. Programmers tend to see their colleagues in a favorable light, on the whole. Personalities seem to vary with function, systems programmers differing from applications programmers. Four principal problems for programming in the immediate future are listed by participants: languages, personnel, various specific applications and techniques, and building programming as a profession. .B CACM October, 1963 .N CA631001 JB March 13, 1978 6:48 PM .X 724 5 724 724 5 724 724 5 724 .I 725 .T Group Participation Computer Demonstration .B CACM October, 1963 .A McCormick, E. M. .N CA630933 JB March 13, 1978 6:50 PM .X 725 5 725 725 5 725 725 5 725 .I 726 .T A General Program for the Analysis of Square and Rectangular Lattice Designs .W This paper describes a general-purpose program that will handle those incomplete block designs known as square and rectangular lattices. Flow diagrams are given so that the method of calculation may be programmed for any digital computer. .B CACM September, 1963 .A Smillie, K. W. .N CA630932 JB March 13, 1978 6:53 PM .X 726 5 726 726 5 726 726 5 726 .I 727 .T On the Approximate Solution of Delta(u)=F(u) .W Three-dimensional Dirichlet problems for Delta(u)=F(u), Fu >= 0, are treated numerically by an exceptionally fast, exceptionally accurate numerical method. Programming details, numerous examples and mathematical theory are supplied.Extension of the method in a natural way to n-dimensional problems is indicated by means of a 4-dimensional example. .B CACM September, 1963 .A Greenspan, D. Yohe, M. .N CA630931 JB March 13, 1978 6:57 PM .X 727 5 727 727 5 727 727 5 727 .I 728 .T Computer-Drawn Flowcharts* .W To meet the need for improved documentation of written computer programs, a simple system for effective communication is presented, which has shown great promise. The programmer describes his program in a simple format, and the computer prepares flow charts and other cross-referenced listings from this input. The description can be kept up-to-date easily, and the final output clearly explains the original program. The system has also proved to be a valuable debugging and coding aid. .B CACM September, 1963 .A Knuth, D. E. .N CA630930 JB March 13, 1978 7:01 PM .X 728 4 728 728 4 728 920 5 728 1330 5 728 1348 5 728 2315 5 728 45 5 728 728 5 728 728 5 728 728 5 728 1348 6 728 1834 6 728 1987 6 728 528 6 728 728 6 728 728 6 728 728 6 728 .I 729 .T A Generalization of ALGOL .B CACM September, 1963 .A Wirth, N. .N CA630929 JB March 13, 1978 7:02 PM .X 1135 4 729 1136 4 729 1781 4 729 493 4 729 2710 4 729 2765 4 729 2888 4 729 2906 4 729 729 4 729 729 4 729 989 4 729 1037 5 729 1234 5 729 1358 5 729 288 5 729 1491 5 729 616 5 729 729 5 729 729 5 729 729 5 729 196 6 729 944 6 729 1140 6 729 1303 6 729 1460 6 729 205 6 729 321 6 729 385 6 729 400 6 729 402 6 729 404 6 729 3184 6 729 3184 6 729 3184 6 729 729 6 729 729 6 729 729 6 729 729 6 729 799 6 729 .I 730 .T MIRFAG: A Compiler Based on Standard Mathematical Notation And Plain English .W A pilot version of the compiler MIRFAG, now in operation, is described. The chief features of the system, which is intended for the solution of scientific problems, are the presentation of mathematical formulas entirely in standard textbook notation. The use of plain English for organizational instructions, automatic error diagnosis indicating the actual location of the error in the uncompiled program, and an attempt to minimize that fragmentation of the original problem statement which is a normal feature of programming systems. .B CACM September, 1963 .A Gawlik, H. J. .N CA630928 JB March 13, 1978 7:06 PM .X 1083 5 730 1396 5 730 730 5 730 730 5 730 730 5 730 964 6 730 1028 6 730 1029 6 730 1083 6 730 1132 6 730 1214 6 730 1278 6 730 1334 6 730 1365 6 730 1386 6 730 1387 6 730 1388 6 730 1392 6 730 1393 6 730 1394 6 730 1395 6 730 1396 6 730 1397 6 730 1496 6 730 284 6 730 407 6 730 407 6 730 3192 6 730 3193 6 730 3199 6 730 3200 6 730 3201 6 730 3202 6 730 3203 6 730 3204 6 730 561 6 730 730 6 730 730 6 730 .I 731 .T Symmetric List Processor .W A list processing system in which each list cell contains both a forward and a backward link as well as a datum is described. This system is intended for imbeding in higher level languages capable of calling functions and subroutines coded in machine language. The presentation is in the form of FORTRAN programs depending on only a limited set of FORTRAN programs depending on only a limited set of "primitive" machine language subroutines which are also defined. Finally, a set of field, particularly character, manipulation primitives are given to round out the system. .B CACM September, 1963 .A Weizenbaum, J. .N CA630927 JB March 13, 1978 7:10 PM .X 1050 4 731 1050 4 731 1102 4 731 1549 4 731 378 4 731 2723 4 731 2882 4 731 3008 4 731 731 4 731 731 4 731 793 4 731 798 4 731 1024 5 731 1051 5 731 1098 5 731 1214 5 731 209 5 731 1380 5 731 1388 5 731 1393 5 731 1485 5 731 1487 5 731 1549 5 731 1570 5 731 1878 5 731 1946 5 731 1957 5 731 2168 5 731 2723 5 731 2857 5 731 3112 5 731 627 5 731 731 5 731 731 5 731 731 5 731 878 6 731 106 6 731 106 6 731 106 6 731 902 6 731 1051 6 731 1093 6 731 1098 6 731 1132 6 731 1177 6 731 1380 6 731 1387 6 731 1389 6 731 1393 6 731 1393 6 731 1421 6 731 1549 6 731 1626 6 731 1749 6 731 1826 6 731 1826 6 731 1826 6 731 210 6 731 210 6 731 210 6 731 210 6 731 210 6 731 210 6 731 1860 6 731 1878 6 731 296 6 731 1972 6 731 360 6 731 378 6 731 2438 6 731 2651 6 731 2723 6 731 2736 6 731 2833 6 731 2838 6 731 405 6 731 406 6 731 406 6 731 3184 6 731 627 6 731 627 6 731 731 6 731 731 6 731 731 6 731 731 6 731 731 6 731 731 6 731 731 6 731 731 6 731 731 6 731 731 6 731 731 6 731 731 6 731 731 6 731 731 6 731 731 6 731 731 6 731 731 6 731 731 6 731 753 6 731 793 6 731 794 6 731 799 6 731 .I 732 .T Monte Carlo Inverse (Algorithm 166) .B CACM September, 1963 .A Rodman,R. D. .N CA630926 JB March 13, 1978 7:11 PM .X 732 5 732 732 5 732 732 5 732 .I 733 .T Newton Interpolation with Forward Divided Differences (Algorithm 169) .B CACM September, 1963 .A Thacher Jr., H. C. .N CA630925 JB March 13, 1978 7:13 PM .X 733 5 733 733 5 733 733 5 733 .I 734 .T Newton Interpolation with Backward Divided Differences (Algorithm 168) .B CACM September, 1963 .A Thacher Jr., H. C. .N CA630924 JB March 13, 1978 7:15 PM .X 734 5 734 734 5 734 734 5 734 .I 735 .T Calculation of Confluent Divided Differences (Algorithm 167) .B CACM September, 1963 .A Thacher Jr., H. C. .N CA630923 JB March 13, 1978 7:17 PM .X 735 5 735 735 5 735 735 5 735 .I 736 .T Modified Hankel Functions (Algorithm 163) .B CACM September, 1963 .A Thacher Jr.,H. C. .N CA630922 JB March 13, 1978 7:18 PM .X 736 5 736 736 5 736 736 5 736 .I 737 .T Exponentiation of Series (Algorithm 158) .B CACM September, 1963 .A Lawrence, J. D. .N CA630921 JB March 13, 1978 7:19 PM .X 737 5 737 737 5 737 737 5 737 .I 738 .T Fourier Series Approximation (Algorithm 157) .B CACM September, 1963 .A George, R. .N CA630920 JB March 13, 1978 7:20 PM .X 738 5 738 738 5 738 738 5 738 .I 739 .T MINIFUN (Algorithm 129) .B CACM September, 1963 .A Wasscher, E. J. .N CA630919 JB March 13, 1978 7:22 PM .X 739 5 739 739 5 739 739 5 739 .I 740 .T INTEREST (Algorithm 45) .B CACM September, 1963 .A Wright, C. B. .N CA630918 JB March 13, 1978 7:23 PM .X 740 5 740 740 5 740 740 5 740 .I 741 .T Evaluation of Determinant (Algorithm 41) .B CACM September, 1963 .A Freed, B. H. .N CA630917 JB March 13, 1978 7:24 PM .X 741 5 741 741 5 741 741 5 741 .I 742 .T Evaluation of Determinant (Algorithm 41) .B CACM September, 1963 .A Freed, B. H. .N CA630916 JB March 13, 1978 7:25 PM .X 742 5 742 742 5 742 742 5 742 .I 743 .T ARCCOSIN (Algorithm 206) .B CACM September, 1963 .A Konda, M. .N CA630915 JB March 13, 1978 7:26 PM .X 743 5 743 743 5 743 743 5 743 .I 744 .T ATIVE (Algorithm 205) .B CACM September, 1963 .A Haubrich, J. G. A. .N CA630914 JB March 13, 1978 7:28 PM .X 744 5 744 744 5 744 744 5 744 .I 745 .T STEEP2 (Algorithm 204) .B CACM September, 1963 .A Wasscher, E. J. .N CA630913 JB March 13, 1978 7:29 PM .X 745 5 745 745 5 745 745 5 745 .I 746 .T STEEP1 (Algorithm 203) .B CACM September, 1963 .A Wasscher, E. J. .N CA630912 JB March 13, 1978 7:30 PM .X 746 5 746 746 5 746 746 5 746 .I 747 .T Generation of Permutations in Lexicographical Order (Algorithm 202) .B CACM September, 1963 .A Shen, M. K. .N CA630911 JB March 13, 1978 7:31 PM .X 2443 5 747 747 5 747 747 5 747 747 5 747 747 6 747 .I 748 .T A Semi-Iterative Process for Evaluating Arctangents .B CACM September, 1963 .A Chu, W. H. Saathoff, D. R. .N CA630910 JB March 13, 1978 7:33 PM .X 748 5 748 748 5 748 748 5 748 .I 749 .T Note onStochastic Matrices .B CACM September, 1963 .A Dumey, A. I. .N CA630909 JB March 13, 1978 7:35 PM .X 749 5 749 749 5 749 749 5 749 .I 750 .T PEI Matrix Eigenvectors .B CACM September, 1963 .A Newbery, A. C. R. .N CA630908 JB March 13, 1978 7:36 PM .X 1963 5 750 750 5 750 750 5 750 750 5 750 909 6 750 475 6 750 750 6 750 .I 751 .T A Note on a Set of Test Matrices for Inversion .B CACM September, 1963 .A Rodman, R. D. .N CA630907 JB March 13, 1978 7:38 PM .X 751 5 751 751 5 751 751 5 751 .I 752 .T Closing Out a Print Tape .B CACM September, 1963 .A Moore, D. P. .N CA630906 JB March 13, 1978 7:39 PM .X 752 5 752 752 5 752 752 5 752 .I 753 .T A Procedure for Converting Logic Table Conditions into an Efficient Sequence of Test Instructions .B CACM September, 1963 .A Egler, J. F. .N CA630905 JB March 13, 1978 7:40 PM .X 1237 4 753 2220 4 753 753 4 753 1237 5 753 250 5 753 1549 5 753 1564 5 753 2453 5 753 753 5 753 753 5 753 753 5 753 106 6 753 1051 6 753 1172 6 753 1354 6 753 210 6 753 250 6 753 320 6 753 2053 6 753 2220 6 753 406 6 753 627 6 753 731 6 753 753 6 753 753 6 753 753 6 753 753 6 753 .I 754 .T Ye Indiscreet Monitor .B CACM September, 1963 .A Blatt, J. M. .N CA630904 JB March 13, 1978 7:41 PM .X 754 4 754 153 5 754 754 5 754 754 5 754 754 5 754 .I 755 .T An Exponential Method of Numerical Integration of Ordinary Differential Equations .W A formula for numerical integration is prepared, which involves an exponential term. This formula is compared to two standard integration methods, and it is shown that for a large class of differential equations, the exponential formula has superior stability properties for large step sizes. Thus this formula may be used with a large step size to decrease the total computing time for a solution significantly, particularly in those engineering problems where high accuracy is not needed. .B CACM August, 1963 .A Pope, D. A. .N CA630843 JB March 13, 1978 7:52 PM .X 2567 5 755 755 5 755 755 5 755 755 5 755 2268 6 755 755 6 755 .I 756 .T A Computer Program for Editing the News .B CACM August, 1963 .A Danielson, W. A. Briggs, B. .N CA630842 JB March 13, 1978 7:53 PM .X 756 5 756 756 5 756 756 5 756 .I 757 .T Simulation of a Traffic Network .B CACM August, 1963 .A Katz, J. H. .N CA630841 JB March 13, 1978 7:55 PM .X 1890 5 757 757 5 757 757 5 757 757 5 757 757 6 757 .I 758 .T Skeletal Structure of PERT and CPA Computer Programs .W An introduction to the inner mechanics of PERT and CPA computer programs is provided. The major components of these programs as well as their purposes and interrelationships are outlined. .B CACM August, 1963 .A Kahn, A. B. .N CA630840 JB March 13, 1978 7:58 PM .X 1050 4 758 1226 4 758 1723 4 758 441 4 758 758 4 758 758 4 758 367 5 758 441 5 758 758 5 758 758 5 758 758 5 758 .I 759 .T Continued Operation Notation for Symbol Manipulation and Array Processing .W A brief account is given of a notational device that is very useful in the formal representation of syntaxes, string relationships and string transformation procedures and also of computing procedures that deal with arrays of functions of many variables. The device consists of the use of certain "continued operation" or "collective" symbols that are analogous to the summation symbol (Sigma) and continued multiplication symbol (Pi) of conventional mathematics. .B CACM August, 1963 .A Barnett, M. P. .N CA630839 JB March 13, 1978 8:02 PM .X 1062 4 759 1121 4 759 1139 4 759 1265 4 759 1781 4 759 720 4 759 759 4 759 964 5 759 1121 5 759 464 5 759 659 5 759 759 5 759 759 5 759 759 5 759 284 6 759 464 6 759 561 6 759 759 6 759 759 6 759 759 6 759 .I 760 .T Dialects of FORTRAN .B CACM August, 1963 .A Pyle, I. C. .N CA630838 JB March 13, 1978 8:03 PM .X 760 5 760 760 5 760 760 5 760 .I 761 .T A Note on the Dangling Else in ALGOL 60 .W Some revisions of ALGOL 60 are proposed, which not only eliminate certain ambiguous statements but also add some convenience to the language. A discussion of the background of the problem and a sketch of a proof that the ambiguities have been removed is included. .B CACM August, 1963 .A Kaupe Jr., A. F. .N CA630837 JB March 13, 1978 8:06 PM .X 249 4 761 254 4 761 272 4 761 1086 4 761 1102 4 761 1109 4 761 1132 4 761 1140 4 761 1188 4 761 1234 4 761 1263 4 761 1265 4 761 1270 4 761 1306 4 761 1323 4 761 1358 4 761 1379 4 761 1380 4 761 1453 4 761 1464 4 761 1464 4 761 1484 4 761 1491 4 761 1491 4 761 1498 4 761 1613 4 761 1614 4 761 1767 4 761 1781 4 761 1781 4 761 1787 4 761 1825 4 761 1860 4 761 1949 4 761 321 4 761 2059 4 761 2083 4 761 2126 4 761 2178 4 761 2179 4 761 2252 4 761 2325 4 761 2341 4 761 2546 4 761 435 4 761 437 4 761 463 4 761 483 4 761 491 4 761 2645 4 761 2652 4 761 2684 4 761 2732 4 761 2842 4 761 2929 4 761 2934 4 761 560 4 761 583 4 761 3069 4 761 3073 4 761 627 4 761 631 4 761 632 4 761 642 4 761 644 4 761 653 4 761 669 4 761 679 4 761 680 4 761 691 4 761 761 4 761 761 4 761 761 4 761 762 4 761 763 4 761 123 4 761 140 4 761 919 4 761 949 4 761 989 4 761 989 4 761 196 5 761 947 5 761 1379 5 761 3184 5 761 761 5 761 761 5 761 761 5 761 1263 6 761 1477 6 761 3184 6 761 669 6 761 761 6 761 .I 762 .T Some Remarks on the Syntax of Symbolic Programming Languages .B CACM August, 1963 .A DiForino, A. C. .N CA630836 JB March 13, 1978 8:07 PM .X 249 4 762 254 4 762 272 4 762 1102 4 762 1102 4 762 1109 4 762 1140 4 762 1142 4 762 1188 4 762 1306 4 762 1425 4 762 1464 4 762 1491 4 762 1767 4 762 1781 4 762 1781 4 762 1781 4 762 1787 4 762 1945 4 762 1949 4 762 321 4 762 2059 4 762 2126 4 762 435 4 762 437 4 762 438 4 762 463 4 762 483 4 762 491 4 762 2732 4 762 560 4 762 583 4 762 3073 4 762 627 4 762 631 4 762 632 4 762 642 4 762 644 4 762 653 4 762 680 4 762 761 4 762 762 4 762 762 4 762 762 4 762 763 4 762 123 4 762 140 4 762 919 4 762 949 4 762 989 4 762 196 5 762 249 5 762 483 5 762 762 5 762 762 5 762 762 5 762 .I 763 .T A Syntax Controlled Generator of Formal Language Processors .B CACM August, 1963 .A Eickel, J. Bauer, F. L. Paul, M. Samelson, K. .N CA630835 JB March 13, 1978 8:08 PM .X 249 4 763 254 4 763 267 4 763 272 4 763 1046 4 763 1102 4 763 1105 4 763 1109 4 763 1139 4 763 1139 4 763 1139 4 763 1140 4 763 1140 4 763 1141 4 763 1188 4 763 1215 4 763 1223 4 763 1234 4 763 1263 4 763 1265 4 763 1265 4 763 1306 4 763 1464 4 763 1491 4 763 1496 4 763 1647 4 763 1665 4 763 1767 4 763 1781 4 763 1781 4 763 1781 4 763 1787 4 763 1787 4 763 1792 4 763 1824 4 763 1949 4 763 321 4 763 364 4 763 2059 4 763 2126 4 763 2126 4 763 405 4 763 2546 4 763 435 4 763 437 4 763 438 4 763 463 4 763 464 4 763 483 4 763 491 4 763 2732 4 763 560 4 763 583 4 763 584 4 763 3073 4 763 627 4 763 631 4 763 631 4 763 632 4 763 642 4 763 644 4 763 653 4 763 653 4 763 680 4 763 680 4 763 761 4 763 762 4 763 763 4 763 763 4 763 763 4 763 763 4 763 763 4 763 795 4 763 799 4 763 123 4 763 140 4 763 919 4 763 945 4 763 989 4 763 196 5 763 1215 5 763 224 5 763 1781 5 763 1787 5 763 1945 5 763 2603 5 763 404 5 763 412 5 763 631 5 763 763 5 763 763 5 763 763 5 763 823 6 763 123 6 763 196 6 763 196 6 763 914 6 763 915 6 763 917 6 763 919 6 763 984 6 763 989 6 763 990 6 763 990 6 763 1007 6 763 1012 6 763 1025 6 763 1046 6 763 1084 6 763 1098 6 763 1122 6 763 1131 6 763 1138 6 763 1139 6 763 1139 6 763 1140 6 763 1141 6 763 1141 6 763 1149 6 763 1198 6 763 1200 6 763 1215 6 763 1215 6 763 1223 6 763 1223 6 763 1265 6 763 1265 6 763 1303 6 763 1323 6 763 1336 6 763 1358 6 763 1366 6 763 1396 6 763 1421 6 763 1455 6 763 1460 6 763 1462 6 763 1463 6 763 1467 6 763 1468 6 763 1477 6 763 1477 6 763 1487 6 763 1491 6 763 1491 6 763 1491 6 763 1491 6 763 1496 6 763 1496 6 763 1496 6 763 1531 6 763 1535 6 763 1565 6 763 1601 6 763 1602 6 763 1613 6 763 1614 6 763 1626 6 763 1641 6 763 1781 6 763 1787 6 763 1788 6 763 205 6 763 224 6 763 224 6 763 224 6 763 249 6 763 288 6 763 316 6 763 381 6 763 398 6 763 11 6 763 404 6 763 410 6 763 463 6 763 464 6 763 483 6 763 483 6 763 3184 6 763 3188 6 763 584 6 763 584 6 763 600 6 763 669 6 763 680 6 763 680 6 763 691 6 763 763 6 763 763 6 763 763 6 763 763 6 763 763 6 763 799 6 763 799 6 763 .I 764 .T Reduction of a Matrix Containing Polynomial Elements (Algorithm 170) .B CACM August, 1963 .A Hennion, P. E. .N CA630834 JB March 13, 1978 8:09 PM .X 764 5 764 764 5 764 764 5 764 .I 765 .T Orthogonal Polynomial Least Squares Surface Fit (Algorithm 164) .B CACM August, 1963 .A Bitterli, C. V. .N CA630833 JB March 13, 1978 8:10 PM .X 765 5 765 765 5 765 765 5 765 .I 766 .T XY-move Plotting (Algorithm 162) .B CACM August, 1963 .A Fletcher, W. E. .N CA630832 JB March 13, 1978 8:12 PM .X 766 5 766 766 5 766 766 5 766 .I 767 .T Certification of Algorithm 161 Combinatorial of M Things Taken One at a Time, Two at a Time, Up to N at a Time [M. L. Wolfson and H. V. Wright, Comm. ACM, Apr. 1963] .B CACM August, 1963 .A Thoro, D. .N CA630831 JB March 13, 1978 8:13 PM .X 767 5 767 767 5 767 767 5 767 .I 768 .T Certification of Algorithm 160 Combinatorial of M Things Taken N at a Time [M. L. Wolfson and H. V. Wright, Comm. ACM, Apr. 1963] .B CACM August, 1963 .A Thoro, D. .N CA630830 JB March 13, 1978 8:14 PM .X 768 5 768 768 5 768 768 5 768 .I 769 .T Algebra of Sets (Algorithm 156) .B CACM August, 1963 .A Bosworth, K. M. .N CA630829 JB March 13, 1978 8:15 PM .X 769 5 769 769 5 769 769 5 769 .I 770 .T Combination in Any Order (Algorithm 155) .B CACM August, 1963 .A Bosworth, K. M. .N CA630828 JB March 13, 1978 8:17 PM .X 770 5 770 770 5 770 770 5 770 .I 771 .T Combination in Lexicographical Order (Algorithm 154) .B CACM August, 1963 .A Bosworth, K. M. .N CA630827 JB March 13, 1978 8:18 PM .X 771 5 771 771 5 771 771 5 771 .I 772 .T GOMORY (Algorithm 153) .B CACM August, 1963 .A Lefkowitz, B. D'Esopo, D. A. .N CA630826 JB March 13, 1978 8:19 PM .X 772 5 772 772 5 772 772 5 772 .I 773 .T Matrix Inversion (Algorithm 140) .B CACM August, 1963 .A George, R. .N CA630825 JB March 13, 1978 8:20 PM .X 2061 5 773 773 5 773 773 5 773 773 5 773 1140 6 773 1141 6 773 1477 6 773 1491 6 773 1825 6 773 773 6 773 .I 774 .T Jacobi (Algorithm 85) .B CACM August, 1963 .A Naur, P. .N CA630824 JB March 13, 1978 8:21 PM .X 2349 5 774 774 5 774 774 5 774 774 5 774 1648 6 774 1716 6 774 1794 6 774 1894 6 774 2043 6 774 501 6 774 613 6 774 774 6 774 .I 775 .T Interpolation, Differentiation, and Integration (Algorithm 77) .B CACM August, 1963 .A Hennion, P. E. .N CA630823 JB March 13, 1978 8:22 PM .X 775 5 775 775 5 775 775 5 775 .I 776 .T Partition, Quicksort, and Find (Algorithm 62, 64, & 65) .B CACM August, 1963 .A Randell, B. Russell, L. J. .N CA630822 JB March 13, 1978 8:23 PM .X 3054 5 776 776 5 776 776 5 776 776 5 776 1175 6 776 1880 6 776 1919 6 776 1969 6 776 1980 6 776 1997 6 776 307 6 776 308 6 776 309 6 776 2017 6 776 2679 6 776 776 6 776 .I 777 .T A Set of Test Matrices (Algorithm 52) .B CACM August, 1963 .A Naur, P. .N CA630821 JB March 13, 1978 8:24 PM .X 777 5 777 777 5 777 777 5 777 .I 778 .T Associated Legendre Functions of the First Kind for Real or Imaginary Arguments (Algorithm 47) .B CACM August, 1963 .A George, R. .N CA630820 JB March 13, 1978 8:26 PM .X 1818 5 778 778 5 778 778 5 778 778 5 778 778 6 778 .I 779 .T CROUT II (Algorithm 43) .B CACM August, 1963 .A Domingo, C. Rodriguez-Gil, F. .N CA630819 JB March 13, 1978 8:27 PM .X 779 5 779 779 5 779 779 5 779 .I 780 .T Algorithm 42 INVERT, Alg.107 Gauss's Method, Alg.120 Inversion II, and gjr .B CACM August, 1963 .A Naur, P. .N CA630818 JB March 13, 1978 8:29 PM .X 780 5 780 780 5 780 780 5 780 .I 781 .T Telescope 2 (Algorithm 38) .B CACM August, 1963 .A Bridges, J. F. .N CA630817 JB March 13, 1978 8:30 PM .X 781 5 781 781 5 781 781 5 781 .I 782 .T Telescope 1 (Algorithm 37) .B CACM August, 1963 .A Bridges, J. F. .N CA630816 JB March 13, 1978 8:31 PM .X 782 5 782 782 5 782 782 5 782 .I 783 .T Shellsort (Algorithm 201) .B CACM August, 1963 .A Boothroyd, J. .N CA630815 JB March 13, 1978 8:32 PM .X 2679 5 783 783 5 783 783 5 783 783 5 783 970 6 783 1175 6 783 1190 6 783 1228 6 783 1969 6 783 1997 6 783 308 6 783 2042 6 783 3187 6 783 507 6 783 716 6 783 783 6 783 .I 784 .T Normal Random (Algorithm 200) .B CACM August, 1963 .A George, R. .N CA630814 JB March 13, 1978 8:33 PM .X 784 5 784 784 5 784 784 5 784 .I 785 .T Conversions Between Calendar Date And Julian day Number (Algorithm 199) .B CACM August, 1963 .A Tantzen, R. G. .N CA630813 JB March 13, 1978 8:34 PM .X 2269 5 785 3115 5 785 785 5 785 785 5 785 785 5 785 907 6 785 2045 6 785 2417 6 785 2466 6 785 2884 6 785 579 6 785 785 6 785 785 6 785 .I 786 .T Adaptive Integration and Multiple Integration (Algorithm 198) .B CACM August, 1963 .A McKeeman, W. M. .N CA630812 JB March 13, 1978 8:35 PM .X 1352 5 786 2048 5 786 2074 5 786 786 5 786 786 5 786 786 5 786 834 6 786 834 6 786 834 6 786 872 6 786 872 6 786 1040 6 786 1092 6 786 1241 6 786 1273 6 786 324 6 786 429 6 786 429 6 786 429 6 786 570 6 786 621 6 786 786 6 786 786 6 786 786 6 786 .I 787 .T Matrix Division (Algorithm 197) .B CACM August, 1963 .A Wells, M. .N CA630811 JB March 13, 1978 8:37 PM .X 787 5 787 787 5 787 787 5 787 .I 788 .T Muller's Method for Finding Roots of an Arbitrary Function (Algorithm 196) .B CACM August, 1963 .A Roman, R. D. .N CA630810 JB March 13, 1978 8:38 PM .X 788 5 788 788 5 788 788 5 788 .I 789 .T Bandsolve (Algorithm 195) .B CACM August, 1963 .A Thurnau, D. H. .N CA630809 JB March 13, 1978 8:39 PM .X 789 5 789 789 5 789 789 5 789 .I 790 .T Zersol (Algorithm 194) .B CACM August, 1963 .A Domingo, C. .N CA630808 JB March 13, 1978 8:40 PM .X 790 5 790 790 5 790 790 5 790 .I 791 .T Character Manipulation in 7090 Fortran .B CACM August, 1963 .A Smith, D. D. .N CA630807 JB March 13, 1978 8:41 PM .X 1084 5 791 791 5 791 791 5 791 791 5 791 868 6 791 603 6 791 644 6 791 669 6 791 791 6 791 797 6 791 .I 792 .T Multiple-Precision Binary-To-Decimal Integer Conversion Using Only Addition And Subtraction .B CACM August, 1963 .A Keyes, D. F. Moore, D. P. .N CA630806 JB March 13, 1978 8:42 PM .X 792 5 792 792 5 792 792 5 792 .I 793 .T Mapped List Structures .B CACM August, 1963 .A Baecker, H. D. .N CA630805 JB March 13, 1978 8:43 PM .X 1050 4 793 1549 4 793 2723 4 793 2882 4 793 731 4 793 793 4 793 1051 5 793 627 5 793 793 5 793 793 5 793 793 5 793 210 6 793 378 6 793 406 6 793 731 6 793 793 6 793 794 6 793 .I 794 .T A List-Type Storage Technique for Alphameric Information .W A method which is economic in terms of space and time is proposed for the storage and manipulation of character strings of arbitrary length in a fixed word-length computer. The method is illustrated in an application to Algol-type identifiers in an Algol-like block structure. .B CACM August, 1963 .A Bowlden, H. J. .N CA630804 JB March 13, 1978 8:45 PM .X 794 4 794 1051 5 794 1062 5 794 254 5 794 794 5 794 794 5 794 794 5 794 210 6 794 378 6 794 406 6 794 464 6 794 731 6 794 793 6 794 794 6 794 794 6 794 .I 795 .T Debugging Systems at the Source Language Level .B CACM August, 1963 .A Ferguson, H. E. Berner, E. .N CA630803 JB March 13, 1978 8:46 PM .X 1046 4 795 1105 4 795 1139 4 795 1140 4 795 1234 4 795 1263 4 795 1265 4 795 1496 4 795 1781 4 795 1824 4 795 2126 4 795 2546 4 795 464 4 795 2616 4 795 584 4 795 631 4 795 653 4 795 680 4 795 763 4 795 795 4 795 795 4 795 799 4 795 945 4 795 931 5 795 404 5 795 795 5 795 795 5 795 795 5 795 .I 796 .T SABRAG, A Time-Sharing Low-Cost Computer .W The serial SABRAC computer designed and built in the Scientific Department of the Israel defense Ministry has a 5000-location magnetic drum, main store. To avoid a need to resort to optimum programming techniques and to increase its overall efficiency the computer has also been given a 224-word ferrite core store from which the program is obeyed. Transfers between the core and drum stores and to and from the twin paper-tape input and output channels are all available autonomously (concurrently, time-shared). Multiplication and division orders are also autonomous, so that the machine may be executing up to three orders simultaneously. All functions naturally are interlocked. A number of other advanced orders and facilities are also incorporated.In particular, an "Execute" order permits a temporary jump for up to four orders and a second modifier register permits double modification in general and relative addressing of subroutines in particular. Thus the overall effective speed of the machine is muchhigher than its basic specification would lead one to expect and its design indicates one way in which the concepts of time sharing may be incorporated in "low-cost" computers. .B CACM August, 1963 .A Lehman, M. Netter, Z. Eshed, R. .N CA630802 JB March 13, 1978 8:54 PM .X 3193 4 796 796 4 796 491 5 796 796 5 796 796 5 796 796 5 796 .I 797 .T American Standard Code for Information Interchange .B CACM August, 1963 .N CA630801 JB March 13, 1978 8:55 PM .X 1084 5 797 797 5 797 797 5 797 797 5 797 868 6 797 603 6 797 644 6 797 669 6 797 791 6 797 797 6 797 .I 798 .T A Catalogue Entry Retrieval System .A Scheff, B. H. .B CACM July, 1963 .N CA630726 JB March 14, 1978 8:08 AM .X 1050 4 798 1102 4 798 378 4 798 3008 4 798 731 4 798 798 4 798 209 5 798 798 5 798 798 5 798 798 5 798 .I 799 .T Design of a Separable Transition-Diagram Compiler* .W A COBOL compiler design is presented which is compact enough to permit rapid, one-pass compilation of a large subset of COBOL on a moderately large computer. Versions of the same compiler for smaller machines require only two working tapes plus a compiler tape. The methods given are largely applicable to the construction of ALGOL compilers. .B CACM July, 1963 .A Conway, M. E. .N CA630725 JB March 14, 1978 8:11 AM .X 222 4 799 1046 4 799 1105 4 799 1139 4 799 1139 4 799 1140 4 799 1234 4 799 1263 4 799 1265 4 799 1496 4 799 1781 4 799 1824 4 799 1947 4 799 2126 4 799 2546 4 799 464 4 799 556 4 799 584 4 799 631 4 799 653 4 799 680 4 799 763 4 799 795 4 799 799 4 799 799 4 799 799 4 799 799 4 799 945 4 799 945 5 799 1323 5 799 1358 5 799 1380 5 799 1665 5 799 1781 5 799 1787 5 799 1989 5 799 399 5 799 2112 5 799 2534 5 799 2541 5 799 2698 5 799 2733 5 799 2820 5 799 404 5 799 82 5 799 3073 5 799 3155 5 799 799 5 799 799 5 799 799 5 799 830 6 799 123 6 799 196 6 799 196 6 799 196 6 799 919 6 799 990 6 799 1007 6 799 1046 6 799 1131 6 799 1139 6 799 1140 6 799 1141 6 799 1149 6 799 1198 6 799 1215 6 799 1215 6 799 1223 6 799 1265 6 799 1303 6 799 1323 6 799 1358 6 799 1366 6 799 1421 6 799 1421 6 799 1460 6 799 1460 6 799 1462 6 799 1463 6 799 1467 6 799 1468 6 799 1477 6 799 1477 6 799 1491 6 799 1491 6 799 1491 6 799 1496 6 799 1496 6 799 1531 6 799 1535 6 799 1565 6 799 1601 6 799 1602 6 799 1613 6 799 1614 6 799 1626 6 799 1641 6 799 1781 6 799 1781 6 799 1781 6 799 1781 6 799 1787 6 799 1787 6 799 1788 6 799 205 6 799 205 6 799 224 6 799 224 6 799 249 6 799 267 6 799 288 6 799 1959 6 799 1973 6 799 316 6 799 378 6 799 381 6 799 398 6 799 2110 6 799 2110 6 799 2111 6 799 11 6 799 2179 6 799 2182 6 799 2204 6 799 2247 6 799 2423 6 799 2534 6 799 2556 6 799 2732 6 799 2786 6 799 404 6 799 410 6 799 463 6 799 464 6 799 483 6 799 3073 6 799 3184 6 799 3184 6 799 3184 6 799 3184 6 799 3186 6 799 3188 6 799 584 6 799 600 6 799 631 6 799 680 6 799 680 6 799 691 6 799 729 6 799 731 6 799 763 6 799 763 6 799 799 6 799 799 6 799 799 6 799 799 6 799 799 6 799 799 6 799 799 6 799 799 6 799 799 6 799 799 6 799 799 6 799 799 6 799 799 6 799 799 6 799 799 6 799 .I 800 .T The Linking Segment Subprogram Language and Linking Loader .B CACM July, 1963 .A McCarthy, J. Corbato, F. J. Daggett, M. M. .N CA630724 JB March 14, 1978 8:13 AM .X 1471 5 800 1774 5 800 800 5 800 800 5 800 800 5 800 800 6 800 800 6 800 1173 6 800 271 6 800 276 6 800 .I 801 .T Least Squares Solution with Constraints (Algorithm 177) .B CACM July, 1963 .A Synge, M. J. .N CA630723 JB March 14, 1978 8:14 AM .X 801 5 801 801 5 801 801 5 801 .I 802 .T SYMINV2 (Algorithm 150) .B CACM July, 1963 .A Rutishauser, H. .N CA630722JB March 14, 1978 8:15 AM .X 802 5 802 802 5 802 802 5 802 .I 803 .T Syminv2 (Algorithm 150) .B CACM July, 1963 .A Evans Jr., A. .N CA630721 JB March 14, 1978 8:16 AM .X 803 5 803 803 5 803 803 5 803 .I 804 .T Exponentiation of Series (Algorithms 134) .B CACM July, 1963 .A Thacher Jr., H. C. .N CA630720 JB March 14, 1978 8:19 AM .X 804 5 804 804 5 804 804 5 804 .I 805 .T Newton Maehly (Algorithm 105) .B CACM July, 1963 .A Kondo, J. .N CA630719 JB March 14, 1978 8:20 AM .X 805 5 805 805 5 805 805 5 805 .I 806 .T Remark on Certification of Matrix Inversion Procedures .B CACM July, 1963 .A Moler, C. .N CA630718 JB March 14, 1978 8:21 AM .X 1177 4 806 806 4 806 806 4 806 932 5 806 454 5 806 806 5 806 806 5 806 806 5 806 .I 807 .T Reversion of Series (Algorithm 193) .B CACM July, 1963 .A Fettis, H. E. .N CA630717 JB March 14, 1978 8:22 AM .X 807 5 807 807 5 807 807 5 807 .I 808 .T Confluent Hypergeometric (Algorithm 192) .B CACM July, 1963 .A Relph, A. P. .N CA630716 JB March 14, 1978 8:29 AM .X 808 5 808 808 5 808 808 5 808 .I 809 .T Hypergeometric (Algorithm 191) .B CACM July, 1963 .A Relph, A. P. .N CA630715 JB March 14, 1978 8:30 AM .X 809 5 809 809 5 809 809 5 809 .I 810 .T Complex Power (Algorithm 190) .B CACM July, 1963 .A Relph, A. P. .N CA630714 JB March 14, 1978 8:32 AM .X 810 5 810 810 5 810 810 5 810 .I 811 .T Smoothing 2 (Algorithm 189) .B CACM July, 1963 .A Rodriguez Gil, F. .N CA630713 JB March 14, 1978 8:33 AM .X 811 5 811 811 5 811 811 5 811 .I 812 .T Smoothing 1 (Algorithm 188) .B CACM July, 1963 .A Rodriguez-Gil, F. .N CA630712 JB March 14, 1978 8:34 AM .X 812 5 812 812 5 812 812 5 812 .I 813 .T Differences and Derivatives (Algorithm 187) .B CACM July, 1963 .A Vande Riet, R. P. .N CA630711 JB March 14, 1978 8:35 AM .X 813 5 813 813 5 813 813 5 813 .I 814 .T Complex Arithmetic (Algorithm 186) .B CACM July, 1963 .A Vande Riet, R. P. .N CA630710 JB March 14, 1978 8:36 AM .X 814 5 814 814 5 814 814 5 814 .I 815 .T Normal Probability for Curve Fitting (Algorithm 185) .B CACM July, 1963 .A Colker, A. .N CA630709 JB March 14, 1978 8:38 AM .X 815 5 815 815 5 815 815 5 815 .I 816 .T Erlang Probability for Curve Fitting (Algorithm 184) .B CACM July, 1963 .A Colker, A. .N CA630708 JB March 14, 1978 8:39 AM .X 816 5 816 816 5 816 816 5 816 .I 817 .T Nexcom (Algorithm 152) .B CACM July, 1963 .A Hopley, J. .N CA630707 JB March 14, 1978 8:40 AM .X 817 5 817 817 5 817 817 5 817 .I 818 .T Realizing Boolean Connectives on The IBM 1620 .B CACM July, 1963 .A Hellerman, H. Senzig, D. N. .N CA630706 JB March 14, 1978 8:44 AM .X 818 5 818 818 5 818 818 5 818 .I 819 .T Polynomial Evaluation Revised .B CACM July, 1963 .A Eisman, S. H. .N CA630705 JB March 14, 1978 8:46 AM .X 1620 4 819 819 4 819 1620 5 819 436 5 819 819 5 819 819 5 819 819 5 819 819 6 819 436 6 819 .I 820 .T Checking for Loops in Networks .B CACM July, 1963 .A Gordon, R. M. .N CA630704 JB March 14, 1978 8:47 AM .X 820 5 820 820 5 820 820 5 820 .I 821 .T Further Remarks on Sampling a Tape File-III .B CACM July, 1963 .A Juelich, O. C. .N CA630703 JB March 14, 1978 8:48 AM .X 821 5 821 821 5 821 821 5 821 .I 822 .T Real-Time Programming Specifications .W Problems in the implementation of large real-time applications are treated, and suggested guidelines for both program and file specifications are developed. The problems delineated also occur in systems programming. .B CACM July, 1963 .A Head, R. V. .N CA630702 JB March 14, 1978 8:50 AM .X 822 5 822 822 5 822 822 5 822 .I 823 .T A Syntactic Description of BC NELLIAC .B CACM July, 1963 .A Huskey, H. D. Love, R. Wirth, N. .N CA630701 JB March 14, 1978 8:51 AM .X 1945 5 823 2126 5 823 691 5 823 823 5 823 823 5 823 823 5 823 823 6 823 823 6 823 823 6 823 196 6 823 914 6 823 915 6 823 917 6 823 984 6 823 989 6 823 990 6 823 1012 6 823 1084 6 823 1098 6 823 1122 6 823 1138 6 823 1139 6 823 1141 6 823 1200 6 823 1223 6 823 1265 6 823 1336 6 823 1396 6 823 1455 6 823 1477 6 823 1487 6 823 1491 6 823 1496 6 823 1614 6 823 1693 6 823 404 6 823 483 6 823 3184 6 823 584 6 823 669 6 823 680 6 823 763 6 823 .I 824 .T DESCRIPTRAN-Automated Descriptive Geometry* .W Descriptive geometry consists of procedures originally designed to solve 3-space geometry problems by graphical constructions and measurement instead of by computation. However, in addition to this it unifies and simplifies the approach to many such problems. When one can call subroutines that compute new coordinates that correspond to those obtainable from the graphical constructions, there is the three-way advantage of the approach of descriptive geometry, the accuracy of computation and the speed of the digital computer. DESCRIPTRAN makes it possible to program many problems in 3-space with a few statements; it consists of 15 subroutines analogous to the procedures of descriptive geometry. .B CACM June, 1963 .A Kliphardt, R. A. .N CA630625 JB March 14, 1978 9:56 AM .X 824 5 824 824 5 824 824 5 824 .I 825 .T PIP: A Photo-Interpretive Program for the Analysis of Spark-Chamber Data* .W An operating computer program that processes photographically recorded data is described. The input to the program consists of spark-chamber photographs on which tracks of high-energy particles are recorded. The program automatically scans, measures and performs the preliminary interpretation of these photographs. In continuous operation a processing rate of 5,000 photographic frames per hour is achieved. .B CACM June, 1963 .A Rudloe, H. Deutsch, M. Marill, T. .N CA630624 JB March 14, 1978 9:59 AM .X 825 5 825 825 5 825 825 5 825 .I 826 .T Remarks on Fortran Subroutines for Time Series Analysis .B CACM June, 1963 .A Bennett, C. M. .N CA630623 JB March 14, 1978 10:00 AM .X 1118 4 826 826 4 826 948 4 826 942 5 826 1118 5 826 826 5 826 826 5 826 826 5 826 826 6 826 942 6 826 .I 827 .T Disk File Sorting .W Sorting techniques using an IBM 1401 with a random access storage device are evaluated. .B CACM June, 1963 .A Schick, T. .N CA630622 JB March 14, 1978 10:02 AM .X 827 5 827 827 5 827 827 5 827 .I 828 .T Incompressible flow Network Calculations .W A general method for the calculation of flows and pressures in fluid flow networks is presented. The method is applicable to computer use. .B CACM June, 1963 .A Cantrell, H. N. .N CA630621 JB March 14, 1978 10:03 AM .X 828 5 828 828 5 828 828 5 828 .I 829 .T The External Language KLIPA For the URAL-2 Digital computer .B CACM June, 1963 .A Greniewski, M, Turski, W. .N CA630620 JB March 14, 1978 10:04 AM .X 2905 5 829 829 5 829 829 5 829 829 5 829 829 6 829 .I 830 .T CORC-The Cornell Computing Language .B CACM June, 1963 .A Conway, R. W. Maxwell, W. L. .N CA630619 JB March 14, 1978 10:06 AM .X 1179 5 830 1288 5 830 1544 5 830 1646 5 830 2111 5 830 2534 5 830 2556 5 830 2650 5 830 830 5 830 830 5 830 830 5 830 830 6 830 830 6 830 830 6 830 830 6 830 830 6 830 830 6 830 830 6 830 830 6 830 987 6 830 1072 6 830 1112 6 830 1179 6 830 1592 6 830 1647 6 830 1787 6 830 1935 6 830 1936 6 830 1959 6 830 1973 6 830 2111 6 830 2111 6 830 2111 6 830 2182 6 830 408 6 830 576 6 830 619 6 830 680 6 830 680 6 830 799 6 830 .I 831 .T Real Error Function, ERF (Algorithm 123) .B CACM June, 1963 .A Thacher Jr., H. C. .N CA630618 JB March 14, 1978 10:07 AM .X 1583 5 831 831 5 831 831 5 831 831 5 831 831 6 831 967 6 831 1126 6 831 707 6 831 .I 832 .T Curve Fitting with Constraints (Algorithm 74) .B CACM June, 1963 .A Isoda, K. .N CA630617 JB March 14, 1978 10:08 AM .X 832 5 832 832 5 832 832 5 832 .I 833 .T Reduction of a Symmetric Bandmatrix to Triple Diagonal Form .B CACM June, 1963 .A Schwartz, H. R. .N CA630616JB March 14, 1978 10:09 AM .X 833 5 833 833 5 833 833 5 833 .I 834 .T Nonrecursive Adaptive Integration (Algorithm 182) .B CACM June, 1963 .A McKeeman, W. M. Tesler, L. .N CA630615 JB March 14, 1978 10:10 AM .X 1352 5 834 2048 5 834 2074 5 834 2093 5 834 834 5 834 834 5 834 834 5 834 834 6 834 834 6 834 834 6 834 834 6 834 872 6 834 872 6 834 872 6 834 1040 6 834 1092 6 834 1092 6 834 1241 6 834 1273 6 834 1298 6 834 1573 6 834 324 6 834 429 6 834 429 6 834 429 6 834 429 6 834 570 6 834 621 6 834 786 6 834 786 6 834 786 6 834 .I 835 .T Complementary Error Function-Large X (Algorithm 181) .B CACM June, 1963 .A Thacher Jr., H. C. .N CA630614 JB March 14, 1978 10:12 AM .X 835 5 835 835 5 835 835 5 835 .I 836 .T Error Function-Large X (Algorithm 180) .B CACM June, 1963 .A Thacher Jr., H. C. .N CA630613 JB March 14, 1978 10:13 AM .X 1157 5 836 836 5 836 836 5 836 836 5 836 836 6 836 1081 6 836 485 6 836 714 6 836 .I 837 .T Incomplete Beta Ratio (Algorithm 179) .B CACM June, 1963 .A Ludwig, O. G. .N CA630612 JB March 14, 1978 10:15 AM .X 837 5 837 837 5 837 837 5 837 .I 838 .T Direct Search (Algorithm 178) .B CACM June, 1963 .A Kaupe Jr., A. F. .N CA630611 JB March 14, 1978 10:16 AM .X 838 5 838 838 5 838 838 5 838 .I 839 .T Least Squares Solution with Constraints (Algorithm 177) .B CACM June, 1963 .A Synge, M. J. .N CA630610 JB March 14, 1978 10:17 AM .X 839 5 839 839 5 839 839 5 839 .I 840 .T Least Squares Surface Fit (Algorithm 176) .B CACM June, 1963 .A Arthurs, T. D. .N CA630609 JB March 14, 1978 10:18 AM .X 840 5 840 840 5 840 840 5 840 .I 841 .T Shuttle Sort (Algorithm 175) .B CACM June, 1963 .A Shaw, C. J. Trimble, T. N. .N CA630608 JB March 14, 1978 10:20 AM .X 841 5 841 841 5 841 841 5 841 .I 842 .T A Posteriori Bounds on a Zero of a Polynomial (Algorithm 174) .B CACM June, 1963 .A Gibb, A. .N CA630607 JB March 14, 1978 10:21 AM .X 842 5 842 842 5 842 842 5 842 .I 843 .T Assign (Algorithm 173) .B CACM June, 1963 .A Hajek, O. .N CA630606 JB March 14, 1978 10:22 AM .X 843 5 843 843 5 843 843 5 843 .I 844 .T 1410 Fortran Edit Feature .B CACM June, 1963 .A Fedako,J. E. .N CA630605 JB March 14, 1978 10:23 AM .X 844 5 844 844 5 844 844 5 844 .I 845 .T Another Test Matrix for Determinants and Inverses .B CACM June, 1963 .A Caffrey, J. .N CA630604 JB March 14, 1978 10:24 AM .X 845 5 845 845 5 845 845 5 845 .I 846 .T Self-Inverse Conversion Table .B CACM June, 1963 .A Sanborn, T. G. .N CA630603 JB March 14, 1978 10:25 AM .X 846 5 846 846 5 846 846 5 846 .I 847 .T A Penny-Matching Program .W The logic of a penny-matching program written for the CSX-1 is described. .B CACM June, 1963 .A Wall, E. Brown, R. M. .N CA630602 JB March 14, 1978 10:27 AM .X 847 5 847 847 5 847 847 5 847 .I 848 .T A Note on Range Transformations for Square Root and Logarithm .W There was the germ of an idea in two previous papers [1,2] which no one seems to have picked up in almost five years. For certain functions it seems desirable to transform the argument to a short range symmetric about 10.1 will give examples of this usage for the square root and logarithm function for both binary and decimal machines. .B CACM June, 1963 .A Bemer, R. W. .N CA630601 JB March 14, 1978 10:41 AM .X 848 4 848 848 4 848 26 5 848 35 5 848 848 5 848 848 5 848 848 5 848 .I 849 .T Use of Tree Structures for Processing Files .W In data processing problems, files are frequently used which must both be searched and altered. Binary search techniques are efficient for searching large files, but the associated file organization is not readily adapted to the file alterations. Conversely, a chained file allocation permits efficient alteration but cannot be searched efficiently. A file organized into a tree-like structure is discussed, and it is shown that such a file may both be searched and altered with times proportional to slog(s)N, where N is the number of file items and s is a parameter of the tree. It is also shown that optimizing the value of s leads to a search time which is only 25 per cent slower than the binary search. The tree organization employs two data chains and may be considered to be a compromise between the organizations for the binary search and the chained file. The relation of the tree organization to multidimensional indexing and to the trie structure is also discussed. .B CACM May, 1963 .A Sussenguth Jr., E. H. .N CA630518 JB March 14, 1978 10:49 AM .X 435 4 849 2846 4 849 849 4 849 849 4 849 944 4 849 155 5 849 1050 5 849 1935 5 849 1936 5 849 2017 5 849 2032 5 849 2257 5 849 2360 5 849 2451 5 849 2452 5 849 615 5 849 849 5 849 849 5 849 849 5 849 849 6 849 849 6 849 849 6 849 849 6 849 849 6 849 849 6 849 849 6 849 849 6 849 849 6 849 850 6 849 851 6 849 852 6 849 853 6 849 854 6 849 855 6 849 856 6 849 857 6 849 858 6 849 859 6 849 860 6 849 861 6 849 862 6 849 863 6 849 864 6 849 865 6 849 866 6 849 106 6 849 944 6 849 1115 6 849 1785 6 849 209 6 849 1831 6 849 1831 6 849 1935 6 849 1936 6 849 1936 6 849 1936 6 849 1936 6 849 1976 6 849 367 6 849 2198 6 849 2360 6 849 627 6 849 .I 850 .T Conversion, Reconversion and Comparison Techniques In Variable-Length Sorting .W The logic is described for converting highly variable input records into a format that can be easily and efficiently processed by a sorting program. The internal record formats are discussed in relation to (1) their conversion from input formats, (2) their reconversion to output formats, and (3) comparison techniques between internal formats. .B CACM May, 1963 .A Waks, D. J. .N CA630517 JB March 14, 1978 10:52 AM .X 2017 5 850 850 5 850 850 5 850 850 5 850 849 6 850 850 6 850 851 6 850 852 6 850 853 6 850 854 6 850 855 6 850 856 6 850 857 6 850 858 6 850 859 6 850 860 6 850 861 6 850 862 6 850 863 6 850 864 6 850 865 6 850 866 6 850 .I 851 .T Design and Characteristics of a Variable-Length Record Sort Using New Fixed-Length Record Sorting Techniques .W This paper describes the application of several new techniques for sorting fixed-length records to the problems of variable-length record sorting. The techniques have been implemented on a Sylvania 9400 computer system with 32,000 fixed-length words of memory. Specifically, the techniques sequence variable-length records of unrestricted size, produce long initial strings of data, merge strings of data at the power of T-1, where T is the number of work tapes in a system, and do not restrict the volume of input data. .B CACM May,1963 .A Goetz, M. A. .N CA630516 JB March 14, 1978 10:57 AM .X 2017 4 851 2017 4 851 851 4 851 851 4 851 2017 5 851 851 5 851 851 5 851 851 5 851 858 5 851 865 5 851 849 6 851 850 6 851 851 6 851 852 6 851 853 6 851 854 6 851 855 6 851 856 6 851 857 6 851 858 6 851 859 6 851 860 6 851 861 6 851 862 6 851 863 6 851 864 6 851 865 6 851 866 6 851 .I 852 .T A Method of Comparing the Time Requirements of Sorting Methods .B CACM May, 1963 .A Hall, M. H. .N CA630515 JB March 14, 1978 10:58 AM .X 1919 4 852 852 4 852 852 4 852 864 4 852 864 4 852 865 4 852 232 5 852 2017 5 852 74 5 852 852 5 852 852 5 852 852 5 852 849 6 852 850 6 852 851 6 852 852 6 852 853 6 852 854 6 852 855 6 852 856 6 852 857 6 852 858 6 852 859 6 852 860 6 852 861 6 852 862 6 852 863 6 852 864 6 852 865 6 852 866 6 852 .I 853 .T The COBOL Sort Verb .B CACM May, 1963 .A Paterson, J. B. .N CA630514 JB March 14, 1978 10:59 AM .X 2017 5 853 853 5 853 853 5 853 853 5 853 849 6 853 850 6 853 851 6 853 852 6 853 853 6 853 854 6 853 855 6 853 856 6 853 857 6 853 858 6 853 859 6 853 860 6 853 861 6 853 862 6 853 863 6 853 864 6 853 865 6 853 866 6 853 .I 854 .T Some Characteristics of Sorting in Computing Systems Using Random Access Storage Devices .W The substantial differences in characteristics of random access storage and tape devices dictate that concepts and objectives of computer program design be considered from the viewpoint of the external file medium used. This is particularly true in the case of sorting. In a tape-oriented system, the major sorting problem is that of minimizing merge time despite the limited orders of merge possible. In contrast, sorting in a random access-oriented system encourages the selection of the optimum order of merge from many possible orders. The latter problem is discussed in this paper, along with criteria developed for determining the optimum order of merge according to the various properties of random access storage devices. Attention is also given to the problem of key sorting versus record sorting and the possibly serious disadvantage of key sorting on a random access system. .B CACM May, 1963 .A Hubbard, G. U. .N CA630513 JB March 14, 1978 11:05 AM .X 1956 5 854 2017 5 854 854 5 854 854 5 854 854 5 854 849 6 854 850 6 854 851 6 854 852 6 854 853 6 854 854 6 854 854 6 854 855 6 854 856 6 854 857 6 854 858 6 854 859 6 854 860 6 854 861 6 854 862 6 854 863 6 854 864 6 854 865 6 854 866 6 854 .I 855 .T Organization and Structure of Dataon Disk File Memory Systems for Efficient Sorting and Other Data Processing Programs .W An approach to the organization and structure of data on Bryant Disc File Memory Systems for sorting and performing other data processing functions is presented. The following areas are covered: characteristics of Bryant Disc File Systems on the Bendix G-20 and RCA 301; two proposed "chaining" structures for data; and functions of a Disk File Executive Routine. The concepts for sorting and performing file maintenance processing using the proposed structure and executive routine are discussed. Additionally, it is shown that sorting can be accomplished without the use of disk storage work areas. .B CACM May, 1963 .A Goetz, M. A. .N CA630512 JB March 14, 1978 11:10 AM .X 2017 5 855 855 5 855 855 5 855 855 5 855 849 6 855 850 6 855 851 6 855 852 6 855 853 6 855 854 6 855 855 6 855 856 6 855 857 6 855 858 6 855 859 6 855 860 6 855 861 6 855 862 6 855 863 6 855 864 6 855 865 6 855 866 6 855 .I 856 .T Sorting with Large Volume, Random Access, Drum Storage .W An approach to sorting records is described using random access drum memory. The Sort program described is designed to be a generalized, self-generating sort, applicable to a variety of record statements. This description is divided into three parts. The first part presents the operating environment; the second defines the general solution; the third part describes the internal sort-merge technique. .B CACM May, 1963 .A Falkin, J. Savastano Jr., S. .N CA630511 JB March 14, 1978 11:14 AM .X 2017 5 856 856 5 856 856 5 856 856 5 856 849 6 856 850 6 856 851 6 856 852 6 856 853 6 856 854 6 856 855 6 856 856 6 856 857 6 856 858 6 856 859 6 856 860 6 856 861 6 856 862 6 856 863 6 856 864 6 856 865 6 856 866 6 856 .I 857 .T Sorting Nonredundant Files-Techniques Used in the FACT Compiler .W Some typical file structures, including some called "non-redundant," are examined,and the methods used in FACT to sort such files are discussed. .B CACM May, 1963 .A Glore, J. B. .N CA630510 JB March 14, 1978 11:16 AM .X 2017 5 857 857 5 857 857 5 857 857 5 857 849 6 857 850 6 857 851 6 857 852 6 857 853 6 857 854 6 857 855 6 857 856 6 857 857 6 857 858 6 857 859 6 857 860 6 857 861 6 857 862 6 857 863 6 857 864 6 857 865 6 857 866 6 857 .I 858 .T A Tape File Merge Pattern Generator .W A routine is presented which specifies the sequence of merge cycles to effect the merging of sorted tape files. The routine is designed to minimize elapsed computer time by varying the power of the merge cycles, so as to use all the available tape drives, with its characteristic of assigning one drive to a single-reel file and two drives to each multiple-reel file. .B CACM May, 1963 .A Cooke, W. S. .N CA630509 JB March 14, 1978 11:21 AM .X 2017 5 858 851 5 858 858 5 858 858 5 858 858 5 858 849 6 858 850 6 858 851 6 858 852 6 858 853 6 858 854 6 858 855 6 858 856 6 858 857 6 858 858 6 858 858 6 858 859 6 858 860 6 858 861 6 858 862 6 858 863 6 858 864 6 858 865 6 858 865 6 858 866 6 858 .I 859 .T Computer Planned Collates .B CACM May, 1963 .A French, N.C. .N CA630508 JB March 14, 1978 11:22 AM .X 2017 5 859 859 5 859 859 5 859 859 5 859 849 6 859 850 6 859 851 6 859 852 6 859 853 6 859 854 6 859 855 6 859 856 6 859 857 6 859 858 6 859 859 6 859 860 6 859 861 6 859 862 6 859 863 6 859 864 6 859 865 6 859 866 6 859 .I 860 .T A Comparison Between the Polyphase and Oscillating Sort Techniques .W A comparison between the Oscillating and Polyphase Sort techniques is developed for computer systems having from four to ten tape drives. The basis for the comparison is the total reading and writing required for various number of input strings and tape drives for the two techniques. .B CACM May, 1963 .A Goetz, M. A. Toth, G. S. .N CA630507 JB March 14, 1978 11:25 AM .X 1117 4 860 2017 4 860 2146 4 860 677 4 860 860 4 860 860 4 860 862 4 860 2017 5 860 479 5 860 860 5 860 860 5 860 860 5 860 861 5 860 849 6 860 850 6 860 851 6 860 852 6 860 853 6 860 854 6 860 855 6 860 856 6 860 857 6 860 858 6 860 859 6 860 860 6 860 861 6 860 862 6 860 863 6 860 864 6 860 865 6 860 866 6 860 .I 861 .T Read-Backward Polyphase Sorting .W Read-backward Polyphase sorting provides more efficient use of the tapes available to a sort than most other sorting techniques. Backward Polyphase produces a continuous merging process from n-1 tapes where n is the total number of tapes being used in the sorting process. Any of the available presorting techniques may be used in conjunction with the Polyphase merge sort provided that the presort has the capability of producing both ascending and descending strings and distributing the strings on the various tapes as required by the Polyphase Merge. .B CACM May, 1963 .A Gilstad, R. L. .N CA630506 JB March 14, 1978 11:28 AM .X 1117 4 861 2017 4 861 2146 4 861 861 4 861 1117 5 861 2017 5 861 2146 5 861 677 5 861 860 5 861 862 5 861 861 5 861 861 5 861 861 5 861 849 6 861 850 6 861 851 6 861 852 6 861 853 6 861 854 6 861 855 6 861 856 6 861 857 6 861 858 6 861 859 6 861 860 6 861 861 6 861 861 6 861 861 6 861 861 6 861 861 6 861 862 6 861 862 6 861 862 6 861 863 6 861 863 6 861 864 6 861 865 6 861 866 6 861 299 6 861 479 6 861 636 6 861 .I 862 .T String Distribution for the Polyphase Sort .B CACM May, 1963 .A Malcolm Jr., W. D. .N CA630505 JB March 14, 1978 11:29 AM .X 2146 4 862 479 4 862 860 4 862 862 4 862 862 4 862 863 4 862 1117 5 862 299 5 862 2017 5 862 2146 5 862 479 5 862 862 5 862 862 5 862 862 5 862 861 5 862 849 6 862 850 6 862 851 6 862 852 6 862 853 6 862 854 6 862 855 6 862 856 6 862 857 6 862 858 6 862 859 6 862 860 6 862 861 6 862 861 6 862 861 6 862 862 6 862 862 6 862 862 6 862 862 6 862 863 6 862 863 6 862 864 6 862 865 6 862 866 6 862 299 6 862 636 6 862 .I 863 .T Multiphase Sorting .B CACM May, 1963 .A Manker, H. H. .N CA630504 JB March 14, 1978 11:30 AM .X 2146 4 863 479 4 863 862 4 863 863 4 863 299 5 863 2017 5 863 2146 5 863 863 5 863 863 5 863 863 5 863 849 6 863 850 6 863 851 6 863 852 6 863 853 6 863 854 6 863 855 6 863 856 6 863 857 6 863 858 6 863 859 6 863 860 6 863 861 6 863 861 6 863 862 6 863 862 6 863 863 6 863 863 6 863 864 6 863 865 6 863 866 6 863 299 6 863 .I 864 .T An Empirical Study of Minimal Storage Sorting .B CACM May, 1963 .A Hibbard, T. N. .N CA630503 JB March 14, 1978 11:31 AM .X 1919 4 864 1919 4 864 2191 4 864 2388 4 864 2783 4 864 2784 4 864 3054 4 864 3121 4 864 852 4 864 852 4 864 864 4 864 864 4 864 864 4 864 865 4 864 1175 5 864 232 5 864 1919 5 864 309 5 864 2017 5 864 2041 5 864 2216 5 864 74 5 864 864 5 864 864 5 864 864 5 864 849 6 864 850 6 864 851 6 864 852 6 864 853 6 864 854 6 864 855 6 864 856 6 864 857 6 864 858 6 864 859 6 864 860 6 864 861 6 864 862 6 864 863 6 864 864 6 864 864 6 864 864 6 864 864 6 864 864 6 864 865 6 864 866 6 864 1175 6 864 1919 6 864 1969 6 864 1997 6 864 308 6 864 308 6 864 309 6 864 74 6 864 3187 6 864 .I 865 .T Internal and Tape Sorting Using the Replacement-Selection Technique .W A general technique for sequencing unsorted records is presented. The technique is shown to be applicable for the first stage of a generalized sort program (the formation of initial strings) as well as for sorting records within a memory storage (an internal sort). It is shown that given N records in memory storage, records are sequenced using 1+log2 N tests per record, that initial string lengths will average 2N for random input records, and that reading, writing and processing can be accomplished simultaneously if the computer permits such overlap. .B CACM May, 1963 .A Goetz, M. A. .N CA630502 JB March 14, 1978 11:36 AM .X 1919 4 865 852 4 865 864 4 865 865 4 865 2017 5 865 74 5 865 851 5 865 865 5 865 865 5 865 865 5 865 849 6 865 850 6 865 851 6 865 852 6 865 853 6 865 854 6 865 855 6 865 856 6 865 857 6 865 858 6 865 858 6 865 859 6 865 860 6 865 861 6 865 862 6 865 863 6 865 864 6 865 865 6 865 865 6 865 866 6 865 .I 866 .T Sorting on Computers .B CACM May, 1963 .A Gotlieb, C. C. .N CA630501 JB March 14, 1978 11:37 AM .X 2017 5 866 866 5 866 866 5 866 866 5 866 849 6 866 850 6 866 851 6 866 852 6 866 853 6 866 854 6 866 855 6 866 856 6 866 857 6 866 858 6 866 859 6 866 860 6 866 861 6 866 862 6 866 863 6 866 864 6 866 865 6 866 866 6 866 .I 867 .T Least Squares Fitting of Planes to Surfaces Using Dynamic Programming .W Dynamic programming has recently been used by Stone, by Bellman and by Gluss to determine the closet fit of broken line segments to a curve in an interval under the constraint that the number of segments is fixed. In the present paper successive models are developed to extend the method to the fitting of broken plane segments to surfaces z=g(x,y) defined over certain types of subareas of the (x,y)-space. The first model considers a rectangular area, with the constraint that the plane segments are defined over a grid in the (x,y)-space. It is then shown how this model may be incorporated into an algorithm that provides successive approximations to optimal fits for any type of closed area. Finally, applications are briefly described. .B CACM April, 1963 .A Gluss, B. .N CA630424 JB March 14, 1978 11:43 AM .X 497 4 867 867 4 867 867 4 867 317 5 867 497 5 867 867 5 867 867 5 867 867 5 867 .I 868 .T A Suggested Method of Making Fuller Use of Strings in ALGOL 60 .B CACM April, 1963 .A Shoffner, M. G. Brown, P. J. .N CA630423 JB March 14, 1978 11:45 AM .X 1084 5 868 868 5 868 868 5 868 868 5 868 868 6 868 603 6 868 644 6 868 669 6 868 791 6 868 797 6 868 .I 869 .T Term of Magic Square (Algorithm 148) .B CACM April, 1963 .A Thoro, D. .N CA630422 JB March 14, 1978 11:46 AM .X 869 5 869 869 5 869 869 5 869 .I 870 .T Term of Magic Square (Algorithm 148) .B CACM April, 1963 .A Barnecut, J. N. R. .N CA630421 JB March 14, 1978 11:47 AM .X 870 5 870 870 5 870 870 5 870 .I 871 .T PSIF (Algorithm 147) .B CACM April, 1963 .A Thacher Jr., H. C. .N CA630420 JB March 14, 1978 11:48 AM .X 1800 5 871 871 5 871 871 5 871 871 5 871 871 6 871 .I 872 .T Adaptive Numerical Integration by Simpson's Rule (Algorithm 145) .B CACM April, 1963 .A McKeeman, W. M. .N CA630419 JB March 14, 1978 11:49 AM .X 1352 5 872 2074 5 872 2093 5 872 872 5 872 872 5 872 872 5 872 834 6 872 834 6 872 834 6 872 872 6 872 872 6 872 872 6 872 1040 6 872 1092 6 872 1092 6 872 1241 6 872 1273 6 872 1298 6 872 1573 6 872 324 6 872 429 6 872 429 6 872 429 6 872 570 6 872 621 6 872 786 6 872 786 6 872 .I 873 .T Random (Algorithm 133) .B CACM April, 1963 .A Poore Jr., J. H. .N CA630418 JB March 14, 1978 11:50 AM .X 873 5 873 873 5 873 873 5 873 .I 874 .T Chebyshev Curvefit (Algorithm 91) .B CACM April, 1963 .A Hale, R. P. .N CA630417 JB March 14, 1978 11:56 AM .X 874 5 874 874 5 874 874 5 874 .I 875 .T Incomplete Elliptic Integrals (Algorithm 73) .B CACM April, 1963 .A van De Riet, R. P. .N CA630416 JB March 14, 1978 12:06 PM .X 875 5 875 875 5 875 875 5 875 .I 876 .T Complete Elliptic Integral (Algorithm 149) .B CACM April, 1963 .A Thacher, H. C. .N CA630415 JB March 14, 1978 12:14 PM .X 876 5 876 876 5 876 876 5 876 .I 877 .T Complete Elliptic Integral of the First Kind (Algorithm 55) .B CACM April, 1963 .A Thacher Jr., H. C. .N CA630414 JB March 14, 1978 12:15 PM .X 877 5 877 877 5 877 877 5 877 .I 878 .T Reduction of a Matrix Containing Polynomial Elements (Algorithm 170) .B CACM April, 1963 .A Hennion, P. E. .N CA630413 JB March 14, 1978 12:17 PM .X 1946 5 878 878 5 878 878 5 878 878 5 878 878 6 878 902 6 878 1093 6 878 1177 6 878 1387 6 878 1393 6 878 360 6 878 731 6 878 .I 879 .T Newton Interpolation with Forward Divided Differences (Algorithm 169) .B CACM April, 1963 .A Kahan, W. Farkas, I. .N CA630412 JB March 14, 1978 12:18 PM .X 1524 5 879 879 5 879 879 5 879 879 5 879 879 6 879 1197 6 879 311 6 879 .I 880 .T Newton Interpolation with Backward Divided Differences .B CACM April, 1963 .A Kahan, W. Farkas, I. .N CA630411 JB March 14, 1978 12:20 PM .X 880 5 880 880 5 880 880 5 880 .I 881 .T Calculation of Confluent Divided Differences (Algorithm 167) .B CACM April, 1963 .A Kahan, W. Farkas, I. .N CA630410 JB March 14, 1978 12:21 PM .X 881 5 881 881 5 881 881 5 881 .I 882 .T Monte Carlo (Algorithm 166) .B CACM April, 1963 .A Rodman, R. D. .N CA630409 JB March 14, 1978 12:22 PM .X 882 5 882 882 5 882 882 5 882 .I 883 .T Complete Elliptic Integrals (Algorithm 165) .B CACM April, 1963 .A Thacher Jr., H. C. .N CA630408 JB March 14, 1978 12:23 PM .X 883 5 883 883 5 883 883 5 883 .I 884 .T Orthogonal Polynomial Least Squares Surface Fit (Algorithm 164) .B CACM April, 1963 .A Clark, R. E. Kubik, R. N. Phillips, L. P. .N CA630407 JB March 14, 1978 12:25 PM .X 884 5 884 884 5 884 884 5 884 .I 885 .T Modified Hankel Function (Algorithm 163) .B CACM April, 1963 .A Fettis, H. E. .N CA630406 JB March 14, 1978 12:26 PM .X 1040 5 885 885 5 885 885 5 885 885 5 885 885 6 885 587 6 885 621 6 885 .I 886 .T XY-move Plotting (Algorithm 162) .B CACM April, 1963 .A Stockton, F. G. .N CA630405 JB March 14, 1978 12:27 PM .X 886 5 886 886 5 886 886 5 886 .I 887 .T Combinatorial of M Things Taken One at a Time, Two at a Time, Up to N at a Time (Algorithm 161) .B CACM April, 1963 .A Wright, H. V. Wolfson, M. L. .N CA630404 JB March 14, 1978 12:28 PM .X 887 5 887 887 5 887 887 5 887 .I 888 .T Algorithm 160 Combinatorial of M Things Taken N at A Time .B CACM April, 1963 .A Wolfson, M. L. Wright, H. V. .N CA630403 JB March 14, 1978 12:29 PM .X 2590 5 888 888 5 888 888 5 888 888 5 888 888 6 888 .I 889 .T Official Actions and Responses to ALGOL As a Programming Language .B CACM April, 1963 .N CA630402 JB March 14, 1978 12:30 PM .X 889 5 889 889 5 889 889 5 889 .I 890 .T Selected Definitions .W A selection of the definitions prepared by the ACM Standards Committee's Subcommittee on Programming Terminology is presented for review by the ACM membership. .B CACM April, 1963 .A Fritz, W. B. .N CA630401 JB March 14, 1978 12:32 PM .X 690 5 890 890 5 890 890 5 890 890 5 890 890 6 890 929 6 890 3195 6 890 .I 891 .T Everyman's Information Retrieval System .W The information retrieval problem whose solution is presented here was posed by a technical library with limited bubget and personnel. The solution, however, is quite general and is applicable to many different types of retrieval problems. Further,the method of solution makes it possible for many groups who have previously dismissed an information retrieval program as expensive and difficult (from a programming stand-point) to reconsider their position, for the present solution makes it possible to install an information retrieval program in less than three months, and with relatively little equipment. .B CACM March, 1963 .A Whitley, V. W. .N CA630329 JB March 14, 1978 12:37 PM .X 891 5 891 891 5 891 891 5 891 .I 892 .T RECOL-A Retrieval Command Language .W An interrogation scheme is described for the retrieval and manipulation of data file records. The language of the interrogation scheme allows for selecting file records with the are of logical condition statements, defining record classes, associating file records, editing printed output, and summarizing the results of the above operations. Some examples of a typical file application and the more significant features of a particular machine implementation are given. .B CACM March, 1963 .A Climenson, W. D. .N CA630328 JB March 14, 1978 12:42 PM .X 1309 4 892 1324 4 892 892 4 892 892 4 892 653 5 892 656 5 892 892 5 892 892 5 892 892 5 892 .I 893 .T Significance Arithmetic on a Digital Computer .W The 7090 at NYU has been modified to include a "Significance Mode" of operation which is intended to facilitate the identification of significant bits in the results of floating-point arithmetic operations. The manner in which floating-point arithmetic is handled in this mode is discussed. Several numerical experiments using this mode are described and comparisons are made with the ordinary "normalized mode." Examples include power series evaluation, linear equations solution, determinant evaluation and matrix inversion. .B CACM March, 1963 .A Goldstein, M. .N CA630327 JB March 14, 1978 12:47 PM .X 3131 5 893 893 5 893 893 5 893 893 5 893 893 6 893 1148 6 893 .I 894 .T An Iterative Factorization Technique for Polynomials .W An iterative technique is displayed whereby factors of arbitrary degree can be found for polynomials in one variable. Convergence is shown to occur always if a certain Jacobian does not vanish and if the initial approximation to a factor is near enough to an actual factor. The process is simply programmed, and preliminary results indicate it to be well adapted to use with digital computers. For factors of degree two, the technique is similar to that of Bairstow, the present method being somewhat simpler. .B CACM March, 1963 .A Luther, H. A. .N CA630326 JB March 14, 1978 12:51 PM .X 1111 5 894 894 5 894 894 5 894 894 5 894 894 6 894 .I 895 .T A Computational Extension of the Variate Difference Method .W Presented here is a computational extension of the variate difference method as developed by G. Tintner [1]. .B CACM March, 1963 .A Scheinok, P. A. .N CA630325 JB March 14, 1978 12:57 PM .X 895 5 895 895 5 895 895 5 895 .I 896 .T Characteristic Values and Vectors of Defective Matrices .B CACM March, 1963 .A Thompson, G. T. .N CA630324 JB March 14, 1978 12:58 PM .X 896 5 896 896 5 896 896 5 896 .I 897 .T Note on the Proof of the Non-existence of a Phrase Structure Grammar for ALGOL 60 .B CACM March, 1963 .A Brown, P. J. .N CA630323 JB March 14, 1978 1:00 PM .X 897 5 897 897 5 897 897 5 897 .I 898 .T Random (Algorithm 133) .B CACM March, 1963 .A Laughlin, D. L. .N CA630322 JB March 14, 1978 1:01 PM .X 898 5 898 898 5 898 898 5 898 .I 899 .T Magic Square (Algorithm 117 & 118) .B CACM March, 1963 .A Bosworth, K. M. .N CA630321 JB March 14, 1978 1:02 PM .X 899 5 899 899 5 899 899 5 899 .I 900 .T Ancestor (Algorithm 79) .B CACM March, 1963 .A Thacher Jr., H. C. .N CA630320 JB March 14, 1978 1:23 PM .X 900 5 900 900 5 900 900 5 900 .I 901 .T Difference Expression Coefficients (Algorithm 79) .B CACM March, 1963 .A Clark, E. S. .N CA630319 JB March 14, 1978 1:24 PM .X 901 5 901 901 5 901 901 5 901 .I 902 .T Determinant (Algorithm 159) .B CACM March, 1963 .A Digby, D. W. .N CA630318 JB March 14, 1978 1:28 PM .X 902 5 902 902 5 902 902 5 902 1946 5 902 878 6 902 902 6 902 1093 6 902 1177 6 902 1387 6 902 1393 6 902 360 6 902 731 6 902 .I 903 .T Exponentiation of Series (Algorithm 134 ) .B CACM March, 1963 .A Fettis, H. E. .N CA630317 JB March 14, 1978 1:29 PM .X 903 5 903 903 5 903 903 5 903 .I 904 .T Fourier Series Approximation (Algorithm 157) .B CACM March, 1963 .A Mifsud, C. J. .N CA630316 JB March 14, 1978 1:31 PM .X 904 5 904 904 5 904 904 5 904 .I 905 .T Algebra of Sets (Algorithm 156) .B CACM March, 1963 .A Mifsud, C. J. .N CA630315 JB March 14, 1978 1:32 PM .X 905 5 905 905 5 905 905 5 905 .I 906 .T Combination in any Order (Algorithm 155) .B CACM March, 1963 .A Mifsud, C. J. .N CA630314 JB March 14, 1978 1:33 PM .X 906 5 906 906 5 906 906 5 906 .I 907 .T Combination in Lexicographical Order (Algorithm 154) .B CACM March, 1963 .A Mifsud, C. J. .N CA630313 JB March 14, 1978 1:34 PM .X 907 5 907 907 5 907 907 5 907 3115 5 907 907 6 907 2045 6 907 2417 6 907 2466 6 907 2884 6 907 579 6 907 785 6 907 .I 908 .T Test Matrix for Inversion .B CACM March, 1963 .A LaSor, W. S. .N CA630312a JB March 14, 1978 1:38 PM .X 908 5 908 908 5 908 908 5 908 .I 909 .T Arithmetizing Declarations (Corrigendum) .B CACM March, 1963 .A Conway, M. E. Speroni, J. .N CA630312b JB March 14, 1978 1:40 PM .X 909 5 909 909 5 909 909 5 909 1963 5 909 909 6 909 475 6 909 750 6 909 .I 910 .T Selective Instruction Trap for the 7090 .B CACM March, 1963 .A Mayer, R. J. .N CA630311 JB March 14, 1978 1:41 PM .X 910 5 910 910 5 910 910 5 910 .I 911 .T A Variant Method of File Searching .B CACM March, 1963 .A McIlroy, M. D. .N CA630310 JB March 14, 1978 1:42 PM .X 1271 4 911 1785 4 911 1785 4 911 2203 4 911 2543 4 911 2552 4 911 2860 4 911 911 4 911 911 4 911 911 5 911 911 5 911 911 5 911 1785 5 911 332 5 911 2203 5 911 2552 5 911 492 5 911 911 6 911 911 6 911 911 6 911 1785 6 911 1785 6 911 1786 6 911 332 6 911 332 6 911 2107 6 911 2109 6 911 2203 6 911 492 6 911 492 6 911 .I 912 .T Addressing an Array Yi in k-Dimensions by Fortran for Analysis of Variance .B CACM March, 1963 .A Garber, M. J. .N CA630309 JB March 14, 1978 1:44 PM .X 912 5 912 912 5 912 912 5 912 1014 5 912 912 6 912 .I 913 .T Neliac .B CACM March, 1963 .A Halstead, M. H. .N CA630308 JB March 14, 1978 1:45 PM .X 913 5 913 913 5 913 913 5 913 .I 914 .T Jovial and Its Documentation .B CACM March, 1963 .A Shaw, C. J. .N CA630307 JB March 14, 1978 1:46 PM .X 914 5 914 914 5 914 914 5 914 1945 5 914 823 6 914 914 6 914 915 6 914 917 6 914 984 6 914 989 6 914 990 6 914 1012 6 914 1084 6 914 1098 6 914 1122 6 914 1138 6 914 1139 6 914 1141 6 914 1200 6 914 1223 6 914 1265 6 914 1336 6 914 1396 6 914 1455 6 914 1477 6 914 1487 6 914 1491 6 914 1496 6 914 483 6 914 584 6 914 669 6 914 680 6 914 763 6 914 .I 915 .T Documentation of IPL-V .B CACM March, 1963 .A Newell, A. .N CA630306 JB March 14, 1978 1:46 PM .X 915 5 915 915 5 915 915 5 915 1945 5 915 823 6 915 914 6 915 915 6 915 917 6 915 984 6 915 989 6 915 990 6 915 1012 6 915 1084 6 915 1098 6 915 1122 6 915 1138 6 915 1139 6 915 1141 6 915 1200 6 915 1223 6 915 1265 6 915 1336 6 915 1396 6 915 1455 6 915 1477 6 915 1487 6 915 1491 6 915 1496 6 915 483 6 915 584 6 915 669 6 915 680 6 915 763 6 915 .I 916 .T FORTRAN .B CACM March, 1963 .A Heising, W. P. .N CA630305 JB March 14, 1978 1:47 PM .X 916 5 916 916 5 916 916 5 916 .I 917 .T COMIT .B CACM March, 1963 .A Yngve, V. H. .N CA630304 JB March 14, 1978 1:48 PM .X 917 5 917 917 5 917 917 5 917 1068 5 917 1945 5 917 823 6 917 914 6 917 915 6 917 917 6 917 917 6 917 984 6 917 989 6 917 990 6 917 1012 6 917 1084 6 917 1098 6 917 1122 6 917 1138 6 917 1139 6 917 1141 6 917 1200 6 917 1223 6 917 1265 6 917 1336 6 917 1396 6 917 1455 6 917 1477 6 917 1487 6 917 1491 6 917 1496 6 917 483 6 917 584 6 917 669 6 917 680 6 917 763 6 917 .I 918 .T COBOL .B CACM March, 1963 .A Cunningham, J. F. .N CA630303 JB March 27, 1978 9:22 PM .X 918 5 918 918 5 918 918 5 918 .I 919 .T Documentation Problems: ALGOL 60 .B CACM March, 1963 .A Naur, P. .N CA630302 JB March 14, 1978 1:50 PM .X 249 4 919 254 4 919 272 4 919 1102 4 919 1109 4 919 1140 4 919 1188 4 919 1306 4 919 1464 4 919 1491 4 919 1767 4 919 1781 4 919 1787 4 919 1949 4 919 321 4 919 2059 4 919 2126 4 919 435 4 919 437 4 919 463 4 919 483 4 919 491 4 919 2732 4 919 560 4 919 583 4 919 3073 4 919 627 4 919 631 4 919 632 4 919 642 4 919 644 4 919 653 4 919 680 4 919 761 4 919 762 4 919 763 4 919 123 4 919 140 4 919 919 4 919 989 4 919 196 5 919 919 5 919 919 5 919 919 5 919 1781 5 919 123 6 919 196 6 919 919 6 919 990 6 919 1007 6 919 1046 6 919 1131 6 919 1139 6 919 1140 6 919 1149 6 919 1198 6 919 1215 6 919 1223 6 919 1265 6 919 1303 6 919 1323 6 919 1358 6 919 1366 6 919 1421 6 919 1460 6 919 1462 6 919 1463 6 919 1467 6 919 1468 6 919 1477 6 919 1491 6 919 1496 6 919 1531 6 919 1535 6 919 1565 6 919 1601 6 919 1602 6 919 1613 6 919 1614 6 919 1626 6 919 1641 6 919 1787 6 919 1788 6 919 205 6 919 224 6 919 249 6 919 288 6 919 316 6 919 381 6 919 398 6 919 11 6 919 404 6 919 410 6 919 463 6 919 464 6 919 483 6 919 3184 6 919 3188 6 919 584 6 919 600 6 919 680 6 919 691 6 919 763 6 919 799 6 919 .I 920 .T Toward Better Documentation of Programming Languages .B CACM March, 1963 .A Yngve, V. H. Sammet, J. E. .N CA630301 JB March 14, 1978 1:51 PM .X 920 5 920 920 5 920 920 5 920 728 5 920 920 6 920 45 6 920 .I 921 .T Incomplete Elliptic Integrals (Algorithm 73) .B CACM February, 1963 .A Meyer, N. A. .N CA630212 JB March 14, 1978 2:03 PM .X 921 5 921 921 5 921 921 5 921 .I 922 .T Multint (Algorithm 32) .B CACM February, 1963 .A Thacher Jr., H. C. .N CA630211JB March 14, 1978 2:10 PM .X 922 5 922 922 5 922 922 5 922 .I 923 .T Gomory (Algorithm 153) .B CACM February, 1963 .A Bauer, F. L. .N CA630210 JB March 14, 1978 2:12 PM .X 923 5 923 923 5 923 923 5 923 .I 924 .T Nexcom (Algorithm 152) .B CACM February, 1963 .A Hopley, J. .N CA630209 JB March 14, 1978 2:12 PM .X 924 5 924 924 5 924 924 5 924 .I 925 .T Location of a Vector in a Lexicographically Ordered ListAlgorithm 151) .B CACM February, 1963 .A Walter, H. F. .N CA630208 JB March 14, 1978 2:17 PM .X 925 5 925 925 5 925 925 5 925 .I 926 .T Syminv2 (Algorithm 150) .B CACM February, 1963 .A Rutishauser, H. .N CA630207 JB March 14, 1978 2:18 PM .X 926 5 926 926 5 926 926 5 926 .I 927 .T Linear Programming Applied to Ultraviolet Absorption Spectroscopy .B CACM February, 1963 .A White, W. C. Shapiro, B. Pratt, A. W. .N CA630206 JB March 14, 1978 2:19 PM .X 927 5 927 927 5 927 927 5 927 .I 928 .T Character Manipulation in FORTRAN .B CACM February, 1963 .A Lewis, T. S. .N CA630205 JB March 14, 1978 2:20 PM .X 928 5 928 928 5 928 928 5 928 .I 929 .T Glossary Construction .B CACM February, 1963 .A Grems, M. .N CA630204 JB March 14, 1978 2:21 PM .X 929 4 929 929 5 929 929 5 929 929 5 929 397 5 929 690 5 929 890 6 929 929 6 929 3195 6 929 .I 930 .T Decimal-to-Binary Conversion of Short Fields .B CACM February, 1963 .A Yarbrough, L. D. .N CA630203 JB March 14, 1978 2:22 PM .X 930 5 930 930 5 930 930 5 930 .I 931 .T Systematic Mistake Analysis of Digital Computer Programs .B CACM February, 1963 .A Miller, J. C. Maloney, C. J. .N CA630202 JB March 14, 1978 2:23 PM .X 1324 4 931 931 4 931 931 4 931 931 4 931 931 5 931 931 5 931 931 5 931 202 5 931 396 5 931 2616 5 931 634 5 931 795 5 931 931 6 931 931 6 931 1548 6 931 1684 6 931 2517 6 931 404 6 931 .I 932 .T Matrix Inversion by Gauss-Jordan Inversion II (Algorithm 120) .B CACM January, 1963 .A Naur, P. .N CA630116 JB March 14, 1978 2:27 PM .X 932 5 932 932 5 932 932 5 932 806 5 932 932 6 932 454 6 932 .I 933 .T Magic Squares (Algorithm 117 & 118) .B CACM January, 1963 .A Naur, P. .N CA630115 JB March 14, 1978 2:31 PM .X 933 5 933 933 5 933 933 5 933 .I 934 .T Gauss's Method (Algorithm 107) .B CACM January, 1963 .A Naur, P. .N CA630114 JB March 14, 1978 2:32 PM .X 934 5 934 934 5 934 934 5 934 .I 935 .T Calculating Primes by Means of GPS (Algorithm) .B CACM January, 1963 .A Naur, P. .N CA630113 JB March 14, 1978 2:33 PM .X 935 5 935 935 5 935 935 5 935 .I 936 .T A Set of Test Matrices (Algorithm 52) .B CACM January, 1963 .A Naur, P. .N CA630112 JB March 14, 1978 2:35 PM .X 936 5 936 936 5 936 936 5 936 .I 937 .T Inverse of a Finite Segment of the Hilbert Matrix (Algorithm 50) .B CACM January, 1963 .A Naur, P. .N CA630111 JB March 14, 1978 2:36 PM .X 937 5 937 937 5 937 937 5 937 .I 938 .T Invert (Algorithm 42) .B CACM January, 1963 .A Naur, P. .N CA630110 JB March 14,1978 2:36 PM .X 938 5 938 938 5 938 938 5 938 .I 939 .T Gamma Function (Algorithm 31) .B CACM January, 1963 .A Behrenz, P. G. .N CA630109 JB March 14, 1978 2:37 PM .X 939 5 939 939 5 939 939 5 939 .I 940 .T Generating Discrete Random Variables in a Computer .W This note is concerned with details of how to instruct a computer to choose one from many things with assigned probabilities. The method uses a uniform variable to direct the computer to a memory location; if this is done by a sequence of appropriately chosen conditional probabilities, efficient use of memory space and quite fast programs will result. .B CACM January, 1963 .A Marsaglia, G. .N CA630108 JB March 14, 1978 2:40 PM .X 940 5 940 940 5 940 940 5 940 1073 5 940 1153 5 940 940 6 940 940 6 940 1153 6 940 .I 941 .T A Recursive Program for the General n-Dimensional Integral .W A general program is outlined for n-dimensional integration with variable limits. The program is of a recursive nature and uses Simpson's rule combined with repeated bisection to attain the required accuracy. It was developed in the Ferranti Mercury Autocode Scheme. .B CACM January, 1963 .A Cadwell, J. H. .N CA630107 JB March 14, 1978 2:43 PM .X 941 5 941 941 5 941 941 5 941 .I 942 .T FORTRAN Subroutines for Time Series Analysis .W The authors have recently been concerned in a time-series study that constituted a fairly typical piece of applied statistical research, involving extensive computations on a moderately large quantity of data. Wehave found that the many different numerical processes that were required could be built up almost completely from a small number of basic operations, and a set of FORTRAN subroutines has been written to perform these. The main purpose of this note is to describe these subroutines, but since the question of general statistical programs is topical [1], we include some general remarks. .B CACM January, 1963 .A Healy, M. J. R. Bogert, B. P. .N CA630106 JB March 14, 1978 2:55 PM .X 942 5 942 942 5 942 942 5 942 948 5 942 1118 5 942 826 5 942 826 6 942 942 6 942 942 6 942 942 6 942 .I 943 .T Terms Frequently Combined in Problem Description .B CACM January, 1963 .A Grems, M. .N CA630105 JB March 14, 1978 2:56 PM .X 943 5 943 943 5 943 943 5 943 .I 944 .T Storage and Search Properties of a Tree-Organized Memory System .W A memory with list properties [1] may be used to construct numeric, alphabetic or alphanumeric trees. Such trees have information storage and retrieval properties applicable to problems involving large quantities of data or to problems where the quantity, word length and distribution of stored information is not known a priori, or changes rapidly during the processing. The purpose of this paper is to examine the storage and search properties of a tree-organized storage system assuming that a memory possessing certain list properties is available. Of prime interest is the application where a symbol table, dictionary or similar file is to be stored and searched. .B CACM January, 1963 .A Scidmore, A. K. Weinberg, B. L. .N CA630104 JB March 14, 1978 3:02 PM .X 2846 4 944 849 4 944 944 4 944 155 5 944 944 5 944 944 5 944 944 5 944 1234 5 944 2451 5 944 849 6 944 944 6 944 944 6 944 1935 6 944 1936 6 944 321 6 944 385 6 944 400 6 944 402 6 944 404 6 944 3184 6 944 729 6 944 .I 945 .T Arithmetizing Declarations: An Application to COBOL .B CACM January, 1963 .A Conway, M. E. Speroni, J. .N CA630103 JB March 14, 1978 3:03 PM .X 1046 4 945 1105 4 945 1139 4 945 1140 4 945 1234 4 945 1263 4 945 1265 4 945 1496 4 945 1781 4 945 1824 4 945 2126 4 945 2546 4 945 464 4 945 584 4 945 631 4 945 653 4 945 680 4 945 763 4 945 795 4 945 799 4 945 945 4 945 945 5 945 945 5 945 945 5 945 404 5 945 799 5 945 945 6 945 399 6 945 82 6 945 404 6 945 .I 946 .T Suggestions on ALGOL 60 (ROME) Issues - A Report by the American Standards Association Subcommittee X3.4.2 .B CACM January, 1963 .A Utman, R. E. .N CA630102 JB March 14, 1978 3:05 PM .X 946 5 946 946 5 946 946 5 946 1949 5 946 196 6 946 946 6 946 .I 947 .T Supplement to the ALGOL 60 Report .B CACM January, 1963 .A Woodger, M. .N CA630101 JB March 14, 1978 3:05 PM .X 947 5 947 947 5 947 947 5 947 761 5 947 196 6 947 947 6 947 3184 6 947 .I 948 .T Note on the Use of Procedures .B CACM December, 1964 .A Healy, M. J. R. .N CA641223 JB March 9, 1978 2:32 PM .X 1118 4 948 826 4 948 948 4 948 942 5 948 948 5 948 948 5 948 948 5 948 .I 949 .T Integer and Signed Constants in ALGOL .W A few remarks are given on the relations between syntax and semantics in the programming languages. The aim is to point out that, if it is true that the grammar of a context-free language should be conceived not only as a strings-generating device but also as a method for expressing a meaning, then the grammar of ALGOL is open to some criticism. .B CACM December, 1964 .A Petrone, L. Vandoni, C. E. .N CA641222 JB March 9, 1978 2:35 PM .X 1086 4 949 1102 4 949 1132 4 949 1142 4 949 1234 4 949 1263 4 949 1265 4 949 1270 4 949 1323 4 949 1358 4 949 1379 4 949 1380 4 949 1453 4 949 1464 4 949 1484 4 949 1491 4 949 1498 4 949 1613 4 949 1614 4 949 1781 4 949 1781 4 949 1781 4 949 1825 4 949 1860 4 949 1945 4 949 1945 4 949 2083 4 949 2178 4 949 2179 4 949 2252 4 949 2325 4 949 2341 4 949 2546 4 949 2645 4 949 2652 4 949 2684 4 949 2842 4 949 2929 4 949 2934 4 949 3069 4 949 669 4 949 679 4 949 691 4 949 761 4 949 762 4 949 949 4 949 949 4 949 949 4 949 989 4 949 949 5 949 949 5 949 949 5 949 483 5 949 584 5 949 3184 5 949 .I 950 .T Parallel Methods for Integrating Ordinary Differential Equations .W This paper is dedicated to the proposition that, in order to take full advantage for real-time computations of highly parallel computers as can be expected to be available in the near future, much of numerical analysis will have to be recast in a more "parallel" form. By this is meant that serial algorithms ought to be replaced by algorithm which consist of several subtasks which can be computed without knowledge of the results of the other subtasks. As an example, a method is proposed for "parallelizing" the numerical integration of an ordinary differential equation, which process, by all standard methods, is entirely serial. .B CACM December, 1964 .A Nievergelt, J. .N CA641221 JB March 9, 1978 3:09 PM .X 950 5 950 950 5 950 950 5 950 .I 951 .T Rational Chebyshev Approximations to the Bessel Function Integrals Kis(x) .W The second Remes algorithm is used to approximate the integrals Kis by rational functions. The related coefficients for the approximations of Ki1, Ki2, Ki3 are given for different precisions. .B CACM December, 1964 .A Gargantini, I. Pomentale, T. .N CA641220 JB March 9, 1978 3:12 PM .X 1015 4 951 1346 4 951 1440 4 951 1645 4 951 951 4 951 951 5 951 951 5 951 951 5 951 1346 5 951 532 5 951 951 6 951 532 6 951 .I 952 .T Another use of FORTRAN II Chaining .B CACM December, 1964 .A Drath, D. G. .N CA641219 JB March 9, 1978 3:13 PM .X 952 5 952 952 5 952 952 5 952 .I 953 .T Scanning Text with a 1401 .B CACM December, 1964 .A Baker, J. J. .N CA641218 JB March 9, 1978 3:13 PM .X 953 5 953 953 5 953 953 5 953 2870 5 953 953 6 953 2377 6 953 2632 6 953 .I 954 .T A Note on the Calculation of Probabilities in an F-Distribution .B CACM December, 1964 .A Smillie, K. W. Anstey, T. H. .N CA641217 JB March 9, 1978 3:14 PM .X 954 5 954 954 5 954 954 5 954 .I 955 .T A Class of Matrices to Test Inversion Procedures .B CACM December, 1964 .A Cline, R. E. .N CA641216 JB March 9, 1978 3:16 PM .X 955 5 955 955 5 955 955 5 955 .I 956 .T A Family of Test Matrices .B CACM December, 1964 .A Newbery, A. C. R. .N CA641215 JB March 9, 1978 3:17 PM .X 956 5 956 956 5 956 956 5 956 .I 957 .T Method for Partial Rewriting of Magnetic Tape .B CACM December, 1964 .A Miller, J. A. .N CA641214 JB March 9, 1978 3:18 PM .X 957 5 957 957 5 957 957 5 957 .I 958 .T A Case of too Much Precision .B CACM December, 1964 .A Synge, M. J. .N CA641213 JB March 9, 1978 3:23 PM .X 958 5 958 958 5 958 958 5 958 .I 959 .T Mark Sense and Port-A-Punch Programming Inputs .B CACM December, 1964 .A Lubbert, W. F. .N CA641212 JB March 9, 1978 3:24 PM .X 959 5 959 959 5 959 959 5 959 .I 960 .T Curve Fitting with Format Fortran .B CACM December, 1964 .A Garber, M. J. .N CA641211 JB March 9, 1978 3:25 PM .X 960 5 960 960 5 960 960 5 960 .I 961 .T Limited Bit Manipulation Using FORTRAN II .W Techniques are developed for manipulating bits using only FORTRAN II. These techniques allow individual bits to be tested, certain fields to be shifted, and numbers coded in BCD to be converted to Binary. .B CACM December, 1964 .A Oster, C. A. .N CA641210 JB March 9, 1978 3:27 PM .X 961 5 961 961 5 961 961 5 961 .I 962 .T Double-Precision Squares Root for The CDC-3600 .W In January of 1960, the late Hans J. Maehly completed a summary of approximations to the elementary functions for the CDC-1604 computer. The approximations and techniques suggested by Maehly are equally applicable to the second large computer in the CDC line, the 3600. Unlike the 1604, however, the 3600 has built-in double-precision floating-point arithmetic. The present work, largely inspired by the successes of Maehly and his associates, concerns the extension of one of Maehly's ideas to a double-precision subroutine for the 3600. .B CACM December, 1964 .A Cody, W. J. .N CA641209 JB March 9, 1978 3:31 PM .X 962 5 962 962 5 962 962 5 962 1440 5 962 1932 5 962 2159 5 962 962 6 962 962 6 962 962 6 962 1566 6 962 1932 6 962 532 6 962 .I 963 .T Relative Effects of Central Processor and Input-Output Speeds Upon Throughput on the Large Computer .W Presented in this paper is a technique for determining the relative effects of the internal speed of the computer and the speed of the input-output units upon the overall speed of the system. Equations are derived which permit the determination of these effects from hardware usage measurements. .B CACM December, 1964 .A White, P. .N CA641208 JB March 9, 1978 3:34 PM .X 963 5 963 963 5 963 963 5 963 1653 5 963 963 6 963 1069 6 963 1417 6 963 .I 964 .T Mechanization of Tedious Algebra-the e Coefficients of Theoretical Chemistry .W A table of formulas for certain integrals involving Legendre functions has been constructed mechanically by a program which performed algebraic operations. The formulas are all rational algebraic expressions in a single variable and were constructed by a recurrence procedure. They are of interest in molecular quantum chemistry. Trivial coding techniques were used to write the relevant programs in FORTRAN. The results were photo composed on a Photon S-560 system, that was controlled by tapes which were punched directly from the computer output, so avoiding manual keyboarding, transcription errors and keyboarded correction. .B CACM December, 1964 .A Wactlar, H. D. Barnett, M. P. .N CA641207 JB March 9, 1978 3:38 PM .X 1028 4 964 1121 4 964 1216 4 964 1392 4 964 1396 4 964 1396 4 964 659 4 964 964 4 964 964 4 964 964 4 964 964 5 964 964 5 964 964 5 964 1334 5 964 1396 5 964 284 5 964 1444 5 964 561 5 964 759 5 964 964 6 964 964 6 964 964 6 964 1028 6 964 1029 6 964 1083 6 964 1132 6 964 1214 6 964 1278 6 964 1334 6 964 1365 6 964 1386 6 964 1387 6 964 1388 6 964 1392 6 964 1393 6 964 1394 6 964 1395 6 964 1396 6 964 1397 6 964 1496 6 964 284 6 964 407 6 964 3199 6 964 3200 6 964 3201 6 964 3202 6 964 3203 6 964 3204 6 964 561 6 964 730 6 964 .I 965 .T Greatest Common Divisor (Algorithm 237 [A1]) .B CACM December, 1964 .A Bray, T. A. .N CA641206 JB March 9, 1978 3:40 PM .X 965 5 965 965 5 965 965 5 965 .I 966 .T Evaluation of Determinant (Algorithm 224 [F3]) .B CACM December, 1964 .A Hasselblad, V. Rulifson, J. .N CA641205 JB March 9, 1978 3:41 PM .X 966 5 966 966 5 966 966 5 966 .I 967 .T Complementary Error Function (Algorithm 181 [S15]) .B CACM December, 1964 .A Clausen, I. Hansson,L. .N CA641204 JB March 9, 1978 3:42 PM .X 967 5 967 967 5 967 967 5 967 1583 5 967 831 6 967 967 6 967 1126 6 967 707 6 967 .I 968 .T Radical-Inverse Quasi-Random Point Sequence (Algorithm 247 [G5]) .B CACM December, 1964 .A Halton, J. H. Smith, G. B. .N CA641203 JB March 9, 19783:43 PM .X 968 5 968 968 5 968 968 5 968 .I 969 .T Graycode (Algorithm 246 [Z]) .B CACM December, 1964 .A Boothroyd, J. .N CA641202 JB March 9, 1978 3:44 PM .X 969 5 969 969 5 969 969 5 969 2834 5 969 969 6 969 2045 6 969 2417 6 969 2466 6 969 .I 970 .T Treesort 3 (Algorithm [M1]) .B CACM December, 1964 .A Floyd, R. W. .N CA641201 JB March 9, 1978 3:45 PM .X 970 5 970 970 5 970 970 5 970 2042 5 970 2222 5 970 2356 5 970 2679 5 970 2844 5 970 2972 5 970 970 6 970 970 6 970 970 6 970 970 6 970 970 6 970 970 6 970 1059 6 970 1175 6 970 1190 6 970 1228 6 970 1228 6 970 1491 6 970 1800 6 970 1818 6 970 1834 6 970 1969 6 970 1997 6 970 308 6 970 2042 6 970 2042 6 970 2204 6 970 2227 6 970 2597 6 970 2732 6 970 2738 6 970 2742 6 970 2767 6 970 3187 6 970 507 6 970 716 6 970 783 6 970 .I 971 .T Time Sharing in a Traffic Control Program .W The Toronto traffic signal control system consists of a variety of logically distinct computer programs, all competing for machine time. To satisfy these demands, a time-sharing program has been written whose purpose is to execute, in the order of a predefined priority, the various subprograms within the real-time system. In this paper the more interesting aspects of the time-sharing program are outlined. .B CACM November, 1964 .A Green, L. E. S. .N CA641112 JB March 9, 1978 3:49 PM .X 971 5 971 971 5 971 971 5 971 .I 972 .T An Executive System Implemented as a Finite-State Automaton .W The 473L command and control system used by the Air Force permits many operators to access large data files through the use of a computer. The man-machine interface is satisfied by several communication consoles from which operators may enter queries and view replies. A data link permits remote stations to send messages, status reports and inventories directly to the computer. The information received over the on-line data link is used to update the data files which are stored on disk. The 473L programming system is divided into an Executive Control Program and five components with different processing priorities. These priorities permit the system to be most sensitive to the console inputs and permit the operators at all the consoles to time share the central processor. The Executive Control Program provides for the orderly transitions of control among the programming system components. The major emphasis of the paper is on the technique of using the definition of a finite-state automaton for organizing the Executive Control Program. .B CACM November, 1964 .A Heistand, R. E. .N CA641111 JB March 9, 1978 3:56 PM .X 1471 4 972 1774 4 972 2911 4 972 560 4 972 972 4 972 972 4 972 972 4 972 972 5 972 972 5 972 972 5 972 271 5 972 273 5 972 276 5 972 .I 973 .T Estimation of Heart Parameters Using Skin Potential Measurements .W A fundamental problem of vector cardiography is the estimation of the state of the heart on the basis of skin potential measurements. A mathematical model relating ventricular dipoles to surface potentials is sketched. Then it is shown that the inverse problem-that of determining electrical heart parameters on the basis of skin potential measurements-may be viewed as a nonlinear multipoint boundary value problem. A feasible solution, employing quasilinearization and high-speed digital computers, is given. .B CACM November, 1964 .A Bellman, R. Collier, C. Kagiwada, H. Kalaba, R. Selvester, R. .N CA641110 JB March 9, 1978 4:00 PM .X 973 5 973 973 5 973 973 5 973 1278 5 973 973 6 973 1028 6 973 1029 6 973 .I 974 .T A Technique for Reading Gapless Tapes Makes Electrocardiograph Analysis Feasible on the IBM 7090 .W To study arrhythmias and higher frequency components of the electrocardiogram, long series of patient heart cycles must be examined before valid comparison of different heart beats can be made. A technique is presented for the automatic analysis of long series heart cycles via a digital computer. .B CACM November, 1964 .A Maher, A. S. .N CA641109 JB March 9, 1978 4:03 PM .X 974 5 974 974 5 974 974 5 974 .I 975 .T The New Program of Work for the International Standard Vocabulary in Computers and Information Processing .B CACM November, 1964 .A Traub, J. F. .N CA641108 JB March 9, 1978 4:05 PM .X 975 5 975 975 5 975 975 5 975 1251 5 975 975 6 975 .I 976 .T Fresnel Integrals (Algorithm 213 [S20]) .B CACM November, 1964 .A Gray, M. .N CA641107 JB March 9, 1978 4:06 PM .X 976 5 976 976 5 976 976 5 976 .I 977 .T Conversions Between Calendar Date and Julian Day Number (Algorithm 199 [Z]) .B CACM November, 1964 .A Oppenheim, D. K. .N CA641106 JB March 9, 1978 4:08 PM .X 977 5 977 977 5 977 977 5 977 .I 978 .T Fresnel Integrals (Algorithm 244 [S20]) .B CACM November, 1964 .A Lotsch, H. .N CA641105 JB March 9,1978 4:09 PM .X 978 5 978 978 5 978 978 5 978 .I 979 .T Logarithm of a Complex Number (Algorithm 243 [B3]) .B CACM November, 1964 .A Collens, D. S. .N CA641104 JB March 9, 1978 4:10 PM .X 979 5 979 979 5 979 979 5 979 .I 980 .T Multiple-Precision Arithmetic and the Exact Calculation of the 3-j, 6-j and 9-j Symbols .W Described in this paper is a system of general-purpose multiple-precision fixed-point routines and their use in subroutines which calculate exactly the quantum-mechanical 3-j, 6-j and 9-j symbols of large arguments. .B CACM November, 1964 .A Maer, R. M. Redlich, M. G. .N CA641103 JB March 9, 1978 4:13 PM .X 980 5 980 980 5 980 980 5 980 .I 981 .T Rounding Problems in Commercial Data Processing .W A common requirement in commercial data processing is that the sum of a set of numbers, rounded in a generally understood manner, be equal to the sum of the numbers rounded individually. Four rounding procedures are described to accomplish this. The particular procedure that is appropriate depends upon whether the numbers being accumulated can vary in sign, whether their sum can vary in sign, and whether the last number being summed can be recognized as such prior to its rounding. .B CACM November, 1964 .A Kelley, T. B. .N CA641102 JB March 9, 1978 4:25 PM .X 981 5 981 981 5 981 981 5 981 .I 982 .T An Inductive Approach to Language Translation .W The possibility of natural language translation by means of fixed operations on example translations is considered. The conception of sentence translation which motivates the work is informally presented, and the measurement of physical similarity in pairs of strings is discussed, a notion which plays a central role in the proposed type of translator. Experimental evidence is presented in support of the premise upon which this conception is based. .B CACM November, 1964 .A Faulk, R. D. .N CA641101 JB March 9, 1978 4:28 PM .X 982 5 982 982 5 982 982 5 982 1592 5 982 982 6 982 1112 6 982 619 6 982 .I 983 .T Take-up reels for One-Inch Perforated Tape for Information Interchange (Proposed American Standard) .B CACM October, 1964 .N CA641019 JB March 9, 1978 4:30 PM .X 983 5 983 983 5 983 983 5 983 .I 984 .T Report on Input-Output Procedures for ALGOL 60 (IFIP) .B CACM October, 1964 .N CA641018 JB March 9, 1978 4:32 PM .X 984 5 984 984 5 984 984 5 984 1705 5 984 1945 5 984 2034 5 984 823 6 984 914 6 984 915 6 984 917 6 984 984 6 984 984 6 984 984 6 984 986 6 984 989 6 984 990 6 984 1012 6 984 1020 6 984 1084 6 984 1098 6 984 1122 6 984 1138 6 984 1139 6 984 1141 6 984 1200 6 984 1223 6 984 1231 6 984 1265 6 984 1321 6 984 1336 6 984 1396 6 984 1455 6 984 1477 6 984 1487 6 984 1491 6 984 1496 6 984 1565 6 984 1852 6 984 1926 6 984 1947 6 984 483 6 984 584 6 984 669 6 984 680 6 984 763 6 984 .I 985 .T Report on SUBSET ALGOL 60 (IFIP) .B CACM October, 1964 .N CA641017 JB March 9, 1978 4:33 PM .X 985 5 985 985 5 985 985 5 985 .I 986 .T Proposed Amendment to Proposed American Standard on Specification for General-Purpose Paper Cards for Information Processing .B CACM October, 1964 .N CA641016 JB March 9, 1978 4:35 PM .X 986 5 986 986 5 986 986 5 986 1705 5 986 984 6 986 986 6 986 1020 6 986 1321 6 986 .I 987 .T FORTRAN vs. Basic FORTRAN (A Programming Language for Information Processing on Automatic Data Processing Systems) .B CACM October, 1964 .N CA641015 JB March 9, 1978 4:36 PM .X 987 5 987 987 5 987 987 5 987 1613 5 987 1646 5 987 1900 5 987 1955 5 987 2025 5 987 2154 5 987 2365 5 987 2506 5 987 3060 5 987 830 6 987 987 6 987 987 6 987 987 6 987 987 6 987 987 6 987 987 6 987 987 6 987 987 6 987 987 6 987 988 6 987 988 6 987 1072 6 987 1086 6 987 1134 6 987 1179 6 987 1453 6 987 1647 6 987 1754 6 987 1900 6 987 1900 6 987 1924 6 987 2154 6 987 2362 6 987 3184 6 987 680 6 987 .I 988 .T History and Summary of FORTRAN Standardization Development for the ASA .B CACM October, 1964 .A Heising, W. P. .N CA641014 JB March 9, 1978 4:37 PM .X 988 5 988 988 5 988 988 5 988 1845 5 988 1900 5 988 2083 5 988 2154 5 988 2270 5 988 2693 5 988 987 6 988 987 6 988 988 6 988 988 6 988 988 6 988 988 6 988 988 6 988 988 6 988 1900 6 988 2270 6 988 2696 6 988 3184 6 988 .I 989 .T A Method of Syntax Specification .B CACM October, 1964 .A Iverson, K. E. .N CA641013 JB March 9, 1978 4:39 PM .X 249 4 989 254 4 989 272 4 989 1086 4 989 1102 4 989 1109 4 989 1132 4 989 1140 4 989 1188 4 989 1234 4 989 1263 4 989 1265 4 989 1270 4 989 1306 4 989 1323 4 989 1358 4 989 1379 4 989 1380 4 989 1453 4 989 1464 4 989 1464 4 989 1484 4 989 1491 4 989 1491 4 989 1498 4 989 1613 4 989 1614 4 989 1767 4 989 1781 4 989 1781 4 989 1781 4 989 1787 4 989 1825 4 989 1860 4 989 1949 4 989 321 4 989 2059 4 989 2083 4 989 2126 4 989 2178 4 989 2179 4 989 2252 4 989 2325 4 989 2341 4 989 2546 4 989 435 4 989 437 4 989 463 4 989 483 4 989 491 4 989 2645 4 989 2652 4 989 2684 4 989 2732 4 989 2842 4 989 2929 4 989 2934 4 989 560 4 989 583 4 989 3069 4 989 3073 4 989 627 4 989 631 4 989 632 4 989 642 4 989 644 4 989 653 4 989 669 4 989 679 4 989 680 4 989 691 4 989 729 4 989 761 4 989 761 4 989 762 4 989 763 4 989 123 4 989 140 4 989 919 4 989 949 4 989 989 4 989 989 4 989 989 4 989 196 5 989 989 5 989 989 5 989 989 5 989 1263 5 989 288 5 989 1453 5 989 1945 5 989 3184 5 989 823 6 989 914 6 989 915 6 989 917 6 989 984 6 989 989 6 989 989 6 989 989 6 989 990 6 989 1012 6 989 1084 6 989 1098 6 989 1122 6 989 1138 6 989 1139 6 989 1141 6 989 1200 6 989 1223 6 989 1265 6 989 1336 6 989 1396 6 989 1455 6 989 1477 6 989 1487 6 989 1491 6 989 1496 6 989 404 6 989 483 6 989 3184 6 989 3184 6 989 584 6 989 669 6 989 680 6 989 763 6 989 .I 990 .T Constraint-Type Statements in Programming Languages .W A proposal is made for including in a programming language statements which imply relations between variables but which are not explicit assignment statements. The compiler sets up a Newtonian iteration making use for the purpose of a routine for formal differentiation. .B CACM October, 1964 .A Wilkes, M. V. .N CA641012 JB March 9, 1978 4:42 PM .X 990 5 990 990 5 990 990 5 990 1781 5 990 1945 5 990 2341 5 990 823 6 990 123 6 990 196 6 990 914 6 990 915 6 990 917 6 990 919 6 990 984 6 990 989 6 990 990 6 990 990 6 990 990 6 990 1007 6 990 1012 6 990 1046 6 990 1084 6 990 1098 6 990 1122 6 990 1131 6 990 1138 6 990 1139 6 990 1139 6 990 1140 6 990 1141 6 990 1149 6 990 1198 6 990 1200 6 990 1215 6 990 1223 6 990 1223 6 990 1265 6 990 1265 6 990 1303 6 990 1323 6 990 1336 6 990 1358 6 990 1366 6 990 1396 6 990 1421 6 990 1455 6 990 1460 6 990 1462 6 990 1463 6 990 1467 6 990 1468 6 990 1468 6 990 1466 6 990 1477 6 990 1477 6 990 1487 6 990 1491 6 990 1491 6 990 1496 6 990 1496 6 990 1531 6 990 1535 6 990 1565 6 990 1601 6 990 1602 6 990 1613 6 990 1614 6 990 1626 6 990 1641 6 990 1787 6 990 1788 6 990 205 6 990 224 6 990 249 6 990 288 6 990 316 6 990 381 6 990 398 6 990 11 6 990 404 6 990 410 6 990 463 6 990 464 6 990 483 6 990 483 6 990 3184 6 990 3184 6 990 3188 6 990 584 6 990 584 6 990 600 6 990 669 6 990 680 6 990 680 6 990 691 6 990 763 6 990 763 6 990 799 6 990 .I 991 .T Gamma Function with Controller Accuracy (Algorithm 225 [S14]) .B CACM October, 1964 .A Bray, T. A. .N CA641011 JB March 9, 1978 4:44 PM .X 991 5 991 991 5 991 991 5 991 .I 992 .T Gamma Function (Algorithm 221 [S14]) .B CACM October, 1964 .A McCombs, V. K. .N CA641010 JB March 9, 1978 4:45 PM .X 992 5 992 992 5 992 992 5 992 .I 993 .T Kutta Merson (Algorithm 218 [D2]) .B CACM October, 1964 .A Priebe, K. B. .N CA641009 JB March 9, 1978 4:46 PM .X 993 5 993 993 5 993 993 5 993 .I 994 .T Stringsort (Algorithm 207 [M1]) .B CACM October, 1964 .A Blair, C. R. .N CA641008 JB March 9, 1978 4:47 PM .X 994 5 994 994 5 994 994 5 994 .I 995 .T Steep1 (Algorithm 203 [E4]) .B CACM October, 1964 .A Wallack, P. .N CA641007 JB March 9, 1978 4:48 PM .X 995 5 995 995 5 995 995 5 995 .I 996 .T Permutations of a Set with Repetitions (Algorithm 242 [G6]) .B CACM October, 1964 .A Sag, T. W. .N CA641006 JB March 9, 1978 4:49 PM .X 996 5 996 996 5 996 996 5 996 2044 5 996 996 6 996 1558 6 996 2230 6 996 521 6 996 .I 997 .T Patent Protection of Computer Programs .B CACM October, 1964 .A Jacobs, M. C. .N CA641005 JB March 9, 1978 4:50 PM .X 997 5 997 997 5 997 997 5 997 1711 5 997 997 6 997 1001 6 997 .I 998 .T Computer Programs are Patentable .B CACM October, 1964 .A Hamlin, K. B. .N CA641004 JB March 9, 1978 4:53 PM .X 998 5 998 998 5 998 998 5 998 .I 999 .T Joint Inventorship of Computers .B CACM October, 1964 .A Hauptman, G. A. .N CA641003 JB March 9, 19784:54 PM .X 999 5 999 999 5 999 999 5 999 .I 1000 .T Computer Patent Disclosures .B CACM October, 1964 .A Kates, J. P. .N CA641002 JB March 9, 1978 4:55 PM .X 1000 5 1000 1000 5 1000 1000 5 1000 .I 1001 .T Copyright Aspects of Computer Usage .W This paper is concerned with the question of what constitutes infringement of a copyright on a book or other nondramatic literary work when the work is fed into a computer and is indexed, analyzed, partially reprinted, or otherwise utilized by the computer to produce eye-readable output. The question of copyrightability of programs and infringement of copyrights on programs is also discussed. The paper is directed primarily to a discussion of the present law. Some aspects of the proposed new copyright law are also included. General recommendations are made with respect to the proposed revision of the copyright law. .B CACM October, 1964 .A Lawlor, R. C. .N CA641001 JB March 9, 1978 4:59 PM .X 1001 5 1001 1001 5 1001 1001 5 1001 1711 5 1001 997 6 1001 1001 6 1001 .I 1002 .T A Rapid Method for Digital Filtering .W Since much of the computer time spent in time-series analysis is used for multiplications, a minimum multiplication method was devised for digital filtering, with the expectation that it would be useful in the on line, real-time analysis of biological data. The filters are constructed from a succession of readily analyzable components in a manner that facilitates cascading. The repertoire of frequency response curves includes relatively good low-pass and band-pass designs. Programs are available for implementing both the synthesis of these filters, and their application on computers whose assemblers allow the definition of recursive macros. .B CACM September, 1964 .A Whittlesey, J. R. B. .N CA640909 JB March 9, 1978 5:03 PM .X 1002 5 1002 1002 5 1002 1002 5 1002 .I 1003 .T A Computer Analysis Method For Thermal Diffusion in Biochemical Systems .W In the thermal detection of rapid biochemical reactions it is necessary to correct the temperature data for transient heat conduction losses in a cylindrical calorimeter. To handle the complexities arising from varying thermal-relaxation times of concentric insulating layers, a computer program was developed which gives the temperature distribution of the system as a function of radius and time. This distribution is corrected at each step by a subroutine which calculates the instantaneous chemical state of there action, as well as the heat produced by this reaction. The program is based on a direct statement of Fourier's law of heat conduction and the chemical rate equation to provide a "bookkeeping law" to follow the reactants and the flow of heat packets, in such a way that the computer continually stores the heat distribution. A computer analysis method is here regarded as one in which the physical laws of a process are used explicitly in the program. Usually this results in by passing much of the mathematical procedures conventionally used. The program was tested against some known exact solutions of the heat equation and gave identical results, and compared well with experimental data of a known biochemical reaction. The construction of computer programs based on the direct statement of the physical laws is a principle of general applicability which has been applied to several other physical phenomena. .B CACM September, 1964 .A Davids, N. Berger, R. L. .N CA640908 JB March 9, 1978 5:13 PM .X 1003 5 1003 1003 5 1003 1003 5 1003 .I 1004 .T Arctangent (Algorithm [B1]) .B CACM September, 1964 .A Mills, K. W. .N CA640907 JB March 9, 1978 6:08 PM .X 1004 5 1004 1004 5 1004 1004 5 1004 .I 1005 .T Coordinates on an Ellipsoid (Algorithm 240 [Z]) .B CACM September, 1964 .A Dorrer, E. .N CA640906 JB March 9, 1978 6:09 PM .X 1005 5 1005 1005 5 1005 1005 5 1005 .I 1006 .T A Storage Allocation and Reference Structure .W A method is proposed and discussed which allows a subscripted-variable capability (in the FORTRAN sense) to be added to AUTOCODER-Type assembly systems. .B CACM September, 1964 .A Fitzwater, D. R. .N CA640905 JB March 9, 1978 6:11 PM .X 1006 5 1006 1006 5 1006 1006 5 1006 1788 5 1006 1006 6 1006 1007 6 1006 205 6 1006 3189 6 1006 .I 1007 .T Extension of Existing Compilers By Sophisticated Use of Macros .W A description is presented of an application in which macros and string concatenation were employed to add a new facility to BELFAP. .B CACM September, 1964 .A Benett, R. K. Neumann, H. D. .N CA640904 JB March 9, 1978 6:13 PM .X 1007 5 1007 1007 5 1007 1007 5 1007 1781 5 1007 1788 5 1007 123 6 1007 196 6 1007 919 6 1007 990 6 1007 1006 6 1007 1007 6 1007 1007 6 1007 1046 6 1007 1131 6 1007 1139 6 1007 1140 6 1007 1149 6 1007 1198 6 1007 1215 6 1007 1223 6 1007 1265 6 1007 1303 6 1007 1323 6 1007 1358 6 1007 1366 6 1007 1421 6 1007 1460 6 1007 1462 6 1007 1463 6 1007 1467 6 1007 1468 6 1007 1477 6 1007 1491 6 1007 1496 6 1007 1531 6 1007 1535 6 1007 1565 6 1007 1601 6 1007 1602 6 1007 1613 6 1007 1614 6 1007 1626 6 1007 1641 6 1007 1787 6 1007 1788 6 1007 205 6 1007 205 6 1007 224 6 1007 249 6 1007 288 6 1007 316 6 1007 381 6 1007 398 6 1007 11 6 1007 404 6 1007 410 6 1007 463 6 1007 464 6 1007 483 6 1007 3184 6 1007 3188 6 1007 3189 6 1007 584 6 1007 600 6 1007 680 6 1007 691 6 1007 763 6 1007 799 6 1007 .I 1008 .T Scheduling Meetings with a Computer .W Computer scheduling of papers as it was developed for the 1960 meeting of the Federation of American Societies for Experimental Biology (FASEB) is described. The FASEB meeting is the largest scientific meeting held in the United States each year. The technique developed for FASEB can be applied to schedule any meeting with parallel sessions. .B CACM September, 1964 .A Schultz, C. K. Brooks, A. Schwartz, P. .N CA640903 JB March 9, 1978 6:16 PM .X 1008 5 1008 1008 5 1008 1008 5 1008 2052 5 1008 1008 6 1008 1013 6 1008 1504 6 1008 1540 6 1008 .I 1009 .T Solution of Combinatorial Problems Using Generating Functions on a Variable-Field Computer .W The utility of generating functions in solving combinatorial problems is discussed. Particular implementation results are presented and evaluated. .B CACM September, 1964 .A Weinberg, G. M. .N CA640902 JB March 9, 1978 6:17 PM .X 1009 5 1009 1009 5 1009 1009 5 1009 .I 1010 .T A Multiuser Computation Facility for Education and Research .W Present-day computing facilities are limited in their value for scientific research by inability to interact strongly with users. The full power of a research computing instrument should be available at many terminals that give each user the ability to generate, correct and operate any procedure he wishes, either simple or complex. Implementation is described for a small-scale multiuser computer system that permits several users to work independently with the machine, and to obtain satisfactory response using typewriter communication. .B CACM September, 1964 .A Dennis, J. B. .N CA640901 JB March 9, 1978 6:22 PM .X 1010 5 1010 1010 5 1010 1010 5 1010 .I 1011 .T Logarithm of a Complex Number (Algorithm 48 [B3]) .B CACM August, 1964 .A Collens, D. S. .N CA640819 JB March 23, 1978 7:54 PM .X 1011 5 1011 1011 5 1011 1011 5 1011 .I 1012 .T Formal Parsing Systems .W Automatic syntactic analysis has recently become important for both natural language data processing and syntax-directed compilers. A formal parsing system G = (V,u,T,R) consists of two finite disjoint vocabularies, V and T, a many-many map, u, from V onto T, and a recursive set R of strings in T called syntactic sentence classes. Every program for automatic syntactic analysis determines a formal parsing system. A directed production analyzer (I,T,X,p) is a nondeterministic pushdown-store machine with internal vocabulary I, input vocabulary T, and all productions of p in the form: (Z,a) -> aY1 ... Ym where Z, Yi are elements of the set I and a is an element of the set T. Every context-free language can be analyzed by a directed production analyzer. The Kuno-Oettinger multiple-path syntactic analyzer for English is a concrete example of a directed production analyzer and of a working parsing algorithm. The connection between structures assigned by the analyzer and those of a conventional phrase structure grammar is examined in this paper. .B CACM August, 1964 .A Greibach, S. A. .N CA640818 JB March 9, 1978 6:30 PM .X 1012 5 1012 1012 5 1012 1012 5 1012 1225 5 1012 1350 5 1012 1945 5 1012 823 6 1012 914 6 1012 915 6 1012 917 6 1012 984 6 1012 989 6 1012 990 6 1012 1012 6 1012 1012 6 1012 1012 6 1012 1084 6 1012 1098 6 1012 1122 6 1012 1138 6 1012 1139 6 1012 1141 6 1012 1200 6 1012 1223 6 1012 1225 6 1012 1265 6 1012 1265 6 1012 1336 6 1012 1396 6 1012 1399 6 1012 1455 6 1012 1477 6 1012 1487 6 1012 1491 6 1012 1496 6 1012 483 6 1012 584 6 1012 669 6 1012 680 6 1012 680 6 1012 680 6 1012 763 6 1012 .I 1013 .T Final Examination Scheduling .W A method for scheduling final examinations to yield a minimal number of student conflicts is described. The "minimization" is achieved by repetitively evaluating a nonlinear set of equations. Imbeded in the process is a random or Monte Carlo selection of assignments. As in such heuristic techniques, the solution may not be optimum and many solutions may be found which yield locally minimal results. Computer programs are described and empirical results given. .B CACM August, 1964 .A Broder, S. .N CA640817 JB March 9, 1978 6:33 PM .X 1013 5 1013 1013 5 1013 1013 5 1013 1609 5 1013 2052 5 1013 1008 6 1013 1013 6 1013 1013 6 1013 1504 6 1013 1540 6 1013 .I 1014 .T Machine Controls for Analysis of Variance .W A major problem in using the analysis of variance, as the number of factors increases, is the exponential rise in the number of interactions. Even though the experimenter may not be interested in these interactions it is impossible to ignore them in most experimental designs because of the problem of getting error terms. It is natural therefore to look to the computer to handle the bulk of work involved in computing the interactions. A program device to get the computer to do this is described. .B CACM August, 1964 .A Weldon, R. J. .N CA640816 JB March 9, 1978 6:37 PM .X 1014 4 1014 912 5 1014 1014 5 1014 1014 5 1014 1014 5 1014 .I 1015 .T Near-Minimax Polynomial Approximations and Partitioning of Intervals .W A method of near-minimax polynomial approximation is described. As a by-product, this method provides a formula for an estimate of the maximum error associated with a given degree of approximation. Using this formula, a partitioning algorithm is obtained for dividing a basic interval into subintervals for which approximations of equal degree give equal maximum error. .B CACM August, 1964 .A Fraser, W. Hart, J. F. .N CA640815 JB March 9, 1978 6:41 PM .X 1015 4 1015 1346 4 1015 1440 4 1015 1645 4 1015 951 4 1015 1015 5 1015 1015 5 1015 1015 5 1015 532 5 1015 .I 1016 .T Interchangcable Perforated Tape Variable Block Formats for Positioning and Straight Cut (RS-273) and Contouring and Contouring/Positioning (RS-274) Numerically Controlled Machine Tools (Proposed American Standards) .B CACM August, 1964 .N CA640814 JB March 9, 1978 6:43 PM .X 1016 5 1016 1016 5 1016 1016 5 1016 .I 1017 .T Comments on Bit-Sequencing of the ASCII in Serial-by-Bit Data Transmission .B CACM August, 1964 .A Bemer, R. W. Booth, J. .N CA640813 JB March 9, 1978 6:45 PM .X 1017 5 1017 1017 5 1017 1017 5 1017 .I 1018 .T Gauss (Algorithm 209 [S15]) .B CACM August, 1964 .A Pike, M. C. .N CA640812 JB March 9, 1978 6:54 PM .X 1018 5 1018 1018 5 1018 1018 5 1018 .I 1019 .T XY move Plotting (Algorithm 162 [J6]) .B CACM August, 1964 .A Cavin, D. K. .N CA640811 JB March 9, 1978 6:55 PM .X 1019 5 1019 1019 5 1019 1019 5 1019 .I 1020 .T Free Field Read (Algorithm 239 [I5]) .B CACM August, 1964 .A McKeeman, W. M. .N CA640810 JB March 9, 1978 6:56 PM .X 1020 5 1020 1020 5 1020 1020 5 1020 1705 5 1020 984 6 1020 986 6 1020 1020 6 1020 1321 6 1020 .I 1021 .T Conjugate Gradient Method (Algorithm 238 [F4]) .B CACM August, 1964 .A Reeves, C. M. .N CA640809 JB March 9, 1978 6:59 PM .X 1021 5 1021 1021 5 1021 1021 5 1021 .I 1022 .T Greatest Common Divisor (Algorithm 237 [A1]) .B CACM August, 1964 .A Peck, J. E. L. .N CA640808 JB March 9, 1978 7:17 PM .X 1022 5 1022 1022 5 1022 1022 5 1022 2031 5 1022 1022 6 1022 450 6 1022 .I 1023 .T Bessel Functions of the First Kind (Algorithm 236 [S17]) .B CACM August, 1964 .A Gautschi, W. .N CA640807 JB March 9, 1978 7:19 PM .X 1023 4 1023 1222 4 1023 1023 5 1023 1023 5 1023 1023 5 1023 1130 5 1023 1909 5 1023 2119 5 1023 134 6 1023 1023 6 1023 1023 6 1023 1284 6 1023 1316 6 1023 2129 6 1023 .I 1024 .T A Note on the Formation of Free List .B CACM August, 1964 .A Waite, W. M. .N CA640806 JB March 9, 1978 7:20 PM .X 1024 4 1024 1024 4 1024 1051 4 1024 1051 4 1024 1098 4 1024 1102 4 1024 1132 4 1024 1214 4 1024 1380 4 1024 1388 4 1024 1390 4 1024 1393 4 1024 1485 4 1024 1486 4 1024 1487 4 1024 1549 4 1024 1549 4 1024 1570 4 1024 1706 4 1024 1826 4 1024 1878 4 1024 1878 4 1024 1946 4 1024 1957 4 1024 378 4 1024 2060 4 1024 2155 4 1024 2168 4 1024 2168 4 1024 2719 4 1024 2723 4 1024 2723 4 1024 2838 4 1024 2842 4 1024 2855 4 1024 2857 4 1024 2879 4 1024 3077 4 1024 3080 4 1024 3106 4 1024 3112 4 1024 627 4 1024 106 4 1024 1024 5 1024 1024 5 1024 1024 5 1024 210 5 1024 731 5 1024 .I 1025 .T A Method of Syntax-Checking ALGOL 60 .W A syntax checker was designed based on the syntax of ALGOL as described in the ALGOL 60 Report [Communications of the ACM, May, 1960]. Since the definition of the elements of the language is recursive it seemed most desirable to design the syntax checker as a set of mutually recursive processors tied together by subroutines which perform certain bookkeeping functions. Because of the recursive nature of the language and of the syntax checker the problem of recovery after an error required much attention. A method was devised which permits most programs to be checked completely despite errors. .B CACM August, 1964 .A Lietzke, M. P. .N CA640805 JB March 9, 1978 7:24 PM .X 1025 5 1025 1025 5 1025 1025 5 1025 1215 5 1025 1682 5 1025 1025 6 1025 1025 6 1025 1785 6 1025 224 6 1025 763 6 1025 .I 1026 .T Divide-and-Correct Methods for Multiple Precision Division .W A division problem is defined and notation to relate it to the problem of multiple precision operation in a digital computer is introduced. A basic divide-and-correct method for multiple precision division is formulated and its known properties briefly reviewed. Of particular interest is the fact that the method produces at each step a set of precisely three estimates for the desired result, one of which is exact. .B CACM August, 1964 .A Stein, M. L. .N CA640804 JB March 9, 1978 7:27 PM .X 1026 4 1026 1258 4 1026 1292 4 1026 1497 4 1026 107 5 1026 1026 5 1026 1026 5 1026 1026 5 1026 1258 5 1026 1292 5 1026 1497 5 1026 1975 5 1026 2605 5 1026 107 6 1026 107 6 1026 107 6 1026 1026 6 1026 1026 6 1026 1026 6 1026 1026 6 1026 1026 6 1026 1292 6 1026 1292 6 1026 1497 6 1026 1593 6 1026 2286 6 1026 .I 1027 .T An Alternate Checksum Method .B CACM August, 1964 .A Newhall, N. S. .N CA640803 JB March 9, 1978 7:28 PM .X 1027 5 1027 1027 5 1027 1027 5 1027 .I 1028 .T Investigation of a New Analytical Method for Numerical Derivative Evaluation .W A recently proposed analytical approach to numerical derivative evaluation is discussed. The technique is shown to be both accurate and easy to apply, though certain indicated modifications are required. Its use should greatly facilitate the writing and debugging of programs requiring derivatives of highly complex functions. .B CACM August, 1964 .A Wilkins, R. D. .N CA640802 JB March 9, 1978 7:31 PM .X 1028 4 1028 1028 4 1028 1216 4 1028 1216 4 1028 1278 4 1028 1347 4 1028 1392 4 1028 1396 4 1028 1396 4 1028 1536 4 1028 964 4 1028 1028 5 1028 1028 5 1028 1028 5 1028 1029 5 1028 1216 5 1028 1278 5 1028 1347 5 1028 1396 5 1028 561 5 1028 964 6 1028 973 6 1028 1028 6 1028 1028 6 1028 1028 6 1028 1028 6 1028 1029 6 1028 1029 6 1028 1029 6 1028 1029 6 1028 1083 6 1028 1132 6 1028 1214 6 1028 1278 6 1028 1278 6 1028 1334 6 1028 1365 6 1028 1386 6 1028 1387 6 1028 1388 6 1028 1392 6 1028 1393 6 1028 1394 6 1028 1395 6 1028 1396 6 1028 1397 6 1028 1496 6 1028 284 6 1028 407 6 1028 3199 6 1028 3200 6 1028 3201 6 1028 3202 6 1028 3203 6 1028 3204 6 1028 561 6 1028 561 6 1028 730 6 1028 .I 1029 .T A Simple Automatic Derivative Evaluation Program .W A procedure for automatic evaluation of total/partial derivatives of arbitrary algebraic functions is presented. The technique permits computation of numerical values of derivatives without developing analytical expressions for the derivatives. The key to the method is the decomposition of the given function, by introduction of intermediate variables, into a series of elementary functional steps. A library of elementary function subroutines is provided for the automatic evaluation and differentiation of these new variables. The final step in this process produces the desired function's derivative. The main feature of this approach is its simplicity. It can be used as a quick-reaction tool where the derivation of analytical derivatives is laborious and also as a debugging tool for programs which contain derivatives. .B CACM August, 1964 .A Wengert, R. E. .N CA640801 JB March 9, 1978 7:38 PM .X 1028 5 1029 1029 5 1029 1029 5 1029 1029 5 1029 1216 5 1029 1278 5 1029 1347 5 1029 1396 5 1029 1536 5 1029 964 6 1029 973 6 1029 1028 6 1029 1028 6 1029 1028 6 1029 1028 6 1029 1029 6 1029 1029 6 1029 1029 6 1029 1029 6 1029 1029 6 1029 1029 6 1029 1083 6 1029 1132 6 1029 1214 6 1029 1278 6 1029 1278 6 1029 1334 6 1029 1365 6 1029 1386 6 1029 1387 6 1029 1388 6 1029 1392 6 1029 1393 6 1029 1394 6 1029 1395 6 1029 1396 6 1029 1397 6 1029 1496 6 1029 284 6 1029 407 6 1029 3199 6 1029 3200 6 1029 3201 6 1029 3202 6 1029 3203 6 1029 3204 6 1029 561 6 1029 561 6 1029 561 6 1029 730 6 1029 .I 1030 .T Techniques for the Simulation of Computer Logic .W The simulation of a digital computer is an integral part of most computer design automation systems. The evaluation of the Boolean functions which characterize the computer being simulated constitutes one major portion of a simulation system. Four general procedural classes for evaluating these functions are defined. Toward greatly increased efficiency of a simulation system, methods are presented for simultaneously evaluating many functions for one set of values of the variables,and for evaluating simultaneously one function for many sets of values for the variables. .B CACM July, 1964 .A Breuer,M. A. .N CA640717 JB March 9, 1978 7:42 PM .X 1030 4 1030 1886 4 1030 1939 4 1030 1030 5 1030 1030 5 1030 1030 5 1030 1261 5 1030 1939 5 1030 678 5 1030 1030 6 1030 1030 6 1030 678 6 1030 .I 1031 .T A Note on Starting the Newton-Raphson Method .W Determination of a suitable initial estimate for a root of an equation f(x) = 0 by means of computing the roots of a sequence of related equations is described. .B CACM July, 1964 .A Beyer, W. A. .N CA640716 JB March 9, 1978 7:44 PM .X 1031 5 1031 1031 5 1031 1031 5 1031 .I 1032 .T Theoretical Considerations in Information Retrieval Systems .W Information storage and retrieval systems are composed of three major components: (a) identification of information and tagging it for effective retrieval, (b) searching strategy, how to enter the file to circumvent the scanning of nonrelevant material, and (c) file organization to make access to information efficient. For identification of information the paper suggests that a metalanguage (recently discussed in a paper by Goffman, Verhoeff and Belzer) associated with an object language be used. For searching strategy, a linear model for an evaluation function of relevancy is developed which rewards the system for retrieving relevant documents and not retrieving the nonrelevant, and penalizes the system for the escaped relevant documents and false drops. The inadequacies of a linear model are indicated. Two approaches to file organization are discussed. One is self-organization of the file based on its history and past performance, and the second is a self-generating subset of the file with a high probability of being relevant. .B CACM July, 1964 .A Belzer, J. Goffman, W. .N CA640715 JB March 9, 1978 7:55 PM .X 1032 5 1032 1032 5 1032 1032 5 1032 .I 1033 .T Experimental Personalized Array Translator System .W A system designed for intimate man-machine interaction in a general-purpose problem-solving environment is experimentally operational. The system utilizers an array-oriented symbolic source language containing powerful statement types. These include numeric, Boolean, relational and selection operators on operands which can be entire arrays. The system also permits simple specification of test and argument arrays in single statements. The completely symbolic operating system includes display and entry of program and data. Sequence control is aided by an interrupt switch which allows the user to interact with the program during execution. In addition to normal stored program sequencing, the system provides trace options and the ability to enter any statement for immediate execution. Present implementation of the system is with an interpretive translator on an IBM 1620 computer. .B CACM July, 1964 .A Hellerman, H. .N CA640714 JB March 9, 1978 8:02 PM .X 1033 5 1033 1033 5 1033 1033 5 1033 .I 1034 .T Autosate .W An automated data system analysis technique is described. The technique is designed to alleviate some of the principal problems that beset current analysis-large data workloads, long span of time between project inception and system operational date, the lack of explicit directions for conducting data system analysis and using the results, and the lack of a technique to control data system changes throughout its lifetime. The analysis is geared to determining workload, relationships and storage characteristics of documents in the information network automatically. .B CACM July, 1964 .A Gatto, O. T. .N CA640713 JB March 9, 19788:07 PM .X 1034 5 1034 1034 5 1034 1034 5 1034 .I 1035 .T Characteristics of the FORTRAN CEP Language .W The FORTRAN CEP languages differs from FORTRAN II mainly because: (1) it extends the variety of the modes for real quantities; (2) it allows suitable mixtures, in an input/output list or in an expression, of quantities that occur under different modes; (3) it makes it possible to address a greater number of input/output equipment; and (4) it removes the restrictions on the complexity of the list of quantities to be transmitted between the magnetic core memory and the drum or the magnetic tape units. .B CACM July, 1964 .A Mancino. O. G. .N CA640712 JB March 9, 1978 8:11 PM .X 1035 5 1035 1035 5 1035 1035 5 1035 1305 5 1035 1035 6 1035 .I 1036 .T Remark on Further Generalization of ALGOL .B CACM July, 1963 .A Garwick, J. V. .N CA640710 JB March 9, 1978 8:12 PM .X 1036 5 1036 1036 5 1036 1036 5 1036 .I 1037 .T Reduction of a Matrix Containing Polynomial Elements (Algorithm 170 [F3]) .B CACM July, 1964 .A Priebe, K. B. .N CA640710 JB March 9, 1978 8:13 PM .X 1037 4 1037 1234 4 1037 1358 4 1037 1491 4 1037 1037 5 1037 1037 5 1037 1037 5 1037 729 5 1037 .I 1038 .T Crout with Equilibration and Iteration (Algorithm 135 [F4]) .B CACM July, 1964 .A McKeeman, W. M. .N CA640709 JB March 9, 1978 8:15 PM .X 1038 5 1038 1038 5 1038 1038 5 1038 .I 1039 .T Summation of Fourier Series (Algorithm 128 [C6]) .B CACM July, 1964 .A Thacher Jr., H. C. .N CA640708 JB March 9, 1978 8:16 PM .X 1039 5 1039 1039 5 1039 1039 5 1039 .I 1040 .T Romberg Integration(Algorithm 60 [D1]) .B CACM July, 1964 .A Thacher Jr., H. C. .N CA640707 JB March 9, 1978 8:17 PM .X 1040 4 1040 1040 4 1040 1040 4 1040 1352 4 1040 2040 4 1040 1040 5 1040 1040 5 1040 1040 5 1040 1352 5 1040 2415 5 1040 587 5 1040 621 5 1040 885 5 1040 834 6 1040 872 6 1040 1040 6 1040 1040 6 1040 1092 6 1040 1241 6 1040 1273 6 1040 1982 6 1040 324 6 1040 2074 6 1040 429 6 1040 570 6 1040 621 6 1040 786 6 1040 .I 1041 .T Random Permutation (Algorithm 235 [G6]) .B CACM July, 1964 .A Durstenfeld, R. .N CA640706 JB March 9, 1978 8:18 PM .X 1041 5 1041 1041 5 1041 1041 5 1041 .I 1042 .T Poisson-Charlier Polynomials (Algorithm 234 [S23]) .B CACM July, 1964 .A Simoes Pereira, J. M. S. .N CA640705 JB March 9, 1978 8:19 PM .X 1042 5 1042 1042 5 1042 1042 5 1042 .I 1043 .T Talk-A High-Level Source Language Debugging Technique With Real-Time Data Extraction .W TALK, meaning Take A Look, is a debugging technique which aids substantially in debugging complex real-time programming systems by interrupting the users program at desired points to extract previously specified data. The extracted data is later edited, listing the associated data with its high-level source language identification. .B CACM July, 1964 .A verSteeg, R. L. .N CA640704 JB March 9, 1978 8:24 PM .X 1043 5 1043 1043 5 1043 1043 5 1043 .I 1044 .T An Automatic Loader for Subroutine Nests .W A method for automatic loading of library subroutines, which can be adapted to operate in conjunction with any conventional two-pass assembler is described. The method is specifically designed to cope with a nested library structure. .B CACM July, 1964 .A Kanner, H. .N CA640703 JB March 9, 1978 8:27 PM .X 1044 5 1044 1044 5 1044 1044 5 1044 1332 5 1044 1044 6 1044 .I 1045 .T Programming Analysis of Variance by Sequences of Operators and Isomorphic Mappings .W A special operator calculus developed by Hartley in 1956 together with a new mapping scheme has been found to be efficient in programming analysis of variance for multifactor experiments. The operator calculus and the mapping scheme are described in detail. .B CACM July, 1964 .A Peng, K. C. .N CA640702 JB March 9, 1978 8:30 PM .X 1045 5 1045 1045 5 1045 1045 5 1045 1404 5 1045 1045 6 1045 .I 1046 .T A Compiler-Building System Developed by Brooker and Morris .W In a number of articles published during the past two years, R. A. Brooker and D. Morris (joined by J.S. Rohl in their most recent paper have presented a very interesting programming system that they have developed for the Ferranti Atlas computer. The present paper describes some of the major features of their system. it expands on some points that the original authors cover briefly, and treats only very lightly some topics to which they devote considerable space. The purpose of this paper is purely expository. Except in some very small details, and in some comments, it does not intentionally depart from or add to the material published in the listed references. .B CACM July, 1964 .A Rosen, S. .N CA640701 JB March 9, 1978 8:47 PM .X 1046 4 1046 1105 4 1046 1139 4 1046 1140 4 1046 1234 4 1046 1263 4 1046 1265 4 1046 1496 4 1046 1781 4 1046 1824 4 1046 2126 4 1046 2546 4 1046 464 4 1046 584 4 1046 631 4 1046 653 4 1046 680 4 1046 763 4 1046 795 4 1046 799 4 1046 945 4 1046 1046 5 1046 1046 5 1046 1046 5 1046 1781 5 1046 404 5 1046 123 6 1046 196 6 1046 919 6 1046 990 6 1046 1007 6 1046 1046 6 1046 1131 6 1046 1139 6 1046 1140 6 1046 1149 6 1046 1198 6 1046 1215 6 1046 1223 6 1046 1265 6 1046 1303 6 1046 1323 6 1046 1358 6 1046 1366 6 1046 1421 6 1046 1460 6 1046 1462 6 1046 1463 6 1046 1467 6 1046 1468 6 1046 1477 6 1046 1491 6 1046 1496 6 1046 1531 6 1046 1535 6 1046 1565 6 1046 1601 6 1046 1602 6 1046 1613 6 1046 1614 6 1046 1626 6 1046 1641 6 1046 1787 6 1046 1788 6 1046 205 6 1046 224 6 1046 249 6 1046 288 6 1046 316 6 1046 381 6 1046 398 6 1046 11 6 1046 404 6 1046 410 6 1046 463 6 1046 464 6 1046 483 6 1046 3184 6 1046 3188 6 1046 584 6 1046 600 6 1046 680 6 1046 691 6 1046 763 6 1046 799 6 1046 .I 1047 .T Generation of Test Matrices by Similarity Transformations .W A method for obtaining test matrices with a prescribed distribution of characteristic roots is given. The process consists of using particularly simple similarity transformations to generate full matrices from canonical forms. The matrices generated also have known characteristic vectors, inverses and determinants. .B CACM June, 1964 .A Ortega, J. M. .N CA640620 JB March 9, 1978 8:50 PM .X 1047 4 1047 1047 5 1047 1047 5 1047 1047 5 1047 1707 5 1047 496 5 1047 1047 6 1047 511 6 1047 .I 1048 .T Approximate Solution of Axially Symmetric Problems .W A variety of physical problems in such diverse fields as electrostatic field theory, heat and ideal fluid flow, and stress concentration theory reduce, under the assumption of axial symmetry, to the study of an elliptic partial differential equation. Dirichlet-type problems associated with this equation are studied on regions whose boundaries include a nondegenerate portion of the x-axis and exceedingly accurate numerical methods are given for approximating solutions. .B CACM June, 1964 .A Greenspan, D. .N CA640619 JB March 9, 1978 8:55 PM .X 1048 5 1048 1048 5 1048 1048 5 1048 .I 1049 .T Numerical Solution of Nonlinear Two-Point Boundary Problems by Finite Difference Methods .W Solution of nonlinear two-point boundary-value problems is often an extremely difficult task. Quite apart from questions of reality and uniqueness, there is no established numerical technique for this problem. At present, shooting techniques are the easiest method of attacking these problems. When these fail, the more difficult method of finite differences can often be used to obtain a solution. This paper gives examples and discusses the finite difference method for non-linear two-point boundary-value problems. .B CACM June, 1964 .A Holt, J. F. .N CA640618 JB March 9, 1978 9:07 PM .X 1049 4 1049 1049 5 1049 1049 5 1049 1049 5 1049 416 5 1049 .I 1050 .T A Parts Breakdown Technique Using List Structures .W List structured parts breakdown is proposed and discussed. Implementation facts are presented on operating program using these techniques. .B CACM June, 1964 .A Brian, W. J. .N CA640617 JB March 9, 1978 9:09 PM .X 1050 4 1050 1050 4 1050 1050 4 1050 1050 4 1050 1050 4 1050 1102 4 1050 1226 4 1050 1393 4 1050 1549 4 1050 1549 4 1050 1935 4 1050 1936 4 1050 378 4 1050 2017 4 1050 2023 4 1050 2032 4 1050 2257 4 1050 2360 4 1050 2451 4 1050 2452 4 1050 441 4 1050 2723 4 1050 2882 4 1050 3008 4 1050 3112 4 1050 627 4 1050 731 4 1050 731 4 1050 758 4 1050 793 4 1050 798 4 1050 106 5 1050 1050 5 1050 1050 5 1050 1050 5 1050 209 5 1050 367 5 1050 627 5 1050 849 5 1050 .I 1051 .T Multiword List Items .W The list concept as originally proposed by Newell, Simon and Shaw specified single computer words as elements of a list. This report describes the use of two or more consecutive words as one element. Such use results in a considerable saving in both the space required to hold a given amount of data, and in the execution time required to perform a given process on the data. Following a brief description of standard list structures with single-word items, the multiword items are introduced. Then variable-length items are described, along with the corresponding space-utilization problems. Finally, several examples are given to illustrate the use of multiword lists. This paper attempts to draw together various recent papers which have applied some of these concepts in different ways, and indicate how they relate to the more general problems. .B CACM June, 1964 .A Comfort, W. T. .N CA640616 JB March 9, 1978 9:15 PM .X 1024 4 1051 1024 4 1051 1051 4 1051 1051 4 1051 1051 4 1051 1051 4 1051 1051 4 1051 1051 4 1051 1062 4 1051 1098 4 1051 1102 4 1051 1102 4 1051 1132 4 1051 1214 4 1051 1380 4 1051 1388 4 1051 1390 4 1051 1393 4 1051 1485 4 1051 1486 4 1051 1487 4 1051 1549 4 1051 1549 4 1051 1549 4 1051 1552 4 1051 1570 4 1051 1665 4 1051 1706 4 1051 1826 4 1051 1860 4 1051 1878 4 1051 1878 4 1051 1946 4 1051 1957 4 1051 378 4 1051 2060 4 1051 2155 4 1051 2155 4 1051 2168 4 1051 2168 4 1051 2719 4 1051 2723 4 1051 2723 4 1051 2838 4 1051 2842 4 1051 2855 4 1051 2857 4 1051 2879 4 1051 3077 4 1051 3080 4 1051 3106 4 1051 3112 4 1051 627 4 1051 106 4 1051 1051 5 1051 1051 5 1051 1051 5 1051 1211 5 1051 210 5 1051 1549 5 1051 1906 5 1051 378 5 1051 2902 5 1051 406 5 1051 731 5 1051 793 5 1051 794 5 1051 106 6 1051 1051 6 1051 1051 6 1051 1051 6 1051 1051 6 1051 1062 6 1051 1062 6 1051 1184 6 1051 1211 6 1051 1552 6 1051 210 6 1051 1879 6 1051 2435 6 1051 2596 6 1051 2734 6 1051 2747 6 1051 2768 6 1051 406 6 1051 627 6 1051 731 6 1051 753 6 1051 .I 1052 .T Reducing Truncation Errors by Programming .W In accumulating a sum such as in a numerical integration with a large number of intervals, the sum itself becomes much larger than the individual addends. This may produce a less accurate sum as the number of intervals is increased. Separate variables can be established as accumulators to hold partial sums within various distinct intervals. Thus, the extensive successive truncations are eliminated. .B CACM June, 1964 .A Wolfe, J. M. .N CA640615 JB March 9, 1978 9:22 PM .X 1052 5 1052 1052 5 1052 1052 5 1052 1328 5 1052 1333 5 1052 2144 5 1052 1052 6 1052 1052 6 1052 1052 6 1052 .I 1053 .T Design and Implementation of a General-Purpose Input Routine .W A general-purpose input routine is discussed and advocated for FORTRAN. The philosophy of such programs is examined and exemplified. .B CACM June, 1964 .A Hassitt, A. .N CA640614 JB March 9, 1978 9:27 PM .X 1053 4 1053 1053 4 1053 1053 4 1053 1053 4 1053 720 4 1053 1053 5 1053 1053 5 1053 1053 5 1053 1649 5 1053 435 5 1053 474 5 1053 718 5 1053 720 5 1053 1053 6 1053 .I 1054 .T Gauss-Seidel (Algorithm 220 ) .B CACM June, 1964 .A Batson, A. P. .N CA640613 JB March 9, 1978 9:28 PM .X 1054 5 1054 1054 5 1054 1054 5 1054 .I 1055 .T q-Bessel Functions In(t) (Algorithm 214) .B CACM June,1964 .A Simoes Pereira, J. M. S. .N CA640612 JB March 9, 1978 9:29 PM .X 1055 5 1055 1055 5 1055 1055 5 1055 .I 1056 .T Shellsort (Algorithm 201) .B CACM June, 1964 .A Batty, M. A. .N CA640611 JB March 9, 1978 9:30 PM .X 1056 5 1056 1056 5 1056 1056 5 1056 .I 1057 .T Critical Path Scheduling (Algorithm 40) .B CACM June, 1964 .A Hoffman, I. A. .N CA640610 JB March 9, 1978 9:32 PM .X 1057 5 1057 1057 5 1057 1057 5 1057 .I 1058 .T Simpson's Rule for Multiple Integration (Algorithm 233) .B CACM June, 1964 .A Olynyk, F. .N CA640609 JB March 9, 1978 9:33 PM .X 1058 5 1058 1058 5 1058 1058 5 1058 .I 1059 .T Heapsort (Algorithm 232) .B CACM June, 1964 .A Williams, J. W. J. .N CA640608 JB March 9, 1978 9:34 PM .X 1059 5 1059 1059 5 1059 1059 5 1059 2757 5 1059 2844 5 1059 970 6 1059 1059 6 1059 1059 6 1059 2630 6 1059 2742 6 1059 2767 6 1059 .I 1060 .T Matrix Inversion (Algorithm 231) .B CACM June, 1964 .A Boothroyd, J. .N CA640607 JB March 9, 1978 9:35 PM .X 1060 5 1060 1060 5 1060 1060 5 1060 .I 1061 .T Matrix Permutation (Algorithm 230) .B CACM June, 1964 .A Boothroyd, J. .N CA640606 JB March 9, 1978 9:36 PM .X 1061 5 1061 1061 5 1061 1061 5 1061 .I 1062 .T Symbol Manipulation in FORTRAN-SASP I Subroutines .W A set of subroutines for use in FORTRAN are described whose purpose is to synthesize output strings from (i) input strings which have been analyzed by the SHADOW general syntactic analysis subroutine reported earlier, and/or (ii) packed BCD strings formed in any way. Function-type subroutines are included for intermediate manipulations, which are performed on the strings which are stored in an abbreviated internal representation. The automatic way in which an internal representation for each newly created substring is stored sequentially in a block of common storage, and the manner in which a storage block is dynamically allocated for that purpose, are discussed. .B CACM June, 1964 .A Bailey, M. J. Barnett, M. P. Burleson, P. B. .N CA640605 JB March 9, 1978 9:43 PM .X 1051 4 1062 1062 4 1062 1062 4 1062 1121 4 1062 1139 4 1062 1265 4 1062 1781 4 1062 720 4 1062 759 4 1062 1062 5 1062 1062 5 1062 1062 5 1062 1211 5 1062 2902 5 1062 464 5 1062 794 5 1062 1051 6 1062 1051 6 1062 1062 6 1062 1062 6 1062 1184 6 1062 1211 6 1062 1552 6 1062 1879 6 1062 2435 6 1062 2596 6 1062 2734 6 1062 2747 6 1062 2768 6 1062 .I 1063 .T One-Inch Perforated Paper Tape for Information Interchange (Proposed American Standard) .B CACM June, 1964 .N CA640604 JB March 9, 1978 9:44 PM .X 1063 5 1063 1063 5 1063 1063 5 1063 .I 1064 .T Perforated Tape Code for Information Interchange (Proposed American Standard) .B CACM June, 1964 .N CA640603 JB March 9, 1978 9:46 PM .X 1064 5 1064 1064 5 1064 1064 5 1064 .I 1065 .T Bit Sequencing of the American Standard Code for Information Interchange (ASCII) in Serial-by-Bit Data Transmission (Proposed American Standard) .B CACM June, 1964 .N CA640602 JB March 9, 1978 9:47 PM .X 1065 5 1065 1065 5 1065 1065 5 1065 .I 1066 .T Growing Applications of Linear Programming .W Use of linear programming models has grown so extensively in recent years that the whole concept for organizing a computer code has undergone a radical change. It no longer is adequate merely to reduce a mathematical algorithm (i.e. the simplex method) to a computer code. An advanced code must cope with such a variety of situations that the respective computer subprograms must be organized into an integrated system. Emphasis in this paper is devoted to the underlying principles upon which future linear programming systems must be based. These viewpoints are influenced by the new demands that applications within the petroleum industry are placing on such systems. Some of the components of such a system are: translation of problem statement in terms of basic data to linear programming matrix coefficients, data transmission for direct computer entry, data file at the computer center, data processing and editing prior to solving the simplex algorithm, an efficient and reliable code for solving the above-mentioned algorithm, and flexible means for summarizing the results. .B CACM June, 1964 .A Aronofsky, J. S. .N CA640601 JB March 9, 1978 9:55 PM .X 1066 5 1066 1066 5 1066 1066 5 1066 .I 1067 .T Picture Generation With a Standard Line Printer .W A method is described for producing gray-toned pictures on a line printer by utilizing the different degrees of blackness of standard print characters. Gray scales with 17, 32 and 64 levels have been devised. Scanned images of blood cells are used to display the technique. .B CACM May, 1964 .A Perry, B. Mendelsohn, M. L. .N CA640522 JB March 9, 1978 11:31 PM .X 1067 5 1067 1067 5 1067 1067 5 1067 .I 1068 .T A FORTRAN II Load-Time-Saver .B CACM May, 1964 .A Ackermann, A. F. .N CA640521 JB March 9, 1978 11:33 PM .X 1068 4 1068 1945 4 1068 917 5 1068 1068 5 1068 1068 5 1068 1068 5 1068 .I 1069 .T A Method for Comparing the Internal Operating Speeds of Computers .B CACM May, 1964 .A Raichelson, E. Collins, G. .N CA640520 JB March 9, 1978 11:35 PM .X 1069 5 1069 1069 5 1069 1069 5 1069 1653 5 1069 2989 5 1069 963 6 1069 1069 6 1069 1069 6 1069 1417 6 1069 2138 6 1069 .I 1070 .T Expand, A System for Input Card Replication .B CACM May, 1964 .A Warrington, J. A. Norris, J. H. .N CA640519 JB March 9,1978 11:37 PM .X 1070 5 1070 1070 5 1070 1070 5 1070 .I 1071 .T Computer-Usage Accounting for Generalized Time-Sharing Systems .W The current development of general time-sharing systems requires a revision of accounting procedures for computer usage. Since time-sharing system users operate concurrently, it is necessary to be more precise as to the amount of computer time and storage space that a user actually utilizes. The various cost factors which should be considered for computer usage accounting in generalized time-sharing systems are discussed. .B CACM May, 1964 .A Rosenberg, A. M. .N CA640518 JB March 9, 1978 11:40 PM .X 1071 4 1071 1071 5 1071 1071 5 1071 1071 5 1071 3196 5 1071 .I 1072 .T An Improved Equivalence Algorithm .W An algorithm for assigning storage on the basis of EQUIVALENCE, DIMENSION and COMMON declarations is presented. The algorithm is based on a tree structure, and has reduced computation time by 40 percent over a previously published algorithm by identifying all equivalence classes with one scan of the EQUIVALENCE declarations. The method is applicable in any problem in which it is necessary to identify equivalence classes, given the element pairs defining the equivalence relation. .B CACM May, 1964 .A Galler, B. A. Fisher, M. J. .N CA640517 JB March 9, 1978 11:48 PM .X 1072 4 1072 1781 4 1072 1072 5 1072 1072 5 1072 1072 5 1072 1646 5 1072 316 5 1072 830 6 1072 987 6 1072 1072 6 1072 1179 6 1072 1647 6 1072 680 6 1072 .I 1073 .T A Fast Procedure for Generating Exponential Random Variables .W A very fast method for generating exponential random variables in a digital computer is outlined. .B CACM May, 1964 .A MacLaren, M. D. Marsaglia, G. Bray, T. A. .N CA640516 JB March 9, 1978 11:50 PM .X 1073 4 1073 1073 4 1073 1153 4 1073 2137 4 1073 2276 4 1073 940 5 1073 1073 5 1073 1073 5 1073 1073 5 1073 1153 5 1073 2276 5 1073 1073 6 1073 1153 6 1073 .I 1074 .T Shanks (Algorithm 215) .B CACM May, 1964 .A Schumaker, L. .N CA640515 JB March 9, 1978 11:51 PM .X 1074 5 1074 1074 5 1074 1074 5 1074 .I 1075 .T Shuttlesort (Algorithm 175) .B CACM May, 1964 .A Juelich, O. C. .N CA640514 JB March 9, 1978 11:52 PM .X 1075 5 1075 1075 5 1075 1075 5 1075 .I 1076 .T Multiple Integration (Algorithm 146) .B CACM May, 1964 .A Wirth, N. .N CA640513 JB March 9, 1978 11:53 PM .X 1076 5 1076 1076 5 1076 1076 5 1076 .I 1077 .T Chebyshev Curve Fit (Algorithm 91) .B CACM May, 1964 .A Naur, P. .N CA640512 JB March 9, 1978 11:53 PM .X 1077 5 1077 1077 5 1077 1077 5 1077 .I 1078 .T Elementary Functions by Continued Fractions (Algorithm 229) .B CACM May, 1964 .A Morelock, J. C. .N CA640511 JB March 9, 1978 11:55 PM .X 1078 5 1078 1078 5 1078 1078 5 1078 .I 1079 .T Q-Bessel Functions (Algorithm 228) .B CACM May, 1964 .A Simoes Pereira, J. M. S. .N CA640510 JB March 9, 1978 11:56 PM .X 1079 5 1079 1079 5 1079 1079 5 1079 .I 1080 .T Chebyshev Polynomial Coefficients (Algorithm 227) .B CACM May, 1964 .A Cyvin, S. J. .N CA640509 JB March 9, 1978 11:57 PM .X 1080 5 1080 1080 5 1080 1080 5 1080 .I 1081 .T Normal Distribution Function (Algorithm 226) .B CACM May, 1964 .A Cyvin, S. J. .N CA640508 JB March 9, 1978 11:58 PM .X 1081 5 1081 1081 5 1081 1081 5 1081 1157 5 1081 836 6 1081 1081 6 1081 485 6 1081 714 6 1081 .I 1082 .T Gamma Function with Controlled Accuracy (Algorithm 225) .B CACM May, 1964 .A Cyvin, S. J. Cyvin, B. N. .N CA640507 JB March 9, 1978 11:59 PM .X 1082 5 1082 1082 5 1082 1082 5 1082 .I 1083 .T An Experiment in a User-Oriented Computer System .W A version of a software-hardware system for the purpose of facilitating the programming and analysis of well-formulated problems is described. A modified Flexowriter is used to generate computer-acceptable input when equations or computable requests are typed in much the same manner as they would appear in conventional mathematical texts. The typing and language rules are quite flexible and unrestrictive. While the compiler part is efficient, the system as a whole has much broader aspects as a tool for the study of problem solving and self-teaching systems. .B CACM May, 1964 .A Klerer, M. May, J. .N CA640506 JB March 10, 1978 12:03 AM .X 1083 4 1083 1083 4 1083 1083 4 1083 1083 4 1083 1396 4 1083 1396 4 1083 679 4 1083 1083 5 1083 1083 5 1083 1083 5 1083 1396 5 1083 1624 5 1083 407 5 1083 3192 5 1083 3193 5 1083 730 5 1083 964 6 1083 1028 6 1083 1029 6 1083 1083 6 1083 1083 6 1083 1132 6 1083 1214 6 1083 1278 6 1083 1334 6 1083 1365 6 1083 1386 6 1083 1387 6 1083 1388 6 1083 1392 6 1083 1393 6 1083 1394 6 1083 1395 6 1083 1396 6 1083 1397 6 1083 1496 6 1083 284 6 1083 407 6 1083 3199 6 1083 3200 6 1083 3201 6 1083 3202 6 1083 3203 6 1083 3204 6 1083 561 6 1083 730 6 1083 .I 1084 .T On Declaring Arbitrarily Coded Alphabets .W The inability of existing programming languages to handle character strings from more than one or two alphabets is mentioned and a scheme for declaring additional alphabets is proposed. The scheme provides for: many-to-one encodings, right or left justification, collating sequences different from numeric sequence, variations in character size (number of bits.) from alphabet to alphabet, and arbitrary source-language character representation. .B CACM May, 1964 .A Shaw, C. J. .N CA640505 JB March 10,1978 12:13 AM .X 1084 4 1084 1084 4 1084 1084 4 1084 1084 4 1084 1084 4 1084 1084 4 1084 1379 4 1084 1625 4 1084 1945 4 1084 1084 5 1084 1084 5 1084 1084 5 1084 1945 5 1084 603 5 1084 644 5 1084 669 5 1084 791 5 1084 797 5 1084 868 5 1084 823 6 1084 914 6 1084 915 6 1084 917 6 1084 984 6 1084 989 6 1084 990 6 1084 1012 6 1084 1084 6 1084 1098 6 1084 1122 6 1084 1138 6 1084 1139 6 1084 1141 6 1084 1200 6 1084 1223 6 1084 1265 6 1084 1336 6 1084 1396 6 1084 1455 6 1084 1477 6 1084 1487 6 1084 1491 6 1084 1496 6 1084 483 6 1084 584 6 1084 669 6 1084 680 6 1084 763 6 1084 .I 1085 .T Specification for General-Purpose Paper Cards for Information Processing (Proposed American Standard) .B CACM May, 1964 .N CA640504 JB March 10, 1978 12:14 AM .X 1085 5 1085 1085 5 1085 1085 5 1085 .I 1086 .T A Proposal for Input-Output Conventions in ALGOL 60-A Report of the Subcommittee on ALGOL of the ACM Programming Language Committee .B CACM May, 1964 .N CA640501 JB March 10, 1978 12:18 AM .X 1086 4 1086 1086 4 1086 1132 4 1086 1234 4 1086 1263 4 1086 1265 4 1086 1270 4 1086 1323 4 1086 1358 4 1086 1379 4 1086 1380 4 1086 1453 4 1086 1464 4 1086 1484 4 1086 1491 4 1086 1496 4 1086 1498 4 1086 1613 4 1086 1614 4 1086 1781 4 1086 1825 4 1086 1860 4 1086 2083 4 1086 2178 4 1086 2179 4 1086 2252 4 1086 2325 4 1086 2341 4 1086 2546 4 1086 2645 4 1086 2652 4 1086 2684 4 1086 2842 4 1086 2929 4 1086 2934 4 1086 3069 4 1086 669 4 1086 679 4 1086 691 4 1086 761 4 1086 949 4 1086 989 4 1086 1086 5 1086 1086 5 1086 1086 5 1086 1137 5 1086 1613 5 1086 3184 5 1086 987 6 1086 1086 6 1086 1134 6 1086 1453 6 1086 3184 6 1086 .I 1087 .T Problems in Automatic Abstracting .W A variety of problems concerning the design and operation of an automatic abstracting system are discussed. The purpose is to a general view of several major problem areas. No attempt is made to discuss details or to indicate preferences among alternative solutions. .B CACM April, 1964 .A Edmundson, H. P. .N CA640422 JB March 10, 1978 12:21 AM .X 1087 4 1087 634 4 1087 1087 5 1087 1087 5 1087 1087 5 1087 329 5 1087 .I 1088 .T Menu Planning by Computer .W A computer code has been developed which plans menus by finding minimum cost combinations of menu items such that the daily dietary, gastronomic and production requirements can be satisfied for a sequence of days. A fast, special integer programming algorithm is described which approximates the theoretical solution to the problem. If necessary, any menu can be changed on-line and then post-optimized. Up to 30 percent saving on food cost is possible. A FORTRAN program for the IBM 1410 is available on request. A considerable amount of data processing must precede the implementation of the system. .B CACM April, 1964 .A Balistfy, J. L. .N CA640421 JB March 10, 1978 12:26 AM .X 1088 5 1088 1088 5 1088 1088 5 1088 1658 5 1088 1088 6 1088 .I 1089 .T Designing a Computer Center .B CACM April, 1964 .A Denison, A. Popov, G. .N CA640420 JB March 10, 1978 12:29 AM .X 1089 5 1089 1089 5 1089 1089 5 1089 .I 1090 .T Incomplete Beta Function Ratios (Algorithm 222) .B CACM April, 1964 .A Gautschi, W. .N CA640418 JB March 10, 1978 12:32 AM .X 1090 5 1090 1090 5 1090 1090 5 1090 .I 1091 .T Hypergeometric and Confluent Hypergeometric (Algorithm 191 & 192) .B CACM April, 1964 .A Thacher Jr., H. C. .N CA640417 JB March 10, 1978 12:33 AM .X 1091 5 1091 1091 5 1091 1091 5 1091 .I 1092 .T Nonrecursive Adaptive Integration (Algorithm 182) .B CACM April, 1964 .A Butler, H. S. .N CA640416 JB March 10, 1978 12:34 AM .X 1092 5 1092 1092 5 1092 1092 5 1092 1352 5 1092 2093 5 1092 834 6 1092 834 6 1092 872 6 1092 872 6 1092 1040 6 1092 1092 6 1092 1092 6 1092 1241 6 1092 1273 6 1092 1298 6 1092 1573 6 1092 324 6 1092 429 6 1092 429 6 1092 570 6 1092 621 6 1092 786 6 1092 .I 1093 .T Evaluation of Determinant (Algorithm 224) .B CACM April, 1964 .A Rotenberg, L. J. .N CA640415 JB March 10, 1978 1:12 AM .X 1093 5 1093 1093 5 1093 1093 5 1093 1946 5 1093 878 6 1093 902 6 1093 1093 6 1093 1177 6 1093 1387 6 1093 1393 6 1093 360 6 1093 731 6 1093 .I 1094 .T Prime Twins (Algorithm 223) .B CACM April, 1964 .A Shimrat, M. .N CA640414 JB March 10, 1978 1:13 AM .X 1094 5 1094 1094 5 1094 1094 5 1094 .I 1095 .T Decimal Tables of Binary Coded Tables .B CACM April, 1964 .A Griebrok, M. .N CA640413 JB March 10, 1978 1:14 AM .X 1095 5 1095 1095 5 1095 1095 5 1095 .I 1096 .T On Avoiding Matrix Reversals Between 7090 FORTRAN II and 7090 FORTRAN IV .B CACM April, 1964 .A Stevens, D. Benson, B. .N CA640412 JB March 10, 1978 1:28 AM .X 1096 5 1096 1096 5 1096 1096 5 1096 .I 1097 .T An Algorithm for Converting Integers from Base A to Base B .W A little known, simple algorithm for integer conversion between number systems is presented and proved. .B CACM April, 1964 .A Gladwin, H. T. .N CA640411 JB March 10, 1978 1:30 AM .X 1097 5 1097 1097 5 1097 1097 5 1097 .I 1098 .T A Comparison of List-Processing Computer Languages (Including a Detailed Comparison of COMIT, IPL-V, LISP 1.5, and SLIP) .W A detailed comparison is presented of COMIT, IPL-V, LISP 1.5 and SLIP - four well-known computer programming languages which, among them, exhibit all the principal characteristics of existing list-processing languages. Important common features of list-processing languages are reviewed: forms of data structures which are manipulated, necessity for dynamic allocation of storage, use of pushdown stores, and use of recursive operations. Principal differences between the four languages under consideration are detailed: representations of data, both by the programmer and within the machine; methods for storage allocation; programming formalisms and special processes available, including arithmetic facilities; and usability in terms of availability, documentation, learning aids and debugging facilities. A rough comparison shows that all the languages discussed have approximately the same speed. Finally, the authors give some heuristics to aid in the selection of one of these languages for use in particular problem applications, concluding that no one of the languages considered is distinctly superior in all possible list-processing applications. .B CACM April, 1964 .A Bobrow, D. G. Raphael, B. .N CA640410 JB March 10, 1978 1:37 AM .X 1024 4 1098 1051 4 1098 1098 4 1098 1214 4 1098 1380 4 1098 1388 4 1098 1393 4 1098 1485 4 1098 1487 4 1098 1549 4 1098 1570 4 1098 1878 4 1098 1946 4 1098 1957 4 1098 2168 4 1098 2723 4 1098 2857 4 1098 3112 4 1098 1098 5 1098 1098 5 1098 1098 5 1098 1570 5 1098 1945 5 1098 2314 5 1098 731 5 1098 823 6 1098 914 6 1098 915 6 1098 917 6 1098 984 6 1098 989 6 1098 990 6 1098 1012 6 1098 1084 6 1098 1098 6 1098 1098 6 1098 1098 6 1098 1122 6 1098 1138 6 1098 1139 6 1098 1141 6 1098 1200 6 1098 1223 6 1098 1265 6 1098 1336 6 1098 1396 6 1098 1455 6 1098 1477 6 1098 1487 6 1098 1491 6 1098 1496 6 1098 1626 6 1098 2082 6 1098 2148 6 1098 483 6 1098 584 6 1098 669 6 1098 680 6 1098 731 6 1098 763 6 1098 .I 1099 .T Professional Computer Work for the Blind .W Developments in computer technology have opened new professional opportunities for the intelligent blind. Since there are few if any occupations in which the blind can participate without serious disadvantage, the opportunities offered them to gain entrance into various occupations through computer use including that of programmer, is important for future rehabilitation planning. Also of immediate interest is the fact that the blind may be especially suited for programming work. Because of intense training in and constant experience with locating objects in the unseen environment and also because of superbly trained memory, the blind brings to the work of programming skills which the sighted has had little need to acquire. These qualifications should result in fewer debugging problems and make the blind a valuable addition to any systems group. Before the blind could become a serious professional, a number of aids and techniques had to be developed that can mediate between machines and programmer. This paper describes the techniques and aids which were designed by the staff of the Medical Computing Center of the University of Cincinnati College of Medicine. .B CACM April, 1964 .A Sterling, T. D. Lichstein, M. Scarpino, F. Stuebing, D. .N CA640409 JB March 10, 1978 1:46 AM .X 1099 5 1099 1099 5 1099 1099 5 1099 1264 5 1099 1740 5 1099 1099 6 1099 1099 6 1099 .I 1100 .T Status of Computer Sciences Curricula in Colleges and Universities .B CACM April, 1964 .A Atchison, W. F. Hamblen, J. W. .N CA640408 JB March 10, 1978 1:47 AM .X 1100 5 1100 1100 5 1100 1100 5 1100 1107 5 1100 1205 5 1100 1100 6 1100 1100 6 1100 1104 6 1100 1107 6 1100 68 6 1100 .I 1101 .T The Place of Logical Design and Switching Theory In The Computer Curriculum .B CACM April, 1964 .A Muller, D. E. .N CA640407 JB March 10, 1978 1:49 AM .X 1101 5 1101 1101 5 1101 1101 5 1101 .I 1102 .T Mechanical Languages: A Course Specification .B CACM April, 1964 .A Gorn, S. .N CA640406 JB March 10, 1978 1:49 AM .X 249 4 1102 254 4 1102 272 4 1102 1024 4 1102 1050 4 1102 1051 4 1102 1051 4 1102 1102 4 1102 1102 4 1102 1102 4 1102 1102 4 1102 1102 4 1102 1109 4 1102 1132 4 1102 1140 4 1102 1142 4 1102 1188 4 1102 1306 4 1102 1390 4 1102 1464 4 1102 1486 4 1102 1491 4 1102 1549 4 1102 1549 4 1102 1706 4 1102 1767 4 1102 1781 4 1102 1781 4 1102 1787 4 1102 1826 4 1102 1878 4 1102 1945 4 1102 1949 4 1102 321 4 1102 378 4 1102 378 4 1102 2059 4 1102 2060 4 1102 2126 4 1102 2155 4 1102 2168 4 1102 435 4 1102 437 4 1102 463 4 1102 483 4 1102 491 4 1102 2719 4 1102 2723 4 1102 2732 4 1102 2838 4 1102 2842 4 1102 2855 4 1102 2879 4 1102 560 4 1102 583 4 1102 3008 4 1102 3073 4 1102 3077 4 1102 3080 4 1102 3106 4 1102 627 4 1102 627 4 1102 631 4 1102 632 4 1102 642 4 1102 644 4 1102 653 4 1102 680 4 1102 731 4 1102 761 4 1102 762 4 1102 762 4 1102 763 4 1102 798 4 1102 106 4 1102 123 4 1102 140 4 1102 919 4 1102 949 4 1102 989 4 1102 196 5 1102 1102 5 1102 1102 5 1102 1102 5 1102 209 5 1102 210 5 1102 406 5 1102 483 5 1102 .I 1103 .T Logic for the Computer Sciences .B CACM April, 1964 .A Korfhage, R. R. .N CA640405 JB March 10, 1978 1:50 AM .X 1103 5 1103 1103 5 1103 1103 5 1103 .I 1104 .T An Undergraduate Curriculum in Numerical Analysis .B CACM April, 1964 .A Forsythe, G. E. .N CA640404 JB March 10, 1978 1:51 AM .X 1104 5 1104 1104 5 1104 1104 5 1104 1205 5 1104 1100 6 1104 1104 6 1104 1107 6 1104 68 6 1104 .I 1105 .T On Introducing Digital Computing .B CACM April, 1964 .A Arden, B. W. .N CA640403 JB March 10, 1978 1:53 AM .X 1046 4 1105 1105 4 1105 1139 4 1105 1140 4 1105 1234 4 1105 1263 4 1105 1265 4 1105 1496 4 1105 1781 4 1105 1824 4 1105 2126 4 1105 2546 4 1105 464 4 1105 584 4 1105 631 4 1105 653 4 1105 680 4 1105 763 4 1105 795 4 1105 799 4 1105 945 4 1105 1105 5 1105 1105 5 1105 1105 5 1105 404 5 1105 .I 1106 .T Programming of Digital Computers .B CACM April, 1964 .A Perlis, A. J. .N CA640402 JB March 10, 1978 1:54 AM .X 1106 5 1106 1106 5 1106 1106 5 1106 .I 1107 .T Computers and Education .B CACM April, 1964 .A Keenan, T. A. .N CA640401 JB March 10, 1978 1:54 AM .X 1107 4 1107 1205 4 1107 1100 5 1107 1107 5 1107 1107 5 1107 1107 5 1107 1205 5 1107 1100 6 1107 1104 6 1107 1107 6 1107 68 6 1107 .I 1108 .T Digital Data Processor for Tracking the Partially Illuminated Moon* .W A study of lunar tracking techniques and fabrication of a breadboard to assess the feasibility of the best technique selected was conducted to define a tracking system for observation of the sight line to the center of a partially illuminated moon. The data processing portion of the system is presented in detail and then described in general are the operation of the tracker head assembly for data readout, the operation of the entire system and the effect data processing considerations have on the design of the tracker system. The system basically consists of an optical sensor, digital computer and tracker drive mechanism. The three system units, connected in cascade, comprise the control loop. For this application, an optical telescope with a radial mechanical scanning mechanism was used that read out lunar sight line measurement information. This information is sequentially read into a special purpose digital computer that extracts the measurements and computes the error signals that drive the tracker to the appropriate attitude. .B CACM March, 1964 .A Wilcox, H. J. .N CA640324 JB March 10, 1978 2:02 AM .X 1108 5 1108 1108 5 1108 1108 5 1108 .I 1109 .T Conversion of a Power to a Series of Chebyshev Polynomials* .W Even slowly convergent power series can be rearranged as series in Chebyshev polynomials if appropriate sequence transformations are used in evaluating the coefficients. The method is illustrated by computing the coefficients for the expansion of the logarithm and dilogarithm. .B CACM March, 1964 .A Thacher Jr., H. C. .N CA640323 JB March 10, 1978 2:05 AM .X 249 4 1109 254 4 1109 272 4 1109 1102 4 1109 1109 4 1109 1140 4 1109 1188 4 1109 1306 4 1109 1464 4 1109 1491 4 1109 1767 4 1109 1781 4 1109 1787 4 1109 1949 4 1109 321 4 1109 2059 4 1109 2126 4 1109 435 4 1109 437 4 1109 463 4 1109 483 4 1109 491 4 1109 2732 4 1109 560 4 1109 583 4 1109 3073 4 1109 627 4 1109 631 4 1109 632 4 1109 642 4 1109 644 4 1109 653 4 1109 680 4 1109 761 4 1109 762 4 1109 763 4 1109 123 4 1109 140 4 1109 919 4 1109 989 4 1109 196 5 1109 1109 5 1109 1109 5 1109 1109 5 1109 .I 1110 .T A Fourier Series Method for the Numerical Solution of a Class of Parabolic Partial Differential Equations* .W A Fourier series method is described which, when applied to a certain class of parabolic partial differential equations, reduces the problem to a system of ordinary differential equations. An application is given for which the method shows a considerable advantage over conventional finite difference methods. .B CACM March, 1964 .A Forrington, C. V. D. .N CA640322 JB March 10, 1978 2:08 AM .X 1110 5 1110 1110 5 1110 1110 5 1110 .I 1111 .T A Class of Iterative Techniques For the Factorization of Polynomials* .W A method of iteration is developed in terms of a function of somewhat arbitrary character. Sufficient conditions are given for convergence of the process, yielding factors of arbitrary degree for polynomials in one variable. Both Lin's method and Newton's method occur as special cases. .B CACM March, 1964 .A Luther, H. A. .N CA640321 JB March 10, 1978 2:10 AM .X 1111 4 1111 1111 5 1111 1111 5 1111 1111 5 1111 894 5 1111 .I 1112 .T A Technique for Computer Detection and Correction of Spelling Errors* .W The method described assumes that a word which cannot be found in a dictionary has at most one error, which might be a wrong, missing or extra letter or a single transposition. The unidentified input word is compared to the dictionary again, testing each time to see if the words match-assuming one of these errors occurred. During a test run on garbled text, correct identifications were made for over 95 percent of these error types. .B CACM March, 1964 .A Damerau, F. J. .N CA640320 JB March 10, 1978 2:21 AM .X 1112 4 1112 1592 4 1112 2111 4 1112 2339 4 1112 440 4 1112 1112 5 1112 1112 5 1112 1112 5 1112 1592 5 1112 2111 5 1112 2339 5 1112 619 5 1112 830 6 1112 982 6 1112 1112 6 1112 1112 6 1112 1112 6 1112 1592 6 1112 1592 6 1112 440 6 1112 619 6 1112 619 6 1112 619 6 1112 .I 1113 .T Computer-Made Perspective Movies as a Scientific and Communication Tool* .W It is easy to program the basic transformation required for a perspective drawing. This fact plus the advent of high speed microfilm printers such as the General Dynamics Electronics S-C 4020 makes possible perspective movies as the direct output from a computer. The programming of such a movie is briefly described for studying the angular motions of a satellite containing an attitude control system. In the movie, a domino-shaped box represents the satellite and a sphere with circles of latitude and longitude represents the earth. The cost was approximately three to eight minutes of IBM 7090 time per one minute of movie. .B CACM March, 1964 .A Zajac, E. E. .N CA640319 JB March 10, 1978 2:26 AM .X 1113 5 1113 1113 5 1113 1113 5 1113 .I 1114 .T Generating a Canonical Prefix Encoding* .W Computer programs for generating a minimum-redundancy exhaustive prefix encoding are described. One program generates a Huffman frequency tree, another determines the structure functions of an encoding, and a third program assigns codes. .B CACM March, 1964 .A Schwartz, E. S. Kallick, B. .N CA640318 JB March 10, 1978 2:28 AM .X 1114 5 1114 1114 5 1114 1114 5 1114 2346 5 1114 2459 5 1114 1114 6 1114 1114 6 1114 .I 1115 .T Randomized Binary Searching With Tree Structure .W A more efficient method of using tree structures is proposed, which utilizers both plus and minus branches in the search path. Very significant gains result when the search key includes alphabetic characters. .B CACM March, 1964 .A Clampett Jr., H. A. .N CA640317 JB March 10, 1978 2:30 AM .X 1115 5 1115 1115 5 1115 1115 5 1115 1935 5 1115 849 6 1115 1115 6 1115 .I 1116 .T Tests on a Computer Method for Constructing School Timetables* .W A previously proposed computer method for constructing timetables, based on an iteration involving Boolean matrices, is described. In limited tests the method has successfully produced timetables on every trial. References are given which relate the timetable problem to theorems on matrices of zeros and ones, and to theorems on bipartite graphs. Some problems of applying the method to constructing timetables in real situations are noted. .B CACM March, 1964 .A Csima, J. Gotlieb, C. C. .N CA640316 JB March 10, 1978 2:34 AM .X 1116 5 1116 1116 5 1116 1116 5 1116 1367 5 1116 2772 5 1116 2787 5 1116 1116 6 1116 1116 6 1116 1116 6 1116 1429 6 1116 1429 6 1116 .I 1117 .T Polyphase Sorting With Overlapped Rewind* .W A variation of the polyphase merge technique of sorting is described which permits one tape at a time to be rewound while the merge is continued on the remaining tapes. The result is the overlapping of a major portion of the rewind time. The technique should be considered whenever a sort is written to operate on five or more tapes that cannot be read backwards. The savings of the overlap method appear to increase as the number of available tapes is increased. .B CACM March, 1964 .A McAlester, R. L. .N CA640315 JB March 10, 1978 2:38 AM .X 1117 4 1117 1117 4 1117 1117 4 1117 2017 4 1117 2017 4 1117 2146 4 1117 2146 4 1117 677 4 1117 860 4 1117 861 4 1117 1117 5 1117 1117 5 1117 1117 5 1117 636 5 1117 862 5 1117 861 5 1117 .I 1118 .T FORTRAN Subroutines for Time Series Data Reduction* .B CACM March, 1964 .A MacGowan, R. A. .N CA640314 JB March 10, 1978 2:39 AM .X 1118 4 1118 1118 4 1118 826 4 1118 948 4 1118 942 5 1118 1118 5 1118 1118 5 1118 1118 5 1118 826 5 1118 .I 1119 .T An Open Letter to X3.4.3 (FORTRAN Standards -- American Association) .B CACM March, 1964 .N CA640313 JB March 10, 1978 2:40 AM .X 1119 5 1119 1119 5 1119 1119 5 1119 .I 1120 .T "ALCOR Group Representations of ALGOL Symbols," Comm. ACM 6 (1963), 597-599. (Corrigenda) .B CACM March, 1964 .N CA640312 JB March 10, 1978 2:42 AM .X 1120 5 1120 1120 5 1120 1120 5 1120 .I 1121 .T Comments on "A Continued Operation Notation"* .W This note is intended to clarify and correct several points in a recent paper describing some notations for symbol manipulation by M.P. Barnett [Comm. ACM 6(August, 1963)]. .B CACM March, 1964 .A Barnett, M. P. Gerard, J. M. Sambles, A. W. .N CA640310 JB March 10, 1978 2:45 AM .X 1062 4 1121 1121 4 1121 1121 4 1121 1139 4 1121 1265 4 1121 1781 4 1121 659 4 1121 720 4 1121 759 4 1121 964 4 1121 1121 5 1121 1121 5 1121 1121 5 1121 464 5 1121 759 5 1121 .I 1122 .T A Note on Some Compiling Algorithms .W Two compiling generators for arithmetic expressions are discussed: one presently in use in an experimental compiler, and an improvement suggested by K. Speierman of Burroughs. .B CACM March, 1964 .A Anderson, J. P. .N CA640309 JB March 10, 1978 3:33 AM .X 1122 5 1122 1122 5 1122 1122 5 1122 1551 5 1122 1945 5 1122 823 6 1122 914 6 1122 915 6 1122 917 6 1122 984 6 1122 989 6 1122 990 6 1122 1012 6 1122 1084 6 1122 1098 6 1122 1122 6 1122 1122 6 1122 1138 6 1122 1139 6 1122 1141 6 1122 1200 6 1122 1223 6 1122 1265 6 1122 1336 6 1122 1396 6 1122 1455 6 1122 1477 6 1122 1487 6 1122 1491 6 1122 1496 6 1122 483 6 1122 584 6 1122 669 6 1122 680 6 1122 763 6 1122 .I 1123 .T Gauss (Algorithm 209) .B CACM March, 1964 .A Gladfelter, G. W. .N CA640308 JB March 10, 1978 3:34 AM .X 1123 5 1123 1123 5 1123 1123 5 1123 .I 1124 .T Matrix Division (Algorithm 197) .B CACM March, 1964 .A Wells, M. .N CA640307 JB March 10, 1978 3:35 AM .X 1124 5 1124 1124 5 1124 1124 5 1124 .I 1125 .T Syminv2 (Algorithm 150) .B CACM March, 1964 .A Naur, P. .N CA640306 JB March 10, 1978 3:36 AM .X 1125 5 1125 1125 5 1125 1125 5 1125 .I 1126 .T ERF (Algorithm 123) .B CACM March, 1964 .A Barton, S. P. Wagner, J. F. .N CA640305 JB March 10, 1978 3:37 AM .X 1126 5 1126 1126 5 1126 1126 5 1126 1583 5 1126 831 6 1126 967 6 1126 1126 6 1126 707 6 1126 .I 1127 .T Tridiagonal Matrix (Algorithm 122) .B CACM March, 1964 .A Naur, P. .N CA640304 JB March 10, 1978 3:39 AM .X 1127 5 1127 1127 5 1127 1127 5 1127 .I 1128 .T Evaluation of Determinant (Algorithm 41) .B CACM March, 1964 .A Rotenberg, L. J. .N CA640303 JB March 10, 1978 3:40 AM .X 1128 5 1128 1128 5 1128 1128 5 1128 1319 5 1128 152 6 1128 1128 6 1128 .I 1129 .T Incomplete Beta Function Ratios (Algorithm 222) .B CACM March, 1964 .A Gautschi, W. .N CA640302 JB March 10, 1978 3:41 AM .X 1129 5 1129 1129 5 1129 1129 5 1129 .I 1130 .T Gamma Function (Althm 221) .B CACM March, 1964 .A Gautschi, W. .N CA640301 JB March 10, 1978 3:42 AM .X 1023 5 1130 1130 5 1130 1130 5 1130 1130 5 1130 1222 5 1130 1130 6 1130 1130 6 1130 245 6 1130 310 6 1130 .I 1131 .T On Context and Ambiguity in Parsing* .B CACM February, 1964 .A Ross, D. T. .N CA640212 JB March 10, 1978 3:43 AM .X 1131 5 1131 1131 5 1131 1131 5 1131 1781 5 1131 123 6 1131 196 6 1131 919 6 1131 990 6 1131 1007 6 1131 1046 6 1131 1131 6 1131 1139 6 1131 1140 6 1131 1149 6 1131 1198 6 1131 1215 6 1131 1223 6 1131 1265 6 1131 1303 6 1131 1323 6 1131 1358 6 1131 1366 6 1131 1421 6 1131 1460 6 1131 1462 6 1131 1463 6 1131 1467 6 1131 1468 6 1131 1477 6 1131 1491 6 1131 1496 6 1131 1531 6 1131 1535 6 1131 1565 6 1131 1601 6 1131 1602 6 1131 1613 6 1131 1614 6 1131 1626 6 1131 1641 6 1131 1787 6 1131 1788 6 1131 205 6 1131 224 6 1131 249 6 1131 288 6 1131 316 6 1131 381 6 1131 398 6 1131 11 6 1131 404 6 1131 410 6 1131 463 6 1131 464 6 1131 483 6 1131 3184 6 1131 3188 6 1131 584 6 1131 600 6 1131 680 6 1131 691 6 1131 763 6 1131 799 6 1131 .I 1132 .T An Extension to ALGOL for Manipulating Formulae* .B CACM February, 1964 .A Perlis, A. J. Iturriaga, R. .N CA640211 JB March 10, 1978 3:45 AM .X 1024 4 1132 1051 4 1132 1086 4 1132 1102 4 1132 1132 4 1132 1132 4 1132 1234 4 1132 1263 4 1132 1265 4 1132 1270 4 1132 1323 4 1132 1358 4 1132 1379 4 1132 1380 4 1132 1390 4 1132 1453 4 1132 1464 4 1132 1484 4 1132 1486 4 1132 1491 4 1132 1498 4 1132 1549 4 1132 1613 4 1132 1614 4 1132 1706 4 1132 1781 4 1132 1825 4 1132 1826 4 1132 1860 4 1132 1878 4 1132 378 4 1132 2060 4 1132 2083 4 1132 2155 4 1132 2168 4 1132 2178 4 1132 2179 4 1132 2252 4 1132 2325 4 1132 2341 4 1132 2546 4 1132 2645 4 1132 2652 4 1132 2684 4 1132 2719 4 1132 2723 4 1132 2838 4 1132 2842 4 1132 2842 4 1132 2855 4 1132 2879 4 1132 2929 4 1132 2934 4 1132 3069 4 1132 3077 4 1132 3080 4 1132 3106 4 1132 627 4 1132 669 4 1132 679 4 1132 691 4 1132 761 4 1132 106 4 1132 949 4 1132 989 4 1132 1132 5 1132 1132 5 1132 1132 5 1132 1214 5 1132 210 5 1132 1396 5 1132 3184 5 1132 964 6 1132 1028 6 1132 1029 6 1132 1083 6 1132 1132 6 1132 1132 6 1132 1214 6 1132 1278 6 1132 1334 6 1132 1365 6 1132 1386 6 1132 1387 6 1132 1388 6 1132 1392 6 1132 1393 6 1132 1394 6 1132 1395 6 1132 1396 6 1132 1397 6 1132 1496 6 1132 284 6 1132 407 6 1132 3199 6 1132 3200 6 1132 3201 6 1132 3202 6 1132 3203 6 1132 3204 6 1132 561 6 1132 730 6 1132 731 6 1132 .I 1133 .T A Programming Package for Some General Modes of Arithmetic* .B CACM February, 1964 .A Brooker, R. A. .N CA640210 JB March 10, 1978 3:46 AM .X 1133 5 1133 1133 5 1133 1133 5 1133 .I 1134 .T Some Effects of the 6600 Computer on Language Structures* .W The problem of compiling efficient 6600 codes prompted the development of an intermediate language reflecting the structure of the machine, that is more easily manipulated in improving object program efficiency. The subject of this paper is the intermediate language and methods of manipulating it. Compilations of a series of arithmetic statements are discussed. It is assumed that all functions and exponentials have been removed from these statements, and replaced by simple variables. For purposes of simplicity the treatment of subscripts is ignored. A simplified 6600 structure is presented to illustrate the compiling method. Several assumptions are made for purposes of simplification, although there are cases in which the assumptions are violated in the actual machine. .B CACM February, 1964 .A Allard, R. W. Wolf, K. A. Zemlin, R. A. .N CA640209 JB March 10, 1978 3:54 AM .X 1134 4 1134 1134 4 1134 1134 4 1134 1141 4 1134 1179 4 1134 1861 4 1134 364 4 1134 405 4 1134 438 4 1134 561 4 1134 44 4 1134 83 4 1134 1134 5 1134 1134 5 1134 1134 5 1134 1613 5 1134 1947 5 1134 408 5 1134 17 5 1134 77 5 1134 987 6 1134 1086 6 1134 1134 6 1134 1134 6 1134 1223 6 1134 1248 6 1134 1453 6 1134 399 6 1134 3184 6 1134 .I 1135 .T A General Business-Oriented Language Based on Decision Expressions* .W The structure of a digital compute programming language which covers a wide class of business and file processing applications is presented. Such a structure, based on identifying and incorporating into a compiler the aspects common to all processes of such class, permits writing extremely compact programs, even for comparatively complex applications, in terms of tables of control expressions which express only information characteristic of the particular application. Furthermore,local changes of a process (e.g. changes affecting only one of the output files involved) can be effected by local modifications in the program (e.g. modification of only one entry of the tables). This structure also allows for inexpensive preparation of loading-speed compilers which translate the source programs into efficient machine codes. The approach adopted here departs from conventional mechanical language design philosophies. It stresses the structural analysis of the class of processes to be represented in the languages, as opposed to emphasizing formal (i.e., contents-independent) syntactical definitions. It relies exclusively on nonprocedural representation of process as sets (tables) of relations between data and results (there are no control statements such as GO TO, etc.), instead of using procedure descriptions (which are one-to-one translations of flowcharts). Here an invariant pattern of procedure is identified as characteristic of the class of all batch file processes. This new philosophy has the potential to overcome well-known deficiencies of other business-oriented languages and fully meets the requirements set by CODASYL for such languages, including machine-independence. .B CACM February, 1964 .A Lombardi, L. A. .N CA640208 JB March 10, 1978 4:08 AM .X 1135 4 1135 1136 4 1135 493 4 1135 2710 4 1135 2765 4 1135 2888 4 1135 2906 4 1135 729 4 1135 1135 5 1135 1135 5 1135 1135 5 1135 1959 5 1135 616 5 1135 1135 6 1135 .I 1136 .T Beginnings of a Theory of Information Handling* .B CACM February, 1964 .A Steel Jr., T. B. .N CA640207 JB March 10, 1978 4:10 AM .X 1135 4 1136 1136 4 1136 1136 4 1136 1136 4 1136 493 4 1136 2710 4 1136 2765 4 1136 2888 4 1136 2906 4 1136 729 4 1136 1136 5 1136 1136 5 1136 1136 5 1136 493 5 1136 616 5 1136 657 5 1136 .I 1137 .T A Format Language* .B CACM February, 1964 .A Perlis, A. J. .N CA640206 JB March 10, 1978 4:15 AM .X 1086 5 1137 1137 5 1137 1137 5 1137 1137 5 1137 1496 5 1137 1137 6 1137 1137 6 1137 1141 6 1137 404 6 1137 3184 6 1137 .I 1138 .T Formalism in Programming Languages* .B CACM February, 1964 .A Iverson, K. E. .N CA640205 JB March 10, 1978 4:24 AM .X 1138 5 1138 1138 5 1138 1138 5 1138 1945 5 1138 823 6 1138 914 6 1138 915 6 1138 917 6 1138 984 6 1138 989 6 1138 990 6 1138 1012 6 1138 1084 6 1138 1098 6 1138 1122 6 1138 1138 6 1138 1139 6 1138 1141 6 1138 1200 6 1138 1223 6 1138 1265 6 1138 1336 6 1138 1396 6 1138 1455 6 1138 1477 6 1138 1487 6 1138 1491 6 1138 1496 6 1138 483 6 1138 584 6 1138 669 6 1138 680 6 1138 763 6 1138 .I 1139 .T FORTRAN IV as a Syntax Language* .B CACM February, 1964 .A Leavenworth, B. M. .N CA640204 JB March 10, 1978 4:53 AM .X 267 4 1139 1046 4 1139 1062 4 1139 1105 4 1139 1121 4 1139 1139 4 1139 1139 4 1139 1139 4 1139 1139 4 1139 1139 4 1139 1139 4 1139 1140 4 1139 1141 4 1139 1215 4 1139 1223 4 1139 1234 4 1139 1263 4 1139 1265 4 1139 1265 4 1139 1265 4 1139 1496 4 1139 1647 4 1139 1665 4 1139 1781 4 1139 1781 4 1139 1781 4 1139 1787 4 1139 1792 4 1139 1824 4 1139 1947 4 1139 364 4 1139 2126 4 1139 405 4 1139 2546 4 1139 438 4 1139 464 4 1139 556 4 1139 584 4 1139 3185 4 1139 631 4 1139 653 4 1139 680 4 1139 720 4 1139 759 4 1139 763 4 1139 763 4 1139 763 4 1139 795 4 1139 799 4 1139 799 4 1139 945 4 1139 1139 5 1139 1139 5 1139 1139 5 1139 224 5 1139 1612 5 1139 1781 5 1139 1945 5 1139 399 5 1139 404 5 1139 438 5 1139 464 5 1139 631 5 1139 823 6 1139 123 6 1139 196 6 1139 914 6 1139 915 6 1139 917 6 1139 919 6 1139 984 6 1139 989 6 1139 990 6 1139 990 6 1139 1007 6 1139 1012 6 1139 1046 6 1139 1084 6 1139 1098 6 1139 1122 6 1139 1131 6 1139 1138 6 1139 1139 6 1139 1139 6 1139 1139 6 1139 1140 6 1139 1141 6 1139 1149 6 1139 1198 6 1139 1200 6 1139 1215 6 1139 1223 6 1139 1223 6 1139 1265 6 1139 1265 6 1139 1303 6 1139 1323 6 1139 1336 6 1139 1358 6 1139 1366 6 1139 1396 6 1139 1421 6 1139 1455 6 1139 1460 6 1139 1462 6 1139 1463 6 1139 1467 6 1139 1468 6 1139 1477 6 1139 1477 6 1139 1487 6 1139 1491 6 1139 1491 6 1139 1496 6 1139 1496 6 1139 1531 6 1139 1535 6 1139 1565 6 1139 1601 6 1139 1602 6 1139 1613 6 1139 1614 6 1139 1626 6 1139 1641 6 1139 1787 6 1139 1788 6 1139 205 6 1139 224 6 1139 249 6 1139 288 6 1139 316 6 1139 381 6 1139 398 6 1139 11 6 1139 404 6 1139 410 6 1139 463 6 1139 464 6 1139 483 6 1139 483 6 1139 3184 6 1139 3188 6 1139 584 6 1139 584 6 1139 600 6 1139 669 6 1139 680 6 1139 680 6 1139 691 6 1139 763 6 1139 763 6 1139 799 6 1139 .I 1140 .T "Structural Connections" in Formal Language* .B CACM February, 1964 .A Irons, E. T. .N CA640203 JB March 10, 1978 4:55 AM .X 249 4 1140 254 4 1140 272 4 1140 1046 4 1140 1102 4 1140 1105 4 1140 1109 4 1140 1139 4 1140 1140 4 1140 1140 4 1140 1188 4 1140 1234 4 1140 1263 4 1140 1265 4 1140 1306 4 1140 1464 4 1140 1491 4 1140 1496 4 1140 1767 4 1140 1781 4 1140 1781 4 1140 1787 4 1140 1824 4 1140 1949 4 1140 321 4 1140 2059 4 1140 2126 4 1140 2126 4 1140 2546 4 1140 435 4 1140 437 4 1140 463 4 1140 464 4 1140 483 4 1140 491 4 1140 2732 4 1140 560 4 1140 583 4 1140 584 4 1140 3073 4 1140 627 4 1140 631 4 1140 631 4 1140 632 4 1140 642 4 1140 644 4 1140 653 4 1140 653 4 1140 680 4 1140 680 4 1140 761 4 1140 762 4 1140 763 4 1140 763 4 1140 795 4 1140 799 4 1140 123 4 1140 140 4 1140 919 4 1140 945 4 1140 989 4 1140 196 5 1140 1140 5 1140 1140 5 1140 1140 5 1140 1491 5 1140 1781 5 1140 2061 5 1140 404 5 1140 123 6 1140 196 6 1140 196 6 1140 919 6 1140 990 6 1140 1007 6 1140 1046 6 1140 1131 6 1140 1139 6 1140 1140 6 1140 1140 6 1140 1140 6 1140 1141 6 1140 1149 6 1140 1198 6 1140 1215 6 1140 1223 6 1140 1265 6 1140 1303 6 1140 1303 6 1140 1323 6 1140 1358 6 1140 1366 6 1140 1421 6 1140 1460 6 1140 1462 6 1140 1463 6 1140 1467 6 1140 1468 6 1140 1477 6 1140 1477 6 1140 1491 6 1140 1491 6 1140 1496 6 1140 1531 6 1140 1535 6 1140 1565 6 1140 1601 6 1140 1602 6 1140 1613 6 1140 1614 6 1140 1626 6 1140 1641 6 1140 1787 6 1140 1788 6 1140 205 6 1140 1825 6 1140 224 6 1140 249 6 1140 288 6 1140 316 6 1140 381 6 1140 398 6 1140 11 6 1140 404 6 1140 410 6 1140 463 6 1140 464 6 1140 483 6 1140 3184 6 1140 3184 6 1140 3188 6 1140 584 6 1140 600 6 1140 680 6 1140 691 6 1140 729 6 1140 763 6 1140 773 6 1140 799 6 1140 .I 1141 .T Bounded Context Syntactic Analysis .B CACM February, 1964 .A Floyd, R. W. .N CA640202 JB March 10, 1978 4:56 AM .X 267 4 1141 1134 4 1141 1139 4 1141 1141 4 1141 1141 4 1141 1215 4 1141 1223 4 1141 1647 4 1141 1781 4 1141 1787 4 1141 1792 4 1141 364 4 1141 364 4 1141 405 4 1141 405 4 1141 438 4 1141 438 4 1141 561 4 1141 44 4 1141 763 4 1141 1141 5 1141 1141 5 1141 1141 5 1141 224 5 1141 1496 5 1141 1683 5 1141 1768 5 1141 1787 5 1141 1945 5 1141 2061 5 1141 77 5 1141 823 6 1141 196 6 1141 914 6 1141 915 6 1141 917 6 1141 984 6 1141 989 6 1141 990 6 1141 1012 6 1141 1084 6 1141 1098 6 1141 1122 6 1141 1137 6 1141 1138 6 1141 1139 6 1141 1140 6 1141 1141 6 1141 1141 6 1141 1141 6 1141 1141 6 1141 1141 6 1141 1141 6 1141 1200 6 1141 1215 6 1141 1223 6 1141 1265 6 1141 1265 6 1141 1336 6 1141 1396 6 1141 1455 6 1141 1477 6 1141 1477 6 1141 1487 6 1141 1491 6 1141 1491 6 1141 1491 6 1141 1491 6 1141 1496 6 1141 1496 6 1141 1781 6 1141 1781 6 1141 1825 6 1141 224 6 1141 404 6 1141 483 6 1141 584 6 1141 669 6 1141 680 6 1141 763 6 1141 763 6 1141 773 6 1141 799 6 1141 .I 1142 .T An Extension of ALGOL-Like Languages .B CACM February, 1964 .A Rose, G. F. .N CA640201 JB March 10, 1978 4:57 AM .X 1102 4 1142 1142 4 1142 1781 4 1142 1945 4 1142 762 4 1142 949 4 1142 1142 5 1142 1142 5 1142 1142 5 1142 483 5 1142 .I 1143 .T Analysis of Decay-Type Data* .W A comparative study has been made of a variety of numerical techniques for fitting experimental data of the decay type by forms involving the sums of exponentials. Statistical errors of the fitted parameters are also calculated. These methods have been applied to artificially-generated sets of data as well as to the results of experiments with radioactive tracers on both human and animal subjects. Results show that the values of the fitted parameters are very sensitive to variations in the fitting procedure. Therefore great care very sensitive to variations in the fitting procedure. Therefore great care must be exercised in identifying such values with physical constants. Although the values of functions derived from these fitted parameters which can definitely be associated with physical entities are generally more stable under variations in the fitting techniques, error bounds can be so large that no great confidence can be placed even in them. It would therefore appear best to select a uniform technique both for running the experiments and for analyzing the data, and then to consider as significant only relative results between one subject and the next. .B CACM January, 1964 .A Worsley, B. H. .N CA640112 JB March 10, 1978 5:11 AM .X 1143 5 1143 1143 5 1143 1143 5 1143 .I 1144 .T Digital Computer Determination of Alpha Source Activity .W A technique is described for determining the activity and homogeneity of an alpha source. It is believed that the technique, using a digital computer, has many uses and applications in the field of nuclear physics. The technique involves computer manipulation of the digital image of the nuclear source. Experimental details are given. .B CACM January, 1964 .A Robbins, D. Taylor, W. E. .N CA640111 JB March 10, 1978 5:14 AM .X 1144 5 1144 1144 5 1144 1144 5 1144 .I 1145 .T GIT-A Heuristic Program for Testing Pairs of Directed Line Graphs for Isomorphism* .W Given a pair of directed line graphs, the problem of ascertaining whether or not they are isomorphic is one for which no efficient algorithmic solution is known. Since a straightforward enumerative algorithm might require 40 years of running time on a very high speed computer in order to compare two 15-node graphs, a more sophisticated approach seems called for. The situation is similar to that prevailing in areas such as game-playing and theorem-proving, where practical algorithms are unknown (for the interesting cases), but where various practical though only partially successful techniques are available. Git-Graph Isomorphism Tester-incorporates a variety of processes that attempt to narrow down the search for an isomorphism, or to demonstrate that none exists. No one scheme is relied upon exclusively for a solution, and the program is designed to avoid excessive computation along fruitless lines. GIT has been written in the COMIT language and successfully tested on the IBM 7090. .B CACM January, 1964 .A Unger, S. H. .N CA640110 JB March 10, 1978 5:24 AM .X 1145 4 1145 1145 5 1145 1145 5 1145 1145 5 1145 1504 5 1145 3040 5 1145 655 5 1145 1145 6 1145 1145 6 1145 .I 1146 .T An Efficient Composite Formula for Multidimensional Quadrature .W A (2s+1)-point second-degree quadrature formula for integration over an s-dimensional hyper-rectangle is presented. All but one of the points lie on the surface with weights of opposite sign attached to points on opposite faces. When a large volume is subdivided into congruent rectangular subdivisions, only one point is required in each interior subdivision to achieve second-degree accuracy. .B CACM January, 1964 .A Thacher Jr., H. C. .N CA640109 JB March 10, 1978 5:28 AM .X 1146 4 1146 1146 5 1146 1146 5 1146 1146 5 1146 386 5 1146 .I 1147 .T On the Numerical Solution of Boundary Value Problems for Linear Ordinary Differential Equations* .W A numerical method is presented for the solution of boundary value problems involving linear ordinary differential equations. The method described is noniterative and makes use of any one-step numerical integration scheme to reduce the problem from one of boundary values to one of initial values. Comments are made concerning some numerical results of applying the method to a specific problem. In addition an extension of the algorithm described to more general problems is discussed. .B CACM January, 1964 .A Day, J. T. Collins II, G. W. .N CA640108 JB March 10, 1978 5:32 AM .X 1147 5 1147 1147 5 1147 1147 5 1147 1274 5 1147 1147 6 1147 .I 1148 .T An Example in "Significant-Digit" Arithmetic* .W Different methods of handling the summing process for the geometric series are shown to give results indicating widely differing significances when carried out in a machine incorporating "significant-digit" arithmetic. .B CACM January, 1964 .A Miller, R. H. .N CA640107 JB March 10, 1978 5:34 AM .X 1148 4 1148 1148 5 1148 1148 5 1148 1148 5 1148 85 5 1148 3131 5 1148 893 6 1148 1148 6 1148 .I 1149 .T GARGOYLE , A Language for Compiler Writing* .B CACM January, 1964 .A Garwick, J. V. .N CA640106 JB March 10, 1978 5:35 AM .X 1149 5 1149 1149 5 1149 1149 5 1149 1781 5 1149 123 6 1149 196 6 1149 919 6 1149 990 6 1149 1007 6 1149 1046 6 1149 1131 6 1149 1139 6 1149 1140 6 1149 1149 6 1149 1198 6 1149 1215 6 1149 1223 6 1149 1265 6 1149 1303 6 1149 1323 6 1149 1358 6 1149 1366 6 1149 1421 6 1149 1460 6 1149 1462 6 1149 1463 6 1149 1467 6 1149 1468 6 1149 1477 6 1149 1491 6 1149 1496 6 1149 1531 6 1149 1535 6 1149 1565 6 1149 1601 6 1149 1602 6 1149 1613 6 1149 1614 6 1149 1626 6 1149 1641 6 1149 1787 6 1149 1788 6 1149 205 6 1149 224 6 1149 249 6 1149 288 6 1149 316 6 1149 381 6 1149 398 6 1149 11 6 1149 404 6 1149 410 6 1149 463 6 1149 464 6 1149 483 6 1149 3184 6 1149 3188 6 1149 584 6 1149 600 6 1149 680 6 1149 691 6 1149 763 6 1149 799 6 1149 .I 1150 .T A Fortran Post-Mortem Procedure .B CACM January, 1964 .A Kahan, W. Leppik, J. J. .N CA640104 JB March 10, 1978 5:37 AM .X 1150 5 1150 1150 5 1150 1150 5 1150 .I 1151 .T A Note on Multiplying Boolean Matrices II .B CACM January, 1964 .A Comstock, D. R. .N CA640103 JB March 10, 1978 5:38 AM .X 1151 4 1151 1265 4 1151 2769 4 1151 1151 5 1151 1151 5 1151 1151 5 1151 635 5 1151 .I 1152 .T Floating-Point Arithmetic with 84-Bit Numbers .W A classic and straightforward technique is presented which is not limited to the size or type of number representation used or multiple precision arithmetic. .B CACM January, 1964 .A Gregory, R. T. Raney, J. L. .N CA640102 JB March 10, 1978 5:41 AM .X 1152 5 1152 1152 5 1152 1152 5 1152 1294 5 1152 1152 6 1152 .I 1153 .T A Fast Procedure for Generating Normal Random Variables* .W A technique for generating normally distributed random numbers is described. It is faster than those currently in general use and is readily applicable to both binary and decimal computers. .B CACM January, 1964 .A Marsaglia, G. MacLaren, M. D. Bray, T. A. .N CA640101 JB March 10, 1978 5:43 AM .X 1073 4 1153 1153 4 1153 940 5 1153 1073 5 1153 1153 5 1153 1153 5 1153 1153 5 1153 2137 5 1153 2276 5 1153 940 6 1153 1073 6 1153 1153 6 1153 1153 6 1153 1153 6 1153 .I 1154 .T Multi-Tape and Infinite-State Automata -- A Survey .W A survey of machines which are more powerful than finite automata and less powerful than general Turing machines is presented. It is felt that the machines in this category are as closely related to digital computers as either the finite automata or the unrestricted Turing machines. Intermediate machines can be created by adjoining on infinite-state memory to a finite-state machine and then performing any or all of the following: (1) restrict the manner in which the unbounded portion of the memory can be accessed, (2) bound the number of steps allowed for a computation by some increasing recursive function of the length of the input, (3) restrict the total amount of memory available in the same manner. Examples from all three classes and their properties are discussed. .B CACM December, 1965 .A Fischer, P. C. .N CA651215 JB March 6, 1978 3:24 PM .X 1154 5 1154 1154 5 1154 1154 5 1154 .I 1155 .T Experiments with a Deductive Question-Answering Program .W As an investigation in artificial intelligence, computer experiments on deductive question-answering were run with a LISP program called DEDUCOM, an acronym for DEDUctive COMmunicator. When given 68 facts, DEDUCOM answered 10 questions answerable from the facts. A fact tells DEDUCOM either some specific information or a method of answering a general kind of question. Some conclusions drawn in the article are: (1) DEDUCOM can answer a wide variety of questions. (2) A human can increase the deductive power of DEDUCOM by telling it more facts. (3) DEDUCOM can write very simple programs (it is hoped that this ability is the forerunner of an ability to self-program, which is a way to learn). (4)DEDUCOM's search procedure at present has two bad defects: some questions answerable from the given facts cannot be answered and some other answerable questions can be answered only if the relevant facts are given in the "right" order. (6) At present, DEDUCOM's method of making logical deductions in predicate calculus has two bad defects: some facts have to be changed to logically equivalent ones before being given to DEDUCOM, and some redundant facts have to be given to DEDUCOM. .B CACM December, 1965 .A Slagle, J. R. .N CA651214 JB March 6, 1978 3:34 PM .X 1155 4 1155 1456 4 1155 1468 4 1155 1515 4 1155 1699 4 1155 1856 4 1155 2127 4 1155 1155 5 1155 1155 5 1155 1155 5 1155 1324 5 1155 1515 5 1155 2096 5 1155 2127 5 1155 2210 5 1155 1155 6 1155 1155 6 1155 1155 6 1155 1155 6 1155 1324 6 1155 1324 6 1155 1487 6 1155 1527 6 1155 1781 6 1155 1856 6 1155 .I 1156 .T Hankel Function (Algorithm 124 [S17]) .B CACM December, 1965 .A Reilly, G. A. .N CA651213 JB March 6, 1978 3:35 PM .X 1156 5 1156 1156 5 1156 1156 5 1156 .I 1157 .T Procedure for the Normal Distribution Functions (Algorithm 272 [S15]) .B CACM December, 1965 .A MacLaren, M. D. .N CA651212 JB March 6, 1978 3:37 PM .X 1157 4 1157 1157 4 1157 1157 4 1157 1157 4 1157 1779 4 1157 1920 4 1157 1944 4 1157 1987 4 1157 2548 4 1157 1081 5 1157 1157 5 1157 1157 5 1157 1157 5 1157 485 5 1157 714 5 1157 836 5 1157 .I 1158 .T Program Structures for Parallel Processing .W Constructs for organizing and explicating parallel program segments are discussed as extensions to ALGOL 60. The constructs serve as meta-commands and are motivated by equipment having multiprocessing capability. .B CACM December, 1965 .A Anderson, J. P. .N CA651211 JB March 6, 1978 3:39 PM .X 1158 4 1158 1158 5 1158 1158 5 1158 1158 5 1158 1262 5 1158 .I 1159 .T Machine Independence: Its Technology and Economics .W A survey is offered of techniques for transferring programs, and especially compilers, from one computer to another. Of the methods examined, the "bootstrap" technique is singled out for detailed discussion, with emphasis on its economics. The considerations that determine the applicability of bootstrapping in any specific case are discussed, and an attempt is made to assign appropriate qualitative weights to them. Finally, reasons are given for believing that the machine-independence problem is being substantially diminished by current trends in computer design, and that it is this process of convergence in hardware design rather than any foreseeable software developments that will lead to its satisfactory resolution. .B CACM December, 1965 .A Halpern, M. I. .N CA651210 JB March 6, 1978 3:44 PM .X 1159 4 1159 1988 4 1159 381 4 1159 1159 5 1159 1159 5 1159 1159 5 1159 14 5 1159 .I 1160 .T CAT: A 7090-3600 Computer-Aided Translation .W A semi-automatic translation system has been implemented which converts 7090 FAP language programs into 3600 assembly language. The input to the system is a FAP program deck which has been specially prepared for translation by the user. The output consists of the translated COMPASS language program together with a comprehensive diagnostic listing which the user must analyze in order to verify any questionable areas of the translation. The translation processor consists of three distinct phases: an assembly of the FAP program, a comprehensive analysis of the assembled code with particular regard to the actions of instructions upon other instructions and upon data, and finally the output pass which generates the COMPASS program in the form of macro instructions. .B CACM December, 1965 .A Wilson, D. M. Moss, D. J. .N CA651209 JB March 6, 1978 3:50 PM .X 1160 4 1160 2034 4 1160 1160 5 1160 1160 5 1160 1160 5 1160 1231 5 1160 .I 1161 .T 1401 Compatibility Feature on the IBM System/360 Model 30 .W The "second generation" of stored-program computers, of which IBM 1400 series was a part, brought EDP into the mass market for the first time on a large scale. As this era unfolded, rapid changes in technology led to rapid obsolescence of data processing equipment. Program written for a particular system required tedious conversion as incompatible new machines came into use. The IBM System/360 has been designed with the conversion problem specifically in mind. One of the conversion aids available on the Model 30 is the 1401 compatibility feature. This feature, in conjunction with other aids, permits a smooth and inexpensive transition to optimum use of the new system. .B CACM December, 1965 .A McCormack, M. A. Schansman, T. T. Womack, K. K. .N CA651208 JB March 6, 1978 3:55 PM .X 1161 5 1161 1161 5 1161 1161 5 1161 .I 1162 .T An Assembly Language for Reprogramming .W Complete reprogramming of compiler language programs is seldom necessary. It is assembly language programs which present the greatest difficulty. Assembly languages generally provide a one-for-one translation from a symbolic to a numeric version of a program, that is, from assembly language to machine language. The meta-language presented here can be used to specify the mapping of any language which conforms to a canonical list form into an arbitrary stream of bits. This bit stream may be treated as a machine language program, a character stream, or whatever else the user might desire. Thus, this meta-language can be used to map from one assembly language into another or from the assembly language for one machine into the machine language of another. .B CACM December, 1965 .A Graham, M. L. Ingerman, P. Z. .N CA651207 JB March 6, 1978 4:01 PM .X 1162 5 1162 1162 5 1162 1162 5 1162 1565 5 1162 1162 6 1162 1358 6 1162 1455 6 1162 205 6 1162 .I 1163 .T Philco/IBM Translation at Problem-Oriented, Symbolic and Binary Levels .W A translation system has been developed to eliminate most of the effort formerly required to reprogram Philco 2000 series codes for IBM 7094 operation. Experience with this system is limited but highly successful encouraging application of the techniques to other source and object languages. .B CACM December, 1965 .A Olsen, T. M. .N CA651206 JB March 6, 1978 4:05 PM .X 1163 5 1163 1163 5 1163 1163 5 1163 .I 1164 .T Emulation of Large Systems .W The conversion problem and a new technique called emulation are discussed. The technique of emulation is developed and includes sections on both the Central Processing Unit (CPU) and the Input/Output unit (I/O). This general treatment is followed by three sections that describe in greater detail the implementation of compatibility features using the emulation techniques for the IBM 7074, 7080 and 7090 systems on IBM System/360. .B CACM December, 1965 .A Tucker, S. G. .N CA651205 JB March 6, 1978 4:09 PM .X 1164 5 1164 1164 5 1164 1164 5 1164 .I 1165 .T The Spectra 70/45 Emulator for the RCA 301 .W The RCA 301 Emulator System is supplied with the Spectra 70/45 as a reprogramming aid. It allows an RCA 301 object program to be run on the Spectra 70/45 without necessitating changes in the RCA 301 object code. Execution rates are considerably better than traditional simulation. The Emulator provides an increase in throughput capacity for the 301 user on the Spectra 70/45. The Emulator makes use of both hardware micro-program routines and software routines to accomplish its function. .B CACM December, 1965 .A Benjamin, R. I. .N CA651204 JB March 6, 1978 4:15 PM .X 1165 5 1165 1165 5 1165 1165 5 1165 .I 1166 .T A Use of Macros in Translation of Symbolic Assembly Language of One Computer to Another .W A set of macro-operations has been prepared to assist in translating IBM 7090 symbolic assembly language programs to IBM 7040 machine language programs. This set, inserted at the beginning of the 7090 symbolic deck, treats incompatible instruction mnemonics as macro-instructions to produce equivalent 7040 instruction sets. Incompatible instructions are categorized into basic operational classes which can be expressed by a single basic skeleton. Several levels of macro calls are required to supply arguments to the basic skeleton for each particular instruction. Modification at execution time of the address or tag of an incompatible instruction requires incorporation of an address-tag equivalent. I/O is handled by generating calls to I/O simulation subroutines. .B CACM December, 1965 .A Dellert Jr., G. T. .N CA651203 JB March 6, 1978 4:20 PM .X 1166 5 1166 1166 5 1166 1166 5 1166 .I 1167 .T On the Translation of Machine Language Programs .W Automatic translation of machine language programs is becoming a highly desirable goal with the advent of new large-scale computers. The pitfalls that make it difficult to achieve completely automatic translations are analyzed, and it is shown that these are primarily of a semantic nature. A semi-automatic procedure for resolving semantic problems is suggested. .B CACM December, 1965 .A Gaines, R. S. .N CA651202 JB March 6, 1978 4:23 PM .X 1167 5 1167 1167 5 1167 1167 5 1167 .I 1168 .T Across Machine Lines in COBOL .W The production of a large, file-maintenance-and-retrieval program system written in COBOL is described. The COBOL language was used specifically to enable the system to operate on three IBM computers. .B CACM December, 1965 .A Fredericks, D. S. Warburtin, C. R. .N CA651201 JB March 6, 1978 4:26 PM .X 1168 5 1168 1168 5 1168 1168 5 1168 .I 1169 .T An Algorithm for Minimizing Backboard Wiring Functions .W A partially exhaustive algorithm is presented for solving the following problem arising from automatic layout of a computer. Given an ordered set E1, E2,..., EN of N computer components, for each permutation of the elements E1, E2.., EN, there is attached a value of an integer function F. The algorithm finds a local minimum of F by evaluating the set {Delta F} of the increments corresponding to a certain set of exchanges of two elements.Then the exchange corresponding to the least negative increment of {Delta F} is performed. The process is iterated and stopped when the set of the increments is a positive or empty set, which, it is proved, corresponds to a minimum. The procedure is similar to the Downhill Method for finding the minimum of a real function F(P), and can be applied to other placement problems. Experimental results are presented with backboards formed by many elements and different initial placements. .B CACM November, 1965 .A Pomentale, T. .N CA651112 JB March 6, 1978 4:35 PM .X 1169 5 1169 1169 5 1169 1169 5 1169 .I 1170 .T Analyzing English Syntax with a Pattern-Learning Parser .W A dependency analysis system based on pattern recognition and learning logic was developed to infer word classes and rules of syntactic combination from experience with text which had been analyzed. The characteristics used to form word classes are the depth in the dependency tree of each word, the direction of its governor and the same features for each of its immediate neighbors. Syntactic rules of combination show the relation of a word to its governor in the depth pattern of the sentence. The system was tested on 400 elementary basic English sentences including 300 used earlier by Knowlton in a different learning parser of all 400 sentences. After experience with 300 sentences it was able to generalize with 77 percent accuracy to the next 100. In accumulative learning trials after the first 200 sentences it averaged a probability of .9 for accurately parsing each new sentence it encountered. It was concluded that the system is adequate for learning to parse the bulk of basic English but that further development is required before conclusions about its application to ordinary English can be stored. The system is operational and available on the ARPA/SDC time-shared computing system. .B CACM November, 1965 .A McConlogue, K. Simmons, R. F. .N CA651111 JB March 6, 1978 4:45 PM .X 1170 5 1170 1170 5 1170 1170 5 1170 .I 1171 .T A Comparison of the Primal-Simplex and Primal-Dual Algorithms for Linear Programming .W A statistical comparison of the primal-dual and the more commonly used primal-simplex algorithm for solving linear programming problems has been made under the assumption of starting with a full artificial basis. Under these conditions the primal-dual method shows a statistically significant superiority on randomly generated problems. It has also been found, via a regression analysis, that the relevant parameters in determining the difference in the number of iterations between the algorithms is not only the number of constraints and the number of variables but also the ratio of the latter to the former. .B CACM November, 1965 .A Mueller, R. K. Cooper, L. .N CA651110 JB March 6, 1978 4:50 PM .X 1171 5 1171 1171 5 1171 1171 5 1171 .I 1172 .T Conversion of Limited-Entry Decision Tables to Computer Programs .W Decision tables are useful for describing a set of complex decision rules based on given sets of conditions. Algorithms that can efficiently convert the tables into computer programs will extend the usefulness of decision tables to computer users. Two such algorithms, based on work done by M. S. Montalbano, are described and extended here to handle dashes and ELSE-decision rules. The first algorithm minimizes the computer storage space required for the resultant program, the second minimizes computer running time. During the conversion process, both pinpoint any contradictions or redundancies among the rules in a table. .B CACM November, 1965 .A Pollack, S. L. .N CA651109 JB March 6, 1978 4:56 PM .X 1172 5 1172 1172 5 1172 1172 5 1172 1354 5 1172 2053 5 1172 2220 5 1172 2273 5 1172 2453 5 1172 2598 5 1172 2726 5 1172 2856 5 1172 1172 6 1172 1172 6 1172 1172 6 1172 1172 6 1172 1172 6 1172 1172 6 1172 1172 6 1172 1172 6 1172 1237 6 1172 1237 6 1172 1237 6 1172 1237 6 1172 1327 6 1172 1327 6 1172 1327 6 1172 1327 6 1172 1327 6 1172 1327 6 1172 1354 6 1172 1354 6 1172 1354 6 1172 1354 6 1172 1354 6 1172 1354 6 1172 1488 6 1172 1489 6 1172 1489 6 1172 1548 6 1172 1548 6 1172 1548 6 1172 1684 6 1172 250 6 1172 2053 6 1172 2053 6 1172 2053 6 1172 2220 6 1172 2220 6 1172 2220 6 1172 2220 6 1172 2220 6 1172 2221 6 1172 2263 6 1172 2263 6 1172 2453 6 1172 2453 6 1172 2598 6 1172 2691 6 1172 753 6 1172 .I 1173 .T The Performance of a System for Automatic Segmentation of Programs Within an ALGOL Compiler (GIER ALGOL) .W The GIER ALGOL compiler makes use of an automatic system for handling the transfers of program segments from the drum store to the core store at program execution time. The logic of this system is described. The performance of the system is discussed, primarily on the basis of execution times related to two specific programs. This discussion concludes with an assessment of the potential gains of various ways of improving the system. .B CACM November, 1965 .A Naur, P. .N CA651108 JB March 6, 1978 5:00 PM .X 1173 4 1173 1188 4 1173 1173 5 1173 1173 5 1173 1173 5 1173 1774 5 1173 2343 5 1173 642 5 1173 800 6 1173 1173 6 1173 1173 6 1173 1774 6 1173 1845 6 1173 271 6 1173 .I 1174 .T Inverse Permutation (Algorithm 250 [G6]) .B CACM November, 1965 .A Medlock, C. W. .N CA651107 JB March 6, 1978 5:01 PM .X 1174 5 1174 1174 5 1174 1174 5 1174 .I 1175 .T Quickersort (Algorithm 271 [M1]) .B CACM November, 1965 .A Scowen, R. S. .N CA651106 JB March 6, 1978 5:02 PM .X 1175 4 1175 1175 4 1175 1919 4 1175 1919 4 1175 1969 4 1175 1997 4 1175 2017 4 1175 2041 4 1175 2191 4 1175 2216 4 1175 2388 4 1175 2679 4 1175 3054 4 1175 3121 4 1175 1175 5 1175 1175 5 1175 1175 5 1175 1919 5 1175 1969 5 1175 308 5 1175 2118 5 1175 2348 5 1175 2679 5 1175 3054 5 1175 864 5 1175 864 6 1175 970 6 1175 1175 6 1175 1175 6 1175 1175 6 1175 1175 6 1175 1175 6 1175 1175 6 1175 1190 6 1175 1228 6 1175 1880 6 1175 1919 6 1175 1969 6 1175 1969 6 1175 1980 6 1175 1997 6 1175 1997 6 1175 307 6 1175 308 6 1175 308 6 1175 308 6 1175 308 6 1175 309 6 1175 309 6 1175 2017 6 1175 2042 6 1175 2679 6 1175 74 6 1175 3187 6 1175 3187 6 1175 507 6 1175 716 6 1175 776 6 1175 783 6 1175 .I 1176 .T Finding Eigenvectors by Gaussian Elimination (Algorithm 270 [F2]) .B CACM November, 1965 .A Newhouse, A. .N CA651105 JB March 6, 1978 5:03 PM .X 1176 5 1176 1176 5 1176 1176 5 1176 .I 1177 .T Determinant Evaluation (Algorithm 269 [F3]) .B CACM November, 1965 .A Pfann, J. .N CA651104 JB March 6, 1978 5:05 PM .X 1177 4 1177 806 4 1177 1177 5 1177 1177 5 1177 1177 5 1177 1931 5 1177 1946 5 1177 454 5 1177 878 6 1177 902 6 1177 1093 6 1177 1177 6 1177 1177 6 1177 1387 6 1177 1393 6 1177 311 6 1177 360 6 1177 731 6 1177 .I 1178 .T ALGOL 60 Reference Language Editor (Algorithm 268 [R2]) .B CACM November, 1965 .A McKeeman, W. M. .N CA651103 JB March 6, 1978 5:06 PM .X 1178 5 1178 1178 5 1178 1178 5 1178 .I 1179 .T PUFFT-The Purdue University Fast FORTRAN Translator .W A core resident, compile-and-go system designed for the IBM 7090/7094 computer is described. In little more than half of the 32k word core memory PUFFT provides a monitor for job sequencing, a translator for the full FORTRAN IV language, the FORTRAN subroutine library, an input--output system for use at compile time and at execute time, and a rather elaborate diagnostic message writing routine. Batches of small- and medium-sized FORTRAN IV source language programs are processed at very high speeds. Language compatibility has been maintained so that programs may be debugged in the PUFFT system and then recompiled and run in the IBJOB-IBFTC system supplied by the manufacturer. .B CACM November, 1965 .A Rosen, S. Spurgeon, A. Donnelly, J. K. .N CA651102 JB March 6, 1978 6:17 PM .X 1134 4 1179 1179 4 1179 1179 4 1179 1288 4 1179 1544 4 1179 1646 4 1179 1861 4 1179 2111 4 1179 2534 4 1179 2556 4 1179 2650 4 1179 1179 5 1179 1179 5 1179 1179 5 1179 1646 5 1179 1647 5 1179 408 5 1179 830 5 1179 830 6 1179 987 6 1179 1072 6 1179 1179 6 1179 1179 6 1179 1647 6 1179 224 6 1179 680 6 1179 .I 1180 .T AXLE: An Axiomatic Language for String Transformations .W AXLE is a language designed for data manipulation. Data arranged in a linear form in a workspace is transformed according to a table of axioms, called imperatives. A transformation consists of a matching procedure, which decides where an imperative is applicable, and a replacement procedure that modifies that part of the workspace. Imperatives are applied in accordance with definitions of symbolic terms, presented systematically in an assertion table. The process of definition includes the special case of recursive assertions. Several complete programs of imperatives are given to show a few applications of the language. .B CACM November, 1965 .A Cohen, I. Wegstein, J. H. .N CA651101 JB March 6, 1978 6:22 PM .X 1180 5 1180 1180 5 1180 1180 5 1180 1395 5 1180 1706 5 1180 1180 6 1180 1180 6 1180 1395 6 1180 210 6 1180 .I 1181 .T A Simple Data Transmission System Using the Office Telephone .W A method has evolved for transmitting data of a type originating in many laboratory situation direct to a central computer. The method requires almost no specialized equipment and uses any ordinary telephone on a "callup" basis. Present applications include cardiac-output calculations, radio-activity tracer studies and neurophysiology time-sequence studies of nerve impulses. .B CACM October, 1965 .A Neilsen, I. R. .N CA651014 JB March 6, 1978 6:25 PM .X 1181 4 1181 1181 5 1181 1181 5 1181 1181 5 1181 698 5 1181 .I 1182 .T Contextual Correlates of Synonymy .W Experimental corroboration was obtained for the hypothesis that the proportion of words common to the contexts of word A and to the contexts of word B is a function of the degree to which A and B are similar in meaning. The shapes of the functions, however, indicate that similarity of context is reliable as criterion only for detecting pairs of words that are very similar in meaning. .B CACM October, 1965 .A Rubenstein, H. Goodenough, J. B. .N CA651013 JB March 6, 1978 6:29 PM .X 1182 5 1182 1182 5 1182 1182 5 1182 .I 1183 .T A Note on the Use of a Digital Computer for Doing Tedious Algebra and Programming .W A special purpose compiler was written with FORTRAN II language and made possible the writing of very long programs by the computer. The procedure is based on a straight-forward use of FORMAT statements for generating machine-written programs. .B CACM October, 1965 .A Veronis, G. .N CA651012 JB March 6, 1978 6:31 PM .X 1183 5 1183 1183 5 1183 1183 5 1183 .I 1184 .T A Fast Storage Allocator .W A fast storage bookkeeping method is described which is particularly appropriate for list-structure operations and other situations involving many sizes of blocks that are fixed in size and location. This scheme, used in the LLLLLL or L6 (Bell Telephone Laboratories Low-Level List Language), makes available blocks of computer registers in several different sizes: the smaller blocks are obtained by successively splitting larger ones in half, and the larger blocks are reconstituted if and when their parts are simultaneously free. .B CACM October, 1965 .A Knowlton, K.C. .N CA651011 JB March 6, 1978 6:35 PM .X 1184 5 1184 1184 5 1184 1184 5 1184 1389 5 1184 1552 5 1184 2162 5 1184 2435 5 1184 2596 5 1184 2768 5 1184 2845 5 1184 2902 5 1184 2955 5 1184 1051 6 1184 1062 6 1184 1184 6 1184 1184 6 1184 1184 6 1184 1184 6 1184 1184 6 1184 1184 6 1184 1184 6 1184 1184 6 1184 1184 6 1184 1211 6 1184 1389 6 1184 1421 6 1184 1552 6 1184 1879 6 1184 1879 6 1184 378 6 1184 2435 6 1184 2435 6 1184 2435 6 1184 2435 6 1184 2435 6 1184 2596 6 1184 2596 6 1184 2598 6 1184 2734 6 1184 2736 6 1184 2747 6 1184 2747 6 1184 2747 6 1184 2768 6 1184 2768 6 1184 2773 6 1184 .I 1185 .T A program to Solve the Pentomino Problem by the Recursive Use of Macros .W A coding technique is described in which certain macro-instructions are given lists as arguments and are thereby used recursively. The discussion covers primarily an example in which the technique is used to solve the pentomino problem-the problem of fitting 12 pentominos without overlapping into a plane area formed of 60 elemental squares. .B CACM October, 1965 .A Fletcher, J. G. .N CA651010 JB March 6, 1978 6:37 PM .X 1185 5 1185 1185 5 1185 1185 5 1185 1531 5 1185 2707 5 1185 2753 5 1185 1185 6 1185 1185 6 1185 1185 6 1185 1455 6 1185 .I 1186 .T Recursive Solution of a Class Of Combinatorial Problems: An Example .W Combinatorial problems requiring the selection of n elements from a set of m elements may be solved by a recursion process analogous to that for computing binomial coefficients. Several specific problems are analyzed, the general technique is exposed, and an ALGOL program is developed for one of the problems. .B CACM October, 1965 .A Lynch,W. C. .N CA651009 JB March 6, 1978 6:40 PM .X 1186 5 1186 1186 5 1186 1186 5 1186 .I 1187 .T Note on an ASCII-Octal Code Table (Standards) .B CACM October, 1965 .A Crosby, W. S. .N CA651008 JB March 6, 1978 6:42 PM .X 1187 5 1187 1187 5 1187 1187 5 1187 .I 1188 .T An ALGOL-like Computer Design Language .W The idea of constructing a computer design language by making use of an ALGOL-like programming language is presented. A computer designer can benefit from using a design language at a higher level just as a computer user can benefit from a higher level programming language. The purposes and requirements of the design language are enumerated. To achieve most of the purposes a translator is required to translate a design of computer logic into a set of Boolean equations. The design language is presented in terms of vocabulary, statements, sequences and microprogram. Included are examples of identifiers, expressions with both unary and binary operators, declaration statements, transfer statements, terminal statements, exchange statements, if statements, do statements, go to statements, several sequences and a microprogram. .B CACM October, 1965 .A Chu, Y. .N CA651007 JB March 6, 1978 6:48 PM .X 249 4 1188 254 4 1188 272 4 1188 1102 4 1188 1109 4 1188 1140 4 1188 1173 4 1188 1188 4 1188 1188 4 1188 1306 4 1188 1464 4 1188 1491 4 1188 1767 4 1188 1781 4 1188 1787 4 1188 1949 4 1188 321 4 1188 2059 4 1188 2126 4 1188 435 4 1188 437 4 1188 463 4 1188 483 4 1188 491 4 1188 2732 4 1188 560 4 1188 583 4 1188 3073 4 1188 627 4 1188 631 4 1188 632 4 1188 642 4 1188 644 4 1188 653 4 1188 680 4 1188 761 4 1188 762 4 1188 763 4 1188 123 4 1188 140 4 1188 919 4 1188 989 4 1188 196 5 1188 1188 5 1188 1188 5 1188 1188 5 1188 642 5 1188 .I 1189 .T Random Normal Deviate (Algorithm 267 [G5]) .B CACM October, 1965 .A Pike, M. C. .N CA651006 JB March 6, 1978 6:49 PM .X 1189 5 1189 1189 5 1189 1189 5 1189 1716 5 1189 1189 6 1189 .I 1190 .T Pseudo-Random Numbers (Algorithm 266 [G5]) .B CACM October, 1965 .A Pike, M. C. Hill, I. D. .N CA651005 JB March 6, 1978 6:51 PM .X 1190 4 1190 1190 5 1190 1190 5 1190 1190 5 1190 1663 5 1190 2195 5 1190 2679 5 1190 456 5 1190 970 6 1190 1175 6 1190 1190 6 1190 1190 6 1190 1190 6 1190 1228 6 1190 1648 6 1190 1969 6 1190 1997 6 1190 308 6 1190 2042 6 1190 3187 6 1190 507 6 1190 716 6 1190 783 6 1190 .I 1191 .T Find Precedence Functions (Algorithm 265 [L2]) .B CACM October, 1965 .A Wirth, N. .N CA651004 JB March 6, 1978 6:52 PM .X 1191 5 1191 1191 5 1191 1191 5 1191 1836 5 1191 2340 5 1191 1191 6 1191 1191 6 1191 1477 6 1191 1491 6 1191 1491 6 1191 1683 6 1191 1781 6 1191 1836 6 1191 577 6 1191 .I 1192 .T Interpolation in a Table (Algorithm 264 [E1]) .B CACM October, 1965 .A Stafford, J. .N CA651003 JB March 6, 1978 6:52 PM .X 1192 5 1192 1192 5 1192 1192 5 1192 .I 1193 .T Gomory 1 (Algorithm 263 [H]) .B CACM October, 1965 .A Langmaack, H. .N CA651002 JB March 6, 1978 6:54 PM .X 1193 5 1193 1193 5 1193 1193 5 1193 .I 1194 .T Establishment of the ACM Repository and Principles of the IR System Applied to its Operation .W The history of the establishment of the ACM Repository at the Moore School, University of Pennsylvania, is reviewed briefly. Two principles are presented as paramount in the provision of information services: (1) easy accessibility to the information files by users unfamiliar with file organization, and (2) value of service exceeding user costs. These principles serve as guides in mechanizing the ACM Repository. The main features of the information system are direct user access via on-line teletypewriter console, direct user access to all details of the system organization, unrestricted and expandable search vocabulary, user access through many facets of document indexing, and stochastic search through linked index terms and other file relationships. The first contribution to the ACM Repository consisted of 315 documents, relating primarily to early research on compilers. These documents have been cataloged and indexed and the catalog is scheduled to appear in Computing Reviews. The indexing system is described in detail. The Main Catalog is used to describe the documents, and inverted lists are provided by the Repository system for retrieval by concept coordination. .B CACM October, 1965 .A Rubinoff, M. White Jr., J. F. .N CA651001 JB March 6, 1978 7:03 PM .X 1194 5 1194 1194 5 1194 1194 5 1194 1681 5 1194 1699 5 1194 1194 6 1194 1194 6 1194 1324 6 1194 1681 6 1194 .I 1195 .T UPLIFTS-University of Pittsburgh Linear File Tandem System .W A series of computer programs has been developed and is now operational for processing the National Aeronautics and Space Administration linear file system on an IBM 1401-7090 combined data processing system. The program are note-worthy in that they create fixed length logical records and fixed length blocks from variable length source data, and format the output for optimization of processing on the IBM 7090 system. The programs are completely self-checking and test for both validity and accuracy of the input materials as provided by the National Aeronautics and Space Administration. .B CACM September, 1965 .A Canter, J. D. Donaghey, C. E. .N CA650911 JB March 6, 1978 7:10 PM .X 1195 5 1195 1195 5 1195 1195 5 1195 .I 1196 .T Applications of Differential Equations in General Problem Solving .W A large class of problems leading to digital computer processing can be formulated in terms of the numerical solution of systems of ordinary differential equations. Powerful methods are in existence for the solution of such systems. A good general purpose routine for the solution of such systems furnishes a powerful tool for processing many problems. This is true from the point of view of ease of programming, ease of debugging, and minimization of computer time. A number of examples are discussed in detail. .B CACM September, 1965 .A Klopfenstein, R. W. .N CA650910 JB March 6, 1978 7:16 PM .X 1196 5 1196 1196 5 1196 1196 5 1196 .I 1197 .T Finding Zeros of a Polynomial by the Q-D Algorithm .W A method which finds simultaneously all the zeros of a polynomial, developed by H. Rutishauser, has been tested on a number of polynomials with real coefficients. This slowly converging method (the Quotient-Difference (Q-D) algorithm) provides starting values for a Newton or a Bairstow algorithm for more rapid convergence. Necessary and sufficient conditions for the existence of the Q-D scheme are not completely known; however, failure may occur when zeros have equal, or nearly equal magnitudes. Success was achieved, in most of the cases tried, with the failures usually traceable to the equal magnitude difficulty. In some cases, computer roundoff may result in errors which spoil the scheme. Even if the Q-D algorithm does not give all the zeros, it will usually find a majority of them. .B CACM September, 1965 .A Henrich, P. Watkins, B. O. .N CA650908 JB March 6, 1978 7:21 PM .X 1197 5 1197 1197 5 1197 1197 5 1197 1524 5 1197 879 6 1197 1197 6 1197 311 6 1197 .I 1198 .T Solution of a Problem in Concurrent Programming Control .W A number of mainly independent sequential-cyclic processes with restricted means of communication with each other can be made in such a way that at any moment one and only one of them is engaged in the "critical section" of its cycle. .B CACM September, 1965 .A Dijkstra, E. W. .N CA650908 JB March 6, 1978 7:24 PM .X 1198 5 1198 1198 5 1198 1198 5 1198 1781 5 1198 2150 5 1198 2228 5 1198 2256 5 1198 2317 5 1198 2342 5 1198 2376 5 1198 2618 5 1198 3184 5 1198 123 6 1198 196 6 1198 919 6 1198 990 6 1198 1007 6 1198 1046 6 1198 1131 6 1198 1139 6 1198 1140 6 1198 1149 6 1198 1198 6 1198 1198 6 1198 1198 6 1198 1198 6 1198 1198 6 1198 1198 6 1198 1198 6 1198 1198 6 1198 1198 6 1198 1215 6 1198 1223 6 1198 1265 6 1198 1303 6 1198 1323 6 1198 1338 6 1198 1338 6 1198 1338 6 1198 1338 6 1198 1338 6 1198 1358 6 1198 1366 6 1198 1421 6 1198 1460 6 1198 1462 6 1198 1463 6 1198 1467 6 1198 1468 6 1198 1477 6 1198 1491 6 1198 1496 6 1198 1531 6 1198 1535 6 1198 1565 6 1198 1572 6 1198 1601 6 1198 1602 6 1198 1613 6 1198 1614 6 1198 1626 6 1198 1641 6 1198 1693 6 1198 1749 6 1198 1749 6 1198 1749 6 1198 1749 6 1198 1749 6 1198 1749 6 1198 1753 6 1198 1781 6 1198 1787 6 1198 1788 6 1198 205 6 1198 224 6 1198 249 6 1198 1877 6 1198 288 6 1198 1960 6 1198 316 6 1198 381 6 1198 398 6 1198 11 6 1198 2126 6 1198 2148 6 1198 2256 6 1198 404 6 1198 410 6 1198 463 6 1198 464 6 1198 483 6 1198 3184 6 1198 3188 6 1198 557 6 1198 584 6 1198 600 6 1198 680 6 1198 691 6 1198 763 6 1198 799 6 1198 .I 1199 .T A Computer Center Simulation Project .W Today's computation centers are based on rapidly changing technologies of hardware and software systems. It is difficult, therefore, to base decisions on experience; in most instances, the benefits of comparable experience for a given problem situation are not available. In this paper, a mathematical model of the Lockheed Central Computer Center is formulated that describes the operation of a computation center in terms of information nets, decision processes, and control functions. Experiments performed with this model, the results of the experiments, and the application of the results are discussed. .B CACM September, 1965 .A Hutchinson, G. K. .N CA650907JB March 6, 1978 7:29 PM .X 1199 5 1199 1199 5 1199 1199 5 1199 .I 1200 .T On Reversible Subroutines and Computers that Run Backwards .W A computer design is describe which permits subroutines to be executed backward as well as forward, either with their instructions unchanged or replaced with conjugate instructions. It is shown that using this concept a number of new subroutine types can be developed with rather unusual properties. Since these properties are analogous to certain matrix operations, a parallel nomenclature is suggested for their classification. .B CACM September, 1965 .A Reily, E. D. Federighi, F. D. .N CA650906 JB March 6, 19787:33 PM .X 1200 5 1200 1200 5 1200 1200 5 1200 1945 5 1200 823 6 1200 914 6 1200 915 6 1200 917 6 1200 984 6 1200 989 6 1200 990 6 1200 1012 6 1200 1084 6 1200 1098 6 1200 1122 6 1200 1138 6 1200 1139 6 1200 1141 6 1200 1200 6 1200 1223 6 1200 1265 6 1200 1336 6 1200 1396 6 1200 1455 6 1200 1477 6 1200 1487 6 1200 1491 6 1200 1496 6 1200 483 6 1200 584 6 1200 669 6 1200 680 6 1200 763 6 1200 .I 1201 .T Generation of Permutations in Lexico-Graphical Order (Algorithm 202 [G6]) .B CACM September, 1965 .A Elliott, R. W. .N CA650905 JB March 6, 1978 7:35 PM .X 1201 5 1201 1201 5 1201 1201 5 1201 .I 1202 .T Normal Random (Algorithm 200 [G5]) .B CACM September, 1965 .A Pike, M. C. .N CA650904 JB March 6, 1978 7:36 PM .X 1202 5 1202 1202 5 1202 1202 5 1202 .I 1203 .T Normdey (Algorithm 121 [G5]) .B CACM September, 1965 .A Pike, M. C. .N CA650903 JB March 6, 19787:37 PM .X 1203 5 1203 1203 5 1203 1203 5 1203 .I 1204 .T Character Structure and Character Parity Sense for Serial-by-Bit Data Communication in the American Standard Code for Information Interchange (Proposed American Standard) .B CACM September, 1965 .N CA650902 JB March 6, 1978 7:41 PM .X 1204 5 1204 1204 5 1204 1204 5 1204 .I 1205 .T An Undergraduate Program in Computer Science-Preliminary Recommendations .B CACM September, 1965 .A A Report from the ACM Curriculum Committee on Computer Science .N CA650901 JB March 6, 1978 7:43 PM .X 1107 4 1205 1205 4 1205 1205 4 1205 1205 4 1205 1205 4 1205 1100 5 1205 1104 5 1205 1107 5 1205 1205 5 1205 1205 5 1205 1205 5 1205 1413 5 1205 1654 5 1205 1771 5 1205 2478 5 1205 68 5 1205 1205 6 1205 1205 6 1205 1205 6 1205 1205 6 1205 1270 6 1205 1654 6 1205 1771 6 1205 2329 6 1205 .I 1206 .T The Self-Judgment Method of Curve Fitting .W A computer-oriented method for processing and communicating numerical data is described. The Instrument Reliability Factors (IRF), which exactly define the limits of reliability of each measured item of information, are used to compute the Maximum Permitted Error (MPE) associated with each values of each ordinate. The Self-Judgment Principle (SJP) is used to discard wrong information and to compute mean values of the parameters and their MPE's in terms of the IRF. Data compatibility tests with any number of different equations can be made quickly. Otherwise intractable problems are easily solved, and the design of many experiments is greatly simplified. The computational and mathematical techniques used to reduce bias in the SJP are discussed. Inadequacies in the statistical and graphical methods of curve fitting are noted. .B CACM August, 1965 .A DeMaine, P. A. D. .N CA650818 JB March 6, 1978 7:50 PM .X 1206 5 1206 1206 5 1206 1206 5 1206 .I 1207 .T Remarks on Simulation of Boolean Functions .B CACM August, 1965 .A Dodd, G. G. .N CA650817 JB March 6, 1978 7:52 PM .X 1207 4 1207 1208 4 1207 3053 4 1207 1207 5 1207 1207 5 1207 1207 5 1207 1329 5 1207 .I 1208 .T Simulation of Computer Logic by Fortran Arithmetic .B CACM August, 1965 .A Weingarten, F. W. .N CA650816 JB March 6, 1978 7:53 PM .X 1207 4 1208 1208 4 1208 3053 4 1208 1208 5 1208 1208 5 1208 1208 5 1208 1329 5 1208 1409 5 1208 1208 6 1208 .I 1209 .T Negative and Zero Subscripts in Fortran II Programming for the IBM 1620 .B CACM August, 1965 .A Garber, M. S. .N CA650815 JB March 6, 1978 7:56 PM .X 1209 5 1209 1209 5 1209 1209 5 1209 .I 1210 .T File-Handling Within FORTRAN .W This note describes some FORTRAN subroutines to facilitate handling of tape files. They allow symbolic naming of information files, without violating the casual scientific programmer's idea of simplicity. Some comments on two years use of these subroutines are given. .B CACM August, 1965 .A Harrison, M. C. .N CA650814 JB March 6, 1978 7:59 PM .X 1210 5 1210 1210 5 1210 1210 5 1210 .I 1211 .T A Note on Storage of Strings .W A method for storing strings is described which uses blocks of indefinite size, and is therefore completely dynamic. Its relation to similar schemes is discussed. .B CACM August, 1965 .A Berztiss, A. T. .N CA650813 JB March 6, 1978 8:02 PM .X 1211 4 1211 1211 4 1211 1549 4 1211 1906 4 1211 2902 4 1211 2902 4 1211 1051 5 1211 1062 5 1211 1211 5 1211 1211 5 1211 1211 5 1211 2902 5 1211 1051 6 1211 1062 6 1211 1184 6 1211 1211 6 1211 1552 6 1211 1879 6 1211 2435 6 1211 2596 6 1211 2734 6 1211 2747 6 1211 2768 6 1211 .I 1212 .T Non-linear Extrapolation and Two-Point Boundary Value Problems .W It is suggested that the convergence properties of the usual Picard successive approximation scheme may be improved through use of non-linrar extrapolation techniques. A numerical example is provided. .B CACM August, 1965 .A Bellman, R. Kagiada, H. Kalba, R. .N CA650812 JB March 6, 1978 8:05 PM .X 1212 5 1212 1212 5 1212 1212 5 1212 .I 1213 .T Dynamic Format Specifications .W The use and implementation of two new FORTRAN format conversions are discussed. These format types give the FORTRAN programmer control of input/output specifications at execution time. .B CACM August, 1965 .A Ranelletti, J. E. .N CA650811 JB March 6, 1978 8:07 PM .X 1213 5 1213 1213 5 1213 1213 5 1213 .I 1214 .T Some Experiments in Algebraic Manipulation by Computer .W A set of subroutines to allow algebraic manipulations on the IBM 7094 computer has been written a List Processor, SLIP. A series of four problems of increasing difficulty were solved using these routines. .B CACM August, 1965 .A Lapidus, A. Goldstein, M. .N CA650810 JB March 6, 1978 8:10 PM .X 1024 4 1214 1051 4 1214 1098 4 1214 1214 4 1214 1214 4 1214 1380 4 1214 1388 4 1214 1393 4 1214 1396 4 1214 1485 4 1214 1487 4 1214 1549 4 1214 1570 4 1214 1878 4 1214 1946 4 1214 1957 4 1214 2168 4 1214 2723 4 1214 2857 4 1214 3112 4 1214 1132 5 1214 1214 5 1214 1214 5 1214 1214 5 1214 1396 5 1214 731 5 1214 964 6 1214 1028 6 1214 1029 6 1214 1083 6 1214 1132 6 1214 1214 6 1214 1278 6 1214 1334 6 1214 1365 6 1214 1386 6 1214 1387 6 1214 1388 6 1214 1392 6 1214 1393 6 1214 1394 6 1214 1395 6 1214 1396 6 1214 1397 6 1214 1496 6 1214 284 6 1214 407 6 1214 3199 6 1214 3200 6 1214 3201 6 1214 3202 6 1214 3203 6 1214 3204 6 1214 561 6 1214 730 6 1214 .I 1215 .T Some Techniques Used in the ALCOR ILLINOIS 7090 .W An ALGOL compiler has been written by the ALCOR group for the IBM 7090. Some little known but significant techniques in compiler writing, together with organizational details of this compiler, are described. Timing estimates and an indication of compiler requirements are also given. .B CACM August, 1965 .A Gries, D. Paul, M. Wiehle, H. R. .N CA650809 JB March 6, 1978 8:13 PM .X 267 4 1215 1139 4 1215 1141 4 1215 1215 4 1215 1215 4 1215 1215 4 1215 1223 4 1215 1647 4 1215 1682 4 1215 1781 4 1215 1781 4 1215 1787 4 1215 1787 4 1215 1792 4 1215 1945 4 1215 364 4 1215 405 4 1215 438 4 1215 2603 4 1215 763 4 1215 1025 5 1215 1215 5 1215 1215 5 1215 1215 5 1215 224 5 1215 1498 5 1215 1781 5 1215 1787 5 1215 763 5 1215 123 6 1215 196 6 1215 196 6 1215 919 6 1215 990 6 1215 1007 6 1215 1046 6 1215 1131 6 1215 1139 6 1215 1140 6 1215 1141 6 1215 1149 6 1215 1198 6 1215 1215 6 1215 1215 6 1215 1215 6 1215 1223 6 1215 1265 6 1215 1303 6 1215 1323 6 1215 1358 6 1215 1366 6 1215 1421 6 1215 1460 6 1215 1462 6 1215 1463 6 1215 1467 6 1215 1468 6 1215 1477 6 1215 1491 6 1215 1491 6 1215 1496 6 1215 1496 6 1215 1531 6 1215 1535 6 1215 1565 6 1215 1601 6 1215 1602 6 1215 1613 6 1215 1614 6 1215 1626 6 1215 1641 6 1215 1781 6 1215 1787 6 1215 1788 6 1215 205 6 1215 224 6 1215 224 6 1215 249 6 1215 288 6 1215 316 6 1215 381 6 1215 398 6 1215 11 6 1215 404 6 1215 410 6 1215 463 6 1215 464 6 1215 483 6 1215 3184 6 1215 3184 6 1215 3188 6 1215 584 6 1215 600 6 1215 680 6 1215 691 6 1215 763 6 1215 763 6 1215 799 6 1215 799 6 1215 .I 1216 .T Symbolic Derivatives Without List Processing, Subroutines, or Recursion .W A routine has been developed which computes and prints out the symbolic derivative of an absolutely continuous elementary function of one or several variables. No use is made of list-processing languages. The chain rule is applied and the result is edited to produce results as elegant and efficient as those obtained by hand computation. A subset may be imbeded in a formula translator to introduce a differentiation operator into an "algebraic" programming language. .B CACM August, 1965 .A Smith, P. J. .N CA650808 JB March 6, 1978 8:18 PM .X 1028 4 1216 1028 4 1216 1216 4 1216 1216 4 1216 1216 4 1216 1278 4 1216 1278 4 1216 1347 4 1216 1347 4 1216 1392 4 1216 1396 4 1216 1396 4 1216 1396 4 1216 1536 4 1216 964 4 1216 1028 5 1216 1029 5 1216 1216 5 1216 1216 5 1216 1216 5 1216 561 5 1216 .I 1217 .T Map of Partitions into Integers (Algorithm 264 [A1]) .B CACM August, 1965 .A McKay, J. K. S. .N CA650807 JB March 6, 1978 8:19 PM .X 1217 5 1217 1217 5 1217 1217 5 1217 .I 1218 .T Partition Generator (Algorithm 263 [A1]) .B CACM August, 1965 .A McKay, J. K. S. .N CA650806 JB March 6, 1978 8:20 PM .X 1218 5 1218 1218 5 1218 1218 5 1218 2103 5 1218 1218 6 1218 .I 1219 .T Number of Restricted Partitions of N (Algorithm 262 [A1]) .B CACM August, 1965 .A McKay,J. K. S. .N CA650805 JB March 6, 1978 8:26 PM .X 1219 5 1219 1219 5 1219 1219 5 1219 2104 5 1219 2489 5 1219 1219 6 1219 1219 6 1219 2104 6 1219 .I 1220 .T 9-J Symbols (Algorithm 261 [Z]) .B CACM August, 1965 .A Gunn, J. H. .N CA650804 JB March 6, 1978 8:27 PM .X 1220 5 1220 1220 5 1220 1220 5 1220 .I 1221 .T 6-J Symbols (Algorithm 260 [Z]) .B CACM August, 1965 .A Gunn, J. H. .N CA650803 JB March 6, 1978 8:28 PM .X 1221 5 1221 1221 5 1221 1221 5 1221 .I 1222 .T Legendre Functions for Arguments Larger Than One (Algorithm 259 [S16]) .B CACM August, 1965 .A Gautschi, W. .N CA650802 JB March 6, 1978 8:30 PM .X 1023 4 1222 1222 4 1222 1222 4 1222 1222 4 1222 1130 5 1222 1222 5 1222 1222 5 1222 1222 5 1222 245 5 1222 310 5 1222 .I 1223 .T High Speed Compilation of Efficient Object Code .W A three-pass compiler with the following properties is briefly described: The last two passes scan an intermediate language produced by the preceding pass in essentially the reverse of the order in which it was generated, so that the first pass is the only one which hasto read the bulky problem-oriented input. The double scan, one in either direction, performed by the first two passes, allows the compiler to remove locally constant expressions and recursively calculable expressions from loops and to do the important part of common subexpression recognition. Optimization such as the effective use of index registers, although as important, is not discussed since the object code which would be most efficient is highly machine dependent. The discussion is in terms of a FORTRAN-like language, although the technique is applicable to most algebraic languages. .B CACM August, 1965 .A Gear, C. W. .N CA650801 JB March 6, 1978 8:45 PM .X 267 4 1223 1139 4 1223 1141 4 1223 1215 4 1223 1223 4 1223 1223 4 1223 1388 4 1223 1647 4 1223 1781 4 1223 1787 4 1223 1792 4 1223 364 4 1223 405 4 1223 436 4 1223 438 4 1223 763 4 1223 1223 5 1223 1223 5 1223 1223 5 1223 224 5 1223 1781 5 1223 1807 5 1223 1945 5 1223 1947 5 1223 405 5 1223 823 6 1223 123 6 1223 196 6 1223 914 6 1223 915 6 1223 917 6 1223 919 6 1223 984 6 1223 989 6 1223 990 6 1223 990 6 1223 1007 6 1223 1012 6 1223 1046 6 1223 1084 6 1223 1098 6 1223 1122 6 1223 1131 6 1223 1134 6 1223 1138 6 1223 1139 6 1223 1139 6 1223 1140 6 1223 1141 6 1223 1149 6 1223 1198 6 1223 1200 6 1223 1215 6 1223 1223 6 1223 1223 6 1223 1223 6 1223 1223 6 1223 1248 6 1223 1248 6 1223 1265 6 1223 1265 6 1223 1303 6 1223 1323 6 1223 1336 6 1223 1358 6 1223 1366 6 1223 1396 6 1223 1421 6 1223 1455 6 1223 1460 6 1223 1462 6 1223 1463 6 1223 1467 6 1223 1468 6 1223 1477 6 1223 1477 6 1223 1487 6 1223 1491 6 1223 1491 6 1223 1496 6 1223 1496 6 1223 1531 6 1223 1535 6 1223 1551 6 1223 1565 6 1223 1601 6 1223 1602 6 1223 1613 6 1223 1614 6 1223 1626 6 1223 1641 6 1223 1787 6 1223 1788 6 1223 205 6 1223 224 6 1223 249 6 1223 288 6 1223 1947 6 1223 316 6 1223 381 6 1223 398 6 1223 399 6 1223 11 6 1223 404 6 1223 410 6 1223 463 6 1223 464 6 1223 483 6 1223 483 6 1223 3184 6 1223 3188 6 1223 584 6 1223 584 6 1223 600 6 1223 669 6 1223 680 6 1223 680 6 1223 691 6 1223 763 6 1223 763 6 1223 799 6 1223 .I 1224 .T Determining a Computing Center Environment .W An investigation is described in which several generally unavailable parameters descriptive of a computing center environment are obtained. The actual data collection and reduction is described, and the results of one month of this collection are tabulated and summarized. .B CACM July, 1965 .A Rosin, R. F. .N CA650711 JB March 6, 1978 8:48 PM .X 1224 5 1224 1224 5 1224 1224 5 1224 1533 5 1224 1604 5 1224 1224 6 1224 1224 6 1224 1410 6 1224 1604 6 1224 .I 1225 .T The Predictive Analyzer and a Path Elimination Technique .W Some of the characteristic features of a predictive analyzer, a system of syntactic analysis now operational at Harvard on and IBM 7094, are delineated. The advantages and disadvantages of the system are discussed in comparison to those of an immediate constituent analyzer, developed at the RAND Corporation with Robinson's English grammar. In addition, a new technique is described for repetitive path elimination for a predictive analyzer, which can now claim efficiency both in processing time and core storage requirement. .B CACM July, 1965 .A Kuno, S. .N CA650710 JB March 6, 1978 8:52 PM .X 1225 4 1225 1225 4 1225 1350 4 1225 1350 4 1225 1646 4 1225 1781 4 1225 1945 4 1225 1945 4 1225 2650 4 1225 2698 4 1225 2708 4 1225 3093 4 1225 1012 5 1225 1225 5 1225 1225 5 1225 1225 5 1225 1350 5 1225 1659 5 1225 1856 5 1225 2050 5 1225 680 5 1225 1012 6 1225 1225 6 1225 1225 6 1225 1225 6 1225 1225 6 1225 1265 6 1225 1265 6 1225 1324 6 1225 1350 6 1225 1399 6 1225 1553 6 1225 1671 6 1225 1697 6 1225 680 6 1225 .I 1226 .T The Organization of Structured Files .W A data file is an integral part of a data processing system. In many systems, the selection of an organization for the data within the file can be critical to the system's operating efficiency. This paper provides the systems designer with an information source which describes ten techniques that may be employed for organizing structured data. The characteristics of the organizations described are application independent, thus providing the designer with a reference which allows him to limit the number of file organizations he must consider for his system. .B CACM July, 1965 .A Dzubak, B. J. Warburton, C. R. .N CA650709 JB March 6, 1978 8:57 PM .X 1050 4 1226 1226 4 1226 441 4 1226 758 4 1226 1226 5 1226 1226 5 1226 1226 5 1226 367 5 1226 .I 1227 .T Transport (Algorithm 258 [H]) .B CACM July, 1965 .A Bayer, G. .N CA650708 JB March 6, 1978 8:58 PM .X 1227 5 1227 1227 5 1227 1227 5 1227 .I 1228 .T Treesort 3 (Algorithm 245 [M1]) .B CACM July, 1965 .A Abrams, P. S. .N CA650707 JB March 6, 1978 8:59 PM .X 1228 5 1228 1228 5 1228 1228 5 1228 2042 5 1228 2679 5 1228 970 6 1228 970 6 1228 1175 6 1228 1190 6 1228 1228 6 1228 1228 6 1228 1969 6 1228 1997 6 1228 308 6 1228 2042 6 1228 3187 6 1228 507 6 1228 716 6 1228 783 6 1228 .I 1229 .T Random Permutation (Algorithm 235 [G6]) .B CACM July, 1965 .A Pike, M. C. .N CA650706 JB March 6, 1978 9:00 PM .X 1229 5 1229 1229 5 1229 1229 5 1229 .I 1230 .T Method for Hyphenating at the End of a Printed Line .W A description of a method of hyphenation is presented as a result of application of several general rules. The character sets considered by the routine and the method are briefly outlined. .B CACM July, 1965 .A Rich, R. P. Stone, A. G. .N CA650705 JB March 6, 1978 9:03 PM .X 1230 5 1230 1230 5 1230 1230 5 1230 .I 1231 .T Peephole Optimization .W Redundant instructions may be discarded during the final stage of compilation by using a simple optimizing technique called peephole optimization. The method is described and examplesare given. .B CACM July, 1965 .A McKeeman, W. M. .N CA650704 JB March 6, 1978 9:05 PM .X 1160 5 1231 1231 5 1231 1231 5 1231 1231 5 1231 2034 5 1231 984 6 1231 1231 6 1231 1231 6 1231 1565 6 1231 1852 6 1231 1926 6 1231 1947 6 1231 .I 1232 .T Representation of the Standard ECMA 7-Bit Code in Punched Cards (ECMA Standard) .B CACM July, 1965 .N CA650703 JB March 6, 1978 9:06 PM .X 1232 5 1232 1232 5 1232 1232 5 1232 .I 1233 .T Conventions for the Use of Symbols in the Preparation of Flowcharts for Information Processing Systems (A Standard Working Paper) .W This paper is intended as an outline of the various conventions which are being considered for the use of flowcharts for information processing systems. The conventions are applied to the use of the symbols appearing in the proposed American Standard Flowchart Symbols and not with the symbols per se. .B CACM July, 1965 .N CA650702 JB March 6, 1978 9:10 PM .X 1233 5 1233 1233 5 1233 1233 5 1233 .I 1234 .T The Structure of Yet Another ALGOL Compiler .W A high-speed "top down" method of syntax analysis which completely eliminates "back-up" of the source string has been implemented in a convenient macro-language. A technique of simulation at compile time of the use of a conventional run-time stack enables the generation of code for expressions which minimizes stores, fetches and stack-pointer motion at run time, while properly trating recursion and side effects of procedures. Block structure and recursion are handled without need for interpretive methods at run times. The "context problem" in the transmission to recursive procedures of parameters "called by name" is solved in a manner which permits the handling of the common cases of simple expressions and array identifiers with particular efficiency. .B CACM July, 1965 .A Kanner, H. Kosinski, P. Robinson, C. L. .N CA650701 JB March 6, 1978 9:29 PM .X 254 4 1234 1037 4 1234 1046 4 1234 1086 4 1234 1105 4 1234 1132 4 1234 1139 4 1234 1140 4 1234 1234 4 1234 1234 4 1234 1234 4 1234 1234 4 1234 1234 4 1234 1234 4 1234 1234 4 1234 1234 4 1234 1263 4 1234 1263 4 1234 1265 4 1234 1265 4 1234 1270 4 1234 1323 4 1234 1358 4 1234 1358 4 1234 1379 4 1234 1380 4 1234 1453 4 1234 1464 4 1234 1484 4 1234 1491 4 1234 1491 4 1234 1496 4 1234 1498 4 1234 1613 4 1234 1614 4 1234 1781 4 1234 1781 4 1234 1824 4 1234 1825 4 1234 1860 4 1234 321 4 1234 321 4 1234 2083 4 1234 2126 4 1234 2178 4 1234 2179 4 1234 2252 4 1234 2325 4 1234 2341 4 1234 2451 4 1234 2546 4 1234 2546 4 1234 464 4 1234 2645 4 1234 2652 4 1234 2684 4 1234 2842 4 1234 2929 4 1234 2934 4 1234 584 4 1234 3069 4 1234 631 4 1234 653 4 1234 669 4 1234 679 4 1234 680 4 1234 691 4 1234 761 4 1234 763 4 1234 795 4 1234 799 4 1234 945 4 1234 949 4 1234 989 4 1234 944 5 1234 1234 5 1234 1234 5 1234 1234 5 1234 321 5 1234 385 5 1234 400 5 1234 402 5 1234 404 5 1234 3184 5 1234 729 5 1234 .I 1235 .T A Stochastic Approach to the Grammatical Coding of English .W A computer program is described which will assign each word in an English text to its form class or part of speech. The program operates at relatively high speed in only a limited storage space. About half of the word-events in a corpus are identified through the use of a small dictionary of function words and frequently occurring lexical words. Some suffix tests and logical-decision rules are employed to code additional words. Finally, the remaining words are assigned to one class or another on the basis of the most probable form classes to occur within the already identified contexts. The conditional probabilities used as a basis for this coding were empirically derived from a separate hand-coded corpus.On preliminary trials, the accuracy of the coder was 91% to 93%, with obvious ways of improving the algorithm being suggested by an analysis of the results. .B CACM June, 1965 .A Stolz, W. S. Tannenbaum, H. Carstensen, F. V. .N CA650620 JB March 6, 1978 9:35 PM .X 1235 5 1235 1235 5 1235 1235 5 1235 .I 1236 .T The SMART Automatic Document Retrieval System-An Illustration .W A fully automatic document retrieval system operating on the IBM 7094 is described. The system is characterized by the fact that several hundred different methods are available to analyze documents and search requests. This feature is used in the retrieval process by leaving the exact sequence of operations initially unspecified, and adapting the search strategy to the needs of individual users. The system is used not only to simulate an actual operating environment, but also to test the effectiveness of the various available processing methods. Results obtained so far seem to indicate that some combination of analysis procedures can in general be relied upon to retrieve the wanted information. A typical search request is used as an example in the present report to illustrate systems operations and evaluation procedures. .B CACM June, 1965 .A Salton, G. Lesk, M. E. .N CA650619 JB March 6, 1978 9:41 PM .X 1236 5 1236 1236 5 1236 1236 5 1236 1457 5 1236 1236 6 1236 .I 1237 .T Conversion of Decision Tables To Computer Programs .W Several translation procedures for the conversion of decision tables to programs are presented and then evaluated in terms of storage requirements, execution time and compile time. The procedures are valuable as hand-coding guides or as algorithms for a compiler. Both limited-entry and extended-entry tables are analyzed. In addition to table analysis, the nature of table-oriented programming languages and features is discussed. It is presumed that the reader is familiar with the nature of decision tables and conventional definitions. .B CACM June,1965 .A Press, L. I. .N CA650618 JB March 6, 1978 9:45 PM .X 250 4 1237 1237 4 1237 1237 4 1237 1237 4 1237 1549 4 1237 1564 4 1237 2220 4 1237 2453 4 1237 753 4 1237 1237 5 1237 1237 5 1237 1237 5 1237 1354 5 1237 250 5 1237 1488 5 1237 1994 5 1237 320 5 1237 2053 5 1237 2220 5 1237 2273 5 1237 753 5 1237 1172 6 1237 1172 6 1237 1172 6 1237 1172 6 1237 1237 6 1237 1237 6 1237 1237 6 1237 1237 6 1237 1237 6 1237 1237 6 1237 1327 6 1237 1327 6 1237 1327 6 1237 1327 6 1237 1327 6 1237 1354 6 1237 1354 6 1237 1354 6 1237 1489 6 1237 1548 6 1237 1684 6 1237 250 6 1237 2053 6 1237 2220 6 1237 .I 1238 .T A Technique for Integrated Reports from a Multi-run System .W The requirements of a requisition accounting system for the San Francisco Overseas Supply Agency (OSA) included exception reporting to OSA itself. The simultaneous satisfaction of the reporting requirement and the accounting requirements posed definite problems in system design, particularly the handling of the reporting function. A practical and satisfactory solution was developed by expanding the basic system with two tailored service runs for report production. These two runs permitted a final system that was easier to debug, easy to maintain, efficient in production and responsive to the changing requirements of OSA. .B CACM June, 1965 .A Budea, N. Kamena, J. G. Kamena, R. M. .N CA650617 JB March 6, 1978 9:49 PM .X 1238 5 1238 1238 5 1238 1238 5 1238 .I 1239 .T Graycode (Algorithm 246 [Z]) .B CACM June, 1965 .A Allen, W. D. .N CA650616 JB March 6, 1978 9:50 PM .X 1239 5 1239 1239 5 1239 1239 5 1239 .I 1240 .T Transport (Algorithm 258 [H]) .B CACM June, 1965 .A Bayer, G. .N CA650615 JB March 6, 1978 9:51 PM .X 1240 5 1240 1240 5 1240 1240 5 1240 .I 1241 .T Havie Integrator (Algorithm 257 [D1]) .B CACM June, 1965 .A Kubik, R. N. .N CA650614 JB March 6, 1978 10:09 PM .X 1241 5 1241 1241 5 1241 1241 5 1241 1352 5 1241 1356 5 1241 1883 5 1241 2040 5 1241 834 6 1241 872 6 1241 1040 6 1241 1092 6 1241 1241 6 1241 1241 6 1241 1241 6 1241 1241 6 1241 1273 6 1241 1273 6 1241 1352 6 1241 1356 6 1241 324 6 1241 324 6 1241 429 6 1241 570 6 1241 621 6 1241 621 6 1241 786 6 1241 .I 1242 .T Modified Graeffe Method (Algorithm 256 [C2]) .B CACM June, 1965 .A Grau, A. A. .N CA650613 JB March 6, 1978 10:10 PM .X 1242 5 1242 1242 5 1242 1242 5 1242 1667 5 1242 178 6 1242 1242 6 1242 327 6 1242 .I 1243 .T Testing the Understanding of the Difference Between Call by Name and Call by Value in ALGOL 60 .B CACM June, 1965 .A Weil, R. L. .N CA650612 JB March 6, 1978 10:11 PM .X 1243 5 1243 1243 5 1243 1243 5 1243 .I 1244 .T Bit Manipulation in Fortran Language .B CACM June, 1965 .A Tobey, G. D. .N CA650611 JB March 6, 1978 10:12 PM .X 1244 5 1244 1244 5 1244 1244 5 1244 .I 1245 .T A Fortran n-Ary Counter .B CACM June, 1965 .A Kent, W. .N CA650610 JB March 6, 1978 10:13 PM .X 1245 5 1245 1245 5 1245 1245 5 1245 .I 1246 .T Deeply Nested Iterations .B CACM June, 1965 .A Korphage, R. R. .N CA650609 JB March 6, 1978 10:15 PM .X 1246 5 1246 1246 5 1246 1246 5 1246 .I 1247 .T An Operating Environment for Dynamic-Recursive Computer Programming Systems .W Presented in this paper is a brief nontechnical introduction to OEDIPUS, a computer programming system which can serve as an operating environment for dynamic and/or recursive programs and programming systems. The available services include dynamic allocation of storage for contiguous blocks of arbitrary size, input and output for a hierarchy of data types, a public pushdown list for automatic recursive programming, a rudimentary compiler for subroutine communication and bookkeeping, and debugging aids. .B CACM June, 1965 .A Brown, W. S. .N CA650608 JB March 6, 1978 10:18 PM .X 1247 4 1247 1945 4 1247 1247 5 1247 1247 5 1247 1247 5 1247 1336 5 1247 1397 5 1247 2704 5 1247 1247 6 1247 1247 6 1247 1552 6 1247 1749 6 1247 2356 6 1247 2379 6 1247 2673 6 1247 .I 1248 .T On the Automatic Simplification of Computer Programs .W Presented in this paper is the problem of writing a program which would examine any other program and perform such simplifications on it as can be detected from the argument-program's form alone, without having any knowledge of what it is supposed to do. .B CACM June, 1965 .A Nievergelt, J. .N CA650607 JB March 6, 1978 10:24 PM .X 1248 5 1248 1248 5 1248 1248 5 1248 1625 5 1248 1807 5 1248 1947 5 1248 1134 6 1248 1223 6 1248 1223 6 1248 1248 6 1248 1248 6 1248 1248 6 1248 1551 6 1248 1947 6 1248 399 6 1248 669 6 1248 .I 1249 .T Recorded Magnetic Tape for Information Interchange (200 CPI, NRZI) (On the Revised Proposed American Standard) .B CACM June, 1965 .N CA650606 JB March 6, 1978 10:26 PM .X 1249 5 1249 1249 5 1249 1249 5 1249 .I 1250 .T Graphic Symbols for Problem Definition and Analysis-A Standards Working Paper .B CACM June, 1965 .N CA650605 JB March 7, 1978 12:35 PM .X 1250 5 1250 1250 5 1250 1250 5 1250 .I 1251 .T American Standard and IFIP/ICC Vocabularies compared .W The "Proposed American Standard Vocabulary of Information Processing" and the "IFIP/ICC Vocabulary of Terms Used in Information Processing" are analyzed and compared. .B CACM June, 1965 .A Traub, J. F. .N CA650604 JB March 7, 1978 12:38 PM .X 1251 4 1251 975 5 1251 1251 5 1251 1251 5 1251 1251 5 1251 .I 1252 .T Symbolic Notations for Statistical Tables and an Approach Towards Automatic System Design .W The preparation of statistical tables is an important function of the data processing systems of some organizations, and a symbolic notation for the description of tables has been shown to be a useful aid to documentation. Such a notation also provides the first step towards making automatic a tedious and time-consuming part of system design and programming in many computer applications. One notation is described and suggestions are made for the implementation of the larger goal. .B CACM June, 1965 .A Smith, B. W. .N CA650603 JB March 7, 1978 12:41 PM .X 1252 5 1252 1252 5 1252 1252 5 1252 .I 1253 .T QUIKSCRIPT-A SIMSCRIPT- Like Language for the G-20 .W QUIKSCRIPT is a simulation language based on SIMSCRIPT and programmed entirely in an algebraic language, 20-GATE. The QUIKSCRIPT language, its internal implementation, and major differences between QUIKSCRIPT and SIMSCRIPT are presented. This paper is not a programming guide to the language, but rather an attempt to present its flavor. A brief description of SIMSCRIPT is included, as is a sufficient description of 20-GATE to render this material understandable to the reader familiar with algebraic languages. .B CACM June, 1965 .A Tonge, F. M. Keller, P. Newell, A. .N CA650602 JB March 7, 1978 12:45 PM .X 1253 5 1253 1253 5 1253 1253 5 1253 .I 1254 .T The Iteration Element .W A recent addition to the MAD language has made the iteration structure of the MAD THROUGH statement (corresponding to the ALGOL for statement and the FORTRAN DO statement) available within expressions. .B CACM June, 1965 .A Galler, B. A. Fischer, M. J. .N CA650601 JB March 7, 1978 12:49 PM .X 1254 5 1254 1254 5 1254 1254 5 1254 .I 1255 .T A Method of Data List Processing With Application to EEG Analysis .W A set of subroutines is discussed, which is designed to aid in the programming of computations on indexed lists of numbers using machine language or a symbolic assembly system. The most commonly performed list operations are outlined, and logically arranged into five groups. As an example, the computation of power spectral density from the autocovariance function is discussed for a class of EEG signals. .B CACM May, 1965 .A Philpott, C. M. Lago, G. V. .N CA650516 JB March 7, 1978 12:52 PM .X 1255 5 1255 1255 5 1255 1255 5 1255 .I 1256 .T Dynamic Variable Formatting .B CACM May, 1965 .A King, D. R. .N CA650515 JB March 7, 1978 12:53 PM .X 1256 5 1256 1256 5 1256 1256 5 1256 .I 1257 .T DEBUG-An Extension to Current On-Line Debugging Techniques .W A method of on-linr assembly-language debugging which greatly simplifies several of the bookkeeping tasks characteristically associated with that process has been developed and implemented in a program for the UNIVAC M-460 computer at Air Force Cambridge Research Laboratories. With this program, an online user may insert or delete (in symbolic assembly language) any number of lines at any point of his previously assembled program in core, with the remainder of the program being relocated appropriately. .B CACM May, 1965 .A Evans, T. G. Darley, D. L. .N CA650514 JB March 7, 1978 12:58 PM .X 1257 5 1257 1257 5 1257 1257 5 1257 1738 5 1257 1257 6 1257 .I 1258 .T An Extended Arithmetic Package .W In many fields, for example algebraic number theory, arithmetic must be carried out to a degree of precision which exceeds the normal hardware capacity of most machines. In such cases, an extended arithmetic package provides a comprehensive and easy-to-use way of performing such arithmetic. Such a package was coded for the IBM 7090. In discussing the general problems associated with the design of an extended arithmetic package, specific reference is made to this program. .B CACM May, 1965 .A Blum, B. I. .N CA650513 JB March 7, 1978 1:01 PM .X 1026 4 1258 1258 4 1258 1258 4 1258 1292 4 1258 1292 4 1258 1497 4 1258 1497 4 1258 1975 4 1258 2605 4 1258 107 5 1258 1026 5 1258 1258 5 1258 1258 5 1258 1258 5 1258 .I 1259 .T Applications of Binary Numbers In Computer Routines .W A binary number can be thought of as an alternate form of expression for either a set of letters or a decimal number. There are then three equivalent expressions, easily translatable to one another, each having different characteristics. Four examples are given in which the form of an expression is changed to an equivalent expression to save space or gain power. .B CACM May, 1965 .A Weldon, R. J. Baker, R. L. .N CA650512 JB March 7, 1978 1:05 PM .X 1259 5 1259 1259 5 1259 1259 5 1259 .I 1260 .T Least-Squares Analysis of Resonance Spectra on Small Computers .W The problem of analyzing data from a Mossbauer effect experiment is discussed. By using the cut step procedure for convergence and by imposing physical constraints on the functional form of the calculation it is possible to make the analysis on a small computer. The analysis has been carried out on an IBM 1410 computer with a 40,000 BCD core memory. .B CACM May, 1965 .A Marshall, S. W. Nelson, J. A. Wilenzick, R. M. .N CA650511 JB March 7, 1978 1:10 PM .X 1260 5 1260 1260 5 1260 1260 5 1260 .I 1261 .T Modeling and Simulation of Digital Networks .W The simulation of digital networks on a digital computer provides the engineer with an effective means of analyzing time-quantized logical behavior. The digital network is modeled as a set of time-dependent or time-independent Boolean transformations; each transformation describing the input-output relationship of a model element comprising the network mode. The simplicity of utilizing the FORTRAN IV Programming System as a digital Network Simulator is discussed an illustrated. This simplicity is derived from a common modeling technique applicable to combinational and sequential digital networks and a systematic programming approach. .B CACM May, 1965 .A Larsen, R. P. Mano, M. M. .N CA650510 JB March 7, 1978 1:15 PM .X 1261 4 1261 1939 4 1261 1030 5 1261 1261 5 1261 1261 5 1261 1261 5 1261 .I 1262 .T Procedure-Oriented Language Statements to Facilitate Parallel Processing .W Two statements are suggested which allow a programmer writing in a procedure-oriented language to indicate sections of program which are to be executed in parallel. The statements are DO TOGETHER and HOLD. These serve partly as brackets in establishing a range of parallel operation and partly to define each parallel path within this range. DO TOGETHERs may be nested. The statements should be particularly effective for use with computing devices capable of attaining some degree of compute-compute overlap. .B CACM May, 1965 .A Opler, A. .N CA650509 JB March 7, 1978 2:17 PM .X 1158 5 1262 1262 5 1262 1262 5 1262 1262 5 1262 1262 6 1262 .I 1263 .T Metalanguage and Syntax Specification .W Two metalanguages are described, one sufficient for the table specification of the ALGOL syntax, the other with additional metaoperators adequate and used for the formal table description of Basic FORTRAN. .B CACM May, 1965 .A Burkhardt, W. H. .N CA650508 JB March 7, 1978 2:19 PM .X 1046 4 1263 1086 4 1263 1105 4 1263 1132 4 1263 1139 4 1263 1140 4 1263 1234 4 1263 1234 4 1263 1263 4 1263 1263 4 1263 1263 4 1263 1265 4 1263 1265 4 1263 1270 4 1263 1323 4 1263 1358 4 1263 1379 4 1263 1380 4 1263 1453 4 1263 1453 4 1263 1464 4 1263 1484 4 1263 1491 4 1263 1496 4 1263 1498 4 1263 1613 4 1263 1614 4 1263 1781 4 1263 1781 4 1263 1824 4 1263 1825 4 1263 1860 4 1263 1945 4 1263 2083 4 1263 2126 4 1263 2178 4 1263 2179 4 1263 2252 4 1263 2325 4 1263 2341 4 1263 2546 4 1263 2546 4 1263 464 4 1263 2645 4 1263 2652 4 1263 2684 4 1263 2842 4 1263 2929 4 1263 2934 4 1263 584 4 1263 3069 4 1263 631 4 1263 653 4 1263 669 4 1263 679 4 1263 680 4 1263 691 4 1263 761 4 1263 763 4 1263 795 4 1263 799 4 1263 945 4 1263 949 4 1263 989 4 1263 989 5 1263 1263 5 1263 1263 5 1263 1263 5 1263 1379 5 1263 404 5 1263 3184 5 1263 1263 6 1263 1477 6 1263 3184 6 1263 669 6 1263 761 6 1263 .I 1264 .T BLNSYS-A 1401 Operating System with Braille Capabilities .W BLNSYS is an operating system designed for a 4K 1401 with common optional features and two attached tape drives. Printed output of this system or of executing programs may be in either English or braille. Even though this system was written for a small machine with minimal peripheral equipment, jobs may be batched, so that card handling and lost processing time is at a minimum. This system will perform any or all of the following users specified functions: assemble SPS source decks, post list, produce condensed or uncondensed object decks, execute user's program, list card input to a program, list punched output, provide a storage dump, execute a program submitted for execution as an uncondensed object deck under debugging trace control, card-to-braille conversion, brailled listings of 7040 IBSYS batch output, and update or duplicate the system tape itself. Input-ouput subroutines are also included in the system. .B CACM May, 1965 .A Landwehr, J. B. McLaughlin, C. Mueller, H. Lichstein, M. Pollack, S. V. .N CA650507 JB March 7, 1978 2:30 PM .X 1264 4 1264 1740 4 1264 1099 5 1264 1264 5 1264 1264 5 1264 1264 5 1264 .I 1265 .T On the Relative Efficiencies of Context-Free Grammar Recognizers .W A number of diverse recognition procedures that have been proposed for parsing sentences with respect to a context-free grammar are described in this paper by means of a common device. Each procedure is defined by giving an algorithm for obtaining a nondeterministic Turing Machine recognizer that is equivalent to a given context-free grammar. The formalization of the Turing Machine has been chosen to make possible particularly simple description of the parsing procedures considered. An attempt has been made to compare recognition efficiencies for the procedures defined. For a few simple grammars and sentences a formal comparison has been made. Empirical comparison of the recognition of more realistic programming languages such as LISP and ALGOL has been made by means of a program which simulates the Turing Machine on the Univac M-460 computer. Several algorithms for producing grammars equivalent to a given context-free grammar have been considered, and the increase in recognition efficiency they afford has been empirically investigated. .B CACM May, 1965 .A Griffiths, T. V. Petrick, S. R. .N CA650506 JB March 7, 1978 2:38 PM .X 1046 4 1265 1062 4 1265 1086 4 1265 1105 4 1265 1121 4 1265 1132 4 1265 1139 4 1265 1139 4 1265 1139 4 1265 1140 4 1265 1151 4 1265 1234 4 1265 1234 4 1265 1263 4 1265 1263 4 1265 1265 4 1265 1265 4 1265 1265 4 1265 1265 4 1265 1265 4 1265 1270 4 1265 1323 4 1265 1358 4 1265 1379 4 1265 1380 4 1265 1453 4 1265 1464 4 1265 1484 4 1265 1491 4 1265 1496 4 1265 1498 4 1265 1613 4 1265 1614 4 1265 1665 4 1265 1781 4 1265 1781 4 1265 1781 4 1265 1824 4 1265 1825 4 1265 1860 4 1265 2083 4 1265 2126 4 1265 2178 4 1265 2179 4 1265 2252 4 1265 2325 4 1265 2341 4 1265 2546 4 1265 2546 4 1265 464 4 1265 2645 4 1265 2652 4 1265 2684 4 1265 2769 4 1265 2842 4 1265 2929 4 1265 2934 4 1265 584 4 1265 3069 4 1265 631 4 1265 653 4 1265 669 4 1265 679 4 1265 680 4 1265 691 4 1265 720 4 1265 759 4 1265 761 4 1265 763 4 1265 763 4 1265 795 4 1265 799 4 1265 945 4 1265 949 4 1265 989 4 1265 1265 5 1265 1265 5 1265 1265 5 1265 1350 5 1265 1399 5 1265 1659 5 1265 1768 5 1265 1781 5 1265 1945 5 1265 2110 5 1265 404 5 1265 464 5 1265 3094 5 1265 3184 5 1265 631 5 1265 635 5 1265 823 6 1265 123 6 1265 196 6 1265 914 6 1265 915 6 1265 917 6 1265 919 6 1265 984 6 1265 989 6 1265 990 6 1265 990 6 1265 1007 6 1265 1012 6 1265 1012 6 1265 1046 6 1265 1084 6 1265 1098 6 1265 1122 6 1265 1131 6 1265 1138 6 1265 1139 6 1265 1139 6 1265 1140 6 1265 1141 6 1265 1141 6 1265 1149 6 1265 1198 6 1265 1200 6 1265 1215 6 1265 1223 6 1265 1223 6 1265 1225 6 1265 1225 6 1265 1265 6 1265 1265 6 1265 1265 6 1265 1265 6 1265 1265 6 1265 1265 6 1265 1265 6 1265 1265 6 1265 1303 6 1265 1323 6 1265 1336 6 1265 1350 6 1265 1358 6 1265 1366 6 1265 1396 6 1265 1399 6 1265 1421 6 1265 1455 6 1265 1460 6 1265 1462 6 1265 1463 6 1265 1467 6 1265 1468 6 1265 1477 6 1265 1477 6 1265 1487 6 1265 1491 6 1265 1491 6 1265 1496 6 1265 1496 6 1265 1531 6 1265 1535 6 1265 1565 6 1265 1601 6 1265 1602 6 1265 1613 6 1265 1614 6 1265 1626 6 1265 1641 6 1265 1671 6 1265 1697 6 1265 1781 6 1265 1781 6 1265 1787 6 1265 1788 6 1265 205 6 1265 224 6 1265 249 6 1265 288 6 1265 316 6 1265 381 6 1265 398 6 1265 11 6 1265 2179 6 1265 2645 6 1265 404 6 1265 410 6 1265 463 6 1265 464 6 1265 483 6 1265 483 6 1265 3184 6 1265 3188 6 1265 584 6 1265 584 6 1265 600 6 1265 669 6 1265 680 6 1265 680 6 1265 680 6 1265 691 6 1265 763 6 1265 763 6 1265 799 6 1265 .I 1266 .T Considerations Relating to Purpose of FORTRAN Standardization (Appendixes to ASA FORTRAN Standard) .B CACM May, 1965 .N CA650505 JB March 7, 1978 2:40 PM .X 1266 5 1266 1266 5 1266 1266 5 1266 .I 1267 .T Performance of Systems Used for Data Transmission Transfer Rate of Information Bits -An ASA Tutorial Standard .W Information thruput as a characteristic of systems performance is discussed. This discussion includes the pertinent aspects of information transfer, of determination of transfer rate of information bits (TRIB), of residual errors, and of standard measurement conditions. The paper also presents an orderly arrangement of characteristics and parameters that affect information thruput, and some examples on procedures for determining a thruput rate in terms of TRIB. It concludes that a performance characteristic involving information rate can best be expressed as the TRIB in conjunction with the Residual Error Rate. .B CACM May, 1965 .N CA650504 JB March 7, 1978 3:10 PM .X 1267 5 1267 1267 5 1267 1267 5 1267 .I 1268 .T Logarithm of a Complex Number (Algorithm 243 [B3]) .B CACM May, 1965 .A Boothroyd, J. .N CA650502 JB March 7, 1978 3:11 PM .X 1268 5 1268 1268 5 1268 1268 5 1268 1858 5 1268 1268 6 1268 1857 6 1268 .I 1269 .T Computation of Fourier Coefficients (Algorithm [C6]) .B CACM May, 1965 .A Teijelo, L. .N CA650502 JB March 7, 1978 3:12 PM .X 1269 5 1269 1269 5 1269 1269 5 1269 .I 1270 .T On ALGOL Education: Automatic Grading Programs .W Two ALGOL grader programs are presented for the computer evaluation of student ALGOL programs. One is for a beginner's program; it furnishes random data and checks answers. The other provides a searching test of the reliability and efficiency of an integration procedure. There is a statement of the essential properties of a computer system, in order that grader programs can be effectively used. .B CACM May, 1965 .A Forsythe, G. E. Wirth, N. .N CA650501 JB March 7, 1978 3:16 PM .X 1086 4 1270 1132 4 1270 1234 4 1270 1263 4 1270 1265 4 1270 1270 4 1270 1270 4 1270 1323 4 1270 1358 4 1270 1379 4 1270 1380 4 1270 1453 4 1270 1464 4 1270 1484 4 1270 1491 4 1270 1498 4 1270 1613 4 1270 1614 4 1270 1781 4 1270 1825 4 1270 1860 4 1270 1902 4 1270 2083 4 1270 2178 4 1270 2179 4 1270 2252 4 1270 2325 4 1270 2341 4 1270 2546 4 1270 2645 4 1270 2652 4 1270 2684 4 1270 2842 4 1270 2929 4 1270 2934 4 1270 3069 4 1270 669 4 1270 679 4 1270 691 4 1270 761 4 1270 949 4 1270 989 4 1270 145 5 1270 1270 5 1270 1270 5 1270 1270 5 1270 1413 5 1270 1902 5 1270 3184 5 1270 145 6 1270 1205 6 1270 1270 6 1270 1270 6 1270 .I 1271 .T Secondary Key Retrieval Using an IBM 7090-1301 System .W The secondary key retrieval method involves the preparation of secondary storage lists from primary data records. Search requests are satisfied by logical operations on appropriate lists, producing a complete set of addresses of primary records relevant to the request. Experimental results are presented and a comparative analysis is given. .B CACM April, 1965 .A Davis, D. R. Lin, A. D. .N CA650420 JB March 7, 1978 3:18 PM .X 1271 4 1271 1785 4 1271 2543 4 1271 2552 4 1271 911 4 1271 1271 5 1271 1271 5 1271 1271 5 1271 1976 5 1271 332 5 1271 1271 6 1271 .I 1272 .T Expanding the Editing Function In Language Data Processing .W In automatic abstracting, citation indexing, mechanical translation and other such procedures, editing is required whenever the automatic method leaves something to be desired. This paper discusses the economy of editing as a function of the amount of condensation of text in language processing operations, and then contends that editing can be regarded as an opportunity rather than as an unwelcome necessity. "Heavy editing," which goes beyond mere correction and improvement of computer output, is exemplified by the use of a concordance in preparing a survey article or lecture. Other opportunities for heavy editing are described, chief among them being interpretation and expansion of computer output in such processes as factor analysis. Applications are described, such processes as factor analysis. Applications are described, such as the quick, unbiased evaluation of a large volume of incoming mail or telegrams, yielding summary reports not possible for either humans or computers to produce alone. .B CACM April, 1965 .A Doule, L. B. .N CA650419 JB March 7, 1978 3:26 PM .X 1272 5 1272 1272 5 1272 1272 5 1272 .I 1273 .T Remark on Romberg Quadrature .W A modified form of Romberg quadrature is described, which is less sensitive to the accumulation of rounding errors than the customary one. .B CACM April, 1965 .A Krasun, A. M. Prager, W. .N CA650418 JB March 7, 1978 3:27 PM .X 1273 5 1273 1273 5 1273 1273 5 1273 1352 5 1273 1982 5 1273 2040 5 1273 1 6 1273 834 6 1273 872 6 1273 1040 6 1273 1092 6 1273 1241 6 1273 1241 6 1273 1273 6 1273 1273 6 1273 1273 6 1273 1352 6 1273 1356 6 1273 1883 6 1273 324 6 1273 324 6 1273 324 6 1273 429 6 1273 570 6 1273 621 6 1273 621 6 1273 786 6 1273 .I 1274 .T On the Numerical Solution of an N-Point Boundary Value Problem for Linear Ordinary Differential Equations .W A method for the numerical solution of then-point boundary value problem for homogeneous linear ordinary differential equations is developed. The method requires two Runge-Kutta integrations over the interval under consideration and the solution of a linear system of equations with n-1 unknowns. .B CACM April, 1965 .A Day, J. T. .N CA650417 JB March 7, 1978 3:30 PM .X 1274 4 1274 1147 5 1274 1274 5 1274 1274 5 1274 1274 5 1274 .I 1275 .T Code Structures for Protection and Manipulation of Variable Length Items (Corrigendum) .B CACM April, 1965 .A Ramamoorthy, C. V. .N CA650416 JB March 7, 1978 3:31 PM .X 1275 5 1275 1275 5 1275 1275 5 1275 .I 1276 .T Still Another Use for FORTRAN II Chaining .B CACM April, 1965 .N CA650415 JB March 7, 1978 3:32 PM .X 1276 5 1276 1276 5 1276 1276 5 1276 .I 1277 .T The Use of Cobol Subroutines in Fortran Main Programs .B CACM April, 1965 .A Tajiri, K. .N CA650414 JB March 7, 1978 3:34 PM .X 1277 5 1277 1277 5 1277 1277 5 1277 .I 1278 .T Wengert's Numerical Method for Partial Derivatives, Orbit Determination and Quasilinearization .W In a recent article in the Communications of the ACM, R. Wengert suggested a technique for machine evaluation of the partial derivatives of a function given in analytical form. In solving non-linear boundary-value problems using quasilinearization many partial derivatives must be formed analytically and then evaluated numerically. Wengert's method appears very attractive from the programming viewpoint equations which might not otherwise be undertaken. .B CACM April, 1965 .A Bellman, R. E. Kagiwada, H. Kalaba, R. E. .N CA650413 JB March 7, 1978 3:39 PM .X 1028 4 1278 1216 4 1278 1216 4 1278 1278 4 1278 1278 4 1278 1278 4 1278 1347 4 1278 1347 4 1278 1396 4 1278 1396 4 1278 1536 4 1278 973 5 1278 1028 5 1278 1029 5 1278 1278 5 1278 1278 5 1278 1278 5 1278 1347 5 1278 1396 5 1278 964 6 1278 1028 6 1278 1028 6 1278 1029 6 1278 1029 6 1278 1083 6 1278 1132 6 1278 1214 6 1278 1278 6 1278 1278 6 1278 1334 6 1278 1365 6 1278 1386 6 1278 1387 6 1278 1388 6 1278 1392 6 1278 1393 6 1278 1394 6 1278 1395 6 1278 1396 6 1278 1397 6 1278 1496 6 1278 284 6 1278 407 6 1278 3199 6 1278 3200 6 1278 3201 6 1278 3202 6 1278 3203 6 1278 3204 6 1278 561 6 1278 730 6 1278 .I 1279 .T Use of a Conditional Base Number System for Encoding Sequences of Correlated Characters .W A procedure is described for the relatively efficient encoding of sequences of characters which have predecessor-successor selection rules. The procedure is shown to assign a unique integer to each sequence and to generate a reasonably compact set of values. .B CACM April, 1965 .A Brown, R. M. .N CA650412 JB March 7, 1978 3:42 PM .X 1279 5 1279 1279 5 1279 1279 5 1279 .I 1280 .T Numerical Integration of a Differential-Difference Equation with a Decreasing Time-Lag .W Systems in which variable time-lags are present are of common occurrence in biology. Variable flow rates are a common cause of these variable lags. At present no extensive body of knowledge exists concerning the effects which these variable lags can cause. Shown here is a method of reducing some differential-difference equations to ordinary differential equations which can then be studied numerically with ease. Subsequent study will deal with situations in which multiple-lags and lags dependent on the solution itself are present. .B CACM April, 1965 .A Bellman, R. E. Buell, J. D. Kalaba, R. E. .N CA650411 JB March 7, 1978 3:46 PM .X 1280 5 1280 1280 5 1280 1280 5 1280 1364 5 1280 1280 6 1280 .I 1281 .T Data Input by Question and Answer .W A data input scheme for a time-sharing computer is described in this paper. Instead of using format statements to determine the input, the computer asks the user for the required values one at a time. The computer converses with the user during the input process, checks for errors, provides standard data, and allows editing of values input. .B CACM April, 1965 .A Pyle, I. C. .N CA650410 JB March 7, 1978 3:48 PM .X 1281 5 1281 1281 5 1281 1281 5 1281 .I 1282 .T The Use of FORTRAN in Subroutines with COBOL Main Programs .W By using the proper COBOL coding techniques and accounting for differences in storage allocation and library routines between the two languages, it is possible to write FORTRAN IV subroutines that may be called from COBOL main programs. Such a technique enables the programmer to take advantage of the most useful properties of each language while minimizing their respective disadvantages. .B CACM April, 1965 .A Shavell, Z. A. .N CA650409 JB March 7, 1978 3:52 PM .X 1282 5 1282 1282 5 1282 1282 5 1282 .I 1283 .T Matrix Inversion (Algorithm 231 [F1]) .B CACM April, 1965 .A Ferring, M. .N CA650408 JB March 7, 1978 3:53 PM .X 1283 5 1283 1283 5 1283 1283 5 1283 .I 1284 .T Bessel Function for a Set of Integer Orders .B CACM April,1965 .A Stafford, J. .N CA650407 JB March 7, 1978 3:54 PM .X 1284 5 1284 1284 5 1284 1284 5 1284 1909 5 1284 134 6 1284 1023 6 1284 1284 6 1284 1316 6 1284 .I 1285 .T Eigenvalues and Eigenvectors of a Real Symmetric Matrix by the QR Method (Algorithm 254 [F2]) .B CACM April, 1965 .A Businger, P. A. .N CA650406 JB March 7, 1978 3:55 PM .X 1285 5 1285 1285 5 1285 1285 5 1285 .I 1286 .T Eigenvalues of a Real Symmetric Matrix by the QR Method (Algorithm 253 [F2]) .B CACM April, 1965 .A Businger, P. A. .N CA650405 JB March 7, 1978 3:56 PM .X 1286 5 1286 1286 5 1286 1286 5 1286 .I 1287 .T Vector Coupling or Clebsch-Gordan Coefficients (Algorithm 252 [Z]) .B CACM April, 1965 .A Gunn, J. H. .N CA650404 JB March 7, 1978 3:58 PM .X 1287 5 1287 1287 5 1287 1287 5 1287 .I 1288 .T CLP-The Cornell List Processor .W Presented in this paper are the highlights of CLP, a teaching language which has been employed at Cornell University and was constructed to serve as a means of introducing simulation and other list-processing concepts. The various advantages of CLP are discussed and examples are given. .B CACM April, 1965 .A Conway, R. W. Delfausse, J. J. Maxwell, W. L. Walker, W. E. .N CA650403 JB March 7, 1978 4:02 PM .X 1179 4 1288 1288 4 1288 1544 4 1288 1646 4 1288 2111 4 1288 2534 4 1288 2556 4 1288 2650 4 1288 1288 5 1288 1288 5 1288 1288 5 1288 830 5 1288 .I 1289 .T Proposed Revised American Standard Code for Information Interchange .B CACM April, 1965 .N CA650402 JB March 7, 1978 4:03 PM .X 1289 5 1289 1289 5 1289 1289 5 1289 .I 1290 .T Transparent-Mode Control Procedures for Data Communication, Using the American Standard Code for Information Interchange -A Tutorial .W This paper gives the considerations of Task Group X3.3.4 in the area of transparent-mode data communication control philosophy. The appearance of this paper was forecast (underthe name of "second-level control") in the earlier tutorial paper, "Control Procedures for Data Communications," Task Group document X3.3.4.44, dated May 1964. The present paper elaborates upon solutions to the problems of transparency to the basic ASCII communication control characters as outlined in the previous paper mentioned above. Moreover, it goes on to cover the additional control problems of handling material such as off line encrypted data or non-ASCII codes by means of systems providing complete character transparency. It does not cover concepts of transparency in which the normal character structure or modulation rate of a system may be abandoned. In conjunction with the earlier tutorial paper, this paper is expected to lead to a proposal for stand ardizationof data communication control procedures using the American Stand ard Code for Information Interchange. .B CACM April, 1965 .N CA650401 JB March 7, 1978 4:10 PM .X 1290 5 1290 1290 5 1290 1290 5 1290 .I 1291 .T Tabular Input of Data .B CACM March, 1965 .A George, R. .N CA650316 JB March 7, 1978 4:11 PM .X 1291 5 1291 1291 5 1291 1291 5 1291 .I 1292 .T On a Divide-and-Correct Method For Variable Precision Division .W Described in this paper is a divide-and-correct method for variable precision division in digital computers. Unlike the earlier methods of Stein and Pope, the present method uses a suitably rounded form of the normalized divisor for getting an estimate of the quotient characters. This results in a correction of at most plus or minus one to the estimate, to obtain the exact quotient character. It is believed that this method will be widely applicable for division operations in variable word-length character-oriented machines. .B CACM March, 1965 .A Krishnamurthy, E. V. .N CA650315JB March 7, 1978 4:16 PM .X 1026 4 1292 1258 4 1292 1258 4 1292 1292 4 1292 1292 4 1292 1497 4 1292 1497 4 1292 1975 4 1292 2605 4 1292 107 5 1292 1026 5 1292 1292 5 1292 1292 5 1292 1292 5 1292 1497 5 1292 1593 5 1292 1975 5 1292 107 6 1292 1026 6 1292 1026 6 1292 1292 6 1292 1292 6 1292 1292 6 1292 1497 6 1292 1593 6 1292 91 6 1292 .I 1293 .T Method is Randomness .W Certain nonrandom properties of a commonly used random number generator are described and analyzed. .B CACM March, 1965 .A Greenberger, M. .N CA650314 JB March 7, 1978 4:18 PM .X 1293 5 1293 1293 5 1293 1293 5 1293 1674 5 1293 1691 5 1293 1293 6 1293 1293 6 1293 1420 6 1293 1631 6 1293 .I 1294 .T Note on Triple-Precision Floating-Point Arithmetic with 132-Bit Numbers .W In a recent paper, Gregory and Raney described a technique for double-precision floating-point arithmetic. A similar technique can be developed for triple-precision floating-point arithmetic and it is the purpose of this note to describe this technique. Only the multiplication and the division algorithms are described, since the addition-subtraction algorithm can be obtained by a trivial modification of the algorithm in Gregory's and Raney's paper. .B CACM March, 1965 .A Ikebe, Y. .N CA650313 JB March 7, 1978 5:54 PM .X 1294 4 1294 1152 5 1294 1294 5 1294 1294 5 1294 1294 5 1294 .I 1295 .T PERT Time Calculations Without Topological Ordering .W A simplified technique is presented for PERT Time calculations without topological ordering. Each event is assigned a unique memory location. An activity is represented by a link. A link is defined as a memory location containing the address of another memory location. The time information for an activity is carried with its link. For a typical net, the majority of activities can be described by one 36-bit cell each. The remainder use two 36-bit cells each. The links are unidirectional; forward during the T(E) calculation (expected completion time for an activity);backward during the T(L) calculation (time latest allowable for completion of an activity). The calculations progress through the net topologically even though the net is not represented topologically in core. .B CACM March, 1965 .A Lass, S. E. .N CA650312 JB March 7, 1978 6:00 PM .X 1295 5 1295 1295 5 1295 1295 5 1295 1611 5 1295 1295 6 1295 340 6 1295 .I 1296 .T Ative (Algorithm 205 [E4]) .B CACM March, 1965 .A Wasscher, E. J. .N CA650311 JB March 7, 1978 6:01 PM .X 1296 5 1296 1296 5 1296 1296 5 1296 .I 1297 .T Steep1 (Algorithm 203 [E4]) .B CACM March, 1965 .A Varah, J. M. .N CA650310 JB March 7, 1978 6:02 PM .X 1297 5 1297 1297 5 1297 1297 5 1297 .I 1298 .T Adaptive Numerical Integration by Simpson's Rule (Algorithm 145 [D1]) .B CACM March, 1965 .A Pike, M. C. .N CA650309 JB March 7, 1978 6:03 PM .X 1298 5 1298 1298 5 1298 1298 5 1298 2093 5 1298 834 6 1298 872 6 1298 1092 6 1298 1298 6 1298 1573 6 1298 429 6 1298 .I 1299 .T Solutions of the Diophantine Equation (Algorithm 139 [A1]) .B CACM March, 1965 .A Bowlden, H. J. .N CA650308 JB March 7, 1978 6:04 PM .X 1299 5 1299 1299 5 1299 1299 5 1299 .I 1300 .T Function Minimization (Algorithm 251[E4]) .B CACM March, 1965 .A Wells, M. .N CA650307 JB March 7, 1978 6:05 PM .X 1300 5 1300 1300 5 1300 1300 5 1300 .I 1301 .T On ALGOL I/O Conventions .B CACM March, 1965 .A Zaremba, W. A. .N CA650306 JB March 7, 1978 6:06 PM .X 1301 5 1301 1301 5 1301 1301 5 1301 .I 1302 .T Parallel Signaling Speeds for Data Transmission (Proposed American Stand ard) .B CACM March, 1965 .N CA650305 JB March 7, 1978 6:08 PM .X 1302 5 1302 1302 5 1302 1302 5 1302 .I 1303 .T A Correspondence Between ALGOL 60 and Church's Lambda-Notation: Part II* .B CACM March, 1965 .A Landin, P. J. .N CA650304 JB March 7, 1978 6:09 PM .X 1303 5 1303 1303 5 1303 1303 5 1303 1469 5 1303 1486 5 1303 1491 5 1303 1781 5 1303 2178 5 1303 2326 5 1303 2470 5 1303 2684 5 1303 3044 5 1303 123 6 1303 196 6 1303 196 6 1303 919 6 1303 990 6 1303 1007 6 1303 1046 6 1303 1131 6 1303 1139 6 1303 1140 6 1303 1140 6 1303 1149 6 1303 1198 6 1303 1215 6 1303 1223 6 1303 1265 6 1303 1303 6 1303 1303 6 1303 1303 6 1303 1303 6 1303 1303 6 1303 1303 6 1303 1303 6 1303 1303 6 1303 1303 6 1303 1323 6 1303 1323 6 1303 1323 6 1303 1323 6 1303 1358 6 1303 1366 6 1303 1421 6 1303 1460 6 1303 1462 6 1303 1463 6 1303 1467 6 1303 1468 6 1303 1469 6 1303 1477 6 1303 1491 6 1303 1496 6 1303 1531 6 1303 1535 6 1303 1565 6 1303 1601 6 1303 1602 6 1303 1613 6 1303 1614 6 1303 1626 6 1303 1641 6 1303 1787 6 1303 1788 6 1303 205 6 1303 210 6 1303 1834 6 1303 1834 6 1303 224 6 1303 249 6 1303 288 6 1303 316 6 1303 381 6 1303 398 6 1303 2059 6 1303 11 6 1303 2127 6 1303 2192 6 1303 2264 6 1303 404 6 1303 410 6 1303 463 6 1303 464 6 1303 483 6 1303 3184 6 1303 3184 6 1303 3184 6 1303 3184 6 1303 3186 6 1303 3188 6 1303 584 6 1303 600 6 1303 680 6 1303 691 6 1303 729 6 1303 763 6 1303 799 6 1303 .I 1304 .T A Rapid Turnaround Multi-Programming System .W In this paper, basic features, system characteristics and the control algorithm for a multi-programming system with rapid turnaround time are described. .B CACM March, 1965 .A Irons, E. T. .N CA650303 JB March 7, 1978 6:19 PM .X 1304 5 1304 1304 5 1304 1304 5 1304 1550 5 1304 1304 6 1304 1472 6 1304 .I 1305 .T The Internal Structure of the FORTRAN CEP Translator .W The FORTRAN CEP translator converts a source program written in the FORTRAN CEP language into an object program written in the language of the CEP computer. In this paper, after an outline of the CEP computer, the internal structure of the translator is described. Emphasis is on the compilation of expressions, of input/output lists, and of subscripted variables. .B CACM March, 1965 .A Mancino, O. G. Cecchi, M. M. .N CA650302 JB March 7, 1978 6:23 PM .X 1305 4 1305 1035 5 1305 1305 5 1305 1305 5 1305 1305 5 1305 .I 1306 .T A Class of Unambiguous Computer Languages .W Discussed in this paper is the concept of a fully nested computer language which may be one means of designing computer languages which would be completely free of ambiguities. Several suggestions are also given here for the redefinition of ALGOL as a fully nested language. .B CACM March, 1965 .A Johnston, J. B. .N CA650301 JB March 7, 1978 6:26 PM .X 249 4 1306 254 4 1306 272 4 1306 1102 4 1306 1109 4 1306 1140 4 1306 1188 4 1306 1306 4 1306 1306 4 1306 1464 4 1306 1491 4 1306 1767 4 1306 1781 4 1306 1781 4 1306 1787 4 1306 1949 4 1306 321 4 1306 2059 4 1306 2126 4 1306 435 4 1306 437 4 1306 463 4 1306 483 4 1306 491 4 1306 2732 4 1306 560 4 1306 583 4 1306 3073 4 1306 627 4 1306 631 4 1306 632 4 1306 642 4 1306 644 4 1306 653 4 1306 680 4 1306 761 4 1306 762 4 1306 763 4 1306 123 4 1306 140 4 1306 919 4 1306 989 4 1306 196 5 1306 1306 5 1306 1306 5 1306 1306 5 1306 463 5 1306 .I 1307 .T A Lightpen-Controlled Program For On-Line Data Analysis .W This paper describes a technique designed to ease the use of a data processing system by a person, in particular, a scientist, who is intimately and primarily concerned with interpreting the significance of data handled by the system. Since such a person is often unable to spend the time necessary to master a programming language, it is essential that he be aided in composing commands to the computer. In the system described, the user is not required to learn or remember the vocabulary of the language because the vocabulary is displayed before him on"menus" by means of a computer-drive scope. He selects the various vocabulary elements required by pointing with the light pen. By use of a small unordered set of rewriting rules applied as a result of light pen selections, the user generates only syntactically correct commands to the system. He does not have to learn or remember the grammar. The program restricts the user severely in the particular language he can use, but the method for communicating with the program makes these restrictions seem quite natural and unconstraining. The program has been used successfully for over ten months. .B CACM February, 1965 .A Goodenough, J. B. .N CA650217 JB March 7, 1978 10:40 PM .X 1307 5 1307 1307 5 1307 1307 5 1307 1978 5 1307 1307 6 1307 1589 6 1307 1813 6 1307 .I 1308 .T A Mathematical Model for Mechanical part Description .W The flexibility of a mathematical model takes advantage of the common information requirements of computer-aided engineering drawing, numerical control tape generation, and physical characteristic computation. By judicious control of man-machine communication requirements, improved results over conventional engineering design processes are possible. An English-like input language, tailored for use by draftsmen and designers, will describe the part and specify the output desired. One approach to the mathematical model consists of a group of surface-defining quadric equations, which are created by a system of modular subprogram. Other subprograms will convert the mathematical model into instructions for driving automatic drafting machines and numerical controlled machine tools. Physical part characteristics, such as center of gravity, can be computed by subprograms and used in dynamic analysis work. The proposed overall system is presented and experiments and demonstrations are discussed. .B CACM February, 1965 .A Luh, J. Y. S. Krolak, R. J. .N CA650216 JB March 7, 1978 10:46 PM .X 1308 5 1308 1308 5 1308 1308 5 1308 .I 1309 .T A Computer User-Oriented System .W A computer language system has been developed which makes possible fast preparation of management reports, regardless of computational complexity or format variety. Costs are sufficiently low so that individually tailored reports can be prepared for every manager. The system requires initial preparation of large data banks containing data in elementary form. Use of two special languages, EXTRACT and MATRAN, permits selective extraction of any data subset, efficient processing through any computational sequence, and flexible presentation of results in either tabular or graphical form. Matrix algebra is used as a fundamental vehicle for accomplishing both manipulation and computation. .B CACM February, 1965 .A Montillon, G. D. .N CA650215 JB March 7, 1978 10:51 PM .X 1309 4 1309 892 4 1309 1309 5 1309 1309 5 1309 1309 5 1309 656 5 1309 .I 1310 .T A Rapid Braille Transliteration Technique for Certain IBM Machines .B CACM February, 1965 .A Weiler, W. J. Klema, V. C. .N CA650214 JB March 7, 1978 10:55 PM .X 1310 5 1310 1310 5 1310 1310 5 1310 .I 1311 .T Efficient Autocorrelation .B CACM February, 1965 .A Schmid, L. P. .N CA650213 JB March 7, 1978 10:56 PM .X 1311 5 1311 1311 5 1311 1311 5 1311 .I 1312 .T Recursion and Iteration .B CACM February, 1965 .A Rice, H. G. .N CA650212 JB March 7, 1978 10:57 PM .X 1312 5 1312 1312 5 1312 1312 5 1312 3121 5 1312 1312 6 1312 308 6 1312 309 6 1312 2456 6 1312 2709 6 1312 .I 1313 .T Construction of Nonlinear Programming Test Problems .B CACM February, 1965 .A Rosen, J. B. Suzuki, S. .N CA650211 JB March 7, 1978 10:58 PM .X 1313 5 1313 1313 5 1313 1313 5 1313 3099 5 1313 3138 5 1313 1313 6 1313 1313 6 1313 2031 6 1313 .I 1314 .T The Organization of Symbol Tables .W An efficient symbol table organization is an important feature in the design of any compiler. During the construction of the Virginia ALGOL 60 compiler for the Burroughs B205, the primary consideration in the symbol table design was that the recognition of identifiers and reserved words should be as rapid as possible. The general features of the technique are described. .B CACM February, 1965 .A Batson, A. .N CA650210 JB March 7, 1978 11:01 PM .X 1314 5 1314 1314 5 1314 1314 5 1314 2033 5 1314 1314 6 1314 1785 6 1314 1786 6 1314 .I 1315 .T Automation of the Radioisotope Accountability System .W The Radioisotope Service of the Veterans Administration Hospital, Omaha, Nebraska, used a manual system of radioisotope accountability for three years. The procedure which was satisfactory but time-consuming was converted from manual to a fully automated computer system in January, 1963. The program for purchased radioisotopes is written in FORMAT FORTRAN for the IBM 1620 Computer. A second program for maintaining accountability for reactor-created radioisotopes is written in the FORCOM p