Showing papers on "Sorting published in 1999"

Machine learning approaches for the prediction of signal peptides and other protein sorting signals.

Abstract: Prediction of protein sorting signals from the sequence of amino acids has great importance in the field of proteomics today. Recently, the growth of protein databases, combined with machine learning approaches, such as neural networks and hidden Markov models, have made it possible to achieve a level of reliability where practical use in, for example automatic database annotation is feasible. In this review, we concentrate on the present status and future perspectives of SignalP, our neural network-based method for prediction of the most well-known sorting signal: the secretory signal peptide. We discuss the problems associated with the use of SignalP on genomic sequences, showing that signal peptide prediction will improve further if integrated with predictions of start codons and transmembrane helices. As a step towards this goal, a hidden Markov model version of SignalP has been developed, making it possible to discriminate between cleaved signal peptides and uncleaved signal anchors. Furthermore, we show how SignalP can be used to characterize putative signal peptides from an archaeon, Methanococcus jannaschii. Finally, we briefly review a few methods for predicting other protein sorting signals and discuss the future of protein sorting prediction in general.

Stigmergy, self-organization, and sorting in collective robotics

Abstract: Many structures built by social insects are the outcome of a process of self-organization, in which the repeated actions of the insects interact over time with the changing physical environment to produce a characteristic end state. A major mediating factor is stigmergy, the elicitation of specific environment-changing behaviors by the sensory effects of local environmental changes produced by previous behavior. A typical task involving stigmergic self-organization is brood sorting: Many ant species sort their brood so that items at similar stages of development are grouped together and separated from items at different stages of development. This article examines the operation of stigmergy and self-organization in a homogeneous group of physical robots, in the context of the task of clustering and sorting Frisbees of two different types. Using a behavioral rule set simpler than any yet proposed for ant sorting, and having no capacity for spatial orientation or memory, the robots are able to achieve effective clustering and sorting showing all the signs of self-organization. It is argued that the success of this demonstration is crucially dependent on the exploitation of real-world physics, and that the use of simulation alone to investigate stigmergy may fail to reveal its power as an evolutionary option for collective life forms.

Efficient Algorithms for Sorting and Synchronization

Abstract: This thesis presents efficient algorithms for internal and external parallel sorting and remote data update. The sorting algorithms approach the problem by concentrating first on highly efficient but incorrect algorithms followed by a cleanup phase that completes the sort. The remote data update algorithm, rsync, operates by exchanging block signature information followed by a simple hash search algorithm for block matching at arbitrary byte boundaries. The last chapter of the thesis examines a number of related algorithms for text compression, differencing and incremental backup.

Personal communication and positioning system

Abstract: A location tagged data provision and display system. A personal communication device (PCD) with electromagnetic communication capability has a GPS receiver and a display. The PCD requests maps and location tagged data from data providers and other for display on the PCD. The data providers respond to requests by using searching and sorting schemes to interrogate data bases and then automatically transmitting data responsive to the requests to the requesting PCD.

Positional camera and gps data interchange device

Abstract: A location tagged data provision and display system. A personal communication device (PCD) with electromagnetic communication capability has a GPS receiver and a display. The PCD requests maps and location tagged data from data providers and other for display on the PCD. The data providers respond to requests by using searching and sorting schemes to interrogate data bases and then automatically transmitting data responsive to the requests to the requesting PCD.

Estimating and Interpreting Models With Endogenous Treatment Effects

Abstract: This article examines the relationship between two alternative approaches, instrumental variables and control function procedures, for estimating the impact of endogenous treatment effects. Although it is well known that the two approaches generate comparable estimates, the relationship between the estimators and their accompanying endogeneity tests appears not to be well understood. We show that the two procedures are closely related. We also examine the implications of the two procedures for the underlying economic sorting behavior.

Protein hormone storage in secretory granules: mechanisms for concentration and sorting.

Abstract: I. Introduction: Concentrating Protein Hormones in Secretory Granules II. A Well Characterized Sorting Mechanism: Lysosomal Hydrolases A. Sorting is linked to transport B. Specific transport is associated with specific vesicles III. Sorting of Soluble Transported Proteins in the Endoplasmic Reticulum A. Sorting in yeast B. Sorting in mammalian cells C. Implications for sorting into granules IV. Two Models for the Functioning of the Golgi Complex A. Vesicular transport of proteins vs. maturation of stacks B. Implications for sorting into granules V. Models for Formation of Secretory Granules A. Active budding off of secretory granules vs. active budding off of everything else B. Implications for sorting into granules VI. Hormone Aggregates in Cells A. Evidence for their existence B. Properties of hormone aggregates in cells VII. Hormone Aggregates in Solution VIII. Does Aggregation Cause Sorting in Cells? A. Ways to measure sorting B. Does sorting in cells correlate with aggregation in solution? IX. What K...

A Multicriteria Decision Aid Methodology for Sorting Decision Problems: The Case of Financial Distress

Abstract: Sorting problems constitute a major part of real world decisions, where a set of alternative actions (solutions) must be classified into two or more predefined classes. Multicriteria decision aid (MCDA) provides several methodologies, which are well adapted in sorting problems. A well known approach in MCDA is based on preference disaggregation which has already been used in ranking problems, but it is also applicable in sorting problems. The UTADIS (UTilites Additives DIScriminantes) method, a variant of the UTA method, based on the preference disaggregation approach estimates a set of additive utility functions and utility profiles using linear programming techniques in order to minimize the misclassification error between the predefined classes in sorting problems. This paper presents the application of the UTADIS method in two real world classification problems concerning the field of financial distress. The applications are derived by the studies of Slowinski and Zopounidis (1995), and Dimitras et al. (1999). The obtained results depict the superiority of the UTADIS method over discriminant analysis, and they are also comparable with the results derived by other multicriteria methods.

Sorting Data: Collection and Analysis

Abstract: Introduction Collecting Free-Sorting Data Describing and Comparing Sortings Analyising Sorting Data

Learning strategies in instrumental music practice

Abstract: This case study of two organ students aims to identify learning strategies used in preparing a complex piece for performance. The results are based on data gathered from verbal reports given both during and after practice sessions. These sessions were also videotaped. The results show that the students used learning strategies to select and organise information and to integrate it with existing knowledge. In addition, they were systematic in their approaches to sorting the learning material.

Formulations and hardness of multiple sorting by reversals

Abstract: We consider two generalizations of signed Sorting Bg Reversals (SBR), both aimed at formalizing the problem of reconstructing the evolutionary history of a set of species. In particular, we address Multiple SBR, calling for a signed permutation at minimum reversal distance from a given set of signed permutations, and Dee SBR, calling for a tree with the minimum number of edges spanning a given set of nodes in the complete graph where each node corresponds to a signed permutation and there is an edge between each pair of signed permutations one reversal away from each other. We describe a graph-theoretic relaxation of MSBR, which is the counterpart of the so-called alternating-cycle decomposition relaxation for SBR., illustrating a convenient mathematical formulation for this relaxation. Moreover, we use this relaxation to show that, even if the number of given permutations equals 3, MSBR is NP-hard, and hence so is nee SBR. In fact, we show that the two problems are APX-hard, i.e. they do not have a polynomial-time approximation scheme unless P=NP. Finally, we mention known Zapproximation algorithms for two general problems which generalize MSBR and Tree SBR, respectively. To our knowledge, this work is the f?rst one discussing the complexity of MBSR (and Tree SBR), as well as potential solution approaches to the problem based on the use of a tight relaxation.

Building a rule-based machine-vision system for defect inspection on apple sorting and packing lines

Abstract: A near-infrared machine-vision system was developed for automating apple defect inspection. Fast blob extraction from fruit images was performed by using an adaptive spherical transformation. A binary decision-tree-structured rule base was established using blob feature extraction and analysis. Both off-line and on-line test results demonstrated that the rule-based system was effective for apple defect detection. Compared with the neural network method, the rules-based approach had more flexibility for changing or adding parameters, features and rules to meet various sorting requirements. The technique presented in this paper is being commercialized by a leading manufacturer of fruit/vegetable packinghouse equipment.

Online Dynamic Reordering for Interactive Data Processing

Abstract: We present a pipelining, dynamically user-controllable reorder operator, for use in data-intensive applications. Allowing the user to reorder the data delivery on the fly increases the interactivity in several contexts such as online aggregation and large-scale spreadsheets; it allows the user to control the processing of data by dynamically specifying preferences for different data items based on prior feedback, so that data of interest is prioritized for early processing. In this paper we describe an efficient, non-blocking mechanism for reordering, which can be used over arbitrary data streams from files, indexes, and continuous data feeds. We also investigate several policies for the reordering based on the performance goals of various typical applications. We present results from an implementation used in Online Aggregation in the Informix Dynamic Server with Universal Data Option, and in sorting and scrolling in a large-scale spreadsheet. Our experiments demonstrate that for a variety of data distributions and applications, reordering is responsive to dynamic preference changes, imposes minimal overheads in overall completion time, and provides dramatic improvements in the quality of the feedback over time. Surprisingly, preliminary experiments indicate that online reordering can also be useful in traditional batch query processing, because it can serve as a form of pipelined, approximate sorting.

Wireless communication terminal having sorting means for sorting short messages into an appropriate folder for storage

Abstract: The invention relates to a method and a wireless communication terminal (100) for handling location independent short messages. The terminal (100) comprises control means for handling receiving and/or transmitting a location independent short message over a cellular communication network (120). The short message comprises identification means. Also, the terminal (100) comprises display means (150) for presenting short messages to a user of the terminal (100), and one message folder (220) to place and/or store location independent short messages in. The folder (220) is provided on the display means (150), and having sorting means to select location independent short messages upon receiving/sending a location independent short message. The sorting means sorts a message automatically into the folder (220), when the identification means in the location independent short message is recognized by the sorting means.

Feeding system and method for placing a plurality of objects on a tray of an automated sorting system

Abstract: A feeding system and method for placing a plurality of objects within a single designated destination area of a sorting system to increase the throughput rate of the system. The disclosed sorting system includes a plurality of carriages movable under the control of a programmable controller between the loading and unloading stations of the sorting system, each carriage carrying a tilt tray. The geographic destination of each of the objects to be placed on a tray, as well as a dimension of each of the objects to be placed on a tray, is determined by an optical scanner and a measuring device. The controller uses the dimension information to determine whether more than one object having the same geographic destination may be placed on the same tray. The invention is adaptable for use with other types of sorting systems.

Model-Checking Real-Time Control Programs. Verifying LEGO Mindstorms Systems Using UPPAAL

Abstract: In this paper, we present a method for automatic verification of real-time control programs running on LEGO RCX bricks using the verification tool UPPAAL. The control programs, consisting of a number of tasks running concurrently, are automatically translated into the timed automata model of UPPAAL. The fixed scheduling algorithm used by the LEGO RCX processor is modeled in UPPAAL, and supply of similar (sufficient) timed automata models for the environment allows analysis of the overall real-time system using the tools of UPPAAL. To illustrate our techniques we have constructed, modeled and verified a machine for sorting LEGO bricks by color.

Designing Practical Efficient Algorithms for Symmetric Multiprocessors

Abstract: Symmetric multiprocessors (SMPs) dominate the high-end server market and are currently the primary candidate for constructing large scale multiprocessor systems. Yet, the design of efficient parallel algorithms for this platform currently poses several challenges. In this paper, we present a computational model for designing efficient algorithms for symmetric multiprocessors. We then use this model to create efficient solutions to two widely different types of problems - linked list prefix computations and generalized sorting. Our novel algorithm for prefix computations builds upon the sparse ruling set approach of Reid-Miller and Blelloch. Besides being somewhat simpler and requiring nearly half the number of memory accesses, we can bound our complexity with high probability instead of merely on average. Our algorithm for generalized sorting is a modification of our algorithm for sorting by regular sampling on distributed memory architectures. The algorithm is a stable sort which appears to be asymptotically faster than any of the published algorithms for SMPs. Both of our algorithms were implemented in C using POSIX threads and run on four symmetric multiprocessors - the IBM SP-2 (High Node), the HP-Convex Exemplar (S-Class), the DEC AlphaServer, and the Silicon Graphics Power Challenge. We ran our code for each algorithm using a variety of benchmarks which we identified to examine the dependence of our algorithm on memory access patterns. In spite of the fact that the processors must compete for access to main memory, both algorithms still yielded scalable performance up to 16 processors, which was the largest platform available to us. For some problems, our prefix computation algorithm actually matched or exceeded the performance of the standard sequential solution using only a single thread. Similarly, our generalized sorting algorithm always beat the performance of sequential merge sort by at least an order of magnitude, even with a single thread.

Method for reading and sorting documents

Abstract: A method for reading and sorting documents is provided which generally comprises staging each document for processing, capturing a digital image of the front side and the back side of each document, determining the physical orientation of each document using digital orientation recognition software and possibly hardware, reading the information from a digital image of each document, sorting the documents by orientation, and then communicating the information read from each document to a posting system. Additionally, the image of the document can be automatically oriented and then read. The documents, among other things, can include checks and coupons. When the document is a bank check, the method further comprises endorsing the check, printing an audit trail for the check, sorting the check by orientation, preparing a cash letter and sending the check to the bank.

Image forming device

Abstract: PROBLEM TO BE SOLVED: To provide an image forming device capable of realizing a high-speed electronic sorting function at a low cost without incurring performance degradation to be a problem at the time of executing the electronic sorting function in a color digital copying machine or a high-speed monochromatic digital copying machine. SOLUTION: The color digital copying machine is provided with the electronic sorting function; for reading the images of an original by a scanner 21, inputting them as image data, compressing the inputted image data in a compression/ expansion part 17, storing them in a hard disk device 14, then reading compressed data from the hard disk device 14, expanding them to the image data in the compression/expansion part 17, developing them in a page memory 16, then sending them to a printer engine 22 and forming the images. In the case that the volume of the compressed data after a compression processing in the compression/expansion part 17 exceeds a prescribed capacity, affecting the performance of the electronic sorting function, the compressed data are not stored in the hard disk device 14 but are stored in a semiconductor memory 12.

Sorting/storage device for wafers and method for handling thereof

Abstract: Sorting/storage device for wafers. A sorting device is provided in which at least two cassettes containing wafers may be present and the wafers are moved from one cassette to the other cassette or vice versa. If appropriate, a measuring station may be present in the sorting device. In the immediate vicinity of the sorting device, the cassettes are stored in a magazine which is designed for this purpose and the cassettes are moved using a handling device for cassettes.

System, apparatus and method for spatially sorting image data in a three-dimensional graphics pipeline

Abstract: The present invention is a mid-pipeline sorting unit that sorts image data mid-pipeline in a tiled 3-D graphics pipeline architecture. The image data includes vertices of geometric primitives. The mid-pipeline sorting determines whether a geometric primitive intersects a region of a 2-D window. The 2-D window having been divided into multiple such regions. Upon determining which region of the 2-D window that the geometric primitive intersects, the mid-pipeline sorting unit stores the vertices that define the geometric primitive into a memory in a manner that associates each of the geometric primitive's vertices with the region that was intersected. After the image data is sorted into the memory, the mid pipeline sorting unit sends the sorted image data to the subsequent stage on a region by region basis. Yet another embodiment of the present invention provides a guaranteed conservative memory estimate to the mid-pipeline sorting stage of whether there is enough free memory for the mid pipeline sorting unit to sort and store the image data. Yet another embodiment of the present invention sends image data from a memory to a next stage in a graphics pipeline in a spatially staggered sequence.

On the Tightness of the Alternating-Cycle Lower Bound for Sorting by Reversals

Abstract: We give a theoretical answer to a natural question arising from a few years of computational experiments on the problem of sorting a permutation by the minimum number of reversals, which has relevant applications in computational molecular biology The experiments carried out on the problem showed that the so-called alternating-cycle lower bound is equal to the optimal solution value in almost all cases, and this is the main reason why the state-of-the-art algorithms for the problem are quite effective in practice Since worst-case analysis cannot give an adequate justification for this observation, we focus our attention on estimating the probability that, for a random permutation of n elements, the above lower bound is not tight We show that this probability is low even for small n, and asymptotically Θ(1/n5), ie, O(1/n5) and Ω(1/n5) This gives a satisfactory explanation to empirical observations and shows that the problem of sorting by reversals and its alternating-cycle relaxation are essentially the same problem, with the exception of a small fraction of “pathological” instances, justifying the use of algorithms which are heavily based on this relaxation From our analysis we obtain convenient sufficient conditions to test if the alternating-cycle lower bound is tight for a given instance We also consider the case of signed permutations, for which the analysis is much simpler, and show that the probability that the alternating-cycle lower bound is not tight for a random signed permutation of m elements is asymptotically Θ(1/m2)

Article delivery system

Abstract: In an article delivery system, articles each having sorting information are handled, and the articles are arranged in proper delivery order through a plurality of arrangement paths so as to help the delivery of the articles. This system includes a sorting information procuring device for procuring the sorting information of each article, an article information storage device which is connected to the sorting information procuring device, and collects and stores the sorting information, a database for providing the order of arrangement of the sorting information, an information processing device for arranging the sorting information in the order, provided by the database, while including information for distinguishing the arrangement paths from each other, and delivery order forming device having a communication device for transmitting the sorting information arranged by the information processing device.

A VLSI sorting image sensor: global massively parallel intensity-to-time processing for low-latency adaptive vision

Abstract: Presents a new intensity-to-time processing paradigm suitable for very large scale integration (VLSI) computational sensor implementation of global operations over sensed images. Global image quantities usually describe images with fewer data. When computed at the point of sensing, global quantities result in a low-latency performance due to the reduced data transfer requirements between an image sensor and a processor. The global quantities also help global top-down adaptation: the quantities are continuously computed on-chip, and are readily available to sensing for adaptation. As an example, we have developed a sorting image computational sensor-a VLSI chip which senses an image and sorts all pixel by their intensities. The first sorting sensor prototype is a 21/spl times/26 array of cells. It receives an image optically, senses it, and computes the image's cumulative histogram-a global quantity which can be quickly routed off chip via one pin. In addition, the global cumulative histogram is used internally on-chip in a top-down fashion to adapt the values in individual pixel so as to reflect the index of the incoming light, thus computing an "image of indices". The image of indices never saturates and has a uniform histogram.

Specimen sorting device

Abstract: PROBLEM TO BE SOLVED: To provide a specimen sorting device capable of sorting a large number of types and a large amount of specimens in a short time. SOLUTION: A sorting station 3 for extracting specimens 10 from specimen transfer racks 11 on a transfer line 2 and moving them to the side of a specimen storage part is constituted of a horizontally held member 33 provided above the transfer line 2 in such a way as to intersect the transfer line 2 at right angles, a vertically held member 32 engaged with the horizontally held member 33 and provided in such a way as to be moveable horizontally, a chuck holding member 31 engaged with the vertically held member 32 and provided in such a way as to be movable vertically, and at least one chuck part 30 comprised of a plurality of chucking hands 30a-30n for extracting the specimens 10 from the specimen transfer racks 11 and moving them to the side of the specimen housing part.

Visual analysis of evolutionary algorithms

Abstract: The non-linear complexity of evolutionary algorithms (EAs) make them a challenge to understand. The difficulty in performing detailed analyses of an EA is in sorting through the large amount of of data that can be generated in a single run. This paper describes a visualization tool that facilitates navigation through the details of an EA run. The visualization tool organizes and displays EA data at various levels of detail and allows for easy transitions between related pieces of data.