A new sorting algorithm is presented. Its running time is O(n(1+10g(F/n)) where F = I{(f,j); i < j and xi < xj}1 is the total number of inversions in the input sequence xn xn_1 xn_2 ... x2 xl· In other words, presorted sequences are sorted quickly, and completely unsorted sequences are sorted in O(n log n) steps. Note that F < n2/2 always. Furthermore, the constant of proportionality is fairly ...

17 Claire Panosian Dunavan, emeritus professor of Medicine, University of California, Los Angeles, School of Medicine, is a co-founder of UCLA’s Program in Global Health and a medical writer who frequently contributes to the Los Angeles Times, Scientific American, and Discover magazine. Sherman Mellinkoff (AΩA, Stanford University, 1944), emeritus professor of Medicine and emeritus dean of the ...

Renewal-anomalous-heterogeneous files are solved. A simple file is made of Brownian hard spheres that diffuse stochastically in an effective 1D channel. Generally, Brownian files are heterogeneous: the spheres’ diffusion coefficients are distributed and the initial spheres’ density is non-uniform. In renewal-anomalous files, the distribution of waiting times for individual jumps is exponential ...

1. Introduction and Motivation Conventional access methods cannot be effectively used in large Scientific/Statistical Database (SSDB) applications. A file structure (called bit transposed file) is proposed which offers several attractive features that are better suited for the special characteristics that SSDBs exhibit. This file structure is an extreme version of the (attribute) transposed fil...

In this article we describe the CEP package for compressing EPS files. It belongs to the public domain and was released at the GUST meeting in Bachotek, 1997. The amount of disk space occupied by bitmap graphics is a well-recognized problem. For example, a 300 dpi picture (A4) contains ca 8700000 pixels; assuming that each CMYK pixel occupies four bytes, one obtains ca 35MB of disk space needed...

Stand-alone ranking systems based on highly optimized inverted file structures are generally considered ‘the’ solution for building search engines. Observing various developments in software and hardware, we argue however that IR research faces a complex engineering problem in the quest for more flexible yet efficient retrieval systems. We propose to base the development of retrieval systems on...

Computers generate trace files containing reports on system performance, status, and faults. To analyze these trace files more efficiently, we have developed a graphical technique embodied in an interactive system for displaying large trace files. Our system uses abstraction, color, aggregation, filtering, interaction, and a drill-down capability to find patterns among the reports. We apply our...

This paper describes a tool for recombining the logical structure from an XML document with the typeset appearance of the corresponding PDF document. The tool uses the XML representation as a template for the insertion of the logical structure into the existing PDF document, thereby creating a Structured/Tagged PDF. The addition of logical structure adds value to the PDF in three ways: the acce...