Last update:
Fri Feb 5 18:20:15 MST 2021
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. S. Rollett and
J. H. Wilkinson Letter to the Editor: [Givens and
Householder processes] . . . . . . . . . 279--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
J. H. Wilkinson Book Review: \em Solutions Numériques des
Équations Algébraiques, by E. Durand
(Paris: Masson et Cie., 1960, pp. 328,
65 NF) . . . . . . . . . . . . . . . . . 32--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
J. H. Wilkinson Book Review: \em Solutions Numériques des
Équations Algébraiques, Volume II, by E.
Durand (Paris: Masson et Cie., 1961, pp.
445, 90 NF) . . . . . . . . . . . . . . 263--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
C. Strachey Letter to the Editor: An impossible
program . . . . . . . . . . . . . . . . 313--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
Beresford Parlett Letter to the Editor: On finding the
eigenvalues of real symmetric
tridiagonal matrices . . . . . . . . . . 344--345
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
J. H. Wilkinson Book Review: \em The Matrix Analysis of
Vibration, by R. E. D. Bishop, G. M. L.
Gladwell, and S. Michaelson, 1965; 404
pages (London: Cambridge University
Press, 100s) . . . . . . . . . . . . . . 77--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, 106
C. J. van Rijsbergen Algorithm 47: A clustering algorithm . . 113--115
A. H. J. Sale Note on Algorithm 42: Interpolation by
certain quintic splines . . . . . . . . 115--115
N. Jardine Discussion and correspondence:
Algorithms, methods and models in the
simplification of complex data . . . . . 116--117
A. V. Reader Random digits by a mincing process . . . 118--118
P. B. Fellgett Correspondence: What is an analyst? . . 118--119
R. L. Allen and
The Editor Correspondence: What is an analyst? . . 119--120
M. J. Savage Erratum: ``Junction optimisation
technique'' . . . . . . . . . . . . . . 120--120
M. Wells Correspondence: Towards Fortran VI? . . 120--120
B. W. Dawkins and
H. C. Dawkins Correspondence: On ``A University
faculty timetable'' . . . . . . . . . . 121--122
Jan V. Garwick and
J. N. Lyness Correspondence: On ``The effect of
inadequate convergence criteria in
automatic routines'' . . . . . . . . . . 122--122
A. Gunton Recovery Procedures for Direct Access
Commercial Systems . . . . . . . . . . . 123--126
A. 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
J. H. Wilkinson Book Review: \em A Collection of
Matrices for Testing Computational
Algorithms, by Robert T. Gregory, D. L.
Karney, 1969; 154 pages. (John Wiley and
Sons Ltd., \pounds 4.75) . . . . . . . . 391--391
D. J. McConalogue A quasi-intrinsic scheme for passing a
smooth curve through a discrete set of
points . . . . . . . . . . . . . . . . . 392--396
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. Rutishauser, 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 . . . . . 23--29
A. F. Cardenas and
R. W. Seeley A simple data structure for interactive
graphic design/drafting . . . . . . . . 30--33
J. R. White and
L. Presser A structured language for translator
construction . . . . . . . . . . . . . . 34--42
D. Partridge A dynamic database which automatically
removes unwanted generalisation for the
efficient analysis of language features
that exhibit a disparate frequency
distribution . . . . . . . . . . . . . . 43--48
J. R. Slagle and
L. M. Norton Automated Theorem-Proving for the
Theories of Partial and Total Ordering 49--54
G. A. Lanzarone and
M. Ornaghi Program Construction by Refinements
Preserving Correctness . . . . . . . . . 55--62
F. G. Duncan and
D. Zissos and
Maureen Walls A postfix notation for logic circuits 63--69
D. J. Evans A recursive algorithm for determining
the eigenvalues of a quindiagonal matrix 70--73
J. C. Nash A One-sided Transformation Method for
the Singular Value Decomposition and
Algebraic Eigenproblem . . . . . . . . . 74--76
F. Oliveira-Pinto The use of derivatives in the
optimisation of the truncation error of
polynomial approximations . . . . . . . 77--80
R. Hughes Jones and
P. R. Graves-Morris and
G. J. Makinson Algorithm 85: Generation of Chisholm
approximants . . . . . . . . . . . . . . 81--83
J. Rokne and
P. Lancaster Algorithm 86: Complex Interval
Arithmetic . . . . . . . . . . . . . . . 83--85
R. Fleck and
J. Bailey Algorithm 87: Minimum of a non-linear
function by the application of the
geometric programming technique . . . . 86--89
I. D. Hill Algorithm 88: An electoral method . . . 89--90
A. D. Chambers Audit Test Packs and Computer Audit
Programs . . . . . . . . . . . . . . . . 98--101
W. N. Holmes Identification Number Design . . . . . . 102--107
K. W. Smillie and
M. J. R. Shave Converting Decision Tables to Computer
Programs . . . . . . . . . . . . . . . . 108--111
R. W. Zmud Two Enhancements to a Flexible Pricing
Control System for Allocating Computer
Resources . . . . . . . . . . . . . . . 112--114
Robert A. Fleck, Jr. Computer Efficiency and Linear
Programming . . . . . . . . . . . . . . 115--116
C. C. M. Parish On the Application of Queueing Theory to
Analysing On-Line Computing Systems . . 117--121
D. J. Rees The EMAS director . . . . . . . . . . . 122--130
A. S. Wight The EMAS archiving program . . . . . . . 131--134
J. J. Florentin and
A. J. Sammes Systems with State Re-Set . . . . . . . 135--139
A. L. Lim and
G. R. Lewis Towards Structured Programs in APL . . . 140--143
P. J. Comerford Link systems for multi-computer control
of a large process. I . . . . . . . . . 144--147
N. Zvegintzov Problems with Analytic Description of
Text Formats . . . . . . . . . . . . . . 148--149
R. J. W. Housden On String Concepts and Their
Implementation . . . . . . . . . . . . . 150--156
A. Mayne and
E. B. James Information Compression by Factorising
Common Strings . . . . . . . . . . . . . 157--160
W. A. Burkhard Full Table Quadratic Quotient Searching 161--163
F. J. Rohlf A new approach to the computation of the
Jardine-Sibson ${B_k}$ clusters . . . . 164--168
B. Cooper Time-Domain Matrix Evaluation of a
Digital Servomechanism Using Semi-Hybrid
Computational Techniques . . . . . . . . 169--172
Ayse Alaylioglu and
G. A. Evans and
J. Hyslop Automatic Generation of Quadrature
Formulae for Oscillatory Integrals . . . 173--176
T. J. Buckholtz and
C. S. Wetherell Algorithm 89: A program to referee
Kriegspiel and chess . . . . . . . . . . 177--183
W. S. Ford Algorithm 90: Periodic cubic spline
interpolation with equidistant nodes . . 183--184
K. J. Allen Insuring Computers . . . . . . . . . . . 194--197
A. Parkin Bringing Cost into File Design Decisions 198--199
S. J. Waters Analysis of Self-Indexing, Disc Files 200--205
D. A. Hawley and
J. S. Knowles and
E. E. Tozer Database Consistency and the CODASYL
DBTG Proposals . . . . . . . . . . . . . 206--212
G. E. Millard and
D. J. Rees and
H. Whitfield The standard EMAS subsystem . . . . . . 213--219
P. J. Comerford Link systems for multi-computer control
of a large process: Part 2: Fault
detection . . . . . . . . . . . . . . . 220--222
H. D. Baecker Areas and Record-Classes . . . . . . . . 223--226
W. A. Burkhard Nonrecursive Traversals of Trees . . . . 227--230
G. Hunter A quantitative measure of precision . . 231--233
D. Ghoshdastidar and
M. K. Roy A study on the evaluation of Shell's
sorting technique . . . . . . . . . . . 234--235
D. M. Boulton and
C. S. Wallace An Information Measure for Single Link
Classification . . . . . . . . . . . . . 236--238
G. C. E. Winn A digital approach to the efficient
synthesis of threshold gates . . . . . . 239--242
L. F. Turner The on-ground compression of satellite
data . . . . . . . . . . . . . . . . . . 243--247
R. H. Bezdek and
A. H. Sameh A note on computational methods for
input-output econometric models . . . . 248--249
T. Tabata and
R. Ito Effective Treatment of the Interpolation
Factor in Marquardt's Nonlinear
Least-Squares Fit Algorithm . . . . . . 250--251
E. H. Twizell The numerical solution of second order
hyperbolic partial differential
equations with unequally spaced initial
conditions . . . . . . . . . . . . . . . 252--257
J. A. Grant and
G. D. Hitchins Two Algorithms for the Solution of
Polynomial Equations to Limiting Machine
Precision . . . . . . . . . . . . . . . 258--264
Gary D. Knott Hashing Functions . . . . . . . . . . . 265--278
H. C. Lauer Discussion on Ph.D. thesis proposals in
computing science . . . . . . . . . . . 279--281
M. A. Sandys Correspondence: On ``Continuity
Conditions for Spline Curves'' . . . . . 282--283
D. F. Arthur Correspondence: Reading variable length
records using FORTRAN IV . . . . . . . . 283--283
K. M. Howell Correspondence: Check digits and error
correction . . . . . . . . . . . . . . . 283--284
B. M. Ewen-Smith Correspondence: Check digits and error
correction . . . . . . . . . . . . . . . 284--284
A. M. Andrew Correspondence: Decimal error-correction
--- a solution . . . . . . . . . . . . . 284--285
J. P. N. Edwards and
The Editor Correspondence: Saving CPU time in
Scientific computation . . . . . . . . . 285--285
D. B. Crombie Correspondence: Comparison of hybrid and
digital computation performances for
distillation simulation . . . . . . . . 285--285
John Bradley Correspondence: On ``An algorithm for
the solution of constrained generalised
polynomial programming problems'' . . . 285--286
Roy S. Mullins Correspondence: On the origin of the
word `algorithm' . . . . . . . . . . . . 286--286
John V. Kline Correspondence: On ETAOIN SHRDLU . . . . 286--286
Anonymous Special notice . . . . . . . . . . . . . 287--287
R. W. Zmud Erratum: ``Two Enhancements to a
Flexible Pricing Control System for
Allocating Computer Resources'' . . . . 287--287
Anonymous Call for papers: 3rd International
Conference on Automata, Languages and
Programming, Edinburgh University,
Scotland, July 20--23, 1976 . . . . . . 287--287
R. A. Osborn and
W. P. Bain and
T. Lloyd and
P. H. Perring SPG --- a Programming System for
Commercial Transaction Processing . . . 290--297
P. J. H. King and
R. G. Johnson The conversion of decision tables to
sequential testing procedures . . . . . 298--306
A. Parkin Programming Objectives: an Analysis . . 307--311
Gill Ringland Software Functional Variability . . . . 312--317
R. A. Earnshaw Is APL a Viable Programming Language? 318--323
R. J. Dakin A general control language: language
structure and translation . . . . . . . 324--332
M. H. Williams and
H. L. Ossher A computer model for instructional
purposes . . . . . . . . . . . . . . . . 333--341
Alice Chung-Phillips and
R. W. Rosen A note on dynamic data storage in
FORTRAN IV . . . . . . . . . . . . . . . 342--343
F. J. B. Goddu The application of precedence operations
to interactive Canadian income tax
calculations . . . . . . . . . . . . . . 344--348
D. T. Goodwin An algorithm for inverting certain
translators of context-free languages 349--354
P. G. Barker Syntactic definition and parsing of
molecular formulae. I. Initial syntax
definition and parser implementation . . 355--359
K. Berkling and
W. Kluge Conceptual Design of a Hardwired Main
Storage Management Unit . . . . . . . . 360--365
W. F. Lunnon Counting Multidimensional Polyominoes 366--367
K. Vit Rational Interpolation and Extrapolation
for SUMT . . . . . . . . . . . . . . . . 368--370
J. R. Cash The numerical solution of linear stiff
boundary value problems . . . . . . . . 371--372
G. E. Trapp, Jr. and
W. Squire Solving Nonlinear Vandermonde Systems 373--374
S. K. Shrivastava A view of concurrent process
synchronisation . . . . . . . . . . . . 375--379
Anonymous Editorial: A personal view of the
`Beaumont' weekend . . . . . . . . . . . 2--2
K. D. Eason Understanding the Naive Computer User 3--7
P. J. Pengilly An approach to systems design . . . . . 8--12
J. J. Florentin Data Base Representations of Application
Models . . . . . . . . . . . . . . . . . 13--16
G. Schlageter The problem of lock by value in large
data bases . . . . . . . . . . . . . . . 17--20
S. J. Waters Hit Ratios . . . . . . . . . . . . . . . 21--24
R. B. E. Napper and
R. N. Fisher ALEC --- a User Extensible Scientific
Programming Language . . . . . . . . . . 25--31
L. V. Atkinson List Processing Language, SLPL --- an
Informal Outline . . . . . . . . . . . . 32--39
R. L. Hittos and
D. S. Henderson Optimisation of Main Memory Size Versus
Speed . . . . . . . . . . . . . . . . . 40--42
H. J. Curnow and
B. A. Wichmann A synthetic benchmark . . . . . . . . . 43--49
R. E. Walters Benchmark Techniques: a Constructive
Approach . . . . . . . . . . . . . . . . 50--55
S. K. Robinson and
I. S. Torsun An empirical analysis of FORTRAN
programs . . . . . . . . . . . . . . . . 56--62
A. C. Norman Expanding the Solutions of Implicit Sets
of Ordinary Differential Equations in
Power Series . . . . . . . . . . . . . . 63--68
W. H. Southwell Fitting Data to Nonlinear Functions with
Uncertainties in All Measurement
Variables . . . . . . . . . . . . . . . 69--73
Karl-Heinz Mohn and
Roger V. Roman An interactive polynomial approximation
algorithm . . . . . . . . . . . . . . . 74--78
W. E. McBride and
A. K. Rigler A modification of the Osborne and Watson
algorithm for nonlinear minimax
approximation . . . . . . . . . . . . . 79--81
M. R. Williams The difference engines . . . . . . . . . 82--89
Donald Perlis An application of compiler simulation at
the source language level . . . . . . . 90--90
T. S. Ng and
A. Cantoni Run Time Interaction with Fortran Using
Mixed Code . . . . . . . . . . . . . . . 91--92
W. B. Samson Testing Overflow Algorithms for a Table
of Variable Size . . . . . . . . . . . . 92--92
J. M. Kerridge PATCOSY --- a Database System for the
National Health Service . . . . . . . . 98--103
E. C. Coles and
L. J. Beilin and
C. J. Bulpitt and
C. T. Dollery and
B. F. Johnson and
A. D. Munro-Faure and
S. C. Turner An approach to computer processing of
clinical data . . . . . . . . . . . . . 104--109
R. A. Davenport Database Integrity . . . . . . . . . . . 110--116
P. A. Dearnley An investigation into database
resilience . . . . . . . . . . . . . . . 117--121
S. J. Waters CAM 01: a Precedence Analyser . . . . . 122--126
Y. L. Varol Some Remarks on Computer Acquisition . . 127--131
O. Marjasoo A methodology for hardware and software
availability analysis . . . . . . . . . 132--135
H. C. Lucas, Jr. and
R. B. Kaplan A structured programming experiment . . 136--138
G. R. Frank Job Control in the MU5 Operating System 139--143
J. Hilden Guidelines for the Design of Interactive
Systems . . . . . . . . . . . . . . . . 144--150
Frank G. Pagan On Interpreter-Oriented Definitions of
Programming Languages . . . . . . . . . 151--155
J. S. Rohl Programming Improvements to Fike's
Algorithm for Generating Permutations 156--159
L. V. Atkinson and
G. J. Duffus Machine Code Generation Within a
Compiler --- a Teaching Model . . . . . 160--165
C. J. Higley Type Checking in a Typeless Language . . 166--169
A. G. Middleton On the Use of Macros for Iteration . . . 170--172
A. T. Fuller The period of pseudo-random numbers
generated by Lehmer's congruential
method . . . . . . . . . . . . . . . . . 173--177
D. H. McLain Two-Dimensional Interpolation from
Random Data . . . . . . . . . . . . . . 178--181
John Mitchem On Various Algorithms for Estimating the
Chromatic Number of a Graph . . . . . . 182--183
D. J. Evans and
M. Hatzopoulos The solution of certain banded systems
of linear equations using the folding
algorithm . . . . . . . . . . . . . . . 184--187
J. Inglis Structured programming and input
statements . . . . . . . . . . . . . . . 188--189
D. L. Fisher Blind programmers --- their manager's
experience . . . . . . . . . . . . . . . 189--190
B. F. M. Adamczewski A formula for establishing re-order
quantities for individual items within a
joint stock replenishment scheme . . . . 194--197
T. Alewine and
R. A. Fleck, Jr. Service bureau or in-house data
processing . . . . . . . . . . . . . . . 198--201
D. Bell Programmer Selection and Programming
Errors . . . . . . . . . . . . . . . . . 202--206
E. B. James and
D. P. Partridge Tolerance to Inaccuracy in Computer
Programs . . . . . . . . . . . . . . . . 207--212
R. C. Varney Toward the Understandability of an
Operating System . . . . . . . . . . . . 213--215
D. L. Dance and
U. W. Pooch An adaptive on line data compression
system . . . . . . . . . . . . . . . . . 216--224
B. Higman The place of own variables in
programming language theory . . . . . . 225--228
D. S. Henderson and
M. R. Levy An extended operator precedence parsing
algorithm . . . . . . . . . . . . . . . 229--233
J. M. Brady A programming approach to some concepts
and results in the theory of computation 234--237
R. Devillers and
G. Louchard Improvement of parallelism in a finite
buffer sharing policy . . . . . . . . . 238--245
D. C. Sutcliffe An Algorithm for Drawing the Curve
${F(X,Y)} = 0$ . . . . . . . . . . . . . 246--249
R. P. Loretan Timing Problems in Electronic Lockout
Chains . . . . . . . . . . . . . . . . . 250--253
M. R. Patel and
K. H. Bennett Analysis of Speed of a Binary Multiplier
Using a Variable Number of Shifts Per
Cycle . . . . . . . . . . . . . . . . . 254--257
A. Alaylioglu and
G. A. Evans and
J. Hyslop The use of Chebyshev series for the
evaluation of oscillatory integrals . . 258--267
A. C. Day and
P. A. Clarke and
D. Hill and
J. K. Reid The proposed new standard for FORTRAN: a
critical examination . . . . . . . . . . 268--271
M. T. Pezarro A note on estimating hit ratios for
direct-access storage devices . . . . . 271--272
R. T. C. Lim and
J. D. Blackburn On program verification in numerical
methods . . . . . . . . . . . . . . . . 272--273
R. Taylor Fast input/output of variable-length
arrays in FORTRAN IV . . . . . . . . . . 273--273
D. J. Hatter On processing sparse matrices . . . . . 273--274
R. D. Henshell and
H. C. Lauer Ph.D. work in Computer Science and
Professional Standards . . . . . . . . . 274--275
M. Boari and
G. Neri A note on deadlock in the `readers and
writers' problem . . . . . . . . . . . . 275--275
R. M. De Morgan and
I. D. Hill and
B. A. Wichmann A supplement to the ALGOL 60 revised
report . . . . . . . . . . . . . . . . . 276--288
F. F. Land Evaluation of systems goals in
determining a design strategy for a
computer based information system . . . 290--294
J. M. Triance The significance of the 1974 COBOL
standard . . . . . . . . . . . . . . . . 295--300
V. Siskind and
J. Rosenhead Seek Times for Disc File Processing:
Some Results from Probability Theory . . 301--305
R. G. Casey and
I. M. Osman Replacement Algorithms for Storage
Management in Relational Data Bases . . 306--314
J. Ferrie and
C. Kaiser and
D. Lanciaux and
B. Martin An extensible structure for protected
systems' design . . . . . . . . . . . . 315--321
A. Walker and
D. Wood Locally Balanced Binary Trees . . . . . 322--325
C. Bays Non-Recursive Technique for Recreating a
Digraph from its ${K}$-Formula
Representation . . . . . . . . . . . . . 326--328
T. Sakaki and
K. Nakashima and
Y. Hattori Algorithms for Finding in the Lump Both
Bounds of the Chromatic Number of a
Graph . . . . . . . . . . . . . . . . . 329--332
D. C. Sutcliffe A Remark on a Contouring Algorithm . . . 333--335
M. A. Sabin A method for displaying the intersection
curve of two quadric surfaces . . . . . 336--338
R. J. Aust An improvement algorithm for school
timetabling . . . . . . . . . . . . . . 339--343
I. M. Willers The syntax directed graph algorithm for
the input of equations to the Taylor
series system for solving ordinary
differential equations . . . . . . . . . 344--347
P. J. Hartley Tensor Product Approximations to Data
Defined on Rectangular Meshes in
${N}$-Space . . . . . . . . . . . . . . 348--352
M. Shacham and
E. Kehat A direct method for the solution of
large sparse systems of linear equations 353--359
A. C. Day Algorithm 91: Balancing a binary tree 360--361
G. Berry Algorithm 92: The Drawing of Dashed
Lines . . . . . . . . . . . . . . . . . 361--363
J. W. Backus and
F. L. Bauer and
J. Green and
C. Katz and
J. McCarthy and
P. Naur and
A. J. Perlis and
H. Rutishauser and
K. Samelson and
B. Vauquois and
J. H. Wegstein and
A. van Wijngaarden and
M. Woodger and
R. M. De Morgan and
I. D. Hill and
B. A. Wichmann Modified Report on the Algorithmic
Language ALGOL-60 . . . . . . . . . . . 364--379
S. J. Waters CAM02: a structured precedence analyser 2--5
B. M. Leavenworth Non-Procedural Data Processing . . . . . 6--9
B. J. Edwards Choice of Block Sizes for Magnetic Tape
Files . . . . . . . . . . . . . . . . . 10--14
Alfonso F. Cardenas and
James P. Sagamang Doubly-Chained Tree Data Base
Organisation --- Analysis and Design
Strategies . . . . . . . . . . . . . . . 15--26
K. Forbes and
A. W. Goldsworthy Prescheduling Algorithm --- Scheduling a
Suitable Mix Prior to Processing . . . . 27--29
D. Nudds The design of the MAX macroprocessor . . 30--36
C. Piney A generalised interactive system for the
acquisition of structured data . . . . . 37--44
M. H. Williams Generating Structured Flow Diagrams: the
Nature of Unstructuredness . . . . . . . 45--50
B. G. T. Lowden and
I. R. MacCallum Some Consequences of Deferred Binding in
COBOL . . . . . . . . . . . . . . . . . 51--55
D. T. Goodwin Conditions for Underflow and Overflow of
an Arithmetic Stack . . . . . . . . . . 56--62
D. Wood Two Variations on ${N}$-Parallel Finite
State Generators . . . . . . . . . . . . 63--67
M. J. B. Duff and
D. M. Watson The cellular logic array image processor 68--72
A. Tosser and
D. Dubus Algebraic Optimisation of NAND-NOR
Switching Circuits . . . . . . . . . . . 73--77
A. M. Macnaghten and
C. A. R. Hoare Fast Fourier Transform Free from Tears 78--83
J. W. Akitt Function Minimisation Using the Nelder
and Mead Simplex Method with Limited
Arithmetic Precision: the Self
Regenerative Simplex . . . . . . . . . . 84--85
E. Zakrajsek Algorithm 93: Generalised eigenvalue
problem . . . . . . . . . . . . . . . . 86--91
B. G. T. Lowden A note on the oscillating sort . . . . . 92--92
A. Parkin The probable outcomes of a data
processing project . . . . . . . . . . . 98--101
R. K. Stamper The LEGOL 1 Prototype System and
Language . . . . . . . . . . . . . . . . 102--108
R. H. Pierce and
J. Rowell A transformation-directed compiling
system . . . . . . . . . . . . . . . . . 109--115
K. J. McDonell An inverted index implementation . . . . 116--123
H. R. A. Townsend SST --- a program for the automatic
generation of symbol state tables . . . 124--127
P. Kammerer Excluding Regions . . . . . . . . . . . 128--131
Y. Wallach Scheduling algorithms for concurrent
execution . . . . . . . . . . . . . . . 132--136
E. G. Mallach Scatter Storage Techniques: A Uniform
Viewpoint and a Method for Reducing
Retrieval Times . . . . . . . . . . . . 137--140
J. R. Ullmann A binary $n$-gram technique for
automatic correction of substitution,
deletion, insertion and reversal errors
in words . . . . . . . . . . . . . . . . 141--147
D. de Champeaux and
L. Sint An optimality theorem for a
bi-directional heuristic search
algorithm . . . . . . . . . . . . . . . 148--150
Jerald Sydney Schwarz Generic Commands --- A Tool for Partial
Correctness Formalisms . . . . . . . . . 151--155
W. S. Ford and
V. C. Hamacher Low level architecture features for
supporting process communication . . . . 156--162
A. Kaletzky and
D. W. Lewin Problem orientated language for logic
design . . . . . . . . . . . . . . . . . 163--169
J. N. Lyness and
J. J. Kaganove A technique for comparing automatic
quadrature routines . . . . . . . . . . 170--177
Y. L. Varol On the generation of the
pseudo-remainder in polynomial division 178--180
D. J. Evans On the use of fast methods for solving
boundary value problems . . . . . . . . 181--184
R. J. Clasen A note on the use of the conjugate
gradient method in the solution of a
large system of sparse equations . . . . 185--186
N. Teskey KATE: a macro-processor for extending
command languages . . . . . . . . . . . 187--189
P. Stecher Proposal for an Interface System Between
the Business and Data Processing Systems 194--201
A. D. Wilkie Table Look-Up (With Examples in COBOL) 202--206
S. J. Waters Majority Verdicts in Multi-Processing
--- any Two from Three . . . . . . . . . 207--212
Deane B. Blazie and
L. S. Levy A cross compiler for pocket calculators 213--221
W. D. Haseman and
A. B. Whinston Automatic Application Program Interface
to a Data Base . . . . . . . . . . . . . 222--226
R. N. Ibbett and
M. A. Husband The MU5 name store . . . . . . . . . . . 227--231
R. G. Hamlet Testing Programs with Finite Sets of
Data . . . . . . . . . . . . . . . . . . 232--237
A. G. Middleton A case for type and form flow analysis 238--241
J. M. Robson Worst Case Fragmentation of First Fit
and Best Fit Storage Allocation
Strategies . . . . . . . . . . . . . . . 242--244
O. Nevalainen and
M. Vesterinen Determining Blocking Factors for
Sequential Files by Heuristic Methods 245--247
P. Scheuermann Modelling the Information Space in
Physical Storage At Different Levels of
Detail . . . . . . . . . . . . . . . . . 248--256
P. W. Williams and
M. T. Khallaghi Document Retrieval Using a Substring
Index . . . . . . . . . . . . . . . . . 257--262
A. D. McGettrick Teaching mathematics by computer . . . . 263--268
B. E. Carpenter and
R. W. Doran The other Turing machine . . . . . . . . 269--279
I. D. Hill Algorithm 94: Handling dates on small
computers . . . . . . . . . . . . . . . 280--280
A. C. Day Algorithm 95: Generating a parity
testing table . . . . . . . . . . . . . 280--280
P. J. Hayes A note on the Towers of Hanoi problem 282--285
D. H. R. Huxtable and
J. M. M. Pinkerton The hardware/software interface of the
ICL 2900 range of computers . . . . . . 290--295
P. J. Pengilly An approach to systems design. II. The
popularisation of PROPLAN . . . . . . . 296--297
T. C. Ting and
Y. W. Wang Multiway Replacement Selection Sort with
Dynamic Reservoir . . . . . . . . . . . 298--301
J. G. Kollias and
P. M. Stocker and
P. A. Dearnley Improving the Performance of an
Intelligent Data Management System . . . 302--307
P. J. Clapson Toward a Performance Science: a
Comparative Analysis of Computing
Systems . . . . . . . . . . . . . . . . 308--315
S. Mamrak and
J. M. Randal An analysis of a software engineering
failure . . . . . . . . . . . . . . . . 316--320
B. M. Nicklas and
G. Schlageter Index structuring in inverted data bases
by TRIES . . . . . . . . . . . . . . . . 321--324
R. A. Reynolds Character String Handling in Fortran . . 325--329
K. A. Steele CPM Network Analysis with a Storage Tube
Terminal . . . . . . . . . . . . . . . . 330--334
P. J. Willis A Real Time Hidden Surface Technique . . 335--339
L. S. Levy and
R. Melville The algebraic anatomy of programs . . . 340--345
A. D. Woodall Generation of permutation sequences . . 346--349
S. Soule A note on the nonrecursive traversal of
binary trees . . . . . . . . . . . . . . 350--352
J. M. Brady Hints on proofs by recursion induction 353--355
J. M. Wilson Boolean simplification and integer
inequalities . . . . . . . . . . . . . . 356--358
R. Mojena Hierarchical grouping methods and
stopping rules: An evaluation . . . . . 359--363
D. Defays An efficient algorithm for a complete
link method . . . . . . . . . . . . . . 364--366
W. L. Price A controlled random search procedure for
global optimisation . . . . . . . . . . 367--370
L. M. Delves Algorithm 96: A linear equation solver
for Galerkin and least squares methods 371--374
L. M. Delves and
L. F. Abd. El Al Algorithm 97: The fast Galerkin
algorithm for the solution of linear
Fredholm equations . . . . . . . . . . . 374--376
W. D. Hoskins and
G. E. McMaster Algorithm 98: A note on the solution of
certain tridiagonal systems of linear
equations . . . . . . . . . . . . . . . 376--378
D. J. Evans and
S. A. Smith Algorithm 99: On the construction of
balanced binary trees for parallel
processing . . . . . . . . . . . . . . . 378--379
N. E. Wiseman and
C. I. C. Campbell and
J. Harradine On Making Graphic Arts Quality Output by
Computer . . . . . . . . . . . . . . . . 2--6
R. A. Davenport Distributed or Centralised Data Base . . 7--14
P. Dearnley Monitoring Database System Performance 15--19
J. J. Donovan A note on performance of VM\slash 370 in
the integration of models and data bases 20--24
I. A. Clark Strema: Specifying Application Processes
Using Streams . . . . . . . . . . . . . 25--30
J. P. Fitch and
A. C. Norman A Note on Compacting Garbage Collection 31--34
W. R. Campbell A compiler definition facility based on
the syntactic macro . . . . . . . . . . 35--41
J. G. Wolff Recoding of Natural Language for Economy
of Transmission or Storage . . . . . . . 42--44
R. M. Lea Text Compression with an Associative
Parallel Processor . . . . . . . . . . . 45--56
P. W. Williams Criteria for Choosing Subsets to Obtain
Maximum Relative Entropy . . . . . . . . 57--62
P. W. Williams The relationship between entropy and
file search times . . . . . . . . . . . 63--65
J. L. Szwarcfiter and
L. B. Wilson Some properties of ternary trees . . . . 66--72
C. R. Edwards Some Improved Designs for the Digital
Summation Threshold Logic (DSTL) Gate 73--78
J. M. Eves and
S. L. Hurst Improvements in Multioutput
Threshold-Logic Gates . . . . . . . . . 79--85
J. F. Barlow An algorithm for the solution of the
postman's problem . . . . . . . . . . . 86--89
M. Gordon An Interactive Graphical Minicomputer
System for the Management and
Exploration of Clinical Renal Data . . . 91--93
William L. Honig and
C. Robert Carlson Toward an Understanding of (Actual) Data
Structures . . . . . . . . . . . . . . . 98--104
N. Ahituv and
I. Borovits Analysis of the purchase option of
computers . . . . . . . . . . . . . . . 105--109
R. H. Bonczek and
C. W. Holsapple and
A. B. Whinston Information Transferral Within a
Distributed Data Base via a Generalised
Mapping Language . . . . . . . . . . . . 110--116
R. V. Evans and
G. S. Lockington and
T. N. Reid A compiler compiler and methodology for
problem oriented language compiler
implementors . . . . . . . . . . . . . . 117--121
A. Parkin and
R. B. Coats EDSIM-event based discrete simulation
using general purpose languages such as
FORTRAN . . . . . . . . . . . . . . . . 122--127
W. N. Holmes Is APL a programming language? . . . . . 128--131
J. G. Kollias An estimate of seek time for batched
searching of random or index sequential
structured files . . . . . . . . . . . . 132--133
D. R. Hanson Filters in SL5 . . . . . . . . . . . . . 134--143
Gregor V. Bochmann and
P. Ward Compiler Writing System for Attribute
Grammars . . . . . . . . . . . . . . . . 144--148
I. Bratko and
D. Kopec and
D. Michie Pattern-based representation of chess
end-game knowledge . . . . . . . . . . . 149--153
G. M. Bull and
S. Gilbey and
Kathleen Levine and
A. G. Lippiatt and
C. H. C. Machin Proteus --- a Microcoded Multiprocessor
System . . . . . . . . . . . . . . . . . 154--160
M. H. Williams and
H. L. Ossher Conversion of Unstructured Flow Diagrams
to Structured Form . . . . . . . . . . . 161--167
P. J. Green and
R. Sibson Computing Dirichlet tessellations in the
plane . . . . . . . . . . . . . . . . . 168--173
D. A. Smith and
P. S. Guipre Modifications to the Forsythe-Moler
algorithm for solving linear algebraic
systems . . . . . . . . . . . . . . . . 174--177
D. H. McLain Algorithm 100: Vector Approximation to
Curves . . . . . . . . . . . . . . . . . 178--180
L. Hazlewood Algorithm 101: An algorithm for cautious
adaptive quadrature . . . . . . . . . . 180--183
P. T. Barry Discussion and Correspondence: the
Regional Computing Organisation Network 184--187
A. Parkin Critique on multi-criteria assessment
applied to alternative data processing
systems . . . . . . . . . . . . . . . . 188--190
R. Haentjens and
E. Van de Vel Lexical analysis and the transportation
of programs . . . . . . . . . . . . . . 190--190
B. Dwyer and
J. Inglis Correspondence: On ``Structured
programming and input statements'' . . . 190--191
P. Wodon Correspondence: On ``A note on the
Towers of Hanoi problem'' . . . . . . . 191--191
A. D. Chambers Computer fraud and abuse . . . . . . . . 194--198
I. Borovits and
S. Neumann Internal Pricing for Computer Services 199--204
Eric Foxley A hybrid computer performance modelling
system . . . . . . . . . . . . . . . . . 205--209
W. B. Samson and
R. H. Davis Search Times Using Hash Tables for
Records with Non-Unique Keys . . . . . . 210--214
J. L. Armstrong Programming a Parallel Computer for
Robot Vision . . . . . . . . . . . . . . 215--218
W. L. Price Simulation Studies of Data Communication
Networks Operating in Datagram Mode . . 219--223
P. G. Barker and
P. S. Jones Syntactic definition and parsing of
molecular formulae. Part 2: Graphical
synthesis of molecular formulae for data
base queries . . . . . . . . . . . . . . 224--233
M. H. Williams Static Semantic Features of Algol60 and
Basic . . . . . . . . . . . . . . . . . 234--242
R. Sibson Locally equiangular triangulations . . . 243--245
M. R. Patel and
K. H. Bennett Analysis of Speed of a Binary Divider
Using a Variable Number of Shifts Per
Cycle . . . . . . . . . . . . . . . . . 246--252
A. van Oosterom Triangulating the Human Torso . . . . . 253--258
H. R. A. Townsend Analysing Electroencephalograms . . . . 259--262
J. Mottl and
L. Mottlova Description of a program for solving
problems of nonlinear programming . . . 263--269
D. J. McConalogue Algorithm 102: Convolution integrals
involving probability distribution
functions . . . . . . . . . . . . . . . 270--272
V. K. Garg Algorithm 103: Computing the Bessel
functions $Y_n(x+iy)$ and $K_n(x+iy)$ 272--276
Anonymous Editorial notes: Reprinting of
Algorithms . . . . . . . . . . . . . . . 276--276
A. Obru\vca Algorithm 1: Mintree . . . . . . . . . . 276--276
Anthony E. N. T. Pitman Note on Algorithm 1: Mintree . . . . . . 276--276
M. H. Rodgers and
R. H. Thomason Certification of Algorithm 1: Mintree 276--277
I. D. Hill and
Alex K. Obru\vca Remarks on Algorithm 1: Mintree . . . . 277--277
J. Boothroyd Certification of Algorithm 1: Mintree 277--277
Alex K. Obru\vca Remark on Algorithm 1: Mintree . . . . . 277--277
J. M. Triance A study of COBOL portability . . . . . . 278--281
R. M. De Morgan and
I. D. Hill and
B. A. Wichmann Modified ALGOL 60 and the step-until
element . . . . . . . . . . . . . . . . 282--282
R. Maes On the Representation of Program
Structures by Decision Tables: a
Critical Assessment . . . . . . . . . . 290--295
M. K. Roy Evaluation of Permutation Algorithms . . 296--301
J. S. Rohl Generating Permutations by Choosing . . 302--305
P. A. Lee A reconsideration of the recovery block
scheme . . . . . . . . . . . . . . . . . 306--310
M. Osborne and
F. Little An implementation of structured
programming in APL . . . . . . . . . . . 311--315
A. S. Tanenbaum A comparison of PASCAL and ALGOL 68 . . 316--323
B. A. Lewis and
J. S. Robinson Triangulation of Planar Regions with
Applications . . . . . . . . . . . . . . 324--332
M. A. Hennell An experimental testbed for numerical
software . . . . . . . . . . . . . . . . 333--336
W. M. Turski A model of nonmorphological data
collection based on sentential calculus 337--340
P. W. Williams Balancing demand in a hierarchical
structure . . . . . . . . . . . . . . . 341--346
A. K. Burston and
D. J. Kinniment and
Hilary Kahn A design language for asynchronous logic 347--354
J. C. Romao and
R. Vilela Mendes Algorithms for Multidimensional
Numerical Integration with Singularities 355--358
A. Swift and
G. R. Lindfield Comparison of a Continuation Method with
Brent's Method for the Numerical
Solution of a Single Nonlinear Equation 359--362
J. R. Cash and
C. B. Liem On the computational aspects of
semi-implicit Runge--Kutta methods . . . 363--365
B. S. Lee Use of case studies in teaching data
processing . . . . . . . . . . . . . . . 366--372
G. L. Farr Algorithm 104: Generation of the
alphabetically ordered sequences from a
set of $N$ distinct objects . . . . . . 373--373
James J. Buckley and
Robert A. Fleck, Jr. Algorithm 105: Determining the number of
internal rates of return . . . . . . . . 373--377
A. C. Day Algorithms supplement: Statement of
policy . . . . . . . . . . . . . . . . . 377--377
M. H. Williams and
E. V. C. Fielding Discussion and correspondence: automatic
generation of payroll programs . . . . . 378--380
L. J. Mazlack Predicting student success in an
introductory programming course . . . . 380--381
S. J. Goldsack Correspondence: Semantic definition of
linear control algorithms . . . . . . . 381--382
Eric L. V. Hope Correspondence: Structured programming
input statements . . . . . . . . . . . . 382--382
R. Haskell and
The Editor Correspondence: Dissemination of
specialised information . . . . . . . . 382--382
Bruce L. Golden Correspondence: On ``An algorithm for
the solution of the postman's problem'' 383--383
C. B. Dunham Correspondence: Checking reproduction of
published programs . . . . . . . . . . . 383--383
W. Little and
D. A. Smith Correspondence: On ``Modifications to
the Forsythe-Moler algorithm for solving
linear algebraic systems'' . . . . . . . 383--383
D. Hitchin Correspondence: On ``Modifications to
the Forsythe-Moler algorithm for solving
linear algebraic systems'' . . . . . . . 384--384
J. M. Brady Book review: \em Structural Pattern
Recognition, by T. Pavlidis, 1977 . . . 384--384
Anonymous Editorial . . . . . . . . . . . . . . . 2--2
Lewis Corner Book reviews: \em Model Building in
Mathematical Programming, by H. P.
Williams, 1978; \em Computer Simulation
and Modeling: An Introduction, by R. S.
Lehman . . . . . . . . . . . . . . . . . 2--2
R. Burdekin and
R. S. Scowen Computers and the construction of
economic models . . . . . . . . . . . . 3--10
T. Briggs A review of road traffic simulation
methods using a general purpose digital
computer . . . . . . . . . . . . . . . . 11--16
C. B. Spengler and
J. B. Westwood Assessing Data Retrieval Capabilities: a
Case Study . . . . . . . . . . . . . . . 17--21
Eva Huzan Modelling of Indexed Sequential Files:
Monitoring Disc Transfers . . . . . . . 22--27
J. F. A. Wiederhold Tuning to Service Standards without
Monitors . . . . . . . . . . . . . . . . 28--36
R. Chattergy and
U. W. Pooch A distributed function computer with
dedicated processors . . . . . . . . . . 37--40
Y. Kobayashi and
T. L. Kunii A simulation of a minicomputer
controlled system and its use as a
debugging tool . . . . . . . . . . . . . 41--49
P. J. Brown Software Methods for Virtual Storage of
Executable Code . . . . . . . . . . . . 50--52
M. A. Hennell and
D. Hedley An experimental testbed for numerical
software. II. ALGOL 68 . . . . . . . . . 53--56
J. C. Turner The conditional distribution of waiting
time given queue length in a computer
system . . . . . . . . . . . . . . . . . 57--62
F. G. Pagan Algol 68 as a Metalanguage for
Denotational Semantics . . . . . . . . . 63--66
P. W. Williams and
D. Woodhead Computer assisted analysis of cryptic
crosswords . . . . . . . . . . . . . . . 67--70
A. G. Bell and
N. Jacobi How to read, make and store chess moves 71--76
G. Z. Ben-Yaacov Interactive Computation and Data
Management for Power System Studies . . 76--79
G. W. Hill Cyclic properties of pseudo-random
sequences of Mersenne prime residues . . 80--85
M. C. Pike and
J. Pixner Algorithm 2: Fibonacci search . . . . . 86--86
J. Boothroyd Certification of Algorithm 2: Fibonacci
search . . . . . . . . . . . . . . . . . 86--86
I. D. Hill Algorithm 3: Easter . . . . . . . . . . 86--87
J. Boothroyd Certification of Algorithm 3: Easter . . 87--87
J. Randle Certification of Algorithm 3: Easter . . 87--87
I. D. Hill and
M. C. Pike Algorithm 4: TWOBYTWO . . . . . . . . . 87--88
M. C. Pike Algorithm 5: RANCOMB . . . . . . . . . . 88--88
J. Boothroyd Algorithm 6: PERM . . . . . . . . . . . 88--89
J. Boothroyd Algorithm 7: MINX . . . . . . . . . . . 89--89
C. M. Reeves Algorithm 8: SUD . . . . . . . . . . . . 89--89
C. M. Reeves Algorithm 9: Boyserf . . . . . . . . . . 89--90
R. F. Shepherd Algorithms supplement: Statement of
policy . . . . . . . . . . . . . . . . . 90--90
Anonymous Erratum: Algorithm 105 . . . . . . . . . 90--90
N. Marovac Microcomputers in computer science
programmes . . . . . . . . . . . . . . . 91--94
Susan Jones A network display program . . . . . . . 98--104
A. T. Arblaster and
M. E. Sime and
T. R. G. Green Jumping to Some Purpose . . . . . . . . 105--109
F. Mavaddat and
B. Parhami A data structure for family relations 110--113
J. R. Oliver and
R. S. Newton Practical Experience with Algol 68-Rt 114--118
Sallie S. Nelson CONSIM: a Study of Control Issues in
Conversational Simulation . . . . . . . 119--126
Steven J. Harrington A New Symbolic Integration System in
REDUCE . . . . . . . . . . . . . . . . . 127--131
P. I. P. Boulton and
J. R. Goguen A machine description language . . . . . 132--135
G. A. Korn and
O. A. Palusinski Application of a Digital Computer
Simulation Language to Control Hybrid
Computer Monte Carlo Studies . . . . . . 136--141
A. Silberschatz On the safety of the I/O primitive in
Concurrent PASCAL . . . . . . . . . . . 142--145
J. L. Keedy and
K. Ramamohanarao and
J. Rosenberg On Implementing Semaphores with Sets . . 146--150
R. S. Bird Recursion Elimination with Variable
Parameters . . . . . . . . . . . . . . . 151--154
D. M. Nessett and
O. W. Rechard Allocation Algorithms for Dynamically
Microprogrammable Multiprocessor Systems 155--163
M. H. Williams Conditions for Extended Operator
Precedence Parsing . . . . . . . . . . . 164--168
S. S. Yau and
Y. S. Tang Generation of Shortest Test Sequences
for Detecting Individual Faults of
Sequential Circuits . . . . . . . . . . 169--172
S. L. Hurst An engineering consideration of spectral
transforms for ternary logic synthesis 173--183
J. R. Cash and
J. C. P. Miller On an Iterative Approach to the
Numerical Solution of Difference Schemes 184--187
A. Brown Algorithm 106: An algorithm for updating
an ordered list on a VDU . . . . . . . . 188--189
S. J. Waters Towards Comprehensive Specifications . . 195--199
P. A. Dearnley Application Level Microcode to Speed
Data Base Management . . . . . . . . . . 200--202
C. Lazos and
J. R. Yandle Improving CPU Utilisation in a
Multiprogramming System . . . . . . . . 203--205
F. W. Burton and
J. Kollias Optimising Disc Head Movements in
Secondary Key Retrievals . . . . . . . . 206--208
G. Haring and
R. Posch and
C. Leonhardt and
G. Gell The use of a synthetic jobstream in
performance evaluation . . . . . . . . . 209--219
O. Nevalainen and
J. Teuhola Priority Queue Administration by Sublist
Index . . . . . . . . . . . . . . . . . 220--225
E. F. Elsworth Compilation via an Intermediate Language 226--233
M. Di Manzo and
A. L. Frisiani and
G. Olimpo Loop Optimisation for Parallel
Processing . . . . . . . . . . . . . . . 234--239
Pierre Deransart Proof by Semantic Attributes of a Lisp
Compiler . . . . . . . . . . . . . . . . 240--245
M. Bozyigit and
Y. Paker A fixed routing problem in large and
high connectivity networks . . . . . . . 246--250
Z. M. Lotfi and
A. J. Tosser Minimising the NAND-NOR-XOR Network of
Modulo 2 Sum of Boolean Products . . . . 251--255
J. Mottl Description of a Program for Nonlinear
Programming . . . . . . . . . . . . . . 256--261
P. J. Green and
B. W. Silverman Constructing the Convex Hull of a Set of
Points in the Plane . . . . . . . . . . 262--266
R. H. Barlow and
D. J. Evans A parallel organisation of the bisection
algorithm . . . . . . . . . . . . . . . 267--269
K. A. Robinson An entity/event data modelling method 270--279
Various Discussion on ``An entity/event data
modelling method . . . . . . . . . . . . 279--281
W. L. Price and
M. Dowson Algorithm 107: A weighted simplex
procedure for the solution of
simultaneous nonlinear equations . . . . 282--282
Ole Òsterby Algorithm 108: Efficient solution of
tridiagonal linear systems . . . . . . . 283--285
P. Naur Critique of the ISO data processing
vocabulary . . . . . . . . . . . . . . . 286--286
Jane Hayden Correspondence: Nonmorphological data
collection . . . . . . . . . . . . . . . 286--287
David Jacobs Correspondence: Validating software . . 287--287
M. A. Sandys and
Aleph Null Correspondence: Point in polygon . . . . 287--288
A. N. Walker and
The Editor Algorithms: On ``Algorithm 1: Mintree'' 288--288
T. J. Howkins and
M. T. Harandi Towards More Portable Cobol . . . . . . 290--295
L. Moore Design for a Transportable Job
Organisation Language . . . . . . . . . 296--302
E. Gudes and
H. S. Koch and
F. A. Stahl Security in a Multi-Level Structured
Model of a Data Base . . . . . . . . . . 303--306
W. Burton A FORTRAN preprocessor to support
encapsulated data abstraction
definitions . . . . . . . . . . . . . . 307--312
T. Leipala and
O. Nevalainen A plotter sequencing system . . . . . . 313--316
B. A. Wichmann and
J. Du Croz A program to calculate the GAMM measure 317--322
C. Lazos and
A. Vafiadis A Method to Estimate the I/O Buffer Size
in a Computer System . . . . . . . . . . 323--327
P. I. P. Boulton and
M. A. R. Kittler Estimating Program Reliability . . . . . 328--331
H. R. Simpson and
K. Jackson Process Synchronisation in MASCOT . . . 332--345
C. M. Reeves Free store distribution under random fit
allocation. I . . . . . . . . . . . . . 346--351
J. R. Haley and
A. S. Noetzell A study of processing repetition . . . . 352--356
J. Loetzsch and
M. Machura and
W. Paetzold Sample implementation of a special
purpose language by the DEPOT system . . 357--362
J. Jelínek An Algebraic Theory for Parallel
Processor Design . . . . . . . . . . . . 363--375
M. J. C. Gordon On the power of list iteration . . . . . 376--379
G. Duncan Q charts --- a method of specification 380--381
K. M. Keir Correspondence: Vector approximation to
curves . . . . . . . . . . . . . . . . . 381--381
I. D. Hill Algorithm 109: Golden section search . . 383--384
P. Hammersley Corporate systems analysis --- a
personal editorial . . . . . . . . . . . 2--2
H. W. G. Gearing New approaches to systems analysis
design. Welcome . . . . . . . . . . . . 3--5
Enid Mumford Social aspects of systems analysis . . . 5--7
P. Hammersley The impact of changing technology . . . 7--9
P. Prowse The data base approach . . . . . . . . . 9--12
J. N. G. Brittain Design for a changing environment . . . 13--22
P. H. Prowse and
R. G. Johnson A Natural Language Data Base Interface
to the User . . . . . . . . . . . . . . 22--25
E. B. James The user interface . . . . . . . . . . . 25--28
Various Discussion on `New approaches to systems
analysis and design' . . . . . . . . . . 28--33
Anonymous Calls for papers . . . . . . . . . . . . 33--33
H. G. Perros A regression model for predicting the
response time of a disc I/O system . . . 34--36
N. Zvegintzov Partial-Match Retrieval in an Index
Sequential Directory . . . . . . . . . . 37--40
Jay Louise Weldon Using Data Base Abstractions for Logical
Design . . . . . . . . . . . . . . . . . 41--45
R. A. Earnshaw Line Tracking for Incremental Plotters 46--52
E. J. Yannokoudakis and
F. H. Ayres and
J. A. W. Huggill Character coding for bibliographical
record control . . . . . . . . . . . . . 53--60
K. L. Clark and
J. Darlington Algorithm classification through
synthesis . . . . . . . . . . . . . . . 61--65
D. J. Evans and
Shirley A. Williams Analysis and Detection of Parallel
Processable Code . . . . . . . . . . . . 66--72
Y. Igarashi The size of arrays for a prime implicant
generating algorithm . . . . . . . . . . 73--77
I. H. Witten Algorithms for adaptive linear
prediction . . . . . . . . . . . . . . . 78--84
J. P. Abbott Algorithm 110: Computing solution arcs
of nonlinear equations with a parameter 85--89
M. J. Denham Book review: \em Systems Decomposition,
Optimisation and Control, by M. G. Singh
and A. Titli . . . . . . . . . . . . . . 89--89
N. L. Sarda and
J. R. Isaac Automatic analysis and design of
information processing systems . . . . . 90--94
I. D. Hill Correspondence: Jumping to some purpose 94--94
J. V. Hansen and
Lynn J. McKell A computer aid for the analysis of
complex systems . . . . . . . . . . . . 98--106
C. T. Burton Book review: \em Artificial
Intelligence, Volume 1 by P. H. Winston
and R. H. Brown . . . . . . . . . . . . 106--106
R. E. Griswold The use of character sets and character
mappings in Icon . . . . . . . . . . . . 107--114
P. B. Fellget and
C. D. Easteal Book reviews: \em The Phenomenon of
Science: A Cybernetic Approach to Human
Evolution, by V. F. Turchin, 1977; \em
Business Systems Handbook, by Robert W.
Gilmour, 1979 . . . . . . . . . . . . . 114--114
J. M. Bishop and
D. W. Barron Procedure calling and structured
architecture . . . . . . . . . . . . . . 115--123
R. W. Paulson Book review: \em An Introduction to
Computational Fluid Mechanics, by
Chuen-Yen Chow, 1979 . . . . . . . . . . 123--123
S. A. Kent A minicomputer based high level network
control language . . . . . . . . . . . . 124--131
Deborah Hart Joint BCS ACM symposium on Research and
Development in Information Retrieval . . 131--131
R. Haskell and
P. G. Harrison System Conventions for Non Procedural
Languages . . . . . . . . . . . . . . . 132--141
D. L. A. Barber and
J. M. Brady Book Review: \em Data Communications and
Teleprocessing Systems, by T. Horsley,
1979; \em A Technique for Software and
Systems Design, by R. J. Lano, 1979 . . 141--141
R. H. Perrott and
A. K. Raja and
P. C. O'Kane A simulation experiment using two
languages . . . . . . . . . . . . . . . 142--146
Brian Ford and
David Jacobs and
A. M. Addyman Book reviews: \em Workshop on Reliable
Software: Applied Computer Science, by
Peter Raulefs, 1979; \em Reliable
Software Through Composite Design, by G.
J. Myers, 1975; \em Fortran, PL/1 and
the Algols, by Brian Meek, 1978 . . . . 146--146
I. C. Wand Dynamic resource allocation and
supervision with the programming
language MODULA . . . . . . . . . . . . 147--152
D. M. Vallance and
Peter H. Prowse Book reviews: \em Programming in
Standard Fortran 77, by A. Balfour and
D. Marwick, 1979; \em Issues in Data
Base Management, by Herbert Weber and
Anthony I. Wasserman, 1979 . . . . . . . 152--152
D. T. Goodwin Partial Non-Underflow and Non-Overflow
of an Arithmetic Stack . . . . . . . . . 153--160
Roy Newton and
Harley Quilliam Book reviews: \em Software Portability:
an Advanced Course, edited by P. J.
Brown, 1977; \em The Challenge of
Microprocessors, by M. G. Hartley and
Anne Buckley, 1979 . . . . . . . . . . . 160--160
B. Dasarathy and
Cheng Yang A Transformation on Ordered Trees . . . 161--164
A. H. Wise and
A. Colin Day Book reviews: \em Machine and Assembly
Language Programming of the PDP-11, by
Arthur Gill, 1979; \em Assembly Language
Fundamentals, by Rina Yarmish and J.
Yarmish, 1978 . . . . . . . . . . . . . 164--164
M. Rabel and
D. Dubus and
A. Tosser Saving of NAND/NOR gates by inhibition
or $d$-Inhibition . . . . . . . . . . . 165--185
D. Westreich An efficient predictor-corrector
algorithm . . . . . . . . . . . . . . . 186--186
M. D. Atkinson Permutation groups and set union
algorithms . . . . . . . . . . . . . . . 187--187
D. Westreich Improving polynomial evaluation at an
approximate root . . . . . . . . . . . . 187--187
J. A. T. Maddison Fast lookup in hash tables with direct
rehashing . . . . . . . . . . . . . . . 188--189
Michael de Smith Points, polygons, and areas . . . . . . 189--189
N. B. Taylor Correspondence: Jumping to some purpose 189--190
Mervyn Bryn-Jones Correspondence: Points and $n$-sided
irregular figures . . . . . . . . . . . 190--190
G. Emery Book reviews: \em Associative networks,
edited by N. V. Findler, 1979; \em The
MU5 Computer System, by Derrick Morris
and Rolland N. Ibbett, 1979; \em Cobol:
An Introduction to Structured Logic and
Modular Program Design, by William Davis
and Richard Fisher, 1979 . . . . . . . . 191--191
J. M. Triance Structured Programming in COBOL --- the
Current Options . . . . . . . . . . . . 194--200
S. M. Deen A canonical schema for a generalised
data model with local interfaces . . . . 201--206
M. Hatzopoulos and
J. G. Kollias Some Rules for Introducing Indexing
Paths in a Primary File . . . . . . . . 207--211
R. B. E. Napper and
R. N. Fisher RCC --- a User-Extensible Systems
Implementation Language . . . . . . . . 212--222
R. N. Horspool and
N. Marovac An approach to the problem of
detranslation of computer programs . . . 223--229
W. T. Jones and
S. A. Kirk APL as a Software Design Specification
Language . . . . . . . . . . . . . . . . 230--232
A. F. Eidelson and
I. J. Robinson Implementation of BEDSOCS: an
Interactive Simulation Language . . . . 233--236
G. R. Garside and
P. E. Pintelas An ALGOL 68 package for implementing
graph algorithms . . . . . . . . . . . . 237--242
D. F. Cowell and
D. F. Gillies and
A. A. Kaposi Synthesis and Structural Analysis of
Abstract Programs . . . . . . . . . . . 243--247
T. Ottmann and
D. Wood $1-2$ brother trees or AVL trees
revisited . . . . . . . . . . . . . . . 248--255
A. Albano and
R. Orsini A tree search approach to the
${M}$-partition and Knapsack problems 256--261
R. K. Lutz An algorithm for the real time analysis
of digitised images . . . . . . . . . . 262--269
A. J. T. Colin and
A. D. McGettrick and
P. D. Smith Sorting trains . . . . . . . . . . . . . 270--273
I. J. Riddell and
L. M. Delves The comparison of routines for solving
Fredholm integral equations of the
second kind . . . . . . . . . . . . . . 274--285
W. A. Zaremba Discussion and correspondence: An
alternative for the `completer' function 286--287
M. K. Crowe Porting virtual object files . . . . . . 287--288
G. L. Robinson Correspondence: Jumping to some purpose 288--288
L. Lipsky A study of time sharing systems
considered as queueing networks of
exponential servers . . . . . . . . . . 290--297
C. M. Reeves Free store distribution under random fit
allocation: Part 2 . . . . . . . . . . . 298--306
G. Schmidt and
T. Ströhlein Timetable Construction --- an Annotated
Bibliography . . . . . . . . . . . . . . 307--316
A. Boccalatte and
M. Di Manzo An approach to the detection of semantic
errors . . . . . . . . . . . . . . . . . 317--323
D. Y. Feng and
R. F. Riesenfeld Some New Surface Forms for Computer
Aided Geometric Design . . . . . . . . . 324--331
T. I. Fenner and
G. Loizou A binary tree representation and related
algorithms for generating integer
partitions . . . . . . . . . . . . . . . 332--337
A. Albano and
R. Orsini A heuristic solution of the rectangular
cutting stock problem . . . . . . . . . 338--343
Y. L. Varol On a subset of all the permutations of
$n$ marks . . . . . . . . . . . . . . . 344--346
M. A. Bramer Correct and optimal strategies in game
playing programs . . . . . . . . . . . . 347--352
I. Bratko and
D. Michie An advice program for a complex chess
programming task . . . . . . . . . . . . 353--359
J. Mottl Description of a program for nonlinear
programming: special problem of bivalent
nonlinear programming . . . . . . . . . 360--368
D. Michie Expert systems . . . . . . . . . . . . . 369--376
R. S. Lemos Discussion and correspondence: Measuring
students' attitudes towards structured
walk-throughs . . . . . . . . . . . . . 377--380
S. N. Johnson and
Jay Louise Correspondence: Using data abstraction
for logical design . . . . . . . . . . . 380--380
Martyn Thoma Correspondence: The unconditional branch
--- a modest proposal . . . . . . . . . 380--381
R. Reeves Correspondence: Using data abstraction
for logical design . . . . . . . . . . . 381--382
J. Snell Correspondence: On ``An efficient
predictor-corrector algorithm'' . . . . 382--382
D. K. Messham and
A. Elliott Correspondence: Procedure calling and
structured architecture . . . . . . . . 382--383
Anonymous Erratum: ``An efficient
predictor-corrector algorithm'' . . . . 383--383
R. I. Kitney Book review: \em Computing Principles
and Techniques, by B. L. Vickery, 1979 383--383
P. Hammersley Editorial . . . . . . . . . . . . . . . 1--1
Anonymous The Wilkes Prize . . . . . . . . . . . . 1--1
Anonymous Information for authors . . . . . . . . 2--2
M. Healey The possible impact of minicomputers and
microprocessors on mainframe computer
manufacturers . . . . . . . . . . . . . 3--8
E. B. James Microelectronics: the impact on computer
centres . . . . . . . . . . . . . . . . 9--13
P. Hammersley The impact of microcomputer systems on
commercial data processing . . . . . . . 14--16
K. Ekanadham and
A. Mahjoub Microcomputer Networks . . . . . . . . . 17--24
J. C. Cavouras and
R. H. Davis Simulation Tools in Computer System
Design Methodologies . . . . . . . . . . 25--28
J. G. Kollias and
M. Hatzopoulos Criteria to aid in solving the problem
of allocating copies of a file in a
computer network . . . . . . . . . . . . 29--30
R. A. Davenport Design of Distributed Data Base Systems 31--41
M. J. R. Shave Entities, Functions, and Binary
Relations: Steps to a Conceptual Schema 42--47
Naveen Prakash and
P. Sadanandan and
S. M. Desai and
K. Rama Rao and
P. N. Gejji Samhita --- a Data Base Management
System . . . . . . . . . . . . . . . . . 48--51
Wendy J. Milne A framework for the investigation of a
spatial data base . . . . . . . . . . . 52--55
Amilcar Sernadas SYSTEMATICS: its syntax and semantics as
a query language . . . . . . . . . . . . 56--61
I. H. Witten and
Y. H. Ng An ideographic language front end
processor for accessing English language
computer systems . . . . . . . . . . . . 62--70
K. Ewusi-Mensah Computer Network Usage Control Through
Peak Load Pricing . . . . . . . . . . . 71--77
A. Silberschatz Port Directed Communication . . . . . . 78--82
Y. L. Varol and
D. Rotem An algorithm to generate all topological
sorting arrangements . . . . . . . . . . 83--84
R. D. Dutton and
R. C. Brigham A New Graph Colouring Algorithm . . . . 85--86
S. Incerti and
F. Zirilli and
V. Parisi Algorithm 111: A FORTRAN subroutine for
solving systems of nonlinear
simultaneous equations . . . . . . . . . 87--91
A. G. Bell and
R. Lovett Book reviews: \em Software Reliability
Guidebook, by Robert L. Glass, 1979; \em
Foundations of Computer Science, by M.
S. Carberry, H. M. Khalil and J. F.
Leathrum and L. S. Levy, 1979 . . . . . 91--91
P. R. Bird Discussion and correspondence: Data
structures for catalogues of sound
recordings . . . . . . . . . . . . . . . 92--94
Nickolia Kiossev Correspondence: Points and polygons . . 94--95
A. A. Cr0xf0rd Correspondence: Os, zeros, thetas, and
pis . . . . . . . . . . . . . . . . . . 95--95
D. J. Taylor Correspondence: GOTOs in practice . . . 95--95
J. G. Hunt Correspondence: Premature termination 95--95
R. P. Brent Correspondence: Comments on papers by
Maddison and Westreich . . . . . . . . . 95--96
D. J. Cairns and
P. R. Freeman Book reviews: \em Theory and Design of
Digital Computer Systems, 2nd ed., by
Douglas Lewin, 1980; \em Statistical
Computing, by W. J. Kennedy and J. E.
Gentle, 1980 . . . . . . . . . . . . . . 96--96
P. Stecher and
Volker Allenstein Application Controller Concept: a First
Experience . . . . . . . . . . . . . . . 97--106
P. D. Smith and
S. Y. Steen Prototype Crossword Compiler . . . . . . 107--111
S. Alagic and
A. Kulenovic Relational Pascal Data Base Interface 112--117
K. W. Short Protection in Data Type Abstractions
Using Constraints on Data Values . . . . 118--124
Amilcar Sernadas SYSTEMATICS: Its syntax and semantics as
a query language (2) . . . . . . . . . . 125--129
W. B. Samson Hash Table Collision Handling on Storage
Devices with Latency . . . . . . . . . . 130--131
W. T. Graybeal and
U. W. Pooch Design of Calibration Experiments for
Synthetic Jobs . . . . . . . . . . . . . 132--138
Tony P. Lucido and
Rahul Chattergy and
Udo W. Pooch Survey of Microprogram Verification and
Validation Methods . . . . . . . . . . . 139--142
F. G. Pagan Style for Writing the Syntactic Portions
of Complete Definitions of Programming
Languages . . . . . . . . . . . . . . . 143--147
K. Brinck and
N. Y. Foo Analysis of Algorithms on Threaded Trees 148--155
M. A. Harrison and
A. Yehudai Eliminating Null Rules in Linear Time 156--161
A. Bowyer Computing Dirichlet tessellations . . . 162--166
D. F. Watson Computing the $n$-dimensional Delaunay
tessellation with application to
Vorono\uì polytopes . . . . . . . . . . . 167--172
Yaakov L. Varol and
Doron Rotem Some Experiences with the
Johnson-Trotter Permutation Generation
Algorithm . . . . . . . . . . . . . . . 173--176
W. A. Sentance and
I. P. Cliff The Determination of Eigenvalues of
Symmetric Quindiagonal Matrices . . . . 177--179
S. O. Bateman, Jr. and
S. D. Danielopoulos Computerised Analytic Solutions of
Second Order Differential Equations . . 180--183
L. M. Delves and
L. F. Abd-Elal and
J. A. Hendry Set of Modules for the Solution of
Integral Equations . . . . . . . . . . . 184--190
S. Jones and
C. M. Reeves Book reviews: \em Principles of Database
Systems, by J. D. Ullman, 1980; \em
Mathematical Methods in Computer
Graphics and Design, edited by K. W.
Brodie, 1980 . . . . . . . . . . . . . . 190--190
D. Bell and
Donald Michie Correspondence: Expert systems . . . . . 191--191
J. Stephenson and
G. Brown Correspondence: Implementation of
BEDSOCS: An interactive simulation
language . . . . . . . . . . . . . . . . 191--192
J. D. Wigg Correspondence: Unconditional branches 192--192
D. F. Hartley and
The Editor Correspondence: The Wilkes Award . . . . 192--192
F. S. Zahran Universal Data Model Holder for Data
Dictionary Systems . . . . . . . . . . . 193--199
S. M. Deen and
D. Nikodem and
A. Vashishta Design of a Canonical Database System
(PRECI) . . . . . . . . . . . . . . . . 200--209
J. M. Bishop and
D. W. Barron Principles of Descriptors . . . . . . . 210--221
L. V. Atkinson and
J. J. McGregor and
S. D. North Context Sensitive Editing as an Approach
to Incremental Compilation . . . . . . . 222--229
C. Lazos Increasing Computer System Productivity
Software and Hardware Methods: a
Comparative Study . . . . . . . . . . . 230--234
M. E. Falla Gamma Software Engineering System . . . 235--242
H. Wettstein Locking Operations for Maximum
Concurrency . . . . . . . . . . . . . . 243--248
H. W. Thimbleby A word boundary algorithm for text
processing . . . . . . . . . . . . . . . 249--255
G. F. Butler and
J. Pike Free-Format Data Input Scheme Written in
Standard FORTRAN (ANSI 66) . . . . . . . 256--257
A. C. Kilgour Book review: \em ILP: Intermediate
Language for Pictures, by P. J. W. ten
Hagen, T. Hagen, P. Klint, H. Noot, N.
J. Sint, and A. H. Veen, 1981 . . . . . 257--257
Ronald E. Prather and
Shirla G. Giulieri Decomposition of Flow Chart Schemata . . 258--262
Z. Zdrahal and
I. Bratko and
A. Shapiro Recognition of Complex Patterns Using
Cellular Arrays . . . . . . . . . . . . 263--270
Brian A. Barsky and
Spencer W. Thomas TRANSPLINE --- a System for Representing
Curves Using Transformations Among Four
Spline Formulations . . . . . . . . . . 271--277
Donald Michie A Theory of Evaluative Comments in Chess
with a Note on Minimaxing . . . . . . . 278--286
I. P. Page and
R. T. Wood Shaded-Picture Scanning Attachment for
Incremental Plotters . . . . . . . . . . 287--287
Edward M. Reingold A comment on the evaluation of Polish
postfix expressions . . . . . . . . . . 288--288
A. D. Chambers Current Strategies for Computer Auditing
Within an Organization . . . . . . . . . 290--294
Donald Millington Structured Systems Analysis and Design
Using Standard Flowcharting Symbols . . 295--300
W. T. Izatt and
E. A. Schmitz Data Structures and Descriptors in the
ICL 2900 Series and Beyond . . . . . . . 301--307
F. Warren Burton and
Brian J. Lings Abstract Data Types, Subtypes and Data
Independence . . . . . . . . . . . . . . 308--311
Ian A. Macleod Relational Model as a Basis for Document
Retrieval System Design . . . . . . . . 312--315
Steven J. Harrington Space Efficient Copying Storage Recovery 316--319
Alison M. Pringle Justification with Fewer Hyphens . . . . 320--323
J. Pike Text Compression Using a $4$-Bit Coding
Scheme . . . . . . . . . . . . . . . . . 324--330
K. Hopper Retained Objects and Operating System
Interfaces . . . . . . . . . . . . . . . 331--338
I. P. Page and
R. T. Wood Empirical Analysis of a Moving Head Disc
Model with Two Heads Separated by a
Fixed Number of Tracks . . . . . . . . . 339--342
A. D. Elliman and
A. R. Sudhindra Performances of Two Microprocessor-Based
Multiplexor Techniques . . . . . . . . . 343--346
E. Foxley and
O. Salman Validation of an Analytic Model of
Computer Performance . . . . . . . . . . 347--352
Adrian Bowyer and
Philip J. Willis and
John R. Woodwark A Multiprocessor Architecture for
Solving Spatial Problems . . . . . . . . 353--357
H. Gomaa Hybrid Simulation/Regression Model of a
Virtual Storage System . . . . . . . . . 358--366
James K. Mullin Change Area B-Trees: a Technique to Aid
Error Recovery . . . . . . . . . . . . . 367--373
I. Sklená\vr Affine Slices . . . . . . . . . . . . . 374--377
Robin Sibson and
Graeme D. Thomson Seamed Quadratic Element for Contouring 378--382
R. A. Frost Algorithm 112: Dumping the index of a
dynamic hash table . . . . . . . . . . . 383--384
R. W. Newton and
F. Panzieri and
C. C. Chang and
A. M. Addyman Book reviews: \em Programming Language
Standardisation, edited by I. D. Hill
and B. L. Meek, 1980; \em Problem
Solving and Structured Programming, by
E. B. Koffmann, 1981; \em Data Base:
Structured Techniques for Design,
Performance and Management, by S. Atre,
1980; \em Pascal --- The Language and
its Implementation, edited by D. W.
Barron, 1981 . . . . . . . . . . . . . . 384--384
F. W. Allen A file index for document storage and
retrieval utilizing descriptor fragments 2--6
I. P. Schagen Automatic Contouring from Scattered Data
Points . . . . . . . . . . . . . . . . . 7--11
A. T. Wood-Harper and
G. Fitzgerald A taxonomy of current approaches to
systems analysis . . . . . . . . . . . . 12--16
Richard Kieburtz and
Abraham Silberschatz On the Static Access-Control Mechanism
in Concurrent Pascal . . . . . . . . . . 17--21
Nenad Marovac The rotating bus as a basis for
interprocess communication in
distributed systems . . . . . . . . . . 22--31
I. P. Page Optimal Fit of Arbitrary Sized Segments 32--33
Abraham Silberschatz Priority and Queuing Specification in
`Distributed Processes' . . . . . . . . 34--36
A. J. B. Travis An aid to pattern recognition . . . . . 37--44
Jarmo Ernvall and
Olli Nevalainen An algorithm for unbiased random
sampling . . . . . . . . . . . . . . . . 45--47
E. Skordalakis and
G. Papakonstantinou A control structure for a variable
number of nested loops . . . . . . . . . 48--51
J. J. Cocu and
R. E. Devillers On a Class of Allocation Strategies
Inducing Bounded Delays Only . . . . . . 52--55
R. H. Barlow and
D. J. Evans Parallel Algorithms for the Iterative
Solution to Linear Systems . . . . . . . 56--60
C. B. Dunham The necessity of publishing programs . . 61--62
Frank G. Pagan Semantic specification using two-level
grammars: labels and GOTO statements . . 63--67
C. Robert Carlson and
Adarsh K. Arora and
Miroslava Milosavljevic Carlson The application of functional dependency
theory to relational databases . . . . . 68--73
R. J. T. Morris and
J. S. Kaufman Performance Comparison of I/O Access
Disciplines for Transaction-Processing
Systems . . . . . . . . . . . . . . . . 74--83
B. Schmidt Simulation of Discrete Systems Using
GPSS-Fortran . . . . . . . . . . . . . . 84--86
M. Bozyigit and
Y. Paker A topology reconfiguration mechanism for
distributed computer systems . . . . . . 87--92
M. C. Er and
B. G. T. Lowden The theory and practice of constructing
an optimal polyphase sort . . . . . . . 93--101
C. M. McCulloch Quickshunt --- a Distributive Sorting
Algorithm . . . . . . . . . . . . . . . 102--104
D. Michie Experiments on the mechanization of
game-learning. II. Rule-based learning
and the human window . . . . . . . . . . 105--113
M. L. V. Pitteway and
A. J. R. Green Bresenham's algorithm with run line
coding shortcut . . . . . . . . . . . . 114--115
Jack E. Bresenham Incremental Line Compaction . . . . . . 116--120
J. L. Keedy and
J. Rosenberg and
K. Ramamohanarao On Synchronizing Readers and Writers
with Semaphores . . . . . . . . . . . . 121--125
M. Hatzopoulos and
J. G. Kollias The determination of the optimum
database maintenance points . . . . . . 126--129
Julie Scoltock A survey of the literature of cluster
analysis . . . . . . . . . . . . . . . . 130--134
R. W. A. Hudson and
J. A. Self A dialogue system to teach database
concepts . . . . . . . . . . . . . . . . 135--139
A. J. Wilkes and
N. E. Wiseman A Soft-Edged Character Set and its
Derivation . . . . . . . . . . . . . . . 140--147
R. C. Thomas and
A. Burns The case for distributed decision making
systems . . . . . . . . . . . . . . . . 148--152
Philip C. Treleaven Workshop report: VLSI Machine
Architectures and Very High Level
Languages . . . . . . . . . . . . . . . 153--157
R. A. Frost and
M. M. Peterson A short note on binary search trees . . 158--158
D. J. M. Davies A note on sparsely filled dynamically
allocated memory . . . . . . . . . . . . 159--159
B. Shackel The BLEND system: programme for the
study of some `electronic journals' . . 161--168
J. S. Johnson and
D. B. Webster Updating an Inverted Index --- a
Performance Comparison of Two Techniques 169--175
Graham Lee DOPLs: A New Style of Programming . . . 176--182
E. J. Yannakoudakis and
A. K. P. Wu Quasi-Equifrequent Group Generation and
Evaluation . . . . . . . . . . . . . . . 183--187
Reginald Muchsel Performance Measurements --- a Practical
Example from a German University
Computing Centre . . . . . . . . . . . . 188--192
C. H. C. Leung A simple model for the performance
analysis of disc storage fragmentation 193--198
C. H. C. Leung An improved optimal-fit procedure for
dynamic storage allocation . . . . . . . 199--206
Philip C. Treleaven and
Richard P. Hopkins and
Paul W. Rautenbach Combining Data Flow and Control Flow
Computing . . . . . . . . . . . . . . . 207--217
N. E. Goller Triodic Logic and its Use in Structured
Program Design . . . . . . . . . . . . . 218--226
William E. Wright Single Versus Double Buffering in
Constrained Merging . . . . . . . . . . 227--230
A. Blake Fixed Point Solutions of Recursive
Operations on Boolean Arrays . . . . . . 231--234
J. R. Woodwark The Explicit Quad Tree As a Structure
for Computer Graphics . . . . . . . . . 235--238
G. Papakonstantinou Optimal Evaluation of Queries . . . . . 239--241
J. R. Lin Sin Cho Automatic Report Formatting from a
Report Specimen . . . . . . . . . . . . 242--247
B. A. Wichmann A comparison of PASCAL and Ada . . . . . 248--252
P. A. Dearnley Software Development for Microcomputer
Data Processing Systems . . . . . . . . 253--256
R. W. Topor Functional Programs for Generating
Permutations . . . . . . . . . . . . . . 257--263
P. G. Harrison Efficient Storage Management for
Functional Languages . . . . . . . . . . 264--271
Chris Corbett and
Ian H. Witten On the Inclusion and Placement of
Documentation Graphics in Computer
Typesetting . . . . . . . . . . . . . . 272--277
Robert Piessens Algorithm 113: Inversion of the Laplace
transform . . . . . . . . . . . . . . . 278--282
F. F. Land Tutorial . . . . . . . . . . . . . . . . 283--285
J. Watt Correspondence: The possible impact of
minicomputers and microprocessors [on]
mainframe computer manufacturers . . . . 286--286
Marek Missala and
Piotr Rudnicki Correspondence: Jumping to some purpose 286--286
Anonymous Call for registration . . . . . . . . . 286--286
D. J. G. Farlie and
Mildred L. G. Shaw and
B. A. Wichmann and
S. H. Lavington Book reviews: W. M. Brelsford and R. A.
Relles, \em STATLILB: A Statistical
Computing Laboratory, 1981; N. Rushby
(ed.), \em Selected Readings in
Computer-Based Learning, 1981; R. D.
Tennent, \em Principles of Programming
Languages, 1981; D. Hutchison, \em
Fundamentals of Computer Logic, 1981 . . 287--287
Anonymous Information for Authors . . . . . . . . 288--288
M. H. Williams The programming language BPL . . . . . . 289--306
C. J. Rosenquist Entity life cycle models and their
applicability to information systems
development life cycles, a framework for
information systems design and
implementation . . . . . . . . . . . . . 307--315
Dusan M. Velasevic Right-To-Left Code Generation for
Arithmetic Expressions . . . . . . . . . 316--326
K. P. Tan and
L. S. Hsu Block sorting of a large file in
external storage by a $2$-component key 327--330
A. Boccalatte and
M. Di Manzo and
D. Sciarra Error Recovery with Attribute Grammars 331--337
Charles J. Colbourn Computing the Chromatic Index of Steiner
Triple Systems . . . . . . . . . . . . . 338--339
R. Nigel Horspool and
Laurence W. Dunkelman Analysis and Optimization of Set
Expressions . . . . . . . . . . . . . . 340--346
Per-Åke Larson Expected Worst-Case Performance of Hash
Files . . . . . . . . . . . . . . . . . 347--352
Bengt Erik Bengtsson Packing Rectangular Pieces --- a
Heuristic Approach . . . . . . . . . . . 353--357
R. A. Frost Binary-Relational Storage Structures . . 358--367
Arvola Chan and
Bahram Niamir On Estimating the Cost of Accessing
Records in Blocked Database
Organizations . . . . . . . . . . . . . 368--374
Peter J. L. Wallis The preparation of guidelines for
portable programming in high-level
languages . . . . . . . . . . . . . . . 375--378
G. Oulsnam Unravelling Unstructured Programs . . . 379--387
M. D. McIlroy The Number of States of a Dynamic
Storage Allocation System . . . . . . . 388--392
M. H. Williams A comment on the decomposition of
flowchart schemata . . . . . . . . . . . 393--396
M. C. Er A note on computing precedence functions 397--398
A. Parkin Data Analysis and System Design by
Entity-Relationship Modelling --- a
Practical Example . . . . . . . . . . . 401--409
C. R. Symons and
P. Tijsma A Systematic and Practical Approach to
the Definition of Data . . . . . . . . . 410--422
M. Mor and
A. S. Fraenkel Permutation Generation on Vector
Processors . . . . . . . . . . . . . . . 423--428
D. J. Tomlinson An aid to hidden surface removal in real
time CGI systems . . . . . . . . . . . . 429--441
M. C. Er A representation approach to the Tower
of Hanoi problem . . . . . . . . . . . . 442--447
R. A. Brooker A `database' subsystem for BCPL . . . . 448--464
Elaine J. Weyuker On Testing Non-Testable Programs . . . . 465--470
R. Sacks-Davis Applications of Redundant Number
Representations to Decimal Arithmetic 471--477
K. Ramamohanarao and
John W. Lloyd Dynamic Hashing Schemes . . . . . . . . 478--485
D. A. Bell and
S. M. Deen Key Space Compression and Hashing in
PRECI . . . . . . . . . . . . . . . . . 486--492
J. Shanehchi and
D. J. Evans A modified bisection algorithm for the
determination of the eigenvalues of a
symmetric quindiagonal matrix . . . . . 493--494
Philip Leith Hierarchically Structured Production
Rules . . . . . . . . . . . . . . . . . 1--5
R. H. Barlow and
D. J. Evans and
J. Shanehchi Parallel Multisection Applied to the
Eigenvalue Problem . . . . . . . . . . . 6--9
C. H. C. Leung and
K. Wolfenden Disc Database Efficiency: a Scheme for
Detailed Assessment Based on Semi-Markov
Models . . . . . . . . . . . . . . . . . 10--14
S. O. Anderson and
R. C. Backhouse and
E. H. Bugge and
C. P. Stirling An assessment of locally least-cost
error recovery . . . . . . . . . . . . . 15--24
C. M. Reeves Free store distribution under random fit
allocation. III . . . . . . . . . . . . 25--35
P. A. Dearnley and
P. J. Mayhew In Favour of System Prototypes and Their
Integration into the Systems Development
Cycle . . . . . . . . . . . . . . . . . 36--42
William E. Wright Some File Structure Considerations
Pertaining to Magnetic Bubble Memory . . 43--51
N. H. Gehani High Level Form Definition in Office
Information Systems . . . . . . . . . . 52--59
J. M. Triance The proposed COBOL Standard --- its
significance . . . . . . . . . . . . . . 60--67
D. G. N. Hunter and
A. R. McKenzie Experiments with Relaxation Algorithms
for Breaking Simple Substitution Ciphers 68--71
S. B. Wampler and
R. E. Griswold Co-expressions in Icon . . . . . . . . . 72--78
A. T. Wood-Harper and
D. J. Flynn Action Learning for Teaching Information
Systems . . . . . . . . . . . . . . . . 79--82
M. A. Oliver and
N. E. Wiseman Operations on Quadtree Encoded Images 83--91
J. M. Wilson Algorithm 114: Interrupted permutations
in lexicographic order . . . . . . . . . 92--92
R. A. Reynolds Human performance in interactive
graphics operations . . . . . . . . . . 93--94
Phalguni Gupta and
G. P. Bhattacharjee Parallel Generation of Permutations . . 97--105
Gaston H. Gonnet and
Henk J. Olivié and
Derick Wood Height-Ratio-Balanced Trees . . . . . . 106--108
C. G. Broyden A mark-scaling algorithm . . . . . . . . 109--112
C. H. C. Leung Analysis of Disc Fragmentation Using
Markov Chains . . . . . . . . . . . . . 113--116
J. G. Kollias The effect of missing, retroactive,
erroneous and/or late data in designing
accounting applications . . . . . . . . 117--123
R. A. Frost and
S. Whittaker A step towards the automatic maintenance
of the semantic integrity of databases 124--133
John C. Cavouras Computer System Evaluation Through
Supervisor Replication . . . . . . . . . 134--141
David A. Watt and
Ole Lehrmann Madsen Extended Attribute Grammars . . . . . . 142--153
R. Lesuisse Some Lessons Drawn from the History of
the Binary Search Algorithm . . . . . . 154--163
Lloyd Allison Programming Denotational Semantics . . . 164--174
R. E. Griswold and
Michael Novak Programmer-Defined Control Operations 175--183
N. N. Chan and
Kim-Hung Li Algorithm 115: A FORTRAN subroutine for
finding a real symmetric matrix with
prescribed diagonal elements and
eigenvalues . . . . . . . . . . . . . . 184--186
C. J. Prosser A note on computing the square root of
an integer . . . . . . . . . . . . . . . 187--188
F. Warren Burton and
J. G. Kollias Comment on ``The explicit quad tree as a
structure for computer graphics'' . . . 188--188
D. J. Evans and
F. Abdollahzadeh Efficient Construction of Balanced
Binary Trees . . . . . . . . . . . . . . 193--195
C. H. C. Leung A model for disc locality referencing 196--198
A. M. R. Smith and
L. S. Lee and
D. J. Hand Interactive User-Friendly Interfaces to
Statistical Packages . . . . . . . . . . 199--204
M. C. Er A note on generating well-formed
parenthesis strings lexicographically 205--207
J. V. Woods and
A. J. T. Wheen MU6P: an Advanced Microprocessor
Architecture . . . . . . . . . . . . . . 208--217
Jan Schlörer Information Loss in Partitioned
Statistical Databases . . . . . . . . . 218--223
M. C. Er Fast Algorithm for Computing Order-${K}$
Fibonacci Numbers . . . . . . . . . . . 224--227
R. A. Frost SCHEMAL: Yet Another Conceptual Schema
Definition Language . . . . . . . . . . 228--234
B. E. J. Clark and
S. K. Robinson A Graphically Interacting Program
Monitor . . . . . . . . . . . . . . . . 235--238
A. F. Smeaton and
C. J. van Rijsbergen The retrieval effects of query expansion
on a feedback document retrieval system 239--246
B. Shackel and
D. J. Pullinger and
T. I. Maude and
W. P. Dodd The BLEND-LINC project on `electronic
journals' after two years . . . . . . . 247--254
J. R. Quinlan INFERNO: a cautious approach to
uncertain interference . . . . . . . . . 255--269
M. H. Williams Flowchart Schemata and the Problem of
Nomenclature . . . . . . . . . . . . . . 270--276
Eric C. R. Hehner and
Brad A. Silverberg Programming with Grammars: an Exercise
in Methodology-Directed Language Design 277--281
B. J. McKenzie and
T. Takaoko A control structure for a variable
number of nested loops . . . . . . . . . 282--283
M. J. Cookson Taxonomic studies on current approaches
to systems analysis . . . . . . . . . . 283--284
Pierre Lescanne Behavioural Categoricity of Abstract
Data Type Specifications . . . . . . . . 289--292
M. C. Er A Parallel Computation Approach to
Topological Sorting . . . . . . . . . . 293--295
P. D. Smith XENO: Computer-Assisted Compilation of
Crossword Puzzles . . . . . . . . . . . 296--302
John A. Llewellyn Finite State Models in the Study of
Comma-Free Codes . . . . . . . . . . . . 303--311
P. K. Ghosh and
S. P. Mudur Parametric Curves for Graphic Design
Systems . . . . . . . . . . . . . . . . 312--319
J. S. Deogun On Scheduling with Ready Times to
Minimize Mean Flow Time . . . . . . . . 320--328
Naveen Prakash and
Parimala N. and
N. Bolloju Data Definition Facilities in Admin . . 329--335
Aviezri S. Fraenkel and
Moshe Mor Combinatorial Compression and
Partitioning of Large Dictionaries . . . 336--343
John K. Slape and
Peter J. L. Wallis Conversion of Fortran to Ada Using an
Intermediate Tree Representation . . . . 344--353
F. Murtagh A survey of recent advances in
hierarchical clustering algorithms . . . 354--359
M. P. Atkinson and
P. J. Bailey and
K. J. Chisholm and
P. W. Cockshott and
R. Morrison An Approach to Persistent Programming 360--365
R. T. House A proposal for an extended form of type
checking of expressions . . . . . . . . 366--374
M. A. Oliver and
N. E. Wiseman Operations on Quadtree Leaves and
Related Image Areas . . . . . . . . . . 375--380
P. Hammersley Editorial . . . . . . . . . . . . . . . 1--2
Maurice V. Wilkes Security Management and Protection --- a
Personal Approach . . . . . . . . . . . 3--7
William A. Gale and
Roger Koenker Pricing Interactive Computer Services 8--17
I. P. Page Analysis of a Cyclic Placement Scheme 18--26
P. G. Harrison The Distribution of Cycle Times in
Tree-Like Networks of Queues . . . . . . 27--36
D. H. J. Brown Transitions to Ada: an Incremental
Approach . . . . . . . . . . . . . . . . 37--41
L. V. Atkinson Jumping about and getting into a state 42--46
David M. Harland User-Defined Types in a Polymorphic
Language . . . . . . . . . . . . . . . . 47--56
Adarsh K. Arora and
C. R. Carlson Normalization Could Be Useful . . . . . 57--61
Parimala N. and
Naveen Prakash and
N. Bolloju Concurrency Control in Admin . . . . . . 62--66
K. T. Fung A reorganization model based on the
database entropy concept . . . . . . . . 67--71
C. M. Reeves Complexity Analyses of Event Set
Algorithms . . . . . . . . . . . . . . . 72--79
M. C. Er The colour Towers of Hanoi: a
generalization . . . . . . . . . . . . . 80--82
C. J. Lo Unifying multiple semantic intentions
for a syntactic construct . . . . . . . 83--84
R. J. Macmillan and
J. H. Davenport Factoring medium-sized integers . . . . 84--85
G. N. Buckley and
A. Silberschatz On the heterogeneous guard locking
protocol . . . . . . . . . . . . . . . . 86--87
T. Agmon and
I. Borovits Dynamic and uncertainty considerations
in the selection and the acquisition of
an information system: an adoption of a
break-even analysis to investment
decisions . . . . . . . . . . . . . . . 87--89
Donald E. Knuth Literate Programming . . . . . . . . . . 97--111
A. J. Wilkes and
D. W. Singer and
J. J. Gibbons and
T. R. King and
P. Robinson and
N. E. Wiseman The Rainbow Workstation . . . . . . . . 112--120
John A. Mariani and
Douglas R. McGregor VULCAN: a Modified Viewdata System with
Improved Indexing and Formal Hierarchy
Definition Language . . . . . . . . . . 121--126
P. Corsini and
G. Frosini and
L. Lopriore The implementation of abstract objects
in a capability based addressing
architecture . . . . . . . . . . . . . . 127--134
C. M. Reeves A lumped-state model of clustering in
dynamic storage allocation . . . . . . . 135--142
R. H. Davis and
P. Coumpas A dynamic file organization model . . . 143--150
Keld Helsgaun Backtrack Programming with SIMULA . . . 151--158
D. Barton Problem with Algebra Systems ---
Revisited . . . . . . . . . . . . . . . 159--164
M. H. Williams and
K. T. Milne The performance of algorithms for
colouring planar graphs . . . . . . . . 165--170
M. C. Er The Cyclic Towers of Hanoi: a
Representation Approach . . . . . . . . 171--175
Alan D. Kalvin and
Yaakov L. Varol On Two Problems Reducible to Topological
Sorting . . . . . . . . . . . . . . . . 176--177
D. J. Hatter Algorithm 116: A generalized
non-recursive binary tree traversal
algorithm . . . . . . . . . . . . . . . 178--179
J. D. Henstridge and
R. W. Payne and
R. J. Baker Algorithm 117: Buffered output in
FORTRAN . . . . . . . . . . . . . . . . 179--184
B. Jones and
M. Banerjee and
L. Jones Algorithm 118: Root isolation for
transcendental equations . . . . . . . . 184--187
A. El Sayed Noor A framework for the creation and
management of national computing
strategies in developing countries . . . 193--200
A. Mahjoub On the Static Evaluation of Distributed
Systems Performance . . . . . . . . . . 201--208
Naveen Prakash and
N. Parimala and
N. Bolloju Specifying integrity constraints in a
network DBMS . . . . . . . . . . . . . . 209--217
D. A. Bell and
S. M. Deen Hash Trees Versus B-Trees . . . . . . . 218--224
J. R. Woodwark Compressed Quad Trees . . . . . . . . . 225--229
Art Lew Proof of Correctness of Decision Table
Programs . . . . . . . . . . . . . . . . 230--232
G. Adorni and
A. Boccalatte and
M. Di Manzo Top-Down Semantic Analysis . . . . . . . 233--237
Richard B. Bunt and
Jennifer M. Murphy The measurement of locality and the
behaviour of programs . . . . . . . . . 238--245
R. K. Ward and
M. Tabandeh Error Correction and Detection, a
Geometric Approach . . . . . . . . . . . 246--253
M. P. Papazoglou and
P. I. Georgiadis and
D. G. Maritsas Architectural considerations of the
parallel SIMULA machine . . . . . . . . 254--259
F. S. Wong and
M. R. Ito Parallel Sorting on a Re-Circulating
Systolic Sorter . . . . . . . . . . . . 260--269
H. W. Six and
L. Wegner Sorting a Random Access File in Situ . . 270--275
Hannu Erkio The worst case permutation for
median-of-three quicksort . . . . . . . 276--277
M. C. Er The Generalized Colour Towers of Hanoi:
an Iterative Algorithm . . . . . . . . . 278--282
H. D. Baecker On instruction set encoding . . . . . . 283--283
Enid Mumford Participative systems design . . . . . . 283--283
R. H. Davis A note on dynamic file organization
models . . . . . . . . . . . . . . . . . 284--284
M. Elizabeth C. Hull and
R. M. McKeag Concurrency in the Design of Data
Processing Systems . . . . . . . . . . . 289--293
David S. Bowers A Database Architecture for
Aggregate-Incomplete Data . . . . . . . 294--300
Steve Talbot An investigation into logical
optimization of relational query
languages . . . . . . . . . . . . . . . 301--309
N. Parimala and
Naveen Prakash and
N. Bolloju New Corecs and New Cosets in Admin . . . 310--314
David A. Bell Difficult Data Placement Problems . . . 315--320
D. D. Kouvatsos and
S. K. Wong On Optimal Blocking of Sequential Files 321--327
G. Ch. Pflug Dynamic Memory Allocation --- a
Markovian Analysis . . . . . . . . . . . 328--333
Wlodzimierz Dobosiewicz Replacement Selection in $3$-Level
Memories . . . . . . . . . . . . . . . . 334--339
Ronald E. Prather An Axiomatic Theory of Software
Complexity Measure . . . . . . . . . . . 340--347
P. J. Brown Embedded Macro Processors . . . . . . . 348--353
Michael Stubbs An examination of the resolution of
structure clashes by structure inversion 354--361
A. J. B. Travis An aid to pattern recognition. II . . . 362--367
Ahmed S. Zaki Algorithm 119: A space saving insertion
algorithm for $2$-$3$ trees . . . . . . 368--372
Robert W. Irving Permutation Backtracking in
Lexicographic Order . . . . . . . . . . 373--375
F. W. Burton and
V. J. Kollias and
J. G. Kollias Consistency in Point-In-Polygon Tests 375--376
Alan Hutchinson The halting problem does not matter . . 376--376
T. I. Maude and
D. J. Pullinger Software for reading, refereeing and
browsing in the BLEND system . . . . . . 1--4
Nicola Santoro and
Ramez Khatib Labelling and Implicit Routing in
Networks . . . . . . . . . . . . . . . . 5--8
D. T. Goodwin Further Study of a Stack-Length Model 9--16
D. Crookes and
C. J. Devlin An algorithm for optimal procedural
nesting . . . . . . . . . . . . . . . . 17--21
J. Robinson and
A. Burns A dialogue development system for the
design and implementation of user
interfaces in Ada . . . . . . . . . . . 22--28
P. J. Layzell The history of macro processors in
programming language extensibility . . . 29--33
J. M. Triance and
P. J. Layzell Macro Processors for Enhancing
High-Level Languages --- Some Design
Principles . . . . . . . . . . . . . . . 34--43
N. E. Goller Hybrid Data Structures Defined by
Indirection . . . . . . . . . . . . . . 44--53
G. V. Cormack and
R. N. S. Horspool and
M. Kaiserswerth Practical Perfect Hashing . . . . . . . 54--58
A. L. Furtado and
T. S. E. Maibaum An informal approach to formal
(algebraic) specifications . . . . . . . 59--67
B. A. Styne and
T. R. King and
N. E. Wiseman Pad Structures for the Rainbow
Workstation . . . . . . . . . . . . . . 68--72
D. J. Abel Some Elemental Operations on Linear
Quadtrees for Geographic Information
Systems . . . . . . . . . . . . . . . . 73--77
M. H. Williams A Linear Algorithm for Colouring Planar
Graphs with Five Colours . . . . . . . . 78--81
F. Murtagh A Survey of Algorithms for
Contiguity-Constrained Clustering and
Related Problems . . . . . . . . . . . . 82--88
J. Mottl Description of a Program for Nonlinear
Programming: the Centroid Program . . . 89--94
Enid Mumford Defining System Requirements to Meet
Business Needs: a Case Study Example . . 97--104
Julian R. Ullmann and
Robert M. Haralick and
Linda G. Shapiro Computer Architecture for Solving
Consistent Labelling Problems . . . . . 105--111
R. A. Frost Using Semantic Concepts to Characterise
Various Knowledge Representation
Formalisms: a Method of Facilitating the
Interface of Knowledge Base System
Components . . . . . . . . . . . . . . . 112--116
F. J. Dixon Simplifying Screen Specifications ---
the `Full Screen Manager' Interface and
`Screen Form' Generating Routines . . . 117--127
J. M. Triance and
P. J. Layzell Language Enhancement Facility for COBOL
--- its Design and Implementation . . . 128--133
M. H. Williams and
G. Chen Restructuring Pascal programs containing
GOTO statements . . . . . . . . . . . . 134--137
Peter R. Benyon Exploiting Vector Computers by
Replication . . . . . . . . . . . . . . 138--141
David Barton Parallelism in Simple Algebra Systems 142--147
L. M. Delves and
S. C. Mawdsley DAP-Algol: a Development System for
Parallel Algorithms . . . . . . . . . . 148--153
T. S. E. Maibaum Database Instances, Abstract Data Types
and Database Specification . . . . . . . 154--161
R. Turner and
B. G. T. Lowden An introduction to the formal
specification of relational query
languages . . . . . . . . . . . . . . . 162--169
Yuksel Uckan A relational schema description and
manipulation facility . . . . . . . . . 170--178
C. H. C. Leung and
K. Wolfenden Mathematical Models of File Growth . . . 179--183
Philippe Kent An efficient new way to represent
multi-dimensional data . . . . . . . . . 184--190
R. K. Stamper Towards a Theory of Information.
Information: Mystical Fluid or a Subject
for Scientific Enquiry? . . . . . . . . 195--199
George Rzevski On Criteria for Assessing an Information
Theory . . . . . . . . . . . . . . . . . 200--202
G. G. Scarrott Information, the Life Blood of
Organisation . . . . . . . . . . . . . . 203--205
C. J. Tully Information, Human Activity and the
Nature of Relevant Theories . . . . . . 206--210
Frank Land Is an Information Theory Enough? . . . . 211--215
D. H. Marwick and
C. R. G. B. Rinaldi The Tattoo on a micro-computer . . . . . 216--222
G. Fitzgerald and
N. Stokes and
J. R. G. Wood Feature Analysis of Contemporary
Information Systems Methodologies . . . 223--230
R. N. Ibbett and
D. A. Edwards and
T. P. Hopkins and
C. K. Cadogan and
D. A. Train Centrenet --- a High Performance Local
Area Network . . . . . . . . . . . . . . 231--242
S. Muir and
D. Hutchison and
D. Shepherd ARCA: a Local Network File Server . . . 243--249
M. H. Williams Structuring Two-Level Grammar
Specifications . . . . . . . . . . . . . 250--256
D. T. Goodwin The computability of stack non-underflow 257--263
Sakti Pramanik and
Chung-Ta King A hardware pattern matching algorithm on
a dataflow . . . . . . . . . . . . . . . 264--269
R. N. Maddison and
A. J. Gawronski A data dictionary for learning data
analysis . . . . . . . . . . . . . . . . 270--281
S. M. Deen and
R. R. Amin and
G. O. Ofori-Dwumfuo and
M. C. Taylor Architecture of a Generalised
Distributed Database System --- PRECI 282--290
S. Misbah Deen A tuple placement technique for
databases . . . . . . . . . . . . . . . 291--297
T. D. Kimura and
W. D. Gillett and
J. R. Cox, Jr. A design of a data model based on
abstraction of symbols . . . . . . . . . 298--308
W. B. Samson and
A. Bendell Rank Order Distributions and Secondary
Key Indexing . . . . . . . . . . . . . . 309--312
Gordon Lyon Achieving Hash Table Searches in One or
Two Bucket Probes . . . . . . . . . . . 313--318
Per-Åke Larson Performance Analysis of a Single-File
Version of Linear Hashing . . . . . . . 319--329
James K. Mullin Spiral Storage: Efficient Dynamic
Hashing with Constant Performance . . . 330--334
A. Oxley Surface Fitting by Triangulation . . . . 335--339
M. Clint and
C. Holt and
R. H. Perrott and
A. Stewart Algorithm 120: A DAP FORTRAN subroutine
for the eigensolution of real symmetric
matrices . . . . . . . . . . . . . . . . 340--342
D. G. N. Hunter Algorithm 121: RSA key calculation in
Ada . . . . . . . . . . . . . . . . . . 343--348
K. T. Fung An entropy approach to solving some
network reliability problems . . . . . . 353--356
Jovan Djordjevic and
Mario Barbacci and
Brad Hosler A PMS Level Notation for the Description
and Simulation of Digital Systems . . . 357--365
M. L. Schneider Weighted Decision Tables --- an
Alternative Solution for Ambiguity . . . 366--371
Kazimierz Subieta A simple method of data correction . . . 372--374
Allan Ramsay On Efficient Context Switching . . . . . 375--378
John A. Llewellyn The construction of variable-length
comma-free codes . . . . . . . . . . . . 379--390
F. Cesarini and
G. Soda Design and Implementation of a
Relational DBMS for Microcomputers . . . 391--397
R. Bonanno and
D. Maio and
P. Tiberio An approximation algorithm for secondary
index selection in relational database
physical design . . . . . . . . . . . . 398--405
Michael Hatzopoulos and
J. (Yiannis) Kollias On the Selection of a Reduced Set of
Indexes . . . . . . . . . . . . . . . . 406--408
C. H. C. Leung and
K. Wolfenden Estimating Disc Access Patterns Using
Diffusion Models . . . . . . . . . . . . 409--411
Matti Jakobsson Sampling without Replacement in Linear
Time . . . . . . . . . . . . . . . . . . 412--413
F. Warren Burton and
Matthew M. Huntbach and
J. (Yiannis) G. Kollias Multiple Generation Text Files Using
Overlapping Tree Structures . . . . . . 414--416
Nivio Zivani and
Henk J. Olivié and
Gaston H. Gonnet The Analysis of an Improved Symmetric
Binary B-Tree Algorithm . . . . . . . . 417--425
Keith Brinck The Expected Performance of Traversal
Algorithms in Binary Trees . . . . . . . 426--432
David McLean A Method of Generating Surfaces as a
Composite of Cyclide Patches . . . . . . 433--438
D. J. Abel and
W. T. Williams A re-examination of four classificatory
fusion strategies . . . . . . . . . . . 439--443
Enrico Spoletini Algorithm 122: Generation of
permutations in direct lexicographic
ordering by arithmetic methods . . . . . 444--445
M. W. Shields Concurrent Machines . . . . . . . . . . 449--465
K. Kant and
A. Silberschatz Error Propagation and Recovery in
Concurrent Environments . . . . . . . . 466--473
Lawrence C. Paulson Lessons Learned from LCF: a Survey of
Natural Deduction Proofs . . . . . . . . 474--479
Lloyd Allison Programming denotational semantics. II 480--486
Z. Markusz and
A. A. Kaposi Complexity Control in Logic-Based
Programming . . . . . . . . . . . . . . 487--495
R. M. O'Keefe Comment on `Complexity analyses of event
set algorithms' . . . . . . . . . . . . 496--497
Nader Shebini FEDOS: a Finite Element Database of
Offshore Structures . . . . . . . . . . 498--500
P. M. D. Gray and
P. Esslemont The performance of a relational
interface to a Codasyl database . . . . 501--507
D. J. Flynn and
A. H. F. Laender Mapping from a Conceptual Schema to a
Target Internal Schema . . . . . . . . . 508--517
C. H. C. Leung and
K. Wolfenden Analysis and Optimisation of Data
Currency and Consistency in Replicated
Distributed Databases . . . . . . . . . 518--523
Michalis Hatzopoulos and
J. G. Kollias Towards the Optimal Secondary Index
Organisation and Secondary Index
Selection . . . . . . . . . . . . . . . 524--529
A. J. Compton An algorithm for the even distribution
of entities in one dimension . . . . . . 530--537
M. C. Er Enumerating Ordered Trees
Lexicographically . . . . . . . . . . . 538--542
James Bradley Use of Mean Distance between Overflow
Records to Compute Average Search
Lengths in Hash files with Open
Addressing . . . . . . . . . . . . . . . ??
M. Anderson and
R. D. Pose and
C. S. Wallace A password-capability system . . . . . . 1--8
M. H. Williams and
J. Riddall The segregation of incompatible duties 9--11
R. K. Ward Parity Check Codes for Logic Processors 12--16
N. Y. Foo Dewey Indexing of Prolog Traces . . . . 17--19
A. Hutchinson Some Practical Principles for Design of
Maintainable Systems . . . . . . . . . . 20--23
J. Fucik and
J. Kral The hierarchy of program control
structures . . . . . . . . . . . . . . . 24--32
Tadao Takaoka The semantics of new while loop . . . . 33--35
H. M. Mahmoud The Expected Distribution of Degrees in
Random Binary Search Trees . . . . . . . 36--37
K. G. Kulkarni and
M. P. Atkinson EFDM: Extended Functional Data Model . . 38--46
M. A. Bassiouni System and Program Models of Storage
Allocation for Reducing Seek Delay . . . 47--51
F. Suraweera Use of Doubly Chained Tree Structures in
File Organisation for Optimal Searching 52--59
I. P. Stewart Quadtrees: Storage and Scan Conversion 60--75
H. Edelsbrunner and
G. Haring and
David Hilbert Rectangular Point Location in ${D}$
Dimensions with Applications . . . . . . 76--82
L. Capper A philosophy for the teaching of
computer science and information
technology . . . . . . . . . . . . . . . 83--89
M. P. Georgeff and
G. K. Gupta Resources Needed for a University
Computer Science Department . . . . . . 90--95
A. P. Jagodzinski and
D. D. Clarke A review of methods for measuring and
describing users' attitudes as an
essential constituent of systems
analysis and design . . . . . . . . . . 97--102
J. Jarosz and
J. R. Jaworowski Computer Tree --- the Power of Parallel
Computations . . . . . . . . . . . . . . 103--108
N. Natarajan A distributed synchronisation scheme for
communicating processes . . . . . . . . 109--117
K. Viswanathan Iyer and
L. M. Patnaik Performance Study of a Centralized
Concurrency Control Algorithm for
Distributed Database Systems Using
Simula . . . . . . . . . . . . . . . . . 118--126
N. M. Pitman and
F. W. Burton and
E. W. Haddon Buddy Systems with Selective Splitting 127--134
A. Hutchinson A data structure and algorithm for a
self-augmenting heuristic program . . . 135--150
D. Ince and
M. Woodman The rapid generation of a class of
software tools . . . . . . . . . . . . . 151--160
J. T. Boardman and
G. C. A. Robson Towards a Problem-Solving Methodology
for Coping with Increasing Complexity:
an Engineering Approach . . . . . . . . 161--166
J. Bradley Use of Mean Distance Between Overflow
Records to Compute Average Search
Lengths in Hash Files with Open
Addressing . . . . . . . . . . . . . . . 167--170
J. M. Pallo Enumerating, Ranking and Unranking
Binary Trees . . . . . . . . . . . . . . 171--175
F. D. Libera and
F. Gosen Using B-Trees to Solve Geographic Range
Queries . . . . . . . . . . . . . . . . 176--181
J. T. Boardman and
C. Garrett and
G. C. A. Robson A Recursive Algorithm for the Optimal
Solution of a Complex Allocation Problem
Using a Dynamic Programming Formulation 182--186
J. S. Rohl and
T. D. Gedeon The Reve's puzzle . . . . . . . . . . . 187--188
T. Y. Chen Dynamic Approach Towards Software
Science . . . . . . . . . . . . . . . . 189--189
Joan M. Smith The implications of SGML for the
preparation of scientific publications 193--200
H. Thimbleby Experiences of `Literate Programming'
Using Cweb (A Variant of Knuth's Web) 201--211
P. Ein-Dor and
E. Segev Attitudes, association and success of
MIS: some empirical results from
research in the context of a business
game . . . . . . . . . . . . . . . . . . 212--221
D. M. Episkopou and
A. T. Wood-Harper Towards a framework to choose
appropriate IS approaches . . . . . . . 222--228
J. P. Elloy and
O. Roux Electre: a Language for Control
Structuring in Real Time . . . . . . . . 229--234
I. D. Craig The Ariadne-1 blackboard system . . . . 235--240
George K. Papakonstantinou and
John Kontos Knowledge Representation with Attribute
Grammars . . . . . . . . . . . . . . . . 241--245
M. H. Williams and
G. Chen Translating Pascal for Execution on a
Prolog-Based System . . . . . . . . . . 246--252
R. T. House Alternative Scope Rules for
Block-Structured Languages . . . . . . . 253--260
E. Wong and
W. B. Samson The specification of a relational
database (PRECI) as an abstract data
type and its realisation in HOPE . . . . 261--268
D. J. Taylor and
J. P. Black A locally correctable B-tree
implementation . . . . . . . . . . . . . 269--276
C. C. Chang and
R. C. T. Lee A Letter-oriented Minimal Perfect
Hashing Scheme . . . . . . . . . . . . . 277--281
G. W. Smith and
J. B. H. Du Boulay The generation of cryptic crossword
clues . . . . . . . . . . . . . . . . . 282--284
S. J. Mullender and
A. S. Tanenbaum The design of a capability-based
distributed operating system . . . . . . 289--299
B. Randell System Design and Structuring . . . . . 300--306
R. G. Stone On the Choice of Grammar and Parser for
the Compact Analytical Encoding of
Programs . . . . . . . . . . . . . . . . 307--314
P. A. Luker and
A. Burns Program Generators and Generation
Software . . . . . . . . . . . . . . . . 315--321
G. Cantone and
A. Cimitile and
U. De Carlini Well-Formed Conversion of Unstructured
One-In/One-Out Schemes for Complexity
Measurement and Program Maintenance . . 322--329
N. E. Fenton and
R. W. Whitty Axiomatic Approach to Software
Metrication Through Program
Decomposition . . . . . . . . . . . . . 330--339
S. J. Young and
C. Proctor UFL: an Experimental Frame Language
Based on Abstract Data Types . . . . . . 340--347
P. Feldman and
D. Miller Entity Model Clustering: Structuring a
Data Model by Abstraction . . . . . . . 348--360
J. Carden The structural stability of corporate
and devolved databases . . . . . . . . . 361--367
Y. Manolopoulos and
J. G. Kollias and
M. Hatzopoulos Sequential Vs. Binary Batched Searching 368--372
N. E. Wiseman and
S. Nedunuri Computing Random Fields . . . . . . . . 373--377
James Bradley Join Dependencies in Relational
Databases and the Geometry of Spatial
Grids . . . . . . . . . . . . . . . . . 378--380
D. C. Ince and
S. Hekmatpour Empirical Evaluation of Random Testing 380--380
N. Rushby A knowledge engineering approach to
instructional design . . . . . . . . . . 385--389
M. Joseph and
P. Pandya Finding Response Times in a Real-Time
System . . . . . . . . . . . . . . . . . 390--395
J. P. Penny and
P. J. Ashton and
A. L. Wilkinson Data Recording and Monitoring for
Analysis of System Response Times . . . 396--403
H. Barringer and
I. Mearns A proof system for Ada tasks . . . . . . 404--415
J. M. Foster Validating Microcode Algebraically . . . 416--422
R. D. Dowsing and
R. Elliott Programming a Bounded Buffer Using the
Object and Path Expression Constructs of
Path Pascal . . . . . . . . . . . . . . 423--429
M. C. Er The use of termination indicators in
computer programming . . . . . . . . . . 430--433
A. D. Woodall Techniques of Program Design . . . . . . 434--435
W. C. Chen and
J. S. Vitter Deletion Algorithms for Coalesced
Hashing . . . . . . . . . . . . . . . . 436--450
S. Pramanik and
F. Fotouhi Index Database Machine . . . . . . . . . 451--457
S. Jajodia Recognizing Multivalued Dependencies in
Relation Schemas . . . . . . . . . . . . 458--459
A. Blair and
I. Sommerville DSA --- a Tool for Descriptive Text
Analysis . . . . . . . . . . . . . . . . 460--466
M. Rom and
S. Bergman A new technique for automatic contouring
and contour representation from
machine-readable spatial data . . . . . 467--471
F. Fabbrini and
C. Montani Autumnal Quadtrees . . . . . . . . . . . 472--474
B. Shackel IBM Makes Usability as Important as
Functionality . . . . . . . . . . . . . 475--476
J. M. Wilson A weighted mark-scaling algorithm . . . 477--477
C. J. van Rijsbergen A Non-Classical Logic for Information
Retrieval . . . . . . . . . . . . . . . 481--485
R. M. Lea VLSI and WSI Associative String
Processors for Cost-Effective Parallel
Processing . . . . . . . . . . . . . . . 486--494
W. F. Clocksin Automatic specialisation of standard
designs . . . . . . . . . . . . . . . . 495--499
M. Elizabeth C. Hull Implementations of the CSP Notation for
Concurrent Systems . . . . . . . . . . . 500--505
L. M. Patnaik and
Julie Basu Two Tools for Interprocess Communication
in Distributed Data-Flow Systems . . . . 506--521
R. R. Levary and
W. D. Edwards Analysing the Impact of Adding a New
Software System on Main Memory Usage . . 522--526
D. Mackay and
G. Ball and
M. Crowe and
M. Hughes and
D. Jenkins and
C. Nicol A UNIX-based system for software
configuration management . . . . . . . . 527--530
P. Pandya and
M. Joseph A structure-directed total correctness
proof rule for recursive procedure calls 531--537
A. J. Cowling Type Checking in Polymorphic Languages 538--544
P. Leith Fundamental Errors in Legal Logic
Programming . . . . . . . . . . . . . . 545--552
M. Ancona and
L. De Floriani and
J. S. Deogun Path Problems in Structured Graphs . . . 553--563
K. J. MacCallum and
J.-M. Zhang Curve-Smoothing Techniques Using
B-Splines . . . . . . . . . . . . . . . 564--571
V. Akman Writing self-replicating code . . . . . 573--574
Leslie Fox Obituary: Dr. J. H. Wilkinson, F.R.S. 1--1
D. Benyon and
S. Skidmore Towards a Tool Kit for the Systems
Analyst . . . . . . . . . . . . . . . . 2--7
H. K. Klein and
R. A. Hirschheim A comparative framework of data
modelling paradigms and approaches . . . 8--15
R. H. Gallard An extension in the definition of a
Petri net execution . . . . . . . . . . 16--19
S. Tsutsui and
Y. Fujimoto Deadlock Prevention in Process Control
Computer Systems . . . . . . . . . . . . 20--26
R. C. Backhouse and
A. A. Khamiss A while-rule in Martin-Löf's theory of
types . . . . . . . . . . . . . . . . . 27--36
A. G. Middleton Some Transformations of Relevance to
Report Generation . . . . . . . . . . . 37--42
G. Oulsnam The algorithmic transformation of
schemas to structured form . . . . . . . 43--51
J. A. W. Faidhi and
S. K. Robinson Programmer Experience Level Indicators 52--62
D. C. Ince The automatic generation of test data 63--69
J. S. Rohl Towers of Hanoi: the Derivation of Some
Iterative Versions . . . . . . . . . . . 70--76
P. M. Fenwick A fast-carry adder with CMOS
transmission gates . . . . . . . . . . . 77--79
T. Raita An automatic system for file compression 80--86
A. J. Cole Compaction Techniques for Raster Scan
Graphics Using Space-Filling Curves . . 87--92
A. Verrijn-Stuart Themes and Trends in Information
Systems: TC8, 1975--1985 . . . . . . . . 97--109
L. M. Mackenzie and
A. M. Macleod and
D. J. Berry A multiple microprocessor system for
CPU-bound calculations . . . . . . . . . 110--118
I. A. Newman and
R. P. Stallard and
M. C. Woodward A hybrid multiple processor garbage
collection algorithm . . . . . . . . . . 119--127
I. Sommerville and
R. Welland and
S. Beer Describing Software Design Methodologies 128--133
H. Barringer Up and down the Temporal Way . . . . . . 134--148
J. A. Llewellyn Data Compression for a Source with
Markov Characteristics . . . . . . . . . 149--156
S. M. Deen and
R. R. Amin and
M. C. Taylor Implementation of a prototype for PRECI* 157--162
S. Nedunuri and
N. E. Wiseman Displaying Random Surfaces . . . . . . . 163--167
C. M. A. Castle and
M. L. V. Pitteway An efficient structural technique for
encoding `best-fit' straight lines . . . 168--175
A. Unnikrishnan and
Y. V. Venkatesh and
Priti Shankar Connected Component Labelling Using
Quadtrees --- A Bottom-Up Approach . . . 176--182
H. Berghel Crossword Compilation with Horn Clauses 183--188
M. J. Jamieson A note on the convergence of an
iterative scheme for solving a quadratic
equation . . . . . . . . . . . . . . . . 189--190
G. S. Blair and
J. A. Mariani and
J. R. Nicol and
D. Shepherd A knowledge-based operating system . . . 193--200
C. M. Reeves Chainmail: a Model of First-Fit Memory
Allocation . . . . . . . . . . . . . . . 201--213
P. C. Burkimsher Combinator Reduction in a Shared-Memory
Multiprocessor . . . . . . . . . . . . . 214--222
N. S. Coulter and
R. B. Cooper and
M. K. Solomon Information-Theoretic Complexity of
Program Specifications . . . . . . . . . 223--227
K. A. Redish and
W. F. Smyth Evaluating Measures of Program Quality 228--232
J. K. Navlakha A survey of system complexity metrics 233--238
D. Gray A pedagogical verification condition
generator . . . . . . . . . . . . . . . 239--248
C. C. Chang An Information Protection Scheme Based
Upon Number Theory . . . . . . . . . . . 249--253
B. Teufel System design for the remote execution
of library routines . . . . . . . . . . 254--257
C.-L. Wey and
F. Lombardi On a Novel Self-Test Approach to Digital
Testing . . . . . . . . . . . . . . . . 258--267
J. C. Nash and
S. Shlien Simple Algorithms for the Partial
Singular Value Decomposition . . . . . . 268--275
S. Wade and
J. Henstridge Note on Algorithm 117: Buffered output
in FORTRAN . . . . . . . . . . . . . . . 276--276
B. A. Wichmann Note on Algorithm 121: RSA key
calculation in Ada . . . . . . . . . . . 276--276
I. D. Hill and
B. A. Wichmann and
D. R. Woodall Algorithm 123: Single transferable vote
by Meek's method . . . . . . . . . . . . 277--281
M. C. Er An efficient implementation of
permutation backtracking in
lexicographic order . . . . . . . . . . 282--282
D. Salomon A design for an efficient NOR-gate only,
binary-ripple adder with
carry-completion-detection logic . . . . 283--285
M. Sowa A method for speeding up serial
processing in dataflow computers by
means of a program counter . . . . . . . 289--294
Cs. Kecskes A simple method for building up large
computer systems from small computers 295--297
J. Van Leeuwen and
R. B. Tan Interval Routing . . . . . . . . . . . . 298--307
D. J. Challab and
J. D. Roberts Buddy Algorithms . . . . . . . . . . . . 308--315
D. A. Duce and
E. V. C. Fielding Formal Specification --- a Comparison of
Two Techniques . . . . . . . . . . . . . 316--327
Cristina Sernadas and
R. Carapuca The role of conceptual modelling
abstractions in compiler development . . 328--336
P. Leith A programmed, skeleton formal
specification method: the OUFDM . . . . 337--342
J. K. Mullin Accessing textual documents using
compressed indexes of arrays of small
Bloom filters . . . . . . . . . . . . . 343--348
P. A. Firby and
D. J. Stone Colour Manipulation of Superposed
Families of Curves . . . . . . . . . . . 349--354
F. W. Burton and
V. J. Kollias and
J. G. Kollias A general PASCAL program for map overlay
of quadtrees and related problems . . . 355--361
A. I. Verkamo Performance of Quicksort Adapted for
Virtual Memory Use . . . . . . . . . . . 362--371
S. Dvorak and
B. Durian Stable Linear Time Sublinear Space
Merging . . . . . . . . . . . . . . . . 372--375
D. Gault and
M. Clint A Fast Algorithm for the Towers of Hanoi
Problem . . . . . . . . . . . . . . . . 376--378
T. H. Tse Towards a Single Criterion for
Identifying Program Unstructuredness . . 378--380
W. F. Clocksin Principles of the Delphi Parallel
Inference Machine . . . . . . . . . . . 386--392
P. Kacsuk and
A. Bale DAP Prolog: a Set-Oriented Approach to
Prolog . . . . . . . . . . . . . . . . . 393--403
D. McGregor and
S. McInnes and
M. Henning An architecture for associative
processing of large knowledge bases
(LKBs) . . . . . . . . . . . . . . . . . 404--412
B. M. Forrest and
D. Roweth and
N. Stroud and
D. J. Wallace and
G. V. Wilson Implementing Neural Network Models on
Parallel Computers . . . . . . . . . . . 413--419
A. F. W. Coulson and
J. F. Collins and
A. Lyall Protein and Nucleic Acid Sequence
Database Searching: a Suitable Case for
Parallel Processing . . . . . . . . . . 420--424
H. R. Arabnia and
M. A. Oliver A transputer network for the arbitrary
rotation of digitised images . . . . . . 425--432
S. G. Akl Adaptive and Optimal Parallel Algorithms
for Enumerating Permutations and
Combinations . . . . . . . . . . . . . . 433--436
F. W. Burton Functional programming for concurrent
and distributed computing . . . . . . . 437--450
J. M. Foster and
I. F. Currie Remote Capabilities . . . . . . . . . . 451--457
A. Segev Optimising two-way joins in horizontally
partitioned database systems . . . . . . 458--468
D. Godfrey and
S. Gong and
R. Hart and
N. Koorland and
S. Smit Project `Clear Skies': teaching computer
science by computer based training and
electronic messaging in China . . . . . 469--474
H. Timbleby Optimising self-replicating programs . . 475--476
P. J. Mayhew and
P. A. Dearnley An alternative prototyping
classification . . . . . . . . . . . . . 481--484
M. Ramshaw and
A. P. Steward and
D. Stoves An intelligent retrieval and
presentation system for management
information . . . . . . . . . . . . . . 485--486
Julie Basu and
L. M. Patnaik and
A. K. Goswami Ordered Ports --- a language concept for
high-level distributed programming . . . 487--497
J. C. M. Baeten and
J. A. Bergstra and
J. W. Klop Ready-Trace Semantics for Concrete
Process Algebra with the Priority
Operator . . . . . . . . . . . . . . . . 498--506
T. H. Tse The Identification of Program
Unstructuredness: a Formal Approach . . 507--511
R. G. Dromey Derivation of Sorting Algorithms from a
Specification . . . . . . . . . . . . . 512--518
Lisa Bertino An evaluation of precompilation and
interpretation in distributed database
management systems . . . . . . . . . . . 519--528
Y. Manolopoulos and
D. Kleftouris and
L. Petrou A model for an ISAM file with multiple
overflow chains . . . . . . . . . . . . 529--534
C. C. Chang and
C. Y. Chen Performance Analysis of the Generalised
Disc Modulo Allocation Method for
Multiple Key Hashing Files on Multi-Disc
Systems . . . . . . . . . . . . . . . . 535--540
G. V. Cormack and
R. N. S. Horspool Data Compression Using Dynamic Markov
Modelling . . . . . . . . . . . . . . . 541--550
G. M. Gwei and
E. Foxley A flexible synonym interface with
application examples in CAL and help
environments . . . . . . . . . . . . . . 551--557
J. Parker and
A. Kennard and
D. King The `window' terminal . . . . . . . . . 558--564
Y. P. Manolopoulos and
J.-Y. G. Kollias and
F. W. Burton Batched Interpolation Search . . . . . . 565--568
M. C. Er Lexicographic Listing and Ranking of
${T}$-Ary Trees . . . . . . . . . . . . 569--572
H. T. Jankowitz Detecting Plagiarism in Student Pascal
Programs . . . . . . . . . . . . . . . . 1--8
L. Allison Some Applications of Continuations . . . 9--11
M. Razaz and
J. L. Schonfelder Test Procedures for Measurement of
Floating-Point Characteristics of
Computing Environments . . . . . . . . . 12--16
Martin Davis and
Elaine Weyuker Metric Space-Based Test-Data Adequacy
Criteria . . . . . . . . . . . . . . . . 17--24
R. A. Clarke Judicial understanding of information
technology: the case of the Wombat ROMs 25--33
C. Egyhazy and
K. Triantis A query processing algorithm for
distributed relational database systems 34--40
W. Kiessling Access Path Selection in Databases with
Intelligent Disc Subsystems . . . . . . 41--50
L. J. Henschen and
B. P. Weems A top-down inference procedure for
template dependencies . . . . . . . . . 51--55
W. R. Franklin and
V. Akman Adaptive Grid for Polyhedral Visibility
in Object Space: an Implementation . . . 56--60
M. C. Er A Simple Algorithm for Generating
Non-Regular Trees in Lexicographic Order 61--64
I. Stojmenovic and
M. Miyakawa Applications of a Subset-Generating
Algorithm to Base Enumeration, Knapsack
and Minimal Covering Problems . . . . . 65--70
Mirka Miller and
I. Fris Minimum diameter of diregular digraphs
of degree $2$ . . . . . . . . . . . . . 71--75
S. M. Selim Split Vertices in Vertex Colouring and
Their Application in Developing a
Solution to the Faculty Timetable
Problem . . . . . . . . . . . . . . . . 76--82
G. M. Megson and
D. J. Evans The unification of systolic differencing
algorithms . . . . . . . . . . . . . . . 83--91
M. Atkinson and
P. Buneman and
R. Morrison Binding and Type Checking in Database
Programming Languages . . . . . . . . . 99--109
D. S. Moffat and
P. M. D. Gray Perlog: a Prolog with Persistence and
Modules . . . . . . . . . . . . . . . . 110--115
Liping Zhao and
S. A. Roberts An object-oriented data model for
database modelling, implementation and
access . . . . . . . . . . . . . . . . . 116--124
Carol Small The implementation of the Exegesis
system . . . . . . . . . . . . . . . . . 125--132
M. H. Williams and
K. A. Nicholson An approach to handling incomplete
information in databases . . . . . . . . 133--140
J. Bradley Polygon Join Dependencies, Closed
Co-Relationship Chains and the
Connection Trap in Relational Databases 141--146
J. R. Ullmann Fast Implementation of Relational
Operations via Inverse Projections . . . 147--154
M. M. Owrang O. and
L. L. Miller Query Translation Based on Hypergraph
Models . . . . . . . . . . . . . . . . . 155--164
F. B. Bastani and
S. S. Iyengar and
I-Ling Yen Concurrent Maintenance of Data
Structures in a Distributed Environment 165--174
S. M. Deen and
M. C. Taylor and
P. A. Ingram and
K. W. Rayner A distributed directory database system
for telecommunications . . . . . . . . . 175--181
Kathleen Spurr A data dictionary approach to teaching
information systems analysis . . . . . . 182--189
D. Morris and
C. J. Theaker and
P. B. Whitehead Structured Abstract Schematics . . . . . 193--200
F. Lombardi Analysis of Comparison-Based Diagnosable
Systems Using Temporal Criteria . . . . 201--208
M. Gopalakrishnan and
L. M. Patnaik Medium Access Control Schemes for Local
Area Networks with Multiple Priority
Function . . . . . . . . . . . . . . . . 209--219
R. E. Griswold Programming with Generators . . . . . . 220--228
P. G. Harrison and
H. Khoshnevisan Algebraic Transformation Techniques for
Functional Languages . . . . . . . . . . 229--242
F. W. Burton Nondeterminism with Referential
Transparency in Functional Programming
Languages . . . . . . . . . . . . . . . 243--247
R. E. Prather Comparison and Extension of Theories of
Zipf and Halstead . . . . . . . . . . . 248--252
D. A. Bell and
F. J. McErlean and
P. M. Stewart and
W. Arbuckle Clustering Related Tuples in Databases 253--257
Kathryn S. Dawson and
Lorraine M. Purgailis Parker From Entity-Relationship Diagrams to
Fourth Normal Form: a Pictorial Aid to
Analysis . . . . . . . . . . . . . . . . 258--268
Th. P. van der Weide Iterative Tree Traversal Using
Refinements and Pointer Rotation . . . . 269--275
D. Richards On the Worst-Possible Analysis of
Weighted Comparison-Based Algorithms . . 276--278
S. Dvorak and
B. Durian Unstable Linear Time O(1) Space Merging 279--282
M. C. Er A fast algorithm for generating set
partitions . . . . . . . . . . . . . . . 283--284
K. Subieta and
K. Anacki and
M. Missala Overlay Clusters for C Programs . . . . 285--286
J.-M. Hélary and
N. Plouzeau and
M. Raynal A Distributed Algorithm for Mutual
Exclusion in an Arbitrary Network . . . 289--295
G. P. Parr Enhanced Address Resolution in a
Multi-LAN Ethernet Communications System 296--303
M. Zaki and
M. M. Elboraey Analysis of Reliability Models for
Interconnecting MIMD Systems . . . . . . 304--312
W. T. Roberts A Formal Specification of the QMC
Message System: the Underlying Abstract
Model . . . . . . . . . . . . . . . . . 313--324
Z. Fang and
J. S. Deogun Closure Properties of Certain Classes of
Languages Under Generalized Morphic
Replication . . . . . . . . . . . . . . 325--329
P. Sipala Efficient Implementation of Binary Trees
in LISP Systems . . . . . . . . . . . . 330--335
L. Orman Functional Database Constraints . . . . 336--343
O. C. Akinyokun The experimental study of CODASYL
database/administration at the secondary
storage level . . . . . . . . . . . . . 344--352
C. Anedda and
L. Felician P-Compressed Quadtress for Image Storing 353--357
R. Williams The Goblin Quadtree . . . . . . . . . . 358--363
C. Lucas and
G. Mitra Computer-Assisted Mathematical
Programming (Modelling) Systems: CAMPS 364--375
J. Mingers Comparing conceptual models and data
flow diagrams . . . . . . . . . . . . . 376--379
D. E. Avison and
G. Fitzgerald and
A. T. Wood-Harper Information systems development: a tool
kit is not enough . . . . . . . . . . . 379--380
N. Bjorn-Andersen Are `human factors' human? . . . . . . . 386--390
P. N. Le Quesne Individual and organisational factors
and the design of IPSEs . . . . . . . . 391--397
R. Hirschheim and
M. Newman Information systems and user resistance:
theory and practice . . . . . . . . . . 398--408
A. P. Jagodzinski and
D. D. Clarke A multidimensional approach to the
measurement of human-computer
performance . . . . . . . . . . . . . . 409--419
Susan Harker The use of prototyping and simulation in
the development of large-scale
applications . . . . . . . . . . . . . . 420--425
K. D. Eason and
Susan Harker The supplier's role in the design of
products for organisations . . . . . . . 426--430
D. A. Tyldesley Employing usability engineering in the
development of office products . . . . . 431--436
D. Morris and
C. J. Theaker and
R. Phillips and
W. Love Human-computer interface recording . . . 437--444
P. Barnard and
M. Wilson and
A. Maclean Approximate modelling of cognitive
activity with an expert system: a
theory-based strategy for developing an
interactive design tool . . . . . . . . 445--456
A. Dillon and
C. McKnight and
J. Richardson Reading from paper versus reading from
screen . . . . . . . . . . . . . . . . . 457--464
D. Benyon and
Dianne Murray Experience with adaptive interfaces . . 465--473
J. Pachl Two livelock-free protocols for slotted
rings . . . . . . . . . . . . . . . . . 474--476
R. Maes and
J. E. M. Van Dijk On the role of ambiguity and
incompleteness in the design of decision
tables and rule-based systems . . . . . 481--489
P. Goyal and
T. S. Narayanan Dictionary machine with improved
performance . . . . . . . . . . . . . . 490--495
R. Cole and
Clare Foxcroft An experiment in clock synchronisation 496--502
G. O'Shea Controlling the dependency of user
access control mechanisms on correctness
of user identification . . . . . . . . . 503--509
P. F. Gibbins VDM: axiomatising its propositional
logic . . . . . . . . . . . . . . . . . 510--516
M. C. Henson Higher-order transformations and type
simulations . . . . . . . . . . . . . . 517--524
John Kontos and
J. C. Cavouras Knowledge acquisition from technical
texts using attribute grammars . . . . . 525--530
P. A. Bailes An advanced problem-oriented
introduction to imperative programming
with Modula-2 . . . . . . . . . . . . . 531--539
A. Dearle and
A. L. Brown Safe browsing in a strongly typed
persistent environment . . . . . . . . . 540--544
Z. J. Czech Efficient implementation of detection of
undefined variables . . . . . . . . . . 545--549
G. Guariso and
H. Werthner A software base for environmental
studies . . . . . . . . . . . . . . . . 550--552
S. Dvo\vrák and
B. \vDurian Merging by decomposition revisited . . . 553--556
M. C. Er A smooth reshuffling algorithm for
solving the Bulterman's problem . . . . 557--560
F. Suraweera and
J. M. Al-Anzy Analysis of a modified address
calculation sorting algorithm . . . . . 561--563
J. Pallo Some properties of the rotation lattice
of binary trees . . . . . . . . . . . . 564--565
C. C. Chang and
C. Y. Cheng A recursive performance formula of the
disc modulo allocation method for binary
Cartesian product files . . . . . . . . 565--566
G. M. Megson and
D. J. Evans Improved matrix product computation
using double-pipeline systolic arrays 567--569
M. H. Rennhackkamp and
S. H. von Solms On using an abstract model of
distributed database concurrency control
methods . . . . . . . . . . . . . . . . 570--572
T. H. Tse and
L. Pong Towards a formal foundation for DeMarco
data flow diagrams . . . . . . . . . . . 1--12
C. Mitchell Multi-destination secure electronic mail 13--15
T. Bell and
A. Moffat A note on the DMC data compression
scheme . . . . . . . . . . . . . . . . . 16--20
S. Hekmatpour A window manager for UNIX . . . . . . . 21--23
B. Freisleben and
J. L. Keedy Priority semaphores . . . . . . . . . . 24--28
P. Corsini and
G. Frosini and
G. Speranza The parallel interpretation of logic
programs in distributed architectures 29--35
B. Edupuganty and
B. R. Bryant Two-level grammar as a functional
programming language . . . . . . . . . . 36--44
I. P. Page and
R. T. Jacob The solution of mutual exclusion
problems which can be described
graphically . . . . . . . . . . . . . . 45--54
N. Parimala and
N. Prakash and
B. L. N. Rao and
N. Bolloju A query facility to a network DBMS . . . 55--62
A. Hutchinson Inheritance and kinds of slots . . . . . 63--67
J. Culberson and
J. I. Munro Explaining the behaviour of binary
search trees under prolonged updates: a
model and simulations . . . . . . . . . 68--75
M. C. Er Classes of admissible permutations that
are generatable by depth-first
traversals of ordered trees . . . . . . 76--85
A. R. Halbert and
S. J. P. Todd and
J. R. Woodwark Generalizing active zones for
set-theoretic solid models . . . . . . . 86--89
M. Negri and
G. Pelagatti and
L. Sbattella Semantics and problems of universal
quantification in SQL . . . . . . . . . 90--91
M. Sideri and
S. Efremidis and
G. Papakonstantinou Semantically driven parsing of
context-free languages . . . . . . . . . 91--93
M. J. Jamieson Rapidly converging iterative formulae
for finding square roots and their
computational efficiencies . . . . . . . 93--94
R. J. M. Hughes Why Functional Programming Matters . . . 98--107
R. Frost and
J. Launchbury Constructing natural language
interpreters in a lazy functional
language . . . . . . . . . . . . . . . . 108--121
R. S. Bird Algebraic identities for program
calculation . . . . . . . . . . . . . . 122--126
L. Augustsson and
T. Johnsson The Chalmers Lazy-ML compiler . . . . . 127--141
S. C. Wray and
J. Fairbairn Non-Strict Languages --- Programming and
Implementation . . . . . . . . . . . . . 142--151
Adrienne Bloss and
P. R. Hudak and
J. H. Young An optimising compiler for a modern
functional language . . . . . . . . . . 152--161
S. B. Jones and
A. F. Sinclair Functional programming and operating
systems . . . . . . . . . . . . . . . . 162--174
Simon L. Peyton Jones Parallel implementations of functional
programming languages . . . . . . . . . 175--186
Xue-Miao M. Lu An iterative solution for the $4$-peg
Towers of Hanoi . . . . . . . . . . . . 187--189
K. P. Tan and
T. S. Chua and
P. T. Lee AUTO-DFD: an intelligent data flow
processor . . . . . . . . . . . . . . . 194--201
A. N. Godwin and
M. B. Gore and
D. W. Salt A comparison of JSD and DFD as
descriptive tools . . . . . . . . . . . 202--211
M. A. Shepherd A fixed-size Bloom filter for searching
textural documents . . . . . . . . . . . 212--219
A. El-Hamdouchi and
P. Willett Comparison of hierarchic agglomerative
clustering methods for document
retrieval . . . . . . . . . . . . . . . 220--227
J. Katajainen and
T. Raita An approximation algorithm for
space-optimal encoding of a text . . . . 228--237
E. Makinen On implementing two adaptive
data-compression schemes . . . . . . . . 238--240
K. W. Yu and
T. L. Yu Data encryption based upon time reversal
transformations . . . . . . . . . . . . 241--245
M. Rahman and
S. Misbahuddin Effect of a binary symmetric channel on
the synchronisation recovery of variable
length codes . . . . . . . . . . . . . . 246--251
L. H. Ngoh and
T. P. Hopkins Transport Protocol Requirements for
Distributed Multimedia Information
Systems . . . . . . . . . . . . . . . . 252--261
G. G. Scarrott The nature of information . . . . . . . 262--266
A. Schipler and
R. Simon and
P. Desarzens and
J.-A. Sengstag Efficient implementation of rendezvous 267--272
J. M. Wilson Crossword compilation using integer
programming . . . . . . . . . . . . . . 273--275
H. Berghel and
C. Yi Crossword compiler-compilation . . . . . 276--280
B. Djokic and
M. Miyakawa and
S. Sekiguchi and
I. Semba and
I. Stojmenovic A fast iterative algorithm for
generating set partitions . . . . . . . 281--282
P. M. Yelland First steps towards fully abstract
semantics for object-oriented languages 290--296
D. G. Kafura and
K. H. Lee Inheritance in actor based concurrent
object-oriented languages . . . . . . . 297--304
W. R. Cook A proposal for making Eiffel type-safe 305--311
R. K. Raj and
H. M. Levy A compositional model for software reuse 312--322
G. N. Dixon and
G. D. Parrington and
S. K. Shrivastava and
S. M. Wheater The treatment of persistent objects in
Arjuna . . . . . . . . . . . . . . . . . 323--332
E. Laenens and
F. Staes and
D. Vermeir Browsing a la carte in object-oriented
databases . . . . . . . . . . . . . . . 333--340
T. P. Hopkins and
M. I. Wolczko Writing Concurrent Object-Oriented
Programs using Smalltalk-80 . . . . . . 341--350
M. C. Cooper Formal hierarchical object models for
fast template matching . . . . . . . . . 351--361
R. G. Melhem and
D. M. Chiarulli and
S. P. Levitan Space multiplexing of waveguides in
optically interconnected multiprocessor
systems . . . . . . . . . . . . . . . . 362--369
J. P. Bennett and
G. C. Smith The need for reduced byte stream
instruction sets . . . . . . . . . . . . 370--373
C. Mitchell Another Postage Stamp Problem . . . . . 374--376
A. Oxley Calculating earthworks volumes --- an
exercise in geometric algorithms . . . . 377--379
I. Sommerville and
R. Thomson An approach to the support of software
evolution . . . . . . . . . . . . . . . 386--398
M. W. Shields Implicit system specification and the
interface equation . . . . . . . . . . . 399--412
R. M. Gallimore and
D. Coleman and
V. Stavridou UMIST OBJ: a language for executable
program specifications . . . . . . . . . 413--421
C. S. McDonald and
L. Allison Denotational Semantics of a Command
Interpreter and their Implementation in
Standard ML . . . . . . . . . . . . . . 422--431
B. A. Wichmann Towards a formal specification of
floating point . . . . . . . . . . . . . 432--436
L. V. Mancini and
G. P. Pappalardo Proving correctness properties of a
replicated synchronous program . . . . . 437--444
V. P. Heuring and
U. Kastens and
R. G. Plummer and
W. M. Waite COMAR: a data format for integration of
CFG tools . . . . . . . . . . . . . . . 445--452
P. Tsanakas and
N. Alexandridis and
G. Papakonstantinou An FP-based design methodology for
problem-oriented architectures . . . . . 453--460
D. I. Bevan and
G. L. Burn and
R. J. Karia and
J. D. Robson Principles for the design of a
distributed memory architecture for
parallel graph reduction . . . . . . . . 461--469
M. C. Er A new algorithm for generating binary
trees using rotations . . . . . . . . . 470--473
J. A. Ellis and
P. M. Lepolesa A Las Vegas graph colouring algorithm 474--476
D. F. Brailsford and
R. J. Beach Electronic publishing --- a journal and
its production . . . . . . . . . . . . . 482--493
R. Furuta An object-based taxonomy for abstract
structure in document models . . . . . . 494--504
H. Brown Standards for structured documents . . . 505--514
I. Ritchie Hypertext-moving towards large volumes 516--523
R. A. Morris Rendering digital type: a historical and
economic view of technology . . . . . . 524--532
P. S. Licker Human resource management and business
success in small, hi-tech firms: some
lessons for data processing . . . . . . 533--540
D. A. Umphress and
U. W. Pooch and
M. Tanik Fast prototyping of a goal-oriented
simulation environment system . . . . . 541--548
J. R. Parker On the conversion of filled polygonal
regions from raster to vector
representation . . . . . . . . . . . . . 549--553
G. H. Kirby and
M. Visvalingam and
P. Wade Recognition and representation of a
hierarchy of polygons with holes . . . . 554--562
A. Quin and
Y. Yanagisawa On data compaction of scanning curves 563--566
A. D. Robison and
B. J. Hafner and
S. S. Skiena Eight pieces cannot cover a chess board
(search technique) . . . . . . . . . . . 567--570
M. Cosnard and
A. G. Ferreira Generating permutations on a VLSI
suitable linear network . . . . . . . . 571--573
K. H. Baik and
L. L. Miller Topological approach for testing
equivalence in heterogeneous relational
databases . . . . . . . . . . . . . . . 2--10
N. L. Sarda Algebra and Query Language for A
Historical Data Model . . . . . . . . . 11--18
M. Levene and
G. Loizou The nested relation type model: an
application of domain theory to
databases . . . . . . . . . . . . . . . 19--30
M. Azmoodeh BRMQ: a database interface facility
based on graph traversals and extended
relationships on groups of entities . . 31--39
D. A. Bell and
J. Shao and
M. Elizabeth C. Hull Integrated Deductive Database System
Implementation. A Systematic Study . . . 40--48
M. C. Taylor Logical optimisation of distributed
knowledge base queries . . . . . . . . . 49--60
T. P. Martin and
K. H. Lam and
Judy I. Russell An Evaluation of Site Selection
Algorithms for Distributed Query
Processing . . . . . . . . . . . . . . . 61--70
D. Agrawal and
A. El Abbadi Integrating Security with Fault-tolerant
Distributed Databases . . . . . . . . . 71--78
R. Mukkamala and
S. C. Bruell Efficient schemes to evaluate
transaction performance in distributed
database systems . . . . . . . . . . . . 79--89
R. E. Griswold String Scanning in the Icon Programming
Language . . . . . . . . . . . . . . . . 98--107
P. C. Philbrow and
M. P. Atkinson Events and exception handling in
PS-Algol . . . . . . . . . . . . . . . . 108--125
R. G. Dromey and
T. A. Chorvat Structure Clashes --- An Alternative to
Program Inversion . . . . . . . . . . . 126--132
M. O. Jokinen Parameter Transmission Abstractions . . 133--139
G. Whale Identification of Program Similarity in
Large Populations . . . . . . . . . . . 140--146
G. L. Davies and
A. Burns The Teaching Language Pascal-FC . . . . 147--154
C. F. Reynolds CODIL: The Architecture of an
Information Language . . . . . . . . . . 155--163
Gerald D. P. Dueck and
Gordon V. Cormack Modular Attribute Grammars . . . . . . . 164--172
Marian Petre and
R. Winder On Languages, Models and Programming
Styles . . . . . . . . . . . . . . . . . 173--180
H. Berghel and
R. Rankin A Proposed Standard for Measuring
Crossword Compilation Efficiency . . . . 181--184
R. Govindarajan and
L. M. Patnaik Lenient Execution and Concurrent
Execution of Re-entrant Routines:
Efficient Implementation in Data Flow
Systems . . . . . . . . . . . . . . . . 185--187
O. G. Plata and
J. D. Bruguera and
F. F. Rivera and
R. Doallo and
E. L. Zapata ACLE: a Software Package for SIMD
Computer Simulation . . . . . . . . . . 194--203
S. Gulati and
S. S. Iyengar and
J. Barhen The Pebble-crunching Model for
Fault-tolerant Load Balancing in
Hypercube Ensembles . . . . . . . . . . 204--214
K. W. Ng and
H. F. Leung Competition: A Model of AND-Parallel
Execution of Logic Programs . . . . . . 215--218
Camille C. Price and
M. A. Salama Scheduling of Precedence-Constrained
Tasks on Multiprocessors . . . . . . . . 219--229
D. Abramson and
G. Egan The RMIT Data Flow Computer: A Hybrid
Architecture . . . . . . . . . . . . . . 230--240
S. Dey and
P. K. Srimani A New Parallel Sorting Algorithm and its
Efficient VLSI Implementation . . . . . 241--246
P. Chaudhuri Finding and updating depth-first
spanning trees of acyclic digraphs in
parallel . . . . . . . . . . . . . . . . 247--251
F.-. C. Lin and
K. Chen On the design of an integrated systolic
array for solving simultaneous linear
equations . . . . . . . . . . . . . . . 252--260
G. M. Megson An efficient double pipe systolic array
for matrix product . . . . . . . . . . . 261--265
H. Wills Fundamentals of Pricing and Scheduling
Computer Services and Investment in
Computer Equipment . . . . . . . . . . . 266--273
J. S. Rohl Reversing is not inherent in
lexicographical permutation generation 274--278
F. W. Burton and
J. G. Kollias and
D. G. Matsakis and
V. G. Kollias Implementation of overlapping B-trees
for time and space efficient
representation of collections of similar
files . . . . . . . . . . . . . . . . . 279--280
G. Xunrang and
Z. Yuzhang A New HEAPSORT Algorithm and the
Analysis of Its Complexity . . . . . . . 281--282
C. Mitchell and
D. Rush and
M. Walker A Secure Messaging Architecture
Implementing the X.400-1988 Security
Features . . . . . . . . . . . . . . . . 290--295
A. S. Fraenkel and
S. T. Klein Bidirectional Huffman coding . . . . . . 296--307
R. L. Bailey and
R. Mukkalama Pipelining data compression algorithms 308--313
P. Fenwick Performance Measurements on a 39 km
Extended Ethernet . . . . . . . . . . . 314--322
Y. Pan and
R. Melhem Short circuits in buffered multi-stage
interconnection networks . . . . . . . . 323--329
F. W. Burton and
G. P. McKeown and
V. J. Rayward-Smith Applications of UET scheduling theory to
the implementation of declarative
languages . . . . . . . . . . . . . . . 330--336
D. Alcock and
D. Brown PRAXIS: A Program for Reproducing
Proforma Design Calculations . . . . . . 337--343
M. Ancona and
L. De Floriani and
J. S. Deogun Structured spanning trees . . . . . . . 344--355
R. Feldman and
M. C. Golumbic Optimization algorithms for student
scheduling via constraint satisfiability 356--364
B. K. Haddon Cycle-Sort: A Linear Sorting Method . . 365--367
B. J. Oommen and
D. T. H. Ng On Generating Random Permutations with
Arbitrary Distributions . . . . . . . . 368--374
H. Miyakoshi A Literal Code Method for Minimizing
Boolean Functions . . . . . . . . . . . 375--380
T. H. Merrett Scoping is not orthogonal to
completeness . . . . . . . . . . . . . . 381--381
S. B. M. Bell and
D. C. Mason Tesseral Quaternions for the Octtree . . 386--397
A. Hunter and
P. J. Willis A note on the optimal labelling of
quadtree nodes . . . . . . . . . . . . . 398--401
K. G. Suffern Quadtree Algorithms for Contouring
Functions of Two Variables . . . . . . . 402--407
L. R. Neal and
M. L. V. Pitteway Yet More Circle Generators . . . . . . . 408--411
B. Pham Algorithms for calculating cubic
Beta-splines . . . . . . . . . . . . . . 412--416
P. Puliti and
G. Tascini Interpreting Technical Drawings . . . . 417--423
F. Dehne and
L. Ficocelli An efficient computational geometry
method for detecting dotted lines in
noisy images . . . . . . . . . . . . . . 424--428
L. Moltedo and
A. Noferini An Implementation of $7$-bit Character
Encoding for Standard Computer Graphics
Environments . . . . . . . . . . . . . . 429--436
F. Neelamkavil and
O. Mullarney Separating Graphics from Application in
the Design of User Interfaces . . . . . 437--443
M. Bilodeau and
D. Laguitton Development of Screen Management
Subroutines Compatible with Microsoft
FORTRAN Compiler . . . . . . . . . . . . 444--452
K. Bowden Kron's method of tearing on a Transputer
Array . . . . . . . . . . . . . . . . . 453--459
L. Allison Continuations Implement Generators and
Streams . . . . . . . . . . . . . . . . 460--465
T. H. Axford Reference Counting of Cyclic Graphs for
Functional Programs . . . . . . . . . . 466--470
A. Andersson A Note on the Expected Behaviour of
Binary Tree Traversals . . . . . . . . . 471--472
G. Alia and
E. Martinelli VLSI Binary-Residue Converters for
Pipelined Processing . . . . . . . . . . 473--475
K. L. Clark Parallel logic programming . . . . . . . 482--493
Kazunori Ueda and
Takashi C. Chikayama Design of the kernel language for the
parallel inference machine . . . . . . . 494--500
I. Foster and
C. Kesselman and
S. Taylor Concurrency: Simple Concepts and
Powerful Tools . . . . . . . . . . . . . 501--507
I. Shizgal The Amoeba-Prolog System . . . . . . . . 508--517
J. G. Wolff Simplicity and power --- some unifying
ideas in computing . . . . . . . . . . . 518--534
K. G. Waugh and
M. H. Williams and
Q. Kong and
S. Salvini and
G. Chen Designing SQUIRREL: an extended SQL for
a deductive database system . . . . . . 535--546
N. W. Paton and
P. M. D. Gray Optimising and executing DAPLEX queries
using Prolog . . . . . . . . . . . . . . 547--555
H. J. Roberts Expert Systems Clubs: Design Methods . . 556--561
G. M. Megson and
D. J. Evans A systolic array solution for the
assignment problem . . . . . . . . . . . 562--569
T. Y. Chen On the consistency of multi-valued
functions . . . . . . . . . . . . . . . 570--572
A. J. J. Dick An introduction to Knuth--Bendix
completion . . . . . . . . . . . . . . . 2--15
A. J. J. Dick and
P. Watson Order-sorted term rewriting . . . . . . 16--19
M. Hermann and
C. Kirchner and
H. Kirchner Implementations of term rewriting
systems . . . . . . . . . . . . . . . . 20--33
T. Nipkow Constructive rewriting . . . . . . . . . 34--41
P. Padawitz Reduction and narrowing for Horn clause
theories . . . . . . . . . . . . . . . . 42--51
P. Kacsuk A Parallel Prolog Abstract Machine and
its Multi-Transputer Implementation . . 52--63
J. Paakki Prolog in Practical Compiler Writing . . 64--72
L. Orman Constraint Maintenance as a Data Model
Design Criterion . . . . . . . . . . . . 73--79
F. B. Bastani and
I.-R. Chen and
W. Hilal A model for the stability analysis of
maintenance strategies for linear list 80--87
M. A. Weiss Empirical Study of the Expected Running
Time of Shellsort . . . . . . . . . . . 88--91
J.-. L. Wu and
S.-T. Cheng A neural network simulating system . . . 92--93
D. E. Avison and
A. T. Wood-Harper Information systems development
research: an exploration of ideas in
practice . . . . . . . . . . . . . . . . 98--112
F. Noble Seven Ways to Develop Office Systems: A
Managerial Comparison of Office System
Development Methodologies . . . . . . . 113--121
C.-C. D. Poo Representing business policies in the
Jackson system development method . . . 122--131
A. G. Sutcliffe and
I. Wang Integrating human computer interaction
with Jackson system development . . . . 132--142
T. H. Tse and
L. Pong An examination of requirements
specification languages . . . . . . . . 143--152
J. Trenouth A Survey of Exploratory Software
Development . . . . . . . . . . . . . . 153--163
M. Elizabeth C. Hull and
P. G. O'Donoghue and
B. J. Hagan Development Methods for Real-Time
Systems . . . . . . . . . . . . . . . . 164--172
A. Burns and
A. M. Lister A Framework for Building Dependable
Systems . . . . . . . . . . . . . . . . 173--181
P. Hammersley Information Systems Design Methodologies
--- Book Reviews . . . . . . . . . . . . 182--185
D. Campbell and
T. McNeill Finding a Majority When Sorting is Not
Available . . . . . . . . . . . . . . . 186--186
M. V. Wilkes The Maturing of VLSI --- and its
Consequences for the Computer Industry 193--194
M. Ancona and
A. Clematis and
L. De Floriani and
E. Puppo HIDEL: A Language for Hierarchical VLSI
Design . . . . . . . . . . . . . . . . . 195--206
B. Wilkinson Comparative Performance of Overlapping
Connectivity Multiprocessor
Interconnection Networks . . . . . . . . 207--214
A. Olerup Design Approaches: A Comparative Study
of Information System Design and
Architectural Design . . . . . . . . . . 215--224
M. H. O'Docherty and
C. N. Daskalakis Multimedia Information Systems --- The
Management and Semantic Retrieval of all
Electronic Data Types . . . . . . . . . 225--238
P. King and
C. Small Default databases and incomplete
information . . . . . . . . . . . . . . 239--244
R. Marshall Manipulating Full-text Scientific
Databases: A Logic-based
Se\-man\-tico-prag\-matic Approach . . . 245--253
I. A. Macleod A Query Language for Retrieving
Information from Hierarchic Text
Structures . . . . . . . . . . . . . . . 254--264
K. Morgan and
R. L. Morris and
S. Gibbs When does a mouse become a rat? or
\ldotsComparing performance and
preferences in direct manipulation and
command line environment . . . . . . . . 265--271
The Rt. Hon. The Earl Of Halsbury Innovation for Failure --- Some
Reflections on the Work of the NRDC
Relevant to the Early History of the
Computer Industry in the UK . . . . . . 272--274
The Rt. Hon. The Earl Of Halsbury Ten Years of Computer Development . . . 275--279
V. Akman Short notes: Implementation of Karp-Luby
Monte Carlo method: an exercise in
approximate counting . . . . . . . . . . 279--282
K. Wicovsky and
P. F. Thanisch and
M. H. Williams Improved recursion handling through
integrity constraints . . . . . . . . . 282--285
Ian Watson Editorial: Concurrent Programming . . . 289--289
H. Kingdon and
D. R. Lester and
G. L. Burn The HDG-Machine: a Highly Distributed
Graph-Reducer for a Transputer Network 290--301
D. B. Skillicorn Practical Concurrent Programming for
Parallel Machines . . . . . . . . . . . 302--310
J. Padget and
R. Bradford and
J. Fitch Concurrent Object-Oriented Programming
in Lisp . . . . . . . . . . . . . . . . 311--319
M.-C. Pong I-Pigs: an interactive graphical
environment for concurrent programming 320--330
E. J. Yannakoudakis and
A. A. Shahid A Controlled Environment for
Meta-Message Processing . . . . . . . . 331--344
K-B. Yue and
R. T. Jacob An efficient starvation-free semaphore
solution for the graphical mutual
exclusion problem . . . . . . . . . . . 345--349
S. Khanna Logic Programming for Software
Verification and Testing . . . . . . . . 350--357
J. Vanthienen Algorithm 124: A Longest Path Algorithm
to Display Decision Tables . . . . . . . 358--362
A. P. Hammersley Algorithm 125: Efficient Two-Dimensional
Fast Fourier Transform Subroutines for
Real-Valued or Hermitian data . . . . . 362--370
W. Dobosiewicz Algorithm 126: Linear Probing Sort . . . 370--373
J. K. Slape and
P. J. L. Wallis Algorithm 127: A modification of Sale's
algorithm to accommodate FORTRAN 77 . . 373--376
A. Stewart and
C. Holt and
M. Clint and
R. Perrott Algorithm 128: A DAP FORTRAN subroutine
for thinning digitised pictures . . . . 377--379
E. Makinen Efficient Generation of
Rotational-Admissible Codewords for
Binary Trees . . . . . . . . . . . . . . 379--379
C. Brink and
I. M. Rewitzky and
R. A. Schmidt Autodescriptivity: beware! . . . . . . . 380--381
David Watson Editorial: Data Structures . . . . . . . 385--385
D. J. Challab Implementation of Flexible Arrays Using
Balanced Trees . . . . . . . . . . . . . 386--396
B. Srinivasan An adaptive overflow technique to defer
splitting in B-trees . . . . . . . . . . 397--405
W. F. Smyth Mu-balancing M-way Search Trees . . . . 406--414
S. P. Dandamudi and
P. G. Sorenson Improved Partial-Match Search Algorithms
for BD Trees . . . . . . . . . . . . . . 415--422
S. Olariu and
C. M. Overstreet and
Z. Wenn A mergeable double-ended priority queue 423--427
D. Naor and
C. U. Martel and
N. S. Matloff Performance of Priority Queue Structures
in a Virtual Memory Environment . . . . 428--437
E. Mäkinen A survey on binary tree codings . . . . 438--443
G. Argo Weighting Without Waiting: the Weighted
Path Length Tree . . . . . . . . . . . . 444--449
P. M. Fenwick A New Technique for Self-Organising
Linear Searches . . . . . . . . . . . . 450--454
Seng Fat Ou and
Alan L. Tharp High Storage Utilisation for
Single-Probe Retrieval Linear Hashing 455--468
C. C. Chang and
C. Y. Chen and
J. K. Jan On the design of a machine-independent
perfect hashing scheme . . . . . . . . . 469--474
P. Ru\vzi\vcka A note on the efficiency of an interval
routing algorithm . . . . . . . . . . . 475--476
Andrew Herbert Editorial: Distributed Systems . . . . . 481--481
W. B. Daszczuk A Structured Semantic Design of
Distributed Operating Systems . . . . . 482--492
N. T. Son and
Y. Paker Adaptive deadlock-free packet routing in
transputer-based multiprocessor
interconnection networks . . . . . . . . 493--502
L. Mancini and
S. K. Shrivastava Fault-Tolerant Reference Counting for
Garbage Collection in Distributed
Systems . . . . . . . . . . . . . . . . 503--513
J. Dollimore and
E. Miranda and
Xu Wang The Design of a System for Distributing
Shared Objects . . . . . . . . . . . . . 514--521
M. S. Verrall Unity Doesn't Imply Unification or
Overcoming Heterogeneity Problems in
Distributed Software Engineering
Environments . . . . . . . . . . . . . . 522--533
D. Agrawal and
A. Malpani Efficient Dissemination of Information
in Computer Networks . . . . . . . . . . 534--541
L. H. Geesink The Coordination of Distributed Active
Messages in a Dynamic Network Topology 542--550
P. Bodorik and
J. S. Riordon Threshold Values for Processing
Distributed Queries . . . . . . . . . . 551--558
D. Michie Methodologies from Machine Learning in
Data Analysis and Software . . . . . . . 559--565
Lu Lahodynskyj Structure Clashes . . . . . . . . . . . 566--568
J. S. Rohl Ord-Smith's pseudo-lexicographical
permutation procedure is the
Tompkins-Paige algorithm . . . . . . . . 569--570
K. K. Lau Top-down synthesis of sorting algorithm A001--A007
D. A. Watt Modular description of programming
languages . . . . . . . . . . . . . . . A009--A028
S. Dvorak and
B. Durian Decomposition merging with symmetric
exchanges . . . . . . . . . . . . . . . A029--A033
R. Marshall Discourse and natural-language text
analysis: functional grammar approach A035--A060
W. W. L. Lee and
D. S. Bowers A relational database simulator . . . . A061--A072
V. Goel and
Y. V. Venkatesh On an optimal and faster construction of
linear quadtrees from raster-scanned
images . . . . . . . . . . . . . . . . . A073--A083
W. Wah and
S. G. Akl Simulating multiple memory accesses in
logarithmic time and linear space . . . A085--A088
C. J. Wang and
C. H. Wu and
V. P. Nelson A study of the generalized multiple
bus-connected parallel computer . . . . A089--A094
A. Ghafoor and
F. Y. Farhat Dynamic concurrency control algorithms
for large distributed database systems A095--A104
B. J. Oommen and
D. C. Y. Ma Stochastic automata solutions to the
object partitioning problem . . . . . . A105--A120
V. S. Alagar and
P. Goyal and
P. S. Nair and
F. Sadri Integrated magic set method: a rule
rewrite scheme for optimising linear
datalog programs . . . . . . . . . . . . A121--A129
G. Tredoux Mechanizing Execution Sequence Semantics
in HOL . . . . . . . . . . . . . . . . . 81--86
A. Burns and
J. McDermid and
J. Dobson On the Meaning of Safety and Security 3--15
J.-J. Hwang and
B.-M. Shao and
P. C. Wang A new access control method using prime
factorisation . . . . . . . . . . . . . 16--20
M. V. D. Burmester and
Y. G. Desmedt and
T. Beth Efficient Zero-Knowledge Identification
Schemes for Smart Cards . . . . . . . . 21--29
R. de Lemos and
A. Saeed and
T. Anderson A train set as a case study for the
requirements analysis of safety-critical
systems . . . . . . . . . . . . . . . . 30--40
Christopher Hankins and
John Vince Book reviews: \em The SGML Handbook, by
Charles Goldfarb, 1990; \em Fractal
Creations, by Timothy Wegner and Mark
Peterson, 1991 . . . . . . . . . . . . . 40--40
B. A. Wichmann A Note on the Use of Floating Point in
Critical Systems . . . . . . . . . . . . 41--44
M. Ho Kim and
S. Pramanik Optimizing Database Accesses for
Parallel Processing of Multikey Range
Searches . . . . . . . . . . . . . . . . 45--51
I. F. Akyildiz Performance Analysis of a Multiprocessor
System Model with Process Communication 52--61
R. G. Börn and
J. R. Kenevan Theoretical Performance-Based
Cost-Effectiveness of Multicomputers . . 62--70
H. Shen Self-adjusting Mapping: A Heuristic
Mapping Algorithm for Mapping Parallel
Programs on to Transputer Networks . . . 71--80
D. Kaur Hierarchical Hypernet for Pipelining . . 81--87
M. Vassallo and
A. Ralston Algorithms for De Bruijn Sequences --- A
Case Study in the Empirical Analysis of
Algorithms . . . . . . . . . . . . . . . 88--90
W. Sun and
W. Meng and
C. Yu Query Optimisation in Distributed
Object-Oriented Database Systems . . . . 98--107
J. A. Mariani Oggetto: An Object Oriented Database
Layered on a Triple Store . . . . . . . 108--118
A. Poulovassilis The Implementation of FDL, a Functional
Database Language . . . . . . . . . . . 119--128
J. S. H. Yang and
Y. H. Chin and
C. G. Chung Many-Sorted First-Order Logic Database
Language . . . . . . . . . . . . . . . . 129--137
P. G. Harrison and
H. Khoshnevisan The Mechanical Transformation of Data
Types . . . . . . . . . . . . . . . . . 138--147
Th. P. van der Weide and
A. H. M. ter Hofstede and
P. van Bommel Uniquest: Determining the Semantics of
Complex Uniqueness Constraints . . . . . 148--156
T. Conlon and
S. Gregory Debugging Tools for Concurrent Logic
Programming . . . . . . . . . . . . . . 157--169
S. J. Thompson and
R. D. Lins The Categorical Multi-Combinator
Machine: CMCM . . . . . . . . . . . . . 170--176
O. Nevalainen and
T. Raita An Internal Hybrid Sort Algorithm
Revisited . . . . . . . . . . . . . . . 177--183
Maristella Agosti and
Pier Giorgio Marchetti User Navigation in the IRS Conceptual
Structure through a Semantic Association
Function . . . . . . . . . . . . . . . . 194--199
D. C. Blair Information Retrieval and the Philosophy
of Language . . . . . . . . . . . . . . 200--207
P. D. Bruza and
T. P. Van Der Weide Stratified Hypermedia Structures for
Information Disclosure . . . . . . . . . 208--220
Alison Cawsey and
Julia Galliers and
Steven Reece and
Karen Sparck Jones Automating the Librarian: Belief
Revision as a Base for System Action and
Communication with the User . . . . . . 221--232
Y. Chiaramella and
J. P. Chevallet About Retrieval Models and Logic . . . . 233--242
Norbert Fuhr Probabilistic Models in Information
Retrieval . . . . . . . . . . . . . . . 243--255
David J. Harper and
Andrew D. M. Walker ECLAIR: an Extensible Class Library for
Information Retrieval . . . . . . . . . 256--267
Alan F. Smeaton Progress in the Application of Natural
Language Processing to Information
Retrieval Tasks . . . . . . . . . . . . 268--278
Howard R. Turtle and
W. Bruce Croft A Comparison of Text Retrieval Models 279--290
C. J. van Rijsbergen Probabilistic Retrieval Revisited . . . 291--298
David Gries Correspondence: On ``Finding a Majority
When Sorting is Not Available'' . . . . 298--298
C. C. Chang and
H. Y. Chen and
C. Y. Chen Symbolic Gray Code As a Data Allocation
Scheme for Two-Disc Systems . . . . . . 299--305
S. W. Dietrich and
M. Brown and
E. Cortes-Rello and
S. Wunderlin A Practitioner's Introduction to
Database Performance Benchmarks and
Measurements . . . . . . . . . . . . . . 322--331
D. H. O. Ling and
D. A. Bell Modelling and Managing Time in Database
Systems . . . . . . . . . . . . . . . . 332--341
E. Auramäki and
R. Hjrschheimi and
K. Lyytinen Modelling offices through discourse
analysis: the SAMPO approach . . . . . . 342--352
M. Turega A Computer Architecture to Support
Neural Net Simulation . . . . . . . . . 353--360
R. Manner and
O. Stucky Fault-Tolerant Data Transfer in a
Multiprocessor System by Forward and
Backward Hardware Error Recovery . . . . 361--368
J. Rosenberg and
J. L. Keedy and
D. Abramson Addressing Mechanisms for Large Virtual
Memories . . . . . . . . . . . . . . . . 369--375
R. A. Frost Constructing Programs as Executable
Attribute Grammars . . . . . . . . . . . 376--389
C. C. Chang and
H. F. Lin and
C. Y. Chen Optimality properties of the disc modulo
allocation method for $k$-ary multiple
key hashing files . . . . . . . . . . . 390--394
R. Sprugnoli Properties of Binary Trees Related to
Position . . . . . . . . . . . . . . . . 395--404
B. Parhami Systolic Number Radix Converters . . . . 405--409
J. Cooke Editorial -- Formal Methods: What? Why?
and When? . . . . . . . . . . . . . . . 417--418
J. Cooke Formal methods --- Mathematics, Theory,
Recipes or what? . . . . . . . . . . . . 419--423
A. Galton Classical Logic: a Crash Course for
Beginners . . . . . . . . . . . . . . . 424--430
A. Galton Logic as a Formal Method . . . . . . . . 431--440
J. C. P. Woodcock The Rudiments of Algorithm Refinement 441--450
T. Clement The Role of Data Reification in Program
Refinement: Origins, Synthesis and
Appraisal . . . . . . . . . . . . . . . 451--459
H. Ehrig and
B. Mahr and
I. Classen and
F. Orejas Introduction to Algebraic Specification.
Part 1: Formal Methods for Software
Development . . . . . . . . . . . . . . 460--467
H. Ehrig and
B. Mahr and
F. Orejas Introduction to Algebraic Specification.
Part 2: From Classical View to
Foundations of System Specifications . . 468--477
M. van Sinderen and
L. Ferreira Pires and
C. A. Vissers Protocol Design and Implementation Using
Formal Methods . . . . . . . . . . . . . 478--491
E. Auramäki and
R. Hirschheim and
K. Lyytinen Modelling Offices Through Discourse
Analysis: A Comparison and Evaluation of
SAMPO with OSSAD and ICN . . . . . . . . 492--500
B. Czejdo and
M. C. Taylor Integration of Information Systems Using
an Object-Oriented Approach . . . . . . 501--513
Harald Sòndergaard and
Peter Sestoft Non-Determinism in Functional Languages 514--523
A. A. Bertossi and
F. Luccio and
L. Pagli and
E. Lodi Short notes: A parallel solution to the
approximate string matching problem . . 524--526
D. J. Challab Short notes: Flexible arrays: evaluation
of the B-tree based system . . . . . . . 527--529
D. Furber Short notes: A survey of the teaching of
programming to computing undergraduates
in U.K. Universities and Polytechnics 530--533
D. T. H. Ng and
B. J. Oommen Short notes: A short note on
doubly-linked list re-organizing
heuristics . . . . . . . . . . . . . . . 533--535
B. Jamison and
S. Olariu Short notes: Indexing for
multi-attribute retrieval . . . . . . . 535--537
F. Sadri Data dependencies in deductive databases A415
K. N. Dandeker Implementation of parameterised views in
relational query languages with a macro
processor . . . . . . . . . . . . . . . A425
V. T. H. Paschos and
A. N. Stafylopatis Evaluation of the execution cost of
recursive definitions . . . . . . . . . A429
F. Neelamkavil and
S. O'Shea Interfacing Eiffel and PCTE . . . . . . A439
E. J. Yannakoudakis and
H. A. Attar-Bashi Constructing natural language sentences
from database tuples . . . . . . . . . . A445
P. W. Oman and
K. Van Houten On the use of binary strings to
represent tree structures . . . . . . . A463
J. K. Mullin Hash functions for hash-based join
methods . . . . . . . . . . . . . . . . A499--A503
E. A. Boiten and
H. A. Partsch and
D. Tuijnman and
N. Volker How to Produce Correct Software --- An
Introduction to Formal Specification and
Program Development by Transformations 547--554
P. G. Harrison A Higher-Order Approach to Parallel
Algorithms . . . . . . . . . . . . . . . 555--566
P. G. Larsen and
N. Plat Standards for Non-Executable
Specification Languages . . . . . . . . 567--573
D. R. Kuhn A Technique for Analyzing the Effects of
Changes in Formal Specifications . . . . 574--578
L. M. Barroca and
J. A. McDermid Formal methods: use and relevance for
the development of safety-critical
systems . . . . . . . . . . . . . . . . 579--599
L. T. Semmens and
R. B. France and
T. W. G. Docker Integrated structured analysis and
formal specification techniques . . . . 600--610
V. Mi\vsi\'c and
D. Vela\vsevi\'c and
B. Lazarevi\'c Formal Specification of a Data
Dictionary for an Extended ER Data Model 611--622
G. O'Neill Short note: Automatic translation of VDM
specifications into Standard ML programs 623--624
Trevor Clarkson Book review: \em VLSI Design of Neural
Networks, by Ulrich Ramacher and Ulrich
Ruckert . . . . . . . . . . . . . . . . 624--624
I. Bruha AI Multilanguage System McPOPLOG: The
Power of Communication Between its
Subsystems . . . . . . . . . . . . . . . 625--629
F. Barsi and
M. C. Pinotti Adding Flexibility to Hybrid Number
Systems . . . . . . . . . . . . . . . . 630--635
I. J. Davis A Fast Radix Sort . . . . . . . . . . . 636--642
B.-C. Huang and
M. A. Langston Fast stable merging and sorting in
constant extra space . . . . . . . . . . 643--650
C. H. Lin and
C. C. Chang and
R. C. T. Lee A Record-Oriented Cryptosystem for
Database Sharing . . . . . . . . . . . . 658--660
Keith van Rijsbergen, Editor-in-Chief Welcome . . . . . . . . . . . . . . . . 1--1
David Hutchison Special Issue Editorial: Distributed
Multimedia Systems . . . . . . . . . . . 2
F. Horn and
J. B. Stefani On Programming and Supporting Multimedia
Object Synchronisation . . . . . . . . . 4--18
S. Ramanathan and
P. Venkat Rangan Feedback techniques for intra-media
continuity and inter-media
synchronization in distributed
multimedia systems . . . . . . . . . . . 19--31
Phillip Lougher and
Doug Shepherd The Design of a Storage Server for
Continuous Media . . . . . . . . . . . . 32--42
W. Tawbi and
F. Horn and
E. Horlait and
J.-B. Stefani Video Compression Standards and Quality
of Service . . . . . . . . . . . . . . . 43--54
Ian Wakeman Packetized video: options for
interaction between the user, the
network and the codec . . . . . . . . . 55--67
P. E. Tischer and
R. T. Worley and
A. J. Maeder and
M. Goodwin Context-based Lossless Image Compression 68--77
M. Vazirgiannis and
C. Mourlas An object-oriented model for interactive
multimedia presentations . . . . . . . . 78--86
H. M. Vin and
M.-S. Chen and
T. Barzilai Collaboration Management in DiCE . . . . 87--96
S. C. Hui and
A. Goh and
L. H. Lau A multimedia information system for IC
failure analysis . . . . . . . . . . . . 97--105
J. Nievergelt and
P. Widmayer Guard Files: Stabbing and Intersection
Queries on Fat Spatial Objects . . . . . 107--116
M. F. Challis Two new techniques for computing
extremal $h$-bases ${A}_k$ . . . . . . . 117--126
B. Knight Information loss in temporal knowledge
representations . . . . . . . . . . . . 127--136
S. S. Yau and
J. V. Gore Paradigm lost: discovering the
intersection of assertion-guided program
construction and constraint-driven
re-evaluation . . . . . . . . . . . . . 137--142
N. Pliskin and
T. Romm and
A. S. Lee and
Y. Weber Presumed versus actual organizational
culture: managerial implications for
implementation of information systems 143--152
M. Elizabeth C. Hull and
P. G. O'Donoghue Family relationships between
requirements and design specification
methods . . . . . . . . . . . . . . . . 153--167
C. Burdorf and
J. Marti Load balancing strategies for Time Warp
on multi-user workstations . . . . . . . 168--176
V. Catania and
A. Puliafito and
L. Vita A model for performance evaluation of
gracefully degrading systems . . . . . . 177--185
R. J. Millar and
M. Elizabeth C. Hull and
J. H. Frazer The Millar Polyhedron and its use in the
construction of octrees . . . . . . . . 186--194
A. Poulovassilis A Pattern-Matching Algorithm for
Functional Databases . . . . . . . . . . 195--199
C. C. Charlton and
P. E. Dunne and
K. Halewood and
P. H. Leng An algorithm to generate random large
combinational circuits . . . . . . . . . 200--206
J. van Leeuwen and
D. Wood Interval Heaps . . . . . . . . . . . . . 209--216
G. Rossi Programs as Data in an Extended Prolog 217--226
M. Zviran and
W. J. Haga A comparison of password techniques for
multilevel authentication mechanisms . . 227--237
G. Hains and
L. M. R. Mullin Parallel Functional Programming with
Arrays . . . . . . . . . . . . . . . . . 238--245
S. J. Horng Constant time algorithm for template
matching on a reconfigurable array of
processors . . . . . . . . . . . . . . . 246--253
I. P. de Guzmán and
P. G. Harrison and
E. Medina Pipelines for Divide-and-Conquer
Functions . . . . . . . . . . . . . . . 254--268
W. Appelt and
N. Tetteh-Lartey The formal specification of the ISO open
document architecture (ODA) standard . . 269--279
M. A. Weiss On Finding the Height of a Binary Search
Tree . . . . . . . . . . . . . . . . . . 280--281
B. J. Oommen Transforming ill-conditioned constrained
problems using projections . . . . . . . 282--285
I. Wegener A simple modification of Xunrang and
Yuzhang's HEAPSORT variant improving its
complexity significantly . . . . . . . . 286--288
Peter Hammersley Special Issue Editorial: Computing
Curricula . . . . . . . . . . . . . . . 297
Anthony Finkelstein European computing curricula: a guide
and comparative analysis . . . . . . . . 299--319
Anthony Finkelstein and
Jeff Kramer and
Samson Abramsky and
Krysia Broda and
Sophia Drossopoulou and
Susan Eisenbach An Integrated Engineering Study Scheme
in Computing . . . . . . . . . . . . . . 320--334
Jonathan D. Pemberton and
Joanne M. Smailes Educating the Masses --- is IT a Tricky
Business? . . . . . . . . . . . . . . . 335--342
Chris Osborne Planning for IT literacy in an
institution of higher education: a case
study . . . . . . . . . . . . . . . . . 343--350
P. Naur Understanding Turing's universal machine
--- personal style in program
description . . . . . . . . . . . . . . 351--372
Doug Goldson and
Steve Reeves and
Richard Bornat A review of several programs for the
teaching of logic . . . . . . . . . . . 373--386
Andrew Ireland On exploiting the structure of
Martin-Lof's Theory of Types . . . . . . 387--398
Hoon Hong Special Issue Editorial: Computational
Quantifier Elimination . . . . . . . . . 399
Felipe Cucker On the complexity of quantifier
elimination: the structural approach . . 400--408
John Canny Improved algorithms for sign
determination and existential quantifier
elimination . . . . . . . . . . . . . . 409--418
Devdatt P. Dubhashi Quantifier Elimination in $p$-adic
Fields . . . . . . . . . . . . . . . . . 419--426
Joos Heintz and
Marie-Françoise Roy and
Pablo Solernó On the theoretical and practical
complexity of the existential theory of
reals . . . . . . . . . . . . . . . . . 427--431
Scott McCallum Solving polynomial strict inequalities
using cylindrical algebraic
decomposition . . . . . . . . . . . . . 432--438
Hoon Hong Quantifier elimination for formulas
constrained by quadratic equations via
slope resultants . . . . . . . . . . . . 439--449
Rüdiger Loos and
Volker Weispfenning Applying Linear Quantifier Elimination 450--462
Vijay Chandru Variable Elimination in Linear
Constraints . . . . . . . . . . . . . . 463--472
Jean-Louis Imbert Variable elimination for disequations in
generalized linear constraint systems 473--484
Dinesh Manocha Efficient Algorithms for MultiPolynomial
Resultant . . . . . . . . . . . . . . . 485--496
Richard Liska and
Stanly Steinberg Applying quantifier elimination to
stability analysis of difference schemes 497--503
John Canny Computing Roadmaps of General
Semi-Algebraic Sets . . . . . . . . . . 504--514
M. J. González-López and
T. Recio Path Tracking in Motion Planning . . . . 515--524
Abraham Mehrez and
Geoffry S. Howard and
Yaakov Lugassi and
Peretz Shoval Information system planning and
selection: a multiattribute theoretic
approach . . . . . . . . . . . . . . . . 525--541
B. John Oommen and
Chris Fothergill Fast learning automaton-based image
examination and retrieval . . . . . . . 542--553
Daniel Y. Chao and
David T. Wang and
Douglas D. C. Hung Convergence time and memory capacity of
higher-order Hopfield associative memory
with multi-valued neurons . . . . . . . 554--561
L. A. Breene Quadtrees and hypercubes: grid embedding
strategies based on spatial data
structure addressing . . . . . . . . . . 562--569
Henry Ker-Chang Chang and
Shing Hong Chen A new locally adaptive data compression
scheme using multilist structure . . . . 570--578
Zbigniew J. Czech and
Bohdan S. Majewski A Linear Time Algorithm for Finding
Minimal Perfect Hash Functions . . . . . 579--587
C. M. Khoong Shortest-Path Reconstruction Algorithms 588--592
M. D. Atkinson Uniform generation of rooted ordered
trees with prescribed degrees . . . . . 593--594
Jukka Teuhola and
Timo Raita Application of a finite-state model to
text compression . . . . . . . . . . . . 607--614
Pasi Fränti and
Olli Nevalainen A two-stage modelling method for
compressing binary images by arithmetic
coding . . . . . . . . . . . . . . . . . 615--622
Robert R. Goldberg Finite State Automata from Regular
Expression Trees . . . . . . . . . . . . 623--630
Min Sheng Lin and
Deng Jyi Chen General reduction methods for the
reliability analysis of distributed
computing systems . . . . . . . . . . . 631--644
Tim B. Cooper and
Jeffrey H. Kingston The solution of real instances of the
timetabling problem . . . . . . . . . . 645--653
D. J. Pavey and
L. A. Winsborrow Demonstrating equivalence of source code
and PROM contents . . . . . . . . . . . 654--667
A. S. Fraenkel and
S. T. Klein Bounding the Depth of Search Trees . . . 668--678
Thomas Schwederski and
Rudolph Kober Special Issue Editorial: Parallel
Processing . . . . . . . . . . . . . . . 683--683
M. Schneider and
U. Wever and
Q. Zheng Solving large and sparse linear
equations in analog circuit simulation
on a cluster of workstations . . . . . . 685--689
D. A. Clark and
C. J. Rawlings and
J. Shirazi and
L.-L. Li and
K. Schuerman and
M. Reeve and
A. Veron Solving large combinatorial problems in
molecular biology using the ElipSys
parallel constraint logic programming
system . . . . . . . . . . . . . . . . . 690--701
U. Geuder and
M. Hardtner and
A. Reuter and
B. Worner and
R. Zink GRIDS --- a parallel programming system
for grid-based algorithms . . . . . . . 702--711
V. B. Muchnick and
A. V. Shafarenko and
C. D. Sutton $F$-code and its Implementation: a
Portable Software Platform for Data
Parallelism . . . . . . . . . . . . . . 712--722
Neil Berrington and
David De Roure and
Julian Padget Guaranteeing unpredictability
(programming model) . . . . . . . . . . 723--733
B. Bergsten and
M. Couprie and
P. Valduriez Overview of Parallel Architectures for
Databases . . . . . . . . . . . . . . . 734--740
Hermann Hellwagner Design Considerations for Scalable
Parallel File Systems . . . . . . . . . 741--755
F. Abolhassan and
R. Drefenstedt and
J. Keller and
W. J. Paul and
D. Scheerer On the Physical Design of PRAMs . . . . 756--762
C. R. Jesshope and
C. Izu The MP1 network chip and its application
to parallel computers . . . . . . . . . 763--777
Peter Thompson Concurrent Interconnect for Parallel
Systems . . . . . . . . . . . . . . . . 778--784
Jurg Nievergelt and
Mike Freeston Special Issue Editorial: Other Objects,
or: What is unique about Spatial Data? 1--2
D. A. Varley and
M. Visvalingam Road extraction and topographic data
validation using area topology . . . . . 3--15
Oliver Günther and
Johannes Lamberts Object-oriented Techniques for the
Management of Geographic and
Environmental Data . . . . . . . . . . . 16--25
Michael F. Worboys A Unified Model for Spatial and Temporal
Information . . . . . . . . . . . . . . 26--34
Peter Schorn Degeneracy in geometric computation and
the perturbation approach . . . . . . . 35--42
Christopher B. Jones and
David B. Kidner and
J. Mark Ware The implicit triangulated irregular
network and multiscale spatial databases 43--57
James Bradley A complete ${L}$-system specification
for generating an exact self-affine
growth-decay function with a random walk
scaling property . . . . . . . . . . . . 58--66
Daniel Y. Chao and
Mengchu Zhou and
David T. Wang Extending the knitting technique to
Petri Net synthesis of automated
manufacturing systems . . . . . . . . . 67--76
Alan Bundy and
Hector MacQueen The New Software Copyright Law . . . . . 79--82
Ian H. Witten and
Timothy C. Bell and
Alistair Moffat and
Craig G. Nevill-Manning and
Tony C. Smith and
Harold Thimbleby Semantic and generative models for lossy
text compression . . . . . . . . . . . . 83--87
Nenad Marovac Link Associated Computation in HyperNet 88--95
Victoria Stavridou Formal Methods and VLSI Engineering
Practice . . . . . . . . . . . . . . . . 96--113
Jixin Ma and
Brian Knight A General Temporal Theory . . . . . . . 114--123
D. Bhagavathi and
C. E. Grosch and
S. Olariu A Greedy Hypercube-Labeling Algorithm 124--128
Kwok-Bun Yue and
R. T. Jacob An optimal algorithm for reducing
edge-solvable mutual exclusion graphs 129--138
Greg A. Wade and
Jiang-Hsing Chu Drawability of complete graphs using a
minimal slope set . . . . . . . . . . . 139--142
M. Lamming and
P. Brown and
K. Carter and
M. Eldridge and
M. Flynn and
G. Louie and
P. Robinson and
A. Sellen The design of a human memory prosthesis 153--163
Nikos A. Lorentzos and
Alexandra Poulovassilis and
Carol Small Implementation of Update Operations for
Interval Relations . . . . . . . . . . . 164--176
Doug Goldson A symbolic calculator for non-strict
functional programs . . . . . . . . . . 177--187
Kisenchand Ranai and
Koon Seng Lim and
R. H. Deng Simulating a Multimedia FDDI Backbone
Network . . . . . . . . . . . . . . . . 188--198
Yuliang Zheng and
T. Hardjono and
J. Seberry Reusing Shares in Secret Sharing Schemes 199--205
M. Hamdi and
R. W. Hall An efficient class of interconnection
networks for parallel computations . . . 206--218
Benjamin Arazi On primality testing using purely
divisionless operations . . . . . . . . 219--222
Sòren Christensen and
Yoram Hirshfeld and
Faron Moller Decidable Subsets of CCS . . . . . . . . 233--242
Jan A. Bergstra and
Inge Bethke and
Alban Ponse Process Algebra with Iteration and
Nesting . . . . . . . . . . . . . . . . 243--258
Wan Fokkink and
Hans Zantema Basic process algebra with iteration:
completeness of its equational axioms 259--267
S. Mauw and
M. A. Reniers An algebraic semantics of basic message
sequence charts . . . . . . . . . . . . 269--277
Henri P. Korver A Theory for Simulators . . . . . . . . 279--287
M. A. Bezem and
J. F. Groote A Correctness Proof of a One-bit Sliding
Window Protocol in $\mu$CRL . . . . . . 289--307
Pasi Fränti and
Olli Nevalainen and
Timo Kaukoranta Compression of digital images by block
truncation coding: a survey . . . . . . 308--332
Wentong Cai and
Stephen J. Turner An Approach to the Run-Time Monitoring
of Parallel Programs . . . . . . . . . . 333--345
Ian Sommerville and
Richard Bentley and
Tom Rodden and
Peter Sawyer Cooperative Systems Design . . . . . . . 357--366
P. A. Firby and
D. J. Stone Analysis of the structure and resolution
of a graphics device . . . . . . . . . . 367--376
Christophe Poix and
Robert Laurini A geometric reasoning tool based on a
successive improvement approach . . . . 377--384
A. N. Clark Pattern recognition of noisy sequences
of behavioural events using functional
combinators . . . . . . . . . . . . . . 385--398
Per Brinch Hansen Interference control in SuperPascal ---
a block-structured parallel language . . 399--406
M. Diaz and
E. Pimentel and
J. M. Troya DROL: a distributed and real-time
object-oriented logic environment . . . 407--421
Marie Rose Low and
Bruce Christianson Self Authenticating Proxies . . . . . . 422--428
J. P. Giddy and
R. Safavi Naini Automated Cryptanalysis of Transposition
Ciphers . . . . . . . . . . . . . . . . 429--436
Greg O'Shea On the specification, validation and
verification of security in access
control systems . . . . . . . . . . . . 437--448
Nancy G. Kinnersley and
William M. Kinnersley An efficient polynomial-time algorithm
for three-track gate matrix layout . . . 449--462
A. A. K. Majumdar A note on the iterative algorithm for
the Reve's puzzle . . . . . . . . . . . 463--466
Vinny Cahill and
Roland Balter and
David Harper and
Neville Harris and
Xavier Rousset De Pina and
Pedro Sousa The Comandos Distributed Application
Platform . . . . . . . . . . . . . . . . 477--486
Paul Taylor and
Vinny Cahill and
Michael Mock Combining object-oriented systems and
open transaction processing . . . . . . 487--498
Brendan Tangney and
Andrew Condon and
Vinny Cahill and
Neville Harris Requirements for parallel programming in
object-oriented distributed systems . . 499--508
Gerrit Kerber and
Helmut Meitner and
Friedemann Reim The Comandos toolset for distributed
systems management . . . . . . . . . . . 509--518
Roland Balter and
Serge Lacourte and
Michel Riveill The Guide Language . . . . . . . . . . . 519--530
Pedro Sousa and
Andre Zuquete and
Nuno Neves and
Jose Alves Marques Orthogonal persistence in a
heterogeneous distributed
object-oriented environment . . . . . . 531--541
J. A. Bakker A semantic approach to enforce
correctness of data distribution schemes 561--575
Mostafa A. Bassiouni and
Amar Mukherjee and
Mark J. Llewellyn Design and implementation of extended
Boolean and comparison operators for
time-oriented query languages . . . . . 576--587
Brian Knight and
Jixin Ma A temporal database model supporting
relative and absolute time . . . . . . . 588--597
B. J. Oommen and
D. T. H. Ng A new technique for enhancing
linked-list data retrieval: reorganize
data using artificially synthesized
queries . . . . . . . . . . . . . . . . 598--609
Lanfranco Lopriore Stack Cache Memory for Block-Structured
Programs . . . . . . . . . . . . . . . . 610--620
Noureddine Belkhatir and
Walcelio L. Melo Supporting software development
processes in Adele 2 . . . . . . . . . . 621--628
I. McFarlane and
S. G. Hoggar Optimal Drivers for the `Random'
Iteration Algorithm . . . . . . . . . . 629--640
Joseph L. Ganley and
Lenwood S. Heath Optimal and Random Partitions of Random
Graphs . . . . . . . . . . . . . . . . . 641--643
Steve Benford and
John Bowers and
Lennart E. Fahlen and
John Mariani and
Tom Rodden Supporting Cooperative Work in Virtual
Environments . . . . . . . . . . . . . . 653--668
Danny C. C. Poo and
Shwu-Yi Lee An object-oriented systems modelling
method based on the Jackson approach . . 669--682
Helen E. Thomson and
Pam Mayhew The Software Process: A Perspective on
Improvement . . . . . . . . . . . . . . 683--690
K. Tindell and
A. Burns Fixed priority scheduling of hard
real-time multi-media disk traffic . . . 691--697
Chung-Ming Huang and
Jenq-Muh Hsu An Incremental Protocol Verification
Method . . . . . . . . . . . . . . . . . 698--710
W. Ken Jackson and
F. Warren Burton A definite and unfoldable, partially
deterministic language . . . . . . . . . 711--714
Jiang-Hsing Chu and
Gary D. Knott An Analysis of Spiral Hashing . . . . . 715--719
R. A. Sharman Speech recognition in the office: how
the technology supports dictation . . . 735--744
Graham A. Stephen and
Paul Mather What is SP? (theory of computing) . . . 745--752
Sunil Vadera and
Farid Meziane From English to Formal Specifications 753--763
Kamyar Jambor-Sadeghi and
Mohammad A. Ketabchi and
Junjie Chue and
M. Ghiassi A Systematic Approach to Corrective
Maintenance . . . . . . . . . . . . . . 764--778
Ying Hao and
Jyh-Charn S. Liu and
Junguk L. Kim An All-sharing Load-balancing Scheme on
the COMA/CD Network and its Analysis . . 779--794
M. P. Ward Reverse engineering through formal
transformation: Knuth's ``Polynomial
Addition'' algorithm . . . . . . . . . . 795--813
J. W. Patterson and
P. J. Willis Computer Assisted Animation: $2$D or not
$2$D? . . . . . . . . . . . . . . . . . 829--839
C.-H. Lai Diakoptics, domain decomposition and
parallel computing . . . . . . . . . . . 840--846
J. Ma and
B. Knight and
M. Petridis A revised theory of action and time
based on intervals and points . . . . . 847--857
D. K. C. Chan and
P. W. Trinder and
R. C. Welland Evaluating Object-Oriented Query
Languages . . . . . . . . . . . . . . . 858--872
Sridhar Seshadri and
Doron Rotem and
Arie Segev Optimal arrangements of cartridges in
carousel type mass storage systems . . . 873--887
G. Berrisford and
M. Burrows Reconciling OO with Turing machines . . 888--906
Ferruccio Barsi and
M. Cristina Pinotti Time optimal mixed radix conversion for
residue number applications . . . . . . 907--916
Ron Morrison and
Richard C. H. Connor and
Quintin I. Cutts and
Vivienne S. Dunstan and
Graham N. C. Kirby Exploiting persistent linkage in
software engineering environments . . . 1--16
R. J. Wieringa Combining static and dynamic modelling
methods: a comparison of four methods 17--30
D. R. Sutton and
P. J. H. King Incomplete Information and the
Functional Data Model . . . . . . . . . 31--42
Charles L. A. Clarke and
G. V. Cormack and
F. J. Burkowski An algebra for structured text search
and a framework for its implementation 43--56
John G. Vaughan A Hierarchical Protocol for
Decentralising Information Dissemination
in Distributed Systems . . . . . . . . . 57--70
R. F. Browne The embedding of meshes and trees into
degree four chordal ring networks . . . 71--77
T. F. Melham Special Issue Editorial: Higher Order
Logic Theorem Proving and its
Applications . . . . . . . . . . . . . . 89
Paul Curzon Tracking design changes with formal
machine-checked proof . . . . . . . . . 91--100
Mats Larsson An engineering approach to formal
digital system design . . . . . . . . . 101--110
Sofi\`ene Tahar and
Ramayya Kumar Formal specification and verification
techniques for RISC pipeline conflicts 111--120
Sten Agerholm LCF Examples in HOL . . . . . . . . . . 121--130
Peter V. Homeier and
David F. Martin A mechanically verified verification
condition generator . . . . . . . . . . 131--141
Elsa Gunter and
Savi Maharaj Studying the ML Module System in HOL . . 142--151
Ching-Tsun Chou Mechanical verification of distributed
algorithms in higher-order logic . . . . 152--161
John Harrison Binary Decision Diagrams as a HOL
Derived Rule . . . . . . . . . . . . . . 162--170
J. von Wright Representing Higher-Order Logic Proofs
in HOL . . . . . . . . . . . . . . . . . 171--179
Mark Evered and
Axel Schmolitzky and
Michael Kölling A flexible object invocation language
based on object-oriented language
definition . . . . . . . . . . . . . . . 181--191
Linda B. Sherrell and
Doris L. Carver FunZ: An Intermediate Specification
Language . . . . . . . . . . . . . . . . 193--206
M. J. Kumar and
S. Venkatesh and
D. Kieronska and
L. M. Patnaik Hierarchical directory-based shared
memory architecture . . . . . . . . . . 207--216
Hong Shen Efficient Parallel $k$-Set Chain
Range-Join in Hypercubes . . . . . . . . 217--225
V. Kapelios and
G. Panagopoulou and
G. Papamichail and
S. Sirmakessis and
A. Tsakalidis The `Cross' Rectangle Intersection
Problem . . . . . . . . . . . . . . . . 227--235
Imtiaz Ahmad and
Muhammad K. Dhodhi On the $m$-Way Graph Partitioning
Problem . . . . . . . . . . . . . . . . 237--244
Ing Ray Chen A Degradable B$^{\rm link}$-Tree with
Periodic Data Reorganization . . . . . . 245--256
Saurav Chatterjee and
Jay Strosnider Distributed pipeline scheduling: a
framework for distributed, heterogeneous
real-time system design . . . . . . . . 271--285
Scott Dawson and
Farham Jahanian Probing and fault injection of
dependable distributed protocols . . . . 286--300
Wolfgang A. Halang and
Bernd Krämer and
Leszek Trybus Exploiting a graphical programming
paradigm to facilitate rigorous
verification of embedded software . . . 301--309
Benjamin Macias and
Stephen G. Pulman A method for controlling the production
of specifications in natural language 310--318
Alexander D. Stoyenko and
Thomas J. Marlowe and
Mohamed F. Younis A Language for Complex Real-Time Systems 319--338
Andrew Turpin and
Alistair Moffat Practical Length-limited Coding for
Large Alphabets . . . . . . . . . . . . 339--347
Ing-Ray Chen and
I.-Ling Yen Analysis of probabilistic error checking
procedures on storage systems . . . . . 348--354
Hu Jun Wang and
Yuan-Da Jiang and
Hui-Zhong Wu Performance analysis of cluster-based
PPMB multiprocessor systems . . . . . . 355--364
A. Shafarenko Symmetries in Data Parallelism . . . . . 365--380
S. M. Eker Associative-Commutative Matching Via
Bipartite Graph Matching . . . . . . . . 381--399
M. Campbell-Kelly ICL and the Evolution of the British
Mainframe . . . . . . . . . . . . . . . 400--412
Stella Mills To live or drown: when information
systems become critical . . . . . . . . 413--417
Harold Thimbleby A New Calculator and Why it is Necessary 418--433
Ing-Ray Chen On applying imprecise computation to
real-time AI systems . . . . . . . . . . 434--442
Gavin Lowe Scheduling-Oriented Models for Real-Time
Systems . . . . . . . . . . . . . . . . 443--456
Ruey-Liang Ma and
Chung-Ping Chung Periodic adaptive branch prediction and
its application in superscalar
processing in Prolog . . . . . . . . . . 457--470
C. H. C. Leung and
E. Currie The effect of failures on the
performance of long-duration database
transactions . . . . . . . . . . . . . . 471--477
Panayiotis Bozanis and
Christos Makris and
Athanasios Tsakalidis Parametric weighted filter: an efficient
dynamic manipulation of signature files 478--488
Stephen Gilmore and
Jane Hillston Process Algebras and their Application
to Performance Modelling . . . . . . . . 489--491
Marco Bernardo and
Nadia Busi and
Roberto Gorrieri A distributed semantics for EMPA based
on stochastic contextual nets . . . . . 492--509
Peter Harrison and
Jane Hillston Exploiting quasi-reversible structures
in Markovian process algebra models . . 510--520
Boudewijn R. Haverkort In search of probability mass:
probabilistic evaluation of high-level
specified Markov models . . . . . . . . 521--529
Holger Hermanns and
Michael Rettelbach and
Thorsten Weiss Formal characterisation of immediate
actions in SPA with nondeterministic
branching . . . . . . . . . . . . . . . 530--541
D. R. W. Holton A PEPA specification of an industrial
production cell . . . . . . . . . . . . 542--551
Ed Brinksma and
Joost-Pieter Katoen and
Rom Langerak and
Diego Latella A Stochastic Causality-Based Process
Algebra . . . . . . . . . . . . . . . . 552--565
Jane Hillston and
Vassilis Mertsiotakis A simple time scale decomposition
technique for stochastic process
algebras . . . . . . . . . . . . . . . . 566--577
Corrado Priami Stochastic $\pi$-calculus . . . . . . . 578--589
Michael Rettelbach Probabilistic branching in Markovian
process algebras . . . . . . . . . . . . 590--599
Marina Ribaudo On the aggregation techniques in
stochastic Petri nets and stochastic
process algebras . . . . . . . . . . . . 600--611
Isabel Rojas Compositional Construction of SWN models 612--621
Matteo Sereno Towards a product form solution for
stochastic process algebras . . . . . . 622--632
Michael Reiter and
Li Gong Securing Causal Relationships in
Distributed Systems . . . . . . . . . . 633--642
Jian-Yun Nie and
Martin Brisebois and
Françoise Lepage Information Retrieval as Counterfactual 643--657
Kang Zhang and
Gaurav Marwaha Visputer --- a graphical visualization
tool for parallel programming . . . . . 658--669
Peter Kirstein and
Goli Montasser-Kohsari The C-ODA Project: Experiences and Tools 670--680
Antonios Symvonis Optimal Stable Merging . . . . . . . . . 681--690
C. H. A. Koster and
Th. P. Van Der Weide Hairy Search Trees . . . . . . . . . . . 691--694
Simon W. Moore and
Brian T. Graham Tagged Up/Down Sorter --- A Hardware
Priority Queue . . . . . . . . . . . . . 695--703
Kam-Yiu Lam and
Sheung-Lun Hung Concurrency Control for Time-constrained
Transactions in Distributed Databases
Systems . . . . . . . . . . . . . . . . 704--716
Ing-Ray Chen Stochastic Petri net analysis of
deadlock detection algorithms in
transaction database systems with
dynamic locking . . . . . . . . . . . . 717--733
Weidong He and
Chaochen Zhou A Case Study of Optimization . . . . . . 734--746
R. N. Ibbett and
P. E. Heywood and
F. W. Howell HASE: A Flexible Toolset for Computer
Architects . . . . . . . . . . . . . . . 755--764
Stephen P. Wilson and
John A. McDermid Integrated analysis of complex safety
critical systems . . . . . . . . . . . . 765--776
Antonio Ruiz-Delgado and
David Pitt and
Colin Smythe A review of object-oriented approaches
in formal methods . . . . . . . . . . . 777--784
Gavin Lowe and
Hussein Zedan Refinement of Complex Systems: A Case
Study . . . . . . . . . . . . . . . . . 785--800
Ville Leppänen Performance of work-optimal PRAM
simulation algorithms on coated meshes 801--810
Ken Deighton Average time to travel on two-headed,
non-linear discs . . . . . . . . . . . . 811--817
Jingsen Chen An efficient construction algorithm for
a class of implicit double-ended
priority queues . . . . . . . . . . . . 818--821
Frank P. Verdon and
Mike Wells Computing in British universities: the
Computer Board 1966--1991 . . . . . . . 822--830
David Jeff Jackson and
Wagdy Mahmoud Parallel pipelined fractal image
compression using quadtree recomposition 1--13
Qian-Ping Gu and
Shietung Peng An efficient algorithm for node-to-node
routing in hypercubes with faulty
clusters . . . . . . . . . . . . . . . . 14--19
Vincenzo Loia and
Michel Quaggetto The OPLA system: designing complex
systems in an object-oriented logic
programming framework . . . . . . . . . 20--35
Chandran Sekharan and
John G. Del Greco and
Sailesh Rathi Space-time trade-offs in the relative
unranking of binary trees . . . . . . . 36--44
T. S. Narayanan A Class of Semi-$X$ Tree-Based
Dictionary Machines . . . . . . . . . . 45--51
Egon. Börger and
Igor \Dbarur\dbaranovic Correctness of compiling Occam to
Transputer code . . . . . . . . . . . . 52--92
Linda C. van der Gaag Bayesian Belief Networks: Odds and Ends 97--113
Mark Levene Maintaining Consistency of Imprecise
Relations . . . . . . . . . . . . . . . 114--123
Hossein Saiedian and
Thomas Spencer An efficient algorithm to compute the
candidate keys of a relational database
schema . . . . . . . . . . . . . . . . . 124--132
Evangelos Kranakis and
Danny Krizanc and
S. S. Ravi On Multi-Label Linear Interval Routing
Schemes . . . . . . . . . . . . . . . . 133--139
Yi Pan and
Mounir Hamdi and
Gurdip Singh Selection on $k$-dimensional meshes with
multiple broadcasting . . . . . . . . . 140--144
Stephen Fitzpatrick and
M. Clint and
T. J. Harmer and
P. Kilpatrick The tailoring of abstract functional
specifications of numerical algorithms
for sparse data structures through
automated program derivation and
transformation . . . . . . . . . . . . . 145--168
Carlo Meghini Logical Image Modelling and Retrieval 173--183
Si Pan and
R. Geoff Dromey Re-engineering Loops . . . . . . . . . . 184--202
Si Pan and
R. Geoff Dromey A Formal Basis For Removing goto
Statements . . . . . . . . . . . . . . . 203--214
A. H. M. Ter Hofstede and
E. Lippe and
P. J. M. Frederiks Conceptual data modelling from a
categorical perspective . . . . . . . . 215--231
M. Ould-Khaoua and
L. M. Mackenzie and
R. Sotudeh Comparative evaluation of hypermesh and
multi-stage interconnection networks . . 232--240
Behrooz Parhami Extreme-value search and general
selection algorithms for fully parallel
associative memories . . . . . . . . . . 241--250
A. H. M. Ter Hofstede and
H. A. Proper and
Th. P. van der Weide Query formulation as an information
retrieval problem . . . . . . . . . . . 255--274
Anthony N. Godwin Building a semantic description for a
data modelling language . . . . . . . . 275--290
Jim Grundy Transformational Hierarchical Reasoning 291--302
Howard Barringer and
Graham Gough and
Brian Monahan and
Alan Williams A process algebra foundation for
reasoning about Core ELLA . . . . . . . 303--324
R. M. Hierons Extending Test Sequence Overlap by
Invertibility . . . . . . . . . . . . . 325--330
Haifeng Qian and
Jie Wu Enhanced Fibonacci Cubes . . . . . . . . 331--345
Hu-Jun Wang and
Jian Li Bandwidth Analysis for A Class of
Bus-Based Systems . . . . . . . . . . . 346--352
T. D. Gedeon The Cyclic Towers of Hanoi: an iterative
solution produced by transformation . . 353--356
A. J. Wellings and
A. Burns Programming Replicated Systems in Ada 95 361--373
Yasemin Turkan and
Özgür Ulusoy An efficient memory management algorithm
for client-server database management
systems . . . . . . . . . . . . . . . . 374--385
J. P. Geschiere and
W. H. F. J. Körver A practical development process for
parallel large-scale applications and
its underlying formal framework . . . . 386--407
Maarten Fokkinga Expressions That Talk About Themselves 408--412
Tadao Takaoka A left-to-right preprocessing
computation for the Boyer--Moore string
matching algorithm . . . . . . . . . . . 413--416
Wen-Jing Hsu and
Moon Jung Chung and
Zejun Hu Gaussian Networks For Scalable
Distributed Systems . . . . . . . . . . 417--426
Lucas Chi Kwong Hui and
Charles U. Martel Randomized competitive algorithms for
successful and unsuccessful search . . . 427--438
Nectarios Koziris and
George Papakonstantinou and
Panayotis Tsanakas Optimal time and efficient space free
scheduling for nested loops . . . . . . 439--448
John A. Mariani and
Tom Rodden Cooperative information sharing:
developing a shared object service . . . 455--470
D. B. Skillicorn Using distributed hypermedia for
collaborative learning in universities 471--482
Jonathan M. Nash and
Peter M. Dew and
Martin E. Dyer A scalable shared queue on a distributed
memory machine . . . . . . . . . . . . . 483--495
Oliver E. Theel and
Brett D. Fleisch The boundary-restricted coherence
protocol for scalable and highly
available distributed shared memory
systems . . . . . . . . . . . . . . . . 496--510
Chung-Ming Huang and
Ye-In Chang and
Duen-Tay Huang Reverse protocol verification: concept,
algorithm and application . . . . . . . 511--524
Yen-Min Huang and
Chinya V. Ravishankar URPC: a toolkit for prototyping remote
procedure calls . . . . . . . . . . . . 525--540
Panayiotis Bozanis and
Nectarios Kitsios and
Christos Makris and
Athanasios Tsakalidis Red-Blue Intersection Reporting for
Objects of Non-Constant Size . . . . . . 541--546
Bohdan S. Majewski and
Nicholas C. Wormald and
George Havas and
Zbigniew J. Czech A Family of Perfect Hashing Methods . . 547--554
Dr. John M. Taylor, OBE, F. Eng. Special Feature: Forward with Foresight 561--565
Cristina Cifuentes and
Anne Fitzgerald Australian recommendations on computer
software protection . . . . . . . . . . 566--576
Jukka Paakki and
Airi Salminen and
Jussi Koskinen Automated Hypertext Support for Software
Maintenance . . . . . . . . . . . . . . 577--597
M. P. Ward Program Analysis by Formal
Transformation . . . . . . . . . . . . . 598--618
Tsong Yueh Chen and
Yuen Tak Yu Constraints for Safe Partition Testing
Strategies . . . . . . . . . . . . . . . 619--625
Qian-Ping Gu and
Shietung Peng Optimal algorithms for node-to-node
fault tolerant routing in hypercubes . . 626--629
Jon Agar History of Computing Feature: The
provision of digital computers to
British universities up to the Flowers
Report (1966) . . . . . . . . . . . . . 630--642
Anonymous Book Reviews . . . . . . . . . . . . . . ??
A. Puliafito and
S. Riccobene and
M. Scarpa Evaluation of Performability Parameters
in Client-Server Environments . . . . . 647
Goran Lj. Djordjevic and
Milorad B. Tosic A Compile-Time Scheduling Heuristic for
Multiprocessor Architectures . . . . . . 663
Joan M. Morrissey and
W. T. Bealor Minimizing Data Transfers in Distributed
Query Processing: A Comparative Study
and Evaluation . . . . . . . . . . . . . 675
Xindong Wu A Bayesian Discretizer for Real-Valued
Attributes . . . . . . . . . . . . . . . 688
Behrooz Parhami Parallel Threshold Voting . . . . . . . 692
Emil Sekerinski and
Kaisa Sere A Theory of Prioritizing Composition . . 701
Shietung Peng and
Stanislav Sedukhin Array Processors Design for
Division-free Linear System Solving . . 713
Anonymous Book reviews . . . . . . . . . . . . . . 723--730
P. M. Fenwick The Burrows--Wheeler Transform for block
sorting text compression: principles and
improvements . . . . . . . . . . . . . . 731
K. L. Verco and
M. J. Wise Plagiarism \`a la mode: a Comparison of
Automated Systems for Detecting
Suspected Plagiarism . . . . . . . . . . 741
M. Visvalingam and
D. Varley and
C. Wright A Cognitive Approach to Road Recognition
with Novel Feature Indicators . . . . . 751
I.-R. Chen and
C.-M. Wang Threshold-based Admission Control
Policies for Multimedia Servers . . . . 757
I.-R. Chen and
D.-C Wang Analysis of Replicated Data with Repair
Dependency . . . . . . . . . . . . . . . 767
J. Tubella and
A. Gonzalez and
Eduard Elias The Multipath Architecture for Prolog
Programs . . . . . . . . . . . . . . . . 780
P. van Bommel and
P. J. M. Frederiks and
P. van der Weide Object-Oriented Modelling based on
Logbooks . . . . . . . . . . . . . . . . 793--799
Jixin Ma and
Brian Knight A Reified Temporal Logic . . . . . . . . 800
G. M. Seed and
D. E. R. Clark and
J. R. Corney and
R. Tuttle and
G. Little Object-Oriented Graph-Based Geometric
Feature Recognition . . . . . . . . . . 808--811
R. Ingram and
S. Benford The Application of Legibility Techniques
to Enhance Information Visualizations 819
C. Du An Interpolation Method for Grid-based
Terrain Modelling . . . . . . . . . . . 837
N. Zhang and
Q. Shi Achieving Non-repudiation of Receipt . . 844
A. B. McDonald and
T. Znati ARP versus ES-IS: Performance Evaluation
of Neighbour-Greeting Protocols . . . . 854
J. J. Sarbo Building Sub-knowledge Bases Using
Concept Lattices . . . . . . . . . . . . 868
M. Diaz and
B. Rubio and
J. M. Troya Distributed Programming with a Logic
Channel Based Coordination Model . . . . 876
P. Cochrane From Copper to Glass: the Right Idea,
Decisions and Investments at the Right
Time\ldots . . . . . . . . . . . . . . . 1
P. Bozanis and
N. Kitsios and
C. Makris and
A. Tsakalidis New Results on Intersection Query
Problems . . . . . . . . . . . . . . . . 22
W.-J. Tsai and
S.-Y. Lee Multi-Partition RAID: A New Method for
Improving Performance of Disk Arrays
under Failure . . . . . . . . . . . . . 30
E. Chan and
C. Daoxu and
J. Cao and
C.-H Lee Timing Properties of the FDDI-M Medium
Access Protocol . . . . . . . . . . . . 43
X. Wu Hybrid Interpretation of `No Match' and
`Multiple Match' in Induction . . . . . 50
A. Moffat Editorial for Special Issue on Lossless
Compression . . . . . . . . . . . . . . 65--66
J. G. Cleary and
W. J. Teahan Unbounded Length Contexts for PPM . . . 67
S. Bunton Semantically Motivated Improvements for
PPM Variants . . . . . . . . . . . . . . 76
H. Yokoo Data Compression using a Sort-Based
Similarity Measure . . . . . . . . . . . 94--102
C. G. Nevill-Manning and
I. H. Witten Compression and Explanation Using
Hierarchical Grammars . . . . . . . . . 103
S. T. Klein Efficient Optimal Recompression . . . . 117
N. Memon and
X. Wu Recent Developments in Context-Based
Predictive Techniques for Lossless Image
Compression . . . . . . . . . . . . . . 127
J. A. Storer and
H. Helfgott Lossless Image Compression by Block
Matching . . . . . . . . . . . . . . . . 137
P. G. Howard Text Image Compression using Soft
Pattern Matching . . . . . . . . . . . . 146
B. J. Frey and
G. E. Hinton Efficient Stochastic Source Coding and
an Application to a Bayesian Network
Source Model . . . . . . . . . . . . . . 157
Andrew M. Dearden and
Michael D. Harrison A Software Engineering Model for Case
Memory Systems . . . . . . . . . . . . . 167
Alex Delis and
Quang LeViet Contemporary Access Structures Under
Mixed Workloads . . . . . . . . . . . . 183--193
Fun Ting Chan and
Tsong Yueh Chen and
Ieng Kei Mark and
Shir Ming Shen On Some Properties of the Optimally
Refined Proportional Sampling Strategy 194
Pranay Chaudhuri An optimal distributed algorithm for
computing bridge- connected components 200
Fredrick H. Dahlgren and
Per Stenström and
Marten Björkman Reducing the Read-miss Penalty for Flat
COMA Protocols . . . . . . . . . . . . . 208
Robert M. Hierons Testing from a Finite-State Machine:
Extending Invertibility to Sequences . . 220
R. M. Colomb Impact of Semantic Heterogeneity on
Federating Databases . . . . . . . . . . 235
F. de Ferreira Rezende and
T. Härder and
J. Zielinski Transaction Identifiers in Nested
Transactions: Implementation Schemes and
Performance . . . . . . . . . . . . . . 245--258
T. Bolognesi Expressive Flexibility of a
Constraint-oriented Notation . . . . . . 259
L. Xiang and
C. Tang and
K. Ushijima Grammar-Oriented Enumeration of Binary
Trees . . . . . . . . . . . . . . . . . 278
Z. Arnavut and
S. Magliveras Lexical Permutation Sorting Algorithm 292
Mohan Kumar and
L. M. Patnaik Special Issue Editorial: Automatic Loop
Parallelization . . . . . . . . . . . . 301--301
Hyuk-Jae Lee and
José A. B. Fortes Communication-Minimal Partitioning and
Data Alignment for Affine Nested Loops 302--310
Steven Novack and
Alexandru Nicolau Resource-Directed Loop Pipelining:
Exposing Just Enough Parallelism . . . . 311--321
Jialin Ju and
Vipin Chaudhary Unique sets oriented parallelization of
loops with non-uniform dependences . . . 322
Sharad K. Singhai and
Kathryn S. McKinley A Parametrized Loop Fusion Algorithm for
Improving Parallelism and Cache Locality 340
Michal Cierniak and
Mohammed Javeed Zaki and
Wei Li Compile-Time Scheduling Algorithms for a
Heterogeneous Network of Workstations 356
Dattatraya Kulkarni and
Micheal Stumm Linear and Extended Linear
Transformations for Shared-Memory
Multiprocessors . . . . . . . . . . . . 373
Balaram Sinharoy Optimized Thread Creation for Processor
Multithreading . . . . . . . . . . . . . 388
Hong Va Leong and
Antonio Si Database Caching Over the Air-Storage 401
Evan P. Harris and
Kotagiri Ramamohanarao Optimal Clustering of Relations to
Improve Sorting and Partitioning for
Joins . . . . . . . . . . . . . . . . . 416
Yi Pan and
Jerry L. Trathan and
Ramachandran Vaidyanathan A Scalable and Efficient Algorithm for
Computing the City Block Distance
Transform on Reconfigurable Meshes . . . 435
Kshirasagar Naik Designing Reliable Test Architectures
for Communication Protocols . . . . . . 441
Marlin H. Mickle An Electrical Circuit and Computer
System Analogy . . . . . . . . . . . . . 457
Paddy Nixon and
Vinny Cahill and
Fethi Rabhi Building Parallel and Distributed
Systems . . . . . . . . . . . . . . . . 463--464
K. Mandy Chandy and
Adam Rikfin Systematic Composition of Distributed
Objects: Processes and Sessions . . . . 465
Andry Rakotonirainy and
Andrew Berry and
Stephen Crawley and
Zoran Milosevic Describing Open Distributed Systems:A
Foundation . . . . . . . . . . . . . . . 479
Richard B. Kilgore and
Craig M. Chase Testing Distributed Programs Containing
Racing Messages . . . . . . . . . . . . 489
T. Kunz and
J. P. Black and
D. J. Taylor and
T. Basten Poet: Target-System Independent
Visualizations of Complex
Distributed-Application Executions . . . 499
Vinny Cahill and
Paddy Nixon and
Brendan Tangney and
Fethi Rabhi Object Models for Distributed or
Persistent Programming . . . . . . . . . 513
David Tresman Caminer, OBE LEO and its applications: the beginning
of business computing . . . . . . . . . 585
Dag I. K. Sjöberg and
Ray Welland and
Malcolm P. Atkinson Software constraints for large
application systems . . . . . . . . . . 598
Derrick Morris and
D. Gareth Evans and
Simon Schofield Simulating the behaviour of computer
systems: co-simulation of
hardware/software . . . . . . . . . . . 617
Sanjay Kumar Madria A study of the concurrency control and
recovery algorithms in nested
transaction environment . . . . . . . . 630
Olaf Müller and
Konrad Slind Treating partiality in a logic of total
functions . . . . . . . . . . . . . . . 640
Anonymous Author index for 1997 . . . . . . . . . ??
Anonymous Subject index for 1997 . . . . . . . . . ??
Ana Cavalcanti and
Jim Woodcock A Weakest Precondition Semantics for $Z$ 1--15
Michele Flammini and
Jan van Leeuwen and
Alberto Marchetti-Spaccamela The Complexity of Interval Routing on
Random Graphs . . . . . . . . . . . . . 16--25
Soo-Mook Moon and
Kemal Ebcio\uglu The Performance Impact of Exploiting
Branch ILP with Tree Representation of
ILP Code . . . . . . . . . . . . . . . . 26--44
Giuseppe Alia and
Enrico Martinelli Logic Design of a Fast Circuit for
Iterative Additions in Redundant Hybrid
Number Systems . . . . . . . . . . . . . 45--51
Ding-Ming Kwai and
Behrooz Parhami Tight Bounds on the Diameter of Gaussian
Cubes . . . . . . . . . . . . . . . . . 52--56
C. Ierotheou and
C. H. Lai and
C. J. Palansuriya and
K. A. Pericleous Simulation of $2$-D metal cutting by
means of a distributed algorithm . . . . 57--63
Martyn Thomas Myths of the Year 2000 . . . . . . . . . 67--70
Christopher B. Jones and
J. Mark Ware Proximity Search with a Triangulated
Spatial Model . . . . . . . . . . . . . 71--83
P. Bodorik and
D. Jutla Multi-View Memory Support to Operating
Systems in Locking for Transaction and
Database Systems . . . . . . . . . . . . 84--97
B. F. Jones and
D. E. Eyres and
H. H. Sthamer A Strategy for using Genetic Algorithms
to Automate Branch and Fault-based
Testing . . . . . . . . . . . . . . . . 98--107
Akhil Kumar and
Noha Adly HPP: A Reliable Causal Broadcast
Protocol for Large-Scale Replication in
Wide Area Networks . . . . . . . . . . . 108--124
Woei-Jiunn Tsaur and
Shi-Jinn Horng Establishing Secure Ethernet LANs Using
Intelligent Switching Hubs in Internet
Environments . . . . . . . . . . . . . . 125--133
Roberto De Prisco and
Alfredo de Santis On the Data Expansion of the Huffman
Compression Algorithm . . . . . . . . . 137--144
Antonino Mazzeo and
Nicola Mazzocca and
Stefano Russo and
Carlo Savy and
Valeria Vittorini Formal Specification of Concurrent
Systems: A Structured Approach . . . . . 145--162
Anton Biasizzo and
Alenka Zuzek and
Franc Novak Sequential Diagnosis with Asymmetrical
Tests . . . . . . . . . . . . . . . . . 163--170
L. Q. Bai and
H. Ebara and
H. Nakano and
H. Maeda Fault-Tolerant Broadcasting on the
Arrangement Graph . . . . . . . . . . . 171--184
Jamel Tayeb and
Özgür Ulusoy and
Ouri Wolfson A Quadtree-Based Dynamic Attribute
Indexing Method . . . . . . . . . . . . 185--200
Alois Panholzer and
Helmut Prodinger Towards a More Precise Analysis of an
Algorithm to Generate Binary Trees: A
Tutorial . . . . . . . . . . . . . . . . 201--204
Jie Wu and
Eduardo B. Fernandex and
Donglai Dai Optimal Fault-Secure Scheduling . . . . 207
Keqin Li Optimizing Average Job Response Time via
Decentralized Probabilistic Job
Dispatching in Heterogeneous Multiple
Computer Systems . . . . . . . . . . . . 223
I-Chen Wu and
Loon-Been Chen On Detection of Bounded Global
Predicates . . . . . . . . . . . . . . . 231
Savio S. H. Tse and
Francis C. M. Lau More on the Efficiency of Interval
Routing . . . . . . . . . . . . . . . . 238
Ing-Ray Chen and
Tsong-Min Chen and
Chiang Lee Performance Evaluation of Forwarding
Strategies for Location Management in
Mobile Networks . . . . . . . . . . . . 243
Shun-Shii Lin and
Shan-Tai Chen On Detecting Multiple Faults in Baseline
Interconnection Networks . . . . . . . . 254--269
Khaled A. A. Abdel-Ghaffar Detecting Substitutions and
Transpositions of Characters . . . . . . 270--277
W. Paul Cockshott and
Douglas McGregor and
John Wilson High performance operations using a
compressed database architecture . . . . 283--296
Maarten van Steen and
Franz J. Hauck and
Gerco Ballintijn and
Andrew S. Tanenbaum Algorithmic design of the globe
wide-area location service . . . . . . . 297--310
Th. P. van der Weide and
T. W. C. Huibers and
P. van Bommel The incremental searcher satisfaction
model for information retrieval . . . . 311--318
Stuart Hoggar and
Lindsey Menzies Fractal compression and the jigsaw
property I . . . . . . . . . . . . . . . 319--336
Roberto Baldoni and
Roberto Beraldi and
Ravi Prakash Slotted-FIFO communication for
asynchronous distributed systems . . . . 337--348
R. M. Hierons Adaptive testing of a deterministic
implementation against a
nondeterministic finite state machine 349--355
Michael Prasse and
Peter Rittgen Why Church's Thesis still holds. Some
notes on Peter Wegner's tracts on
interaction and computability . . . . . 357--362
Hugh Robinson and
Pat Hall and
Fiona Hovenden and
Janet Rachel Postmodern software development . . . . 363--375
Sanjay Kumar Madria Handling of mutual conflicts in
distributed databases using timestamps 376--385
Declan P. Kelly ARC: A specification language for
communicating systems . . . . . . . . . 386--401
K. W. Chu and
S. K. Lam and
M. H. Wong An efficient hash-based algorithm for
sequence data searching . . . . . . . . 402--415
Zbigniew J. Czech Quasi-perfect hashing . . . . . . . . . 416--421
R. Benjamin and
B. Gladman and
B. Randell Protecting IT Systems from CyberCrime 429--443
Harold Thimbleby and
Stuart Anderson and
Paul Cairns A Framework for Modelling Trojans and
Computer Virus Infection . . . . . . . . 445--458
Luc Moreau and
Wendy Hall On the Expressiveness of Links in
Hypertext Systems . . . . . . . . . . . 459--473
Pasi Franti and
Timo Hatakka Context Model Automata for Text
Compression . . . . . . . . . . . . . . 474--485
S. E. Mitchell and
A. J. Wellings and
A. Romanovsky Distributed Atomic Actions in Ada 95 . . 486--502
Andrea Sanna and
Paolo Montuschi and
Massimo Rossi A Flexible Algorithm for Multiprocessor
Ray Tracing . . . . . . . . . . . . . . 503--516
F. Murtagh Foreword to special issue on clustering
and classification . . . . . . . . . . . 517--517
Boris Mirkin Least-Squares Structuring, Clustering
and Data Processing Issues . . . . . . . 518--536
Y. H. Li and
A. K. Jain Classification of Text Documents . . . . 537--546
Valerie J. Gillet and
David J. Wild and
Peter Willett and
John Bradshaw Similarity and Dissimilarity Methods for
Processing Chemical Structure Databases 548--558
Ryuichi Oka Spotting Method for Classification of
Real World Data . . . . . . . . . . . . 559--565
Lawrence Hubert and
Phipps Arabie and
Jacqueline Meulman The Representation of Symmetric
Proximity Data: Dimensions and
Classifications . . . . . . . . . . . . 566--577
Chris Fraley and
Adrian E. Raftery How Many Clusters? Which Clustering
Method? Answers Via Model-Based Cluster
Analysis . . . . . . . . . . . . . . . . 578--588
Dian I. Witter and
Michael W. Berry Downdating the Latent Semantic Indexing
Model for Conceptual Information
Retrieval . . . . . . . . . . . . . . . 589--601
C. S. Wallace Intrinsic Classification of Spatially
Correlated Data . . . . . . . . . . . . 602--611
L. Allison and
D. Powell and
T. I. Dix Compression and approximate matching . . 1--10
S. Kocberber and
F. Can and
J. M. Patton Optimization of signature file
parameters for databases with varying
record lengths . . . . . . . . . . . . . 11--23
M. Choy Consistent implementations of replicated
objects . . . . . . . . . . . . . . . . 24--38
G. S. Chinchwadkar and
A. Goh An overview of vertical partitioning in
object oriented databases . . . . . . . 39--50
Carlo Blundo and
P. D'Arco and
A. G. Gaggia A $\tau$-restricted key agreement scheme 51--61
S. Loucif and
M. Ould-Khaoua and
L. M. Mackenzie On the performance merits of bypass
channels in hypermeshes and $k$-ary
$n$-cubes . . . . . . . . . . . . . . . 62--72
Birgit Schieder and
Manfred Broy Adapting Calculational Logic to the
Undefined . . . . . . . . . . . . . . . 73--81
Richard F. Paige Integrating a Program Design Calculus
and a Subset of UML . . . . . . . . . . 82--99
Ykä Huhtala and
Juha Kärkkäinen and
Pasi Porkka and
Hannu Toivonen TANE: An Efficient Algorithm for
Discovering Functional and Approximate
Dependencies . . . . . . . . . . . . . . 100--111
Chung-Ming Huang and
Ming-Yuhe Jang Interactive Temporal Behaviours and
Modelling for Multimedia Presentations
in the WWW Environment . . . . . . . . . 112--128
Min-Sheng Lin and
Deng-Jyi Chen and
Maw-Sheng Horng The Reliability Analysis of Distributed
Computing Systems with Imperfect Nodes 129--141
W. F. Wong Source Level Static Branch Prediction 142--149
Jim Rook and
Ian J. Lloyd and
Kenneth J. Turner Book Reviews . . . . . . . . . . . . . . 150--152
Harry W. Agius and
Marios C. Angelides COSMOS-Content Oriented Semantic
Modelling Overlay Scheme . . . . . . . . 153--176
Richard Bornat and
Bernard Sufrin Animating Formal Proof at the Surface:
The Jape Proof Calculator . . . . . . . 177--192
Hugh E. Williams and
Justin Zobel Compressing Integers for Fast File
Access . . . . . . . . . . . . . . . . . 193--201
Weijia Jia and
Jiannong Cao and
To-Yat Cheung and
Xiaohua Jia A Multicast Protocol Based on a Single
Logical Ring Using a Virtual Token and
Logical Clocks . . . . . . . . . . . . . 202--220
Kecheng Liu and
Tina Ong A Modelling Approach for Handling
Business Rules and Exceptions . . . . . 221--231
Ahmad A. Hiasat and
Hoda Abdel-Aty-Zohdy Semi-Custom VLSI Design and
Implementation of a New Efficient RNS
Division Algorithm . . . . . . . . . . . 232--240
Neven Tomov and
Euan Dempster and
M. Howard Williams and
Peter J. B. King and
Albert Burger Approximate Estimation of Transaction
Response Time . . . . . . . . . . . . . 241--250
Alexander Gammerman and
Vladimir Vovk Special Issue Editorial: Kolmogorov
Complexity . . . . . . . . . . . . . . . 251--251
Alexander Gammerman and
Vladimir Vovk Kolmogorov Complexity: Sources, Theory
and Applications . . . . . . . . . . . . 252--255
Ray Solomonoff Two Kinds of Probabilistic Induction . . 256--259
J. Rissanen Hypothesis Selection and Testing by the
MDL Principle . . . . . . . . . . . . . 260--269
C. S. Wallace and
D. L. Dowe Minimum Message Length and Kolmogorov
Complexity . . . . . . . . . . . . . . . 270--283
Leonid. A. Levin Robust Measures of Information . . . . . 284--286
Tao Jiang and
Ming Li and
Paul Vitányi New Applications of the
Incompressibility Method . . . . . . . . 287--293
V. V. V'yugin Algorithmic Complexity and Stochastic
Properties of Finite Binary Sequences 294--317
Vladimir Vovk and
Alexander Gammerman Complexity Approximation Principle . . . 318--322
A. P. Dawid Discussion of the Papers by Rissanen and
by Wallace and Dowe . . . . . . . . . . 323--326
Jorma Rissanen Discussion of paper `Minimum Message
Length and Kolmogorov Complexity' by C.
S. Wallace and D. L. Dowe . . . . . . . 327--329
C. S. Wallace and
D. L. Dowe Refinements of MDL and MML Coding . . . 330--337
B. Clarke Discussion of the Papers by Rissanen,
and by Wallace and Dowe . . . . . . . . 338--339
Alexander Shen Discussion on Kolmogorov Complexity and
Statistical Analysis . . . . . . . . . . 340--342
Jorma Rissanen Rejoinder . . . . . . . . . . . . . . . 343--344
C. S. Wallace and
D. L. Dowe Rejoinder . . . . . . . . . . . . . . . 345--347
A. H. M. ter Hofstede and
M. E. Orlowska On the Complexity of Some Verification
Problems in Process Control
Specifications . . . . . . . . . . . . . 349--359
Norman Ramsey Eliminating Spurious Error Messages
Using Exceptions, Polymorphism, and
Higher-Order Functions . . . . . . . . . 360--372
Mayez Al-Mouhamed Evolution-Based Scheduling of
Computations and Communications on
Distributed-Memory Multicomputers . . . 373--390
R. W. P. Luk Near Optimal [beta] Heap . . . . . . . . 391--399
Tadao Takaoka $O(1)$ Time Algorithms for Combinatorial
Generation by Tree Traversal . . . . . . 400--408
Po-Jen Chuang and
Huey-Ming Hsu Effective Fault Diagnosis Approaches for
Multipath Networks . . . . . . . . . . . 409--421
Miroslav Bojovic and
Milo Tomasevic and
Jovan Djordjevic The Interactive Development and Testing
System for a RISC-Style Processor . . . 422--429
Tsong Yueh Chen and
Man Fai Lau On the Completeness of a Test Suite
Reduction Strategy . . . . . . . . . . . 430--440
Mohan Kumar Special Issue Editorial: Mobile
Computing . . . . . . . . . . . . . . . 441--441
Kevin W. Froese and
Richard B. Bunt Cache Management for Mobile File Service 442--454
Cedric C. F. Fong and
John C. S. Lui and
M. H. Wong Distributed Caching and Broadcast in a
Wireless Mobile Computing Environment 455--472
Sajal K. Das and
Sanjoy K. Sen Adaptive Location Prediction Strategies
Based on a Hierarchical Network Model in
a Cellular Mobile Environment . . . . . 473--486
Sihui Zhou and
Aruna Seneviratne and
Terry Percival An Efficient Location Management Scheme
for Hybrid Wireless Asynchronous
Transfer Mode Networks . . . . . . . . . 487--500
Ersan Kayan and
Özgür Ulusoy An Evaluation of Real-Time Transaction
Management Issues in Mobile Database
Systems . . . . . . . . . . . . . . . . 501--510
Guan-Chi Chen and
Suh-Yin Lee An Analytic Model for Performance
Analysis of Concurrency Control
Strategies in Mobile Environments . . . 511--521
Kuang-Hwei Chi and
Chien-Chao Tseng and
Ting-Lu Huang A Framework for Mobile Multicast Using
Dynamic Route Reconstructions . . . . . 522--533
Timothy Bickmore and
Andreas Girgensohn and
Joseph W. Sullivan Web Page Filtering and Re-Authoring for
Mobile Users . . . . . . . . . . . . . . 534--546
Mounia Lalmas A Model for Representing and Retrieving
Heterogeneous Structured Documents Based
on Evidential Reasoning . . . . . . . . 547--568
N. Zhang and
Q. Shi and
M. Merabti A Flexible Approach to Secure and Fair
Document Exchange . . . . . . . . . . . 569--581
Francesca Arcelli Fontana and
Ferrante Formato and
Remo Pareschi Computational Models for Information
Reuse . . . . . . . . . . . . . . . . . 582--591
Wanlei Zhou and
Andrzej Goscinski Managing Replicated Remote Procedure
Call Transactions . . . . . . . . . . . 592--608
Esther Jennings Distributed Algorithms for Finding
Central Paths in Tree Networks . . . . . 609--612
Tatsuhiro Tsuchiya and
Tohru Kikuno Availability Evaluation of Quorum-Based
Mutual Exclusion Schemes in General
Topology Networks . . . . . . . . . . . 613--622
Richard Mitchell and
B. de la Iglesia and
J. C. W. Debuse and
Mark Staples Book Reviews . . . . . . . . . . . . . . 623--625
Alexander Romanovsky On Structuring Cooperative and
Competitive Concurrent Systems . . . . . 627--637
Keith M. Martin and
Rei Safavi-Naini and
Huaxiong Wang Bounds and Techniques for Efficient
Redistribution of Secret Shares to New
Access Structures . . . . . . . . . . . 638--649
Martin P. Ward and
Keith H. Bennett Recursion Removal/Introduction by Formal
Transformation: An Aid to Program
Development and Program Comprehension 650--673
Kam-Yiu Lam and
Chung-Leung Pang and
Sang H. Son and
Jiannong Cao Resolving Executing-Committing Conflicts
in Distributed Real-time Database
Systems . . . . . . . . . . . . . . . . 674--692
H. Leung and
T. Y. Chen A New Perspective of the Proportional
Sampling Strategy . . . . . . . . . . . 693--698
Voon-Yee Vee and
Wen-Jing Hsu Applying Cilk in Provably Efficient Task
Scheduling . . . . . . . . . . . . . . . 699--712
Mark Sanderson Book Reviews . . . . . . . . . . . . . . 713--715
Erkki Mäkinen Comment on `A Framework for Modelling
Trojans and Computer Virus Infection' 321--323
H. Thimbleby and
S. O. Anderson and
P. A. Cairns Reply to ``Comment on `A Framework for
Modelling Trojans and Computer Virus
Infection' by E. Mäkinen'' . . . . . . . 324--325
Fred Cohen Reply to ``Comment on `A Framework for
Modelling Trojans and Computer Virus
Infection' by E. Mäkinen'' . . . . . . . 326--327
David S. Watkins The $QR$ Algorithm Revisited . . . . . . 133--145
David S. Watkins Francis's Algorithm . . . . . . . . . . 387--403
C. Strachey and
Velma R. Huskey and
Harry D. Huskey Anecdotes: An Impossible Program;
Charles Babbage and Lady Lovelace . . . 414--415