Showing papers on "Sorting published in 1970"

Sorting things out.

Abstract: However, I just can’t bring myself to throw away the very old handwritten glossaries from the pre-laptop days when I didn't bother to type them simply didn't have time with small children to care for or they dealt with one-off subjects so varied in nature that I can’t classify them in any way other than ‘miscellaneous’. Who knows, I might just get a second meeting on cork trees, water filters or cross-stitching! It seems to me that if I were offered such a meeting I would remember that I have a glossary somewhere in that big loose-leaf binder called 'miscellaneous'.

Samplesort: A Sampling Approach to Minimal Storage Tree Sorting

Abstract: The methods currently in use and previously proposed for the choice of a root in minimal storage tree sorting are in reality methods for making inefficient statistical estimates of the median of the sequence to be sorted. By making efficient use of the information in a random sample chosen during input of the sequence to be sorted, significant improvements over ordinary minimal storage tree sorting can be made.A procedure is proposed which is a generalization of minimal storage tree sorting and which has the following three properties: (a) There is a significant improvement (over ordinary minimal storage tree sorting) in the expected number of comparisons required to sort the input sequence. (b) The procedure is statistically insensitive to bias in the input sequence. (c) The expected number of comparisons required by the procedure approaches (slowly) the information-theoretic lower bound on the number of comparisons required. The procedure is, therefore, “asymptotically optimal.”

Sorting in a paging environment

Abstract: This sorting study was part of an extensive measurement project undertaken on the M44/44X, an experimental paging system which was conceived and implemented at IBM Research in order to explore the virtual machine concept. The study was concerned with the implementation of sorting procedures in the context of the dynamic paging environment characteristic of virtual memory machines. Descriptions of the experimental sort programs and analysis of the performance measurement results obtained for them are presented. The insight gained from the experimental effort is used to arrive at a set of broad guidelines for writing sort programs for a paging environment.

The Bose-Nelson Sorting Problem

Abstract: : Comparison/exchange modules can be combined to construct networks capable of sorting elements into nondecreasing order. In the paper one considers combinatorial properties of such networks, and we determine the minimum number of modules required to sort eight or less elements. (Author)

Algorithms 402: Increasing the efficiency of quicksort

Abstract: i n t e g e r p r o c e d u r e eprimes(m, PR, P I ) ; v a l u e m; i n t e g e r m; i n t e g e r array PR, PI ; c o m m e n t The procedure generates the complex prime numbers located in the one-eighth plane defined by 0 < y < x. Any prime found in t h a t area has seven more associated primes: x + yi, x yi, ± y ± xi. These associated primes mus t be genera ted external ly to cprimes. The first complex prime genera ted by cprimes is 1 + i, which exceptional ly lies on x = y and has only three associated primes. The a lgor i thm generates a l ist of complex primes in order of increasing modulus: the parameter m of the call is the highest modulus to be included in the list and should sat isfy m > 2. PR and P I will conta in respect ively the real and imaginary par ts of the genera ted list, wi th PR _> P I > 0 for each prime. The value of the procedure is the number of primes generated. Algor i thm 311 [1], sieve 2, is used to generate the ra t ional primes less t h a n mL Then it is known (see, for ins tance [2]) t ha t a ra t ional prime p of the form p = 4n -b 1 can be expressed as p = a 2 -4b 2, and factorized as (a+bi)(a--bi) in the complex plane, where a + bi and a bi are complex primes. For our present purpose we choose a > b and include only a 4bi in the list. A ra t ional prime p of the form p = 4n + 3 remains prime in the complex plane, so we include p + 0i in the l ist if p < m. Finally, the complex prime 1 + i may be though t of as one of the factors of the remaining ra t ional prime 2 = ( 1 + i ) ( 1 i ) . Al though this a lgor i thm and Algor i thm 372 [3] are not direct ly comparable, since they produce the list of complex primes in a different order, the accompanying remark suggests t h a t the present a lgor i thm is of ten to be preferred. REFERENCES : 1. CHARTRES, B . A . Algor i thm 311, Pr ime number genera tor 2. Comm. A C M 10 (Sept. 1967), 570. 2. HARDY, G. H., AND E. M. WRIGHT. A n Introduction to the Theory of Numbers, 4th ed. Clarendon Press, Oxford, 1965, Chs X I I and XV. 3. DUNI~AM, K. B. Algori thm 372, An Algor i thm to produce complex primes, CSIEVE. Comm. A C M 18 (Jan. 1970), 52-53; b e g i n i n t e g e r a, b, e, d, e, i, j , p, q; i n t e g e r array P2[1:0.7Xm T 2~In(m)], P3[1 : 1 .4Xm/ln(m)] ; e := sieve 2 (m~2 , P2); PR[1] := PI[1] := a := c := i ; b : = 0 ; for d := 2 s t e p 1 u n t i l e do b e g i n p := P2[d]; q := p 1; i f (q+4) X 4 ~ q t h e n b e g i n i f p < m t h e n LI: b e g i n b := b -41; e n d else b e g i n P3[b] := p e n d

Automatic classification of plants based on information content

Abstract: An information theory model is described and its application is illustrated by an actual example. Classification is accomplished in two stages. The first stage includes cluster analysis of a random sample by an agglomerative method. Cluster analysis is followed by nearest neighbor sorting in the second stage whereby the clustering results are imposed on a second random sample of the same collection. The advantage of the procedure resides in the fact that large samples can be handled, and also, the classification produced in the second stage can be used, under specific restrictive assumptions, for unbiased prediction of different population properties. While the present paper is principally concerned with the technique itself, some taxonomic conclusions are also given.

Apparatus using air jets for sorting by weight

Abstract: An inexpensive rapid-response check weigher for separate removal of underweight/overweight packets which may contain potato crisps for example. The packets are of light weight and after weighing are removed by air jets in one of two directions depending on their weight. The apparatus is designed for cooperation with a conveyor which feeds it with a series of packets one by one in rapid succession.

A phenomenon in the theory of sorting

Abstract: The proof that a proposed sorting method actually works frequently involves the observation that certain operations preserve the order introduced by previous operations. T h e present paper gives a unified treatment of this order-preservation phenomenon. A number of results about sorting networks and other sorting methods, previously proved in an ad hoc manner, are immediate consequences of our theorems. T h e following examples will serve to introduce the phenomenon.

Document sorting system

Abstract: A magnetic ink character reader/sorter having improved means for processing the character signals, storing the pocket selection control signals derived therefrom, and checking the overall operation of the machine. The documents are read by an improved single-gap recognition system, and the sorting information derived therefrom is supplied to a plurality of buffers in accordance with control signals derived from the motion of a document transport.

A variation on sorting by address calculation

Abstract: The principles of address calculation and merging are combined to yield an efficient sorting technique. Detailed flowcharts of the most important program steps are included. The characteristics of the proposed sort are discussed.

Process for inspecting printed tablets and capsules using color responsive sorting machines

Abstract: Process for inspecting printed tablets and capsules using colorresponsive sorting machines in which tablets having a coating of one color are printed with an ink of a contrasting color which corresponds to the background color against which the tablets or capsules are viewed in the viewing chamber of the colorresponsive sorting machine. In this way foreign tablets are rejected.

Fastener sorting apparatus

Abstract: A sorting apparatus for detecting improperly-shaped fasteners, for example, nails, screws or the like, within a row of properly shaped fasteners and segregating and then expelling these improper fasteners from the proper fasteners.

Signal sorting system

Abstract: A signal sorting system having a signal summer for vectorially subtracting from input signals estimate signals of the input signals to provide error signals at its output, and a plurality of signal extractors connected to the signal summer and responsive to the error signals for providing the estimate signals.

Method of and means for processing mail

Abstract: A method of processing mail is disclosed in which the mail is separated into categories by physical characteristics for processing regardless of the class thereof. A facility particularly adapted for processing mail in categories by physical characteristics is described including means for transporting, sorting and storing mail in each of such categories and subsequently releasing mail of all categories for a given destination for pickup by a carrier.

Device for the movement of articles with a flat,rigid,holding surface

Abstract: A device for conveying articles along a working plane provided with openings distributed over and movable in the plane and connected to a vacuum source, and including systems comprising combinations of such devices alone and with conventional conveyors, all to provide means for moving, conveying, sorting, distributing, and classifying articles. The device and systems thereof is useful, for example, in handling baggage and packages.

The Use of Information in Sorting

Abstract: The information-gathering aspect of sorting is considered from a theoretical viewpoint. A large class, R, of sorting algorithms is defined, based on the idea of information use. Properties of this algorithm class are developed, and it is noted that several well-known sorting algorithms are closely related to algorithms in R. The Binary Tree Sort is shown to be in R and to have unique properties in this class. A vector is defined which characterizes the information-gathering efficiency of the algorithms of R. Finally, a more general class of algorithms is defined, and some of the definitions extended to this class. Two intriguing conjectures are given which appear to require graph theory or combinatorial topology for their solution.

Measuring and sorting apparatus

Abstract: A method of and an apparatus for measuring and sorting articles is provided having a plurality of sensors that are responsive to the presence and absence of light. Non-diverging coherent light is projected against the sensors. The articles to be measured and/or sorted are guided through the light intermediate the source of the light and the sensors. In response to the sequence in which the sensors are shaded, a given dimension of the article may be readily determined. Based upon the determined dimension, each article may be deflected into one of a number of containers.

Remark on algorithm 347: An efficient algorithm for sorting with minimal storage

Abstract: 7. Summary We have introduced a formalism which allows us to explicate certain rather gross properties of language processing systems. As it is, the notation should be useful for designing the outlines of complex programming systems and their implementation, and it should be especially good for documentation. The formalism should also provide a mathematical basis which can be extended to handle more detailed properties of such systems. Some specific inadequacies where it could be extended follow. 1. It does not describe the amount of compilation or interpretation, unless it is coupled with precise definitions of the languages involved. For instance, in (7) we have no idea whether IL is close to machine language or to the source language. IL could be little more than assembly language, or just a trivial modification of the source language , or anything in between. Of course precise definitions of SL, IL, and ML would clear this up. 2. It does not permit the description of such processes as incremental compilation. 3. It does not permit the formal description of systems involving programs which consist of two or more pieces written in different languages, such as FSL. Acknowledgment. We have benefitted from comments by J. Gray and J. Reynolds in preparing this paper.

Edge feed transport system for document sorting and stacking

Abstract: The invention pertains to a document transport and sorting system utilizing an edge feed concept for transporting documents, one at a time, on unique document carriers, from a loading station to a plurality of unloading stations. At the unloading stations the documents are removed from the transport means and selectively deposited in a plurality of stackers.

Two stage sorting system using two-line sorting switches

Abstract: A partial sorting system utilizing two-line sorting switches for applications where the order of numbers changes slowly with respect to sorting frequency. By using only two stages of sorting and making sorting passes at a relatively high frequency, large reductions in required hardware are obtained while still having a completely sorted output during the major portion of normal system operation.

Efficiency measurement of distributed statistical sorting algorithms

Abstract: This paper presents the evaluation results of a distributed sorting algorithm which was presented by the authorsflO]. The evaluation is done by simulation. The algorithm makes use of the statistical properties of the data file. The objective of the algorithm is to minimize the number of messages required for the whole sorting process. The algorithm is designed to sort a very large file which is physically distributed over many sites (work-stations). The file size is so large that it is not feasible to transfer all data to a single node as no node has sufficient memory space for internal sorting. The sorting work will be shared by all sites involved and data will be sent along the lines communicating in bulk.

Evaluation of unconstrained sorting data

Abstract: Two statistics are offered for evaluating unconstrained sorting performance in a specific task when categories are E-defined. One statistic is based upon empirically estimated sampling distributions and can be used for determining sorting performance significantly deviant from chance for any number of S-defined categories; the second statistic can be used to evaluate consistencies between S- and E-defined categories, regardless of the number of categories used by S. The present procedure provides a statistical basis for evaluation of performance where no adequate evaluation procedures are now available.

Cutting, sorting and storing device

Abstract: A device for receiving plated memory wire for use in precision applications and cutting the wire into desired length, sorting out the wire lengths that are acceptable and storing the acceptable lengths into plastic tubes where they will be free from contamination, and will not be handled by humans. The machine utilizes a bandolier of storage tubes that sequentially pass through a wire cutting station so that acceptable wires are inserted into the tubes, and the rejects are kept out of the tubes. The machine is designed for placement into a closed loop, in line plated wire system so that the wire lengths are not touched even during the storage operation.