Last update:
Tue Oct 1 06:54:11 MDT 2024
F. J. M. Laver JANUS --- reflections on DATAFAIR 69 . . 2--6
D. G. R. Buckle and
C. H. Hunt and
M. M. Ryder and
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
A. Young Book Review . . . . . . . . . . . . . . 13--13
M. G. Notley The cumulative recurrence library . . . 14--19
J. S. Rohl and
G. Cordingley List Processing Facilities in Atlas
Autocode . . . . . . . . . . . . . . . . 20--24
G. M. Phillips Book Review . . . . . . . . . . . . . . 24--24
H. D. Baecker The use of Algol 68 for trees . . . . . 25--27
J. J. Florentin Book Review . . . . . . . . . . . . . . 27--27
W. M. Waite Building a Mobile Programming System . . 28--31
D. Barton and
S. R. Bourne and
J. P. Fitch An algebra system . . . . . . . . . . . 32--39
L. F. Blake and
R. E. Lawson and
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
A. R. Gourlay Book Review . . . . . . . . . . . . . . 54--54
D. Wood The theory of left factored languages:
Part 2 . . . . . . . . . . . . . . . . . 55--62
D. M. Boulton and
C. S. Wallace A program for numerical classification 63--69
J. Gertler High-Level Programming for Process
Control . . . . . . . . . . . . . . . . 70--75
M. Clint and
A. Jennings The evaluation of eigenvalues and
eigenvectors of real symmetric matrices
by simultaneous iteration . . . . . . . 76--80
S. McKee and
A. R. Mitchell Alternating Direction Methods for
Parabolic Equations in Two Space
Dimensions with a Mixed Derivative . . . 81--86
M. J. M. Bernal and
J. R. Whiteman Numerical Treatment of Biharmonic
Boundary Value Problems with Re-Entrant
Boundaries . . . . . . . . . . . . . . . 87--91
Anonymous Errata . . . . . . . . . . . . . . . . . 91--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
R. W. Hiorns Book Review . . . . . . . . . . . . . . 109--109
P. Hammersley Algorithms supplement: Previously
published algorithms . . . . . . . . . . 110--110
A. D. Woodall Algorithm 45: An internal sorting
procedure using a two-way merge . . . . 110--111
Anonymous Algorithms supplement . . . . . . . . . 110--115
Shirley A. Lill Algorithm 46: a modified Davidon method
for finding the minimum of a function
using difference approximation for
derivatives . . . . . . . . . . . . . . 111--113, 106
C. J. van Rijsbergen Algorithm 47: a clustering algorithm . . 113--115
A. H. J. Sale Note on Algorithm 42: Interpolation by
certain quintic splines . . . . . . . . 115--115
N. Jardine Discussion and correspondence:
Algorithms, methods and models in the
simplification of complex data . . . . . 116--117
A. V. Reader Random digits by a mincing process . . . 118--118
P. B. Fellgett Correspondence: What is an analyst? . . 118--119
R. L. Allen and
The Editor Correspondence: What is an analyst? . . 119--120
M. J. Savage Erratum: ``Junction optimisation
technique'' . . . . . . . . . . . . . . 120--120
M. Wells Correspondence: Towards Fortran VI? . . 120--120
B. W. Dawkins and
H. C. Dawkins Correspondence: On ``A University
faculty timetable'' . . . . . . . . . . 121--122
Jan V. Garwick and
J. N. Lyness Correspondence: On ``The effect of
inadequate convergence criteria in
automatic routines'' . . . . . . . . . . 122--122
A. Gunton Recovery Procedures for Direct Access
Commercial Systems . . . . . . . . . . . 123--126
A. R. Mitchell Book Review . . . . . . . . . . . . . . 126--126
A. L. Humphrey and
W. G. Munro Management Information Retrieval . . . . 127--130
R. M. Burstall Book Review . . . . . . . . . . . . . . 130--130
M. Harrop A basic approach to remote access . . . 131--135
D. W. Barron Book Review . . . . . . . . . . . . . . 135--135
A. J. T. Colin DOLPHIN --- a text filing system for
University use . . . . . . . . . . . . . 136--141
A. Learner and
A. L. Lim A note on transforming context-free
grammars to Wirth--Weber precedence form 142--144
E. Lloyd Book Review . . . . . . . . . . . . . . 144--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 and
D. Wishart An Improved Algorithm for the
Jardine-Sibson Method of Generating
Overlapping Clusters . . . . . . . . . . 156--163
T. I. Silvey and
J. R. Barker Hybrid Computing Techniques for Solving
Parabolic and Hyperbolic Partial
Differential Equations . . . . . . . . . 164--170
C. A. R. Hoare Book Review . . . . . . . . . . . . . . 170--170
R. R. Allran and
S. E. J. Johnsen An algorithm for solving nonlinear
programming problems subject to
nonlinear inequality constraints . . . . 171--177
R. M. Burstall Book Review . . . . . . . . . . . . . . 177--177
P. C. Haarhoff and
J. D. Buys A new method for the optimization of a
nonlinear function subject to nonlinear
constraints . . . . . . . . . . . . . . 178--184
B. A. Murtagh and
R. W. H. Sargent Computational experience with
quadratically convergent minimisation
methods . . . . . . . . . . . . . . . . 185--194
D. 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
P. Hammersley Algorithms supplement: Previously
published algorithms . . . . . . . . . . 206--207
Anonymous Alogorithms Supplement . . . . . . . . . 206--219
P. G. Littlewood Algorithm 48: Procedure for the
evaluation of an integral occurring in
the mean square response analysis of
linear systems . . . . . . . . . . . . . 207--208
K. W. Smillie Algorithm 49: Indexing subarrays in
multidimensional arrays . . . . . . . . 208--208
A. G. Bell Algorithm 50: How to program a computer
to play legal chess . . . . . . . . . . 208--219
K. Fielding Note on Algorithm 44: Solution of
nonlinear simultaneous equations . . . . 219--219
D. T. Muxworthy Note on Algorithm 47: a clustering
algorithm . . . . . . . . . . . . . . . 219--219
C. J. van Rijsbergen Note on Algorithm 47: a clustering
algorithm . . . . . . . . . . . . . . . 219--219
P. Hammersley and
J. Larmouth Correspondence . . . . . . . . . . . . . 220--220
P. Hammersley and
J. Larmouth Correspondence: Towards Fortran VI? . . 220--220
D. A. Carrick Correspondence: Interpretation of
limited entry decision table format . . 220--221
T. H. Merret Correspondence . . . . . . . . . . . . . 221--221
T. H. Merret Correspondence: Chain processing in PL/1 221--221
J. G. Fraser Correspondence: Further comments on a
line-thinning scheme . . . . . . . . . . 221--222
M. J. H. Webb Book review: \booktitleThe Economics of
Computers, by William F. Sharpe, 1969 222--222
H. McGregor Ross The British Standard Data Code and how
to exploit it . . . . . . . . . . . . . 223--229
M. D. Buckley-Sharp and
F. T. C. Harris A computer program for banking multiple
choice questions . . . . . . . . . . . . 230--236
I. J. Good Book Review . . . . . . . . . . . . . . 236--236
T. G. McLain and
A. R. Trice The MINIMOP multi-access operating
system . . . . . . . . . . . . . . . . . 237--242
A. R. Gourlay Book Review . . . . . . . . . . . . . . 242--242
D. Barton and
S. R. Bourne and
J. R. Horton The structure of the Cambridge algebra
system . . . . . . . . . . . . . . . . . 243--247
F. H. George Book Review . . . . . . . . . . . . . . 247--247
D. Morris and
I. R. Wilson and
P. C. Capon A system program generator . . . . . . . 248--254
I. A. Macleod SP/1 --- a Fortran integrated string
processor . . . . . . . . . . . . . . . 255--260
J. Nievergelt and
M. I. Irland Bounce-and-skip. A technique for
directing the flow of control in
programs . . . . . . . . . . . . . . . . 261--262
E. L. Albasiny Book Review . . . . . . . . . . . . . . 262--262
J. B. Hext and
P. S. Roberts Syntax analysis by Domölki's algorithm 263--271
D. 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
V. E. Price Book Review . . . . . . . . . . . . . . 288--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
eigenvalues . . . . . . . . . . . . . . 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
P. M. Cohn Book Review . . . . . . . . . . . . . . 308--308
G. Peters and
J. H. Wilkinson The Least Squares Problem and
Pseudo-Inverses . . . . . . . . . . . . 309--316
R. Fletcher A new approach to variable metric
algorithms . . . . . . . . . . . . . . . 317--322
P. Hammersley Algorithms supplement: Previously
published algorithms . . . . . . . . . . 323--323
D. J. Evans and
L. V. Atkinson Algorithm 51: An algorithm for the
solution of general three term linear
systems . . . . . . . . . . . . . . . . 323--324
Anonymous Algorithms Supplement . . . . . . . . . 323--326
C. J. van Rijsbergen Algorithm 52: a fast hierarchic
clustering algorithm . . . . . . . . . . 324--326
A. H. J. Sale Note on Algorithm 47: a clustering
algorithm . . . . . . . . . . . . . . . 326--326
A. D. Woodall Note on Algorithm 43: a listed radix
sort . . . . . . . . . . . . . . . . . . 326--326
A. D. Woodall Note on Algorithms 25, 26. 25: Sort a
section of the elements of an array by
determining the rank of each element.
26: Order the subscripts of an array
section according to the magnitudes of
the elements . . . . . . . . . . . . . . 326--326
R. D. Bennett Discussion and correspondence: computers
and the business information structure:
new horizons in decision making
effectiveness . . . . . . . . . . . . . 327--329
Harold Gearing Sidney Albert Tasker --- An Appreciation 331--331
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
C. G. Broyden Book Review . . . . . . . . . . . . . . 358--358
K. M. Waliuzzaman and
Z. 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
D. J. Evans Book Review . . . . . . . . . . . . . . 381--381
I. Barrodale and
F. D. K. Roberts and
C. R. Hunt Computing Best $l_p$ Approximations by
Functions Nonlinear in One Parameter . . 382--386
L. J. Slater Book Review . . . . . . . . . . . . . . 386--386
J. S. Meditch Newton's Method in Discrete-Time
Nonlinear Data Smoothing . . . . . . . . 387--391
J. H. Wilkinson Book Review: \booktitleA Collection of
Matrices for Testing Computational
Algorithms, by Robert T. Gregory, D. L.
Karney, 1969; 154 pages. (John Wiley and
Sons Ltd., \pounds 4.75) . . . . . . . . 391--391
D. J. McConalogue A quasi-intrinsic scheme for passing a
smooth curve through a discrete set of
points . . . . . . . . . . . . . . . . . 392--396
Anonymous Correspondence . . . . . . . . . . . . . 396--396
Melvin R. Scott Numerical Solution of Unstable Initial
Value Problems by Invariant Imbedding 397--400
J. J. Florentin Book Review . . . . . . . . . . . . . . 400--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 Elementary Hermitian
Matrices . . . . . . . . . . . . . . . . 411--412
G. A. Dirac Book Review . . . . . . . . . . . . . . 412--412
S. Vajda Book Review . . . . . . . . . . . . . . 412a-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
P. Hammersley Algorithms supplement: Previously
published algorithms . . . . . . . . . . 421--421
R. A. Zambardino Algorithm 53: Decomposition of positive
definite symmetric band matrices . . . . 421--422
Anonymous Algorithms Supplement . . . . . . . . . 421--438
A. H. J. Sale Algorithm 54: Approximation of straight
lines . . . . . . . . . . . . . . . . . 422--424
A. D. Woodall Algorithm 55: An internal merge sort
giving ranks of items . . . . . . . . . 424--425
A. D. Woodall Algorithm 56: To disentangle a chain . . 425--425
T. O. M. Kronsjö Algorithm 57: Find . . . . . . . . . . . 425--426
T. O. M. Kronsjö Algorithm 58: an illustrative primal
simplex linear program . . . . . . . . . 426--428
T. O. M. Kronsjö Algorithm 59: An illustrative primal
simplex linear program using multipliers 428--429
T. O. M. Kronsjö Algorithm 60: An illustrative primal
simplex linear program using multipliers
and single dimensional arrays . . . . . 429--430
T. O. M. Kronsjö Algorithm 61: An illustrative self-dual
parametric simplex linear program using
multipliers . . . . . . . . . . . . . . 430--437
W. D. Hoskins Algorithm 62: Interpolating quintic
splines on equidistant knots . . . . . . 437--438
J. Downing A computer controlled circulation system 2--6
J. A. Campbell A note on an optimal-fit method for
dynamic allocation of storage . . . . . 7--9
K. J. MacCallum Correspondence . . . . . . . . . . . . . 9--9
A. H. J. Sale The classification of Fortran statements 10--12
C. R. Symons A cost accounting formula for
multiprogramming computers . . . . . . . 13--20
J. Eve Book Review . . . . . . . . . . . . . . 20--20
M. Wells and
D. Holdsworth and
A. P. McCann The Eldon 2 operating system for KDF9 21--24
R. Alpiar Double syntax oriented processing . . . 25--37
N. Christofides An Algorithm for the Chromatic Number of
a Graph . . . . . . . . . . . . . . . . 38--39
R. H. Stark A language for algorithms . . . . . . . 40--44
J. K. Reid Book Review . . . . . . . . . . . . . . 44--44
C. C. Foster Uncoupling central processor and storage
device speeds . . . . . . . . . . . . . 45--48
P. A. Jackson PRBS cross-correlation measurements by
hybrid computational techniques . . . . 49--54
P. J. H. King Correspondence . . . . . . . . . . . . . 54--54
P. J. H. King Correspondence: Interpretation of
limited entry decision table format . . 54--54
S. H. Lavington and
D. J. Kinniment and
A. E. Knowles An experimental paging unit . . . . . . 55--60
G. C. Coggan and
J. A. Wilson On-line state estimation with a small
computer . . . . . . . . . . . . . . . . 61--64
K. A. Redish Correspondence . . . . . . . . . . . . . 64--64
K. A. Redish Correspondence: (Note on) Algorithm 44 64--64
E. L. V. Hope A high-order solution to the
characteristic initial value problem in
hyperbolic partial differential
equations . . . . . . . . . . . . . . . 65--72
William Squire Correspondence . . . . . . . . . . . . . 72--72
William Squire and
M. G. Cox Correspondence: On ``A bracketing
technique for computing a zero of a
function'' . . . . . . . . . . . . . . . 72--72
R. P. W. Lewis The selection of ADI iteration
parameters by numerical experiment for
the solution of Poisson's equation over
a circular area . . . . . . . . . . . . 73--74
W. F. Lunnon Multi-dimensional map-folding . . . . . 75--80
L. B. Smith Drawing Ellipses, Hyperbolas Or
Parabolas with a Fixed Number of Points
and Maximum Inscribed Area . . . . . . . 81--86
R. L. Allen Correspondence . . . . . . . . . . . . . 86--86
R. L. Allen Correspondence: On quality of writing 86--86
D. G. Evershed and
G. E. Rippon High level languages for low level users 87--90
B. Randell Book Review . . . . . . . . . . . . . . 90--90
H. G. Barrow and
D. Michie and
R. J. Popplestone and
S. H. Salter Tokyo-Edinburgh dialogue on robots in
artificial intelligence research . . . . 91--95
D. Michie Heuristic search . . . . . . . . . . . . 96--102
John C. West Book Review . . . . . . . . . . . . . . 102--102
P. Hammersley Algorithms supplement: Previously
published algorithms . . . . . . . . . . 103--103
A. D. Woodall Algorithm 63: a recursive tree sort . . 103--103
Anonymous Algorithms Supplement . . . . . . . . . 103--107
A. D. Woodall Algorithm 64: a non-recursive tree sort 104--104
A. H. J. Sale Algorithm 65: An improved clustering
algorithm . . . . . . . . . . . . . . . 104--106
Shirley A. Lill Note on Algorithm 46: a modified Davidon
method for finding the minimum of a
function using difference approximation
for derivatives . . . . . . . . . . . . 106--106
J. L. Berry and
A. G. Bell Note on Algorithm 50: How to program a
computer to play legal chess . . . . . . 106--107
J. G. Fryer Book review: \booktitleRank Order
Probabilities: Two Sample Normal Shift
Alternatives, by Roy C. Milton, 1970 . . 107--107
J. G. Fryer Book Review . . . . . . . . . . . . . . 107--107
S. J. Waters Blocking sequentially processed magnetic
files . . . . . . . . . . . . . . . . . 109--112
D. Ball and
P. M. Blackall and
V. Gerard and
G. R. Macleod and
P. J. Marcer and
E. M. Palandri FOCUS --- a remote access file handling
system on-line to a CDC 6000 series
computer . . . . . . . . . . . . . . . . 113--118
J. C. Baldwin and
R. E. Thomas Multi-access on the Chilton Atlas . . . 119--122
J. W. Craggs Book Review . . . . . . . . . . . . . . 122--122
D. W. Barron Approaches to conversational FORTRAN . . 123--127
E. W. Haddon and
L. G. Proll An Algol line-syntax checker . . . . . . 128--132
R. S. Scowen and
D. Allin and
A. L. Hillman and
M. Shimell SOAP --- a program which documents and
edits ALGOL 60 programs . . . . . . . . 133--135
R. J. Ord-Smith Generation of permutation sequences:
Part 2 . . . . . . . . . . . . . . . . . 136--139
R. J. Ord-Smith Book Review . . . . . . . . . . . . . . 139--139
A. Ortony A system for stereo viewing . . . . . . 140--144
E. C. Cherry Book Review . . . . . . . . . . . . . . 144--144
J. Král Some Properties of the Scatter Storage
Technique with Linear Probing . . . . . 145--149
E. S. Page Systematic generation of ordered
sequences using recurrence relations . . 150--153
V. W. D. Hale Book Review . . . . . . . . . . . . . . 153--153
G. N. Lance and
W. T. Williams A note on a new divisive classificatory
program for mixed data . . . . . . . . . 154--155
R. John Lansdown Correspondence . . . . . . . . . . . . . 155--155
R. John Lansdowne Correspondence: On ``The use of
symbol-state tables'' . . . . . . . . . 155--155
G. W. Osborne Correspondence . . . . . . . . . . . . . 155--155
G. W. Osborne Correspondence: On ``Bounce-and-skip. A
technique for directing the flow of
control in programs'' . . . . . . . . . 155--155
R. Sibson Some observations on a paper by Lance
and Williams . . . . . . . . . . . . . . 156--157
W. T. Williams and
H. T. Clifford and
G. N. Lance Group-size dependence: a rationale for
choice between numerical classifications 157--162
W. T. Williams and
G. N. Lance and
M. B. Dale and
H. T. Clifford Controversy concerning the criteria for
taxonometric strategies . . . . . . . . 162--165
G. G. Alway A general factorising algorithm . . . . 166--168
M. Grossman Parametric curve fitting . . . . . . . . 169--172
M. A. Wolfe The numerical solution of implicit first
order ordinary differential equations
with initial conditions . . . . . . . . 173--178
A. Hadjidimos Optimum extrapolated ADI iterative
difference schemes for the solution of
Laplace's equation in three space
variables . . . . . . . . . . . . . . . 179--183
M. R. Osborne and
G. A. Watson On an algorithm for discrete nonlinear
$L_1$ approximation . . . . . . . . . . 184--188
R. Cranley and
T. N. L. Patterson On the automatic numerical evaluation of
definite integrals . . . . . . . . . . . 189--198
R. G. Bennetts and
D. W. Lewin Fault diagnosis of digital systems --- a
review . . . . . . . . . . . . . . . . . 199--206
P. Hammersley Algorithms supplement: Previously
published algorithms . . . . . . . . . . 207--207
D. J. McConalogue Algorithm 66: An automatic French-curve
procedure for use with an incremental
plotter . . . . . . . . . . . . . . . . 207--209
Anonymous Algorithms Supplement . . . . . . . . . 207--215
D. J. McConalogue Algorithm 67: An axis invariant
procedure to provide slopes at points by
local three-point parametric curve
fitting . . . . . . . . . . . . . . . . 209--209
J. R. Manning Algorithm 68: White to move and mate in
$n$ moves . . . . . . . . . . . . . . . 209--213
F. Oliveira-Pinto Algorithm 69: Trigonometric curve
fitting to equally or unequally spaced
data . . . . . . . . . . . . . . . . . . 213--214
Zs. Kovács and
Shirley A. Lill Note on Algorithm 46: a modified Davidon
method for finding the minimum of a
function using difference approximation
for derivatives . . . . . . . . . . . . 214--215
N. E. Gough and
J. B. A. Epton Note on Algorithm 48: Procedure for the
evaluation of an integral occurring in
the mean square response analysis of
linear systems . . . . . . . . . . . . . 215--215
T. O. M. Kronsjö Note on Algorithms 58 to 61 . . . . . . 215--215
C. F. Reynolds CODIL, Part 1. The importance of
flexibility . . . . . . . . . . . . . . 217--220
D. Morris and
T. G. Kennedy and
L. Last Flocoder . . . . . . . . . . . . . . . . 221--223
R. J. W. Housden Phrase structures in Fortran . . . . . . 224--228
I. A. Macleod Mp/1 --- a Fortran macroprocessor . . . 229--231
C. B. Jones A New Approach to the `Hidden Line'
Problem . . . . . . . . . . . . . . . . 232--237
G. Molnar SEL --- a self-extensible programming
language . . . . . . . . . . . . . . . . 238--242
David Barton and
I. M. Willers and
R. V. M. Zahar The automatic solution of systems of
ordinary differential equations by the
method of Taylor series . . . . . . . . 243--248
L. D. Higgins and
Francis J. Smith Disc Access Algorithms . . . . . . . . . 249--253
D. W. Lewin Advanced aspects of asynchronous logic
design . . . . . . . . . . . . . . . . . 254--259
V. A. LoDato The minimisation of distance in
placement algorithms . . . . . . . . . . 260--262
M. J. Beaubien and
A. Wexler Iterative, finite difference solution of
interior eigenvalues and eigenfunctions
of Laplace's operator . . . . . . . . . 263--269
R. A. C. Boggs and
F. J. Smith A note on the integration of ordinary
differential equations using Chebyshev
series . . . . . . . . . . . . . . . . . 270--271
M. G. Cox An algorithm for approximating convex
functions by means of first degree
splines . . . . . . . . . . . . . . . . 272--275
R. Fletcher and
J. A. Grant and
M. D. Hebden The calculation of linear best $L_p$
approximations . . . . . . . . . . . . . 276--279
J. Grad Matrix Balancing . . . . . . . . . . . . 280--284
R. J. Hanson and
P. Dyer A computational algorithm for sequential
estimation . . . . . . . . . . . . . . . 285--290
F. T. Man A high-order method of solution for the
Lyapunov matrix equation . . . . . . . . 291--292
A. Matthews and
D. Davies A comparison of modified Newton methods
for unconstrained optimisation . . . . . 293--294
S. McKee and
A. R. Mitchell Alternating direction methods for
parabolic equations in three space
dimensions with mixed derivatives . . . 295--300
J. Oliver The evaluation of definite integrals
using high-order formulae . . . . . . . 301--306
J. K. Reid A note on the approximation of plane
regions . . . . . . . . . . . . . . . . 307--308
A. Zafarullah Some stable implicit difference methods
for heat equation with derivative
boundary condition . . . . . . . . . . . 309--311
J. M. Chambers Another round of Fortran . . . . . . . . 312--314
I. D. Hill Faults in functions, in Algol and
Fortran . . . . . . . . . . . . . . . . 315--316
B. Randell Ludgate's analytical machine of 1909 . . 317--326
Anonymous Errata . . . . . . . . . . . . . . . . . 326--326
C. F. Reynolds CODIL, Part 2. The CODIL language and
its interpreter . . . . . . . . . . . . 327--332
B. L. Meek Correspondence . . . . . . . . . . . . . 332--332
R. W. Bonney A keyword index file of British book
titles . . . . . . . . . . . . . . . . . 333--337
A. H. Jones Correspondence . . . . . . . . . . . . . 337--337
A. J. Jones Correspondence: On quality of writing 337--337
J. W. Bridle and
R. J. Gregersen CMSR --- a personnel information system 338--343
D. A. Bell Book Review . . . . . . . . . . . . . . 343--343
D. C. Cooper Book Review . . . . . . . . . . . . . . 343--343
J. A. Tomlin and
D. C. Cooper and
D. A. Bell Book reviews: \booktitleInteger and
Dynamic Programming, by J. Abadie
(editor), 1970; \booktitleAlgorithms and
Recursive Functions, by A. L. Mal'cev,
1970; \booktitleInformation Theory for
Systems Engineers (Econometrics and
Operations Research XVII), by L. P.
Hyvärinen, 1970 . . . . . . . . . . . . . 343--343
J. A. Tomlin Book Review . . . . . . . . . . . . . . 343--343
A. J. Leonard and
M. E. Tribe Notable features of Orion . . . . . . . 344--347
G. Houston and
R. Gillespie Integration of batch and timesharing
services . . . . . . . . . . . . . . . . 348--351
Anonymous Erratum . . . . . . . . . . . . . . . . 351--351
M. J. Ecclestone Correspondence . . . . . . . . . . . . . 351--351
M. J. Ecclestone Correspondence: On ``A quasi-intrinsic
scheme for passing a smooth curve
through a discrete set of points'' . . . 351--351
Terry G. Seaks Erratum: The evaluation of eigenvalues
and eigenvectors of real symmetric
matrices by simultaneous iteration . . . 351--351
J. N. Sturman The functional partitioning of memory
--- its application to interactive
computing . . . . . . . . . . . . . . . 352--360
J. W. Gale Correspondence . . . . . . . . . . . . . 360--360
J. W. Gale Correspondence: On the February 1971
editorial . . . . . . . . . . . . . . . 360--360
J. N. G. Brittan and
F. J. M. Farley College timetable construction by
computer . . . . . . . . . . . . . . . . 361--365
R. C. Backhouse Correspondence . . . . . . . . . . . . . 365--365
R. C. Backhouse Correspondence: On ``High level
languages for low level users'' . . . . 365--365
S. H. Valentine Correspondence . . . . . . . . . . . . . 365--365
S. H. Valentine Correspondence: ``On the automatic
numerical evaluation of definite
integrals'' . . . . . . . . . . . . . . 365--365
M. Etherton Data structures for a network design
system . . . . . . . . . . . . . . . . . 366--374
E. L. Albaseny Book reviews: \booktitleNumerik
Symmetrischer Matrizen, by H.
Rutishauser, E. Stiefel and H. Schwarz,
1968; \booktitleComputational Methods in
Partial Differential Equations, by A. R.
Mitchell, 1969 . . . . . . . . . . . . . 374--374
E. L. Albasiny Book Review . . . . . . . . . . . . . . 374--374
E. L. Albasiny Book Review . . . . . . . . . . . . . . 374--374
A. Ricci An algorithm for the removal of hidden
lines in 3D scenes . . . . . . . . . . . 375--377
Anthony Wren Book review: \booktitleCase Exercises in
Operations Research, by J. J. C. Martin
and R. A. Denison, 1971 . . . . . . . . 377--377
Anthony Wren Book Review . . . . . . . . . . . . . . 377--377
B. J. Austin A dynamic disc allocation algorithm
designed to reduce fragmentation during
file reloading . . . . . . . . . . . . . 378--381
R. M. Burstall Book Review . . . . . . . . . . . . . . 381--381
C. J. Evangelisti and
S. P. Morse Graphical modelling using contextually
implied functions . . . . . . . . . . . 382--389
A. Young and
L. Fox and
D. F. Mayers Book reviews: \booktitleConvexity and
Optimization in Finite Dimensions I, by
Josef Stoer and Christoph Witzgall,
1970; \booktitleOn Round-off Errors in
Linear Programming, by H. Müller-Merbach,
1970; \booktitleApproximation Theory,
edited by A. Talbot, 1970 . . . . . . . 390--390
M. Foley and
C. A. R. Hoare Proof of a recursive program: Quicksort 391--395
D. Wood A further note on top-down deterministic
languages . . . . . . . . . . . . . . . 396--403
P. B. Fellgett Book Review . . . . . . . . . . . . . . 403--403
N. Jardine and
R. Sibson Choice of methods for automatic
classification . . . . . . . . . . . . . 404--406
C. J. van Rijsbergen An algorithm for information structuring
and retrieval . . . . . . . . . . . . . 407--412
J. M. Watt and
J. Z. Young Book reviews: \booktitleComputation and
Theory in Ordinary Differential
Equations, by James W. Daniel and Ramon
E. Moore, 1970; \booktitleProgress in
Brain Research, Vol. 33.
\booktitleComputers and Brains, by J. P.
Schade and J. Smith, 1970 . . . . . . . 412--412
J. M. Watt Book Review . . . . . . . . . . . . . . 412--412
J. Z. Young Book Review . . . . . . . . . . . . . . 412--412
D. Zissos and
F. G. Duncan NOR and NAND operators in Boolean
algebra applied to switching circuit
design . . . . . . . . . . . . . . . . . 413--417
N. Christofides Zero-one programming using non-binary
tree-search . . . . . . . . . . . . . . 418--421
R. P. Brent An Algorithm with Guaranteed Convergence
for Finding a Zero of a Function . . . . 422--425
P. R. Walwyn Correspondence . . . . . . . . . . . . . 425--425
P. R. Walwyn Correspondence: On ``High level
languages for low level users'' . . . . 425--425
S. Hoshino On Davies, Swann and Campey minimisation
process . . . . . . . . . . . . . . . . 426--427
D. Knibb and
R. E. Scraton On the solution of parabolic partial
differential equations in Chebyshev
series . . . . . . . . . . . . . . . . . 428--432
R. Piessens Some aspects of Gaussian quadrature
formulae for the numerical inversion of
the Laplace transform . . . . . . . . . 433--436
L. J. Slater Book review: \booktitleMathematical
Model Building in Economics and Industry
(Second Series), by M. G. Kendall
(editor), 1970 . . . . . . . . . . . . . 436--436
L. J. Slater Book Review . . . . . . . . . . . . . . 436--436
P. Wynn A note on the generalised Euler
transformation . . . . . . . . . . . . . 437--441
A. S. Anderssen and
E. T. White Improved numerical methods for Volterra
integral equations of the first kind . . 442--443
D. W. Honey Correspondence . . . . . . . . . . . . . 443--443
D. W. Honey Correspondence: Calculation of a
double-length square root from a double
length number using single precision
techniques . . . . . . . . . . . . . . . 443--443
R. F. Shepherd Algorithms supplement: Previously
published algorithms . . . . . . . . . . 444--444
D. J. Evans Algorithm 69: An algorithm for the
solution of symmetric general three term
linear systems . . . . . . . . . . . . . 444--445
Anonymous Algorithms Supplement . . . . . . . . . 444--451
A. Jennings Algorithm 70: Solution of variable
bandwidth positive definite simultaneous
equations . . . . . . . . . . . . . . . 446--446
J. K. S. Dewar Algorithm 71: Procedures for interval
arithmetic . . . . . . . . . . . . . . . 447--450
M. A. Sabin and
D. J. McConalogue Note on Algorithm 67: An axis invariant
procedure to provide slopes at points by
local three-point parametric curve
fitting . . . . . . . . . . . . . . . . 451--451
S. J. Waters File Design Fallacies . . . . . . . . . 1--4
J. Palme Correspondence . . . . . . . . . . . . . 4--4
J. Palme Correspondence: On high level languages 4--4, 36--36
D. G. Bennett and
R. A. Davenport A Facility for Real-Time Program
Development . . . . . . . . . . . . . . 5--7
R. B. K. Dewar Correspondence . . . . . . . . . . . . . 7--7
R. B. K. Dewar Correspondence: On ``Another round of
FORTRAN'' . . . . . . . . . . . . . . . 7--7
B. A. Wichmann Five Algol Compilers . . . . . . . . . . 8--12
A. J. Finn Correspondence: Suggested Extensions to
FORTRAN IV . . . . . . . . . . . . . . . 12--12
A. J. Finn Suggested Extension to Fortran IV . . . 12--12
J. S. Rohl and
J. A. Linn A Note on Compiling Arithmetic
Expressions . . . . . . . . . . . . . . 13--14
J. G. P. Barnes Real Time Languages for Process Control 15--17
I. D. Hill Correspondence . . . . . . . . . . . . . 17--17
I. D. Hill Correspondence: On ``High level
languages for low level users'' . . . . 17--17
K. Dos and
H. Otto Optimal dynamic use of memory for PL/1
object programs in a real memory
environment . . . . . . . . . . . . . . 18--20
G. M. Bull Dynamic debugging in BASIC . . . . . . . 21--24
E. Whiteley Correspondence . . . . . . . . . . . . . 24--24
E. Whiteley Correspondence: On ``Step size
adjustment at discontinuities for fourth
order Runge--Kutta methods'' . . . . . . 24--24
J. L. M. Smith and
T. S. Holden Restart of an Operating System having a
Permanent File Structure . . . . . . . . 25--31
J. F. Lubran and
J. D. Roberts Some Observations on `Least Time to Go'
Scheduling . . . . . . . . . . . . . . . 32--36
J. A. N. Lee The formal definition of the BASIC
language . . . . . . . . . . . . . . . . 37--41
R. N. Ibbett The MU5 instruction pipeline . . . . . . 42--50
W. P. Boote and
S. R. Clark and
T. A. Rourke Simulation of a Paging Computer System 51--57
L. B. Hunt Numerical smoothing and filtering in $N$
dimensions . . . . . . . . . . . . . . . 58--65
C. S. Wetherell and
T. J. Buckholtz and
K. S. Booth A director for Kriegspiel, a variant of
chess . . . . . . . . . . . . . . . . . 66--70
C. G. Broyden Large Sparse Sets of Linear Equations 70--70
A. R. Forrest Interactive interpolation and
approximation by Bézier polynomials . . . 71--79
Anonymous Errata . . . . . . . . . . . . . . . . . 79a-79
M. J. B. Duff Picture Language Machines . . . . . . . 79--79
P. E. Gill and
G. F. Miller An algorithm for the integration of
unequally spaced data . . . . . . . . . 80--83
D. C. Cooper Essays on Cellular Automata . . . . . . 83--83
B. S. Thornton Reduction and linearisation of quadratic
constrained optimisation in linked
systems . . . . . . . . . . . . . . . . 84--87
Anthony Wren Proceedings of the Princeton Symposium
on Mathematical Programming . . . . . . 87--87
P. A. Samet Insight, Not Numbers . . . . . . . . . . 88--92
A. J. Flavell Correspondence . . . . . . . . . . . . . 92--92
A. J. Flavell Correspondence: On ``Another round of
FORTRAN'' . . . . . . . . . . . . . . . 92--92
Anonymous Notes on the Submission of Papers . . . 93--93
G. F. Coulouris and
J. M. Evans and
R. W. Mitchell Towards Content-Addressing in Data Bases 95--98
R. N. Cuff A Conversational Compiler for Full PL/I 99--104
M. A. Sabin Correspondence: Comments on some
algorithms for the representation of
curves by straight line segments . . . . 104--104
A. E. Brown and
C. E. Phillips and
J. S. Scandale and
D. P. Sparrow A data collection and display system for
a large-scale simulation . . . . . . . . 105--108
P. C. Capon and
D. Morris and
J. S. Rohl and
I. R. Wilson The MU5 compiler target language and
autocode . . . . . . . . . . . . . . . . 109--112
K. A. Brons Correspondence . . . . . . . . . . . . . 112--112
D. Morris and
G. D. Detlefsen and
G. R. Frank and
T. J. Sweeney The structure of the MU5 operating
system . . . . . . . . . . . . . . . . . 113--116
P. A. Samet and
D. W. Honey Calculation of a Double-Length Square
Root from Double-Length Number using
Single Precision Techniques . . . . . . 116--116
J. E. Stoy and
C. Strachey OS6 --- an experimental operating system
for a small computer. Part 1: general
principles and structure . . . . . . . . 117--124
G. Moon Correspondence . . . . . . . . . . . . . 124--124
G. Moon and
The Editor Correspondence: On editorial policy . . 124--124
E. W. Elcock and
J. J. McGregor and
A. M. Murray Data Directed Control and Operating
Systems . . . . . . . . . . . . . . . . 125--129
J. Meredith Smith Proof and Validation of Program
Correctness . . . . . . . . . . . . . . 130--131
P. B. Fellgett and
M. R. Williams Correspondence: The wonderland of
operating systems . . . . . . . . . . . 131--131
M. R. Williams and
B. Randell Correspondence: On ``Ludgate's
analytical machine of 1909' . . . . . . 131--131
S. H. Storey Optimal fixed batch sizes for real-time
inquiry systems . . . . . . . . . . . . 132--133
M. H. Beilby Road Traffic Simulation on a Small
Computer . . . . . . . . . . . . . . . . 134--137
B. A. Lewis Correspondence: On ``Improved numerical
methods for Volterra integral equations
of the first kind'' . . . . . . . . . . 137--137
B. A. Lewis Improved Numerical Methods for Volterra
Integral Equations of the First Kind . . 137--137
M. P. Atkinson and
S. R. Lang A comparison of some inverse Laplace
transform techniques for use in circuit
design . . . . . . . . . . . . . . . . . 138--139
J. Hyslop A Note on the Accuracy of Optimisation
Techniques . . . . . . . . . . . . . . . 140--140
J. Oliver A doubly-adaptive Clenshaw--Curtis
quadrature method . . . . . . . . . . . 141--147
E. G. Schlechtendahi and
U. Schumann Correspondence . . . . . . . . . . . . . 147--147
E. G. Schlechtendahl and
U. Schumann Correspondence: Remarks on ``Faults in
functions, in ALGOL and FORTRAN'' . . . 147--147
D. R. Powell and
J. R. Macdonald A rapidly convergent iterative method
for the solution of the generalised
nonlinear least squares problem . . . . 148--155
J. M. Watt Numerical Initial Value Problems in
Ordinary Differential Equations . . . . 155--155
H. E. Salzer Lagrangian interpolation at the
Chebyshev points $x_{n,\nu} \equiv
\cos(\nu\pi/n), \nu = 0(1)n$; some
unnoted advantages . . . . . . . . . . . 156--159
R. P. Saunders A Description and Analysis of Character
Maps . . . . . . . . . . . . . . . . . . 160--169
D. C. Cooper Artificial Intelligence and Heuristic
Programming . . . . . . . . . . . . . . 169--169
M. H. J. Webb Computer procurement policies for
universities and similar users . . . . . 170--175
Anonymous Errata . . . . . . . . . . . . . . . . . 175a-175
C. A. Rogers Computers in Number Theory . . . . . . . 175--175
C. H. Lindsey Algol 68 with Fewer Tears . . . . . . . 176--188
M. V. Wilkes On Preserving the Integrity of Data
Bases . . . . . . . . . . . . . . . . . 191--194
J. R. Eaton Book Review . . . . . . . . . . . . . . 194--194
J. E. Stoy and
C. Strachey OS6 --- an experimental operating system
for a small computer. Part 2:
input/output and filing system . . . . . 195--203
B. Wegbreit A Generalised Compactifying Garbage
Collector . . . . . . . . . . . . . . . 204--208
Kathrine M. Cunningham and
J. C. Ogilvie Evaluation of hierarchical grouping
techniques; a preliminary study . . . . 209--213
D. M. Jackson and
L. J. White Stability problems in non-statistical
classification theory . . . . . . . . . 214--221
L. W. Smith and
S. S. Yau Generation of regular expressions for
automata by the integral of regular
expressions . . . . . . . . . . . . . . 222--228
A. Young Book Review . . . . . . . . . . . . . . 228--228
Z. J. Ghandour Formal systems and analysis of context
sensitive languages . . . . . . . . . . 229--237
R. G. Bennetts A realistic approach to detection test
set generation for combinational logic
circuits . . . . . . . . . . . . . . . . 238--246
W. Cooper Correspondence . . . . . . . . . . . . . 246--246
W. Cooper Correspondence: On ``A quasi-intrinsic
scheme for passing a smooth curve
through a discrete set of points'' . . . 246--246
C. R. Edwards The Logic of Boolean Matrices . . . . . 247--253
Z. G. Vranesic and
V. C. Hamacher Ternary Logic in Parallel Multipliers 254--258
Anonymous Erratum . . . . . . . . . . . . . . . . 258--258
H. W. Bradly Correspondence: On high level languages 258--258
R. E. Scraton and
H. W. Bradly and
David Silber Correspondence . . . . . . . . . . . . . 258--258
R. E. Scraton Correspondence: The generalised Euler
transformation . . . . . . . . . . . . . 258--258
David Silber Correspondence: On ``Dynamic debugging
in BASIC'' . . . . . . . . . . . . . . . 258--258
S. J. Waters Erratum: ``File design fallacies'' . . . 258--258
A. C. Clare and
Elizabeth M. Cook and
M. F. Lynch The identification of variable-length,
equifrequent character strings in a
natural language data base . . . . . . . 259--262
W. R. Willcox and
S. P. Lapage Automatic Construction of Diagnostic
Tables . . . . . . . . . . . . . . . . . 263--267
B. L. Meek Correspondence . . . . . . . . . . . . . 267--267
B. L. Meek Correspondence: On ``Suggested
Extensions to FORTRAN IV'' . . . . . . . 267--267
J. Grad and
E. Zakrajsek $LR$ Algorithm with Laguerre Shift for
Symmetric Tridiagonal Matrices . . . . . 268--270
Anonymous Eric Mutch Memorial . . . . . . . . . . 270--270
H. F. Kaiser The JK method: a procedure for finding
the eigenvectors and eigenvalues of a
real symmetric matrix . . . . . . . . . 271--273
D. T. Hall Correspondence . . . . . . . . . . . . . 273--273
D. T. Hall Correspondence: On FORTRAN complainants 273--273
G. Loizou On the Quadratic Convergence of the
Jacobi Method for Normal Matrices . . . 274--276
P. Bares Correspondence . . . . . . . . . . . . . 276--276
P. Bare\vs Correspondence: On ``The formal
definition of the BASIC language'' . . . 276--276
R. P. Tewarson On Minimax Solutions of Linear Equations 277--279
R. F. Shepherd Algorithms supplement: Previously
published algorithms . . . . . . . . . . 280--281
Anonymous Algorithms Supplement . . . . . . . . . 280--285
H. S. P. Jones Algorithm 72: Multiple integer
arithmetic procedures in ALGOL . . . . . 281--282
W. D. Hoskins and
P. R. King Algorithm 73: Periodic cubic spline
interpolation using parametric splines 282--283
W. D. Hoskins and
P. R. King and
T. H. Andres Algorithm 74: Interpolation using
periodic splines of odd order with
equi-distant knots . . . . . . . . . . . 283--285
J. K. S. Dewar Note on Algorithm 71: Procedures for
interval arithmetic . . . . . . . . . . 285--285
D. J. McConalogue Note on Algorithm 66: An automatic
French-curve procedure for use with an
incremental plotter . . . . . . . . . . 285--285
C. O. M. Stross Operation of a Disc Data Base . . . . . 290--297
Anonymous IFIP WG 2.1 . . . . . . . . . . . . . . 297--297
M. Shain Acceptance Trials for a Real Time System 298--301
C. J. Burgess Compile-Time Error Diagnostics in
Syntax-Directed Compilers . . . . . . . 302--307
D. R. Gayler Correspondence . . . . . . . . . . . . . 307--307
D. R. Gayler and
The Editor Correspondence: On editorial policy . . 307--307
M. Wells File Compression Using Variable Length
Encodings . . . . . . . . . . . . . . . 308--313
F. R. A. Hopgood and
J. Davenport The Quadratic Hash Method When the Table
Size is a Power of $2$ . . . . . . . . . 314--315
Marya Goldman Repko Animated Cartoon Design with a CRT . . . 316--320
C. A. R. Hoare Proof of a structured program: The sieve
of Eratosthenes . . . . . . . . . . . . 321--325
R. F. Ling On the theory and construction of
$k$-clusters . . . . . . . . . . . . . . 326--332
J. R. Ehrman Correspondence . . . . . . . . . . . . . 332--332
J. R. Ehrman Correspondence: On ``Suggested
Extensions to FORTRAN IV'' . . . . . . . 332--332
M. Ahmad Iterative schemes for high speed
division . . . . . . . . . . . . . . . . 333--336
P. A. Lynn Recursive Digital Filters with
Linear-Phase Characteristics . . . . . . 337--342
P. A. Beaven and
D. W. Lewin An associative parallel processing
system for non-numerical computation . . 343--349
Anonymous Notes for intending authors . . . . . . 349--349
I. R. Smith and
L. A. Snider Numerical Solution of the Differential
Equations of a Synchronous Generator . . 350--355
Anonymous Erratum . . . . . . . . . . . . . . . . 355--355
Anonymous Eric Mutch Memorial . . . . . . . . . . 355--355
D. J. Evans An algorithm for the solution of certain
tridiagonal systems of linear equations 356--359
J. A. Templeman Correspondence . . . . . . . . . . . . . 359--359
J. A. Templeman Correspondence: On ``A data collection
and display system for a large-scale
simulation'' . . . . . . . . . . . . . . 359--359
J. A. Shanks Romberg tables for singular integrands 360--361
D. B. Cook Correspondence . . . . . . . . . . . . . 361--361
D. B. Cook Correspondence: `Packing' in FORTRAN . . 361--361
J. L. Seldon Correspondence . . . . . . . . . . . . . 361--361
J. L. Seldon Correspondence: The postage stamp
problem . . . . . . . . . . . . . . . . 361--361
D. Barton and
J. P. Fitch A review of algebraic manipulative
programs and their application . . . . . 362--381
J. M. Chambers Correspondence . . . . . . . . . . . . . 381--381
J. M. Chambers Correspondence: On ``Another round of
FORTRAN'' . . . . . . . . . . . . . . . 381--381
Anonymous Algorithms Supplement . . . . . . . . . 382--384
C. M. Crane Algorithm 75: Contour Plotting for
Functions specified at Nodal Points of
an Irregular Mesh based on an Arbitrary
Two-Parameter Coordinate System . . . . 382--384
R. F. Shepherd Algorithms supplement: Statement of
policy . . . . . . . . . . . . . . . . . 384--384
A. W. Goldsworthy Computers and Privacy --- A Review of
the Younger Comm. Report . . . . . . . . ??
John B. Farmakides and
others Legal Aspects of Computerized
Information Systems . . . . . . . . . . ??
P. Hammersley Editorial . . . . . . . . . . . . . . . 2--3
M. V. Wilkes The dynamics of paging . . . . . . . . . 4--9
P. J. Brown UNRAVEL --- a programming language to
put intelligence into dumps . . . . . . 10--12
V. G. Coulson and
I. D. Hill and
V. F. Hillier Algol survey program . . . . . . . . . . 13--15
I. R. MacCallum A simple analysis of the $n^{\rm th}$
order polyphase sort . . . . . . . . . . 16--18
R. J. Dakin Correspondence . . . . . . . . . . . . . 18--18
R. J. Dakin Correspondence: Impressions following
the BCS Conference on Computer
Performance . . . . . . . . . . . . . . 18--18
D. Wheeler and
R. Needham Correspondence . . . . . . . . . . . . . 18--18
D. Wheeler and
R. Needham and
The Editor Correspondence: On word use . . . . . . 18--18
P. L. Higginson and
P. T. Kirstein On the computation of cyclic redundancy
checks by program . . . . . . . . . . . 19--22
J. P. Fitch On algebraic simplification . . . . . . 23--27
R. I. Chaplin and
R. E. Crosbie and
J. L. Hay A graphical representation of the
Backus-Naur form . . . . . . . . . . . . 28--29
R. Sibson SLINK: an optimally efficient algorithm
for the single-link cluster method . . . 30--34
I. D. Hill Book Review . . . . . . . . . . . . . . 34--34
J. G. Griffiths Drawing opaque solids using an
incremental plotter . . . . . . . . . . 35--38
J. G. Laski Book Review . . . . . . . . . . . . . . 38--38
D. J. Grover Message orientated interactive graphics 39--45
M. J. D. Powell Book Review . . . . . . . . . . . . . . 45--45
M. F. Lynch and
J. H. Petrie A program suite for the production of
articulated subject indexes . . . . . . 46--51
Anonymous Errata . . . . . . . . . . . . . . . . . 51--51
D. M. Jackson Closed form approximations for random
errors in distance functions . . . . . . 52--56
D. M. Boulton and
C. S. Wallace Occupancy of a rectangular array . . . . 57--63
J. J. Florentin Book Review . . . . . . . . . . . . . . 63--63
A. D. Maude Interpolation --- Mainly for Graph
Plotters . . . . . . . . . . . . . . . . 64--65
V. Zakian and
R. K. Littlewood Numerical inversion of Laplace
transforms by weighted least-squares
approximation . . . . . . . . . . . . . 66--68
A. C. Day Book Review . . . . . . . . . . . . . . 68--68
J. A. Grant and
G. D. Hitchins The Solution of Polynomial Equations in
Interval Arithmetic . . . . . . . . . . 69--72
F. Oliveira-Pinto Simultaneous trigonometric approximation
of the function and its first derivative 73--76
G. A. Watson On estimating best approximations of
functions defined by integral equations 77--80
Anonymous COBOL Information Bulletin Number 16 . . 81--92
F. James Rohlf Algorithm 76: Hierarchical clustering
using the minimum spanning tree . . . . 93--95
R. F. Shepherd Algorithms supplement --- Statement of
Policy . . . . . . . . . . . . . . . . . 95--95
P. M. Stocker and
P. A. Dearnley Self-organising data management systems 100--105
J. N. Barry Book Review . . . . . . . . . . . . . . 105--105
J. L. Berry Book Review . . . . . . . . . . . . . . 105--105
R. M. Burstall Book Review . . . . . . . . . . . . . . 105--105
M. M. Lehman Computer usage control . . . . . . . . . 106--110
D. W. Lozier and
L. C. Maximon and
W. L. Sadowski A bit comparison program for algorithm
testing . . . . . . . . . . . . . . . . 111--117
E. A. Edmonds Book Review . . . . . . . . . . . . . . 117--117
B. Gay and
S. G. Payne Interactive digital simulation on a
small computer . . . . . . . . . . . . . 118--121
P. J. Brown A practical usage of outer and inner
syntax . . . . . . . . . . . . . . . . . 122--123
M. J. Garside Book Review . . . . . . . . . . . . . . 123--123
W. Paker Book Review . . . . . . . . . . . . . . 123--123
C. R. Jordan A note on LISP universal $S$-functions 124--125
B. S. Walker Book Review . . . . . . . . . . . . . . 125--125
C. Bays Some Techniques for Structuring Chained
Hash Tables . . . . . . . . . . . . . . 126--131
R. C. Welland Book Review . . . . . . . . . . . . . . 131--131
A. J. Szanser Bracketing technique in elastic matching 132--134
P. T. Kirstein Book Review . . . . . . . . . . . . . . 134--134
A. S. Radford Book Review . . . . . . . . . . . . . . 134--134
P. A. Samet Book Review . . . . . . . . . . . . . . 134--134
F. P. Wyman Binary programming: a decision rule for
selecting optimal vs heuristic
techniques . . . . . . . . . . . . . . . 135--140
Anonymous Errata . . . . . . . . . . . . . . . . . 140--140
Anonymous Eric Mutch Memorial Prize . . . . . . . 140--140
Z. Kohavi and
J. A. Rivierre and
I. Kohavi Machine distinguishing experiments . . . 141--147
F. W. M. Stentiford and
D. W. Lewin An evolutionary approach to the concept
of randomness . . . . . . . . . . . . . 148--151
Anonymous Acm George E. Forsythe student paper
competition . . . . . . . . . . . . . . 151--151
N. Marovac A single data-display structure: a new
view on interactive computer graphics in
CAD . . . . . . . . . . . . . . . . . . 152--156
A. Ricci A constructive geometry for computer
graphics . . . . . . . . . . . . . . . . 157--160
M. Ahmad The computing speed of a new machine . . 161--164
S. L. Hurst The application of Chow parameters and
Rademacher-Walsh matrices in the
synthesis of binary functions . . . . . 165--173
D. Zissos and
F. G. Duncan Boolean minimisation . . . . . . . . . . 174--179
K. Spyropoulos and
E. Kiountouzis and
A. Young Discrete approximation in the $L_1$ norm 180--186
Anonymous Algorithms supplement . . . . . . . . . 187--188
Jan Christiansen Algorithm 77: Solving a system of
simultaneous ordinary differential
equations of the first order using a
method for automatic step change . . . . 187--188
J. Palme Correspondence: SIMPL/I --- a new
simulation language from IBM . . . . . . 189--189
G. H. Kirby and
The Editor and
R. Wane and
I. D. Hill and
Brian Meek Correspondence: Letters to \booktitleThe
Computer Journal . . . . . . . . . . . . 189--190
I. D. Hill Correspondence . . . . . . . . . . . . . 190--190
H. E. Salzer Correspondence . . . . . . . . . . . . . 190--190
H. E. Salzer Correspondence: On ``Lagrangian
interpolation at the Chebyshev points
$x_{n,\nu} \equiv \cos(\nu\pi/n), \nu =
0(1)n$'' . . . . . . . . . . . . . . . . 190--190
R. Wane Correspondence . . . . . . . . . . . . . 190--190
H. W. G. Gearing Editorial: the silent business user . . 194--195
R. Jorré and
G. Boyfield and
J. Darkin Data communication user research in the
Post Office: Part 1 . . . . . . . . . . 196--204
Anonymous Review: Short notice . . . . . . . . . . 204--204
F. G. Heath and
C. M. Reeves Book reviews: \booktitleComputer Logic
Design, by M. Morris Mano, 1972;
\booktitleLogic and Logic Design, by B.
Girling and H. G. Moring; \booktitleAn
Introduction to Job Control Language, by
Ronald J. DeMasi and Francis J. Longo,
1972 . . . . . . . . . . . . . . . . . . 204--204
F. G. Heath Book Review . . . . . . . . . . . . . . 204--204
C. M. Reeves Book Review . . . . . . . . . . . . . . 204--204
J. K. Broadbent and
G. F. Coulouris MEMBERS --- a Microprogrammed
Experimental Machine with a Basic
Executive for Real-time Systems . . . . 205--208
C. A. R. Hoare A structured paging system . . . . . . . 209--215
B. Girling and
D. A. Sturt Book reviews: \booktitleComputer
Simulation of Dynamic Systems, by R. J.
Kochenburger, 1972; \booktitle
Electronic Data Processing and Computers
for Commercial Students, by E. A. Bird,
1972 . . . . . . . . . . . . . . . . . . 215--215
B. Girling Book Review . . . . . . . . . . . . . . 215--215
D. A. Sturt Book Review . . . . . . . . . . . . . . 215--215
J. L. Dawson Combining interpretive code with machine
code . . . . . . . . . . . . . . . . . . 216--219
R. J. Dakin and
P. C. Poole A mixed code approach . . . . . . . . . 219--222
D. W. Lewin Book Review . . . . . . . . . . . . . . 222--222
J. K. Reid and
D. W. Lewin Book reviews: \booktitleSparse Matrices
and their Applications, edited by D. L.
Rose and R. A. Willoughby, 1972;
\booktitleIntroduction to Digital
Computer Technology, by Louis Nashelsky,
1973 . . . . . . . . . . . . . . . . . . 222--222
J. K. Reid Book Review . . . . . . . . . . . . . . 222--222
J. A. Llewellyn The deadly embrace --- a finite state
model approach . . . . . . . . . . . . . 223--225
J. R. Ullmann Book review: \booktitleIntroduction to
Mathematical Techniques in Pattern
Recognition, by Harry C. Andrews, 1972 225--225
J. R. Ullmann Book Review . . . . . . . . . . . . . . 225--225
H. C. Lucas, Jr. and
L. Presser A method of software evaluation: the
case of programming language translators 226--231
G. Terrine Coordinate grammars and parsers . . . . 232--244
Anonymous Errata . . . . . . . . . . . . . . . . . 244--244
Anonymous Eric Mutch Memorial Prize . . . . . . . 244--244
D. V. A. Campbell Errata: ``A simple analysis of the
$n^{\rm th}$ order polyphase sort'' . . 244--244
S. G. Tzafestas State estimation algorithms for
non-linear stochastic sequential
machines . . . . . . . . . . . . . . . . 245--253
R. M. Burstall and
P. A. Samet Book reviews: \booktitleRepresentation
and Meaning, by Herbert A. Simon and
Laurent Siklossy, 1972; \booktitleA
Collection of Programming Problems and
Techniques, by H. A. Maurer and M. R.
Williams, 1972 . . . . . . . . . . . . . 253--253
R. M. Burstall Book Review . . . . . . . . . . . . . . 253--253
P. A. Samet Book Review . . . . . . . . . . . . . . 253--253
D. M. Boulton and
C. S. Wallace An Information Measure for Hierarchic
Classification . . . . . . . . . . . . . 254--261
P. A. Samet Book Review . . . . . . . . . . . . . . 261--261
Joan Walsh and
P. A. Samet Book reviews: \booktitleComputer
Applications of Numerical Methods, by
Shan S. Kuo, 1972;
\booktitleIntroduction to Computational
Methods for Students of Calculus, by S.
S. McNeary, 1972 . . . . . . . . . . . . 261--261
J. Walsh Book Review . . . . . . . . . . . . . . 261--261
N. Christofides Large scheduling problems with bivalent
costs . . . . . . . . . . . . . . . . . 262--264
E. M. Chance Book review: \booktitleFORTRAN
Techniques, by A. Colin Day, 1972 . . . 265--265
E. M. Chance Book Review . . . . . . . . . . . . . . 265--265
C. B. Dunham When absolute approximations are optimal
in function subroutines . . . . . . . . 265--265
N. G. Meadows Automatic frequency and Mikhailov locus
plotting for systems with distributed
lags: a new analogue computer technique 266--268
A. G. Bell Himmelbett . . . . . . . . . . . . . . . 269--272
Tran Van Hoa Algorithm 78: Counting preferential
votes in multi-member constituencies
using absolute majority criteria . . . . 273--276
Anonymous Algorithms supplement . . . . . . . . . 273--280
D. Liggins Algorithm 79: an algorithm for the
capacitated transportation problem . . . 276--278
A. Benson and
D. J. Evans Algorithm 80: an algorithm for the
solution of periodic quindiagonal
systems of linear equations . . . . . . 278--279
R. F. Shepherd Algorithms supplement --- Statement of
Policy . . . . . . . . . . . . . . . . . 279--280
Anonymous Operational Research Society annual
conference: Torquay November 13--16 1973
--- Changes resulting from developments
in telecommunications . . . . . . . . . 280--280
C. A. Bowring Discussion and correspondence: using
macros to aid assembly-language teaching 281--283
P. Giles Implementation problems --- why are they
seldom aired in the Journal? . . . . . . 283--283
D. W. Barron Correspondence: On editorial policy . . 284--284
C. B. Dunham and
G. A. Watson Correspondence: Degeneracy in the matrix
of partial derivatives . . . . . . . . . 284--284
L. J. Gallaher Correspondence: On Dijkstra and the GOTO
statement . . . . . . . . . . . . . . . 284--285
D. T. Muxworthy Correspondence: On ``Compile-Time Error
Diagnostics in Syntax-Directed
Compilers'' . . . . . . . . . . . . . . 285--285
A. J. D. Pawson and
F. R. A. Hopgood Correspondence: Hashing techniques for
table searching . . . . . . . . . . . . 285--285
Robert A. Fairthorne and
The Editor Correspondence: On word use . . . . . . 286--286
C. R. Tyler and
The Editor Correspondence: Editorial . . . . . . . 286--287
Charles J. Gibbons and
M. Wells Correspondence: On ``File Compression
Using Variable Length Encodings'' . . . 287--287
D. G. Glading Correspondence: On Dakin's letter . . . 287--287
R. N. Ibbett and
E. T. Warburton and
The Editor Correspondence: The computing speed of a
new machine . . . . . . . . . . . . . . 287--287
E. S. Page Editorial: the journal --- why and what
for . . . . . . . . . . . . . . . . . . 290--290
R. Jorré and
G. Boyfield and
J. Darkin Data communication user research in the
Post Office: Part 2 . . . . . . . . . . 292--302
J. Inglis and
E. G. Dee Flexibility of Block-length for Magnetic
Files . . . . . . . . . . . . . . . . . 303--307
M. J. B. Duff Book Review . . . . . . . . . . . . . . 307--307
D. V. Lindley Book Review . . . . . . . . . . . . . . 307--307
R. J. Leaman and
M. H. Lloyd and
C. S. Repton The development and testing of a
processor self-test program . . . . . . 308--314
R. Fletcher Book Review . . . . . . . . . . . . . . 314--314
R. Fletcher Book Review . . . . . . . . . . . . . . 314--314
C. A. B. Smith Book Review . . . . . . . . . . . . . . 314--314
M. I. Padgett Tree Driven Data Input and its
Validation . . . . . . . . . . . . . . . 315--321
F. E. Taylor Book Review . . . . . . . . . . . . . . 321--321
M. Thomas Book Review . . . . . . . . . . . . . . 321--321
P. B. Schneck and
Ellinor Angel A Fortran to Fortran optimising compiler 322--330
A. C. Day Book Review . . . . . . . . . . . . . . 330--330
H. Whitfield and
A. S. Wight EMAS --- the Edinburgh Multi-Access
System . . . . . . . . . . . . . . . . . 331--346
F. E. Taylor Book Reviews . . . . . . . . . . . . . . 346--346
E. A. Akkoyunlu A linear algorithm for computing the
optimum university timetable . . . . . . 347--350
J. Bordier and
H. Saya A necessary and sufficient condition for
a power language to be LL(k) . . . . . . 351--356
Anonymous Review: Short notice . . . . . . . . . . 356--356
Anonymous Review: Short notice . . . . . . . . . . 356--356
R. J. Hynds Book Reviews . . . . . . . . . . . . . . 356--356
R. C. Varney and
M. H. Gotterer The structural foundation for an
operating system . . . . . . . . . . . . 357--359
D. H. Green and
R. G. Kelsch Nonlinear Ternary Feedback Shift
Registers . . . . . . . . . . . . . . . 360--367
P. F. Stojak Hybrid and Digital Computation Results
in Multicomponent Distillation
Simulation . . . . . . . . . . . . . . . 368--374
G. M. Bull Book Review . . . . . . . . . . . . . . 374--374
J. J. Florentin Book Review . . . . . . . . . . . . . . 374--374
F. Oliveira-Pinto Generalised Chebyshev Polynomials and
Their Use in Numerical Approximation . . 375--379
B. L. Meek Book Review . . . . . . . . . . . . . . 379--379
B. S. Walker Book Review . . . . . . . . . . . . . . 379--379
D. C. Brown Discussion and correspondence: the
project, and the future of Computing
Science courses . . . . . . . . . . . . 380--382
Anonymous Errata . . . . . . . . . . . . . . . . . 382--382
Sven Eriksen The Data Base Concept . . . . . . . . . ??
Anonymous Eric Mutch Memorial . . . . . . . . . . 2--2
J. K. Broadbent Microprogramming and System Architecture 2--8
D. F. Dives Book Review . . . . . . . . . . . . . . 8--8
L. G. Proll Book Review . . . . . . . . . . . . . . 8--8
D. A. H. Brown Some Error Correcting Codes for Certain
Transposition and Transcription Errors
in Decimal Integers . . . . . . . . . . 9--12
J. Eve Book Review . . . . . . . . . . . . . . 12--12
P. A. Dearnley A model of a self-organising data
management system . . . . . . . . . . . 13--16
S. J. Waters Methodology of Computer Systems Design 17--24
P. Burnett and
P. A. Kidd and
A. M. Lister Simulation of Real-Time Program Faults 25--27
H. M. Liddell Book Review . . . . . . . . . . . . . . 27--27
A. Young Book Review . . . . . . . . . . . . . . 27--27
J. H. Kardasz and
G. Molnar A Simula-based structure oriented
language for the dynamic simulation of
chemical plants . . . . . . . . . . . . 28--37
I. M. Barron Book Review . . . . . . . . . . . . . . 37--37
Ben Wegbreit Procedure Closure in EL1 . . . . . . . . 38--43
J. Cohen and
Eileen Carton Non-Deterministic Fortran . . . . . . . 44--51
J. J. Florentin Consistency Auditing of Databases . . . 52--58
M. J. B. Duff Book Review . . . . . . . . . . . . . . 58--58
J. Inglis Inverted Indexes and Multi-List
Structures . . . . . . . . . . . . . . . 59--63
D. H. Ferriss Book Review . . . . . . . . . . . . . . 63--63
C. A. Lang Book Review . . . . . . . . . . . . . . 63--63
A. J. Thomas Book Review . . . . . . . . . . . . . . 63--63
D. Pai and
D. Lewin Analysis of Sequential Logic Circuits 64--68
E. S. Page and
L. Waller An interactive approach for the solution
of a class of discrete optimisation
problems . . . . . . . . . . . . . . . . 69--74
M. C. Thomas Book Review . . . . . . . . . . . . . . 74--74
P. A. Wood Book Review . . . . . . . . . . . . . . 74--74
D. A. Phillips A preliminary investigation of function
optimisation by a combination of methods 75--79
I. D. Hill Book Review . . . . . . . . . . . . . . 79--79
W. Proskurowski Ordering Method to Accelerate the
Solution of Mate-In-Two Chess Problems
by Computer . . . . . . . . . . . . . . 80--81
Anonymous Erratum . . . . . . . . . . . . . . . . 81--81
Anonymous \booktitleJournal of the Computer
Society of India . . . . . . . . . . . . 81--81
Dana L. Ulery and
H. M. Khalil A survey of language-oriented systems
for numerical linear algebra . . . . . . 82--88
W. R. Broderick Book Review . . . . . . . . . . . . . . 88--88
J. H. Westcott Book Review . . . . . . . . . . . . . . 88--88
R. James Rohlf Algorithm 81: Dendrogram plot . . . . . 89--91
Anonymous Algorithms supplement . . . . . . . . . 89--92
W. D. Hoskins Note on Algorithm 74: Interpolation
using periodic splines of odd order with
equi-distant knots . . . . . . . . . . . 91--91
R. F. Shepherd Algorithms supplement: Statement of
policy . . . . . . . . . . . . . . . . . 91--92
W. R. Broderick Book reviews: \booktitleSpline Analysis,
by Martin H. Schultz, 1972;
\booktitleIntroduction to Programming,
by A. Sharp; \booktitleAlgol
Programming, by R. W. Sharp . . . . . . 92--92
W. R. Broderick Book Review . . . . . . . . . . . . . . 92--92
M. J. D. Powell Book Review . . . . . . . . . . . . . . 92--92
J. M. Triance Discussion and Correspondence: Handling
records with a variable structure in
COBOL . . . . . . . . . . . . . . . . . 93--94
D. A. H. Brown Correspondence: Cyclic redundancy
checking by program . . . . . . . . . . 94--95
J. Boothroyd Correspondence: On a radix conversion
process . . . . . . . . . . . . . . . . 95--95
F. Poole and
P. M. Stocker Correspondence: On ``Self-organising
data management systems'' . . . . . . . 95--95
G. A. Fisher Correspondence: On ``Editorial: the
silent business user'' . . . . . . . . . 95--96
H. N. Coates and
The Editor Correspondence: The silent business user 96--96
R. G. Parsons and
A. G. Dale and
C. V. Yurkanan Data Manipulation Language Requirements
for Data Base Management Systems . . . . 99--103
A. Y. C. Chau and
B. W. Davies and
B. Zacharov Island --- an Interactive Graphics
System for Mathematical Analysis . . . . 104--112
P. A. Samet Book Review . . . . . . . . . . . . . . 112--112
M. Thomas Book Review . . . . . . . . . . . . . . 112--112
L. E. Heindel and
J. T. Roberto ARPL --- A Retrieval Process Language 113--116
R. M. Needham and
M. V. Wilkes Domains of Protection and the Management
of Processes . . . . . . . . . . . . . . 117--120
J. J. Florentin Book Review . . . . . . . . . . . . . . 120--120
P. T. Kirstein Book Review . . . . . . . . . . . . . . 120--120
L. Presser and
J. Benson Evaluation of Compiler Diagnostics . . . 121--123
D. T. Muxworthy Book Review . . . . . . . . . . . . . . 123--123
B. S. Walker Book Review . . . . . . . . . . . . . . 123--123
G. M. Stacey A Fortran Interface to the CODASYL
Database Task Group Specifications . . . 124--129
M. Wells and
A. Denson Direct Execution of Programming
Languages . . . . . . . . . . . . . . . 130--134
O. Amble and
D. E. Knuth Ordered Hash Tables . . . . . . . . . . 135--142
Anonymous Review: Short notice . . . . . . . . . . 142--142
F. J. M. Laver Book Review . . . . . . . . . . . . . . 142--142
J. Woods Book Review . . . . . . . . . . . . . . 142--142
J. S. Fenton Memoryless Subsystems . . . . . . . . . 143--147
Anonymous Review: Short notice . . . . . . . . . . 147--147
G. C. Goodwin Book Reviews . . . . . . . . . . . . . . 147--147
A. M. Lister Validation of Systems of Parallel
Processes . . . . . . . . . . . . . . . 148--151
W. F. Smyth and
E. Radaceanu A storage scheme for hierarchic
structures . . . . . . . . . . . . . . . 152--156
R. G. Ward A variable delay method for improving
recognition of parallel processable code
in computer programs . . . . . . . . . . 157--164
D. F. Mayers Book Review . . . . . . . . . . . . . . 164--164
C. M. Reeves Book Review . . . . . . . . . . . . . . 164--164
D. M. Brandon, Jr. The implementation and use of sparse
matrix techniques in general simulation
programs . . . . . . . . . . . . . . . . 165--171
N. M. Brooke Book Review . . . . . . . . . . . . . . 171--171
M. J. Cross Nimbus 4 SCR Data Handling . . . . . . . 172--180
J. J. Florentin Book Review . . . . . . . . . . . . . . 180--180
J. R. Manning Continuity Conditions for Spline Curves 181--186
Cliff Lloyd Book Review: \booktitleStructured
programming, by O.-J. Dahl, E. W.
Dijkstra and C. A. R. Hoare . . . . . . 186--186
C. Lloyd Book Review . . . . . . . . . . . . . . 186--186
H. A. Marriott Correspondence . . . . . . . . . . . . . 187--187
H. A. Marriott Correspondence: On the spelling of
ALGORITHM . . . . . . . . . . . . . . . 187--187
L. G. Proll and
F. P. Wyman Correspondence: Observations on a
decision rule for binary programming . . 187--188
K. J. MacCallum Correspondence . . . . . . . . . . . . . 188--188
K. J. MacCallum Correspondence: On mixing interpretive
and machine code . . . . . . . . . . . . 188--188
R. W. Bemer Correspondence: On mixing interpretive
and machine code . . . . . . . . . . . . 188--189
K. Freeman Correspondence . . . . . . . . . . . . . 189--189
K. Freeman Correspondence: On ``Himmelbett'' . . . 189--189
A. G. Bromley and
Z. G. Vranesic and
V. C. Hamacher Correspondence: Ternary logic in
parallel multipliers . . . . . . . . . . 189--190
B. W. Dawkins Correspondence: \booktitleThe Computer
Journal . . . . . . . . . . . . . . . . 190--190
D. L. Fisher Correspondence . . . . . . . . . . . . . 190--190
D. L. Fisher Correspondence: On ``The project, and
the future of Computing Science
courses'' . . . . . . . . . . . . . . . 190--190
J. Strawson Correspondence . . . . . . . . . . . . . 190--190
Joy Strawson Correspondence: On ``Himmelbett'' . . . 190--190
P. J. Hathaway and
D. Van Vliet Correspondence: An efficient method for
reading and writing subscripted arrays
using FORTRAN IV . . . . . . . . . . . . 190--191
F. F. Land Book Review . . . . . . . . . . . . . . 191--191
R. Needham and
F. F. Land and
M. Wells Book reviews: \booktitleComputer Data
Security, by H. Katzan, Jr., 1974;
\booktitleInformation Systems in
Management, by R. J. Radford, 1973;
\booktitleData Transmission, by M. D.
Bacon and G. M. Bull, 1973 . . . . . . . 191--191
R. Needham Book Review . . . . . . . . . . . . . . 191--191
M. Wells Book Review . . . . . . . . . . . . . . 191--191
Anonymous Special summer programme at
Massachusetts Institute of Technology 192--192
J. Inglis and
S. H. Lavington Book reviews: \booktitleThe Analysis of
Information Systems, by C. T. Meadow,
1973; \booktitleIntroduction to Digital
Computer Design, by D. J. Wooloms, 1973 192--192
B. Wagle and
P. M. Jenkins Corporate Planning, Models and Computer
Systems . . . . . . . . . . . . . . . . 194--200
L. Fox Book Review: \booktitleIntroduction to
Matrix Computations, G. W. Stewart,
1973; 441 pages (Academic Press) . . . . 200--200
D. A. H. Brown Biquinary Decimal Error Detection Codes
with One, Two and Three Check Digits . . 201--204
M. J. M. Bernal Book Review . . . . . . . . . . . . . . 204--204
H. M. Liddell Book Review . . . . . . . . . . . . . . 204--204
P. A. Dearnley The Operation of a Model Self Organising
Data Management System . . . . . . . . . 205--210
D. A. H. Brown Book Review . . . . . . . . . . . . . . 210--210
S. J. Waters Computer-Aided Methodology of Computer
Systems Design . . . . . . . . . . . . . 211--215
P. D. Stephens The IMP language and compiler . . . . . 216--223
J. K. Mullin and
G. F. Stuart Optimum Blocking Factors for a Mix of
Sequentially Processed Jobs . . . . . . 224--228
P. T. Kirstein Book Review . . . . . . . . . . . . . . 228--228
P. A. Samet Book Review . . . . . . . . . . . . . . 228--228
R. A. d'Inverno and
R. A. Russell-Clark CLAM --- its Function, Structure and
Implementation . . . . . . . . . . . . . 229--233
R. Haskell Symmetrical Precedence Relations on
General Phrase Structure Grammars . . . 234--241
T. Komor A note on left factored languages . . . 242--244
N. Marovac Book Review . . . . . . . . . . . . . . 244--244
A. H. Wise Book Review . . . . . . . . . . . . . . 244--244
S. Dvorák and
B. Kropác Decomposition of the Gozinto's Graph
with the Use of a Nesting Store . . . . 245--248
M. I. Jackson Book Review . . . . . . . . . . . . . . 248--248
D. M. Jackson and
W. W. Wadge Normal Form Reduction of Probabilistic
Computations in Non-Parametric
Classification . . . . . . . . . . . . . 249--252
D. H. Halfpenny Book Review . . . . . . . . . . . . . . 252--252
S. Waters Book Review . . . . . . . . . . . . . . 252--252
Jean V. Scott Computer Design of Cascade Logic . . . . 253--260
I. J. Fitzpatrick Book Review . . . . . . . . . . . . . . 260--260
C. A. Rogers Book Review . . . . . . . . . . . . . . 260--260
Dana H. Ballard and
C. O. Jelinek and
R. Schinzinger An algorithm for the solution of
constrained generalised polynomial
programming problems . . . . . . . . . . 261--266
H. M. Khalil and
D. L. Ulery LINEAL: a system for numerical linear
algebra . . . . . . . . . . . . . . . . 267--274
J. L. Hay and
R. E. Crosbie and
R. I. Chaplin Integration Routines for Systems with
Discontinuities . . . . . . . . . . . . 275--278
H. N. Coates Discussion: Management in the Computer
business . . . . . . . . . . . . . . . . 279--282
D. W. Barron Discussion: Job control languages and
job control programs . . . . . . . . . . 282--286
A. J. Finn Correspondence . . . . . . . . . . . . . 287--287
M. J. R. Healy Correspondence . . . . . . . . . . . . . 287--287
D. W. Honey The `Queensway' Mersey tunnel entrance
control project . . . . . . . . . . . . 290--294
B. E. Jones and
M. A. Ould The Patient Medical Record as a Database 295--301
F. E. Randall Interrogating Date-Sensitive Files . . . 302--305
B. Richards Computers in Medicine Series . . . . . . 305--305
T. L. Shaftel and
R. W. Zmud Allocation of Computer Resources Through
Flexible Pricing . . . . . . . . . . . . 306--312
A. L. Lim A PL/I Approach to Programming Languages 312--312
R. H. Pierce Source Language Debugging on a Small
Computer . . . . . . . . . . . . . . . . 313--317
E. L. Albasiny Computational Methods for Matrix
Eigenproblems . . . . . . . . . . . . . 317--317
D. H. McLain Drawing Contours from Arbitrary Data
Points . . . . . . . . . . . . . . . . . 318--324
M. V. Wilkes The Art of Computer Programming, Volume
3, Sorting and Searching . . . . . . . . 324--324
S. H. Valentine Comparative Notes on Algol 68 and PL/I 325--331
N. Marovac A method for defining general networks
for CAD, using interactive computer
graphics . . . . . . . . . . . . . . . . 332--336
D. W. Barron A Mathematical Theory of Global Program
Optimization . . . . . . . . . . . . . . 336--336
E. A. Edmonds Problems of Heuristics . . . . . . . . . 336a-336
R. Bird Speeding up Programs . . . . . . . . . . 337--339
A. Ecker The period of search for the quadratic
and related hash methods . . . . . . . . 340--343
E. S. Page Concepts and Methods in Discrete Event
Digital Simulation . . . . . . . . . . . 343--343
G. Rozenberg and
D. Wood Generative Models for Parallel Processes 344--348
D. Simpson Documentation Manual . . . . . . . . . . 348--348
Kenneth B. Salomon An efficient algorithm which determines
the output from a sequential machine for
regular inputs . . . . . . . . . . . . . 349--354
J. R. Eaton A Practical Approach to Computer
Simulation in Business . . . . . . . . . 354--354
B. S. Walker Integrated circuits in digital
electronics . . . . . . . . . . . . . . 354a-354
W. E. Wright An Axiomatic Specification of Euclidean
Analysis . . . . . . . . . . . . . . . . 355--364
D. B. G. Edwards Digital Systems: Hardware Organization
and Design . . . . . . . . . . . . . . . 364a-364
J. O. Jenkins Modern Data Processing for Management: a
basic systems approach . . . . . . . . . 364b-364
M. M. Lehman Digital Computer Systems Principles . . 364--364
M. Boari and
P. Pellizzardi and
R. Rossi Performance Evaluation of a Process
Control System by Simulation Model . . . 365--370
P. Hammersley The Skyline of Information Processing 370a-370
G. M. Phillips Topics in Numerical Analysis . . . . . . 370--370
F. Durbin Numerical Inversion of Laplace
Transforms: an Efficient Improvement to
Dubner and Abate's Method . . . . . . . 371--376
F. F. Land Functional Analysis of Information
Processing . . . . . . . . . . . . . . . 376--376
R. A. Zambardino Algorithm 82: Solutions of systems of
linear equations with partial pivoting
and reduced storage requirements . . . . 377--378
Anonymous Algorithms Supplement . . . . . . . . . 377--380
L. R. Piper and
I. R. Franklin and
N. H. Westwood Algorithm 83: a rejection procedure for
sampling from the distribution of
chi-squared ($\chi^2$) or the sampling
variance ($s^2$) . . . . . . . . . . . . 378--378
T. Andres and
W. D. Hoskins and
G. E. McMaster Algorithm 84: a coupled algorithm for
the solution of certain tridiagonal
systems of linear equations . . . . . . 378--379
J. K. S. Dewar Note on Algorithm 71: Procedures for
interval arithmetic . . . . . . . . . . 379--380
I. D. Hill and
R. W. M. Wedderburn Note on Algorithm 78: Counting
preferential votes in multi-member
constituencies using absolute majority
criteria . . . . . . . . . . . . . . . . 380--380
Frank Parker Note on Algorithm 78: Counting
preferential votes in multi-member
constituencies using absolute majority
criteria . . . . . . . . . . . . . . . . 380--380
J. D. Beasley Correspondence: System 4 random number 381--381
J. Boothroyd Erratum: ``On a radix conversion
process'' . . . . . . . . . . . . . . . 381--381
H. H. W. Pitcher Correspondence: Definition of random . . 381--381
C. Whitby-Strevens Correspondence: Microprogramming and
systems architecture . . . . . . . . . . 381--381
Anonymous Correspondence . . . . . . . . . . . . . 381--383
B. Hamilton Kelly Correspondence: On radix conversion . . 382--382
A. M. Andrew Correspondence: Decimal number checking
schemes . . . . . . . . . . . . . . . . 382--383
Anonymous Editorial Addresses . . . . . . . . . . 383--383
D. A. Bell Correspondence: Computing Science . . . 383--383
R. I. Kitney Book review: \booktitleComputing
Principles and Techniques, by B. L.
Vickery, 1979 . . . . . . . . . . . . . 383--383
J. Leech Correspondence: On the spelling of
ALGORITHM . . . . . . . . . . . . . . . 383--383
J. E. Jarvis The many faces of Multics . . . . . . . 2--6
K. A. Robinson Database --- the Ideas Behind the Ideas 7--11
S. J. Waters Estimating Magnetic Disc Seeks . . . . . 12--17
C. E. Goble A free-text retrieval system using hash
codes . . . . . . . . . . . . . . . . . 18--20
I. D. C. Gurney Book Review . . . . . . . . . . . . . . 20--20
R. C. Welland Book Review . . . . . . . . . . . . . . 20--20
C. T. Fike A permutation generation method . . . . 21--22
R. Haskell Efficient Implementation of a Class of
Recursively Defined Functions . . . . . 23--29
A. F. Cárdenas and
R. W. Seeley A simple data structure for interactive
graphic design/drafting . . . . . . . . 30--33
J. W. Black Book Review . . . . . . . . . . . . . . 33--33
C. J. Dickinson Book Review . . . . . . . . . . . . . . 33--33
A. Parkin Book Review . . . . . . . . . . . . . . 33--33
J. R. White and
L. Presser A structured language for translator
construction . . . . . . . . . . . . . . 34--42
I. M. Khabaza Book Review . . . . . . . . . . . . . . 42--42
A. L. Lim Book Review . . . . . . . . . . . . . . 42--42
D. Partridge A dynamic database which automatically
removes unwanted generalisation for the
efficient analysis of language features
that exhibit a disparate frequency
distribution . . . . . . . . . . . . . . 43--48
J. Inglis Book Review . . . . . . . . . . . . . . 48--48
P. T. Kirstein Book Review . . . . . . . . . . . . . . 48--48
J. R. Slagle and
L. M. Norton Automated Theorem-Proving for the
Theories of Partial and Total Ordering 49--54
S. R. Wilbur Book Review . . . . . . . . . . . . . . 54--54
G. A. Lanzarone and
M. Ornaghi Program Construction by Refinements
Preserving Correctness . . . . . . . . . 55--62
F. G. Duncan and
D. Zissos and
Maureen Walls A postfix notation for logic circuits 63--69
E. W. Haddon Book Review . . . . . . . . . . . . . . 69--69
D. J. Evans A recursive algorithm for determining
the eigenvalues of a quindiagonal matrix 70--73
J. C. Nash A One-sided Transformation Method for
the Singular Value Decomposition and
Algebraic Eigenproblem . . . . . . . . . 74--76
F. Oliveira-Pinto The use of derivatives in the
optimisation of the truncation error of
polynomial approximations . . . . . . . 77--80
R. Hughes Jones and
P. R. Graves-Morris and
G. J. Makinson Algorithm 85: Generation of Chisholm
approximants . . . . . . . . . . . . . . 81--83
Anonymous Algorithms supplement . . . . . . . . . 81--92
J. Rokne and
P. Lancaster Algorithm 86: Complex Interval
Arithmetic . . . . . . . . . . . . . . . 83--85
R. Fleck and
J. Bailey Algorithm 87: Minimum of a non-linear
function by the application of the
geometric programming technique . . . . 86--89
I. D. Hill Algorithm 88: An electoral method . . . 89--90
L. R. Neal Correspondence . . . . . . . . . . . . . 93--93
R. K. Stamper Correspondence . . . . . . . . . . . . . 93--93
G. Hill and
H. R. A. Townsend Correspondence . . . . . . . . . . . . . 94--94
Anonymous Erratum . . . . . . . . . . . . . . . . 95--95
A. D. Chambers Audit Test Packs and Computer Audit
Programs . . . . . . . . . . . . . . . . 98--101
Anonymous Dr S. Gill . . . . . . . . . . . . . . . 101--101
W. N. Holmes Identification Number Design . . . . . . 102--107
G. Emery Book Review . . . . . . . . . . . . . . 107--107
J. Stephenson Book Review . . . . . . . . . . . . . . 107--107
K. W. Smillie and
M. J. R. Shave Converting Decision Tables to Computer
Programs . . . . . . . . . . . . . . . . 108--111
A. S. Radford Book Review . . . . . . . . . . . . . . 111--111
A. S. Radford Book Review . . . . . . . . . . . . . . 111--111
A. S. Radford Book Review . . . . . . . . . . . . . . 111--111
A. S. Radford Book Review . . . . . . . . . . . . . . 111--111
R. W. Zmud Two Enhancements to a Flexible Pricing
Control System for Allocating Computer
Resources . . . . . . . . . . . . . . . 112--114
Robert A. Fleck, Jr. Computer Efficiency and Linear
Programming . . . . . . . . . . . . . . 115--116
C. C. M. Parish On the Application of Queueing Theory to
Analysing On-Line Computing Systems . . 117--121
Anonymous New Journals . . . . . . . . . . . . . . 121--121
Anonymous Review: Short notice . . . . . . . . . . 121--121
Anonymous Review: Short notice . . . . . . . . . . 121--121
D. J. Rees The EMAS director . . . . . . . . . . . 122--130
A. C. Day Book Review . . . . . . . . . . . . . . 130--130
I. G. Dewis Book Review . . . . . . . . . . . . . . 130--130
R. J. Ord-Smith Book Review . . . . . . . . . . . . . . 130--130
A. S. Wight The EMAS archiving program . . . . . . . 131--134
C. A. Mercer Book Review . . . . . . . . . . . . . . 134--134
J. J. Florentin and
A. J. Sammes Systems with State Re-Set . . . . . . . 135--139
P. J. H. King Book Review . . . . . . . . . . . . . . 139--139
A. L. Lim and
G. R. Lewis Towards Structured Programs in APL . . . 140--143
P. J. Comerford Link systems for multi-computer control
of a large process: Part 1 . . . . . . . 144--147
J. P. Cleave Book Review . . . . . . . . . . . . . . 147--147
N. Zvegintzov Problems with Analytic Description of
Text Formats . . . . . . . . . . . . . . 148--149
I. M. Khabaza Book Review . . . . . . . . . . . . . . 149--149
R. J. W. Housden On String Concepts and Their
Implementation . . . . . . . . . . . . . 150--156
Anonymous Books received . . . . . . . . . . . . . 156--156
A. Mayne and
E. B. James Information Compression by Factorising
Common Strings . . . . . . . . . . . . . 157--160
W. A. Burkhard Full Table Quadratic Quotient Searching 161--163
F. J. Rohlf A new approach to the computation of the
Jardine-Sibson ${B_k}$ clusters . . . . 164--168
B. Cooper Time-Domain Matrix Evaluation of a
Digital Servomechanism Using Semi-Hybrid
Computational Techniques . . . . . . . . 169--172
Ayse Alaylioglu and
G. A. Evans and
J. Hyslop Automatic Generation of Quadrature
Formulae for Oscillatory Integrals . . . 173--176
T. J. Buckholtz and
C. S. Wetherell Algorithm 89: a program to referee
Kriegspiel and chess . . . . . . . . . . 177--183
Anonymous Algorithms supplement . . . . . . . . . 177--185
W. S. Ford Algorithm 90: Periodic cubic spline
interpolation with equidistant nodes . . 183--184
Anonymous Algorithm supplement --- Statement of
Policy . . . . . . . . . . . . . . . . . 185--185
P. W. F. Coleman Discussion: Integrated training for the
blind programmer . . . . . . . . . . . . 186--187
A. Learner Correspondence . . . . . . . . . . . . . 188--188
S. E. Wallis Correspondence . . . . . . . . . . . . . 188--188
C. A. Thrower and
C. A. W. Wells Correspondence . . . . . . . . . . . . . 188--189
J. A. Templeman Correspondence . . . . . . . . . . . . . 189--189
J. C. Vorvoreanu Correspondence . . . . . . . . . . . . . 189--190
S. N. Baldota Correspondence . . . . . . . . . . . . . 190--190
J. Tomlinson Correspondence . . . . . . . . . . . . . 190--190
J. L. Campbell Correspondence . . . . . . . . . . . . . 190--191
Anonymous Erratum . . . . . . . . . . . . . . . . 191--191
E. J. C. Fowell Correspondence . . . . . . . . . . . . . 191--191
K. J. Allen Insuring Computers . . . . . . . . . . . 194--197
R. M. Burstall Book Review . . . . . . . . . . . . . . 197--197
A. Parkin Bringing Cost into File Design Decisions 198--199
S. J. Waters Analysis of Self-Indexing, Disc Files 200--205
C. D. Easteal Book Review . . . . . . . . . . . . . . 205--205
A. Young Book Review . . . . . . . . . . . . . . 205--205
D. A. Hawley and
J. S. Knowles and
E. E. Tozer Database Consistency and the CODASYL
DBTG Proposals . . . . . . . . . . . . . 206--212
G. E. Millard and
D. J. Rees and
H. Whitfield The standard EMAS subsystem . . . . . . 213--219
P. J. Comerford Link systems for multi-computer control
of a large process: Part 2: Fault
detection . . . . . . . . . . . . . . . 220--222
Anonymous Review: Short notice . . . . . . . . . . 222--222
J. S. Knowles Book Review . . . . . . . . . . . . . . 222--222
M. H. Rogers Book Review . . . . . . . . . . . . . . 222--222
A. Young Book Review . . . . . . . . . . . . . . 222--222
H. D. Baecker Areas and Record-Classes . . . . . . . . 223--226
C. A. Mercer Book Review . . . . . . . . . . . . . . 226--226
W. A. Burkhard Nonrecursive Traversals of Trees . . . . 227--230
E. L. Albasiny Book Review . . . . . . . . . . . . . . 230--230
C. A. Mercer Book Review . . . . . . . . . . . . . . 230--230
G. Hunter A quantitative measure of precision . . 231--233
A. M. Andrew Book Review . . . . . . . . . . . . . . 233--233
D. Ghoshdastidar and
M. K. Roy A study on the evaluation of Shell's
sorting technique . . . . . . . . . . . 234--235
D. M. Boulton and
C. S. Wallace An Information Measure for Single Link
Classification . . . . . . . . . . . . . 236--238
G. C. E. Winn A digital approach to the efficient
synthesis of threshold gates . . . . . . 239--242
M. M. Lehman Book Review . . . . . . . . . . . . . . 242--242
B. S. Walker Book Review . . . . . . . . . . . . . . 242--242
L. F. Turner The `on-ground' compression of satellite
data . . . . . . . . . . . . . . . . . . 243--247
R. H. Bezdek and
A. H. Sameh A note on computational methods for
input-output econometric models . . . . 248--249
D. A. H. Brown Book Review . . . . . . . . . . . . . . 249--249
T. Tabata and
R. Ito Effective Treatment of the Interpolation
Factor in Marquardt's Nonlinear
Least-Squares Fit Algorithm . . . . . . 250--251
T. W. Olle Book Review . . . . . . . . . . . . . . 251--251
E. H. Twizell The numerical solution of second order
hyperbolic partial differential
equations with unequally spaced initial
conditions . . . . . . . . . . . . . . . 252--257
J. A. Grant and
G. D. Hitchins Two Algorithms for the Solution of
Polynomial Equations to Limiting Machine
Precision . . . . . . . . . . . . . . . 258--264
R. H. Kemp Book Review . . . . . . . . . . . . . . 264--264
K. W. Morton Book Review . . . . . . . . . . . . . . 264--264
Gary D. Knott Hashing Functions . . . . . . . . . . . 265--278
H. C. Lauer Discussion on Ph.D. thesis proposals in
computing science . . . . . . . . . . . 279--281
M. A. Sandys Correspondence: On ``Continuity
Conditions for Spline Curves'' . . . . . 282--283
D. F. Arthur Correspondence: Reading variable length
records using FORTRAN IV . . . . . . . . 283--283
K. M. Howell Correspondence: Check digits and error
correction . . . . . . . . . . . . . . . 283--284
B. M. Ewen-Smith Correspondence: Check digits and error
correction . . . . . . . . . . . . . . . 284--284
A. M. Andrew Correspondence: Decimal error-correction
--- a solution . . . . . . . . . . . . . 284--285
D. B. Crombie Correspondence: Comparison of hybrid and
digital computation performances for
distillation simulation . . . . . . . . 285--285
J. P. N. Edwards and
The Editor Correspondence: Saving CPU time in
Scientific computation . . . . . . . . . 285--285
John Bradley Correspondence: On ``An algorithm for
the solution of constrained generalised
polynomial programming problems'' . . . 285--286
John V. Kline Correspondence: On ETAOIN SHRDLU . . . . 286--286
Roy S. Mullins Correspondence: On the origin of the
word `algorithm' . . . . . . . . . . . . 286--286
Anonymous Call for papers . . . . . . . . . . . . 287--287
Anonymous Call for papers: 3rd International
Conference on Automata, Languages and
Programming, Edinburgh University,
Scotland, July 20--23, 1976 . . . . . . 287--287
Anonymous Erratum . . . . . . . . . . . . . . . . 287--287
Anonymous Special notice . . . . . . . . . . . . . 287--287
R. W. Zmud Erratum: ``Two Enhancements to a
Flexible Pricing Control System for
Allocating Computer Resources'' . . . . 287--287
R. A. Osborn and
W. P. Bain and
T. Lloyd and
P. H. Perring SPG --- a Programming System for
Commercial Transaction Processing . . . 290--297
B. V. Howard Book Review . . . . . . . . . . . . . . 297--297
P. J. H. King and
R. G. Johnson The conversion of decision tables to
sequential testing procedures . . . . . 298--306
A. Parkin Programming Objectives: an Analysis . . 307--311
Gill Ringland Software Functional Variability . . . . 312--317
R. A. Earnshaw Is APL a Viable Programming Language? 318--323
M. J. Denham Book Review . . . . . . . . . . . . . . 323--323
S. J. Goldsack Book Review . . . . . . . . . . . . . . 323--323
R. J. Dakin A general control language: language
structure and translation . . . . . . . 324--332
M. H. Williams and
H. L. Ossher A computer model for instructional
purposes . . . . . . . . . . . . . . . . 333--341
M. J. Denham Book Review . . . . . . . . . . . . . . 341--341
A. B. Smith Book Review . . . . . . . . . . . . . . 341--341
Alice Chung-Phillips and
R. W. Rosen A note on dynamic data storage in
Fortran IV . . . . . . . . . . . . . . . 342--343
F. J. B. Goddu The application of precedence operations
to interactive Canadian income tax
calculations . . . . . . . . . . . . . . 344--348
D. T. Goodwin An algorithm for inverting certain
translators of context-free languages 349--354
P. J. Brown Book Review . . . . . . . . . . . . . . 354--354
R. B. Flavell Book Review . . . . . . . . . . . . . . 354--354
P. G. Barker Syntactic definition and parsing of
molecular formulae: Part 1. Initial
syntax definition and parser
implementation . . . . . . . . . . . . . 355--359
N. E. Wiseman Book Review . . . . . . . . . . . . . . 359--359
K. Berkling and
W. Kluge Conceptual Design of a Hardwired Main
Storage Management Unit . . . . . . . . 360--365
I. M. Barron Book Review . . . . . . . . . . . . . . 365--365
J. Leech Book Review . . . . . . . . . . . . . . 365--365
W. F. Lunnon Counting Multidimensional Polyominoes 366--367
K. Vit Rational Interpolation and Extrapolation
for SUMT . . . . . . . . . . . . . . . . 368--370
J. R. Cash The numerical solution of linear stiff
boundary value problems . . . . . . . . 371--372
G. E. Trapp, Jr. and
W. Squire Solving Nonlinear Vandermonde Systems 373--374
S. K. Shrivastava A view of concurrent process
synchronisation . . . . . . . . . . . . 375--379
B. T. Denvir Correspondence . . . . . . . . . . . . . 380--380
A. S. Sethi and
M. S. Krishnamoorthy Correspondence . . . . . . . . . . . . . 380--381
D. T. Muxworthy Correspondence . . . . . . . . . . . . . 381--381
K. J. Young Correspondence . . . . . . . . . . . . . 381--381
Anonymous Reports on degrees in data processing 382--398
Anonymous Editorial: a personal view of the
`Beaumont' weekend . . . . . . . . . . . 2--2
K. D. Eason Understanding the Naive Computer User 3--7
Anonymous New Ans Fortran Standard . . . . . . . . 7--7
P. J. Pengilly An approach to systems design . . . . . 8--12
J. J. Florentin Data Base Representations of Application
Models . . . . . . . . . . . . . . . . . 13--16
G. Schlageter The problem of lock by value in large
data bases . . . . . . . . . . . . . . . 17--20
D. J. Cairns Book Review . . . . . . . . . . . . . . 20--20
S. J. Waters Hit Ratios . . . . . . . . . . . . . . . 21--24
D. C. Cooper Book Review . . . . . . . . . . . . . . 24--24
D. J. Howarth Book Review . . . . . . . . . . . . . . 24--24
R. B. E. Napper and
R. N. Fisher ALEC --- a User Extensible Scientific
Programming Language . . . . . . . . . . 25--31
L. V. Atkinson List Processing Language, SLPL --- an
Informal Outline . . . . . . . . . . . . 32--39
I. M. Khabaza Book Review . . . . . . . . . . . . . . 39--39
R. L. Hittos and
D. S. Henderson Optimisation of Main Memory Size Versus
Speed . . . . . . . . . . . . . . . . . 40--42
L. Fox Book Review: \booktitleThe Chebyshev
Polynomials, Theodore J. Rivlin, 1974;
186 pages (John Wiley) . . . . . . . . . 42--42
H. J. Curnow and
B. A. Wichmann A synthetic benchmark . . . . . . . . . 43--49
F. G. Heath Book Review . . . . . . . . . . . . . . 49--49
R. E. Walters Benchmark techniques: a constructive
approach . . . . . . . . . . . . . . . . 50--55
P. J. Taylor Book Review . . . . . . . . . . . . . . 55--55
S. K. Robinson and
I. S. Torsun An empirical analysis of Fortran
programs . . . . . . . . . . . . . . . . 56--62
A. C. Norman Expanding the Solutions of Implicit Sets
of Ordinary Differential Equations in
Power Series . . . . . . . . . . . . . . 63--68
W. H. Southwell Fitting Data to Nonlinear Functions with
Uncertainties in All Measurement
Variables . . . . . . . . . . . . . . . 69--73
Karl-Heinz Mohn and
Roger V. Roman An interactive polynomial approximation
algorithm . . . . . . . . . . . . . . . 74--78
Anonymous Second International Conference on very
large data bases . . . . . . . . . . . . 78--78
W. E. McBride and
A. K. Rigler A modification of the Osborne and Watson
algorithm for nonlinear minimax
approximation . . . . . . . . . . . . . 79--81
M. R. Williams The Difference Engines . . . . . . . . . 82--89
Donald Perlis An application of compiler simulation at
the source language level . . . . . . . 90--90
T. S. Ng and
A. Cantoni Run Time Interaction with Fortran Using
Mixed Code . . . . . . . . . . . . . . . 91--92
W. B. Samson Testing Overflow Algorithms for a Table
of Variable Size . . . . . . . . . . . . 92--92
D. W. Barron Correspondence . . . . . . . . . . . . . 93--93
B. P. Phillips Correspondence . . . . . . . . . . . . . 93--93
M. A. Sabin Correspondence . . . . . . . . . . . . . 93--94
P. G. Barker Correspondence . . . . . . . . . . . . . 94--94
A. Parkin Correspondence . . . . . . . . . . . . . 94--95
Anonymous Algorithms supplement . . . . . . . . . 95--95
A. D. Crossley Correspondence . . . . . . . . . . . . . 95--95
B. Joffe Correspondence . . . . . . . . . . . . . 95--95
J. M. Kerridge PATCOSY --- a Database System for the
National Health Service . . . . . . . . 98--103
E. C. Coles and
L. J. Beilin and
C. J. Bulpitt and
C. T. Dollery and
B. F. Johnson and
A. D. Munro-Faure and
S. C. Turner An Approach to Computer Processing of
Clinical Data . . . . . . . . . . . . . 104--109
E. S. Page Distribution sampling for computer
simulation . . . . . . . . . . . . . . . 109--109
R. A. Davenport Database Integrity . . . . . . . . . . . 110--116
J. M. Hammersley Combinatorial Programming: Methods and
Applications . . . . . . . . . . . . . . 116--116
P. A. Dearnley An Investigation into Database
Resilience . . . . . . . . . . . . . . . 117--121
B. S. Walker Microcomputers: Fundamentals and
Applications; Minicomputer Evaluation
and Selection; Minicomputers: in
Industrial Process Control . . . . . . . 121--121
S. J. Waters CAM 01: a Precedence Analyser . . . . . 122--126
Y. L. Varol Some Remarks on Computer Acquisition . . 127--131
O. Marjasoo A methodology for hardware and software
availability analysis . . . . . . . . . 132--135
H. C. Lucas, Jr. and
R. B. Kaplan A Structured Programming Experiment . . 136--138
G. R. Frank Job Control in the MU5 Operating System 139--143
J. Hilden Guidelines for the Design of Interactive
Systems . . . . . . . . . . . . . . . . 144--150
D. C. Cooper The Design of an Optimizing Compiler . . 150a-150
S. R. Wilbur Lang-Pak --- An Interactive Language
Design System . . . . . . . . . . . . . 150--150
Frank G. Pagan On Interpreter-Oriented Definitions of
Programming Languages . . . . . . . . . 151--155
J. D. Lambert Computer Solution of Ordinary
Differential Equations . . . . . . . . . 155--155
J. S. Rohl Programming Improvements to Fike's
Algorithm for Generating Permutations 156--159
A. J. T. Colin The Principles of Systems Programming 159--159
L. V. Atkinson and
G. J. Duffus Machine Code Generation Within a
Compiler --- a Teaching Model . . . . . 160--165
B. Richards Methoden der Informatik in der Medizin 165--165
C. J. Higley Type Checking in a Typeless Language . . 166--169
A. G. Middleton On the Use of Macros for Iteration . . . 170--172
E. B. Dorling Environmental Data Handling . . . . . . 172b-172
C. A. R. Hoare Computer Science and Technology and
their application . . . . . . . . . . . 172--172
C. M. Reeves Book Review: \booktitleComputer Science:
Programming in FORTRAN with WATFOR
WATFIV . . . . . . . . . . . . . . . . . 172a-172
A. T. Fuller The Period of Pseudo-Random Numbers
Generated by Lehmer's Congruential
Method . . . . . . . . . . . . . . . . . 173--177
D. H. McLain Two Dimensional Interpolation from
Random Data . . . . . . . . . . . . . . 178--181
Anonymous Advanced Study Institute on Man-Computer
Interaction . . . . . . . . . . . . . . 181--181
Anonymous Advanced Summer Institute on Computer
Architecture . . . . . . . . . . . . . . 181a-181
John Mitchem On Various Algorithms for Estimating the
Chromatic Number of a Graph . . . . . . 182--183
D. J. Evans and
M. Hatzopoulos The solution of certain banded systems
of linear equations using the folding
algorithm . . . . . . . . . . . . . . . 184--187
J. Inglis Structured Programming and Input
Statements . . . . . . . . . . . . . . . 188--189
D. L. Fisher Blind programmers --- their manager's
experience . . . . . . . . . . . . . . . 189--192
B. F. M. Adamczewski A formula for establishing re-order
quantities for individual items within a
joint stock replenishment scheme . . . . 194--197
T. Alewine and
R. A. Fleck, Jr. Service bureau or in-house data
processing . . . . . . . . . . . . . . . 198--201
B. S. Walker Book Review . . . . . . . . . . . . . . 201--201
D. Bell Programmer Selection and Programming
Errors . . . . . . . . . . . . . . . . . 202--206
G. Emery Book Review . . . . . . . . . . . . . . 206--206
J. F. Wellicome Book Review . . . . . . . . . . . . . . 206--206
E. B. James and
D. P. Partridge Tolerance to Inaccuracy in Computer
Programs . . . . . . . . . . . . . . . . 207--212
D. T. Muxworthy Book Review . . . . . . . . . . . . . . 212--212
A. Rogers Book Review . . . . . . . . . . . . . . 212--212
R. C. Varney Toward the Understandability of an
Operating System . . . . . . . . . . . . 213--215
D. L. Dance and
U. W. Pooch An adaptive on line data compression
system . . . . . . . . . . . . . . . . . 216--224
B. Higman The place of own variables in
programming language theory . . . . . . 225--228
D. Q. Mayne Book Review . . . . . . . . . . . . . . 228--228
A. S. Radford Book Review . . . . . . . . . . . . . . 228--228
D. S. Henderson and
M. R. Levy An extended operator precedence parsing
algorithm . . . . . . . . . . . . . . . 229--233
F. G. Heath Book Review . . . . . . . . . . . . . . 233--233
A. B. Smith Book Review . . . . . . . . . . . . . . 233--233
J. M. Brady A programming approach to some concepts
and results in the theory of computation 234--237
R. Devillers and
G. Louchard Improvement of parallelism in a finite
buffer sharing policy . . . . . . . . . 238--245
D. J. Howarth Book Review . . . . . . . . . . . . . . 245--245
M. J. D. Powell Book Review . . . . . . . . . . . . . . 245--245
D. C. Sutcliffe An Algorithm for Drawing the Curve
${F(X,Y)} = 0$ . . . . . . . . . . . . . 246--249
R. P. Lorétan Timing Problems in Electronic Lockout
Chains . . . . . . . . . . . . . . . . . 250--253
M. M. Lehman Book Review . . . . . . . . . . . . . . 253--253
P. M. Woodward Book Review . . . . . . . . . . . . . . 253--253
M. R. Patel and
K. H. Bennett Analysis of Speed of a Binary Multiplier
Using a Variable Number of Shifts Per
Cycle . . . . . . . . . . . . . . . . . 254--257
A. Alaylioglu and
G. A. Evans and
J. Hyslop The use of Chebyshev series for the
evaluation of oscillatory integrals . . 258--267
B. W. Conolly Book Review . . . . . . . . . . . . . . 267--267
A. C. Day and
P. A. Clarke and
D. Hill and
J. K. Reid Discussion and correspondence: the
proposed new standard for Fortran: a
critical examination . . . . . . . . . . 268--271
M. T. Pezarro A note on estimating hit ratios for
direct-access storage devices . . . . . 271--272
R. T. C. Lim and
J. D. Blackburn On program verification in numerical
methods . . . . . . . . . . . . . . . . 272--273
R. Taylor Fast input/output of variable-length
arrays in FORTRAN IV . . . . . . . . . . 273--273
D. J. Hatter On processing sparse matrices . . . . . 273--274
R. D. Henshell and
H. C. Lauer Ph.D. work in Computer Science and
Professional Standards . . . . . . . . . 274--275
M. Boari and
G. Neri A note on deadlock in the `readers and
writers' problem . . . . . . . . . . . . 275--275
R. M. De Morgan and
I. D. Hill and
B. A. Wichmann A supplement to the Algol 60 Revised
Report . . . . . . . . . . . . . . . . . 276--288
D. L. A. Barber Book Review . . . . . . . . . . . . . . 288--288
B. L. Clarkson Book Review . . . . . . . . . . . . . . 288--288
F. F. Land Evaluation of systems goals in
determining a design strategy for a
computer based information system . . . 290--294
J. M. Triance The significance of the 1974 COBOL
standard . . . . . . . . . . . . . . . . 295--300
V. Siskind and
J. Rosenhead Seek Times for Disc File Processing:
Some Results from Probability Theory . . 301--305
S. Vajda Book Review . . . . . . . . . . . . . . 305--305
S. Vajda Book Review . . . . . . . . . . . . . . 305--305
R. G. Casey and
I. M. Osman Replacement Algorithms for Storage
Management in Relational Data Bases . . 306--314
D. Lewin Book Review . . . . . . . . . . . . . . 314--314
B. S. Walker Book Review . . . . . . . . . . . . . . 314--314
I. R. Williams Book Review . . . . . . . . . . . . . . 314--314
I. R. Williams Book Review . . . . . . . . . . . . . . 314--314
J. Ferrie and
C. Kaiser and
D. Lanciaux and
B. Martin An extensible structure for protected
systems' design . . . . . . . . . . . . 315--321
E. L. Albasiny Book Review . . . . . . . . . . . . . . 321--321
B. Girling Book Review . . . . . . . . . . . . . . 321--321
A. Walker and
D. Wood Locally Balanced Binary Trees . . . . . 322--325
F. H. Sumner Book Review . . . . . . . . . . . . . . 325--325
C. Bays Non-Recursive Technique for Recreating a
Digraph from its ${K}$-Formula
Representation . . . . . . . . . . . . . 326--328
T. Sakaki and
K. Nakashima and
Y. Hattori Algorithms for Finding in the Lump Both
Bounds of the Chromatic Number of a
Graph . . . . . . . . . . . . . . . . . 329--332
D. A. H. Brown Book Review . . . . . . . . . . . . . . 332--332
P. B. Morice Book Review . . . . . . . . . . . . . . 332--332
C. M. Reeves Book Review . . . . . . . . . . . . . . 332--332
D. C. Sutcliffe A Remark on a Contouring Algorithm . . . 333--335
M. A. Sabin A method for displaying the intersection
curve of two quadric surfaces . . . . . 336--338
R. J. Aust An improvement algorithm for school
timetabling . . . . . . . . . . . . . . 339--343
I. M. Willers The syntax directed graph algorithm for
the input of equations to the Taylor
series system for solving ordinary
differential equations . . . . . . . . . 344--347
P. J. Hartley Tensor Product Approximations to Data
Defined on Rectangular Meshes in
${N}$-Space . . . . . . . . . . . . . . 348--352
Anonymous Erratum . . . . . . . . . . . . . . . . 352--352
P. A. Clarke Book Review . . . . . . . . . . . . . . 352--352
P. A. Clarke Book Review . . . . . . . . . . . . . . 352--352
M. Shacham and
E. Kehat A direct method for the solution of
large sparse systems of linear equations 353--359
A. C. Day Algorithm 91: Balancing a binary tree 360--361
Anonymous Algorithms supplement . . . . . . . . . 360--363
G. Berry Algorithm 92: The Drawing of Dashed
Lines . . . . . . . . . . . . . . . . . 361--363
Anonymous Algorithms supplement-Statement of
Policy . . . . . . . . . . . . . . . . . 363--363
J. W. Backus and
F. L. Bauer and
J. Green and
C. Katz and
J. McCarthy and
P. Naur and
A. J. Perlis and
H. Rutishauser and
K. Samelson and
B. Vauquois and
J. H. Wegstein and
A. van Wijngaarden and
M. Woodger and
R. M. De Morgan and
I. D. Hill and
B. A. Wichmann Modified Report on the Algorithmic
Language ALGOL-60 . . . . . . . . . . . 364--379
Anonymous Errata . . . . . . . . . . . . . . . . . 379--379
J. T. Hastings Correspondence . . . . . . . . . . . . . 380--380
G. N. Lance Correspondence . . . . . . . . . . . . . 380--381
J. K. Buckle Correspondence . . . . . . . . . . . . . 381--381
J. K. Croston Correspondence . . . . . . . . . . . . . 381--381
C. C. Wilton-Davies Correspondence . . . . . . . . . . . . . 381--381
S. P. Castell Correspondence . . . . . . . . . . . . . 382--382
R. L. Wexelblat Correspondence . . . . . . . . . . . . . 382--383
K. Brokate Correspondence . . . . . . . . . . . . . 383--383
I. R. Ellis Correspondence . . . . . . . . . . . . . 383--383
D. S. Grimsditch Correspondence . . . . . . . . . . . . . 383--384
Anonymous Errata . . . . . . . . . . . . . . . . . 384--384
Anonymous Sigmod-77 --- International Workshop on
Management of Data . . . . . . . . . . . 384--384
S. J. Waters CAM02: a structured precedence analyser 2--5
B. M. Leavenworth Non-Procedural Data Processing . . . . . 6--9
B. J. Edwards Choice of Block Sizes for Magnetic Tape
Files . . . . . . . . . . . . . . . . . 10--14
G. Davies Book Review . . . . . . . . . . . . . . 14--14
S. J. Goldsack Book Review . . . . . . . . . . . . . . 14--14
Alfonso F. Cardenas and
James P. Sagamang Doubly-Chained Tree Data Base
Organisation --- Analysis and Design
Strategies . . . . . . . . . . . . . . . 15--26
J. S. Knowles Book Review . . . . . . . . . . . . . . 26--26
K. Forbes and
A. W. Goldsworthy Prescheduling Algorithm --- Scheduling a
Suitable Mix Prior to Processing . . . . 27--29
D. Nudds The design of the MAX macroprocessor . . 30--36
Anonymous Book Review . . . . . . . . . . . . . . 36--36
R. Edwards Book Review . . . . . . . . . . . . . . 36--36
C. Piney A generalised interactive system for the
acquisition of structured data . . . . . 37--44
Anonymous Short notice . . . . . . . . . . . . . . 44--44
S. J. Goldsack Book Review . . . . . . . . . . . . . . 44--44
S. J. Goldsack Book Review . . . . . . . . . . . . . . 44--44
A. Young Book Review . . . . . . . . . . . . . . 44--44
M. H. Williams Generating Structured Flow Diagrams: the
Nature of Unstructuredness . . . . . . . 45--50
B. G. T. Lowden and
I. R. MacCallum Some Consequences of Deferred Binding in
COBOL . . . . . . . . . . . . . . . . . 51--55
A. Cunningham Book Review . . . . . . . . . . . . . . 55--55
V. E. Price Book Review . . . . . . . . . . . . . . 55--55
A. Young Book Review . . . . . . . . . . . . . . 55--55
D. T. Goodwin Conditions for Underflow and Overflow of
an Arithmetic Stack . . . . . . . . . . 56--62
D. Wood Two Variations on ${N}$-Parallel Finite
State Generators . . . . . . . . . . . . 63--67
I. Aleksander Book Review . . . . . . . . . . . . . . 67--67
D. W. Barron Book Review . . . . . . . . . . . . . . 67--67
B. W. Conolly Book Review . . . . . . . . . . . . . . 67--67
M. J. B. Duff and
D. M. Watson The cellular logic array image processor 68--72
R. C. Backhouse Book Review . . . . . . . . . . . . . . 72--72
A. Tosser and
D. Dubus Algebraic Optimisation of NAND-NOR
Switching Circuits . . . . . . . . . . . 73--77
A. J. T. Colin Book Review . . . . . . . . . . . . . . 77--77
N. Riley Book Review . . . . . . . . . . . . . . 77--77
A. Young Book Review . . . . . . . . . . . . . . 77--77
A. M. Macnaghten and
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
Anonymous Algorithms supplement . . . . . . . . . 86--91
E. Zakrajsek Algorithm 93: Generalised eigenvalue
problem . . . . . . . . . . . . . . . . 86--91
B. G. T. Lowden A note on the oscillating sort . . . . . 92--92
B. G. T. Lowden Discussion and correspondence: a note on
the oscillating sort . . . . . . . . . . 92--96
Anonymous Erratum . . . . . . . . . . . . . . . . 96--96
A. Parkin The probable outcomes of a data
processing project . . . . . . . . . . . 98--101
J. P. Cleave Book Review . . . . . . . . . . . . . . 101--101
R. E. Pacifico Book Review . . . . . . . . . . . . . . 101--101
R. K. Stamper The LEGOL 1 Prototype System and
Language . . . . . . . . . . . . . . . . 102--108
R. H. Pierce and
J. Rowell A transformation-directed compiling
system . . . . . . . . . . . . . . . . . 109--115
K. J. McDonell An inverted index implementation . . . . 116--123
A. M. Andrew Book Review . . . . . . . . . . . . . . 123--123
A. M. Andrew Book Review . . . . . . . . . . . . . . 123--123
D. T. Muxworthy Book Review . . . . . . . . . . . . . . 123--123
H. R. A. Townsend SST --- a program for the automatic
generation of symbol state tables . . . 124--127
P. Kammerer Excluding Regions . . . . . . . . . . . 128--131
Anonymous Apology . . . . . . . . . . . . . . . . 131--131
E. M. L. Beale Book Review . . . . . . . . . . . . . . 131--131
D. T. Muxworthy Book Review . . . . . . . . . . . . . . 131--131
Y. Wallach Scheduling algorithms for concurrent
execution . . . . . . . . . . . . . . . 132--136
W. P. de Roever Book Review . . . . . . . . . . . . . . 136--136
F. G. Heath Book Review . . . . . . . . . . . . . . 136--136
E. G. Mallach Scatter Storage Techniques: a Uniform
Viewpoint and a Method for Reducing
Retrieval Times . . . . . . . . . . . . 137--140
I. M. Barron Book Review . . . . . . . . . . . . . . 140--140
R. Flavell Book Review . . . . . . . . . . . . . . 140--140
J. R. Ullmann A binary $n$-gram technique for
automatic correction of substitution,
deletion, insertion and reversal errors
in words . . . . . . . . . . . . . . . . 141--147
D. de Champeaux and
L. Sint An optimality theorem for a
bi-directional heuristic search
algorithm . . . . . . . . . . . . . . . 148--150
Anonymous Book Review . . . . . . . . . . . . . . 150--150
J. C. Cluley Book Review . . . . . . . . . . . . . . 150--150
Jerald Sydney Schwarz Generic Commands --- A Tool for Partial
Correctness Formalisms . . . . . . . . . 151--155
W. S. Ford and
V. C. Hamacher Low level architecture features for
supporting process communication . . . . 156--162
A. Kaletzky and
D. W. Lewin Problem orientated language for logic
design . . . . . . . . . . . . . . . . . 163--169
A. Chantler Book Review . . . . . . . . . . . . . . 169--169
A. Chantler Book Review . . . . . . . . . . . . . . 169--169
R. I. Kitney Book Review . . . . . . . . . . . . . . 169--169
R. I. Kitney Book Review . . . . . . . . . . . . . . 169--169
J. N. Lyness and
J. J. Kaganove A technique for comparing automatic
quadrature routines . . . . . . . . . . 170--177
Anonymous European Federation for Medical
Informatics --- Cambridge Congress Call
for Papers . . . . . . . . . . . . . . . 177--177
Anonymous A historic computer film . . . . . . . . 177--177
Y. L. Varol On the generation of the
pseudo-remainder in polynomial division 178--180
B. Higman Book Review . . . . . . . . . . . . . . 180--180
C. A. R. Hoare Book Review . . . . . . . . . . . . . . 180--180
D. 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
N. Teskey Discussion and correspondence: KATE: a
macro-processor for extending command
languages . . . . . . . . . . . . . . . 187--189
P. Stecher Proposal for an Interface System Between
the Business and Data Processing Systems 194--201
A. Shaw Book Review . . . . . . . . . . . . . . 201--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
A. J. T. Colin Book Review . . . . . . . . . . . . . . 212--212
P. Crocker Book Review . . . . . . . . . . . . . . 212--212
Deane B. Blazie and
L. S. Levy A cross compiler for pocket calculators 213--221
W. D. Haseman and
A. B. Whinston Automatic Application Program Interface
to a Data Base . . . . . . . . . . . . . 222--226
P. A. Losty Book Review . . . . . . . . . . . . . . 226--226
P. A. Losty Book Review . . . . . . . . . . . . . . 226--226
R. N. Ibbett and
M. A. Husband The MU5 name store . . . . . . . . . . . 227--231
B. G. Edwards Book Review . . . . . . . . . . . . . . 231--231
G. J. Janacek Book Review . . . . . . . . . . . . . . 231--231
H. R. A. Townsend Book Review . . . . . . . . . . . . . . 231--231
R. G. Hamlet Testing Programs with Finite Sets of
Data . . . . . . . . . . . . . . . . . . 232--237
A. 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
J. C. Shepherdson Review . . . . . . . . . . . . . . . . . 244--244
O. Nevalainen and
M. Vesterinen Determining Blocking Factors for
Sequential Files by Heuristic Methods 245--247
P. Scheuermann Modelling the Information Space in
Physical Storage At Different Levels of
Detail . . . . . . . . . . . . . . . . . 248--256
R. B. Hunter Book Review . . . . . . . . . . . . . . 256--256
I. M. Khabaza Book Review . . . . . . . . . . . . . . 256--256
G. Mitra Book Review . . . . . . . . . . . . . . 256--256
M. Wells Book Review . . . . . . . . . . . . . . 256--256
P. W. Williams and
M. T. Khallaghi Document Retrieval Using a Substring
Index . . . . . . . . . . . . . . . . . 257--262
M. A. Jackson Book Review . . . . . . . . . . . . . . 262--262
A. D. McGettrick Teaching mathematics by computer . . . . 263--268
I. Aleksander Review . . . . . . . . . . . . . . . . . 268--268
B. Barber Review . . . . . . . . . . . . . . . . . 268--268
B. E. Carpenter and
R. W. Doran The other Turing machine . . . . . . . . 269--279
Anonymous Algorithms Supplement . . . . . . . . . 280--280
A. C. Day Algorithm 95: Generating a parity
testing table . . . . . . . . . . . . . 280--280
I. D. Hill Algorithm 94: Handling dates on small
computers . . . . . . . . . . . . . . . 280--280
Anonymous Algorithms supplement-Statement of
Policy . . . . . . . . . . . . . . . . . 280--281
P. J. Hayes Discussion and correspondence: a note on
the Towers of Hanoi problem . . . . . . 282--285
D. H. R. Huxtable and
J. M. M. Pinkerton The hardware/software interface of the
ICL 2900 range of computers . . . . . . 290--295
R. W. Billett Book Review . . . . . . . . . . . . . . 295--295
B. Conolly Book Review . . . . . . . . . . . . . . 295--295
P. J. Pengilly An approach to systems design. II. The
popularisation of PROPLAN . . . . . . . 296--297
T. C. Ting and
Y. W. Wang Multiway Replacement Selection Sort with
Dynamic Reservoir . . . . . . . . . . . 298--301
J. C. Cluley Book Review . . . . . . . . . . . . . . 301--301
J. Inglis Book Review . . . . . . . . . . . . . . 301--301
J. Inglis Book Review . . . . . . . . . . . . . . 301--301
J. G. Kollias and
P. M. Stocker and
P. A. Dearnley Improving the Performance of an
Intelligent Data Management System . . . 302--307
P. J. Clapson Toward a Performance Science: a
Comparative Analysis of Computing
Systems . . . . . . . . . . . . . . . . 308--315
S. Mamrak and
J. M. Randal An analysis of a software engineering
failure . . . . . . . . . . . . . . . . 316--320
B. M. Nicklas and
G. Schlageter Index structuring in inverted data bases
by TRIES . . . . . . . . . . . . . . . . 321--324
R. A. Reynolds Character String Handling in Fortran . . 325--329
Anonymous Errata . . . . . . . . . . . . . . . . . 329--329
M. P. Coates Book Review . . . . . . . . . . . . . . 329--329
J. A. Shackleton Book Review . . . . . . . . . . . . . . 329--329
K. A. Steele CPM Network Analysis with a Storage Tube
Terminal . . . . . . . . . . . . . . . . 330--334
P. J. Willis A Real Time Hidden Surface Technique . . 335--339
L. S. Levy and
R. Melville The algebraic anatomy of programs . . . 340--345
M. Clowes Book Review . . . . . . . . . . . . . . 345--345
B. Higman Book Review . . . . . . . . . . . . . . 345--345
A. D. Woodall Generation of permutation sequences . . 346--349
M. J. R. Healy Book Review . . . . . . . . . . . . . . 349--349
R. Holstein Book Review . . . . . . . . . . . . . . 349--349
M. M. Lehman Book Review . . . . . . . . . . . . . . 349--349
S. Soule A note on the nonrecursive traversal of
binary trees . . . . . . . . . . . . . . 350--352
J. M. Brady Hints on proofs by recursion induction 353--355
J. M. Wilson Boolean simplification and integer
inequalities . . . . . . . . . . . . . . 356--358
B. C. Brookes Book Review . . . . . . . . . . . . . . 358--358
J. E. Parkin Book Review . . . . . . . . . . . . . . 358--358
G. Wyvill Book Review . . . . . . . . . . . . . . 358--358
R. Mojena Hierarchical grouping methods and
stopping rules: An evaluation . . . . . 359--363
C. A. B. Smith Book Review . . . . . . . . . . . . . . 363--363
R. K. Stamper Book Review . . . . . . . . . . . . . . 363--363
D. Defays An efficient algorithm for a complete
link method . . . . . . . . . . . . . . 364--366
W. L. Price A controlled random search procedure for
global optimisation . . . . . . . . . . 367--370
L. M. Delves Algorithm 96: a linear equation solver
for Galerkin and least squares methods 371--374
Anonymous Algorithms Supplement . . . . . . . . . 371--379
L. M. Delves and
L. F. Abd. El Al Algorithm 97: The fast Galerkin
algorithm for the solution of linear
Fredholm equations . . . . . . . . . . . 374--376
W. D. Hoskins and
G. E. McMaster Algorithm 98: a note on the solution of
certain tridiagonal systems of linear
equations . . . . . . . . . . . . . . . 376--378
D. J. Evans and
S. A. Smith Algorithm 99: On the construction of
balanced binary trees for parallel
processing . . . . . . . . . . . . . . . 378--379
M. R. Williams Correspondence . . . . . . . . . . . . . 380--380
W. A. Zaremba Correspondence . . . . . . . . . . . . . 380--381
A. Parkin Correspondence . . . . . . . . . . . . . 381--381
J. Kramer Correspondence . . . . . . . . . . . . . 382--383
N. E. Wiseman and
C. I. C. Campbell and
J. Harradine On Making Graphic Arts Quality Output by
Computer . . . . . . . . . . . . . . . . 2--6
W. Owen Nutt Book Review . . . . . . . . . . . . . . 6--6
R. A. Davenport Distributed or Centralised Data Base . . 7--14
J. L. Armstrong Book Review . . . . . . . . . . . . . . 14--14
M. A. Bramer Book Review . . . . . . . . . . . . . . 14--14
A. Young Book Review . . . . . . . . . . . . . . 14--14
P. Dearnley Monitoring Database System Performance 15--19
J. J. Donovan A note on a 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
J. P. Fitch and
A. C. Norman A Note on Compacting Garbage Collection 31--34
A. Sloman Book Review . . . . . . . . . . . . . . 34--34
B. Wood Book Review . . . . . . . . . . . . . . 34--34
W. R. Campbell A compiler definition facility based on
the syntactic macro . . . . . . . . . . 35--41
J. G. Wolff Recoding of Natural Language for Economy
of Transmission or Storage . . . . . . . 42--44
K. W. Morton Review: Recoding of natural language for
economy of transmission or storage . . . 44--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
N. E. Wiseman Book Review . . . . . . . . . . . . . . 62--62
P. W. Williams The relationship between entropy and
file search times . . . . . . . . . . . 63--65
J. L. Szwarcfiter and
L. B. Wilson Some properties of ternary trees . . . . 66--72
P. R. Freeman Book Review . . . . . . . . . . . . . . 72--72
C. R. Edwards Some Improved Designs for the Digital
Summation Threshold Logic (DSTL) Gate 73--78
D. Bumstead Book Review . . . . . . . . . . . . . . 78--78
J. M. Eves and
S. L. Hurst Improvements in Multioutput
Threshold-Logic Gates . . . . . . . . . 79--85
C. Day Book Review . . . . . . . . . . . . . . 85--85
S. J. Goldsack Book Review . . . . . . . . . . . . . . 85--85
J. F. Barlow An algorithm for the solution of the
postman's problem . . . . . . . . . . . 86--89
G. Norris Discussion and correspondence 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
Anonymous Advances in computer chess . . . . . . . 94--94
William L. Honig and
C. Robert Carlson Toward an Understanding of (Actual) Data
Structures . . . . . . . . . . . . . . . 98--104
N. Ahituv and
I. Borovits Analysis of the Purchase Option of
Computers . . . . . . . . . . . . . . . 105--109
R. H. Bonczek and
C. W. Holsapple and
A. B. Whinston Information Transferral Within a
Distributed Data Base via a Generalised
Mapping Language . . . . . . . . . . . . 110--116
J. A. Emerson Book Review: \booktitleAdvanced ANS
COBOL with structured programming and
High Level COBOL Programming . . . . . . 116--116
R. V. Evans and
G. S. Lockington and
T. N. Reid A compiler compiler and methodology for
problem oriented language compiler
implementors . . . . . . . . . . . . . . 117--121
R. E. Small Computational probability and simulation
and Mathematical Modelling and Digital
Simulation for Engineers and Scientists 121--121
A. Parkin and
R. B. Coats EDSIM-Event based Discrete Simulation
using General Purpose Languages such as
Fortran . . . . . . . . . . . . . . . . 122--127
W. N. Holmes Is APL a programming language? . . . . . 128--131
J. G. Kollias An estimate of seek time for batched
searching of random or index sequential
structured files . . . . . . . . . . . . 132--133
F. H. Sumner Computer Architecture, second edition 133--133
D. R. Hanson Filters in SL5 . . . . . . . . . . . . . 134--143
E. Gildersleeves Online Review, Vol. 1 No. 1 . . . . . . 143a-143
B. A. Sufrin Compiler Construction . . . . . . . . . 143--143
Gregor V. Bochmann and
P. Ward Compiler Writing System for Attribute
Grammars . . . . . . . . . . . . . . . . 144--148
D. D. Black Multi-Coordinate Data Presentation . . . 148a-148
I. R. Williams Computational Analysis with the HP-25
Pocket Calculator . . . . . . . . . . . 148--148
I. Bratko and
D. Kopec and
D. Michie Pattern-Based Representation of Chess
End-Game Knowledge . . . . . . . . . . . 149--153
G. M. Bull and
S. Gilbey and
Kathleen Levine and
A. G. Lippiatt and
C. H. C. Machin Proteus --- a Microcoded Multiprocessor
System . . . . . . . . . . . . . . . . . 154--160
D. R. A. Coan Current trends in programming
methodology and Standardised development
of computer software . . . . . . . . . . 160--160
M. H. Williams and
H. L. Ossher Conversion of Unstructured Flow Diagrams
to Structured Form . . . . . . . . . . . 161--167
J. Lewins Simulation of Systems . . . . . . . . . 167--167
P. J. Green and
R. Sibson Computing Dirichlet Tessellations in the
Plane . . . . . . . . . . . . . . . . . 168--173
D. A. Smith and
Pamela S. Guipre Modifications to the Forsythe--Moler
Algorithm for Solving Linear Algebraic
Systems . . . . . . . . . . . . . . . . 174--177
P. M. Haine Analysis and Design of Sequential
Digital Systems . . . . . . . . . . . . 177a-177
D. J. Wheeler Rational Fault Analysis . . . . . . . . 177--177
D. H. McLain Algorithm 100: Vector Approximation to
Curves . . . . . . . . . . . . . . . . . 178--180
Anonymous Algorithms Supplement . . . . . . . . . 178--183
L. Hazlewood Algorithm 101: An algorithm for cautious
adaptive quadrature . . . . . . . . . . 180--183
P. T. Barry Discussion and Correspondence: the
Regional Computing Organisation Network 184--187
A. Parkin Critique on Multi-Criteria Assessment
Applied to Alternative Data Processing
Systems . . . . . . . . . . . . . . . . 188--190
R. Haentjens and
E. Van de Vel Lexical Analysis and the Transportation
of Programs . . . . . . . . . . . . . . 190--190
B. Dwyer and
J. Inglis Correspondence: On ``Structured
programming and input statements'' . . . 190--191
P. Wodon Correspondence: On ``A note on the
Towers of Hanoi problem'' . . . . . . . 191--191
A. D. Chambers Computer fraud and abuse . . . . . . . . 194--198
R. C. Backhouse Book Review . . . . . . . . . . . . . . 198--198
M. J. B. Duff Book Review . . . . . . . . . . . . . . 198--198
S. Lavington Book Review . . . . . . . . . . . . . . 198--198
I. Borovits and
S. Neumann Internal Pricing for Computer Services 199--204
Anonymous Call for papers . . . . . . . . . . . . 204--204
Eric Foxley A hybrid computer performance modelling
system . . . . . . . . . . . . . . . . . 205--209
R. M. Paine Book Review . . . . . . . . . . . . . . 209--209
N. Riley Book Review . . . . . . . . . . . . . . 209--209
W. B. Samson and
R. H. Davis Search Times Using Hash Tables for
Records with Non-Unique Keys . . . . . . 210--214
P. Wallis Book Review . . . . . . . . . . . . . . 214--214
B. A. Wichmann Book Review . . . . . . . . . . . . . . 214--214
J. L. Armstrong Programming a Parallel Computer for
Robot Vision . . . . . . . . . . . . . . 215--218
J. R. Gurd Book Review . . . . . . . . . . . . . . 218--218
I. M. Khabaza Book Review . . . . . . . . . . . . . . 218--218
W. L. Price Simulation Studies of Data Communication
Networks Operating in Datagram Mode . . 219--223
I. Aleksander Book Review . . . . . . . . . . . . . . 223--223
A. M. Cruise Book Review . . . . . . . . . . . . . . 223--223
P. G. Barker and
P. S. Jones Syntactic definition and parsing of
molecular formulae. Part 2: Graphical
synthesis of molecular formulae for data
base queries . . . . . . . . . . . . . . 224--233
D. W. Barron Book Review . . . . . . . . . . . . . . 233--233
R. W. Hiorns Book Review . . . . . . . . . . . . . . 233--233
C. Potter Book Review . . . . . . . . . . . . . . 233--233
M. H. Williams Static Semantic Features of Algol60 and
Basic . . . . . . . . . . . . . . . . . 234--242
F. H. George Book Review . . . . . . . . . . . . . . 242--242
P. J. Moylan Book Review . . . . . . . . . . . . . . 242--242
R. Sibson Locally equiangular triangulations . . . 243--245
R. W. Hiorns Book Review . . . . . . . . . . . . . . 245--245
M. V. Wilkes Book Review . . . . . . . . . . . . . . 245--245
M. R. Patel and
K. H. Bennett 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 and
L. Mottlová Description of a program for solving
problems of nonlinear programming . . . 263--269
B. Richards Book Review . . . . . . . . . . . . . . 269--269
D. J. McConalogue Algorithm 102: Convolution integrals
involving probability distribution
functions . . . . . . . . . . . . . . . 270--272
Anonymous Algorithms supplement . . . . . . . . . 270--277
V. K. Garg Algorithm 103: Computing the Bessel
functions $Y_n(x+iy)$ and $K_n(x+iy)$ 272--276
Anonymous Editorial notes: Reprinting of
Algorithms . . . . . . . . . . . . . . . 276--276
A. Obru\vca Algorithm 1: Mintree . . . . . . . . . . 276--276
Anthony E. N. T. Pitman Note on Algorithm 1: Mintree . . . . . . 276--276
M. H. Rodgers and
R. H. Thomason Certification of Algorithm 1: Mintree 276--277
J. Boothroyd Certification of Algorithm 1: Mintree 277--277
I. D. Hill and
Alex K. Obru\vca Remarks on Algorithm 1: Mintree . . . . 277--277
Alex K. Obru\vca Remark on Algorithm 1: Mintree . . . . . 277--277
J. M. Triance Discussion and correspondence: a study
of COBOL portability . . . . . . . . . . 278--281
R. M. De Morgan and
I. D. Hill and
B. A. Wichmann Modified Algol 60 and the step-until
element . . . . . . . . . . . . . . . . 282--285
I. M. Barron Book Review . . . . . . . . . . . . . . 285--285
I. M. Barron Book Review . . . . . . . . . . . . . . 285--285
E. C. Coles Book Review . . . . . . . . . . . . . . 285--285
B. M. Wood Book Review . . . . . . . . . . . . . . 285--285
P. B. Fellgett Book Review . . . . . . . . . . . . . . 286--286
P. B. Fellgett Book Review . . . . . . . . . . . . . . 286--286
R. Maes On the Representation of Program
Structures by Decision Tables: a
Critical Assessment . . . . . . . . . . 290--295
M. K. Roy Evaluation of Permutation Algorithms . . 296--301
J. S. Rohl Generating Permutations by Choosing . . 302--305
P. A. Lee A reconsideration of the recovery block
scheme . . . . . . . . . . . . . . . . . 306--310
M. Osborne and
F. Little An implementation of structured
programming in APL . . . . . . . . . . . 311--315
A. M. Andrew Book Review . . . . . . . . . . . . . . 315--315
A. S. Tanenbaum A comparison of Pascal and Algol 68 . . 316--323
B. A. Lewis and
J. S. Robinson Triangulation of Planar Regions with
Applications . . . . . . . . . . . . . . 324--332
Anonymous Errata . . . . . . . . . . . . . . . . . 332--332
M. A. Hennell An experimental testbed for numerical
software . . . . . . . . . . . . . . . . 333--336
M. P. J. Curran Book review: \booktitleComputer Methods
for Mathematical Computations, by G.
Forsythe, M. Malcolm, and C. Moler,
1977; 259 pages. (Prentice/Hall, \pounds
12.80) . . . . . . . . . . . . . . . . . 336--336
M. Evans Book review: \booktitleComputer
Operating Systems, by D. W. Barron;
1977; 135 pages (Chapman and Hall),
\pounds 2.95 . . . . . . . . . . . . . . 336--336
R. E. Small Book review: \booktitleOn-Line Data
Bases: Infotech State of the Art Report,
1: Analysis and Bibliography, 2: Invited
Papers (Infotech, \pounds 110) . . . . . 336--336
W. 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
Anonymous Conference and course . . . . . . . . . 346--346
A. K. Burston and
D. J. Kinniment and
Hilary Kahn A design language for asynchronous logic 347--354
I. M. Barron Book Review . . . . . . . . . . . . . . 354--354
D. T. Muxworthy Book Review . . . . . . . . . . . . . . 354--354
J. C. Romão and
R. Vilela Mendes Algorithms for Multidimensional
Numerical Integration with Singularities 355--358
A. E. Chantler Book Review . . . . . . . . . . . . . . 358--358
J. Smith and
F. E. Knowles Book Review . . . . . . . . . . . . . . 358--358
A. Swift and
G. R. Lindfield Comparison of a Continuation Method with
Brent's Method for the Numerical
Solution of a Single Nonlinear Equation 359--362
J. R. Cash and
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
P. Giles Book Review . . . . . . . . . . . . . . 372--372
C. R. Snow Book Review . . . . . . . . . . . . . . 372--372
G. L. Farr Algorithm 104: Generation of the
alphabetically ordered sequences from a
set of $N$ distinct objects . . . . . . 373--373
Anonymous Algorithms supplement . . . . . . . . . 373--377
James J. Buckley and
Robert A. Fleck, Jr. Algorithm 105: Determining the number of
internal rates of return . . . . . . . . 373--377
A. C. Day Algorithms supplement: Statement of
policy . . . . . . . . . . . . . . . . . 377--377
M. H. Williams and
E. V. C. Fielding Discussion and correspondence: automatic
generation of payroll programs . . . . . 378--380
L. J. Mazlack Predicting student success in an
introductory programming course . . . . 380--381
S. J. Goldsack Correspondence: Semantic definition of
linear control algorithms . . . . . . . 381--382
R. Haskell and
The Editor Correspondence: Dissemination of
specialised information . . . . . . . . 382--382
Eric L. V. Hope Correspondence: Structured programming
input statements . . . . . . . . . . . . 382--382
C. B. Dunham Correspondence: Checking reproduction of
published programs . . . . . . . . . . . 383--383
Bruce L. Golden Correspondence: On ``An algorithm for
the solution of the postman's problem'' 383--383
W. Little and
D. A. Smith Correspondence: On ``Modifications to
the Forsythe--Moler algorithm for
solving linear algebraic systems'' . . . 383--383
J. M. Brady Book review: \booktitleStructural
Pattern Recognition, by T. Pavlidis,
1977 . . . . . . . . . . . . . . . . . . 384--384
J. M. Brady Book Review . . . . . . . . . . . . . . 384--384
D. Hitchin Correspondence: On ``Modifications to
the Forsythe--Moler algorithm for
solving linear algebraic systems'' . . . 384--384
Anonymous Editorial . . . . . . . . . . . . . . . 2--2
Lewis Corner Book reviews: \booktitleModel Building
in Mathematical Programming, by H. P.
Williams, 1978; \booktitleComputer
Simulation and Modeling: An
Introduction, by R. S. Lehman . . . . . 2--2
R. Burdekin and
R. S. Scowen Computers and the construction of
economic models . . . . . . . . . . . . 3--10
K. Setchfield Book Review . . . . . . . . . . . . . . 10--10
T. Briggs A review of road traffic simulation
methods using a general purpose digital
computer . . . . . . . . . . . . . . . . 11--16
M. J. B. Duff Book Review . . . . . . . . . . . . . . 16--16
J. J. Florentin Book Review . . . . . . . . . . . . . . 16--16
R. L. Grimsdale Book Review . . . . . . . . . . . . . . 16--16
N. Riley Book Review . . . . . . . . . . . . . . 16--16
C. B. Spengler and
J. B. Westwood Assessing data retrieval capabilities: a
case study . . . . . . . . . . . . . . . 17--21
A. P. Black Book Review . . . . . . . . . . . . . . 21--21
P. A. Lee Book Review . . . . . . . . . . . . . . 21--21
Eva Huzan Modelling of Indexed Sequential Files:
Monitoring Disc Transfers . . . . . . . 22--27
A. J. Thomas Book Review . . . . . . . . . . . . . . 27--27
P. Wallis Book Review . . . . . . . . . . . . . . 27--27
J. F. A. Wiederhold Tuning to Service Standards without
Monitors . . . . . . . . . . . . . . . . 28--36
B. Barber Book Review . . . . . . . . . . . . . . 36--36
A. Chantler Book Review . . . . . . . . . . . . . . 36--36
A. Chantler Book Review . . . . . . . . . . . . . . 36--36
R. Chattergy and
U. W. Pooch A distributed function computer with
dedicated processors . . . . . . . . . . 37--40
A. Rogers Book Review . . . . . . . . . . . . . . 40--40
Y. Kobayashi and
T. L. Kunii A simulation of a minicomputer
controlled system and its use as a
debugging tool . . . . . . . . . . . . . 41--49
R. L. Grimsdale Book Review . . . . . . . . . . . . . . 49--49
R. C. Witts Book Review . . . . . . . . . . . . . . 49--49
P. J. Brown Software Methods for Virtual Storage of
Executable Code . . . . . . . . . . . . 50--52
A. Young Book Review . . . . . . . . . . . . . . 52--52
M. A. Hennell and
D. Hedley An experimental testbed for numerical
software. II. ALGOL 68 . . . . . . . . . 53--56
J. C. Turner The conditional distribution of waiting
time given queue length in a computer
system . . . . . . . . . . . . . . . . . 57--62
D. D. Black Book Review . . . . . . . . . . . . . . 62--62
M. McKay Book Review . . . . . . . . . . . . . . 62--62
R. J. Paul Book Review . . . . . . . . . . . . . . 62--62
F. G. Pagan Algol 68 as a Metalanguage for
Denotational Semantics . . . . . . . . . 63--66
K. Boardman Book Review . . . . . . . . . . . . . . 66--66
P. W. Williams and
D. Woodhead Computer assisted analysis of cryptic
crosswords . . . . . . . . . . . . . . . 67--70
A. G. Bell and
N. Jacobi How to read, make and store chess moves 71--75
G. Z. Ben-Yaacov Interactive Computation and Data
Management for Power System Studies . . 76--79
Anonymous Conferences and courses . . . . . . . . 79--79
G. W. Hill Cyclic properties of pseudo-random
sequences of Mersenne prime residues . . 80--85
J. Boothroyd Certification of Algorithm 2: Fibonacci
search . . . . . . . . . . . . . . . . . 86--86
M. C. Pike and
J. Pixner Algorithm 2: Fibonacci search . . . . . 86--86
I. D. Hill Algorithm 3: Easter . . . . . . . . . . 86--87
Anonymous Algorithms supplement . . . . . . . . . 86--90
J. Boothroyd Certification of Algorithm 3: Easter . . 87--87
J. Randle Certification of Algorithm 3: Easter . . 87--87
I. D. Hill and
M. C. Pike Algorithm 4: TWOBYTWO . . . . . . . . . 87--88
M. C. Pike Algorithm 5: RANCOMB . . . . . . . . . . 88--88
J. Boothroyd Algorithm 6: PERM . . . . . . . . . . . 88--89
J. Boothroyd Algorithm 7: MINX . . . . . . . . . . . 89--89
C. M. Reeves Algorithm 8: SUD . . . . . . . . . . . . 89--89
C. M. Reeves Algorithm 9: Boyserf . . . . . . . . . . 89--90
Anonymous Algorithms supplement --- Supplement of
Policy . . . . . . . . . . . . . . . . . 90--90
Anonymous Erratum: Algorithm 105 . . . . . . . . . 90--90
R. F. Shepherd Algorithms supplement: Statement of
policy . . . . . . . . . . . . . . . . . 90--90
N. Marovac Discussion and correspondence:
Microcomputers in computer science
programmes . . . . . . . . . . . . . . . 91--94
Susan Jones A network display program . . . . . . . 98--104
M. Flower Book Review . . . . . . . . . . . . . . 104--104
I. M. Khabaza Book Review . . . . . . . . . . . . . . 104--104
A. T. Arblaster and
M. E. Sime and
T. R. G. Green Jumping to Some Purpose . . . . . . . . 105--109
D. W. B. Bale Book Review . . . . . . . . . . . . . . 109--109
P. Rivett Book Review . . . . . . . . . . . . . . 109--109
F. Mavaddat and
B. Parhami A data structure for family relations 110--113
J. R. Oliver and
R. S. Newton Practical Experience with Algol 68-Rt 114--118
Sallie S. Nelson CONSIM: a Study of Control Issues in
Conversational Simulation . . . . . . . 119--126
Steven J. Harrington A New Symbolic Integration System in
REDUCE . . . . . . . . . . . . . . . . . 127--131
P. I. P. Boulton and
J. R. Goguen A machine description language . . . . . 132--135
G. A. Korn and
O. A. Palusinski Application of a Digital Computer
Simulation Language to Control Hybrid
Computer Monte Carlo Studies . . . . . . 136--141
A. Silberschatz On the safety of the I/O primitive in
Concurrent PASCAL . . . . . . . . . . . 142--145
R. A. Huntly Book Review . . . . . . . . . . . . . . 145--145
J. A. S. Weir Book Review . . . . . . . . . . . . . . 145--145
J. L. Keedy and
K. Ramamohanarao and
J. Rosenberg On Implementing Semaphores with Sets . . 146--150
P. A. Lee Book Review . . . . . . . . . . . . . . 150--150
D. Morris Book Review . . . . . . . . . . . . . . 150--150
B. Sufrin Book Review . . . . . . . . . . . . . . 150--150
R. S. Bird Recursion Elimination with Variable
Parameters . . . . . . . . . . . . . . . 151--154
D. Bumstead Book Review . . . . . . . . . . . . . . 154--154
D. M. Nessett and
O. W. Rechard Allocation Algorithms for Dynamically
Microprogrammable Multiprocessor Systems 155--163
G. F. Miller Book Review . . . . . . . . . . . . . . 163--163
P. Wallis Book Review . . . . . . . . . . . . . . 163--163
M. H. Williams Conditions for Extended Operator
Precedence Parsing . . . . . . . . . . . 164--168
Anonymous New approaches to systems analysis and
design: a one-day seminar held as a
tribute to Eric Mutch . . . . . . . . . 168--168
S. S. Yau and
Y. S. Tang Generation of Shortest Test Sequences
for Detecting Individual Faults of
Sequential Circuits . . . . . . . . . . 169--172
S. L. Hurst An engineering consideration of spectral
transforms for ternary logic synthesis 173--183
J. R. Cash and
J. C. P. Miller On an Iterative Approach to the
Numerical Solution of Difference Schemes 184--187
Anonymous Algorithms supplement . . . . . . . . . 188--189
A. Brown Algorithm 106: An algorithm for updating
an ordered list on a VDU . . . . . . . . 188--189
J. Albus and
R. H. Anderson and
J. M. Brayer and
R. DeMori and
K. S. Fu and
S. L. Horowitz and
B. Moayer and
T. Pavlidis and
W. Stallings and
T. Vamos Correspondence . . . . . . . . . . . . . 190--191
A. A. Kaposi and
D. F. Gillies and
D. F. Cowell Correspondence . . . . . . . . . . . . . 190--191
J. S. Rohl Correspondence . . . . . . . . . . . . . 191--191
S. J. Waters Towards Comprehensive Specifications . . 195--199
P. A. Dearnley Application Level Microcode to Speed
Data Base Management . . . . . . . . . . 200--202
M. Wells Book Review . . . . . . . . . . . . . . 202--202
C. Lazos and
J. R. Yandle Improving CPU Utilisation in a
Multiprogramming System . . . . . . . . 203--205
M. H. Rogers Book Review . . . . . . . . . . . . . . 205--205
R. C. Witts Book Review . . . . . . . . . . . . . . 205--205
F. W. Burton and
J. Kollias Optimising Disc Head Movements in
Secondary Key Retrievals . . . . . . . . 206--208
Anonymous Bcs award scheme . . . . . . . . . . . . 208--208
Anonymous Conference round up . . . . . . . . . . 208--208
G. Haring and
R. Posch and
C. Leonhardt and
G. Gell The use of a synthetic jobstream in
performance evaluation . . . . . . . . . 209--219
J. Emerson Book Review . . . . . . . . . . . . . . 219--219
S. O'Connell Book Review . . . . . . . . . . . . . . 219--219
O. Nevalainen and
J. Teuhola Priority Queue Administration by Sublist
Index . . . . . . . . . . . . . . . . . 220--225
E. F. Elsworth Compilation via an Intermediate Language 226--233
D. Jacobs Book Review . . . . . . . . . . . . . . 233--233
D. Park Book Review . . . . . . . . . . . . . . 233--233
M. Di Manzo and
A. L. Frisiani and
G. Olimpo Loop Optimisation for Parallel
Processing . . . . . . . . . . . . . . . 234--239
J. J. Florentin Book Review . . . . . . . . . . . . . . 239--239
P. A. Lee Book Review . . . . . . . . . . . . . . 239--239
D. Simpson Book Review . . . . . . . . . . . . . . 239--239
Pierre Deransart Proof by Semantic Attributes of a Lisp
Compiler . . . . . . . . . . . . . . . . 240--245
D. Simpson Book Review . . . . . . . . . . . . . . 245--245
T. Vickers Book Review . . . . . . . . . . . . . . 245--245
M. Bozyigit and
Y. Paker A fixed routing problem in large and
high connectivity networks . . . . . . . 246--250
A. Thomson Book Review . . . . . . . . . . . . . . 250--250
Z. M. Lotfi and
A. J. Tosser Minimising the NAND-NOR-XOR Network of
Modulo 2 Sum of Boolean Products . . . . 251--255
J. Mottl Description of a Program for Nonlinear
Programming . . . . . . . . . . . . . . 256--261
J. M. Brady Book Review . . . . . . . . . . . . . . 261--261
J. Lewins Book Review . . . . . . . . . . . . . . 261--261
P. J. Green and
B. W. Silverman Constructing the Convex Hull of a Set of
Points in the Plane . . . . . . . . . . 262--266
E. Best Book Review . . . . . . . . . . . . . . 266--266
D. L. Fisher Book Review . . . . . . . . . . . . . . 266--266
R. H. Barlow and
D. J. Evans A parallel organisation of the bisection
algorithm . . . . . . . . . . . . . . . 267--269
K. A. Robinson An entity/event data modelling method 270--279
Anonymous Discussion on ``An entity/event data
modelling method . . . . . . . . . . . . 279--281
W. L. Price and
M. Dowson Algorithm 107: a weighted simplex
procedure for the solution of
simultaneous nonlinear equations . . . . 282--282
Anonymous Algorithms supplement . . . . . . . . . 282--285
Ole Òsterby Algorithm 108: Efficient solution of
tridiagonal linear systems . . . . . . . 283--285
P. Naur Critique of the ISO data processing
vocabulary . . . . . . . . . . . . . . . 286--286
Jane Hayden Correspondence: Nonmorphological data
collection . . . . . . . . . . . . . . . 286--287
P. Naur Discussion and correspondence: critique
of the ISO data processing vocabulary 286--288
David Jacobs Correspondence: Validating software . . 287--287
M. A. Sandys and
Aleph Null Correspondence: Point in polygon . . . . 287--288
A. N. Walker and
The Editor Algorithms: On ``Algorithm 1: Mintree'' 288--288
T. J. Howkins and
M. T. Harandi Towards More Portable Cobol . . . . . . 290--295
Anonymous Calls for papers . . . . . . . . . . . . 295--295
L. Moore Design for a Transportable Job
Organisation Language . . . . . . . . . 296--302
E. Gudes and
H. S. Koch and
F. A. Stahl Security in a Multi-Level Structured
Model of a Data Base . . . . . . . . . . 303--306
P. A. Clarke Book Review . . . . . . . . . . . . . . 306--306
D. B. Johnson Book Review . . . . . . . . . . . . . . 306--306
W. Burton A FORTRAN preprocessor to support
encapsulated data abstraction
definitions . . . . . . . . . . . . . . 307--312
D. B. G. Edwards Book Review . . . . . . . . . . . . . . 312--312
D. Hebditch Book Review . . . . . . . . . . . . . . 312--312
T. Leipälä and
O. Nevalainen A plotter sequencing system . . . . . . 313--316
B. A. Wichmann and
J. Du Croz A program to calculate the GAMM measure 317--322
M. Clowes Review: Cad meets Ai . . . . . . . . . . 322--322
D. L. Fisher Review: Cad meets Ai . . . . . . . . . . 322--322
C. Lazos and
A. Vafiadis A Method to Estimate the I/O Buffer Size
in a Computer System . . . . . . . . . . 323--327
R. M. Lea Book Review . . . . . . . . . . . . . . 327--327
I. Marriott Book Review . . . . . . . . . . . . . . 327--327
P. I. P. Boulton and
M. A. R. Kittler Estimating Program Reliability . . . . . 328--331
P. G. Raymont Book Review . . . . . . . . . . . . . . 331--331
A. J. Thomas Book Review . . . . . . . . . . . . . . 331--331
H. R. Simpson and
K. Jackson Process Synchronisation in MASCOT . . . 332--345
I. P. Page Book Review . . . . . . . . . . . . . . 345--345
A. S. Radford Book Review . . . . . . . . . . . . . . 345--345
C. M. Reeves Free store distribution under random fit
allocation: Part 1 . . . . . . . . . . . 346--351
R. W. Last Book Review . . . . . . . . . . . . . . 351--351
J. R. Haley and
A. S. Noetzell A study of processing repetition . . . . 352--356
J. M. Brady Book Review . . . . . . . . . . . . . . 356--356
A. C. Day Book Review . . . . . . . . . . . . . . 356--356
J. Loetzsch and
M. Machura and
W. Paetzold Sample implementation of a special
purpose language by the DEPOT system . . 357--362
M. Thomas Book Review . . . . . . . . . . . . . . 362--362
A. Young Book Review . . . . . . . . . . . . . . 362--362
J. Jelínek An Algebraic Theory for Parallel
Processor Design . . . . . . . . . . . . 363--375
P. T. Kirstein Book Review . . . . . . . . . . . . . . 375--375
M. J. C. Gordon On the power of list iteration . . . . . 376--379
G. Duncan Q charts --- a method of specification 380--381
G. Duncan Discussion and correspondence Q charts
--- a method of specification . . . . . 380--382
K. M. Keir Correspondence: Vector approximation to
curves . . . . . . . . . . . . . . . . . 381--381
P. Giles Book Review . . . . . . . . . . . . . . 382--382
Anonymous Algorithms supplement . . . . . . . . . 383--383
I. D. Hill Algorithm 109: Golden section search . . 383--384
L. Lipsky A Study of time sharing systems
considered as queueing networks of
exponential servers . . . . . . . . . . 290--297
Anonymous Calls for Papers . . . . . . . . . . . . 297--297
C. M. Reeves Free store distribution under random fit
allocation: part 2 . . . . . . . . . . . 298--306
Anonymous Books reviewed in this issue . . . . . . 306--306
G. Schmidt and
T. Ströhlein Timetable construction --- an annotated
bibliography . . . . . . . . . . . . . . 307--316
H. Quilliam Book Review . . . . . . . . . . . . . . 316--316
G. Rzveski Book Review . . . . . . . . . . . . . . 316--316
A. Boccalatte and
M. Di Manzo An approach to the detection of semantic
errors . . . . . . . . . . . . . . . . . 317--323
T. A. Band Book Review . . . . . . . . . . . . . . 323--323
F. E. Hinchcliff Book Review . . . . . . . . . . . . . . 323--323
D. Y. Feng and
R. F. Riesenfeld Some new surface forms for computer
aided geometric design . . . . . . . . . 324--331
T. I. Fenner and
G. Loizou A binary tree representation and related
algorithms for generating integer
partitions . . . . . . . . . . . . . . . 332--337
P. J. L. Wallis Book Review . . . . . . . . . . . . . . 337--337
A. Albano and
R. Orsini A heuristic solution of the rectangular
cutting stock problem . . . . . . . . . 338--343
Anonymous Visiting graduate teaching positions at
the University of Helsinki . . . . . . . 343--343
Y. L. Varol On a subset of all the permutations of
$n$ marks . . . . . . . . . . . . . . . 344--346
M. A. Bramer Correct and optimal strategies in game
playing programs . . . . . . . . . . . . 347--352
A. Blanin Book Review . . . . . . . . . . . . . . 352--352
A. E. Glennie Book Review . . . . . . . . . . . . . . 352--352
I. Bratko and
D. Michie An advice program for a complex chess
programming task . . . . . . . . . . . . 353--359
D. May Book Review . . . . . . . . . . . . . . 359--359
D. J. Wheeler Book Review . . . . . . . . . . . . . . 359--359
J. Mottl Description of a program for nonlinear
programming: special problem of bivalent
nonlinear programming . . . . . . . . . 360--368
A. E. Glennie Book Review . . . . . . . . . . . . . . 368--368
J. M. Smith Book Review . . . . . . . . . . . . . . 368--368
D. Michie Expert systems . . . . . . . . . . . . . 369--376
R. S. Lemos Discussion and correspondence: Measuring
students' attitudes towards structured
walk-throughs . . . . . . . . . . . . . 377--383
Anonymous Erratum . . . . . . . . . . . . . . . . 383--383
R. I. Kitney Book Review . . . . . . . . . . . . . . 383--383
K. J. Overholt Note on Algorithm 2: Fibonacci search 414--414
I. D. Hill and
M. C. Pike Note on Algorithm 4: TWO BY TWO . . . . 416--416
M. C. Pike and
I. D. Hill and
F. D. James Note on Algorithm 2: Fibonacci search,
and on Algorithm 7: MINX . . . . . . . . 416--417
J. Boothroyd Algorithm 25: Sort a section of the
elements of an array by determining the
rank of each element . . . . . . . . . . 308--309
J. Boothroyd Algorithm 26: Order the subscripts of an
array section according to the
magnitudes of the elements . . . . . . . 309--310
Peter Fellgett Correspondence: What is an analyst? . . 104--104
Mary Almond A University faculty timetable . . . . . 215--217
M. J. Savage Junction Optimisation Technique . . . . 268--272
J. N. Lyness The Effect of Inadequate Convergence
Criteria in Automatic Routines . . . . . 279--281
H. Späth Algorithm 42: Interpolation by certain
quintic splines . . . . . . . . . . . . 292--293
P. J. H. King The interpretation of limited entry
decision table format and relationships
among conditions . . . . . . . . . . . . 320--326
W. F. Lunnon A postage stamp problem . . . . . . . . 377--380
C. G. Broyden Algorithm 44: Solution of nonlinear
simultaneous equations . . . . . . . . . 406--408
I. D. Hill Note on Algorithms 25, 26. 25: Sort a
section of the elements of an array by
determining the rank of each element.
26: Order the subscripts of an array
section according to the magnitudes of
the elements . . . . . . . . . . . . . . 409--409
E. S. Deutsch Correspondence: Comments on a line
thinning algorithm . . . . . . . . . . . 412--412
I. D. Hill Correspondence: Jumping to some purpose 94--94
N. B. Taylor Correspondence: Jumping to some purpose 189--190
G. L. Robinson Correspondence: Jumping to some purpose 288--288
Marek Missala and
Piotr Rudnicki Correspondence: Jumping to some purpose 286--286
Walter Soden Note: a Method of Radix Conversion . . . 273--274