Communications of the ACM (CACM), Volume 5, 1962

Volume 5, Number 1, January 1962

• Harry D. Huskey:
  Letter from the president of ACM. 1
  
• C. E. Miller:
  SIGMAP. 1
  
• Edgar Karst:
  More about the Siemens 2002. 6
  
• Larry Travis:
  In defense of artificial intelligence research. 6-7
  
• Bernard A. Galler:
  Definition of software. 6
  
• B. F. Handy Jr.:
  ACM 61 acknowledgements. 7
  
• Herbert Ohlman:
  Discussion: The pros and cons of a special IR language: pro a special IR language. 8-10
  
• Jean E. Sammet:
  Discussion - the pros and cons of a special IR language: comments. 8
  
• H. G. Bohnert:
  Discussion: The pros and cons of a special IR language: comments. 10
  
• Robert A. Colilla, Burnett H. Sams:
  Information structures for processing and retrieving. 11-16
  
• T. L. Wang:
  An information system with the ability to extract intelligence from data. 16-18
  
• Victor H. Yngve:
  COMIT as an IR language. 19-28
  
• Robert F. Barnes:
  Language problems posed by heavily structured data. 28-34
  
• Thomas E. Cheatham Jr., Stephen Warshall:
  Translation of retrieval requests couched in a "semiformal" English-like language. 34-39
  
• J. D. Sable:
  Use of semantic structure in information systems. 40-42
  
• Mandalay Grems:
  A survey of languages and systems for information retrieval. 43-46
  
• J. E. L. Peck:
  Alorithm 74: Curve fitting with constraints. 47
  
• Ivan Flores:
  Algorithm 76: Sorting procedures. 48-50
  
• J. E. L. Peck:
  Algorithm 75: Factors. 48
  
• Brian Randell, C. G. Broyden:
  Certification of Algorithm 66: INVRS. 50
  
• Kalman J. Cohen:
  Certification of Algorithm 30: Numerical solution of the polynomial equation. 50
  
• Brian Randell:
  Certification of Algorithm 50: Inverse of a finite segment of the Hilbert matrix. 50
  
• Joseph Henry Wegstein, W. W. Youden:
  A string language for symbol manipulation based on ALGOL 60. 54-61
  
• Roger L. Boyell:
  Real-time simulation of mapping radar. 61
  
• Saul Gorn:
  Theory of mechanical languages. 62
  
• Herbert M. Teager:
  Real-time, time-shared computer project. 62
  
• Richard G. Larson, Peter H. Sellers, Ruben Meyer:
  Simulation and analysis of biochemical systems: II. solution of differential equations. 63-65
  

Volume 5, Number 2, February 1962

• Otto Mond:
  Using an IF statement for bed comparison. 78
  
• Harry D. Huskey:
  Letter from the President. 79
  
• H. R. Schwarz:
  An introduction to ALGOL: a tutorial paper on ALGOL with explanations and examples to make the use of the ALGOL report more familiar. 82-95
  
• Peter Wegner:
  Priority assignment in a time-shared computer installation. 95
  
• Paul E. Hennion:
  Algorithm 77: Interpolation, differentiation, and integration. 96
  
• Thomas P. Giammo:
  Algorithm 79: Difference expression coefficients. 97
  
• C. Perry:
  Algorithm 78: Rational roots of polynomials with integer coefficients. 97
  
• Leonard F. Longo:
  SURGE: a recoding of the COBOL merchandise control algorithm. 98-100
  
• J. B. Watt, W. H. Wattenburg:
  A NELIAC-generated 7090-1401 compiler. 101-102
  
• James J. Baker:
  A note on multiplying Boolean matrices. 102
  
• Conrad Weisert:
  Tape splitting in an iterative program. 102
  
• Gerard Salton:
  Manipulation of trees in information retrieval. 103-114
  
• David Garfinkel, William Polk, Joseph J. Higgins, Robert T. Ochser:
  Simulation and analysis of biochemical systems: III. analysis and pattern recognition. 115-118
  
• George E. Forsythe, J. Von der Groeben, J. G. Toole:
  Vectorcardiographic diagnosis with the aid of ALGOL. 118-122
  

Volume 5, Number 3, March 1962

• Harry D. Huskey:
  Letter from the President of ACM. 131
  
• Robert S. Ledley, James B. Wilson:
  Automatic-programming-language translation through syntactical analysis. 145-155
  
• P. V. Ellis:
  An evaluation of autocode readability. 156-159
  
• William C. Lynch:
  On a wired-in binary-to-decimal conversion scheme. 159
  
• A. A. Grau:
  On a floating-point number representation for use with algorithmic languages. 160-161
  
• Joseph Weizenbaum:
  Knotted list structures. 161-165
  
• Malcolm B. Foster:
  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. 165
  
• William Holsten:
  Algorithm 80: Reciprocal gamma function of real argument. 166
  
• Brian H. Mayoh:
  Algorithm 81: Economising a sequence 1. 166-167
  
• Brian H. Mayoh:
  Algorithm 82: Economising a sequence 2. 167
  
• Brian H. Mayoh:
  Algorithm 83: Optimal classification of objects. 167-168
  
• Henry C. Thacher Jr.:
  Certification of Algorithm 60: Romberg integration. 168
  
• Maurice H. Halstead:
  Certification of Algorithm 78: Ratfact. 168
  
• Leon Davidson:
  Retrieval of misspelled names in an airlines passenger record system. 169-171
  
• Walter M. Carlson:
  Computers: The key to total systems control: an industrial viewpoint. 172-173
  

Volume 5, Number 4, April 1962

• Donald E. Knuth, Saul Gorn:
  Backus' language. 185
  
• Harry D. Huskey:
  Letter from the President of ACM. 186
  
• Robert Bosak, Richard F. Clippinger, Carey Dobbs, Roy Goldfinger, Renee B. Jasper, William Keating, George Kendrick, Jean E. Sammet:
  An information algebra: phase 1 report - language structure group of the CODASYL development committee. 190-204
  
• H. Hellerman:
  Addressing multidimensional arrays. 205-207
  
• Paul E. Hennion:
  Algorithm 84: Simpson's integration. 208
  
• Thomas G. Evans:
  Algorithm 85: Jacobi. 208
  
• J. E. L. Peck, Günther F. Schrack:
  Algorithm 86: Permute. 208-209
  
• J. E. L. Peck, Günther F. Schrack:
  Certification of Algorithm 71: Permutation. 209
  
• P. J. Brown:
  Certification of Algorithm 35: Sieve. 209
  
• Donald E. Knuth:
  The calculation of Easter. 209-210
  
• P. J. Brown:
  Certification of Algorithm 71: Permutation. 209
  
• John R. Howell:
  Algorithm 87: Permutation generator. 209
  
• C. J. Kaiser:
  A method for eliminating ambiguity due to signal coincidence in digital design. 211-220
  
• Fred Gruenberger:
  Use of newer character-addressable machines for high precision. 221
  
• O. Paul Staderman:
  On magnetic tape transfer rates. 221
  
• Lauren B. Doyle:
  Associated characteristics of words in text. 223
  
• Michael Kassler:
  Decision of a musical system. 223
  
• Edward A. Feigenbaum, Herbert A. Simon:
  Simulation of human verbal learning behavior. 223
  

Volume 5, Number 5, May 1962

• Harry D. Huskey:
  Letters from the President of ACM. 235
  
• Joseph F. Cunnigham:
  Why COBOL? 236
  
• Jean E. Sammet:
  Basic elements of COBOL 61. 237-253
  
• A. Lippitt:
  COBOL and compatability. 254-255
  
• Milton Siegel, Albert E. Smith:
  Interim report on bureau of ships COBOL evaluation program. 256-259
  
• Richard Berman, Joseph Sharp, Lawrence Sturges:
  Syntactical charts of COBOL 61. 260
  
• W. L. Donally:
  A report writer for COBOL. 261
  
• W. Hicks:
  The COBOL Librarian: a key to object program efficiency. 262
  
• James C. Emery:
  Modular data processing systems written in COBOL. 263-268
  
• O. Kesner:
  Floating-point arithmetic in COBOL. 269-271
  
• I. Greene:
  Guides to teaching COBOL. 272-273
  
• C. A. Bouman:
  An advanced input-output system for a COBOL compiler. 273-277
  
• J. P. Mullin:
  An introduction to a machine-independent data division. 277-278
  
• J. W. Mullen:
  COBOL batching problems. 278-279
  
• John L. Cundiff:
  Algorithm 88: Evaluation of asymptotic expression for the fresnel sine and cosine integrals. 280
  
• John L. Cundiff:
  Algorithm 89: Evaluation of the fresnal sine integral. 280
  
• John L. Cundiff:
  Algorithm 90: Evaluation of the fresnal cosine integral. 281
  
• Albert Newhouse:
  Algorithm 91: Chebyshev curve-fit. 281
  
• Karl Heinz Buchner:
  Certification of Algorithm 60: Romberg integration. 281
  
• Norman Landis, Andrew Manos, L. Richard Turner:
  Initial experience with an operating multiprogramming system. 282-286
  
• Derek Johann Roek:
  Algorithm 92: Simultaneous system of equations and matrix inversion routine. 286
  

Volume 5, Number 6, June 1962

• Harry D. Huskey:
  Letter from the retiring President of ACM. 297
  
• Bruce Gilchrist:
  ACM membership survey. 297
  
• Anthony G. Oettinger, Howard H. Aiken:
  Retiring computer pioneer. 298-299
  
• Franz L. Alt:
  Fifteen years ACM. 300-307
  
• Isaac L. Auerbach, A. Walther, Ambros P. Speiser:
  International federation of information processing news. 308
  
• Irving N. Rabinowitz:
  Report on the algorithmic language FORTRAN II. 327-337
  
• Henry C. Thacher Jr.:
  A redundancy check for ALGOL programs. 337-342
  
• Terence G. Jones:
  A note on sampling a tape-file. 343
  
• C. A. Oster:
  One lost bit. 343
  
• Millard H. Perstein:
  Algorithm 93: General order arithmetic. 344
  
• Jerome M. Kurtzberg:
  Algorithm 94: Combination. 344
  
• Frank Stockmal:
  Algorithm 95: Generation of partitions in part-count form. 344
  
• Robert W. Floyd:
  Algorithm 96: Ancestor. 344-345
  
• Robert W. Floyd:
  Algorithm 97: Shortest path. 345
  
• Stephen J. Garland, Anthony W. Knapp:
  Algorithm 99: Evaluation of Jacobi symbol. 345-346
  
• John L. Pfaltz:
  Algorithm 98: Evaluation of definite complex line integrals. 345
  
• Philip J. Kiviat:
  Algorithm 100: Add item to chain-linked list. 346
  
• Philip J. Kiviat:
  Algorithm 101: Remove item from chain-linked list. 346
  
• Günther F. Schrack, M. Shimrat:
  Algorithm 102: Permutation in lexicographical order. 346
  
• Bichard Steck:
  Remark on Algorithm 19: Rinomial coefficients. 347
  
• A. P. Relph:
  Certification of Algorithm 46: Exponential of a complex number. 347
  
• Richard A. Conger:
  Certification of Algorithm 58: Matrix inversion. 347
  
• A. P. Relph:
  Certification of Algorithm 48: Logarithm of a complex number. 347
  
• Guy F. Kuncir:
  Algorithm 103: Simpson's rule integrator. 347
  
• John Caffrey:
  Certification of Algorithm 66: Invrs. 348
  
• Brian Randell:
  Remark on Algorithm 76: Sorting procedures. 348
  
• Victor E. Whittier:
  Certification of Algorithm 77: Avint. 348
  
• A. P. Relph:
  Certification of Algorithm 67: Cram. 348
  
• James W. Hanson, Jane Shearin Caviness, Camilla Joseph:
  Analytic differentiation by computer. 349-355
  
• Peter Zilahy Ingerman:
  General language translation schemata. 356
  
• Clarice MacDonald:
  Trajectory computation in a problem-oriented language. 356
  
• Harold Borko:
  Criteria for acceptable abstracts. 356
  
• M. R. Kellington:
  Digitaria sanguinalis. 364
  
• R. E. Dickie:
  More on an IF statement for bed comparison. 364
  
• Morton Nadler:
  IFAC conference: Corrected impression. 364
  

Volume 5, Number 7, July 1962

• George H. Mealy:
  Programming systems, whither? 374-375
  
• Peter Wegner:
  Communications between independently translated blocks. 376-381
  
• Klaus Appel:
  Solution of Eigenvalue problems with approximately known Eigenvectors. 381
  
• L. J. Larsen:
  A modified inversion procedure for product form of the inverse linear programming codes. 382-383
  
• Roger H. Simonsen:
  Simulation of a computer timing device. 383-384
  
• H. H. Bottenbruch, A. A. Grau:
  On translation of Boolean expressions. 384-386
  
• Friedrich L. Bauer, Josef Stoer:
  Algorithm 105: Newton Maehly. 387-388
  
• Heinz Rutishauser:
  Algorithm 104: Reduction to Jacobi. 387
  
• Margaret L. Johnson, Ward C. Sangren:
  Algorithm 106: Complex number to a real power. 388
  
• Jay W. Counts:
  Algorithm 107: Gauss's method. 388
  
• Yuri A. Kruglyak, Donald R. Whitman:
  Algorithm 109: Definite exponential integrals B. 388-389
  
• Yuri A. Kruglyak, Donald R. Whitman:
  Algorithm 108: Definite exponential integrals A. 388
  
• Yuri A. Kruglyak, Donald R. Whitman:
  Algorithm 110: Quantum mechanical integrals of Slater-type orbitals. 389-390
  
• Yuri A. Kruglyak, Donald R. Whitman:
  Algorithm 111: Molecular-orbital calculation of molecular interactions. 390-391
  
• Richard George:
  Certification of Algorithm 51: Adjust inverse of a matrix when an element is perturbed. 391
  
• Margaret L. Johnson, Ward C. Sangren:
  Remark on Algorithm 48: Logarithm of a complex number. 391
  
• Margaret L. Johnson, Ward C. Sangren:
  Remark on Algorithm 34: Gamma function. 391
  
• A. P. Relph:
  Certification of Algorithm 70: Interpolation by Aitken. 392
  
• A. P. Relph:
  Certification of Algorithm 84: Simpson's integration. 392
  
• A. P. Relph:
  Certification of Algorithm 57: Ber or bei function. 392
  
• A. P. Relph:
  Certification of Algorithm 75: Factors. 392
  
• Yuri A. Kruglyak, Donald R. Whitman:
  Certification of Algorithm 108: Definite exponential integrals A. 393
  
• Yuri A. Kruglyak, Donald R. Whitman:
  Certification of Algorithm 110: Quantum mechanical integrals of Slater-type orbitals. 393
  
• Yuri A. Kruglyak, Donald R. Whitman:
  Certification of Algorithm 109: Definite exponential integrals B. 393
  
• Martin Davis, George Logemann, Donald W. Loveland:
  A machine program for theorem-proving. 394-397
  
• Robert M. Baer:
  Nonlinear regression and the solution of simultaneous equations. 397-398
  
• Herbert G. Bohnert:
  Logic of English grammar. 398
  
• Morio Onoe:
  Triangular walk pattern for the down-hill method of solving a transcendental equation. 398
  
• Herbert E. Salzer:
  Quick calculation of Jacobian elliptic functions. 399
  
• P. R. Peabody, David S. Adorno:
  Digital synthesis of correlated stationary noise. 400-401
  
• W. Fraser, J. F. Hart:
  On the computation of rational approximations to continuous functions. 401-403
  
• William Phillips Jr., Anita K. Bahn, Mabel Miyasaki:
  Person-matching by electronic methods. 404-407
  
• William Siler, John S. Laughlin:
  A computer method for radiation treatment planning. 407-408
  
• D. E. Robison, L. A. Aroian:
  Regression and coded patterns in data editing. 409-411
  
• D. K. Robbins:
  FORTRAN for business data processing. 412-414
  

Volume 5, Number 8, August 1962

• Ranan B. Banerji:
  The description list of concepts. 426-432
  
• I. C. Pyle:
  Character manipulation in FORTRAN. 432-433
  
• John R. Howell:
  A computer technique for handling analysis of variance. 433
  
• M. Shimrat:
  Algorithm 112: Position of point relative to polygon. 434
  
• Frank Stockmal:
  Algorithm 114: Generation of partitions with constraints. 434
  
• H. F. Trotter:
  Algorithm 115: Perm. 434-435
  
• Robert W. Floyd:
  Algorithm 113: Treesort. 434
  
• D. M. Collison:
  Algorithm 117: Magic square (even order). 435
  
• Robert L. Smith:
  Algorithm 116: Complex division. 435
  
• Burton Eisenman, Martin Shapiro:
  Algorithm 119: Evaluation of a pert network. 436-437
  
• D. M. Collison:
  Algorithm 118: Magic square (odd order). 436
  
• Richard George:
  Algorithm 120: Matrix inversion II. 437
  
• Henry C. Thacher Jr.:
  Certification of Algorithm 18: Rational interpolation by continued fractions. 437
  
• Henry C. Thacher Jr.:
  Certification of Algorithm 37: Telescope 1. 438
  
• Henry C. Thacher Jr.:
  Certification of Algorithm 57: Ber or bei function. 438
  
• J. S. Hillmore:
  Certification of Algorithm 52: A set of test matrices. 438
  
• J. S. Hillmore:
  Certification of Algorithm 35: Sieve. 438
  
• Richard George:
  Certification of Algorithm 58: Matrix inversion. 438-439
  
• Richard George:
  Certification of Algorithm 19: Binomial coefficients. 438
  
• George W. Struble:
  Remark on Algorithm 58: Matrix inversion. 438
  
• J. S. Hillmore:
  Certification of Algorithms 63, 64, 65: Partition, quicksort, find. 439
  
• D. M. Collison:
  Certification of Algorithm 72: Composition generator. 439
  
• J. S. Hillmore:
  Certification of Algorithm 71: Permutation. 439
  
• J. S. Hillmore:
  Certification of Algorithm 75: Factors. 439
  
• D. M. Collison:
  Certification of Algorithm 86: Permute. 440
  
• Richard George:
  Remark on Algorithm 84: Simpson's integration. 440
  
• D. M. Collison:
  Certification of Algorithm 117 and 118: Magic square (odd and, even orders). 440
  
• D. M. Collison:
  Remark on Algorithm 78: Rational roots of polynomials with integer coefficients. 440
  
• J. S. Hillmore:
  Certification of Algorithm 85: Jacobi. 440
  
• D. M. Collison:
  Certification of Algorithm 87: Permutation generator. 440
  
• Brian Gluss:
  Further remarks on line segment curve-fitting using dynamic programming. 441-443
  
• J. L. Brenner:
  A set of matrices for testing computer programs. 443-444
  
• William R. Busing, Henri A. Levy:
  A procedure for inverting large symmetric matrices. 445-446
  
• H. A. Luther, L. F. Guseman Jr.:
  A finite sequentially compact process for the adjoints of matrices over arbitrary integral domains. 447-448
  
• John G. Haynes:
  A generalized combinatorial problem. 449
  
• William C. McGee:
  The property classification method of file design and processing. 450-458
  
• G. Schay Jr., Wilhelm G. Spruth:
  Analysis of a file addressing method. 459-462
  

Volume 5, Number 9, September 1962

• Jane G. Jodeit:
  On addressing multidimensional arrays. 468
  
• G. T. Lake:
  Hardware conversion of decimal and binary numbers. 468-469
  
• Saul I. Gass, Joseph K. Slap:
  National ACM membership survey. 470-472
  
• John P. Penny, T. Pearcey:
  Use of multiprogramming in the design of a low cost digital computer. 473-476
  
• David Garfinkel:
  Programmed methods for printer graphical output. 477-479
  
• Stuart S. Shaffer:
  Current status of IPL-V for the Philco 2000 computer (June 1962). 479
  
• John W. Weil:
  A heuristic for page turning in a multiprogrammed computer. 480-481
  
• David Shafer:
  Algorithm 121: Normdev. 482
  
• Gerard F. Dietzel:
  Algorithm 122: Tridiagonal matrix. 482-483
  
• Luis J. Shaefer:
  Algorithm 124: Hankel function. 483
  
• Robert W. Floyd:
  On the nonexistence of a phrase structure grammar for ALGOL 60. 483-484
  
• Julian Feldman:
  TALL: A list processor for the Philco 2000 computer. 484-485
  
• G. W. Armerding, Fred Gruenberger, S. L. Marks, T. R. Parkin:
  A one-day look at computing. 486-487
  

Volume 5, Number 10, October 1962

• Robert P. Larsen:
  More on using an IF statement for bed comparison. 497
  
• Mary Ferguson:
  Still more on bed comparisons. 497
  
• C. C. Gotlieb:
  IFIP-62: Council meetings-notes. 500-501
  
• J. F. Traub:
  IFIP-62: Comments. 500-501
  
• Armando G. Mendoza:
  A dispersion pass algorithm for the polyphase merge. 502-504
  
• H. D. Baecker:
  Implementing a stack. 505-507
  
• Mervin E. Muller:
  Futher remarks on sampling a tape file - I. 507-508
  
• Morton Nadler:
  Further remarks on sampling a tape file - II. 508
  
• Lynn Yarbrough:
  Input data organization in FORTRAN. 508-509
  
• M. L. Pei:
  A test matrix for inversion procedures. 508
  
• Heinz Rutishauser:
  Algorithm 125: Weightcoeff. 510-511
  
• Jay W. Counts:
  Algorithm 126: Gauss' method. 511
  
• Philip J. Walsh:
  Algorithm 127: Ortho. 511-513
  
• Lars Hellberg:
  Certification of Algorithm 40: Critical path scheduling. 513
  
• M. Wells:
  Algorithm 128: Summation of Fourier series. 513
  
• Günther F. Schrack, M. Shimrat:
  Certification of Algorithm 87: Permutation generator. 514
  
• Günther F. Schrack:
  Certification of Algorithm 115: Perm. 514
  
• David K. Jefferson:
  Remark on Algorithm 73: Incomplete elliptic integrals. 514
  
• Richard George:
  Certification of Algorithm 93: General order arithmetic. 514
  
• Michael P. Barnett, Robert P. Futrelle:
  Syntactic analysis by digital computer. 515-526
  
• Robert W. Floyd:
  On ambiguity in phrase structure languages. 526
  
• Lawrence Stark, Mitsuharu Okajima, Gerald H. Whipple:
  Computer pattern recognition techniques: electrocardiographic diagnosis. 527-531
  
• Martin Lipkin, Max A. Woodbury:
  Coding of medical case history data for computer analysis. 532-534
  

Volume 5, Number 11, November 1962

• Gary Boswell:
  Comment on analytic differentiation by computer. 545
  
• A. D. Stiegler:
  An algebraic compiler for the FORTRAN assembly program. 545
  
• C. A. Oster:
  More on testing BCD words with FORTRAN. 545
  
• Virginia W. Whitley:
  Algorithm 129: Minifun. 550-551
  
• B. Curtis Eaves:
  Algorithm 130: Permute. 551
  
• V. H. Smith, M. L. Allen:
  Algorithm 131: Coefficient determination. 551
  
• James C. Browne:
  Algorithm 132: Quantum mechanical integrals over all Slater-type integrals. 551-553
  
• Peter G. Behrenz:
  Algorithm 133: Random. 553
  
• William M. McKeeman:
  Algorithm 135: Crout with equilibration and iteration. 553-555
  
• Henry E. Fettis:
  Algorithm 134: Exponentiation of series. 553
  
• David M. Dahm, M. Wells:
  Algorithm 138: Nesting of for statement II. 555-556
  
• David M. Dahm, M. Wells:
  Algorithm 137: Nesting of for statement I. 555
  
• M. Wells:
  Algorithm 136: Enlargement of a group. 555
  
• Peter Zilahy Ingerman:
  Algorithm 141: Path matrix. 556
  
• Peter Zilahy Ingerman:
  Algorithm 140: Matrix inversion. 556
  
• M. R. Williams:
  Certification of the calculation of Easter. 556
  
• J. E. L. Peck:
  Algorithm 139: Solutions of the diophantine equation. 556
  
• Ronald W. May:
  Certification of Algorithm 94: Combination. 557
  
• Ronald W. May:
  Remark on algorithm 99: Evaluation of Jacobi symbol. 557
  
• Peter G. Behrenz:
  Certification of Algorithm 84: Simpson's integration. 557
  
• Grant W. Erwin Jr.:
  Remark on Algorithm 106: Complex number to a real power. 557
  
• William M. McKeeman:
  Certification of Algorithm 135: Crout with equilibration and iteration. 557
  
• A. B. Kahn:
  Topological sorting of large networks. 558-562
  
• Howard B. Newcombe, James M. Kennedy:
  Record linkage: making maximum use of the discriminating power of identifying information. 563-566
  
• Lawrence Stark, Robert Payne, Yutaka Okabe:
  Online digital computer measurement of a neurological control system. 567-568
  

Volume 5, Number 12, December 1962

• Edward F. Storm:
  Printer plotting not new. 574
  
• Leon Bloom, Morris Cohen, Sigmund N. Porter:
  Page turning in multiprogrammed computers. 574-575
  
• Bernard A. Galler:
  SHARE information available to nonmembers. 574
  
• Walter H. Burkhardt:
  Accuracy and precision with a character-addressable machine. 575
  
• Michael H. Bernstein:
  A missing factor in medical case history? 575
  
• Richard L. Nelson:
  Machine graphing. 575
  
• C. C. Gotlieb:
  Thank you. 575
  
• Saul Gorn:
  Mechanical pragmatics: a time-motion study of a miniature mechanical linguistic system: a set of examples presented to ASA X3-4 subcommittee. 576-589
  
• Bernard A. Galler, Alan J. Perlis:
  Compiling matrix operations. 590-594
  
• Donald E. Knuth:
  Evaluation of polynomials by computer. 595-599
  
• G. J. Vasilakos:
  A decision matrix as the basis for a simple data input routine. 599-601
  
• Jesse H. Poore Jr.:
  Character manipulation in 1620 FORTRAN II. 602
  
• John A. Sonquiest:
  Fixed-word-length arrays in variable-word-length computers. 602
  
• W. L. Hafley, J. S. Lewis:
  Algorithm 142: Triangular regression. 603-604
  
• Arthur F. Kaupe Jr.:
  Algorithm 143: Treesort 1. 604
  
• Arthur F. Kaupe Jr.:
  Algorithm 144: Treesort 2: . 604
  
• William M. McKeeman:
  Algorithm 145: Adaptive numerical integration by Simpson's rule. 604
  
• William M. McKeeman:
  Algorithm 146: Multiple integration. 604-605
  
• D. Amit:
  Algorithm 147: PSIF. 605
  
• Jack N. Merner:
  ACM Algorithm 149: Complete Elliptic Integral. 605
  
• D. M. Collison:
  Algorithm 148: Term of magic square. 605
  
• Peter G. Behrenz:
  Certification of Algorithm 31: Gamma function. 605
  
• Richard Hacker:
  Certification of Algorithm 112: Position of point relative to polygon. 606
  
• Peter G. Behrenz:
  Remark on Algorithm 133: Random. 606
  
• Peter G. Behrenz:
  Remark on Algorithm 58: Matrix inversion. 606
  
• Henry C. Thacher Jr.:
  Certification of Algorithm 118: Magic square (odd order). 606
  
• R. E. Grench:
  Certification of Algorithm 94: Combination. 606
  
• E. S. Phillips:
  Certification of Algorithm 115: Perm. 606
  
• Roy N. Freed:
  Legal implications of computer use. 607-612
  
• David D. Morrison, James D. Riley, John F. Zancanaro:
  Multiple shooting method for two-point boundary value problems. 613-614
  
• H. K. Schuff:
  A subjective viewpoint: The use of digital computers in Western Germany. 615-617
  
• R. Wheelins:
  New Products: IBM 1440 data processing system features five new units. 618-620