The Computer Journal, Volume 13, 1970

Volume 13, Number 1, February 1970

• F. J. M. Laver:
  JANUS - Reflections on DATAFAIR 69. 2-6
  
• D. G. R. Buckle, C. H. Hunt, Maureen M. Ryder, S. H. Storey:
  Computers and the Small Firm: 3. 7-9
  
• B. Smith:
  Developments in SPECOL - A Retrieval Language for the Non-Programmer. 10-13
  
• M. G. Notley:
  The Cumulative Recurrence Library. 14-19
  
• Jeffrey S. Rohl, G. Cordingley:
  List Processing Facilities in Atlas Autocode. 20-24
  
• H. D. Baecker:
  The Use of ALGOL 68 for Trees. 25-27
  
• William M. Waite:
  Building a Mobile Programming System. 28-31
  
• David Barton, Stephen R. Bourne, John Fitch:
  An Algebra System. 32-39
  
• Linden F. Blake, Rosemarie E. Lawson, I. M. Yuille:
  A Ring Processing Package for Use with FORTRAN or a Similar High-Level Language. 40-47
  
• M. Joseph:
  An Analysis of Paging and Program Behaviour. 48-54
  
• Derick Wood:
  The Theory of Left Factored Languages: Part 2. 55-62
  
• D. M. Boulton, Chris S. Wallace:
  A Program for Numerical Classification. 63-69
  
• J. Gertler:
  High-Level Programming for Process Control. 70-76
  
• Maurice Clint, A. Jennings:
  The Evaluation of Eigenvalues and Eigenvectors of Real Symmetric Matrices by Simultaneous Iteration. 76-80
  
• S. McKee, A. R. Mitchell:
  Alternating Direction Methods for Parabolic Equations in Two Space Dimensions with a Mixed Derivative. 81-86
  
• M. J. M. Bernal, J. R. Whiteman:
  Numerical Treatment of Biharmonic Boundary Value Problems with Re-Entrant Boundaries. 87-91
  
• P. J. Taylor:
  The Stability of the Du Fort-Frankel Method for the Diffusion Equation with Boundary Conditions Involving Space Derivatives. 92-97
  
• D. J. Rodabaugh:
  On Stable Correctors. 98-100
  
• M. G. Cox:
  A Bracketing Technique for Computing a Zero of a Function. 101-102
  
• J. Snell:
  The Solution in Chebyshev Series of Systems of Linear Differential Equations with General Boundary Conditions. 103-106
  
• M. M. Chawla:
  Estimation of Errors of Gauss-Chebyshev Quadratures. 107-109
  

Volume 13, Number 2, May 1970

• A. Gunton:
  Recovery Procedures for Direct Access Commercial Systems. 123-126
  
• A. L. Humphrey, W. G. Munro:
  Management Information Retrieval. 127-130
  
• Michael Harrop:
  A Basic Approach to Remote Access. 131-135
  
• A. J. T. Colin:
  DOLPHIN - A Text Filing System for University Use. 136-141
  
• A. Learner, A. L. Lim:
  A Note on Transforming Context-Free Grammars to Wirth-Weber Precedence Form. 142-144
  
• R. J. Pankhurst:
  A Computer Program for Generating Diagnostic Keys. 145-151
  
• R. J. Ord-Smith:
  Generation of Permutation Sequences: Part 1. 152-155
  
• A. J. Cole, D. Wishart:
  An Improved Algorithm for the Jardine-Sibson Method of Generating Overlapping Clusters. 156-163
  
• T. I. Silvey, J. R. Barker:
  Hybrid Computing Techniques for Solving Parabolic and Hyperbolic Partial Differential Equations. 164-170
  
• R. R. Allran, S. E. J. Johnsen:
  An Algorithm for Solving Nonlinear Programming Problems Subject to Nonlinear Inequatlity Constraints. 171-177
  
• P. C. Haarhoff, J. D. Buys:
  A New Method for the Optimization of a Nonlinear Function Subject to Nonlinear Constraints. 178-184
  
• B. A. Murtagh, R. W. H. Sargent:
  Computational Experience with Quadratically Convergent Minimisation Methods. 185-194
  
• Donald Greenspan:
  Discrete, Nonlinear String Vibrations. 195-201
  
• R. E. Scraton:
  A Method for Improving the Convergence of Chebyshev Series. 202-203
  
• D. J. Fyfe:
  The Use of Cubic Splines in the Solution of Certain Fourth Order Boundary Value Problems. 204-205
  

Volume 13, Number 3, August 1970

• H. McGregor Ross:
  The British Standard Data Code and How to Exploit it. 223-229
  
• M. D. Buckley-Sharp, F. T. C. Harris:
  A Computer Program for Banking Multiple Choice Questions. 230-236
  
• T. G. McLain, A. R. Trice:
  The MINIMOP Multi-Access Operating System. 237-242
  
• David Barton, Stephen R. Bourne, J. R. Horton:
  The Structure of the Cambridge Algebra System. 243-247
  
• D. Morris, I. R. Wilson, P. C. Capon:
  A System Program Generator. 248-254
  
• Ian A. Macleod:
  SP/1 - A FORTRAN Integrated String Processor. 255-260
  
• Jürg Nievergelt, M. I. Irland:
  Bounce-and-Skip. A Technique for Directing the Flow of Control in Programs. 261-262
  
• Jan B. Hext, P. S. Roberts:
  Syntax Analysis by Domölki's Algorithm. 263-271
  
• Derick Wood:
  A Generalised Normal Form Theorem for Context-Free Grammars. 272-277
  
• A. G. Bell:
  Partitioning Integers in n Dimensions. 278-283
  
• Richard J. Hanson:
  Automatic Error Bounds for Real Roots of Polynomials Having Interval Coefficients. 284-288
  
• H. Van de Vel:
  A Note on the Automatic Pretreatment of Polynomials. 289-290
  
• J. C. Taylor:
  Boundary Value Problems for Singular Ordinary Differential Equations. A Widely Applicable Method for Calculating Eigen-Values. 291-296
  
• G. M. Phillips:
  Analysis of Numerical Iterative Methods for Solving Integral and Integrodifferential Equations. 297-300
  
• A. Jones:
  Spiral - A New Algorithm for Non-Linear Parameter Estimation Using Least Squares. 301-308
  
• G. Peters, James Hardy Wilkinson:
  The Least Squares Problem and Pseudo-Inverses. 309-316
  
• R. Fletcher:
  A New Approach to Variable Metric Algorithms. 317-322
  

Volume 13, Number 4, November 1970

• A. C. Day:
  The Use of Symbol-State Tables. 332-339
  
• J. R. Millenson:
  Language and List Structure of a Compiler for Experimental Control. 340-343
  
• T. H. O'Beirne:
  Computer Programs Which Play Music with Microtones. 344-349
  
• D. P. Treble:
  Computers and Composition in Change Ringing. 350-351
  
• K. J. MacCallum:
  Surfaces for Interactive Graphical Design. 352-358
  
• K. M. Waliuzzaman, Zvonko G. Vranesic:
  On Decomposition of Multi-Valued Switching Functions. 359-362
  
• M. R. Abbott:
  Numerical method for Calculating the Dynamic Behaviour of a Trolley Wire Overhead Contact System for Electric Railways. 363-368
  
• C. W. J. McCallien:
  The Solution of Reactor Diffusion Problems. 369-377
  
• D. B. Hunter:
  Clenshaw's Method for Evaluating Certain Finite Series. 378-381
  
• Ian Barrodale, F. D. K. Roberts, C. R. Hunt:
  Computing Best l_p Approximations by Functions Nonlinear in one Parameter. 382-386
  
• James S. Meditch:
  Newton's Method in Discrete-Time Nonlinear Data Smoothing. 387-391
  
• D. J. McConalogue:
  A Quasi-Intrinsic Scheme for Passing a Smooth Curve Through a Discrete Set of Points. 392-396
  
• Melvin R. Scott:
  Numerical Solution of Unstable Initial Value Problems by Invariant Imbedding. 397-400
  
• P. G. O'Regan:
  Step Size Adjustment at Discontinuities for Fourth Order Runge-Kutta Methods. 401-404
  
• V. A. LoDato:
  The Permutation of a Certain Class of Matrices. 405-410
  
• A. R. Gourlay:
  Generalisation of Elematary Hermitian Matrices. 411-412
  
• J. O. Ramsay:
  A Family of Gradient Methods for Optimization. 413-417
  
• G. Peckham:
  A New Method for Minimising a Sum of Squares Without Calculating Gradients. 418-420
  

Last update Tue May 21 18:31:09 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page