Showing papers on "Sorting published in 1995"

Exact and Approximation Algorithms for Sorting by Reversals, with Application to Genome Rearrangement

Abstract: Motivated by the problem in computational biology of reconstructing the series of chromosome inversions by which one organism evolved from another, we consider the problem of computing the shortest series of reversals that transform one permutation to another. The permutations describe the order of genes on corresponding chromosomes, and areversal takes an arbitrary substring of elements, and reverses their order.

Sorting in linear time

Abstract: We show that a unit-cost RAM with a word length of bits can sort integers in the range in time, for arbitrary ! , a significant improvement over the bound of " # $ achieved by the fusion trees of Fredman and Willard. Provided that % & ' ( *),+., for some fixed /102 , the sorting can even be accomplished in linear expected time with a randomized algorithm. Both of our algorithms parallelize without loss on a unitcost PRAM with a word length of bits. The first one yields an algorithm that uses 3 4 5 $ time and 6 ( operations on a deterministic CRCW PRAM. The second one yields an algorithm that uses ' 5 7 expected time and " expected operations on a randomized EREW PRAM, provided that 8 ' 5 7 *),+.for some fixed /90: . Our deterministic and randomized sequential and parallel algorithms generalize to the lexicographic sorting problem of sorting multiple-precision integers represented in several words.

A two-colour near-infrared sensor for sorting recycled plastic waste

Abstract: This paper describes a simple device for automated sorting of post-consumer plastic waste. It is shown that rapid and reliable identification of certain polymers can be achieved by using a simple two-colour fixed filter near-infrared spectrometer in conjunction with a simple ratio circuit. The effectiveness of the proposed method is demonstrated in sorting of polyethylene terephthalate and polyvinyl chloride. A sensor based on this identification method is inexpensive to build and provides the necessary speed and performance required by the recycling industry.

Method and apparatus for automated learning and performance evaluation

Abstract: A method and apparatus is provided for automated learning and performance evaluation of a group of items by a user. The apparatus, which can be a digital computer, has an input for receiving a user's response, a display for presenting the material to be learned and logic for sorting the items. The method, which can be practiced on a digital computer, has steps of querying the user as to whether items are believed to be known or unknown, sorting the items into groups of perceived known (44) and unknown (48) items, and generating a sequence (54) of items to be displayed (58). An important feature of this invention is that the user is tested regarding his belief as to whether the item is known or unknown not as to his actual knowledge.

Method for supporting object modeling in a repository

Abstract: In a computer system having a user interface, a memory, a repository and a database, a repository program operating in the computer system for accessing the database, the repository program executing a method for supporting modeling, the method comprising the steps of examining a collection of types forming a model; sorting object types into data and persistent type objects; creating all data type objects and adding to a collection of all objects owned by the model; creating all persistent type objects and adding to a collection of all objects owned by the model; initializing all persistent type objects in the collection of objects.

Sorting permutations by tanspositions

Abstract: Vineet Bafnat Sequence comparison in computational molecular biology is a powerful tool for deriving evolutionary and functional relationships between genes. However, classical alignment algorithms handle only local mutations (i.e. insertions, deletions and substitutions of nucleotides) and ignore global rearrangements (i.e. inversions and transpositions of long fragments). As a result, the applications of sequence alignment to analyze highly rearranged genomes (i.e. herpes viruses or plant mitochondrial DNA) are rather limited. The paper addresses the problem of genome comparison versus classical gene comparison and presents algorithms to analyze rearrangements in genomes evolving by transpositions. In the simplest form the problem corresponds to sorting bu tmnspositions, i.e. sorting of an array using transpositions of arbitrary fragments. We derive lower bounds on tmnsposition distance between permutations and present approximation algorithms for sorting by transpositions. The algorithms also imply a non-trivial upper bound on the transposition diameter of the symmetric group. Finally, we formulate two biological problems in genome rearrangements and describe the first algorithmic steps towards their solution.

Greed sort: optimal deterministic sorting on parallel disks

Abstract: We present an algorithm for sorting efficiently with parallel two-level memories. Our main result is an elegant, easy-to-implement, optimal, deterministic algorithm for external sorting with D disk drives. This result answers in the affirmative the open problem posed by Vitter and Shriver of whether an optimal algorithm exists that is deterministic. Our measure of performance is the number of parallel input/output (I/O) operations, in which each of the D disks can simultaneously transfer a block of B contiguous records. We assume that internal memory can hold M records. Our algorithm sorts N records in the optimal bound of t((N/BD) log(N/B)/ log(M/B)) deterministically, and thus improves upon Vitter and Shriver's optimal randomized algorithm as well as the well-known deterministic but nonoptimal technique of disk striping. It is also practical to implement.

Interactive method and apparatus for sorting biological specimens

Abstract: An interactive process (22) for sorting biological specimens includes the steps of processing a biological specimen (302) to provide an analysis score (14), sorting the biological specimens (304) according to the analysis score (14) into categories including: clearly normal, interactive review, and microscopy review, and selecting a field-of-view (FOV) for the biological specimens (300) sorted into the interactive review category.

Feature extraction system for identifying text within a table image

Abstract: In a feature extraction system for analyzing image data of an input document image, a feature extraction method identifies image data as a table image and identifies text image within the table image by performing the steps of inputting image data of a document page, performing block selection processing on the document page, the block selection process identifies and separates the image data into blocks having the same image type, identifying table image data based on the separated blocks of image data, identifying text blocks within the table image data, horizontally sorting all text blocks located in the table image data based on horizontal position information, vertically sorting all text blocks located in the table image data based on vertical position information, separating text blocks into rows and columns based on a result of the vertical and the horizontal sorting steps, assigning column and row address coordinates to each text block in the table image data based on the separating step, and storing the assigned address of each text block.

Automatic color and grain sorting of materials

Abstract: A system for automatically color and grain sorting materials includes a pair of color cameras positioned to view the top and bottom faces, respectively, of each part. A computer analyzes the data from the top and bottom cameras, and also controls the voltage on the input line to each camera. Camera controllers accept analog data from the camera heads and digitize it so that the information can be passed to the computer for analysis. A white target inserted into the field of view of each camera allows the computer to collect the data needed to do "shading compensation" on the collected color image data. Three basic categories of algorithms are used in the sorting system in accordance with the present invention: (1) training algorithms used to teach the system to identify the color and grain classes that are to be used during the sorting process, (2) real-time operation algorithms which perform the color and grain sorts with parts moving through the system at the desired throughput rate, and (3) utility algorithms which allow operators to display images, perform system tests, etc. In the training and sorting algorithms, the computer produces a black/white histogram of a part face based on the data analysis, and applies a character mark algorithm to the black/white histogram to find a threshold value for eliminating the effects of character marks from the color and grain classification and sorting of the part.

Method for calibrating a color sorting apparatus

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. The apparatus also provides one or more of color calibration with respect to predetermined color standard references, a dynamic color calibration, a fine tuning adjustment, color correction based on size, shape measurement and a hue value transformation that provides a stable hue value.

Sorting-based VLSI architectures for the M-algorithm and T-algorithm trellis decoders

Abstract: The well-known M-algorithm and the newer T-algorithm are two closely related reduced-complexity trellis-search algorithms that can be used for data sequence estimation in digital communication systems. VLSI implementations of these algorithms are attractive due to the parallelism and simplicity of their operation. While a small number of VLSI structures have been proposed previously, this paper describes new sorting-based architectures that can be used to realize these algorithms. Specifically, schemes based on odd-even transposition, insertion, and weavesorting techniques are presented. Structures are evaluated on the basis of area, time, and power measures. Actual VLSI implementations have been used to verify timing models. >

Analysis and design of an analog sorting network

Abstract: An analog sorting neural network is presented. First, existing order representations are discussed and a generalized order representation is introduced. The sorting problem is then formulated as the assignment problem. Based on the assignment problem formulation, the neural network architecture is described. Design principles and an op-amp based circuit realization of the analog neural network are delineated. Three illustrative examples are also discussed to demonstrate the capability and performance of the analog neural network. The proposed analog neural network is shown to be capable of monotonic and bitonic sorting and suitable for hardware implementation. >

Wavelength sorter and its application to planarized dynamic wavelength routing

Abstract: This invention provides methods and apparatus for achieving wavelength sorting multiplexer/demultiplexer and its application to the implementation of planarized dynamic wavelength routing. Using integrated arrayed-waveguide gratings, sorting can be achieved by two configurations. In the first configuration channel wavelengths are properly selected and launched into prearranged input waveguides of an arrayed-waveguide grating such that channels at the same wavelength and from all inputs will be demultiplexed and routed to adjacent outputs. Operated in the reverse direction, the same device becomes a sorting multiplexer. The second configuration achieves wavelength sorting by using the cascade of multiple arrayed-waveguide gratings and can also be operated as a demultiplexer or a multiplexer. Combined with space switches, the wavelength sorting multi/demultiplexer are utilized to implement the planarized channel-selective dynamic wavelength router. The function of wavelength sorting eliminates on-chip waveguide crossings and therefore reduces losses and crosstalks. The sorting demultiplexer and multiplexer can further be implemented with a single arrayed-waveguide grating.

Method and apparatus for computer assisted sorting of parcels

Abstract: A method and apparatus for sorting parcels using a portable computer worn by the user and equipped with voice recognition systems and voice synthesis systems. The portable computer is carried on the body of the user, who wears a headset having at least one microphone and at least one speaker electrically connected to the voice synthesis and voice recognition systems of the portable computer. Address information spoken by the user is recognized and sorting information provided to the user. In an alternative embodiment, the invention also comprises laser scanning means. In a further alternative embodiment, means are provided for marking sorted parcels without interfering with the use of the user's hands for sorting parcels.

Apparatus and method of mail sorting

Abstract: Disclosed is a method for sorting a set of mail items according to a predefined delivery sequence, including the steps of generating first sequence number for each subset of mail according to its destination address, sorting the first subset into batches according to the first sequence number, associating one of the first sequence numbers corresponding to the destination addresses of the mail items in the first subset, generating a second sequence number sorting the second subset into batches according to the second and first sequence numbers disregarding N of the most significant digits of the first sequence number, interleaving the batches of mail items from the first and second subset; and sorting the mail items according to the N most significant digits of the first sequence numbers. In this way, all the mail is sorted in sequence, but sorting of the mail can begin prior to all the mail being physically present at the sorter or its location in the sorting scheme being known. A system and machine for practicing the method are also contemplated.

Direct analog rank filtering

Abstract: An analog method is developed for selecting a rank order element directly from a set of samples. Simple nonlinear equations are presented for the order statistic and the weighted order statistic and these equations are implemented with analog MOS circuits. The circuit contains no sorting subsystem and no clock signal. The length of wiring in the circuit is proportional only linearly to the number of input samples. >

A multiway merge sorting network

Abstract: A multiway merge sorting network is presented, which generalizes the technique used in the odd-even merge sorting network. The merging network described here is composed of m k-way mergers and a combining network. It arranges k ordered lists of length n each into one ordered lists in T(k)+[log/sub 2/k] [log/sub 2/m] [log/sub 2/m] steps, where T(k) is the number of steps needed to sort k keys in order; and k and m are any integers no longer restricted to 2. >

Apparatus and method for terminating coin sorting using pressureless exit channels and immediate stopping

Abstract: The present invention is a coin sorter apparatus for sorting a group of mixed coins by denomination and immediately terminating the sorting process in response to a predetermined operating condition, such as the filling of a coin receptacle with a predetermined number of coins. Sorting is provided by a stationary sorting head and a rotatable disc positioned sufficiently proximate to one another so that when the group of mixed coins are dropped into the center opening of the stationary sorting head, they are rotated by the rotating disc and guided by the sorting head on a outward spiral sorting path to exit channels along the periphery of the stationary sorting head. Each of the exit channels acts as an exit chute for a particular coin denomination by releasing pressure on that particular coin and freeing the coin to move outwardly along the exit channel and exit into a coin receptacle. At the moment of the predetermined operating condition, a braking mechanism immediately stops the rotation of the rotatable disc, and the coins within an exit channel exit through the exit channel due to the inertia of the coins.

System and methods for improved sorting with national language support

Abstract: A Database Management System having a Collation Engine with improved methods for sorting information with National Language Support (NLS) is described. The Collation Engine includes an improved method for comparing text strings with a culturally predictable result. In an exemplary embodiment, the Collation Engine includes a Collation Table storing primary, secondary, and tertiary weightings. The weightings are employed, in a method of the present invention, for accounting for locale-dependent factors or rules other than those taken into account by conventional primary and secondary weightings. Additional rules include, for instance, local-specific sorting rules specifying that the case of a character be taken into consideration, or that the expansion of an expanding character (e.g., "" which expands to "AE") be taken into consideration. A preferred method for examining weightings is described, so that the system may uncover differences between characters which would otherwise be ignored by conventional systems. In this manner, comparison operations of text strings (e.g., during sorting) may be performed in a manner appropriate for a given locale (e.g., German DIN sorting rules).

Data Structures in C

Abstract: Program design with C Algorithm design Program correctness Complexity analysis Dynamic allocation Stacks and queues Recursion Binary trees Multiway trees Graphs Sorting Hashing Data compression Memory management.

Method of compressing data for use in performing VLSI mask layout verification

Abstract: A method of compressing data used in integrated circuit (IC) layout verifications includes the steps of identifying each circuit component from each layer of the IC chip; sorting each circuit component in an established order; identifying predetermined parameters for each component; determining the difference in value of the parameters for each pair of components in successive order; and storing the difference values for each pair of components.

Indentification of plastic waste using spectroscopy and neural networks

Abstract: In this paper we investigate a new approach for the automated sorting of post-consumer plastic waste. We show that rapid and reliable identification of polymers can be achieved using a combination of fixed-filter near-infrared spectroscopy and neural network data analysis, and we demonstrate the effectiveness of the proposed method for sorting polyethylene terephthalate, high density polyethylene, and poly(vinyl chloride). Finally, we discuss a proposed compact, rugged instrument based on the new sorting method. Owing to the flexibility gained by incorporating neural networks in our system, this method can easily be extended to include additional polymers.