The Computer Journal, Volume 21, 1978

Volume 21, Number 1, February 1978

• Neil E. Wiseman, C. I. C. Campbell, J. Harradine: On Making Graphic Arts Quality Output by Computer. 2-6
• R. A. Davenport: Distributed or Centralised Data Base. 7-14
• P. A. Dearnley: Monitoring Database System Performance. 15-19
• John J. Donovan: A Note on Performance of VM/370 in the Integration of Models and Data Bases. 20-24
• I. A. Clark: STREMA: Specifying Application Processes Using Streams. 25-30
• John Fitch, A. C. Norman: A Note on Compacting Garbage Collection. 31-34
• W. R. Campbell: A Compiler Definition Facility Based on the Syntactic Macro. 35-41

• J. Gerard Wolff: Recoding of Natural Language for Economy of Transmission of Storage. 42-44
• R. M. Lea: Text Compression with an Associative Parallel Processor. 45-56
• P. W. Williams: Criteria for Choosing Subsets to Obtain Maximum Relative Entropy. 57-62
• P. W. Williams: The Relationship Between Entropy and File Search Times. 63-65
• Jayme Luiz Szwarcfiter, L. B. Wilson: Some Properties of Ternary Trees. 66-72

• C. R. Edwards: Some Improved Designs for the Digital Summation Threshold Logic (DSTL) Gate. 73-78
• J. M. Eves, S. L. Hurst: Improvements in Multioutput Threshold-Logic Gates. 79-85

• J. F. Barlow: An Algorithm for the Solution of the Postman's Problem. 86-89

• G. Norris: Summary of the Report: `The Computer Board: Policies Past, Present and Future?'. 90-91
• M. Gordon: An Interactive Graphical Minicomputer System for the Management and Exploration of Clinical Renal Data. 91-93

Volume 21, Number 2, May 1978

• William L. Honig, C. Robert Carlson: Toward an Understanding of (Actual) Data Structures. 98-104
• Niv Ahituv, Israel Borovits: Analysis of the Purchase Option of Computers. 105-109

• Robert H. Bonczek, Clyde W. Holsapple, Andrew B. Whinston: Information Transferral Within a Distributed Data Base Via a Generalised Mapping Language. 110-116
• R. V. Evans, G. S. Lockington, T. N. Reid: A Compiler Compiler and Methodology for Problem Oriented Language Compiler Implementors. 117-121
• A. Parkin, R. B. Coats: EDSIM - Event Based Discrete Simulation Using General Purpose Languages Such as FORTRAN. 122-127
• W. Neville Holmes: Is APL a Programming Language? 128-131
• John G. Kollias: An Estimate of Seek Time for Batched Searching of Random or Index Sequential Structured Files. 132-133
• David R. Hanson: Filters in SL5. 134-143
• Gregor von Bochmann, P. Ward: Compiler Writing System for Attribute Grammars. 144-148
• Ivan Bratko, Danny Kopec, Donald Michie: Pattern-Based Representation of Chess End-Game Knowledge. 149-153
• G. M. Bull, S. Gilbey, Kathleen Levine, A. G. Lippiatt, C. H. C. Machin: Proteus - A Microcoded Multiprocessor System. 154-160

• M. Howard Williams, H. L. Ossher: Conversion of Unstructured Flow Diagrams to Structured Form. 161-167
• P. J. Green, R. Sibson: Computing Dirichlet Tessellations in the Plane. 168-173

• D. A. Smith, Pamela S. Guipre: Modifications to the Forsythe-Moler Algorithm for Solving Linear Algebraic Systems. 174-177

• P. T. Barry: The Regional Computing Organisation Network. 184-187
• A. Parkin: Critique on Multi-Criteria Assessment Applied to Alternative Data Processing Systems. 188-190
• R. Haentjens, E. Van de Vel: Lexical Analysis and the Transportation of Programs. 190-191

Volume 21, Number 3, August 1978

• A. D. Chambers: Computer Fraud and Abuse. 194-198

• Israel Borovits, Seev Neumann: Internal Pricing for Computer Services. 199-204
• Eric Foxley: A Hybrid Computer Performance Modelling System. 205-209
• W. B. Samson, R. H. Davis: Search Times Using Hash Tables for Records with Non-Unique Keys. 210-214
• J. L. Armstrong: Programming a Parallel Computer for Robot Vision. 215-218
• Wyn L. Price: Simulation Studies of Data Communication Networks Operating in Datagram Mode. 219-223
• P. G. Barker, P. S. Jones: Syntactic Definition and Parsing of Molecular Formulae, Part 2: Graphical Synthesis of Molecular Formulae for Data Base Queries. 224-233

• M. Howard Williams: Static Semantic Features of ALGOL60 and BASIC. 234-242
• R. Sibson: Locally Equiangular Triangulations. 243-245

• M. R. Patel: Analysis of Speed of a Binary Divider Using a Variable Number of Shifts per Cycle. 246-252

• A. van Oosterom: Triangulating the Human Torso. 253-258
• H. R. A. Townsend: Analysing Electroencephalograms. 259-262
• J. Mottl, Ludmila Mottlová: Description of a Program for Solving Problems of Nonlinear Programming. 263-269

• J. M. Triance: A Study of COBOL Portability. 278-281
• R. M. De Morgan, I. D. Hill, Brian A. Wichmann: Modified ALGOL 60 and the Step-Until Element. 282

Volume 21, Number 4, November 1978

• Rik Maes: On the Representation of Program Structures by Decision Tables: A Critical Assessment. 290-295
• Mohit Kumar Roy: Evaluation of Permutation Algorithms. 296-301
• Jeffrey S. Rohl: Generating Permutations by Choosing. 302-305
• Peter A. Lee: A Reconsideration of the Recovery Block Scheme. 307-310
• M. Osborne, F. Little: An Implementation of Structured Programming in APL. 311-315
• Andrew S. Tanenbaum: A Comparison of PASCAL and ALGOL 68. 316-323
• B. A. Lewis, J. S. Robinson: Triangulation of Planar Regions with Applications. 324-332
• Michael A. Hennell: An Experimental Testbed for Numerical Software. 333-336

• Wladyslaw M. Turski: A Model of Nonmorphological Data Collection Based on Sentential Calculus. 337-340
• P. W. Williams: Balancing Demand in a Hierarchical Structure. 341-346

• A. K. Burston, D. J. Kinniment, Hilary J. Kahn: A Design Language for Asynchronous Logic. 347-354

• J. C. Romão, Rui Vilela Mendes: Algorithms for Multidimensional Numerical Integration with Singularities. 355-358
• A. Swift, G. R. Lindfield: Comparison of a Continuation Method with Brent's Method for the Numerical Solution of a Single Nonlinear Equation. 359-362
• Jeff R. Cash, C. B. Liem: On the Computational Aspects of Semi-Implicit Runge-Kutta Methods. 363-365

• B. S. Lee: Use of Case Studies in Teaching Data Processing. 366-372

• M. Howard Williams, E. V. C. Fielding: Automatic Generation of Payroll Programs. 378-380
• Lawrence J. Mazlack: Predicting Student Success in an Introductory Programming Course. 380-384