The Computer Journal, Volume 41, 1998

Volume 41, Number 1, 1998

Ana Cavalcanti, Jim Woodcock: A Weakest Precondition Semantics for Z. 1-15
Michele Flammini, Jan van Leeuwen, Alberto Marchetti-Spaccamela: The Complexity of Interval Routing on Random Graphs. 16-25
Soo-Mook Moon, Kemal Ebcioglu: The Performance Impact of Exploiting Branch ILP with Tree Representation of ILP Code. 26-44
Giuseppe Alia, Enrico Martinelli: Logic Design of a Fast Circuit for Iterative Additions in Redundant Hybrid. 45-51
Ding-Ming Kwai, Behrooz Parhami: Tight Bounds on the Diameter of Gaussian Cubes. 52-56
Cos S. Ierotheou, C.-H. Lai, C. J. Palansuriya, K. A. Pericleous: Simulation of 2-D Metal Cutting by Means of a Distributed Algorithm. 57-63

Martyn Thomas: Myths of the Year 2000. 67-70
Christopher B. Jones, J. Mark Ware: Proximity Search with a Triangulated Spatial Model. 71-83
Peter Bodorik, Dawn N. Jutla: Multi-View Memory Support to Operating Systems in Locking for Transaction and Database Systems. 84-97
Bryan F. Jones, David E. Eyres, H.-H. Sthamer: A Strategy for Using Genetic Algorithms to Automate Branch and Fault-Based Testing. 98-107
Akhil Kumar, Noha Adly: HPP: A Reliable Causal Broadcast Protocol for Large-Scale Replication. 108-124
Woei-Jiunn Tsaur, Shi-Jinn Horng: Establishing Secure Ethernet LANs Using Intelligent Switching Hubs in Internet Environments. 125-133

Roberto De Prisco, Alfredo De Santis: On the Data Expansion of the Huffman Compression Algorithm. 137-144
Antonino Mazzeo, Nicola Mazzocca, Stefano Russo, Carlo Savy, Valeria Vittorini: Formal Specification of Concurrent Systems: A Structured Approach. 145-162
Anton Biasizzo, Alenka Zuzek, Franc Novak: Sequential Diagnosis with Asymmetrical Tests. 163-170
Leqiang Bai, Hiroyuki Ebara, Hideo Nakando, Hajime Maeda: Fault-Tolerant Broadcasting on the Arrangement Graph. 171-184
Jamel Tayeb, Özgür Ulusoy, Ouri Wolfson: A Quadtree-Based Dynamic Attribute Indexing Method. 185-200
Alois Panholzer, Helmut Prodinger: Towards a More Precise Analysis of an Algorithm to Generate Binary Trees: A Tutorial. 201-204

Jie Wu, Eduardo B. Fernández, Donglai Dai: Optimal Fault-Secure Scheduling. 207-222
Keqin Li: Optimizing Average Job Response Time via Decentralized Probabilistic Job Dispatching in Heterogeneous Multiple Computer Systems. 223-230
I-Chen Wu, Loon-Been Chen: On Detection of Bounded Global Predicates. 231-237
Savio S. H. Tse, Francis C. M. Lau: More on the Efficiency of Interval Routing. 238-242
Ing-Ray Chen, Tsong-Min Chen, Chiang Lee: Performance Evaluation of Forwarding Strategies for Location Management in Mobile Networks. 243-253
Shun-Shii Lin, Shan-Tai Chen: On Detecting Multiple Faults in Baseline Interconnection Networks. 254-269
Khaled A. S. Abdel-Ghaffar: Detecting Substitutions and Transpositions of Characters. 270-277

W. Paul Cockshott, Douglas R. McGregor, John Wilson: High-Performance Operations Using a Compressed Database Architecture. 283-296
Maarten van Steen, Franz J. Hauck, Gerco Ballintijn, Andrew S. Tanenbaum: Algorithmic Design of the Globe Wide-Area Location Service. 297-310
Theo P. van der Weide, T. W. C. Huibers, Patrick van Bommel: The Incremental Searcher Satisfaction Model for Information Retrieval. 311-318
Stuart G. Hoggar, Lindsey Menzies: Fractal Compression and the Jigsaw Property I. 319-336
Roberto Baldoni, Roberto Beraldi, Ravi Prakash: Slotted-FIFO Communcation for Asynchronous Distributed Systems. 337-349
Robert M. Hierons: Adaptive Testing of a Deterministic Implementation Against a Nondeterministic Finite State Machine. 349-355

Michael Prasse, Peter Rittgen: Why Church's Thesis Still Holds. Some Notes on Peter Wegner's Tracts on Interaction and Computability. 357-362
Hugh Robinson, Patrick A. V. Hall, Fiona Hovenden, Janet Rachel: Postmodern Software Development. 363-375
Sanjay Kumar Madria: Handling of Mutual Conflicts in Distributed Databases Using Timestamps. 376-385
Declan P. Kelly: ARC: A Specification Language for Communicating Systems. 386-401
Kelvin Kam Wing Chu, Sze Kin Lam, Man Hon Wong: An Efficient Hash-Based Algorithm for Sequence Data Searching. 402-415
Zbigniew J. Czech: Quasi-Perfect Hashing. 416-421
Erkki Mäkinen: Binary Tree Code Words as Context-Free Languages. 422-424

R. Benjamin, B. Gladman, Brian Randell: Protecting IT Systems from Cyber Crime. 429-443
Harold W. Thimbleby, Stuart Anderson, Paul A. Cairns: A Framework for Modelling Trojans and Computer Virus Infection. 444-458
Luc Moreau, Wendy Hall: On the Expressiveness of Links in Hypertext Systems. 459-473
Pasi Fränti, Timo Hatakka: Context Model Automata for Text Compression. 474-485
Stuart E. Mitchell, Andy J. Wellings, Alexander B. Romanovsky: Distributed Atomic Actions in Ada 95. 486-502
Andrea Sanna, Paolo Montuschi, Massimo Rossi: A Flexible Algorithm for Multiprocessor Ray Tracing. 503-516

Special Issue on Clustering and Classification

Boris Mirkin: Least-Squares Structuring, Clustering and Data Processing Issues. 518-536
Y. H. Li, Anil K. Jain: Classification of Text Documents. 537-546
Valerie J. Gillet, David J. Wild, Peter Willett, John Bradshaw: Similarity and Dissimilarity Methods for Processing Chemical Structure Databases. 547-558
Ryuichi Oka: Spotting Method for Classification of Real World Data. 559-565
Lawrence Hubert, Phipps Arabie, Jacqueline J. Meulman: The Representation of Symmetric Proximity Data: Dimensions and Classifications. 566-577
Chris Fraley, Adrian E. Raftery: How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis. 578-588
Dian I. Witter, Michael W. Berry: Downdating the Latent Semantic Indexing Model for Conceptual Information Retrieval. 589-601
Chris S. Wallace: Intrinsic Classification of Spatially Correlated Data. 602-611