Last update:
Mon Feb 16 11:02:53 MST 2004
S. Gill Parallel programming . . . . . . . . . . 2--10
E. S. Page A note on round-off . . . . . . . . . . 10--10
D. T. Caminer And how to avoid them . . . . . . . . . 11--14
R. A. Brooker The autocode programs developed for the
Manchester University Computers . . . . 15--21
R. G. Dowse and
H. W. Gearing Mathematics in business . . . . . . . . 22--24
A. Gilmour The solution of railway problems on a
digital computer: 1 . . . . . . . . . . 25--28
A. J. Barnard The first year with a business computer 29--36
R. A. Fairthorne Automatic retrieval of recorded
information . . . . . . . . . . . . . . 36--41
S. H. Hollingdale and
M. M. Barritt An application of a computer to wind
tunnel design: 1 . . . . . . . . . . . . 42--47
F. Yates and
D. H. Rees The use of an electronic computer in
research statistics: four years'
experience . . . . . . . . . . . . . . . 49--58
H. W. Gearing Statistical foundations for business
forecasts . . . . . . . . . . . . . . . 59--63
S. H. Hollingdale and
M. M. Barritt An application of a computer to wind
tunnel design: 2 . . . . . . . . . . . . 64--68
A. S. Douglas Computers and commerce: 1 . . . . . . . 69--70
D. A. Bell The principles of sorting . . . . . . . 71--77
A. Gilmour The solution of railway problems on a
digital computer: 2 . . . . . . . . . . 78--83
W. E. Thomson A modified congruence method of
generating pseudo-random numbers . . . . 83--83
S. Gill A binary form of Horner's method . . . . 84--86
P. Shackleton A model for weekly shop loading . . . . 87--89
J. H. Wilkinson The Calculation of the Eigenvectors of
Codiagonal Matrices . . . . . . . . . . 90--96
M. V. Wilkes The second decade of computer
development . . . . . . . . . . . . . . 98--105
T. R. Thompson Four years of automatic office work . . 106--112
A. Muir Automatic sales forecasting . . . . . . 113--116
F. Beck Harmonic analysis using a digital
computer . . . . . . . . . . . . . . . . 117--117
D. W. Martin Runge-Kutta methods for integrating
differential equations on high speed
digital computers . . . . . . . . . . . 118--123
R. A. Brooker Further autocode facilities for the
Manchester (Mercury) computer . . . . . 124--127
J. A. Fotheringham and
M. de V. Roberts An input routine for the Ferranti
Mercury computer . . . . . . . . . . . . 128--131
A. S. Douglas Computer and commerce: 2 . . . . . . . . 132--137
A. S. Douglas Computers and commerce: 3-stock
recording and control . . . . . . . . . 137--141
J. C. Gower A Note on an Iterative Method for Root
Extraction . . . . . . . . . . . . . . . 142--143
R. H. Richens Interlingual machine translation . . . . 144--147
J. H. Wilkinson The Calculation of Eigenvectors by the
Method of Lanczos . . . . . . . . . . . 148--152
Rt. Hon. The Earl of Halsbury Ten years of computer development . . . 153--159
W. G. Moorhead Aircraft route analysis on a digital
computer . . . . . . . . . . . . . . . . 160--162
J. M. Watt A note on the evaluation of
trigonometric series . . . . . . . . . . 162--162
J. H. Wensley A Class of Non-Analytical Iterative
Processes . . . . . . . . . . . . . . . 163--167
A. S. Douglas Computer and commerce: 4 --- management
and control . . . . . . . . . . . . . . 168--171
C. Robinson DEUCE interpretive programs . . . . . . 172--176
K. M. Howell A new programming technique for rational
fractions . . . . . . . . . . . . . . . 176--178
R. H. Gregory and
H. W. Gearing Electronic computers as tools for
management in the United States of
America: 1956 . . . . . . . . . . . . . 179--191
B. Clarke and
G. E. Felton The Pegasus autocode . . . . . . . . . . 192--195
C. D. Allen A method for the reduction of empirical
multi-variable functions . . . . . . . . 196--200
A. S. Douglas Technique for the recording or, and
reference to data in a computer . . . . 1--9
J. M. Harrison Some helicopter simulation studies . . . 10--23
D. J. Wheeler Note on the Runge-Kutta method of
integrating ordinary differential
equations . . . . . . . . . . . . . . . 23--23
D. C. Hemy and
W. J. Kease The study of the application of a
computer to production control . . . . . 24--38
B. J. Loopstra The X-1 computer . . . . . . . . . . . . 39--43
A. D. Woolner Test programs for HEC . . . . . . . . . 44--47
P. F. Windley Transposing matrices in a digital
computer . . . . . . . . . . . . . . . . 47--48
P. F. Windley The influence of storage access time on
merging processes in a computer . . . . 49--53
J. P. Cleave Algorithms for formula translation . . . 53--54
F. J. Berry Intercode, a simplified coding scheme
for AMOS . . . . . . . . . . . . . . . . 55--58
R. Neate and
W. J. Dacey A simulation of melting shop operations 59--67
P. M. Hunt The Ferranti Perseus data-processing
system . . . . . . . . . . . . . . . . . 68--75
R. C. Brigham and
C. G. Bell A translation routine for the DEUCE
computer . . . . . . . . . . . . . . . . 76--84
G. Cuttle Where next? Some conjectures on the
future of the large-scale computer in
integrated commercial work . . . . . . . 85--86
E. E. Bernard and
P. D. A. Mole Generating strategies for continuous
separation processes . . . . . . . . . . 87--89
C. Strachey On taking the square root of a complex
number . . . . . . . . . . . . . . . . . 89--89
F. I. Musk A Monte Carlo simulation of a production
planning problem . . . . . . . . . . . . 90--94
R. W. Jones and
A. S. Douglas Correspondence: Sorting by Merging . . . 95--96
Thos. H. O'Beirne Correspondence: Gray or Gros? . . . . . 96--96
J. A. Goldsmith The state of the art --- (a) Commercial
computers in Britain, June 1959 . . . . 97--99
A. S. Douglas The state of the art --- (b) Computers
in British universities . . . . . . . . 100--102
A. G. Wright A business application of a digital
computer . . . . . . . . . . . . . . . . 103--104
C. W. Mallinson Problems of local authorities in data
processing . . . . . . . . . . . . . . . 105--107
H. W. Gearing Symposium on the selection and training
of programmers --- 1: a business user's
approach . . . . . . . . . . . . . . . . 107--109
S. Gill Current theory and practice of automatic
programming . . . . . . . . . . . . . . 110--114
J. F. A. Bryen The introduction and establishment of a
system of computer production control in
a light engineering factory . . . . . . 115--118
G. B. Griffiths Symposium on experiences with the use of
magnetic tape --- 1: magnetic tapes on a
Ferranti Pegasus . . . . . . . . . . . . 118--119
P. B. Livesey Symposium on experiences with the use of
magnetic tape --- 2: magnetic films on a
National-Elliott 405 . . . . . . . . . . 120--121
S. Takahashi Development of Japanese digital
computers . . . . . . . . . . . . . . . 122--129
L. B. Wilson Solution of certain large sets of
equations on Pegasus using matrix
methods . . . . . . . . . . . . . . . . 130--133
J. Vine Application of a combination of analogue
and digital computers to electron
trajectory tracing . . . . . . . . . . . 134--144
J. P. O'Brien Note on decomposition into first order
of multi-order linear differential
equations with constant coefficients . . 144--144
G. S. Galer The use of computers for economic
planning in the petroleum chemical
industry . . . . . . . . . . . . . . . . 145--150
T. C. Hickman Early experiences with an E.D.P. system 152--163
P. Redfern Experience in using a Deuce computer for
the family expenditure survey . . . . . 164--169
C. W. Clenshaw Curve fitting with a digital computer 170--173
J. S. Hornsby A function interpretive scheme for
Pegasus . . . . . . . . . . . . . . . . 174--180
A. R. Edmonds The generation of pseudo-random numbers
on electronic digital computers . . . . 181--185
R. L. Cook Time-sharing on the National-Elliott 802 185--188
R. A. Brooker Some techniques for dealing with
two-level storage . . . . . . . . . . . 189--194
D. Milledge and
M. J. Mills Forecasting election results . . . . . . 195--198
Anon Note on commissioning of LEO automatic
office at the Ministry of Pensions and
National Insurance . . . . . . . . . . . 198--198
E. S. Page Theoretical considerations of routine
maintenance . . . . . . . . . . . . . . 199--204
R. L. Sutton The first year's experience with a large
computer in a life assurance office . . 2--9
D. G. N. Hunter Note on a test for repeating cycles in a
pseudo-random number generator . . . . . 9--9
T. R. Thompson Problems of auditing computing data:
internal audit practice and external
audit theory . . . . . . . . . . . . . . 10--11
F. C. de Paula Problems of auditing computer data.
Section 2: The external auditor and
computers . . . . . . . . . . . . . . . 11--14
P. F. Windley and
L. R. Kay and
A. Rowland-Jones Data processing in university
administration . . . . . . . . . . . . . 15--20
A. H. Cockayne and
E. Hyde Prime number code for information
retrieval . . . . . . . . . . . . . . . 21--22
J. H. Wilkinson Householder's Method for the Solution of
the Algebraic Eigenproblem . . . . . . . 23--27
D. W. Barron and
H. P. F. Swinnerton-Dyer Solution of simultaneous linear
equations using a magnetic-tape store 28--33
R. K. Livesley The analysis of large structural systems 34--39
N. V. Findler Some remarks on the game `dama' which
can be played on a digital computer . . 40--44
K. T. Boyd Simultaneous equations and linear
programming . . . . . . . . . . . . . . 45--46
D. G. Papworth Computers and change-ringing . . . . . . 47--50
R. H. Tizard Conversion between analogue and digital
measures . . . . . . . . . . . . . . . . 51--59
A. S. Douglas and
A. J. Mitchell AUTOSTAT: a language for statistical
data processing . . . . . . . . . . . . 61--66
M. Woodger An introduction to ALGOL 60 . . . . . . 67--75
M. A. Wright Mechanizing a large index . . . . . . . 76--83
P. F. Windley Trees, forests and rearranging . . . . . 84--88
E. W. Solomon A comprehensive program for network
problems . . . . . . . . . . . . . . . . 89--97
F. G. Duncan and
D. H. R. Huxtable The DEUCE Alphacode translator . . . . . 98--107
A. Gibbons A program for the automatic integration
of differential equations using the
method of Taylor series . . . . . . . . 108--111
J. C. P. Miller Note on the numerical evaluation of a
first derivative from a table of a
function satisfying a second order
differential equation . . . . . . . . . 112--113
C. Strachey Two contributions to the techniques of
queuing problems . . . . . . . . . . . . 114--116
D. W. Polley A progress report on the introduction of
A.D.P. for recording contributions paid
under the new graduated pensions scheme 117--120
L. D. Slater Problems of the introduction of large
scale data processing into the Royal
Army Pay Corps . . . . . . . . . . . . . 120--123
C. B. Warmington The first year's production on a
computer, and future plans . . . . . . . 124--127
R. Hindle A bank adopts automatic data processing 127--130
R. A. Buckingham The organization of a university
computer centre . . . . . . . . . . . . 131--135
F. Yates and
H. R. Simpson A general program for the analysis of
surveys . . . . . . . . . . . . . . . . 136--140
R. L. Cook Market surveys with a small computer . . 140--142
J. A. Gosden Market research applications on LEO . . 142--143
R. M. Paine Automatic coding for business
applications . . . . . . . . . . . . . . 144--149
P. V. Youle Simulation of full-scale multi-stage
batchwise chemical plant . . . . . . . . 150--157
J. M. Dempsey Some aspects of simulator design . . . . 158--161
P. F. King and
D. A. Peel An analysis of a hydro-electric system 161--163
L. Clarke Notes on the state of digital computing
in the U.S.S.R. . . . . . . . . . . . . 164--167
R. A. Brooker and
D. Morris An assembly program for a phrase
structure language . . . . . . . . . . . 168--174
H. H. Rosenbrock An automatic method for finding the
greatest or least value of a function 175--184
A. J. Platt The experience of applying a commercial
computer in a British organization . . . 185--197
D. J. L. Hughes Computer production control --- the
second year . . . . . . . . . . . . . . 198--201
H. M. c. G. Ross Considerations in choosing a character
code for computers and punched tapes . . 202--210
J. G. Thompson An introduction to analogue computer
methods . . . . . . . . . . . . . . . . 211--219
R. A. Brooker and
D. Morris Some proposals for the realization of a
certain assembly program . . . . . . . . 220--231
A. Gibbons Running Pegasus autocode programs on
Mercury . . . . . . . . . . . . . . . . 232--236
J. S. Appleby and
D. V. Blake and
E. A. Newman Techniques for producing school
timetables on a computer and their
application to other scheduling problems 237--245
A. Young and
G. Almond Predicting distributions of staff . . . 246--250
J. C. Butcher Random sampling from the normal
distribution . . . . . . . . . . . . . . 251--253
J. M. Bennett and
R. J. Dakin Computers as an aid in computer design
assessment . . . . . . . . . . . . . . . 253--256
H. H. Johnson Optimum time for multiplication on a
digital computer . . . . . . . . . . . . 256--261
I. J. Good A comparison of some methods of
calculating covariance functions on an
electronic computer . . . . . . . . . . 262--265
J. H. Cadwell A least squares surface fitting program 266--269
D. B. Hunter An iterative method of numerical
differentiation . . . . . . . . . . . . 270--271
W. Barrett Convergence properties of Gaussian
quadrature formulae . . . . . . . . . . 272--277
M. V. Wilkes Data transmission and the new outlook
for the computer field . . . . . . . . . 1--9
H. D. Huskey Compiling techniques for algebraic
expressions . . . . . . . . . . . . . . 10--19
F. Yates and
H. R. Simpson The analysis of surveys: processing and
printed the basic tables . . . . . . . . 20--24
B. R. Taylor Experience with a digital computer in an
aeroplane testing establishment . . . . 25--29
H. W. Gearing The use of Pegasus Autocode in some
experimental business applications of
computers . . . . . . . . . . . . . . . 30--34
P. A. Long and
E. H. Truslove Data transmission --- problems and
prospects . . . . . . . . . . . . . . . 34--37
M. A. Wright Matching inquiries to an index . . . . . 38--41
G. J. Herring Book review: \em Analogue Computation in
Engineering Design, by A. E. Rogers and
T. W. Connolly, 1960 . . . . . . . . . . 41--41
J. M. M. Pinkerton The evolution of design in a series of
computers, LEO I--III . . . . . . . . . 42--46
P. M. Woodward and
D. P. Jenkins Atoms and lists . . . . . . . . . . . . 47--53
M. A. Cayless Solution of systems of ordinary and
partial differential equations by
quasi-diagonal matrices . . . . . . . . 54--61
C. E. Maley The effect of parameters on the roots of
an equation system . . . . . . . . . . . 62--63
A. Ralston Some theoretical and computational
matters relating to predictor-corrector
methods of numerical integration . . . . 64--67
A. W. O. Firth Optimization problems: solution by an
analogue computer . . . . . . . . . . . 68--72
B. A. Carre The determination of the optimum
accelerating factor for successive
over-relaxation . . . . . . . . . . . . 73--79
C. V. D. Forrington Extensions of the predictor-corrector
method for the solution of systems of
ordinary differential equations. . . . . 80--85
M. B. Williams Present and future facilities for data
transmission . . . . . . . . . . . . . . 88--95
P. A. Long A data transmission survey . . . . . . . 95--102
E. P. G. Wright Data collection and transmission . . . . 103--109
K. S. Hope SABER: a real time problem in
tele-processing . . . . . . . . . . . . 109--113
E. A. Newman Some comments on character recognition 114--120
M. B. Clowes and
J. R. Parks A new technique in automatic character
recognition . . . . . . . . . . . . . . 121--128
R. L. Grimsdale and
J. M. Bullingham Character recognition by digital
computer using a special flying-spot
scanner . . . . . . . . . . . . . . . . 129--136
I. W. Merry and
G. O. Norrie Character quality and scanner
organization . . . . . . . . . . . . . . 137--144
A. S. Douglas The impact of computers on documentation 145--149
G. Jennings A direct ordering, recording and
invoicing system . . . . . . . . . . . . 150--156
R. Hindle Character recognition and document
handling in banks . . . . . . . . . . . 157--160
J. B. Stringer The place of character recognition, data
transmission and document handling in
A.D.P. systems . . . . . . . . . . . . . 161--167
C. Strachey and
J. G. F. Francis The reduction of a matrix to codiagonal
form by eliminations . . . . . . . . . . 168--176
J. S. Rollett and
J. H. Wilkinson An efficient scheme for the
co-diagonalization of a symmetric matrix
by Givens' method in a computer with a
two-level store . . . . . . . . . . . . 177--180
A. R. Bagshaw Organization of a computing service for
industry and commerce . . . . . . . . . 181--184
R. O. Bennett and
J. B. Stringer Acceptance trials of computer systems
for government use . . . . . . . . . . . 185--196
T. G. H. Braunholtz and
A. G. Fraser and
P. M. Hunt NEBULA: a programming language for data
processing . . . . . . . . . . . . . . . 197--211
L. Fox Computing machines for teaching and
research . . . . . . . . . . . . . . . . 212--216
P. R. Bagley Improving problem-oriented language by
stratifying it . . . . . . . . . . . . . 217--221
T. Kilburn and
D. J. Howarth and
R. B. Payne and
F. H. Sumner The Manchester University Atlas
operating system part I: internal
organization . . . . . . . . . . . . . . 222--225
D. J. Howarth and
R. B. Payne and
F. H. Sumner The Manchester University Atlas
operating system part II: users'
description . . . . . . . . . . . . . . 226--229
J. H. Wilkinson Rigorous Error Bounds for Computed
Eigensystems . . . . . . . . . . . . . . 230--241
D. W. Martin and
G. J. Tee Iterative methods for linear equations
with symmetric positive definite matrix 242--254
C. B. Haselgrove The solution of non-linear equations and
of differential equations with two-point
boundary conditions . . . . . . . . . . 255--259
J. H. Cadwell and
D. E. Williams Some orthogonal methods of curve and
surface fitting . . . . . . . . . . . . 260--264
J. G. F. Francis The $QR$ transformation a unitary
analogue to the $LR$ transformation ---
part 1 . . . . . . . . . . . . . . . . . 265--271
F. Yates Computers in research --- promise and
performance . . . . . . . . . . . . . . 273--279
J. C. Gower The handling of multiway tables on
computers . . . . . . . . . . . . . . . 280--286
L. J. Slater Regression analysis . . . . . . . . . . 287--291
R. W. Hockney ABS12 ALGOL: an extension to Algol 60
for industrial use . . . . . . . . . . . 292--300
E. Humby RAPIDWRITE --- a new approach to COBOL
readability . . . . . . . . . . . . . . 301--304
P. R. Bagley Principles and problems of a Universal
Computer-Oriented Language . . . . . . . 305--312
C. C. Leighton Control gear simulation for an automatic
car park . . . . . . . . . . . . . . . . 313--316
L. Fox Chebyshev methods for ordinary
differential equations . . . . . . . . . 318--331
J. G. F. Francis The $QR$ transformation --- part 2 . . . 332--345
D. Kershaw and
S. Vajda The Economics of Dumping from Electronic
Computers . . . . . . . . . . . . . . . 346--348
D. V. Cheesman A small business computer at work . . . 1--6
D. R. Palmer A stock-control and invoicing system
using a Gamma 3 computer . . . . . . . . 7--9
C. A. R. Hoare Quicksort . . . . . . . . . . . . . . . 10--16
H. P. F. Swinnerton-Dyer The calculation of power spectra . . . . 16--23
W. G. Proctor and
M. F. Mitchell The PACE scaling routine for Mercury . . 24--27
D. C. Cooper and
H. Whitfield ALP: an autocode list-processing
language . . . . . . . . . . . . . . . . 28--32
R. A. Brooker and
D. Morris and
J. S. Rohl Trees and routines . . . . . . . . . . . 33--47
D. J. Evans Note on the line over-relaxation factor
for small mesh size . . . . . . . . . . 48--50
B. A. Chartres Adaptation of the Jacobi method for a
computer with magnetic-tape backing
store . . . . . . . . . . . . . . . . . 51--60
J. H. Wilkinson Instability of the Elimination Method of
Reducing a Matrix to Tri-Diagonal Form 61--70
A. E. Checksfield The first computer in Rhodesia . . . . . 79--87
D. H. Kelly and
J. N. Buxton MONTECODE --- an interpretive program
for Monte Carlo simulations . . . . . . 88--93
R. Grimmond An analysis of real and simulated
statistics for system design purposes 94--99
A. R. Curtis and
I. C. Pyle A proposed target language for compilers
on Atlas . . . . . . . . . . . . . . . . 100--106
A. d'Agapeyeff Current developments in commercial
automatic programming . . . . . . . . . 107--111
R. F. Clippinger FACT . . . . . . . . . . . . . . . . . . 112--125
E. W. Dijkstra Operating experience with ALGOL 60 . . . 125--127
C. A. R. Hoare Report on the Elliott ALGOL translator 127--129
F. G. Duncan Implementation of ALGOL 60 for the
English Electric KDF9 . . . . . . . . . 130--131
A. E. Glennie Operating experience with FORTRAN . . . 132--139
D. C. Handscomb Computation of the latent roots of a
Hessenberg matrix by Bairstow's method 139--141
A. R. Mitchell and
R. P. Pearce High accuracy difference formulae for
the numerical solution of the heat
conduction equation . . . . . . . . . . 142--146
M. J. D. Powell An iterative method for finding
stationary values of a function of
several variables. . . . . . . . . . . . 147--151
M. A. Kingsbury Operating experience with COBOL in a
service bureau . . . . . . . . . . . . . 157--158
A. S. Cormack Early operating experience with Language
H . . . . . . . . . . . . . . . . . . . 158--161
A. R. Rousell A progress report on NEBULA . . . . . . 162--163
T. R. Thompson Fundamental principles of expressing a
procedure for a computer application . . 164--169
Various Discussion: Session 2: 17 April 1962 . . 170--176
F. G. Duncan Errata: ``Implementation of ALGOL 60 for
the English Electric KDF9'' . . . . . . 176--176
R. F. Clippinger COBOL . . . . . . . . . . . . . . . . . 177--180
R. F. Clippinger Information algebra . . . . . . . . . . 180--192
R. B. Baer Note on an extremum locating algorithm 193--193
J. N. Buxton and
J. G. Laski Control and simulation language . . . . 194--199
J. K. Iliffe and
J. G. Jodeit A dynamic storage allocation scheme . . 200--209
C. L. Hamblin Translation to and from Polish notation 210--213
E. S. Page On the scheduling of jobs by computer 214--220
J. M. Watt and
A. Young An attempt to simulate the liver on a
computer . . . . . . . . . . . . . . . . 221--227
H. C. Thacher, Jr. An iterative method for quadratures . . 228--229
R. A. Sack Newton-Cotes type quadrature formulas
with terminal corrections . . . . . . . 230--237
D. J. Howarth and
P. D. Jones and
M. T. Wyld The Atlas scheduling system . . . . . . 238--246
D. W. Moore Accounting for the soldier's pay . . . . 249--257
W. S. Caskey Accounting for the soldier's pay ---
organization of programming . . . . . . 258--263
R. P. Thorby and
B. Benjamin The application of the electronic
computer to the 1961 population census
of Great Britain . . . . . . . . . . . . 264--270
R. G. Massey Computers in a new steelworks . . . . . 271--275
J. A. Gosden Estimating computer performance . . . . 276--283
J. D. W. Janes Measuring the profitability of a
computer system . . . . . . . . . . . . 284--293
A. Young The impact on universities of the
expansion in their computer facilities 294--296
F. D. Robinson The background of the PERT algorithm . . 297--300
S. Lambourn Resource allocation and multi-project
scheduling (RAMPS) --- a new tool in
planning and control . . . . . . . . . . 300--304
J. F. Wilson Experience in transmitting accounting
data . . . . . . . . . . . . . . . . . . 305--307
K. W. Pearson Satellite communications . . . . . . . . 308--312
F. Yates and
J. C. Gower and
H. R. Simpson A specialized autocode for the analysis
of replicated experiments . . . . . . . 313--319
R. L. Boyell The method of successive grids for
reduction of function storage
requirements . . . . . . . . . . . . . . 320--321
J. D. Lambert and
A. R. Mitchell The use of higher derivatives in
quadrature formulae . . . . . . . . . . 322--327
D. J. Evans and
C. V. D. Forrington Note on the solution of certain
tri-diagonal systems of linear equations 327--328
H. H. Rosenbrock Some general implicit processes for the
numerical solution of differential
equations . . . . . . . . . . . . . . . 329--331
J. M. Watt The realization of ALGOL procedures and
designational expressions . . . . . . . 332--337
J. M. Gerard and
A. Sambles A hardware representation for ALGOL 60
using Creed teleprinter equipment . . . 338--340
F. G. Duncan Input and output for ALGOL 60 on KDF 9 341--344
C. A. R. Hoare The Elliott ALGOL input/output system 345--348
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 Revised report on the algorithmic
language ALGOL 60 . . . . . . . . . . . 349--367
J. Drummond Some aspects of recording graduated
national insurance contributions . . . . 1--4
J. R. Hopkinson Integrated accounting using a variety of
equipment . . . . . . . . . . . . . . . 5--6
W. S. Ryan LEAPS --- the first three years . . . . 6--13
A. F. George SAS aids for the jet age:
telecommunication for electronic
reservations . . . . . . . . . . . . . . 14--17
D. J. Dace Experience in the practical use of data
transmission . . . . . . . . . . . . . . 17--23
J. W. Lewis Time sharing on LEO III . . . . . . . . 24--28
M. R. Mills Operational experience of time sharing
and parallel processing . . . . . . . . 28--36
L. H. Underhill The growth of complexity of a
general-purpose program . . . . . . . . 37--38
R. Palmer Computer calculations on the initiation
of high-explosive detonation . . . . . . 39--43
D. W. Barron and
D. F. Hartley Techniques for program error diagnosis
on EDSAC 2 . . . . . . . . . . . . . . . 44--49
H. McG Ross A convention to distinguish letter O
from numeral zero . . . . . . . . . . . 49--49
B. Higman What EVERYBODY should know about ALGOL 50--56
M. J. R. Healy Programming multiple regression . . . . 57--61
A. H. Stroud and
D. Secrest A multiple-precision floating-point
interpretive program for the Control
Data 1604 . . . . . . . . . . . . . . . 62--66
A. J. T. Colin Note on coding reverse Polish
expressions for single-address computers
with one accumulator . . . . . . . . . . 67--68
L. Fox Partial differential equations . . . . . 69--74
D. M. Collison Note on a method of forming a sorting
key for a partly ordered list, and an
application . . . . . . . . . . . . . . 74--74
D. Mustard and
J. N. Lyness and
J. M. Blatt Numerical quadrature in n dimensions . . 75--87
C. W. Clenshaw and
H. J. Norton The solution of nonlinear ordinary
differential equations in Chebyshev
series . . . . . . . . . . . . . . . . . 88--92
M. R. Osborne Iterative procedures for solving
finite-difference approximations to
separable partial differential equations 93--99
J. M. Ortega and
H. F. Kaiser The $LL^{\rm T}$ and $QR$ Methods for
Symmetric Tridiagonal Matrices . . . . . 99--101
D. Elliott A Chebyshev series method for the
numerical solution of Fredholm integral
equations . . . . . . . . . . . . . . . 102--112
D. A. Brace Direct coding of English language names 113--117
T. H. Anstey and
K. W. Smillie Use of a remote digital computer on an
open-shop basis in agricultural research 118--120
B. Kitz and
S. Vajda A program to study the effect of random
delays on the ability of trains to runs
to a schedule . . . . . . . . . . . . . 121--128
S. Gill A technique for the composition of music
in a computer . . . . . . . . . . . . . 129--133
D. W. Barron and
J. N. Buxton and
D. F. Hartley and
E. Nixon and
C. Strachey The main features of CPL . . . . . . . . 134--143
L. A. Edelstein `Picture logic' for `Bacchus' a
fourth-generation computer . . . . . . . 144--153
M. Lehman and
R. Eshed and
Z. Netter The checking of computer logic by
simulation on a computer . . . . . . . . 154--162
R. Fletcher and
M. J. D. Powell A rapidly convergent descent method for
minimization . . . . . . . . . . . . . . 163--168
H. E. Wrigley Accelerating the Jacobi method for
solving simultaneous equations by
Chebyshev extrapolation when the
eigenvalues of the iteration matrix are
complex . . . . . . . . . . . . . . . . 169--176
G. J. Tee A novel finite-difference approximation
to the biharmonic operator . . . . . . . 177--192
D. J. Evans The extrapolated modified Aitken
iteration method for solving elliptic
difference equations . . . . . . . . . . 193--201
I. M. Khabaza An iterative least-square method
suitable for solving large sparse
matrices . . . . . . . . . . . . . . . . 202--206
R. E. Scraton and
J. W. Searle Note on the numerical solution of linear
differential equations with constant
coefficients . . . . . . . . . . . . . . 206--207
D. G. Russell The problems of data transmission
systems in a general manufacturing dat
processing installation . . . . . . . . 210--213
F. G. Chapman Use of large computers at a distance . . 214--218
L. B. Davey Data preparation and transmission in the
Royal Air Force integrated supply system 219--222
K. L. Smith The views of the data transmission
committee . . . . . . . . . . . . . . . 222--227
Anonymous Discussion forum --- the systems
approach to data transmission . . . . . 228--231
D. Michie Experiments on the mechanization of
game-learning Part I. Characterization
of the model and its parameters . . . . 232--236
E. R. Kermode Correspondence: On ``Direct coding of
English language names'' . . . . . . . . 236--236
W. Barrett and
A. J. Mitchell An extended autocode for Pegasus . . . . 237--240
E. S. Page A note on assignment problems . . . . . 241--243
D. A. Bell Approximations in Fourier transforms . . 244--247
J. Houstoun Book review: \em Mathematical Methods
for the Study of Automatic Control
Systems, by V. I. Zubov, 1962 . . . . . 247--247
J. H. Matthewman Note on the selective summation of
Fourier series . . . . . . . . . . . . . 248--249
R. M. Needham Book review: \em Textbook on Mechanized
Information Retrieval, by Allen Kent,
1962 . . . . . . . . . . . . . . . . . . 249--249
G. J. Tee Eigenvectors of the successive
over-relaxation process, and its
combination with Chebyshev
semi-iteration . . . . . . . . . . . . . 250--263
B. Richards and
E. S. Page Book reviews: \em Annual Review in
Automatic Programming, Volume 3, edited
by R. Goodman; \em Proceedings of a
Harvard Symposium on Digital Computers
and Their Applications, edited by A. G.
Oettinger, 1962 . . . . . . . . . . . . 263--263, 270--270
J. N. Lyness and
B. J. J. McHugh Integration over multidimensional
hypercubes I. A progressive procedure 264--270
D. J. Evans and
C. V. D. Forrington An iterative process for optimizing
symmetric successive over-relaxation . . 271--273
M. Goyer and
G. C. Tootill Boor review: \em Russian Supplement to
Elsevier's Dictionary of Automation,
Computers, Control and Measuring, by W.
E. Clason, 1962 . . . . . . . . . . . . 273--273
J. Eve Starting approximation for the iterative
calculation of square roots . . . . . . 274--276
D. A. Brace and
G. J. Tee Book reviews: \em Elementary
Mathematical Programming, by Robert W.
Metzger, 1963; \em U.S.S.R.
Computational Mathematics and
Mathematical Physics, Number 1, 1962 . . 276--276, 286--286
D. R. Cowdrey and
C. M. Reeves An application of the Monte Carlo method
to the evaluation of some molecular
integrals . . . . . . . . . . . . . . . 277--286
Paul A. Samet Correspondence: A hardware
representation for ALGOL 60 using Creed
Teleprinter equipment . . . . . . . . . 286--286
R. Fletcher and
C. M. Reeves A mechanization of algebraic
differentiation and the automatic
generation of formulae for molecular
integral of Gaussian orbitals . . . . . 287--292
B. R. Heap Permutations by interchanges . . . . . . 293--294
G. H. Perry and
J. C. Cluley and
K. L. Smith and
R. L. Goodstein Book reviews: \em Large-Capacity Memory
Techniques for Computing Systems, edited
by Marshall C. Yovits, 1962; \em Digital
Techniques, by D. W. Davies, 1963; \em
Theory and Design of Digital Machines,
by Thomas C. Bartee, Irwin Lebow, [and]
Irving S. Reed, 1962; \em A Survey of
Mathematical Logic, by Hao Wang, 1963 295--298
R. L. Michaelson Presidential address. Science and the
non-scientist . . . . . . . . . . . . . 299--303
J. S. Clowes and
E. S. Page Assignment problems . . . . . . . . . . 304--307
Peter J. Landin The Mechanical Evaluation of Expressions 308--320
N. E. Wiseman Application of list-processing methods
to the design of interconnections for a
fast logic system . . . . . . . . . . . 321--327
J. W. J. Williams E.S.P. the Elliott simulator package . . 328--331
C. W. Gear Optimization of the address field
compilation in the ILLIAC 2 assembler 332--335
D. W. Barron Correspondence: On the representation of
ALGOL . . . . . . . . . . . . . . . . . 335--335
P. Taylor Correspondence: On the representation of
ALGOL . . . . . . . . . . . . . . . . . 335--335, 367--367
K. L. Ryder Note on an ALGOL 60 compiler for Pegasus
I . . . . . . . . . . . . . . . . . . . 336--338
A. Colin The multiple variate counter . . . . . . 339--347
L. J. Slater Some experiences in price mapping . . . 348--351
G. A. Miles and
K. L. Stewart and
G. J. Tee Elementary divisors of the Liebmann
process . . . . . . . . . . . . . . . . 352--355
J. A. Grant and
O. G. Ludwig Note on the integrals of products of
associated Legendre functions . . . . . 356--357
K. Wright Chebyshev collocation methods for
ordinary differential equations . . . . 358--365
E. D'Sylva and
G. A. Miles The S.S.O.R. iteration scheme for
equations with $\sigma_1$ ordering . . . 366--367
R. E. Scraton The numerical solution of second-order
differential equations not containing
the first derivative explicitly . . . . 368--370
E. Playfair Computers and psychology . . . . . . . . 1--3
J. V. Goodman Auditing magnetic-tape systems . . . . . 4--7
P. H. Vince Documentation for systems design . . . . 8--14
A. Taylor-Smith Authorization and control of input in
the Royal Army Pay Corps Computer Centre
application . . . . . . . . . . . . . . 14--18
D. G. W. Thomas Record identification using variable
alphanumeric names . . . . . . . . . . . 19--23
D. Pullin A FORTRAN to ALGOL translator . . . . . 24--27
A. F. Parker-Rhodes The communication of algorithms . . . . 28--35
L. J. Slater A dynamic programming process . . . . . 36--39
L. N. Carling A study of the solution of an
initial-value problem with a hybrid
computer . . . . . . . . . . . . . . . . 40--46
M. R. Abbott Axially symmetric steady motion of a
viscous incompressible fluid: some
numerical experiments . . . . . . . . . 47--53
D. F. Mayers The deferred approach to the limit in
ordinary differential equations . . . . 54--57
M. R. Osborne A method for finite-difference
approximation to ordinary differential
equations . . . . . . . . . . . . . . . 58--65
M. R. Osborne and
S. Michaelson The numerical solution of eigenvalue
problems in which the eigenvalue
problems in which the eigenvalue
parameter appears nonlinearly, with an
application to differential equations 66--71
M. S. Lynn On the equivalence of SOR, SSOR and
USSOR as applied to $\sigma_1$-ordered
systems of linear equations . . . . . . 72--75
H. J. Norton The iterative solution of non-linear
ordinary differential equations in
Chebyshev series . . . . . . . . . . . . 76--85
C. R. Smith Computer development from a user's point
of view . . . . . . . . . . . . . . . . 89--92
F. J. M. Laver A user's view of A.D.P. systems design 93--94
P. Giles Problems of life assurance data
processing . . . . . . . . . . . . . . . 95--98
I. M. Golds User's experience of COBOL . . . . . . . 99--101
T. H. Ayre User's experience of RAPIDWRITE . . . . 101--102
M. Richardson User's experience of CLEO . . . . . . . 102--103
O. S. Lumb Experience of program development with
FACT . . . . . . . . . . . . . . . . . . 104--107
H. D. Baecker Initial users' reactions: what do they
really want? . . . . . . . . . . . . . . 108--109
D. B. Lloyd Data retrieval . . . . . . . . . . . . . 110--113
R. Taylor and
D. A. Harragan The FORTRAN system for Orion . . . . . . 114--116
A. J. Cole The preparation of examination
time-tables using a small-store computer 117--121
R. L. Chew Note on timing simulation of a large
asynchronous computer . . . . . . . . . 122--123
F. G. Foster A computer technique for game-theoretic
problems I: chemin-de-fer analyzed . . . 124--130
C. S. Wallace Correlated round-off errors in digital
integrating differential analyzers . . . 131--134
M. D. Bakes An alternative method of solution of
certain tri-diagonal systems of linear
equations. . . . . . . . . . . . . . . . 135--136
D. J. Evans The extrapolated modified Aitken
iteration method applied to
$\sigma_1$-ordered systems of linear
equations . . . . . . . . . . . . . . . 137--140
C. T. H. Baker and
L. Fox and
D. F. Mayers and
K. Wright Numerical solution of Fredholm integral
equations of first kind . . . . . . . . 141--148
R. Fletcher and
C. M. Reeves Function Minimization by Conjugate
Gradients . . . . . . . . . . . . . . . 149--154
M. J. D. Powell An Efficient Method for Finding the
Minimum of a Function of Several
Variables without Calculating
Derivatives . . . . . . . . . . . . . . 155--162
I. B. Parker and
J. Crank Persistent discretization errors in
partial differential equations of
parabolic type . . . . . . . . . . . . . 163--167
F. A. Rigg The operation of large computer systems 169--172
J. F. Milburn and
D. J. Fearnley and
C. G. Myers A computer in insurance . . . . . . . . 173--176
V. E. Price Desirable computing facilities for a
College of Advanced Technology . . . . . 177--179
Maurice V. Wilkes A Programmer's Utility Filing System . . 180--184
F. H. Dearnley and
G. B. Newell Automatic segmentation of programs for a
two-level store computer . . . . . . . . 185--187
J. M. Ridgion and
A. J. Willmott and
J. H. Thewlis An analogue computer simulation of a
Cowper Stove . . . . . . . . . . . . . . 188--196
H. McG Ross The I.S.O. character code . . . . . . . 197--202
E. O. Thorp and
W. E. Walden A partial analysis of Go . . . . . . . . 203--207
M. J. Rose Classification of a set of elements . . 208--211
F. M. Larkin A combined graphical and iterative
approach to the problem of finding zeros
of functions in the complex plane . . . 212--219
L. de Witte Error estimates for smoothing and
extrapolation formulae . . . . . . . . . 220--221
A. Doust and
V. E. Price The latent roots and vectors of a
singular matrix . . . . . . . . . . . . 222--227
M. R. Osborne A new method for the solution of
eigenvalue problems . . . . . . . . . . 228--232
M. R. Osborne An error analysis of finite-difference
methods for the numerical solution of
ordinary differential equations . . . . 232--237
A. Orden Stationary points of quadratic functions
under linear constraints . . . . . . . . 238--241
G. Fairweather and
A. R. Mitchell A generalized alternating direction
method of Douglas-Rachford type for
solving the biharmonic equation . . . . 242--245
R. E. Scraton Estimation of the truncation error in
Runge-Kutta and allied processes . . . . 246--248
P. L. Cloot What is the use of operating systems? 249--254
J. W. Lewis The management of a large commercial
computer bureau . . . . . . . . . . . . 255--261
A. S. Douglas The use of a large computer on a bureau
basis . . . . . . . . . . . . . . . . . 262--263
I. H. Gould and
G. C. Tootill The terminology work of IFIP and ICC . . 264--270
J. S. Gatehouse Electronic data processing for the
international vocabulary of terms used
in information processing . . . . . . . 271--274
M. Levison The siting of fragments . . . . . . . . 275--277
M. V. Wilkes Lists and why they are useful . . . . . 278--281
J. R. Ullmann A basic approach to pattern recognition 282--289
H. Schorr Analytic differentiation using a
syntax-directed compiler . . . . . . . . 290--298
W. C. Lynch More combinatorial properties of certain
trees . . . . . . . . . . . . . . . . . 299--302
M. J. D. Powell A Method for Minimizing a Sum of Squares
of Non-Linear Functions Without
Calculating Derivatives . . . . . . . . 303--307
J. A. Nelder and
R. Mead A Simplex Method for Function
Minimization . . . . . . . . . . . . . . 308--313
J. T. Day A one-step method for the numerical
integration of the differential equation
$y'=f(x)y+g(x)$ . . . . . . . . . . . . 314--317
D. J. Evans Estimation of the line over-relaxation
factor and convergence rates of an
alternating direction line
over-relaxation technique . . . . . . . 318--321
D. J. Green and
S. Michaelson Series solution of certain
Sturm-Liouville eigenvalue problems . . 322--336
R. A. Buckingham The computer in the university . . . . . 1--7
A. S. Cormack Interaction between user's needs and
language-compiler-computer systems . . . 8--12
E. M. L. Beale and
P. A. B. Hughes and
R. E. Small Experiences in using a decomposition
program . . . . . . . . . . . . . . . . 13--18
Aarni Perko Some computational notes on the shortest
route problems . . . . . . . . . . . . . 19--20
P. A. Samet The efficient administration of blocks
in ALGOL . . . . . . . . . . . . . . . . 21--23
A. J. Melbourne and
J. M. Pugmire A small computer for the direction
processing of FORTRAN statements . . . . 24--27
R. J. Ord-Smith An extension of block design methods and
an application in the construction of
redundant fault reducing circuits for
computers . . . . . . . . . . . . . . . 28--32
R. Fletcher Function Minimization without Evaluating
Derivatives --- a Review . . . . . . . . 33--41
M. J. Box A new method of constrained optimization
and a comparison with other methods . . 42--52
J. A. T. Bye Obtaining solutions of the Navier-Stokes
equation by relaxation processes . . . . 53--56
R. E. Scraton The solution of linear differential
equations in Chebyshev series . . . . . 57--61
P. Jarratt and
D. Nudds The use of rational functions in the
iterative solution of equations on a
digital computer . . . . . . . . . . . . 62--65
J. G. P. Barnes An algorithm for solving non-linear
equations based on the secant method . . 66--72
S. V. Ahamed Accelerated convergence of numerical
solution of linear and non-linear vector
field problems . . . . . . . . . . . . . 73--76
J. H. Wilkinson Convergence of the $LR$, $QR$ and
related algorithms . . . . . . . . . . . 77--84
J. H. Wilkinson The $QR$ algorithm for real symmetric
matrices with multiple eigenvalues . . . 85--87
F. H. Sharman Character recognition . . . . . . . . . 89--94
A. B. Frielink The auditor and electronic data
processing . . . . . . . . . . . . . . . 95--97
J. M. Forbes An introduction to compiler writing . . 98--102
M. Klerer and
J. May A user oriented programming language . . 103--109
C. B. Jones A special-purpose compiler . . . . . . . 109--112
J. G. P. Barnes A KDF9 ALGOL list-processing scheme . . 113--119
D. M. Foster A simple list-processing interpreter . . 120--129
C. D. Lewis Iterative analogue computation applied
to inventory policy simulation . . . . . 130--135
E. D. Barraclough The application of a digital computer to
the construction of timetables . . . . . 136--146
A. Rachman Computation of rotational energy levels
of rigid asymmetric top molecules . . . 147--149
M. R. Osborne Direct methods for the solution of
finite-difference approximations to
separable partial differential equations 150--156
L. A. Edelstein Note on analytic angular integrations
using series in Legendre polynomials . . 157--158
I. Erdelyi On speeding convergence of an iterative
eigenvalue process . . . . . . . . . . . 159--165
W. A. Murray and
M. S. Lynn A computer-oriented description of the
Peaceman-Rachford ADI method . . . . . . 166--175
Bryan Higman and
W. F. Lunnon and
C. F. J. Outred and
C. Strachey Correspondence: An impossible program 175--176
G. J. Cooper and
E. Gal Correspondence: Integration of
differential equations . . . . . . . . . 176--176
S. Gill Automatic computing: its problems and
prizes . . . . . . . . . . . . . . . . . 177--189
M. L. V. Pitteway The organization of a data link
computing service . . . . . . . . . . . 190--200
B. L. Neff Do-it-yourself software experience . . . 201--207
J. Bauldreay Correspondence: character recognition 207--207
R. M. Paine The gradual acceptance of a variety of
commercial English languages . . . . . . 208--215
B. E. Boutel and
C. Strachey and
J. H. G. Phillips and
Michael Irish Correspondence: An impossible program 215--215
E. J. Langham The underground storage of compressed
air for gas turbines: a dynamic study on
an analogue computer . . . . . . . . . . 216--224
Roger H. Moore and
R. H. Rosenbrock Correspondence: On the Rosenbrock
function . . . . . . . . . . . . . . . . 224--224
C. Strachey A general purpose macrogenerator . . . . 225--241
E. W. Elcock Note on the addressing of lists by their
source-language names . . . . . . . . . 242--243
J. Nievergelt Fixed versus selfmodifying programs . . 244--245
G. N. Lance and
W. T. Williams Computer programs for monothetic
classification (`Association analysis') 246--249
R. J. Dakin A Tree Search Algorithm for Mixed
Integer Programming Problems . . . . . . 250--255
E. J. Martin, Jr. and
P. C. Patton Evaluation of certain definite integrals
frequently encountered in radiational
and diffraction problems involving
circular geometry . . . . . . . . . . . 256--263
G. G. Alway and
D. W. Martin An algorithm for reducing the bandwidth
of a matrix of symmetrical configuration 264--272
J. H. Wilkinson The Calculation of Lam\'e Polynomials 273--277
J. D. Beasley A note on the arrangement of Chebyshev
series . . . . . . . . . . . . . . . . . 278--279
H. E. Fettis Note on the matrix equation $Ax =
\lambda Bx$ . . . . . . . . . . . . . . 279--279
D. J. Evans A stable explicit method for the
finite-difference solution of a
fourth-order parabolic partial
differential equation . . . . . . . . . 280--287
C. G. Chezem Note on `three-dimensional' plotting as
a technique for finding the zeros of
functions in the complex plane . . . . . 288--288
C. J. C. McOustra Legal protection for computer programs 289--296
D. Burns and
E. N. Hawkins and
D. R. Judd and
J. L. Venn The Egdon system for the KDF9 . . . . . 297--302
R. A. Brooker and
J. S. Rohl and
S. R. Clark The main features of Atlas Autocode . . 303--310
E. Humby and
P. Shackleton and
R. M. Paine Correspondence: Commercial English
languages . . . . . . . . . . . . . . . 310--311
A. J. B. Anderson A note on the construction of a general
survey program in Extended Mercury
Autocode . . . . . . . . . . . . . . . . 312--314
J. M. Craddock Programming systems for use in research
computation . . . . . . . . . . . . . . 315--318
P. Giles Some considerations regarding
arrangement of records on magnetic tape 319--322
D. B. G. Edwards and
D. Aspinal and
R. Lane Addressing magnetic tape on the Atlas 1
computing machine . . . . . . . . . . . 323--329
H. G. ApSimon and
W. D. Maurer and
P. J. H. King and
C. H. R. Morris Correspondence: An impossible program 329--330
M. Almond An algorithm for constructing University
timetables . . . . . . . . . . . . . . . 331--340
B. Meltzer Theorem-proving for computers: some
results on resolution and renaming . . . 341--343
A. J. Akeroyd An application of separable programming 344--346
J. Dollimore A general Fourier synthesis program for
the London University Atlas computer . . 347--351
P. Constantinescu The classification of a set of elements
with respect to a set of properties . . 352--357
A. R. Curtis and
M. J. D. Powell Necessary conditions for a minimax
approximation . . . . . . . . . . . . . 358--361
H. C. Thacher, Jr. Closed rational integration formulas . . 362--367
B. Meister On a family of cubature formulae . . . . 368--371
W. Kizner Error curves for Lanczos' `selected
points' method . . . . . . . . . . . . . 372--382
P. H. A. Sneath A method for curve seeking from
scattered points . . . . . . . . . . . . 383--391
W. Charles Mylander Correspondence: Nonlinear programming
test problems . . . . . . . . . . . . . 391--391
B. T. Allen A new method of solving second-order
differential equations when the first
derivative is present . . . . . . . . . 392--394
A. C. Smith A lower estimate of the cumulative
truncation error in Milne's method . . . 395--397
P. Jarratt Multipoint iterative methods for solving
certain equations . . . . . . . . . . . 398--400
F. I. Musk One man's meat: part I --- The uses of
adversity . . . . . . . . . . . . . . . 1--2
T. K. Craig CRESTS --- Courtauld's rapid extract,
sort and tabulate system . . . . . . . . 3--10
L. J. Slater Computing the state of the economy . . . 11--15
G. R. Fair and
A. D. J. Flowerdew and
W. G. Munro and
D. Rowley Note on the computer as an aid to the
architect . . . . . . . . . . . . . . . 16--20
W. M. Newman An experimental program for
architectural design . . . . . . . . . . 21--26
A. J. Cole Plane and stereographic projections of
convex polyhedra from minimal
information . . . . . . . . . . . . . . 27--31
F. H. George Computer assisted instruction . . . . . 32--34
F. M. Hughes and
A. Brameller Digital simulation of analogue methods 35--44
D. C. Cooper The equivalence of a certain
computations . . . . . . . . . . . . . . 45--52
J. P. Penny An analysis, both theoretical and by
simulation, of a time-shared computer
system . . . . . . . . . . . . . . . . . 53--59
G. N. Lance and
W. T. Williams Computer programs for hierarchical
polythetic classification (`similarity
analyses') . . . . . . . . . . . . . . . 60--64
E. L. Jones Note on an alternate method for the
computation of rotational energy levels
of rigid asymmetric top molecules . . . 65--66
M. J. Box A comparison of several current
optimization methods, and the use of
transformations in constrained problems 67--77
A. R. Curtis and
M. J. D. Powell On the convergence of exchange
algorithms for calculating minimax
approximations . . . . . . . . . . . . . 78--80
P. Hammersley Notice: Future publication of Algorithms
Supplement . . . . . . . . . . . . . . . 80--80
J. T. Day A Runge-Kutta method for the numerical
solution of the Goursat problem in
hyperbolic partial differential
equations . . . . . . . . . . . . . . . 81--83
B. A. Carre The partitioning of network equations
for block iteration . . . . . . . . . . 84--97
A. J. Fox and
F. A. Johnson On finding the eigenvalues of real
symmetric tridiagonal matrices . . . . . 98--105
A. Wragg The use of Lanczos $\tau$-methods in the
numerical solution of a Stefan problem 106--109
P. Keast and
A. R. Mitchell On the instability of the Crank
Nicholson formula under derivative
boundary conditions . . . . . . . . . . 110--114
K. Wright Correspondence: On ``Error curves for
Lanczos `selected points' method'' . . . 115--115
D. J. Evans Correspondence: On ``A stable explicit
method for the finite-difference
solution of a fourth-order parabolic
partial differential equation'' . . . . 115--115
M. J. Box Correspondence: On ``Nonlinear
programming test problems'' . . . . . . 115--116
E. J. Martin, Jr. and
P. C. Patton Erratum: ``Evaluation of certain
definite integrals frequently
encountered in radiational and
diffraction problems involving circular
geometry'' . . . . . . . . . . . . . . . 116--116
B. de Ferranti The human brain . . . . . . . . . . . . 117--123
C. B. B. Grindley Systematics --- a non-programming
language for designing and specifying
commercial systems for computers . . . . 124--128
H. D. Baecker Correspondence: On ``An analysis, both
theoretical and by simulation, of a
time-shared computer system'' . . . . . 128--128
C. V. D. Forrington An application-oriented computer
approach to inventory control problems.
Part 1: Facilities of the system . . . . 129--136
J. N. Buxton Writing simulations in CSL . . . . . . . 137--143
A. G. Fraser and
J. D. Smart The COMPL language and operating system 144--156
J. T. Ryan A direction-independent algorithm for
determining the forward and backward
compute point for a term or subscript
during compilation . . . . . . . . . . . 157--160
M. R. Wetherfield A technique for program monitoring by
interruption . . . . . . . . . . . . . . 161--166
R. W. L. Trundle LITHP --- an ALGOL list processor . . . 167--172
P. Hammersley A note on the implementation of LITHP on
the I.C.T. 1905 . . . . . . . . . . . . 173--174
S. R. Clark and
W. F. Lunnon Correspondence: Multiple precision
arithmetic (real and complex) . . . . . 174--174
Paul A. Samet Correspondence: On ``The Egdon system
for the KDF9'' . . . . . . . . . . . . . 174--174
M. M. Baum and
R. G. Blake and
R. J. Smale Use of digital analogue simulator (DAS) 175--180
J. L. Dineley and
C. Preece KALDAS, an algorithmically based digital
simulation of analogue computation . . . 181--187
J. C. P. Miller and
D. J. Spencer Brown An algorithm for evaluation of remote
terms in a linear recurrence sequence 188--190
K. Wright Series methods for integration . . . . . 191--199
J. K. Reid A method for finding the optimum
successive over-relaxation parameter . . 200--204
B. T. Allen An investigation into direct numerical
methods for solving some calculus of
variations problems. Part 1 --- Second
order methods . . . . . . . . . . . . . 205--210
B. J. Duke Correspondence: On the computation of
rotational levels of rigid asymmetric
top molecules . . . . . . . . . . . . . 210--210
F. I. Musk One man's meat: part 2 --- Now let's
pretend . . . . . . . . . . . . . . . . 213--214
A. T. Clementson Extended control and simulation language 215--220
R. M. Paine Preparation for optical character
recognition . . . . . . . . . . . . . . 221--229
D. A. Burbridge and
A. Robert Brown and
A. d'Agapeyeff and
F. G. Duncan Correspondence: Systematics . . . . . . 229--229, 237--237
N. Smith Systems analysis problems encountered
during a large computer application . . 230--237
A. J. T. Colin A simple program for use in the
`conversational mode' . . . . . . . . . 238--241
R. F. Rosin An approach to executive system
maintenance in disk-based systems . . . 242--247
D. W. Barron Correspondence: On ``The Egdon system
for the KDF9'' . . . . . . . . . . . . . 247--247
M. O'Halloran and
W. M. Waite Note on rapid instruction analysis by
table lookup . . . . . . . . . . . . . . 248--248
J. Cohen and
X. Nguyen-Dinh Note on ordering of grammar rules in
syntax-analyzers . . . . . . . . . . . . 250--251
R. E. Berry Grader programs . . . . . . . . . . . . 252--256
P. M. Woodward The synthesis of music and speech . . . 257--262
R. M. Burstall Computer design of electricity supply
networks by a heuristic method . . . . . 263--274
T. A. J. Nicholson Finding the shortest route between two
points in a network . . . . . . . . . . 275--280
A. Jennings A compact storage scheme for the
solution of symmetric linear
simultaneous equations . . . . . . . . . 281--285
A. Curtis and
M. R. Osborne The construction of minimax rational
approximations to functions . . . . . . 286--293
J. Lindley and
A. Wragg The numerical solution of sequential
decision problems involving parabolic
equations with moving boundaries . . . . 294--297
G. Fairweather and
A. R. Mitchell Some computational results of an
improved A.D.I. method for the Dirichlet
problem . . . . . . . . . . . . . . . . 298--303
P. Jarratt A rational iteration function for
solving equations . . . . . . . . . . . 304--307
A. I. Abdel Karim Stability of the fourth order
Runge-Kutta method for the solution of
systems of differential equations . . . 308--311
D. Mayne An algorithm for the calculation of the
pseudo-inverse of a singular matrix . . 312--317
I. Barrodale and
A. Young A note on numerical procedures for
approximation by spline functions . . . 318--320
A. d'Agapeyeff and
F. G. Duncan Correspondence: On the stability of
Crank and Nicholson's procedure . . . . 320--320, 324--324
C. V. D. Forrington and
S. M. Grey and
M. M. Reid An application-oriented computer
approach to inventory control problems.
Part 2: Implementation and operational
experience . . . . . . . . . . . . . . . 325--329
S. H. Lavington and
L. E. Rosenthal Some facilities for speech processing by
computer . . . . . . . . . . . . . . . . 330--339
D. Barton A scheme for manipulative algebra on a
computer . . . . . . . . . . . . . . . . 340--344
R. A. Brooker and
D. Morris and
J. S. Rohl Experience with the compiler compiler 345--349
R. A. Brooker and
D. Morris and
J. S. Rohl Compiler Compiler facilities in Atlas
Autocode . . . . . . . . . . . . . . . . 350--352
A. T. McEwan An Atlas Autocode to ALGOL 60 translator 353--359
F. R. A. Hopgood and
A. G. Bell The Atlas ALGOL preprocessor for
non-standard dialects . . . . . . . . . 360--364
J. B. Hext Compile-time type-matching . . . . . . . 365--369
A. T. Clementson An assembly and loading system for
computers with parallel peripheral
operation . . . . . . . . . . . . . . . 370--372
G. N. Lance and
W. T. Williams A general theory of classificatory
sorting strategies 1. Hierarchical
systems . . . . . . . . . . . . . . . . 373--380
G. N. Lance and
W. T. Williams Note on the classification of
multi-level data . . . . . . . . . . . . 381--382
K. M. Howell Multiple precision arithmetic techniques 383--387
N. R. Morgenstern and
V. E. Price A numerical method for solving the
equations of stability of general slip
surfaces . . . . . . . . . . . . . . . . 388--393
G. H. Tee Correspondence: On coding values of
mathematical constants . . . . . . . . . 393--393
J. T. Day Note on the numerical solution of
integro-differential equations . . . . . 394--395
M. D. Stern Optimal quadrature formulae . . . . . . 396--403
H. W. Pakes Correspondence: On ``An investigation
into direct numerical methods for
solving some calculus of variations
problems'' . . . . . . . . . . . . . . . 403--403
M. J. D. Powell On the maximum errors of polynomial
approximations defined by interpolation
and by least squares criteria . . . . . 404--407
P. Jarratt A note on the asymptotic error constant
of a certain method for solving
equations . . . . . . . . . . . . . . . 408--409
G. Hall The stability of predictor-corrector
methods . . . . . . . . . . . . . . . . 410--412
M. M. Chawla A note on the estimation of the
coefficients in the Chebyshev series
expansion of a function having a
logarithmic singularity . . . . . . . . 413--413
P. Hammersley Algorithms supplement: Previously
published algorithms . . . . . . . . . . 414--414
K. J. Overholt Note on Algorithm 2: Fibonacci search 414--414
K. J. Overholt Algorithm 16: GOLD . . . . . . . . . . . 415--415
K. J. Overholt Algorithm 17: GOLDSEC . . . . . . . . . 415--415
J. Boothroyd Algorithm 18: SUMFAC . . . . . . . . . . 416--416
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
M. V. Wilkes The design of multiple-access computer
systems . . . . . . . . . . . . . . . . 1--9
H. G. M. Pullen and
M. H. J. Webb A computer application to a transport
scheduling problem . . . . . . . . . . . 10--13
J. Lions The Ontario school scheduling program 14--21
D. J. Harris and
A. K. Kent The computer as an aid to lawyers . . . 22--28
K. Sparck Jones and
D. Jackson Current approaches to classification and
clump-finding at the Cambridge Language
Research Unit . . . . . . . . . . . . . 29--37
J. C. Matthewman The crystallographers' friend . . . . . 38--45
C. S. E. Phillips Networks for real-time programming . . . 46--52
L. Lukaszewicz EOL --- a symbol manipulation language 53--59
R. A. Brooker and
S. R. Clark An index directed compiler . . . . . . . 60--63
C. S. Wallace and
B. G. Rowswell Competition for memory access in the
KDF9 . . . . . . . . . . . . . . . . . . 64--68
H. T. Burley A programming language for linear
algebra . . . . . . . . . . . . . . . . 69--73
D. Y. Downham and
F. D. K. Roberts Multiplicative congruential
pseudo-random number generators . . . . 74--77
F. H. Deist and
L. Sefor Solution of systems of non-linear
equations by parameter variation . . . . 78--82
P. Jarratt An Iterative Method for Locating Turning
Points . . . . . . . . . . . . . . . . . 82--84
D. J. A. Welsh and
M. B. Powell An upper bound for the chromatic number
of a graph and its application to
timetabling problems . . . . . . . . . . 85--86
L. Fox Romberg integration for a class of
singular integrands . . . . . . . . . . 87--93
G. J. Cooper The evaluation of the coefficients in
the Chebyshev expansion . . . . . . . . 94--100
M. K. Jain and
K. D. Sharma Numerical solution of linear
differential equations and Volterra's
integral equation using Lobatto
quadrature formula . . . . . . . . . . . 101--107
J. A. T. Bye A new method of determining eigenvalues
and eigenfunctions . . . . . . . . . . . 108--111
P. Hammersley Algorithms supplement: Previously
published algorithms . . . . . . . . . . 112--112
B. H. Rudall Algorithm 19: Complex . . . . . . . . . 112--113
I. D. Hill and
S. A. Joyce and
A. Bergson and
P. Hammersley Note on Algorithm 13: normalarea . . . . 113--115
P. J. H. King Discussion and correspondence: some
comments on systematics . . . . . . . . 116--119
J. W. Grady The National Giro . . . . . . . . . . . 121--125
F. I. Musk One man's meat: part 3 --- It's all good
grist that comes to our mill . . . . . . 126--127
W. O'Brien COSMOS --- Courtauld's own system for
matrix operations and statistics . . . . 128--134
P. J. H. King Decision tables . . . . . . . . . . . . 135--142
R. H. Hiorns Seasonal adjustment and forecasting in
the presence of trend . . . . . . . . . 143--149
L. Rowell Huesmann and
R. P. Goldberg Evaluating computer systems through
simulation . . . . . . . . . . . . . . . 150--156
J. C. Ranyard and
A. Wren The optimum arrangement of towers in an
electric power transmission line . . . . 157--161
B. K. Haddon and
W. M. Waite A compaction procedure for
variable-length storage elements . . . . 162--165
A. G. Fraser Data compression and automatic
programming . . . . . . . . . . . . . . 165--167
C. L. Hamblin An algorithm for polynomial operations 168--171
M. R. Osborne and
G. A. Watson On the best linear Chebyshev
approximation . . . . . . . . . . . . . 172--177
F. M. Larkin Some techniques for rational
interpolation . . . . . . . . . . . . . 178--187
J. K. Reid A note on the least squares solutions of
a band system of linear equations by
Householder reductions . . . . . . . . . 188--189
A. Nathan and
R. K. Even The inversion of sparse matrices by a
strategy derived from their graphs . . . 190--194
E. J. Davison A high-order Crank-Nicholson technique
for solving differential equations . . . 195--197
D. Greenspan A numerical approach to biharmonic
problems . . . . . . . . . . . . . . . . 198--201
G. M. Phillips Numerical integration in two and three
dimensions . . . . . . . . . . . . . . . 202--204
H. Tompa Gaussian numerical integration of a
function depending on a parameter . . . 204--205
P. Hammersley Algorithms supplement: Previously
published algorithms . . . . . . . . . . 206--206
J. Boothroyd Algorithm 20: Permutations of the Rows
or Columns of a Matrix . . . . . . . . . 206--207
J. M. Watt Algorithm 21: Solution of the Polynomial
Equation Using the Method of Bairstow 207--208
B. H. Rudall Note on Algorithm 19: Complex . . . . . 208--209
I. D. Hill Correspondence: On ``Efficiency of
computer use should not be a
consideration'' . . . . . . . . . . . . 209--209
P. Hammersley Statement of Policy . . . . . . . . . . 209--210
Various Discussion and correspondence: One-day
symposium on PL/1 held at National
Physical Laboratory, 18 May 1967 . . . . 211--215
Bryan Higman Correspondence: Paging and Segmentation 216--216
I. D. Craddock Correspondence: On analogue computers 217--217
A. J. Cole Correspondence: Chromatic numbers and
timetabling problems . . . . . . . . . . 217--217
J. N. G. Brittan The nature and structure of man-computer
communication in team control systems 219--226
D. Morris and
J. S. Rohl The Atlas compiler system . . . . . . . 227--230
R. B. E. Napper Some proposals for SNAP, a language with
formal macro facilities . . . . . . . . 231--243
C. M. Reeves Description of a syntax-directed
translator . . . . . . . . . . . . . . . 244--255
J. R. Ullmann Algebraic inference of pattern
similarity . . . . . . . . . . . . . . . 256--264
L. E. Rosenthal Analytic algebraic manipulation . . . . 265--270
G. N. Lance and
W. T. Williams A general theory of classificatory
sorting strategies II. Clustering
systems . . . . . . . . . . . . . . . . 271--277
W. E. Howden A program for the construction of PERT
flow charts . . . . . . . . . . . . . . 278--281
M. L. V. Pitteway Algorithm for drawing ellipses or
hyperbolae with a digital plotter . . . 282--289
A. K. Obruca Correspondence between two types of
trees . . . . . . . . . . . . . . . . . 290--292
W. I. Zangwill Minimizing a function without
calculating derivatives . . . . . . . . 293--296
G. M. Phillips Numerical integration over an
$N$-dimensional rectangular region . . . 297--299
R. P. Tewarson Row-column permutation of sparse
matrices . . . . . . . . . . . . . . . . 300--305
P. Hammersley Algorithms supplement: Previously
published algorithms . . . . . . . . . . 306--306
J. Boothroyd Algorithms: Author's note on Algorithms
22, 23, 24 . . . . . . . . . . . . . . . 306--306
J. Boothroyd Algorithm 22: Shortest path between
start node and end node of a network . . 306--307
J. Boothroyd Algorithm 23: Shortest path between
start node and all other nodes of a
network . . . . . . . . . . . . . . . . 307--308
J. Boothroyd Algorithm 24: The list of nodes on the
shortest path from start node to end
node of a network . . . . . . . . . . . 308--308
J. Boothroyd Algorithms: Author's note on Algorithms
25, 26, 27 . . . . . . . . . . . . . . . 308--308
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
J. Boothroyd Algorithm 27: Rearrange the elements of
an array section according to a
permutation of the subscripts . . . . . 310--310
J. Boothroyd Algorithms: Author's note on Algorithms
28, 29, 30 . . . . . . . . . . . . . . . 310--310
J. Boothroyd Algorithm 28: Permutations of the
elements of a vector in lexicographic
order . . . . . . . . . . . . . . . . . 311--311
J. Boothroyd Algorithm 29: Permutation of the
elements of a vector . . . . . . . . . . 311--311
J. Boothroyd Algorithm 30: Fast permutation of the
elements of a vector . . . . . . . . . . 311--312
E. L. Willey Discussion and correspondence: an
established U.K. software development 313--314
M. V. Wilkes and
R. M. Needham The design of multiple-access computer
systems: part 2 . . . . . . . . . . . . 315--320
R. Milner String handling in ALGOL . . . . . . . . 321--324
E. Foxley and
P. King The implementation of syntax analysis
using ALGOL, and some mathematical
applications . . . . . . . . . . . . . . 325--335
J. S. Rohl A note on Backus Naur Form . . . . . . . 336--337
N. E. Wiseman and
J. O. Hiles A ring structure processor for a small
computer . . . . . . . . . . . . . . . . 338--346
G. Mitra and
K. Wolfenden A computer technique for optimizing the
sites and heights of transmission line
towers --- a dynamic programming
approach . . . . . . . . . . . . . . . . 347--351
K. G. Beauchamp The simulation of wave filters having
polynomial transfer functions on an
analogue computer . . . . . . . . . . . 352--359
A. P. Yule Extensions to the heuristic algorithm
for University timetables . . . . . . . 360--364
P. D. Groves Marking and evaluating class tests and
examinations by computer . . . . . . . . 365--367
J. F. Temperly and
B. W. Smith A grading procedure for PL/1 student
exercises . . . . . . . . . . . . . . . 368--373
A. K. Obruca Spanning tree manipulation and the
travelling salesman problem . . . . . . 374--377
A. R. Gourlay The acceleration of the
Peaceman-Rachford method by Chebyshev
polynomials . . . . . . . . . . . . . . 378--382
M. R. Osborne and
G. A. Watson Note on two methods of solving ordinary
linear differential equations . . . . . 383--384
Z. Bohte Numerical solution of the inverse
algebraic eigenvalue problem . . . . . . 385--388
R. Taylor Correspondence: Orion FORTRAN compiler 388--388
L. M. Delves The numerical evaluation of principal
value integrals . . . . . . . . . . . . 389--391
R. Fletcher Generalized Inverse Methods for the Best
Least Squares Solution of Systems of
Non-Linear Equations . . . . . . . . . . 392--399
T. J. Randall A note on the estimation of the optimum
successive overrelaxation parameter for
Laplace's equation . . . . . . . . . . . 400--401
S. H. Storey The convergence of Fourier-Bessel
expansions . . . . . . . . . . . . . . . 402--405
W. C. Davidon Variance algorithm for minimization . . 406--410
R. P. Tewarson A computational method for evaluating
generalized inverses . . . . . . . . . . 411--413
P. Hammersley Algorithms supplement: Previously
published algorithms . . . . . . . . . . 414--414
J. Boothroyd Algorithm 31: Complex Fourier Series . . 414--416
J. A. Guin Discussion and correspondence:
modification of the complex method of
constrained optimization . . . . . . . . 416--417
I. J. Good Correspondence: Gödel's theorem . . . . . 417--417
W. E. Thomson Correspondence: Solution of linear
differential equation . . . . . . . . . 417--418
H. W. G. Management information systems . . . . . 418--418
C. H. Hunt and
M. M. Ryder and
S. H. Storey Computers and the small firm: 1 . . . . 1--4
P. C. Poole and
T. Lang The development of on-line computing
facilities for the KDF9 part 1; COSEC
--- a single on-line console . . . . . . 5--11
A. G. Fraser User control in a multi-access system 12--16
D. C. Knight An algorithm for scheduling storage on a
non-paged computer . . . . . . . . . . . 17--21
M. Finkelstein A compiler optimization technique . . . 22--25
G. F. Coulouris and
T. J. Goodey and
R. W. Hill and
R. W. Keeling and
D. Levin The London CPL1 compiler . . . . . . . . 26--30
J. M. Foster A syntax improving program . . . . . . . 31--34
J. G. Laski Segmentation and virtual address
topology --- an essay in virtual
research . . . . . . . . . . . . . . . . 35--40
D. C. Wood A system for computing university
examination timetables . . . . . . . . . 41--47
T. A. J. Nicholson and
R. D. Pullen A permutation procedure for job-shop
scheduling . . . . . . . . . . . . . . . 48--56
M. J. Shepherd and
A. J. Willmott Cluster analysis on the Atlas computer 57--62
W. M. Newman A graphical technique for numerical
input . . . . . . . . . . . . . . . . . 63--64
I. Aleksander and
R. C. Albrow Adaptive logic circuits . . . . . . . . 65--71
J. L. Riley and
P. H. Walker Generation of time delays on analogue
computers . . . . . . . . . . . . . . . 72--76
J. M. Watt Convergence and stability of
discretization methods for functional
equations . . . . . . . . . . . . . . . 77--82
P. Jarratt and
C. Mack A least squares method for Laplace's
equation with Dirichlet boundary
conditions . . . . . . . . . . . . . . . 83--87
G. R. Garside and
P. Jarratt and
C. Mack A new method for solving polynomial
equations . . . . . . . . . . . . . . . 87--90
G. Loizou An empirical estimate of the relative
error of the computed solution x of Ax=b 91--94
A. R. Gourlay and
J. L. l. Morris Deferred approach to the limit in
non-linear hyperbolic systems . . . . . 95--101
R. Cranley and
T. N. L. Patterson The evaluation of multidimensional
integrals . . . . . . . . . . . . . . . 102--110
G. M. Phillips Estimate of the maximum error in best
polynomial approximations . . . . . . . 110--111
P. Hammersley Algorithms supplement: Previously
published algorithms . . . . . . . . . . 112--112
J. Grad and
K. A. Redish and
M. A. Brebner Algorithm 32: Calculation of eigenvalues
of real matrices by the $QR$ method
using double $QR$ step . . . . . . . . . 112--114
H. Späth Algorithm 33: Fitting data to an
exponential with a straight line as
background . . . . . . . . . . . . . . . 114--115
J. Boothroyd Special note on Algorithm 31. Complex
Fourier Analysis . . . . . . . . . . . . 115--115
R. F. Churchhouse Discussion and correspondence: note on
the twenty-five most cited papers in
some leading journals . . . . . . . . . 116--120
B. Smith SPECOL --- a computer enquiry language
for the non-programmer . . . . . . . . . 121--127
C. B. B. Grindley The use of decision tables within
systematics . . . . . . . . . . . . . . 128--133
C. C. Foster Sorting almost ordered arrays . . . . . 134--137
F. O'Brien and
R. C. Beckwith A technique for computer flow chart
generation . . . . . . . . . . . . . . . 138--140
N. E. Wiseman A note on compiling display file from a
data structure . . . . . . . . . . . . . 141--147
W. M. Turski SODA --- a dual activity operating
system . . . . . . . . . . . . . . . . . 148--156
B. E. Cooper Basic subroutine for the input of
numbers, words and special characters 157--159
A. Gibbons K Autocode . . . . . . . . . . . . . . . 160--168
M. J. R. Healy Towards FORTRAN VI? . . . . . . . . . . 169--172
W. E. Thomson Correspondence: Generation of time
delays on analogue computers . . . . . . 172--172
H. P. Williams The synthesis of logical nets consisting
of NOR units . . . . . . . . . . . . . . 173--176
N. Jardine and
R. Sibson The construction of hierarchic and
non-hierarchic classifications . . . . . 177--184
C. S. Wallace and
D. M. Boulton An Information Measure for
Classification . . . . . . . . . . . . . 185--194
J. P. O'Brien Correspondence: On ``A new method for
solving polynomial equations'' . . . . . 194--194
G. N. Lance and
W. T. Williams Note on a new information-statistic
classificatory program . . . . . . . . . 195--195
L. G. Noronha and
C. Y. Po and
J. W. Womack Hybrid computation of the dynamics of a
distributed system . . . . . . . . . . . 196--205
W. G. Bickley Piecewise cubic interpolation and
two-point boundary problems . . . . . . 206--208
T. Ashby A modification to Paulson's
approximation to the variance ratio
distribution . . . . . . . . . . . . . . 209--210
G. M. Phillips Algorithms for piecewise straight line
approximations . . . . . . . . . . . . . 211--212
H. O'Hara and
F. J. Smith Error estimation in the Clenshaw-Curtis
quadrature formula . . . . . . . . . . . 213--219
C. F. Price An offset vector iteration method for
solving two-point boundary-value
problems . . . . . . . . . . . . . . . . 220--228
A. H. J. Sale The calculation of $e$ to many
significant digits . . . . . . . . . . . 229--230
Various Algorithms supplement . . . . . . . . . 231--235
P. A. Samet Discussion and correspondence: software
requirements of universities . . . . . . 236--240
Uwe Pape Correspondence: On ``Some computational
notes on the shortest route problems'' 240--240
P. S. Davison and
P. Giles and
D. A. R. Matthews Ageing of magnetic tape: A critical
bibliography and comparison of
literature sources . . . . . . . . . . . 241--246
D. F. Hartley and
B. Landy and
R. M. Needham The structure of a multiprogramming
supervisor . . . . . . . . . . . . . . . 247--255
J. Larmouth and
C. Whitby-Strevens MLS --- the Titan mixed language system 256--259
M. V. Wilkes The outer and inner syntax of a
programming language . . . . . . . . . . 260--263
E. Foxley and
K. Lockyer The construction of examination
timetables by computer . . . . . . . . . 264--268
D. F. Barnard and
D. F. Holman The use of Roth's decomposition
algorithm in multi-level design of
circuits . . . . . . . . . . . . . . . . 269--276
S. L. Hurst An extension of binary minimisation
techniques to ternary equations . . . . 277--286
P. A. V. Hall Pattern classification as interpolation
in N dimensions . . . . . . . . . . . . 287--292
D. Barton and
S. R. Bourne and
C. J. Burgess A simple algebra system . . . . . . . . 293--298
W. E. Howden The sofa problem . . . . . . . . . . . . 299--301
M. J. D. Powell On the Calculation of Orthogonal Vectors 302--304
G. J. Makinson Stable high order implicit methods for
the numerical solution of systems of
differential equations . . . . . . . . . 305--310
D. B. Hunter Neville's method for trigonometric
interpolation . . . . . . . . . . . . . 311--313
P. Jarratt The Use of Comparison Series in
Analysing Iteration Functions . . . . . 314--316
G. M. Birtwistle The explicit solution of the equation of
heat conduction . . . . . . . . . . . . 317--323
A. Hadjidimos On a generalised alternating direction
implicit method for solving Laplace's
equation . . . . . . . . . . . . . . . . 324--328
T. Lloyd and
H. McCallion Bounds for the optimum over-relaxation
factor for the S.O.R. solution of
Laplace type equations over irregular
regions . . . . . . . . . . . . . . . . 329--331
T. J. Randall Note on a general finite-difference
formula for the solution of axially
symmetric fields . . . . . . . . . . . . 332--333
M. A. Wolfe and
G. M. Phillips Some methods for the solution of
non-singular Volterra
integro-differential equations . . . . . 334--336
T. J. Rivlin Polynomial approximation and the
$\tau$-method . . . . . . . . . . . . . 337--338
M. M. Chawla Asymptotic estimates for the error of
the Gauss-Legendre quadrature formula 339--340
J. C. P. Miller and
M. J. Prentice Additive congruential pseudo-random
number generators . . . . . . . . . . . 341--346
P. Hammersley Algorithms supplement: Previously
published algorithms . . . . . . . . . . 347--347
R. J. Prescott Algorithm 35: Best rational
approximation to a real number . . . . . 347--348
G. J. Makinson Algorithm 36: Evaluation of the complex
arcsin . . . . . . . . . . . . . . . . . 348--350
David P. Owen and
John Laski Correspondence: An argument against
paging hardware . . . . . . . . . . . . 351--351
Eric W. Solomon Correspondence: Basic data input
routines . . . . . . . . . . . . . . . . 352--352
A. G. Fraser Integrity of a Mass Storage Filing
System . . . . . . . . . . . . . . . . . 1--5
P. J. H. King Systems Analysis Documentation:
Computer-Aided Data Dictionary
Definition . . . . . . . . . . . . . . . 6--9
D. G. R. Buckle and
C. H. Hunt and
Maureen M. Ryder and
S. H. Storey Computers and the small firm. 2 . . . . 10--14
R. J. W. Housden The definition and implementation of \sc
Lsix in BCL . . . . . . . . . . . . . . 15--23
P. T. Cameron A language for chemical plant design and
simulation programs . . . . . . . . . . 24--28
A. J. Lerner Formal methods of diagnosis in
engineering and medicine . . . . . . . . 29--32
O. W. Rechard and
R. H. Stark Equivalence of two algorithms for
Cooper's generalised factorial function 33--37
D. Nudds Methods of computing event times in
project networks . . . . . . . . . . . . 38--40
Rod M. Burstall Proving Properties of Programs by
Structural Induction . . . . . . . . . . 41--48
R. M. Burstall A program for solving word sum puzzles 48--51
M. O'Neill and
I. G. Sinclair and
F. J. Smith Polynomial curve fitting when abscissas
and ordinates are both subject to error 52--56
J. Oliver An error estimation technique for the
solution of ordinary differential
equations in Chebyshev series . . . . . 57--62
M. R. Osborne and
G. A. Watson An algorithm for minimax approximation
in the nonlinear case . . . . . . . . . 63--68
J. R. Palmer An improved procedure for
orthogonalising the search vectors in
Rosenbrock's and Swann's direct search
optimisation methods . . . . . . . . . . 69--71
A. J. Cole and
A. J. T. Davie Local smoothing by polynomials in n
dimensions . . . . . . . . . . . . . . . 72--76
R. P. Tewarson Projection Methods for Solving Sparse
Linear Systems . . . . . . . . . . . . . 77--80
H. H. Robertson and
M. J. McCann A note on the numerical integration of
conservative systems of first-order
ordinary differential equations . . . . 81--81
M. R. Osborne The numerical solution of the heat
conduction equation subject to separated
boundary conditions . . . . . . . . . . 82--87
D. Greenspan Numerical studies of prototype cavity
flow problems . . . . . . . . . . . . . 88--93
C. G. Broyden A New Method of Solving Nonlinear
Simultaneous Equations . . . . . . . . . 94--99
C. N. J. Tily Algorithm 37: Fitting data to an
exponentially damped linear function . . 100--101
A. C. Day Algorithm 38: A searching algorithm . . 101--102
P. Hammersley Note on Algorithm 34: Procedures for the
Basic Arithmetical Operations in
Multi-Length Working . . . . . . . . . . 102--103
D. W. Barron Discussion and correspondence: a note on
program debugging in an on-line
environment . . . . . . . . . . . . . . 104--104
Peter Fellgett Correspondence: What is an analyst? . . 104--104
W. G. Bickley Correspondence: Piecewise cubic
interpolation and two-point boundary
problems . . . . . . . . . . . . . . . . 105--105
Tad Pinkerton and
D. W. Barron Correspondence: Paging . . . . . . . . . 105--105
A. Bergson Correspondence: Note on the calculation
of $e$ to many significant digits . . . 105--105
R. M. Paine O.C.R. --- benefits and pitfalls . . . . 108--113
B. J. Gladwin The utilisation of graphic display units
as the main form of computer input . . . 114--117
M. C. Bonney Some considerations of the cost and
value of information . . . . . . . . . . 118--123
R. A. d'Inverno ALAM --- Atlas Lisp Algebraic
Manipulator . . . . . . . . . . . . . . 124--127
B. Landy and
C. Whitby-Strevens TSAS --- the time-shared supervisor
assembly system . . . . . . . . . . . . 128--131
N. W. Bellamy and
M. J. West Methods of profile optimisation by
iterative analogue computation . . . . . 132--138
D. Wood The normal form theorem --- another
proof . . . . . . . . . . . . . . . . . 139--147
D. G. Hayes A method of storing the orthogonal
polynomials used for curve and surface
fitting . . . . . . . . . . . . . . . . 148--150
E. L. Albasiny and
W. D. Hoskins Cubic spline solutions to two-point
boundary value problems . . . . . . . . 151--153
L. B. Winrich Note on a comparison of evaluation
schemes for the interpolating polynomial 154--155
M. J. Seaton Diagonalisation of complex symmetric
matrices using a modified Jacobi method 156--157
R. P. Tewarson The Crout reduction for sparse matrices 158--159
W. M. Gentleman An error analysis of Goertzel's (Watt's)
method for computing Fourier
coefficients . . . . . . . . . . . . . . 160--164
R. England Error estimates for Runge-Kutta type
solutions to systems of ordinary
differential equations . . . . . . . . . 166--170
J. D. Pearson Variable metric methods of minimisation 171--178
H. O'Hara and
Francis J. Smith The evaluation of definite integrals by
interval subdivision . . . . . . . . . . 179--182
C. F. Haines Implicit integration processes with
error estimate for the numerical
solution of differential equations . . . 183--187
D. J. Fyfe The use of cubic splines in the solution
of two-point boundary value problems . . 188--192
M. A. Wolfe The numerical solution of non-singular
integral and integrodifferential
equations by iteration with Chebyshev
series . . . . . . . . . . . . . . . . . 193--196
P. Hammersley Algorithms supplement: Previously
published algorithms . . . . . . . . . . 197--197
A. G. Adams Algorithm 39: Areas under the normal
curve . . . . . . . . . . . . . . . . . 197--198
H. Späth Algorithm 40: Spline interpolation of
degree three . . . . . . . . . . . . . . 198--199
D. Bruyendonck and
D. Hirschberg Correspondence: Convex differentiable
curves . . . . . . . . . . . . . . . . . 200--200
J. Larmouth and
C. Whitby-Strevens Correspondence: Paging . . . . . . . . . 200--200
A. R. Brown Selling television time: an optimisation
problem . . . . . . . . . . . . . . . . 201--207
P. Giles Mini-COBOL . . . . . . . . . . . . . . . 208--214
M. Almond A University faculty timetable . . . . . 215--217
D. F. Hendry and
P. A. Samet Towards FORTRAN VI? Part 2. FORTRAN in
the modern world . . . . . . . . . . . . 218--220
K. A. Mulholland Software to translate TELCOMP programs
into KDF9ALGOL . . . . . . . . . . . . . 221--224
A. J. Fox and
P. W. Edwards Implementation of a syntax-driven
interpreter for data retrieval . . . . . 225--232
H. R. Simpson A compact form of one-track syntax
analyser . . . . . . . . . . . . . . . . 233--243
P. E. Williams and
D. C. Menzies The Windscale on-line computing system 244--250
J. K. Iliffe Elements of BLM (Basic Language Machine) 251--258
M. A. Marin Synthesis of TANT networks using a
Boolean analyser . . . . . . . . . . . . 259--267
M. J. Savage Junction optimisation technique . . . . 268--272
N. E. Gough and
J. B. A. Epton A general procedure for evaluating the
controllability of time delay feedback
control systems . . . . . . . . . . . . 273--276
M. J. Box and
R. M. Box Computation of the variance ratio
distribution . . . . . . . . . . . . . . 277--278
J. N. Lyness The effect of inadequate convergence
criteria in automatic routines . . . . . 279--281
S. E. El-gendi Chebyshev solution of differential,
integral and integro differential
equations . . . . . . . . . . . . . . . 282--287
M. J. D. Powell A Theorem on Rank One Modifications to a
Matrix and Its Inverse . . . . . . . . . 288--290
P. Hammersley Algorithms supplement: Previously
published algorithms . . . . . . . . . . 291--291
P. J. Le Riche Algorithm 41: A curve plotting procedure 291--292
H. Späth Algorithm 42: Interpolation by certain
quintic splines . . . . . . . . . . . . 292--293
M. L. V. Pitteway and
R. W. Parry Note on Algorithm 35: Best rational
approximation to a real number . . . . . 293--293
S. M. Cobb Note on Algorithm 35: Best rational
approximation to a real number . . . . . 293--295
M. J. O'Carroll Discussion and correspondence: S.O.R.
and membranes . . . . . . . . . . . . . 296--297
P. A. Ongley Examinations by computer . . . . . . . . 297--300
G. S. Marliss and
W. A. Murray William G. Bickley --- an appreciation 301--302
K. Jackson and
J. R. Prior Debugging and assessment of control
programs for an automatic radar . . . . 303--306
N. L. Lawrie An integer linear programming model of a
school timetabling problem . . . . . . . 307--316
D. C. Wood A technique for colouring a graph
applicable to large scale timetabling
problems . . . . . . . . . . . . . . . . 317--319
P. J. H. King The interpretation of limited entry
decision table format and relationships
among conditions . . . . . . . . . . . . 320--326
P. J. Brown Using a macro processor to aid software
implementation . . . . . . . . . . . . . 328--331
R. J. W. Housden A note on list-processing in BCL . . . . 332--341
W. A. Zaremba A syntax for ALGOL input/output formats 342--348
D. Wood The theory of left factored languages:
Part 1 . . . . . . . . . . . . . . . . . 349--356
M. S. Goldman Computer-aided typesetting with a CRT 357--364
P. Sipala Formatting and display of ALGOL
expressions . . . . . . . . . . . . . . 365--367
J. D. Beasley and
K. Wilson Design and testing of the System 4
random number generator . . . . . . . . 368--372
D. Y. Downham The runs up and down test . . . . . . . 373--376
W. F. Lunnon A postage stamp problem . . . . . . . . 377--380
J. L. Byrne and
L. G. Proll Initialising Geoffrion's implicit
enumeration algorithm for the zero-one
linear programming problem . . . . . . . 381--384
P. W. Throsby A finite element approach to surface
definition . . . . . . . . . . . . . . . 385--387
R. P. Tewarson A least squares iterative method for
singular equations . . . . . . . . . . . 388--392
P. Linz Numerical methods for Volterra integral
equations of the first kind . . . . . . 393--397
G. Peters and
J. H. Wilkinson Eigenvalues of $Ax = \lambda Bx$ with
band symmetric $A$ and $B$ . . . . . . . 398--404
P. Hammersley Algorithms supplement: Previously
published algorithms . . . . . . . . . . 405--406
A. D. Woodall Algorithm 43: A listed radix sort . . . 406--406
C. G. Broyden Algorithm 44: Solution of nonlinear
simultaneous equations . . . . . . . . . 406--408
R. S. Scowen Note on Algorithm 40. Spline
interpolation of degree three . . . . . 409--409
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
G. C. Temes Correspondence: Note on ``An algorithm
for minimax approximation in the
nonlinear case'' . . . . . . . . . . . . 410--410
W. P. L. Whitby and
R. M. Paine Correspondence: OCR --- benefits and
pitfalls . . . . . . . . . . . . . . . . 410--411
A. M. Andrew Correspondence: The calculation of
orthogonal vectors . . . . . . . . . . . 411--411
I. H. Gould and
R. W. Bemer Correspondence: On the use of the term
`processor' . . . . . . . . . . . . . . 411--412
E. S. Deutsch Correspondence: Comments on a line
thinning algorithm . . . . . . . . . . . 412--412
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
M. G. Notley The cumulative recurrence library . . . 14--19
J. S. Rohl and
G. Cordingley List Processing Facilities in Atlas
Autocode . . . . . . . . . . . . . . . . 20--24
H. D. Baecker The use of ALGOL 68 for trees . . . . . 25--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
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
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
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
Shirley A. Lill Algorithm 46: A modified Davidon method
for finding the minimum of a function
using difference approximation for
derivatives . . . . . . . . . . . . . . 111--113
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. L. Humphrey and
W. G. Munro Management Information Retrieval . . . . 127--130
M. Harrop A basic approach to remote access . . . 131--135
A. J. T. Colin DOLPHIN --- a text filing system for
University use . . . . . . . . . . . . . 136--141
A. Learner and
A. L. Lim A note on transforming context-free
grammars to Wirth-Weber precedence form 142--144
R. J. Pankhurst A computer program for generating
diagnostic keys . . . . . . . . . . . . 145--151
R. J. Ord-Smith Generation of permutation sequences:
part 1 . . . . . . . . . . . . . . . . . 152--155
A. J. Cole 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
R. R. Allran and
S. E. J. Johnsen An algorithm for solving nonlinear
programming problems subject to
nonlinear inequality constraints . . . . 171--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
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
C. J. van Rijsbergen Note on Algorithm 47: A clustering
algorithm . . . . . . . . . . . . . . . 219--219
D. T. Muxworthy Note on Algorithm 47: A clustering
algorithm . . . . . . . . . . . . . . . 219--219
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: 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: \em The 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
T. G. McLain and
A. R. Trice The MINIMOP multi-access operating
system . . . . . . . . . . . . . . . . . 237--242
D. Barton and
S. R. Bourne and
J. R. Horton The structure of the Cambridge algebra
system . . . . . . . . . . . . . . . . . 243--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
J. B. Hext and
P. S. Roberts Syntax analysis by Domolki'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
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
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
C. J. van Rijsbergen Algorithm 52: A fast hierarchic
clustering algorithm . . . . . . . . . . 324--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
A. D. Woodall Note on Algorithm 43: A listed radix
sort . . . . . . . . . . . . . . . . . . 326--326
A. H. J. Sale Note on Algorithm 47: A clustering
algorithm . . . . . . . . . . . . . . . 326--326
R. D. Bennett Discussion and correspondence: computers
and the business information structure:
new horizons in decision making
effectiveness . . . . . . . . . . . . . 327--329
A. C. Day The use of symbol-state tables . . . . . 332--339
J. R. Millenson Language and List Structure of a
Compiler for Experimental Control . . . 340--343
T. H. O'Beirne Computer Programs Which Play Music with
Microtones . . . . . . . . . . . . . . . 344--349
D. P. Treble Computers and Composition in Change
Ringing . . . . . . . . . . . . . . . . 350--351
K. J. MacCallum Surfaces for Interactive Graphical
Design . . . . . . . . . . . . . . . . . 352--358
K. M. Waliuzzaman 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
I. Barrodale and
F. D. K. Roberts and
C. R. Hunt Computing best $\ell_p$ approximations
by functions nonlinear in one parameter 382--386
J. S. Meditch Newton's Method in Discrete-Time
Nonlinear Data Smoothing . . . . . . . . 387--391
D. J. McConalogue A quasi-intrinsic scheme for passing a
smooth curve through a discrete set of
points . . . . . . . . . . . . . . . . . 392--396
M. R. Scott Numerical Solution of Unstable Initial
Value Problems by Invariant Imbedding 397--400
P. G. O'Regan Step Size Adjustment At Discontinuities
for Fourth Order Runge-Kutta Methods . . 401--404
V. A. LoDato The permutation of a certain class of
matrices . . . . . . . . . . . . . . . . 405--410
A. R. Gourlay Generalisation of elementary Hermitian
matrices . . . . . . . . . . . . . . . . 411--412
J. O. Ramsay A family of gradient methods for
optimization . . . . . . . . . . . . . . 413--417
G. Peckham A new method for minimising a sum of
squares without calculating gradients 418--420
P. Hammersley Algorithms supplement: Previously
published algorithms . . . . . . . . . . 421--421
R. A. Zambardino Algorithm 53: Decomposition of positive
definite symmetric band matrices . . . . 421--422
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
A. H. J. Sale The classification of FORTRAN statements 10--12
C. R. Symons A cost accounting formula for
multiprogramming computers . . . . . . . 13--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
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: 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: (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 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: On quality of writing 86--86
D. G. Evershed and
G. E. Rippon High level languages for low level users 87--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
P. Hammersley Algorithms supplement: Previously
published algorithms . . . . . . . . . . 103--103
A. D. Woodall Algorithm 63: A recursive tree sort . . 103--103
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: \em Rank Order
Probabilities: Two Sample Normal Shift
Alternatives, by Roy C. Milton, 1970 . . 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
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
A. Ortony A system for stereo viewing . . . . . . 140--144
J. Kral 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
G. N. Lance and
W. T. Williams A note on a new divisive classificatory
program for mixed data . . . . . . . . . 154--155
R. John Lansdowne Correspondence: On ``The use of
symbol-state tables'' . . . . . . . . . 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
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
C. F. Reynolds CODIL, Part 2. The CODIL language and
its interpreter . . . . . . . . . . . . 327--332
R. W. Bonney A keyword index file of British book
titles . . . . . . . . . . . . . . . . . 333--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
J. A. Tomlin and
D. C. Cooper and
D. A. Bell Book reviews: \em Integer and Dynamic
Programming, by J. Abadie (editor),
1970; \em Algorithms and Recursive
Functions, by A. L. Mal'cev, 1970; \em
Information Theory for Systems Engineers
(Econometrics and Operations Research
XVII), by L. P. Hyvärinen, 1970 . . . . . 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
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: On the February 1971
editorial . . . . . . . . . . . . . . . 360--360
J. N. G. Brittan and
F. J. M. Farley College timetable construction by
computer . . . . . . . . . . . . . . . . 361--365
S. H. Valentine Correspondence: ``On the automatic
numerical evaluation of definite
integrals'' . . . . . . . . . . . . . . 365--365
R. C. Backhouse Correspondence: On ``High level
languages for low level users'' . . . . 365--365
M. Etherton Data structures for a network design
system . . . . . . . . . . . . . . . . . 366--374
E. L. Albaseny Book reviews: \em Numerik Symmetrischer
Matrizen, by H. Rutishauer, E. Stiefel
and H. Schwarz, 1968; \em Computational
Methods in Partial Differential
Equations, by A. R. Mitchell, 1969 . . . 374--374
A. Ricci An algorithm for the removal of hidden
lines in 3D scenes . . . . . . . . . . . 375--377
Anthony Wren Book review: \em Case Exercises in
Operations Research, by J. J. C. Martin
and R. A. Denison, 1971 . . . . . . . . 377--377
B. J. Austin A dynamic disc allocation algorithm
designed to reduce fragmentation during
file reloading . . . . . . . . . . . . . 378--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: \em Convexity and
Optimization in Finite Dimensions I, by
Josef Stoer and Christoph Witzgall,
1970; \em On Round-off Errors in Linear
Programming, by H. Müller-Merbach, 1970;
\em Approximation 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
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: \em Computation and Theory
in Ordinary Differential Equations, by
James W. Daniel and Ramon E. Moore,
1970; Progress in Brain Research, Vol.
33. \em Computers and Brains, by J. P.
Schade and J. Smith, 1970 . . . . . . . 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: 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: \em Mathematical Model
Building in Economics and Industry
(Second Series), by M. G. Kendall
(editor), 1970 . . . . . . . . . . . . . 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: 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
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: 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: 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
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: 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: 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
A. R. Forrest Interactive interpolation and
approximation by Bézier polynomials . . . 71--79
P. E. Gill and
G. F. Miller An algorithm for the integration of
unequally spaced data . . . . . . . . . 80--83
B. S. Thornton Reduction and linearisation of quadratic
constrained optimisation in linked
systems . . . . . . . . . . . . . . . . 84--87
P. A. Samet Insight, not numbers . . . . . . . . . . 88--92
A. J. Flavell Correspondence: On ``Another round of
FORTRAN'' . . . . . . . . . . . . . . . 92--92
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
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 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 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 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
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. 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
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
M. H. J. Webb Computer procurement policies for
universities and similar users . . . . . 170--175
C. H. Lindsey ALGOL 68 with fewer tears . . . . . . . 176--188
M. V. Wilkes On Preserving the Integrity of Data
Bases . . . . . . . . . . . . . . . . . 191--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
K. 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
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: 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
R. E. Scraton Correspondence: The generalised Euler
transformation . . . . . . . . . . . . . 258--258
H. W. Bradly Correspondence: On high level languages 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
E. 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: On ``Suggested
Extensions to FORTRAN IV'' . . . . . . . 267--267
J. Grad and
E. Zakrajsek $LR$ algorithm with Laguerre shift for
symmetric tridiagonal matrices . . . . . 268--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: On FORTRAN complainants 273--273
G. Loizou On the Quadratic Convergence of the
Jacobi Method for Normal Matrices . . . 274--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
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
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 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: 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
I. R. Smith and
L. A. Snider Numerical Solution of the Differential
Equations of a Synchronous Generator . . 350--355
D. J. Evans An algorithm for the solution of certain
tridiagonal systems of linear equations 356--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: `Packing' in FORTRAN . . 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: On ``Another round of
FORTRAN'' . . . . . . . . . . . . . . . 381--381
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: Impressions following
the BCS Conference on Computer
Performance . . . . . . . . . . . . . . 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
J. G. Griffiths Drawing opaque solids using an
incremental plotter . . . . . . . . . . 35--38
D. J. Grover Message orientated interactive graphics 39--45
M. F. Lynch and
J. H. Petrie A program suite for the production of
articulated subject indexes . . . . . . 46--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
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
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
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
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
C. R. Jordan A note on LISP universal $S$-functions 124--125
C. Bays Some Techniques for Structuring Chained
Hash Tables . . . . . . . . . . . . . . 126--131
A. J. Szanser Bracketing technique in elastic matching 132--134
F. P. Wyman Binary programming: a decision rule for
selecting optimal vs heuristic
techniques . . . . . . . . . . . . . . . 135--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
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
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 \em The
Computer Journal . . . . . . . . . . . . 189--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
H. W. G. Gearing Editorial: the silent business user . . 194--195
R. Jorre and
G. Boyfield and
J. Darkin Data communication user research in the
Post Office: Part 1 . . . . . . . . . . 196--204
F. G. Heath and
C. M. Reeves Book reviews: \em Computer Logic Design,
by M. Morris Mano, 1972; \em Logic and
Logic Design, By B. Girling and H. G.
Moring; \em An Introduction to Job
Control Language, by Ronald J. DeMasi
and Francis J. Longo, 1972 . . . . . . . 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: \em Computer Simulation of
Dynamic Systems, by R. J. Kochenburger,
1972; \em Electronic Data Processing and
Computers for Commercial Students, by E.
A. Bird, 1972 . . . . . . . . . . . . . 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
J. K. Reid and
D. W. Lewin Book reviews: \em Sparse Matrices and
their Applications, edited by D. L. Rose
and R. A. Willoughby, 1972; \em
Introduction to Digital Computer
Technology, by Louis Nashelsky, 1973 . . 222--222
J. A. Llewellyn The deadly embrace --- a finite state
model approach . . . . . . . . . . . . . 223--225
J. R. Ullmann Book review: \em Introduction to
Mathematical Techniques in Pattern
Recognition, by Harry C. Andrews, 1972 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 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: \em Representation and
Meaning, by Herbert A. Simon and Laurent
Siklossy, 1972; \em A Collection of
Programming Problems and Techniques, by
H. A. Maurer and M. R. Williams, 1972 253--253
D. M. Boulton and
C. S. Wallace An Information Measure for Hierarchic
Classification . . . . . . . . . . . . . 254--261
Joan Walsh and
P. A. Samet Book reviews: \em Computer Applications
of Numerical Methods, by Shan S. Kuo,
1972; \em Introduction to Computational
Methods for Students of Calculus, by S.
S. McNeary, 1972 . . . . . . . . . . . . 261--261
N. Christofides Large scheduling problems with bivalent
costs . . . . . . . . . . . . . . . . . 262--264
C. B. Dunham When absolute approximations are optimal
in function subroutines . . . . . . . . 265--265
E. M. Chance Book review: \em FORTRAN Techniques, by
A. Colin Day, 1972 . . . . . . . . . . . 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
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
A. J. D. Pawson and
F. R. A. Hopgood Correspondence: Hashing techniques for
table searching . . . . . . . . . . . . 285--285
D. T. Muxworthy Correspondence: On ``Compile-Time Error
Diagnostics in Syntax-Directed
Compilers'' . . . . . . . . . . . . . . 285--285
Robert A. Fairthorne and
The Editor Correspondence: On word use . . . . . . 286--286
C. R. Tyler and
The Editor Correspondence: Editorial . . . . . . . 286--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
Charles J. Gibbons and
M. Wells Correspondence: On ``File Compression
Using Variable Length Encodings'' . . . 287--287
E. S. Page Editorial: the journal --- why and what
for . . . . . . . . . . . . . . . . . . 290--290
R. Jorre 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
R. J. Leaman and
M. H. Lloyd and
C. S. Repton The development and testing of a
processor self-test program . . . . . . 308--314
M. I. Padgett Tree Driven Data Input and its
Validation . . . . . . . . . . . . . . . 315--321
P. B. Schneck and
Ellinor Angel A FORTRAN to FORTRAN optimising compiler 322--330
H. Whitfield and
A. S. Wight EMAS --- the Edinburgh Multi-Access
System . . . . . . . . . . . . . . . . . 331--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
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
F. Oliveira-Pinto Generalised Chebyshev Polynomials and
Their Use in Numerical Approximation . . 375--379
D. C. Brown Discussion and correspondence: the
project, and the future of Computing
Science courses . . . . . . . . . . . . 380--382
Sven Eriksen The Data Base Concept . . . . . . . . . ??
J. K. Broadbent Microprogramming and System Architecture 2--8
D. A. H. Brown Some Error Correcting Codes for Certain
Transposition and Transcription Errors
in Decimal Integers . . . . . . . . . . 9--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
J. H. Kardasz and
G. Molnar A SIMULA-based structure oriented
language for the dynamic simulation of
chemical plants . . . . . . . . . . . . 28--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
J. Inglis Inverted Indexes and Multi-List
Structures . . . . . . . . . . . . . . . 59--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
D. A. Phillips A preliminary investigation of function
optimisation by a combination of methods 75--79
W. Proskurowski Ordering Method to Accelerate the
Solution of Mate-In-Two Chess Problems
by Computer . . . . . . . . . . . . . . 80--81
Dana L. Ulery and
H. M. Khalil A survey of language-oriented systems
for numerical linear algebra . . . . . . 82--88
R. James Rohlf Algorithm 81: Dendrogram plot . . . . . 89--91
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: \em Spline Analysis, by
Martin H. Schultz, 1972; \em
Introduction to Programming, by A.
Sharp; \em Algol Programming, by R. W.
Sharp . . . . . . . . . . . . . . . . . 92--92
J. M. Triance Handling records with a variable
structure in COBOL . . . . . . . . . . . 93--94
D. A. H. Brown Correspondence: Cyclic redundancy
checking by program . . . . . . . . . . 94--95
F. Poole and
P. M. Stocker Correspondence: On ``Self-organising
data management systems'' . . . . . . . 95--95
J. Boothroyd Correspondence: On a radix conversion
process . . . . . . . . . . . . . . . . 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
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
L. Presser and
J. Benson Evaluation of Compiler Diagnostics . . . 121--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
J. S. Fenton Memoryless Subsystems . . . . . . . . . 143--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. M. Brandon, Jr. The implementation and use of sparse
matrix techniques in general simulation
programs . . . . . . . . . . . . . . . . 165--171
M. J. Cross Nimbus 4 SCR Data Handling . . . . . . . 172--180
J. R. Manning Continuity Conditions for Spline Curves 181--186
Cliff Lloyd Book review: \em Structured programming,
by O.-J. Dahl, E. W. Dijkstra and C. A.
R. Hoare . . . . . . . . . . . . . . . . 186--186
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: On mixing interpretive
and machine code . . . . . . . . . . . . 188--188
R. W. Bemer Correspondence: On mixing interpretive
and machine code . . . . . . . . . . . . 188--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
Joy Strawson Correspondence: On ``Himmelbett'' . . . 190--190
B. W. Dawkins Correspondence: The Computer Journal . . 190--190
D. L. Fisher Correspondence: On ``The project, and
the future of Computing Science
courses'' . . . . . . . . . . . . . . . 190--190
P. J. Hathaway and
D. Van Vliet Correspondence: An efficient method for
reading and writing subscripted arrays
using FORTRAN IV . . . . . . . . . . . . 190--191
R. Needham and
F. F. Land and
M. Wells Book reviews: \em Computer Data
Security, by H. Katzan, Jr., 1974; \em
Information Systems in Management, by R.
J. Radford, 1973; \em Data Transmission,
by M. D. Bacon and G. M. Bull, 1973 . . 191--191
J. Inglis and
S. H. Lavington Book reviews: \em The Analysis of
Information Systems, by C. T. Meadow,
1973; \em Introduction to Digital
Computer Design, by D. J. Wooloms, 1973 192--192
Anonymous Special summer programme at
Massachusetts Institute of Technology 192--192
B. Wagle and
P. M. Jenkins Corporate Planning, Models and Computer
Systems . . . . . . . . . . . . . . . . 194--200
D. A. H. Brown Biquinary Decimal Error Detection Codes
with One, Two and Three Check Digits . . 201--204
P. A. Dearnley The Operation of a Model Self Organising
Data Management System . . . . . . . . . 205--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
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
S. Dvorak and
B. Kropac Decomposition of the Gozinto's Graph
with the Use of a Nesting Store . . . . 245--248
D. M. Jackson and
W. W. Wadge Normal Form Reduction of Probabilistic
Computations in Non-Parametric
Classification . . . . . . . . . . . . . 249--252
Jean V. Scott Computer Design of Cascade Logic . . . . 253--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 Management in the computer business . . 279--282
D. W. Barron Job Control Languages and Job Control
Programs . . . . . . . . . . . . . . . . 282--286
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
T. L. Shaftel and
R. W. Zmud Allocation of Computer Resources Through
Flexible Pricing . . . . . . . . . . . . 306--312
R. H. Pierce Source Language Debugging on a Small
Computer . . . . . . . . . . . . . . . . 313--317
D. H. McLain Drawing Contours from Arbitrary Data
Points . . . . . . . . . . . . . . . . . 318--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
R. Bird Speeding up Programs . . . . . . . . . . 337--339
A. Ecker The period of search for the quadratic
and related hash methods . . . . . . . . 340--343
G. Rozenberg and
D. Wood Generative Models for Parallel Processes 344--348
Kenneth B. Salomon An efficient algorithm which determines
the output from a sequential machine for
regular inputs . . . . . . . . . . . . . 349--354
W. E. Wright An axiomatic specification of Euclidean
analysis . . . . . . . . . . . . . . . . 355--364
M. Boari and
P. Pellizzardi and
R. Rossi Performance Evaluation of a Process
Control System by Simulation Model . . . 365--370
F. Durbin Numerical Inversion of Laplace
Transforms: an Efficient Improvement to
Dubner and Abate's Method . . . . . . . 371--376
R. A. Zambardino Algorithm 82: Solutions of systems of
linear equations with partial pivoting
and reduced storage requirements . . . . 377--378
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
C. Whitby-Strevens Correspondence: Microprogramming and
systems architecture . . . . . . . . . . 381--381
H. H. W. Pitcher Correspondence: Definition of random . . 381--381
J. Boothroyd Erratum: ``On a radix conversion
process'' . . . . . . . . . . . . . . . 381--381
J. D. Beasley Correspondence: System 4 random number 381--381
B. Hamilton Kelly Correspondence: On radix conversion . . 382--382
A. M. Andrew Correspondence: Decimal number checking
schemes . . . . . . . . . . . . . . . . 382--383
D. A. Bell Correspondence: Computing Science . . . 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
C. T. Fike A permutation generation method . . . . 21--22
R. Haskell Efficient Implementation of a Class of
Recursively Defined Functions . . . . .