Last update:
Fri Jan 5 06:05:18 MST 2018
P. Hammersley Corporate Systems analysis --- a
personal editorial . . . . . . . . . . . 2--2
H. W. G. Gearing New approaches to systems analysis and
design. Welcome . . . . . . . . . . . . 3--3
F. F. Land Chairman's introduction . . . . . . . . 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. Brittan Design for a changing environment . . . 13--19
J. N. G. Brittain Design for a changing environment . . . 13--22
K. Nygaard The impact of social movements . . . . . 19--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
K. Watts 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
Anonymous International conference on data bases 36--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. K. Baker Book Review . . . . . . . . . . . . . . 45--45
M. Wells Book Review . . . . . . . . . . . . . . 45--45
R. A. Earnshaw Line Tracking for Incremental Plotters 46--52
R. M. De Morgan Book Review . . . . . . . . . . . . . . 52--52
E. J. Yannakoudakis and
F. H. Ayres and
J. A. W. Huggill Character coding for bibliographical
record control . . . . . . . . . . . . . 53--60
P. M. D. Gray Book Review . . . . . . . . . . . . . . 60--60
B. S. Walker Book Review . . . . . . . . . . . . . . 60--60
K. L. Clark and
J. Darlington Algorithm classification through
synthesis . . . . . . . . . . . . . . . 61--65
M. J. Blythe Book Review . . . . . . . . . . . . . . 65--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
D. L. Fisher Book Review . . . . . . . . . . . . . . 84--84
D. H. Rees Book Review . . . . . . . . . . . . . . 84--84
J. O. Thomas Book Review . . . . . . . . . . . . . . 84--84
M. Thomas Book Review . . . . . . . . . . . . . . 84--84
J. P. Abbott Algorithm 110: Computing solution arcs
of nonlinear equations with a parameter 85--89
Anonymous Algorithms supplement . . . . . . . . . 85--89
M. J. Denham Book review: \booktitleSystems
Decomposition, Optimisation and Control,
by M. G. Singh and A. Titli . . . . . . 89--89
M. J. Denham Book Review . . . . . . . . . . . . . . 89--89
N. L. Sarda and
J. R. Isaac Discussion and correspondence: 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: \booktitleArtificial
Intelligence, Volume 1 by P. H. Winston
and R. H. Brown . . . . . . . . . . . . 106--106
C. T. Burton Book Review . . . . . . . . . . . . . . 106--106
R. E. Griswold The use of character sets and character
mappings in Icon . . . . . . . . . . . . 107--114
C. D. Easteal Book Review . . . . . . . . . . . . . . 114--114
P. B. Fellget and
C. D. Easteal Book reviews: \booktitleThe Phenomenon
of Science: A Cybernetic Approach to
Human Evolution, by V. F. Turchin, 1977;
\booktitleBusiness Systems Handbook, by
Robert W. Gilmour, 1979 . . . . . . . . 114--114
P. B. Fellgett Book Review . . . . . . . . . . . . . . 114--114
J. M. Bishop and
D. W. Barron Procedure calling and structured
architecture . . . . . . . . . . . . . . 115--123
R. W. Paulson Book review: \booktitleAn Introduction
to Computational Fluid Mechanics, by
Chuen-Yen Chow, 1979 . . . . . . . . . . 123--123
R. W. Paulson Book Review . . . . . . . . . . . . . . 123--123
S. A. Kent A minicomputer based high level network
control language . . . . . . . . . . . . 124--131
Anonymous Joint BCS ACM Symposium on Research and
Development in Information Retrieval . . 131--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: \booktitleData
Communications and Teleprocessing
Systems, by T. Horsley, 1979;
\booktitleA Technique for Software and
Systems Design, by R. J. Lano, 1979 . . 141--141
D. L. A. Barber Book Review . . . . . . . . . . . . . . 141--141
J. M. Brady Book Review . . . . . . . . . . . . . . 141--141
R. H. Perrott and
A. K. Raja and
P. C. O'Kane A simulation experiment using two
languages . . . . . . . . . . . . . . . 142--146
A. M. Addyman Book Reviews . . . . . . . . . . . . . . 146--146
Brian Ford and
David Jacobs and
A. M. Addyman Book reviews: \booktitleWorkshop on
Reliable Software: Applied Computer
Science, by Peter Raulefs, 1979;
\booktitleReliable Software Through
Composite Design, by G. J. Myers, 1975;
\booktitleFortran, PL/1 and the Algols,
by Brian Meek, 1978 . . . . . . . . . . 146--146
B. Ford Book Reviews . . . . . . . . . . . . . . 146--146
D. Jacobs Book Reviews . . . . . . . . . . . . . . 146--146
I. C. Wand Dynamic resource allocation and
supervision with the programming
language MODULA . . . . . . . . . . . . 147--152
P. H. Prowse Book Review . . . . . . . . . . . . . . 152--152
D. M. Vallance and
Peter H. Prowse Book reviews: \booktitleProgramming in
Standard Fortran 77, by A. Balfour and
D. Marwick, 1979; \booktitleIssues in
Data Base Management, by Herbert Weber
and Anthony I. Wasserman, 1979 . . . . . 152--152
D. M. Vallance Book Review . . . . . . . . . . . . . . 152--152
D. T. Goodwin Partial Non-Underflow and Non-Overflow
of an Arithmetic Stack . . . . . . . . . 153--160
Roy Newton and
Harley Quilliam Book reviews: \booktitleSoftware
Portability: an Advanced Course, edited
by P. J. Brown, 1977; \booktitleThe
Challenge of Microprocessors, by M. G.
Hartley and Anne Buckley, 1979 . . . . . 160--160
R. Newton Book Review . . . . . . . . . . . . . . 160--160
H. Quilliam Book Review . . . . . . . . . . . . . . 160--160
B. Dasarathy and
Cheng Yang A Transformation on Ordered Trees . . . 161--164
A. Colin Day Book Review . . . . . . . . . . . . . . 164--164
A. H. Wise and
A. Colin Day Book reviews: \booktitleMachine and
Assembly Language Programming of the
PDP-11, by Arthur Gill, 1979;
\booktitleAssembly Language
Fundamentals, by Rina Yarmish and J.
Yarmish, 1978 . . . . . . . . . . . . . 164--164
A. H. Wise Book Review . . . . . . . . . . . . . . 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
R. W. Prowse Book Review . . . . . . . . . . . . . . 190--190
G. Emery Book reviews: \booktitleAssociative
networks, edited by N. V. Findler, 1979;
\booktitleThe MU5 Computer System, by
Derrick Morris and Rolland N. Ibbett,
1979; \booktitle 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
Bernard Colemen Software Engineering . . . . . . . . . . 200a-200
T. G. Gough Introducing the Electronic Office . . . 200--200
M. A. Jackson Methodology in Computer Graphics . . . . 200b-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
S. K. Robinson A Programming Metholodology in Compiler
Construction Part I: Concepts . . . . . 211--211
R. B. E. Napper and
R. N. Fisher RCC --- a User-Extensible Systems
Implementation Language . . . . . . . . 212--222
F. R. A. Hopgood Research Directions in Software
Technology . . . . . . . . . . . . . . . 222--222
R. N. Horspool and
N. Marovac An approach to the problem of
detranslation of computer programs . . . 223--229
I. M. Khabaza Machine Intelligence . . . . . . . . . . 229--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
P. G. Raymont Automatic Speech and Speaker Recognition 242--242
A. J. Thomas Computer Security . . . . . . . . . . . 242a-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
J. J. Florentin Speech Communication with Computers . . 255b-255
M. A. Jackson Structured Programming . . . . . . . . . 255--255
M. A. Jackson Structured Systems Analysis: Tools and
Techniques . . . . . . . . . . . . . . . 255a-255
A. Albano and
R. Orsini A tree search approach to the
${M}$-partition and Knapsack problems 256--261
G. Marshall Computer Security . . . . . . . . . . . 261--261
R. K. Lutz An algorithm for the real time analysis
of digitised images . . . . . . . . . . 262--269
J. C. Cluley Digital Circuits for Binary Arithmetic 269--269
A. J. T. Colin and
A. D. McGettrick and
P. D. Smith Sorting Trains . . . . . . . . . . . . . 270--273
P. C. Capon Understanding and Writing Compilers . . 273--273
I. J. Riddell and
L. M. Delves The comparison of routines for solving
Fredholm integral equations of the
second kind . . . . . . . . . . . . . . 274--285
Jim Inglis Learning to Program in Structured Cobol;
Structured Analysis and System
Specification . . . . . . . . . . . . . 285a-285
R. M. Lea Digital Networks and Computer Systems
2nd Edition . . . . . . . . . . . . . . 285b-285
I. R. Williams Information Management Systems/Virtual
Storage . . . . . . . . . . . . . . . . 285--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
Anonymous The Wilkes Prize . . . . . . . . . . . . 1--1
P. Hammersley Editorial . . . . . . . . . . . . . . . 1--1
Anonymous Information for authors . . . . . . . . 2--2
M. Healey The possible impact of minicomputers and
microprocessors on mainframe computer
manufacturers . . . . . . . . . . . . . 3--8
Anonymous Books reviewed in this issue . . . . . . 8--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
Anonymous Call for registration: First British
National Conference on Databases . . . . 16--16
K. Ekanadham and
A. Mahjoub Microcomputer Networks . . . . . . . . . 17--24
M. E. Brinson Book Review . . . . . . . . . . . . . . 24--24
J. C. Cavouras and
R. H. Davis Simulation Tools in Computer System
Design Methodologies . . . . . . . . . . 25--28
T. G. Gough Book Review . . . . . . . . . . . . . . 28--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
R. Lovett Book Review . . . . . . . . . . . . . . 41--41
N. Riley Book Review . . . . . . . . . . . . . . 41--41
M. J. R. Shave Entities, Functions, and Binary
Relations: Steps to a Conceptual Schema 42--47
J. Lindley Book Review . . . . . . . . . . . . . . 47--47
I. M. C. Shand Book Review . . . . . . . . . . . . . . 47--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
K. G. Beauchamp Book Review . . . . . . . . . . . . . . 51--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
J. M. Ross Book Review . . . . . . . . . . . . . . 70--70
K. Ewusi-Mensah Computer Network Usage Control Through
Peak Load Pricing . . . . . . . . . . . 71--77
A. A. Moelwyn-Hughes Book Review . . . . . . . . . . . . . . 77--77
D. T. Muxworthy Book Review . . . . . . . . . . . . . . 77--77
A. H. Wise Book Review . . . . . . . . . . . . . . 77--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
Anonymous Algorithms Supplement . . . . . . . . . 87--90
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: \booktitleSoftware
Reliability Guidebook, by Robert L.
Glass, 1979; \booktitleFoundations 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
J. G. Hunt Correspondence: Premature termination 95--95
D. J. Taylor Correspondence: GOTOs in practice . . . 95--95
R. P. Brent Correspondence: Comments on papers by
Maddison and Westreich . . . . . . . . . 95--96
D. J. Cairns and
P. R. Freeman Book reviews: \booktitleTheory and
Design of Digital Computer Systems, 2nd
ed., by Douglas Lewin, 1980;
\booktitleStatistical Computing, by W.
J. Kennedy and J. E. Gentle, 1980 . . . 96--96
P. R. Freeman Book Review . . . . . . . . . . . . . . 96--96
P. Stecher and
Volker Allenstein The application controller concept: a
first experience . . . . . . . . . . . . 97--106
I. Aleksander Book Review . . . . . . . . . . . . . . 106--106
R. E. Small Book Review . . . . . . . . . . . . . . 106--106
P. D. Smith and
S. Y. Steen A prototype crossword compiler . . . . . 107--111
Anonymous Calls for registration: \booktitleThe
Computer Journal Seminars . . . . . . . 111--111
S. Alagi\'c and
A. Kulenovi\'c Relational Pascal Data Base Interface 112--117
A. H. Bridges Book Review . . . . . . . . . . . . . . 117--117
J. N. G. Brittan Book Review . . . . . . . . . . . . . . 117--117
P. King Book Review . . . . . . . . . . . . . . 117--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 The design of calibration experiments
for synthetic jobs . . . . . . . . . . . 132--138
Anonymous Books reviewed in this issue . . . . . . 138--138
Tony P. Lucido and
Rahul Chattergy and
Udo W. Pooch Survey of Microprogram Verification and
Validation Methods . . . . . . . . . . . 139--142
S. H. Lavington Book Review . . . . . . . . . . . . . . 142--142
H. Quilliam Book Review . . . . . . . . . . . . . . 142--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
Anonymous Corrigenda . . . . . . . . . . . . . . . 155--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
P. R. Freeman Book Review . . . . . . . . . . . . . . 172--172
J. Inglis Book Review . . . . . . . . . . . . . . 172--172
D. Simpson Book Review . . . . . . . . . . . . . . 172--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: \booktitlePrinciples of
Database Systems, by J. D. Ullman, 1980;
\booktitleMathematical Methods in
Computer Graphics and Design, edited by
K. W. Brodie, 1980 . . . . . . . . . . . 190--190
S. Jones Book Review . . . . . . . . . . . . . . 190--190
C. M. Reeves Book Review . . . . . . . . . . . . . . 190--190
D. Bell Correspondance . . . . . . . . . . . . . 191--191
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
Anonymous Announcement . . . . . . . . . . . . . . 192--192
D. F. Hartley Correspondance . . . . . . . . . . . . . 192--192
D. F. Hartley and
The Editor Correspondence: The Wilkes Award . . . . 192--192
J. D. Wigg Correspondance . . . . . . . . . . . . . 192--192
J. D. Wigg Correspondence: Unconditional branches 192--192
F. S. Zahran Universal Data Model Holder for Data
Dictionary Systems . . . . . . . . . . . 193--199
C. Potter Book Review . . . . . . . . . . . . . . 199--199
J. M. Ross Book Review . . . . . . . . . . . . . . 199--199
I. M. C. Shand Book Review . . . . . . . . . . . . . . 199--199
S. M. Deen and
D. Nikodem and
A. Vashishta The design of a canonical database
system (Preci) . . . . . . . . . . . . . 200--209
J. M. Bishop and
D. W. Barron Principles of Descriptors . . . . . . . 210--221
S. C. Holden Book Review . . . . . . . . . . . . . . 221--221
P. Kent Book Review . . . . . . . . . . . . . . 221--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
P. A. Clarke Book Review . . . . . . . . . . . . . . 234--234
R. E. Evans Book Review . . . . . . . . . . . . . . 234--234
M. E. Falla The Gamma software engineering system 235--242
H. Wettstein Locking Operations for Maximum
Concurrency . . . . . . . . . . . . . . 243--248
D. B. G. Edwards Book Review . . . . . . . . . . . . . . 248--248
G. Radley Book Review . . . . . . . . . . . . . . 248--248
H. W. Thimbleby A word boundary algorithm for text
processing . . . . . . . . . . . . . . . 249--255
Anonymous Books reviewed in this issue . . . . . . 255--255
G. F. Butler and
J. Pike A free-format data input scheme written
in standard Fortran (Ansi 66) . . . . . 256--257
A. C. Kilgour Book review: \booktitleILP: 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
A. C. Kilgour Book Review . . . . . . . . . . . . . . 257--257
Ronald E. Prather and
Shirla G. Giulieri Decomposition of Flowchart Schemata . . 258--262
Z. Zdrahal and
I. Bratko and
A. Shapiro Recognition of Complex Patterns Using
Cellular Arrays . . . . . . . . . . . . 263--270
Anonymous Forthcoming Meeting . . . . . . . . . . 270--270
C. G. Breiner Correspondence . . . . . . . . . . . . . 270--270
D. Harris Correspondence . . . . . . . . . . . . . 270--270
M. Wakeman Correspondence . . . . . . . . . . . . . 270--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 A 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 Organisation . . . . . . . . . 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
J. R. Jones Book Review . . . . . . . . . . . . . . 307--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
D. M. R. Bell Book Review . . . . . . . . . . . . . . 315--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
J. C. Cluley Book Review . . . . . . . . . . . . . . 330--330
L. Corner Book Review . . . . . . . . . . . . . . 330--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
J. Anderson Book Review . . . . . . . . . . . . . . 342--342
R. E. Thomas Book Review . . . . . . . . . . . . . . 342--342
B. S. Walker Book Review . . . . . . . . . . . . . . 342--342
N. P. Wootton Book Review . . . . . . . . . . . . . . 342--342
A. D. Elliman and
A. R. Sudhindra Performances of Two Microprocessor-Based
Multiplexor Techniques . . . . . . . . . 343--346
F. H. George Book Review . . . . . . . . . . . . . . 346--346
M. Lehman Book Review . . . . . . . . . . . . . . 346--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 A hybrid simulation/regression model of
a virtual storage system . . . . . . . . 358--366
P. A. Bennett Book Review . . . . . . . . . . . . . . 366--366
A. S. Radford Book Review . . . . . . . . . . . . . . 366--366
James K. Mullin Change Area B-Trees: a Technique to Aid
Error Recovery . . . . . . . . . . . . . 367--373
Anonymous Forthcoming meetings . . . . . . . . . . 373--373
I. Sklená\vr Affine Slices . . . . . . . . . . . . . 374--377
Anonymous Report . . . . . . . . . . . . . . . . . 377--377
J. English Correspondence . . . . . . . . . . . . . 377--377
I. D. Hill Correspondence . . . . . . . . . . . . . 377--377
J. G. Hunt Correspondence . . . . . . . . . . . . . 377--377
R. N. Ibbett Correspondence . . . . . . . . . . . . . 377--377
Robin Sibson and
Graeme D. Thomson A seamed quadratic element for
contouring . . . . . . . . . . . . . . . 378--382
Anonymous Books reviewed in this issue . . . . . . 382--382
Anonymous Algorithms supplement . . . . . . . . . 383--384
R. A. Frost Algorithm 112: Dumping the index of a
dynamic hash table . . . . . . . . . . . 383--384
A. M. Addyman Book Review . . . . . . . . . . . . . . 384--384
C. C. Chang Book Review . . . . . . . . . . . . . . 384--384
R. W. Newton and
F. Panzieri and
C. C. Chang and
A. M. Addyman Book reviews: \booktitleProgramming
Language Standardisation, edited by I.
D. Hill and B. L. Meek, 1980;
\booktitleProblem Solving and Structured
Programming, by E. B. Koffmann, 1981;
\booktitleData Base: Structured
Techniques for Design, Performance and
Management, by S. Atre, 1980;
\booktitlePascal --- The Language and
its Implementation, edited by D. W.
Barron, 1981 . . . . . . . . . . . . . . 384--384
R. W. Newton Book Review . . . . . . . . . . . . . . 384--384
F. Panzieri Book Review . . . . . . . . . . . . . . 384--384
P. Hammersley Editorial . . . . . . . . . . . . . . . 1--1
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
Anibal O. Caride and
Susana I. Zanette On the Process of Bisection to Calculate
the Eigenvalues of Quindiagonal Matrices 44--44
M. D. McIlroy A Program for Generating Word Squares 44a-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
Charles 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
S. Jones Effective Data Base Design . . . . . . . 83--83
C. Potter Fundamentals of Systems Analysis . . . . 83a-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
Donald 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
Peter Radford Petri Net Theory and the Modeling of
Systems . . . . . . . . . . . . . . . . 129--129
K. P. Teare Eurographics 80 . . . . . . . . . . . . 129a-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. Julian M. Davies A note on sparsely filled dynamically
allocated memory . . . . . . . . . . . . 159--159
C. C. Chang Data Base Administration . . . . . . . . 160--160
R. Fletcher Combinatorial Methods of Discrete
Programming . . . . . . . . . . . . . . 160b-160
C. D. F. Miller Programming in Pascal with Pascal/1000 160a-160
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
Anonymous Algorithms supplement . . . . . . . . . 278--282
Robert Piessens Algorithm 113: Inversion of the Laplace
transform . . . . . . . . . . . . . . . 278--282
F. F. Land Tutorial . . . . . . . . . . . . . . . . 283--285
Anonymous Call for registration . . . . . . . . . 286--286
Marek Missala and
Piotr Rudnicki Correspondence: Jumping to some purpose 286--286
J. Watt Correspondence: The possible impact of
minicomputers and microprocessors [on]
mainframe computer manufacturers . . . . 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, \booktitleSTATLILB: A
Statistical Computing Laboratory, 1981;
N. Rushby (ed.), \booktitleSelected
Readings in Computer-Based Learning,
1981; R. D. Tennent,
\booktitlePrinciples of Programming
Languages, 1981; D. Hutchison,
\booktitleFundamentals 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. Velasevi\'c 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
T. M. Barnard Simplified Accounting for the Computer
Industry . . . . . . . . . . . . . . . . 337--337
P. A. Bennett Practical Reliability Engineering . . . 337c-337
P. G. Raymont Apl80 . . . . . . . . . . . . . . . . . 337b-337
M. Wells Computer Networks . . . . . . . . . . . 337a-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
P. A. Bennett Elements of Computer Process Control . . 396b-396
P. R. Freeman Basic-Pack Statistics Programs for Small
Computers . . . . . . . . . . . . . . . 396--396
G. Mitra Computer Scheduling of Public Transport 396a-396
M. C. Er A Note on Computing Precedence Functions 397--398
J. M. Bishop and
D. W. Barron Mu5 Descriptors . . . . . . . . . . . . 399a-399
Roger Hart Implementation of BEDSOCS: an
interactive simulation language . . . . 399--399
Geoffrey J. Baker Database Security and Integrity . . . . 400b-400
P. A. Bennett Software Metrics . . . . . . . . . . . . 400a-400
Derrick Grover Cryptography: a Primer . . . . . . . . . 400c-400
A. H. Wise Book Review: \booktitleAdvances in Data
Processing Management --- Vol.1 . . . . 400--400
Geoffrey J. Baker An End-User's Guide to Data Base . . . . 400--e-400
P. A. Bennett Fault Tolerance: Principles and Practice 400--d-400
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
A. G. Bell Book Review: James Martin,
\booktitleTelematic Society . . . . . . 422a-422
J. Brittan Book Review: D. Millington,
\booktitleSystems Analysis and Design
for Computer Applications . . . . . . . 422--422
P. Giles Book Review: P. Calingaert,
\booktitleOperating System Elements ---
a User Perspective . . . . . . . . . . . 422b-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
Anonymous Forthcoming Meetings . . . . . . . . . . 485--485
D. A. Bell and
S. M. Deen Key Space Compression and Hashing in
PRECI . . . . . . . . . . . . . . . . . 486--492
M. M. Barritt Book Review: Michael Shave,
\booktitleData Structures . . . . . . . 492b-492
I. D. Hill Book Review: R. E. Berry,
\booktitleProgramming Language
Translation . . . . . . . . . . . . . . 492a-492
C. D. F. Miller Book Review: E. W. Martin and W. C.
Perkins, \booktitleFortran for Business
Students: a Programmed Instruction
Approach . . . . . . . . . . . . . . . . 492--492
J. Shanehchi and
D. J. Evans A modified bisection algorithm for the
determination of the eigenvalues of a
symmetric quindiagonal matrix . . . . . 493--494
P. A. Bennett Book Review: Caxton C. Foster,
\booktitleReal-Time Programming ---
Neglected Topics . . . . . . . . . . . . 494b-494
B. K. F. Cheng Book Review: L. L. Lapin,
\booktitleQuantitative Methods for
Business Decisions (2nd Edn) . . . . . . 494a-494
I. M. C. Shand Book Review: F. F. Kuo (editor),
\booktitleProtocols and Techniques for
Data Communication Networks . . . . . . 494--494
Jim Inglis Jumping to Some Purpose . . . . . . . . 495a-495
A. Shafibegly-Gray and
R. W. Whitty Decomposition of Flowchart Schemata . . 495--495
P. A. Bennett Digital Control Using Microprocessors 496a-496
David J. Cairns Invitation to Pascal . . . . . . . . . . 496--496
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: Part 3 . . . . . . . . . . . 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
J. M. Wilson Algorithms Supplement . . . . . . . . . 92--92
R. A. Reynolds Short Note: Human Performance in
Interactive Graphics Operations . . . . 93--94
P. J. Coates Correspondence . . . . . . . . . . . . . 95--95
D. Harper Correspondence . . . . . . . . . . . . . 95--95
G. L. Robinson Correspondance . . . . . . . . . . . . . 95--95
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
N. N. Chan and
K-H. Li Algorithms Supplement . . . . . . . . . 184--186
C. J. Prosser and
A. C. Kilgour Short Notes: a Note on Computing the
Square Root of an Integer . . . . . . . 187--187
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
F. W. Burton and
J. G. Kollias Short Notes: Comment on `The Explicit
Quad Tree as a Structure for Computer
Graphics' . . . . . . . . . . . . . . . 188--188
R. H. Barlow and
S. MacQueen Correspondence . . . . . . . . . . . . . 189--189
Bill Findlay Correspondence . . . . . . . . . . . . . 189--189
I. R. MacCallum Correspondence . . . . . . . . . . . . . 189--189
D. J. Cairns Correspondence . . . . . . . . . . . . . 189--190
P. Giles Book Review . . . . . . . . . . . . . . 190--190
I. Mearns Correspondence . . . . . . . . . . . . . 190--190
I. Aitchison Book Review . . . . . . . . . . . . . . 190--191
J. E. Parkin Book Review . . . . . . . . . . . . . . 191--191
J. E. Parkin Book Review . . . . . . . . . . . . . . 191--191
I. Williams Book Review . . . . . . . . . . . . . . 191--191
I. Williams Book Review . . . . . . . . . . . . . . 191--191
Barry Barber Book Review . . . . . . . . . . . . . . 191--192
Anonymous Conferences . . . . . . . . . . . . . . 192--192
Anonymous Second International Conference on
Databases . . . . . . . . . . . . . . . 192--192
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. Takaoka Short note: 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
B. Barber Dynamic Programming-Models & Applications 381c-381
D. L. Fisher A Structured Approach to Fortran 77
Programming . . . . . . . . . . . . . . 381a-381
J. Inglis Advanced Cobol . . . . . . . . . . . . . 381b-381
Murray Laver Language as a Cognitive Process . . . . 381--381
Philip Giles Computer Networks and Simulation 11 . . 381--d-382
J. A. Bowles Data Acquisition Systems . . . . . . . . 382c-382
S. Evans Spss Introductory Guide . . . . . . . . 382--382
M. Horwood Theory and Practice of Microprocessor 382b-382
S. Vajda Nonlinear Optimization 1981 . . . . . . 382a-382
J. L. Bogod CAD/CAM as a Basis for the Development
of Technology in Developing Nations . . 383c-383
Rodney Coleman Queueing Theory: a Problem Solving
Approach . . . . . . . . . . . . . . . . 383--383
Peter Haine Automated Tools for Information Systems
Design . . . . . . . . . . . . . . . . . 383b-383
J. M. Spivey Logic Programming . . . . . . . . . . . 383a-383
P. Giles Operating System Elements --- a User
Perspective . . . . . . . . . . . . . . 383--d-383
Anonymous Announcements . . . . . . . . . . . . . 384a-384
I. D. Hill Programming Language Translation . . . . 384--384
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 Short Notes: Unifying Multiple Semantic
Intentions for a Syntactic Construct . . 83--84
R. J. Macmillan and
J. H. Davenport Short Notes: Factoring Medium-Sized
Integers . . . . . . . . . . . . . . . . 84--85
G. N. Buckley and
A. Silberschatz Short Notes: on the Heterogeneous Guard
Locking Protocol . . . . . . . . . . . . 86--87
T. Agmon and
I. Borovits Short Notes: 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
R. J. Heard Correspondence . . . . . . . . . . . . . 90--90
G. Phillpotts Correspondence . . . . . . . . . . . . . 90--90
J. Reeves Correspondence . . . . . . . . . . . . . 90--91
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
Anonymous Algorithms Supplement . . . . . . . . . 178--187
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
Anonymous Statement of Policy . . . . . . . . . . 187--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 Erkiö 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
H. D. Baecker Short Note: on Instruction Set Encoding 283--283
Enid Mumford Participative systems design . . . . . . 283--283
E. Mumford Short Note: Participative Systems Design 283--283
R. H. Davis A note on dynamic file organization
models . . . . . . . . . . . . . . . . . 284--284
R. H. Davis Short Note: a Note on Dynamic File
Organization Models . . . . . . . . . . 284--284
M. C. Er Correspondence . . . . . . . . . . . . . 285--285
D. Holdsworth Correspondence . . . . . . . . . . . . . 285--285
W. List Correspondence . . . . . . . . . . . . . 285--285
J. G. Crookes Correspondence . . . . . . . . . . . . . 286--286
M. Wells Book Review . . . . . . . . . . . . . . 286--286
M. Wells Book Review . . . . . . . . . . . . . . 286--286
J. O. Jenkins Book Review . . . . . . . . . . . . . . 286--287
F. R. A. Hopgood Book Review . . . . . . . . . . . . . . 287--287
G. N. Lance Book Review . . . . . . . . . . . . . . 287--287
D. Muxworthy Book Review . . . . . . . . . . . . . . 287--287
Anonymous Announcement . . . . . . . . . . . . . . 288--288
Anonymous Corrigendum . . . . . . . . . . . . . . 288--288
Anonymous Call for Papers . . . . . . . . . . . . 288--288
Anonymous Forthcoming Events . . . . . . . . . . . 288--288
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. Part 2 362--367
Anonymous Algorithms Supplement . . . . . . . . . 368--372
Ahmed S. Zaki Algorithm 119: a space saving insertion
algorithm for $2$-$3$ trees . . . . . . 368--372
Robert W. Irving Short Notes: Permutation Backtracking in
Lexicographic Order . . . . . . . . . . 373--375
F. W. Burton and
V. J. Kollias and
J. G. Kollias Short Notes: Consistency in
Point-in-Polygon Tests . . . . . . . . . 375--376
Alan Hutchinson Short notes: the Halting Problem Does
Not Matter . . . . . . . . . . . . . . . 376--376
H. R. J. Grosch Correspondence . . . . . . . . . . . . . 377--377
A. C. Kilgour Correspondence . . . . . . . . . . . . . 377--377
M. J. Mepham Correspondence . . . . . . . . . . . . . 377--378
P. Rechenberg Correspondence . . . . . . . . . . . . . 378--378
P. Fellgett Correspondence . . . . . . . . . . . . . 378--379
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
Anonymous Announcement . . . . . . . . . . . . . . 95--95
P. Shackelton Correspondence . . . . . . . . . . . . . 95--95
Enid Mumford Defining System Requirements to Meet
Business Needs: a Case Study Example . . 97--104
Anonymous Announcements . . . . . . . . . . . . . 104--104
Anonymous Conference . . . . . . . . . . . . . . . 104--104
Anonymous Call for Papers . . . . . . . . . . . . 104--104
Julian R. Ullmann and
Robert M. Haralick and
Linda G. Shapiro Computer Architecture for Solving
Consistent Labelling Problems . . . . . 105--110
D. J. Colwell and
J. R. Gillett Short Notes: a Note on Broyden's Mark
Scaling Algorithm . . . . . . . . . . . 111--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 Djordjevi\'c 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
Anonymous Announcements . . . . . . . . . . . . . 446--446
Anonymous Call for Papers . . . . . . . . . . . . 446--446
Anonymous Forthcoming Events . . . . . . . . . . . 446--446
N. M. Maclaren Correspondence . . . . . . . . . . . . . 446--446
M. W. Shields Concurrent Machines . . . . . . . . . . 449--465
K. Kant and
A. Silberschatz Error Propagation and Recovery in
Concurrent Environments . . . . . . . . 466--473
Anonymous Announcements . . . . . . . . . . . . . 473--473
Anonymous Conference . . . . . . . . . . . . . . . 473--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
Anonymous The Wilkes Award 1984 . . . . . . . . . 507--507
D. J. Flynn and
A. H. F. Laender Mapping from a Conceptual Schema to a
Target Internal Schema . . . . . . . . . 508--517
Anonymous Conference . . . . . . . . . . . . . . . 517--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
Anonymous Announcements . . . . . . . . . . . . . 529--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
R. J. Heard Correspondence . . . . . . . . . . . . . 543--543
M. C. Er Correspondence . . . . . . . . . . . . . 543--544
Anonymous Announcement . . . . . . . . . . . . . . 544--544
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. Fucík and
J. Král 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
T. Y. Chen Short Note: a Dynamic Approach Towards
Software Science . . . . . . . . . . . . 189--189
E. F. Ferraby Correspondence . . . . . . . . . . . . . 190--190
M. Laver Correspondence . . . . . . . . . . . . . 190--190
S. Mossige Correspondence . . . . . . . . . . . . . 190--190
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
Anonymous Announcements . . . . . . . . . . . . . 284--284
K. Brokate Correspondence . . . . . . . . . . . . . 285--285
R. G. Elston Correspondence . . . . . . . . . . . . . 285--286
Anonymous Notices . . . . . . . . . . . . . . . . 286--286
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
Anonymous Announcement . . . . . . . . . . . . . . 347--347
P. Feldman and
D. Miller Entity Model Clustering: Structuring a
Data Model by Abstraction . . . . . . . 348--360
Anonymous Announcements . . . . . . . . . . . . . 360--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
J. Bradley Short Notes: Join Dependencies in
Relational Databases and the Geometry of
Spatial Grids . . . . . . . . . . . . . 378--379
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
D. C. Ince and
S. Hekmatpour Short Notes: an Empirical Evaluation of
Random Testing . . . . . . . . . . . . . 380--380
R. J. Heard Correspondence . . . . . . . . . . . . . 381--381
R. M. Baer Correspondence . . . . . . . . . . . . . 381--382
Y. H. Tsin Correspondence . . . . . . . . . . . . . 382--382
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 Short Note: a Weighted Mark-Scaling
Algorithm . . . . . . . . . . . . . . . 477--477
J. M. Wilson A weighted mark-scaling algorithm . . . 477--477
D. Du Feu Correspondence . . . . . . . . . . . . . 478--478
W. F. Lunnon Correspondence . . . . . . . . . . . . . 478--478
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
R. A. Frost Short Notes: Improving output from
research (in the domain of knowledge
base systems) . . . . . . . . . . . . . 572--573
V. Akman Short Notes: Writing Self-replicating
Code . . . . . . . . . . . . . . . . . . 573--574
C. M. Castle and
M. L. V. Pitteway Correspondence . . . . . . . . . . . . . 574--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
Anonymous Announcements . . . . . . . . . . . . . 93--93
J. Rosenne Correspondence . . . . . . . . . . . . . 93--93
A. Verrijn-Stuart Themes and Trends in Information
Systems: TC8, 1975--1985 . . . . . . . . 97--109
Anonymous Announcement . . . . . . . . . . . . . . 109--109
L. M. Mackenzie and
A. M. Macleod and
D. J. Berry A multiple microprocessor system for
CPU-bound calculations . . . . . . . . . 110--118
Anonymous Announcements . . . . . . . . . . . . . 118--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 Short Note: a Note on the Convergence of
an Iterative Scheme for Solving a
Quadratic Equation . . . . . . . . . . . 189--190
A. V. Bowker Correspondence . . . . . . . . . . . . . 191--191
H. R. A. Townsend Correspondence . . . . . . . . . . . . . 191--191
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
Anonymous Announcement . . . . . . . . . . . . . . 248--248
C. C. Chang An Information Protection Scheme Based
Upon Number Theory . . . . . . . . . . . 249--253
Anonymous Announcement . . . . . . . . . . . . . . 253--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
Anonymous Announcement . . . . . . . . . . . . . . 267--267
J. C. Nash and
S. Shlien Simple Algorithms for the Partial
Singular Value Decomposition . . . . . . 268--275
Anonymous Announcement . . . . . . . . . . . . . . 275--275
Anonymous Algorithm Supplement . . . . . . . . . . 276--276
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
M. C. Er Short Note: an Efficient Implementation
of Permutation Backtracking in
Lexicographic Order . . . . . . . . . . 282--282
D. Salomon Short Note: a Design for an Efficient
NOR-gate only, Binary-ripple Adder with
Carry-completion-detection Logic . . . . 283--285
R. Kowalski and
M. Sergot Correspondence . . . . . . . . . . . . . 285--285
T. J. Froggatt Correspondence . . . . . . . . . . . . . 285--286
Anonymous Announcements . . . . . . . . . . . . . 286--286
M. Sowa A method for speeding up serial
processing in dataflow computers by
means of a program counter . . . . . . . 289--294
C. S. 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. Carapuça 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. Dvorák and
B. Durian Stable Linear Time Sublinear Space
Merging . . . . . . . . . . . . . . . . 372--375
D. Gault and
M. Clint Short Notes: a Fast Algorithm for the
Towers of Hanoi Problem . . . . . . . . 376--378
T. H. Tse Short Notes: Towards a Single Criterion
for Identifying Program
Unstructuredness* . . . . . . . . . . . 378--380
Anonymous Editorial . . . . . . . . . . . . . . . 385--385
W. F. Clocksin Principles of the Delphi Parallel
Inference Machine . . . . . . . . . . . 386--392
Anonymous Announcement . . . . . . . . . . . . . . 392--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. Thimbleby Optimising Self-Replicating Programs . . 475--476
Anonymous Announcements . . . . . . . . . . . . . 477--479
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
Elisa 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. Warren Burton Batched Interpolation Search . . . . . . 565--568
M. C. Er Lexicographic Listing and Ranking of
${T}$-Ary Trees . . . . . . . . . . . . 569--572
Anonymous Announcements . . . . . . . . . . . . . 573--575
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. Stojmenovi\'c 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. H. Hubbard Correspondence . . . . . . . . . . . . . 92--92
P. Leith Correspondence . . . . . . . . . . . . . 92--93
Anonymous Announcements . . . . . . . . . . . . . 93--96
Anonymous Notice . . . . . . . . . . . . . . . . . 96--96
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
Anonymous Announcement . . . . . . . . . . . . . . 140--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
Anonymous Announcements . . . . . . . . . . . . . 154--154
M. M. Owrang O. and
L. L. Miller Query Translation Based on Hypergraph
Models . . . . . . . . . . . . . . . . . 155--164
Anonymous Announcement . . . . . . . . . . . . . . 164--164
F. B. Bastani and
S. S. Iyengar and
I-Ling Yen Concurrent Maintenance of Data
Structures in a Distributed Environment 165--174
Anonymous Announcements . . . . . . . . . . . . . 174--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
Anonymous Announcements . . . . . . . . . . . . . 189--189
Anonymous Announcement . . . . . . . . . . . . . . 190--190
K. Brokate Correspondence . . . . . . . . . . . . . 190--190
K. Brokate Correspondence . . . . . . . . . . . . . 190--190
J. S. Rohl Correspondence . . . . . . . . . . . . . 190--190
D. Morris and
C. J. Theaker and
P. B. Whitehead Structured Abstract Schematics . . . . . 193--200
Anonymous Announcement . . . . . . . . . . . . . . 200--200
F. Lombardi Analysis of Comparison-Based Diagnosable
Systems Using Temporal Criteria . . . . 201--208
Anonymous Announcements . . . . . . . . . . . . . 208--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
Anonymous Announcements . . . . . . . . . . . . . 242--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
T. P. van der Weide Iterative Tree Traversal Using
Refinements and Pointer Rotation . . . . 269--275
Anonymous Announcements . . . . . . . . . . . . . 275--275
D. Richards On the Worst-Possible Analysis of
Weighted Comparison-Based Algorithms . . 276--278
S. Dvorák 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 Short Note: Overlay clusters for C
programs . . . . . . . . . . . . . . . . 285--286
M. J. Jamieson Correspondence . . . . . . . . . . . . . 286--286
Anonymous Announcements . . . . . . . . . . . . . 286--287
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
Anonymous Announcements . . . . . . . . . . . . . 312--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
Anonymous Announcements . . . . . . . . . . . . . 357--357
R. Williams The Goblin Quadtree . . . . . . . . . . 358--363
Anonymous Announcements . . . . . . . . . . . . . 363--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
Anonymous Announcements . . . . . . . . . . . . . 380a-382
R. T. O. Rees Termination Indicators in Programming 380--380
N. Bjòrn-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 Short Note: Two Livelock-free Protocols
for Slotted Rings . . . . . . . . . . . 474--476
Anonymous Announcements . . . . . . . . . . . . . 476--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
Anonymous Announcement . . . . . . . . . . . . . . 502--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
Anonymous Announcement . . . . . . . . . . . . . . 516--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 Short notes: Some Properties of the
Rotation Lattice of Binary Trees . . . . 564--565
C. C. Chang and
C. Y. Cheng Short notes: a Recursive Performance
Formula of the Disc Modulo Allocation
Method for Binary Cartesian Product
Files . . . . . . . . . . . . . . . . . 565--566
G. M. Megson and
D. J. Evans Short notes: Improved Matrix Product
Computation using Double-Pipeline
Systolic Arrays . . . . . . . . . . . . 567--569
M. H. Rennhackkamp and
S. H. von Solms Short notes: 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
Anonymous Announcements . . . . . . . . . . . . . 12--12
C. Mitchell Multi-destination secure electronic mail 13--15
Anonymous Announcement . . . . . . . . . . . . . . 15--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
Anonymous Announcement . . . . . . . . . . . . . . 23--23
B. Freisleben and
J. L. Keedy Priority Semaphores . . . . . . . . . . 24--28
Anonymous Announcement . . . . . . . . . . . . . . 28--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
Anonymous Announcement . . . . . . . . . . . . . . 54--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
Anonymous Announcements . . . . . . . . . . . . . 85--85
A. R. Halbert and
S. J. P. Todd and
J. R. Woodwark Generalizing active zones for
set-theoretic solid models . . . . . . . 86--89
Anonymous Announcement . . . . . . . . . . . . . . 89--89
M. Negri and
G. Pelagatti and
L. Sbattella Short Notes: Semantics and Problems of
Universal Quantification in SQL . . . . 90--91
M. Sideri and
S. Efremidis and
G. Papa-Konstantinou Short Notes: Semantically Driven Parsing
of Context-free Languages . . . . . . . 91--93
M. J. Jamieson Short Notes: Rapidly Converging
Iterative Formulae for Finding Square
Roots and their Computational
Efficiencies . . . . . . . . . . . . . . 93--94
Anonymous Announcement . . . . . . . . . . . . . . 94--94
Anonymous Announcement . . . . . . . . . . . . . . 95--95
D. J. Wheeler Correspondence . . . . . . . . . . . . . 95--95
P. Wadler Editorial --- Lazy Functional
Programming . . . . . . . . . . . . . . 97--97
J. 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 Short Note: an Iterative Solution for
the $4$-peg Towers of Hanoi . . . . . . 187--189
P. Hammersley Editorial --- Information and
Information Systems . . . . . . . . . . 193--193
K. P. Tan and
T. S. Chua and
P. T. Lee AUTO-DFD: an intelligent data flow
processor . . . . . . . . . . . . . . . 194--201
Anonymous Announcements . . . . . . . . . . . . . 201--201
A. N. Godwin and
M. B. Gore and
D. W. Salt A comparison of JSD and DFD as
descriptive tools . . . . . . . . . . . 202--211
Anonymous Announcements . . . . . . . . . . . . . 211--211
M. A. Shepherd and
W. J. Phillips and
C.-K. Chu A Fixed-Size Bloom Filter for Searching
Textual Documents . . . . . . . . . . . 212--219
Anonymous Announcements . . . . . . . . . . . . . 219--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. Mäkinen 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
Anonymous Announcement . . . . . . . . . . . . . . 261--261
G. G. Scarrott The Nature of Information . . . . . . . 262--266
Anonymous Announcements . . . . . . . . . . . . . 266--266
A. Schiper and
R. Simon and
Ph. 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. Djoki\'c and
M. Miyakawa and
S. Sekiguchi and
I. Semba and
I. Stojmenovi\'c Short Note: a Fast Iterative Algorithm
for Generating Set Partitions . . . . . 281--282
N. Apostolatos Correspondence . . . . . . . . . . . . . 282--282
F. Ruskey and
D. R. van Baronaigien Correspondence . . . . . . . . . . . . . 282--283
S. Cook Editorial --- Object-Oriented Systems 289--289
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
Anonymous Announcement . . . . . . . . . . . . . . 304--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 Short Note: Calculating Earthwords
Volumes --- an Exercise in Geometric
Algorithms . . . . . . . . . . . . . . . 377--379
M. H. Hubbard Correspondence . . . . . . . . . . . . . 379--379
C. Mitchell Correspondence . . . . . . . . . . . . . 379--380
R. J. Mitchell and
P. R. Minchinton Correspondence . . . . . . . . . . . . . 380--380
A. J. Wlodarczyk Correspondence . . . . . . . . . . . . . 380--381
Anonymous Announcements . . . . . . . . . . . . . 381--382
B. Wichmann Editorial --- Formal Methods in
Computing . . . . . . . . . . . . . . . 385--385
I. Sommerville and
R. Thomson An Approach to the Support of Software
Evolution . . . . . . . . . . . . . . . 386--398
Anonymous Announcement . . . . . . . . . . . . . . 398--398
M. W. Shields Implicit system specification and the
interface equation . . . . . . . . . . . 399--412
Anonymous Announcements . . . . . . . . . . . . . 412--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
Anonymous Announcement . . . . . . . . . . . . . . 436--436
L. V. Mancini and
G. P. Pappalardo Proving correctness properties of a
replicated synchronous program . . . . . 437--444
Anonymous Announcement . . . . . . . . . . . . . . 444--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
Anonymous Announcement . . . . . . . . . . . . . . 473--473
J. A. Ellis and
P. M. Lepolesa Short Note: a Las Vegas Graph Colouring
Algorithm . . . . . . . . . . . . . . . 474--476
Fred Cole Editorial --- Electronic Publishing . . 481--481
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
Heather Brown Standards for Structured Documents . . . 505--514
Anonymous Announcement . . . . . . . . . . . . . . 515--515
I. Ritchie Hypertext --- Moving Towards Large
Volumes . . . . . . . . . . . . . . . . 516--523
R. A. Morris Rendering digital type: a historical and
economic view of technology . . . . . . 524--532
Heather Brown Book Review . . . . . . . . . . . . . . 532--532
P. S. Licker Computer Management: Human Resource
Management and Business Success in
Small, Hi-Tech Firms: Some Lessons for
Data Processing . . . . . . . . . . . . 533--540
Anonymous Announcement . . . . . . . . . . . . . . 540--540
D. A. Umphress and
U. W. Pooch and
M. Tanik Simulation: Fast Prototyping of a
Goal-Oriented Simulation Environment
System . . . . . . . . . . . . . . . . . 541--548
J. R. Parker Computer Graphics: on the Conversion of
Filled Polygonal Regions from Raster to
Vector Representation . . . . . . . . . 549--553
Anonymous Announcement . . . . . . . . . . . . . . 553--553
G. H. Kirby and
M. Visvalingam and
P. Wade Computer Graphics: Recognition and
Representation of a Hierarchy of
Polygons with Holes . . . . . . . . . . 554--562
A. Quin and
Y. Yanagisawa Computer Graphics: on Data Compaction of
Scanning Curves . . . . . . . . . . . . 563--566
A. D. Robison and
B. J. Hafner and
S. S. Skiena Computer Games: Eight Pieces Cannot
Cover a Chess Board . . . . . . . . . . 567--570
M. Cosnard and
A. G. Ferreira Generating permutations on a VLSI
suitable linear network . . . . . . . . 571--573
Anonymous Announcements . . . . . . . . . . . . . 573--573
A. T. Arblaster and
M. E. Sime and
T. R. G. Green Jumping to Some Purpose . . . . . . . . 105--109