The Computer Journal, Volume 20, 1977

Volume 20, Number 1, February 1977

Business Applications

• 
  S. J. Waters:
  CAM02: A Structured Precedence Analyser. 2-5
• 
  Burt M. Leavenworth:
  Non-Procedural Data Processing. 6-9
• 
  B. J. Edwards:
  Choice of Block Sizes for Magnetic Tape Files. 10-14

Advanced Programming and System Programming

• 
  Alfonso F. Cardenas, James P. Sagamang:
  Doubly-Chained Tree Data Base Organisation-Analysis and Design Strategies. 15-26
• 
  K. Forbes, Ashley W. Goldsworthy:
  A Prescheduling Algorithm-Scheduling a Suitable Mix Prior to Processing. 27-29
• 
  Donald Nudds:
  The Design of the MAX Macroprocessor. 31-36
• 
  C. Piney:
  A Generalised Interactive System for the Acquisition of Structured Data. 37-44
• 
  M. Howard Williams:
  Generating Structured Flow Diagrams: The Nature of Unstructuredness. 45-50
• 
  Barry G. T. Lowden, I. R. MacCallum:
  Some Consequences of Deferred Binding in COBOL. 51-55

Computer Science Theory

• 
  D. T. Goodwin:
  Conditions for Underflow and Overflow of an Arithmetic Stack. 56-62
• 
  Derick Wood:
  Two Variations on n-Parallel Finite State Generators. 63-67

Hardware and Logic Design

• 
  Michael J. B. Duff, D. M. Watson:
  The Cellular Logic Array Image Processor. 68-72
• 
  A. Tosser, D. Dubus:
  Algebraic Optimisation of NAND-NOR Switching Circuits. 73-77

Technical Applications

• 
  A. M. Macnaghten, C. A. R. Hoare:
  Fast Fourier Transform Free From Tears. 78-83
• 
  J. W. Akitt:
  Function Minimisation Using the Nelder and Mead Simplex Method with Limited Arithmetic Precision: The Self Regenerative Simplex. 84-85

Volume 20, Number 2, May 1977

Business Applications

• 
  A. Parkin:
  The Probable Outcomes of a Data Processing Project. 98-101

Advanced Programming and System Programming

• 
  Ronald K. Stamper:
  The LEGOL 1 Prototype System and Language. 102-108
• 
  R. H. Pierce, J. Rowell:
  A Transformation-Directed Compiling System. 109-115
• 
  Ken J. McDonell:
  An Inverted Index Implementation. 116-123
• 
  H. R. A. Townsend:
  SST - A Program for the Automatic Generation of Symbol State Tables. 124-127
• 
  P. Kammerer:
  Excluding Regions. 128-131

Computer Science Theory

• 
  Yehuda Wallach:
  Scheduling Algorithms for Concurrent Execution. 132-136
• 
  Efrem G. Mallach:
  Scatter Storage Techniques: A Unifying Viewpoint and a Method for Reducing Retrieval Times. 137-140
• 
  Julian R. Ullmann:
  A Binary n-Gram Technique for Automatic Correction of Substitution, Deletion, Insertion and Reversal Errors in Words. 141-147
• 
  Dennis de Champeaux, Lenie Sint:
  An Optimality Theorem for a Bi-Directional Heuristic Search Algorithm. 148-150
• 
  J. Schwarz:
  Generic Commands - A Tool for Partial Correctness Formalisms. 151-155

Hardware and Logic Design

• 
  Warwick S. Ford, V. Carl Hamacher:
  Low Level Architecture Features for Supporting Process Communication. 156-162
• 
  A. Kaletzky, D. W. Lewin:
  Problem Orientated Language for Logic Design. 163-169

Technical Applications

• 
  James N. Lyness, J. J. Kaganove:
  A Technique for Comparing Automatic Quadrature Routines. 170-177
• 
  Yaakov L. Varol:
  On the Generation of the Pseudo-Remainder in Polynomial Division. 178-180
• 
  David J. Evans:
  On the Use of Fast Methods for Solving Boundary Value Problems. 181-184
• 
  R. J. Clasen:
  A Note on the Use of the Conjugate Gradient Method in the Solution of a Large System of Sparse Equations. 185-186

Discussion

• 
  N. Teskey:
  Discussion and Correspondence KATE: A Macro-Processor for Extending Command Languages. 187-189

Volume 20, Number 3, August 1977

Business Applications

• 
  P. Stecher:
  Proposal for an Interface System Between the Business and Data Processing Systems. 194-201
• 
  A. D. Wilkie:
  Table Look-Up (with Examples in COBOL). 202-206
• 
  S. J. Waters:
  Majority Verdicts in Multi-Processing - Any Two from Three. 207-212

Advanced Programming and System Programming

• 
  Deane B. Blazie, Leon S. Levy:
  A Cross Compiler for Pocket Calculators. 213-221
• 
  William D. Haseman, Andrew B. Whinston:
  Automatic Application Program Interface to a Data Base. 222-226
• 
  Roland N. Ibbett, M. A. Husband:
  The MU5 Name Store. 227-231
• 
  Richard G. Hamlet:
  Testing Programs with Finite Sets of Data. 232-237

Computer Science Theory

• 
  Anthony G. Middleton:
  A Case for Type and Form Flow Analysis. 238-241
• 
  J. M. Robson:
  Worst Case Fragmentation of First Fit and Best Fit Storage Allocation Strategies. 242-244
• 
  Olli Nevalainen, M. Vesterinen:
  Determining Blocking Factors for Sequential Files by Heuristic Methods. 245-247
• 
  Peter Scheuermann:
  Modelling the Information Space in Physical Storage at Different Levels of Detail. 248-256
• 
  P. W. Williams, M. T. Khallaghi:
  Document Retrieval Using a Substring Index. 257-262

Technical Applications

• 
  Andrew D. McGettrick:
  Teaching Mathematics by Computer. 263-268

Review

• 
  Brian E. Carpenter, Robert W. Doran:
  The Other Turing Machine. 269-279

Volume 20, Number 4, 1977

Business Applications

• 
  D. H. R. Huxtable, John M. M. Pinkerton:
  The Hardware/Software Interface of the ICL 2900 Range of Computers. 290-295
• 
  P. J. Pengilly:
  An Approach to Systems Design II: The Popularisation of PROPLAN. 296-297
• 
  T. C. Ting, Y. W. Wang:
  Multiway Replacement Selection Sort with Dynamic Reservoir. 298-301
• 
  John G. Kollias, Peter M. Stocker, P. A. Dearnley:
  Improving the Performance of an Intelligent Data Management System. 302-307

Advanced Programming and System Programming

• 
  P. J. Clapson:
  Toward a Performance Science: A Comparative Analysis of Computing Systems. 308-315
• 
  S. Mamrak, J. M. Randal:
  An Analysis of a Software Engineering Failure. 316-320
• 
  B. M. Nicklas, Gunter Schlageter:
  Index Structuring in Inverted Data Bases by TRIES. 321-324
• 
  R. A. Reynolds:
  Character String Handling in FORTRAN. 325-329
• 
  K. A. Steele:
  CPM Network Analysis with a Storage Tube Terminal. 330-334
• 
  Philip J. Willis:
  A Real Time Hidden Surface Technique. 335-339

Computer Science Theory

• 
  Leon S. Levy, R. Melville:
  The Algebraic Anatomy of Programs. 340-345
• 
  A. D. Woodall:
  Generation of Permutation Sequences. 346-349
• 
  S. Soule:
  A Note on the Nonrecursive Traversal of Binary Trees. 350-352
• 
  Michael Brady:
  Hints on Proofs by Recursion Induction. 353-355
• 
  John M. Wilson:
  Boolean Simplification and Integer Inequalities. 356-358
• 
  R. Mojena:
  Hierarchical Grouping Methods and Stopping Rules: An Evaluation. 359-363
• 
  D. Defays:
  An Efficient Algorithm for a Complete Link Method. 364-366

Technical Applications

• 
  Wyn L. Price:
  A Controlled Random Search Procedure for Global Optimisation. 367-370