The Computer Journal, Volume 40, 1997

Volume 40, Number 1, 1997

Peter Cochrane: From Copper to Glass: the Right Idea, Decisions and Investments at the Right Time. 1-11
D. G. Patrick, P. R. Green, T. A. York: OCCAM- and C-Based Multiprocessor Environments for UNIX Cluster. 12-21
Panayiotis Bozanis, Nectarios Kitsios, Christos Makris, Athanasios K. Tsakalidis: New Results on Intersection Query Problems. 22-29
Wen-Jiin Tsai, Suh-Yin Lee: Multi-Partition RAID: A New Method for Improving Performance of Disk Arrays under Failure. 30-42
Edward Chan, Daoxu Chen, Jiannong Cao, Chan-Hee Lee: Timing Properties of the FDDI-M Medium Access Protocol. 43-49
Xindong Wu: Hybrid Interpretation of `No Match' and `Multiple Match' in Induction. 50-57

John G. Cleary, W. J. Teahan: Unbounded Length Contexts for PPM. 67-75
Suzanne Bunton: Semantically Motivated Improvements for PPM Variants. 76-93
Hidetoshi Yokoo: Data Compression Using a Sort-Based Similarity Measure. 94-102
Craig G. Nevill-Manning, Ian H. Witten: Compression and Explanation Using Hierarchical Grammars. 103-116
Shmuel T. Klein: Efficient Optimal Recompression. 117-126
Nasir D. Memon, Xiaolin Wu: Recent Developments in Context-Based Predictive Techniques for Lossless Image Compression. 127-136
James A. Storer, Harald Helfgott: Lossless Image Compression by Block Matching. 137-145
Paul G. Howard: Text Image Compression Using Soft Pattern Matching. 146-156
Brendan J. Frey, Geoffrey E. Hinton: Efficient Stochastic Source Coding and an Application to a Bayesian Network Source Model. 157-165

Andrew M. Dearden, Michael D. Harrison: A Software Engineering Model for Case Memory System. 167-182
Alex Delis, Quang LeViet: Contemporary Access Structures under Mixed Workloads. 183-193
Fun Ting Chan, Tsong Yueh Chen, Jeng Kei Mak, Shir Ming Shen: On Some Properties of the Optimally Refined Proportional Sampling Strategy. 194-199
Pranay Chaudhuri: An Optimal Distributed Algorithm for Computing Bridge-Connected. 200-207
Fredrik Dahlgren, Per Stenström, Mårten Björkman: Reducing the Read-Miss Penalty for Flat COMA Protocols. 208-219
Robert M. Hierons: Testing from a Finite-State Machine: Extending Invertibility to Sequences. 220-230

Robert M. Colomb: Impact of Semantic Heterogeneity and Federating Databases. 235-244
Fernando de Ferreira Rezende, Theo Härder, Jan Zielinski: Transaction Identifiers in Nested Transactions: Implementation Schemes and Performance. 245-258
Tommaso Bolognesi: Expressive Flexibility of a Constraint-Oriented Notation. 277-259
Limin Xiang, Changjie Tang, Kazuo Ushijima: Grammar-Oriented Enumeration of Binary Trees. 278-291
Ziya Arnavut, Spyros S. Magliveras: Lexical Permutation Sorting Algorithm. 292-295

Hyuk-Jae Lee, José A. B. Fortes: Communication-Minimal Partitioning and Data Alignment for Affine Nested Loops. 302-310
Steven Novack, Alexandru Nicolau: Resource Directed Loop Pipelining: Exposing Just Enough Parallelism. 311-321
Jialin Ju, Vipin Chaudhary: Unique Sets Oriented Parallelization of Loops with Non-Uniform Dependences. 322-339
Sharad Singhai, Kathryn S. McKinley: A Parametrized Loop Fusion Algorithm for Improving Parallelism and Cache Locality. 340-355
Michal Cierniak, Mohammed Javeed Zaki, Wei Li: Compile-Time Scheduling Algorithms for a Heterogeneous Network of Workstations. 356-372
Dattatraya Kulkarni, Michael Stumm: Linear and Extended Linear Transformations for Shared-Memory Multiprocessors. 373-387
Balaram Sinharoy: Optimized Thread Creation for Processor Multithreading. 388-400

Hong Va Leong, Antonio Si: Database Caching Over the Air-Storage. 401-415
Evan P. Harris, Kotagiri Ramamohanarao: Optimal Clustering of Relations to Improve Sorting and Partitioning for Joins. 416-434
Yi Pan, Jerry L. Trahan, Ramachandran Vaidyanathan: A Scalable and Efficient Algorithm for Computing the City Block Distance Transform on Reconfigurable Meshes. 435-440
Kshirasagar Naik: Designing Reliable Test Architectures for Communication Protocols. 441-456
Marlin H. Mickle: An Electrical Circuit and Computer System Analogy. 457-462

K. Mani Chandy, Adam Rifkin: Systematic Composition of Distributed Objects: Processes and Sessions. 465-478
Andry Rakotonirainy, Andrew Berry, Stephen Crawley, Zoran Milosevic: Describing open Distributed Systems: A Foundation. 479-488
Richard B. Kilgore, Craig M. Chase: Testing Distributed Programs Containing Racing Messages. 489-498
Thomas Kunz, James P. Black, David J. Taylor, Twan Basten: Poet: Target-System Independent Visualizations of Complex Distributed-Application Executions. 499-512
Vinny Cahill, Paddy Nixon, Brendan Tangney, Fethi A. Rabhi: Object Models for Distributed or Persistent Programming. 513-527

Siu-Wah Lau, John C. S. Lui: Designing a Hierarchical Multimedia Storage Server. 529-540
Ching-Kuang Shene: An Analysis of Two In-Place Array Rotation Algorithms. 541-546
Pasi Fränti, Juha Kivijärvi, Timo Kaukoranta, Olli Nevalainen: Genetic Algorithms for Large-Scale Clustering Problems. 547-554
Andrea Sanna, Paolo Montuschi, Antonio Fisone, Bartolomeo Montrucchio: A New Algorithm for the Rendering of CSG Scenes. 555-564
Edmund K. Burke, Kirk Jackson, Jeffrey H. Kingston, Rupert F. Weare: Automated University Timetabling: The State of the Art. 565-571
Loe M. G. Feijs, Michel A. Reniers: Lazy Functional Programs in a Concurrent Environment. 572-584

David T. Caminer: LEO and its Applications: The Beginning of Business Computing. 585-597
Dag I. K. Sjøberg, Ray Welland, Malcolm P. Atkinson: Software Constraints for Large Application Systems. 598-616
Derrick Morris, D. Garet Evans, Simon Schofield: Simulating the Behaviour of Computer Systems: Co-Simulation of Hardware/Software. 617-629
Sanjay Kumar Madria: A Study of the Concurrency Control and Recovery Algorithms in Nested Transaction Environment. 630-639
Olaf Müller, Konrad Slind: Treating Partiality in a Logic of Total Functions. 640-652