Showing papers on "Sorting published in 1992"
TL;DR: This work simulates the sorting of a mixture of two types of biological cells using a modified version of the large-Q Potts model with differential adhesivity and finds long-distance cell movement leading to sorting with a logarithmic increase in the length scale of homogeneous clusters.
Abstract: We simulate the sorting of a mixture of two types of biological cells using a modified version of the large-Q Potts model with differential adhesivity. We find long-distance cell movement leading to sorting with a logarithmic increase in the length scale of homogeneous clusters. Sorted clusters then round. We find two successive phases: A rapid boundary-driven creation of a low-cohesivity cell monolayer around the aggregate, and a slower boundary-independent internal rearrangement.
1,296 citations
TL;DR: This survey presents the basic notions and concepts of adaptive sorting, the demonstration that several algorithms currently in use are adaptive, and the development of new algorithms, similar to currently used algorithms that perform competitively on random sequences and are significantly faster on nearly sorted sequences.
Abstract: The design and analysis of adaptive sorting algorithms has made important contributions to both theory and practice. The main contributions from the theoretical point of view are: the description of the complexity of a sorting algorithm not only in terms of the size of a problem instance but also in terms of the disorder of the given problem instance; the establishment of new relationships among measures of disorder; the introduction of new sorting algorithms that take advantage of the existing order in the input sequence; and, the proofs that several of the new sorting algorithms achieve maximal (optimal) adaptivity with respect to several measures of disorder. The main contributions from the practical point of view are: the demonstration that several algorithms currently in use are adaptive; and, the development of new algorithms, similar to currently used algorithms that perform competitively on random sequences and are significantly faster on nearly sorted sequences. In this survey, we present the basic notions and concepts of adaptive sorting and the state of the art of adaptive sorting algorithms.
241 citations
24 Aug 1992
TL;DR: Two new “up-to” techniques for reducing the size of the relation needed to define a bisimulalion are proposed, respectively based on the use of expansion and of almost-weak bisimulation.
Abstract: “Bisimulation up to” is a technique for reducing the size of the relation needed to define a bisimulalion. It works smoothly in the strong case, where it was first introduced ([4]). But this does not directly generalize to the weak case, as erroneously reported in [4]. To overcome this problem, two new “up-to” techniques are proposed: They are respectively based on the use of expansion ([1]) and of almost-weak bisimulation. The second solution is more general than the first one, but expansion enjoys a nicer mathematical treatment. The usefulness and generality of the solutions is motivated with non-trivial examples: two different implementations of a sorting machine.
191 citations
TL;DR: It is speculated that people do not simply assimilate probabilistic structures but rather organize them in terms of discrete structures plus noise.
133 citations
[...]
01 Jan 1992
TL;DR: The chapter presents the algorithm and analysis based on the word model, in which comparison and transmission of full words are accomplished in a single step, and only the number of word steps is counted.
Abstract: This chapter provides an overview of arrays and trees, which are known as the simplest networks for parallel computation. A linear array is the simplest example of a fixed-connection network. Each processor in the array has a local program control and local storage. However, the complexity of the local program control and the size of the local storage may vary. The algorithm for sorting can be described in terms of a simple program executed by each processor, irrespective of its position within the array. The chapter presents the algorithm and analysis based on the word model, in which comparison and transmission of full words are accomplished in a single step, and only the number of word steps is counted. The chapter also explains matrix algorithms, which are easy to implement on arrays and trees consisting of simple word processors such as, adders, multipliers, and dividers.
125 citations
IBM1
TL;DR: A deterministic O(log N)-time algorithm for routing an aribitrary permutation on an N-processor bounded-degree network with bounded buffers is presented in this paper, which does not use the sorting network of Ajtai, et al.
Abstract: A deterministic O(log N)-time algorithm for the problem of routing an aribitrary permutation on an N-processor bounded-degree network with bounded buffers is presented.Unlike all previous deterministic solutions to this problem, our routing scheme does not reduce the routing problem to sorting and does not use the sorting network of Ajtai, et al. [1]. Consequently, the constant in the run time of our routing scheme is substantially smaller, and the network topology is significantly simpler.
123 citations
TL;DR: The optimal sorting algorithm is randomized and is based upon the probabilistic partitioning technique developed in the companion paper for optimal disk sorting in a two-level memory with parallel block transfer.
Abstract: In this paper we introduce parallel versions of two hierarchical memory models and give optimal algorithms in these models for sorting, FFT, and matrix multiplication. In our parallel models, there are $P$ memory hierarchies operating simultaneously; communication among the hierarchies takes place at a base memory level. Our optimal sorting algorithm is randomized and is based upon the probabilistic partitioning technique developed in the companion paper for optimal disk sorting is a two-level memory with parallel block transfer. The probability of using $\ell$ times the optimal running time is exponentially small in $\ell$(log $\ell$)log $P$.
119 citations
Patent•
05 May 1992
TL;DR: In this article, an electronic tag which has a facility for storing delivery information and is equipped with a responding means for transmitting the delivery information stored therein in response to a query signal received from an interrogating apparatus is presented.
Abstract: An electronic device intended for use as a tag to be attached to identify contents of the container to which it is attached. In particular, the present invention relates to an electronic tag which has a facility for storing delivery information and is equipped with a responding means for transmitting the delivery information stored therein in response to a query signal received from an interrogating apparatus. Codes, including items such as the names and addresses of the destination and the sender, and a sorting code are written into predetermined blanks of a delivery label, and into a memory. The memory responds to a query by transmitting the sorting information to allow automated sorting. The tag may be initiated only when torn, to extend battery shelf life.
90 citations
01 Mar 1992
TL;DR: The presented algorithm satisfies the AT/Sup 2/ lower bound of Omega (n/sup 2/) for sorting n numbers in the word model of VLSI for optimal sorting on the reconfigurable mesh.
Abstract: An optimal sorting algorithm on the reconfigurable mesh is proposed. The algorithm sorts n numbers in constant time using n*n processors. The best known previous result uses O(n*nlog/sup 2/n) processors. The presented algorithm satisfies the AT/sup 2/ lower bound of Omega (n/sup 2/) for sorting n numbers in the word model of VLSI. Modification to the algorithm for area-time trade-off is shown, to achieve AT/sup 2/ optimality over 1 >
87 citations
01 Jun 1992
TL;DR: Two algorithms are described for making the index-build operations restartable, without loss of all work, in case a system failure were to interrupt the completion of the creation of the index.
Abstract: As relational DBMSs become more and more popular and as organizations grow, the sizes of individual tables are increasing dramatically. Unfortunately, current DBMSs do not allow updates to be performed on a table while an index (e.g., a B+-tree) is being built for that table, thereby decreasing the systems' availability. This paper describes two algorithms in order to relax this restriction. Our emphasis has been to maximize concurrency, minimize overheads and cover all aspects of the problem. Builds of both unique and nonunique indexes are handled correctly. We also describe techniques for making the index-build operations restartable, without loss of all work, in case a system failure were to interrupt the completion of the creation of the index. In this connection, we also present algorithms for making a long sort of operation restartable. These include algorithms for the sort and merge phases of sorting.
87 citations
Patent•
18 Mar 1992TL;DR: In this article, a system for sorting particles is arranged such that the presence or absence of multiple parameters is determined for each particle in a flow of particles, and a logic condition is determined based on the multiple parameters.
Abstract: A system for sorting particles is arranged such that the presence or absence of multiple parameters is determined for each particle in a flow of particles, and a logic condition is determined based on the multiple parameters Thereafter, particles are outputted from the system when the logic condition is present Accordingly, multiparameter high-speed measurements of a rare subpopulation of particles (eg biological cells) can be made amidst a larger population of particles with differing characteristics When attached to a multiparameter flow cytometer/cell sorter and microcomputer, the system allows multiparameter analysis of cells at rates in excess of 100,000 cells/sec This system can be an outboard module attached to a commercially available or home-built flow cytometer
Patent•
05 Jun 1992
TL;DR: In this article, the authors propose a method for sorting data in a computer data storage system that has particular advantages in implementing a key index tree structure using buffer-size substrings to sort strings of key records into a linked list structure.
Abstract: A method for sorting data in a computer data storage system that has particular advantages in implementing a key index tree structure. The sorting method uses buffer-size substrings to sort strings of key records into a linked list structure that can be directly transformed into an index tree. The sorting method also may be used for sorting large sets of data records in place on a computer storage system. The method further integrates prefix compression and suffix compression of key records with the sorting method to reduce the number of input/output operations required to create a more compact key index tree structure.
TL;DR: A number of rendering algorithms in computer graphics sort 3D objects by depth and assume that there is no cycle that makes the sorting impossible as discussed by the authors, and one way to resolve the problem caused by cycles is to cut the objects into smaller pieces.
Abstract: A number of rendering algorithms in computer graphics sort three-dimensional objects by depth and assume that there is no cycle that makes the sorting impossible. One way to resolve the problem caused by cycles is to cut the objects into smaller pieces. The problem of estimating how many such cuts are always sufficient is addressed. A few related algorithmic and combinatorial geometry problems are considered. >
TL;DR: The algorithms derivation is achieved by replacing the input/output relation of the filter involving sorting operations, by an implicit formulation using only sign functions, and one of their major advantages is their simplicity.
Patent•
14 Aug 1992
TL;DR: In this paper, a letter sorting apparatus consisting of a sorting machine, an automatic storage and retrieval system including a staging rack defining a plurality of staging locations, and a storage-and-retrieval machine which is positioned to receive letters from the sorting machine and to present letters for input to the sorting machines is presented.
Abstract: A letter sorting apparatus comprising a letter sorting machine, and an automatic storage and retrieval system including a staging rack defining a plurality of staging locations, and a storage and retrieval machine which is positioned to receive letters from the sorting machine and to present letters for input to the sorting machine and which is operable to stage letters in and retrieve letters from the staging locations.
01 Jan 1992
TL;DR: A new sorting network with exactly the same size and depth as the odd-even sorting network is presented, and proceeds by first sorting pairs of bits and then sorting the pairs into lexicographic order.
Abstract: A new sorting network with exactly the same size and depth as the odd-even sorting network is presented. This sorting network is designed using the zero-one principle, and proceeds by first sorting pairs of bits and then sorting the pairs into lexicographic order.
Patent•
10 Sep 1992
TL;DR: In a coin sorting device which rolls a coin along a sorting passage and which carries out a sorting operation for the coin during movement of the coin, it is readily possible to remove unnecessary material from the sorting passage as mentioned in this paper.
Abstract: In a coin sorting device which rolls a coin along a sorting passage and which carries out a sorting operation for the coin during movement of the coin, it is readily possible to remove unnecessary material from the sorting passage. The unnecessary material may be surface material which is separated from the coin. If the unnecessary material is left in the sorting passage, it becomes one of factors which cause an error in the sorting operation. Inasmuch as the unnecessary material can be readily removed from the sorting passage, reliability is improved as regards the sorting operation. For removing the unnecessary material, a plurality of through holes may be made to a bottom of the sorting passage. A roller member may be used at the bottom of the sorting passage instead of making the through holes.
Patent•
03 Apr 1992TL;DR: In this article, a method and apparatus for flexibly controlling sorting decisions for a flow cytometer or similar instrument at a purity vs. yield ratio of sorted particles, particularly at high event rates, is presented.
Abstract: This invention relates to a method and apparatus for flexibly controlling sorting decisions for a flow cytometer or similar instrument at a purity vs. yield ratio of sorted particles, particularly at high event rates. The system monitors distances between sequential objects to determine if they are in close enough proximity to be within a single resolution unit of the sorting device. The "friend" or "foe" status of neighboring events is considered by this system in dealing with detected "coincident" events. The system operates on information of the desirability to sort the object, i.e. droplet, based upon the properties of the individual object. A storage and retrieval method is provided for making the information available at the time a sort operation based on a sorting logic condition is performed. Accordingly, an easily reconfigurable mode of operation control is provided to allow customized sorting strategies, based on the needs of individual applications or experiments. This system may be included as an integral part of a flow cytometer/cell sorter or similar instrument and may also be provided as an outboard module to such systems.
Patent•
13 Mar 1992
TL;DR: In this paper, a method for separating single plastic bottles from engaged interlocked bottle clusters comprising directing an air jet at an item sufficiently forceful to displace a single bottle to a collection means but insufficiently forceful to dislodge an interlocking bottle cluster is presented.
Abstract: A method of sorting plastic items by measuring the effect an item has on light directed at a stream of items from a light source, then selectively removing items from the stream based on a comparison of the light measured and the light emitted from the detector is provided. The invention also includes an apparatus for separating plastic items which comprises a light source, a detector for measuring the effect an individual item has on light emitted from the detector, and sortation means for selectively removing items from the stream based on a comparison of the light emitted by the light source and that measured at the detector. A method for separating single plastic bottles from engaged interlocked bottle clusters comprising directing an air jet at an item sufficiently forceful to displace a single bottle to a collection means but insufficiently forceful to displace an interlocked bottle cluster is also provided.
Patent•
04 Aug 1992
TL;DR: In this article, an apparatus for sorting differently identified articles, particularly for sorting different coloured gaming chips, is described. But it is not shown how to sort differently colored chips, and it cannot be used for sorting games.
Abstract: Apparatus is disclosed for sorting differently identified articles, particularly for sorting differently coloured gaming chips. The apparatus comprises transfer means (2) arranged to remove individual chips from a random store and transfer them to a conveyor (19). The conveyor carries the chips first to sensing means arranged to sense the identifiable characteristic of the chip and then to a chip ejector (25) arranged to remove the chips from the conveyor and deposit them in a respective selected one of a plurality of receptacles (26) depending on the characteristic of the chip previously identified.
Book•
02 Jan 1992TL;DR: This chapter discusses algorithms for weighted and unweighted graphs, as well as models of Parallel Computation and its applications, and discusses the complexity of Parallel Algorithms.
Abstract: 1. Introduction and Background 2. Models of Parallel Computation 3. Complexity of Parallel Algorithms 4. Merging and Sorting 5. Selection and Searching 6. Matrix Computations 7. Algorithms for Unweighted Graphs 8. Algorithms for Weighted Graphs 9. Updating Algorithms for Graphs
24 Oct 1992
TL;DR: The authors give very fast randomised CRCW PRAM algorithms for several padded-sorting problems, and show how to padded-sort n independent random numbers in O(log/sub */n) time WHP with O(n) work, which matches a recent lower bound.
Abstract: Conventional parallel sorting requires the n input keys to be output in an array of size n, and is known to take Omega (log n/log log n) time using any polynomial number of processors. The lower bound does not apply to the more 'wasteful' convention of padded sorting, which requires the keys to be output in sorted order in an array of size (1+o(1))n. The authors give very fast randomised CRCW PRAM algorithms for several padded-sorting problems. Applying only pairwise comparisons to the input and using kn processors, where 2 >
Patent•
06 Mar 1992
TL;DR: A color sorting apparatus has a singulator section, a color sorter and a conveyor which drops the sorted objects into appropriate collection bins as discussed by the authors, where objects for sorting are transported on an endless conveyor on wheels through the singulation and color sorting section.
Abstract: A color sorting apparatus has a singulator section, a color sorter and a conveyor which drops the sorted objects into appropriate collection bins. Objects for sorting are transported on an endless conveyor on wheels through the singulation and color sorting section. An independently adjustable speed belt rotates in the same direction as the wheels and operates to provide a view of each of four sides of the object to an imaging device. The imaging device, such as a camera, supplies red, green and blue signals to an image processor which performs a color transformation and obtains a single composite hue value for each object or piece of fruit to be sorted. Based on a comparison of the hue value to user programmed grading criteria, signals are provided to the conveyor so that the objects are ultimately deposited in appropriate sorting bins.
01 Jun 1992
TL;DR: Optimal Sorting on Mesh-Connected Processor Arrays is studied to find the most efficient way to sort arrays based on the number of bits per array.
Abstract: Optimal Sorting on Mesh-Connected Processor Arrays
TL;DR: This paper presents a straightforward methodology to design the storage layout of a rack when such recurrent orders represent a high percentage of total turnover, and makes use of sorting, assignment, and travelling salesman like algorithms.
TL;DR: A system for on-line spike sorting that is implemented on an IBM PC/AT computer using commercially available hardware and C-language software and a new and highly versatile tool for generating appropriate wave forms for critical evaluation of sorter performance are described.
TL;DR: This work shows that by a modification of their method the stable0–1 sorting is possible inO(n) time andO(1) extra space and yields a stable minimum space quicksort, which sorts multisets in asymptotically optimal time with high probability.
Abstract: In the stable0–1 sorting problem the task is to sort an array ofn elements with two distinct values such that equal elements retain their relative input order. Recently, Munro, Raman and Salowe gave an algorithm which solves this problem inO(n log*n) time and constant extra space. We show that by a modification of their method the stable0–1 sorting is possible inO(n) time andO(1) extra space. Stable three-way partitioning can be reduced to stable0–1 sorting. This immediately yields a stable minimum space quicksort, which sorts multisets in asymptotically optimal time with high probability.
Patent•
06 Apr 1992
TL;DR: In this article, a currency sorting apparatus including a detector provided in a currency passage for detecting information necessary for discriminating the genuineness and the denominations of pieces of currency and outputting detection signals is described.
Abstract: A currency sorting apparatus including a detector provided in a currency passage for detecting information necessary for discriminating the genuineness and the denominations of pieces of currency and outputting detection signals, a plurality of currency accommodating boxes provided downstream of the detector, the number of which is greater than the number of denominations of the pieces of currency to be sorted, each of the currency accommodating boxes being adapted for accommodating genuine pieces of currency in accordance with their denominations, a controller adapted for selectively feeding pieces of currency into the currency accommodating boxes in accordance with the detection signals input from the detector and a sorting mode selector for selecting a sorting mode which determines what currency accommodating boxes accommodates what denomination of pieces of currency and outputs a corresponding sorting mode signal when the sorting mode is selected.