Showing papers on "Sorting published in 2005"

Marker-specific sorting of rare cells using dielectrophoresis

Abstract: Current techniques in high-speed cell sorting are limited by the inherent coupling among three competing parameters of performance: throughput, purity, and rare cell recovery. Microfluidics provides an alternate strategy to decouple these parameters through the use of arrayed devices that operate in parallel. To efficiently isolate rare cells from complex mixtures, an electrokinetic sorting methodology was developed that exploits dielectrophoresis (DEP) in microfluidic channels. In this approach, the dielectrophoretic amplitude response of rare target cells is modulated by labeling cells with particles that differ in polarization response. Cell mixtures were interrogated in the DEP-activated cell sorter in a continuous-flow manner, wherein the electric fields were engineered to achieve efficient separation between the dielectrophoretically labeled and unlabeled cells. To demonstrate the efficiency of marker-specific cell separation, DEP-activated cell sorting (DACS) was applied for affinity-based enrichment of rare bacteria expressing a specific surface marker from an excess of nontarget bacteria that do not express this marker. Rare target cells were enriched by >200-fold in a single round of sorting at a single-channel throughput of 10,000 cells per second. DACS offers the potential for automated, surface marker-specific cell sorting in a disposable format that is capable of simultaneously achieving high throughput, purity, and rare cell recovery.

Love and Money: A Theoretical and Empirical Analysis of Household Sorting and Inequality

Abstract: This paper examines the interactions between household formation, inequality, and per capita income. We develop a model in which agents decide to become skilled or unskilled and form households. We show that the equilibrium sorting of spouses by skill type (their correlation in skills) is an increasing function of the skill premium. In the absence of perfect capital markets, the economy can converge to different steady states, depending upon initial conditions. The degree of marital sorting and wage inequality is positively correlated across steady states and negatively correlated with per capita income. We use household surveys from 34 countries to construct several measures of the skill premium and of the degree of correlation of spouses’ education (marital sorting). For all our measures, we find a positive and significant relationship between the two variables. We also find that sorting and per capita GDP are negatively correlated and that greater discrimination against women leads to more sorting, in line with the predictions of our model.

Fast and approximate stream mining of quantiles and frequencies using graphics processors

Abstract: We present algorithms for fast quantile and frequency estimation in large data streams using graphics processors (GPUs). We exploit the high computation power and memory bandwidth of graphics processors and present a new sorting algorithm that performs rasterization operations on the GPUs. We use sorting as the main computational component for histogram approximation and construction of e-approximate quantile and frequency summaries. Our algorithms for numerical statistics computation on data streams are deterministic, applicable to fixed or variable-sized sliding windows and use a limited memory footprint. We use GPU as a co-processor and minimize the data transmission between the CPU and GPU by taking into account the low bus bandwidth. We implemented our algorithms on a PC with a NVIDIA GeForce FX 6800 Ultra GPU and a 3.4 GHz Pentium IV CPU and applied them to large data streams consisting of more than 100 million values. We also compared the performance of our GPU-based algorithms with optimized implementations of prior CPU-based algorithms. Overall, our results demonstrate that the graphics processors available on a commodity computer system are efficient stream-processor and useful co-processors for mining data streams.

Hardware-assisted visibility sorting for unstructured volume rendering

Abstract: Harvesting the power of modern graphics hardware to solve the complex problem of real-time rendering of large unstructured meshes is a major research goal in the volume visualization community. While, for regular grids, texture-based techniques are well-suited for current GPUs, the steps necessary for rendering unstructured meshes are not so easily mapped to current hardware. We propose a novel volume rendering technique that simplifies the CPU-based processing and shifts much of the sorting burden to the GPU, where it can be performed more efficiently. Our hardware-assisted visibility sorting algorithm is a hybrid technique that operates in both object-space and image-space. In object-space, the algorithm performs a partial sort of the 3D primitives in preparation for rasterization. The goal of the partial sort is to create a list of primitives that generate fragments in nearly sorted order. In image-space, the fragment stream is incrementally sorted using a fixed-depth sorting network. In our algorithm, the object-space work is performed by the CPU and the fragment-level sorting is done completely on the GPU. A prototype implementation of the algorithm demonstrates that the fragment-level sorting achieves rendering rates of between one and six million tetrahedral cells per second on an ATI Radeon 9800.

Industrial application for inline material sorting using hyperspectral imaging in the NIR range

Abstract: Spectral imaging is becoming increasingly interesting not only for agricultural use but also for industrial applications. Wavelengths in the near infrared (NIR) range, in particular, can be used for materials classification. However, sorting paper according to quality is a very difficult task due to the close similarities between the materials. This work describes the development of a unique industrial inline material sorting system which uses the spectral imaging technique. The main functional parts and the sensor unit are described in detail. Classification methods for cellulose-based materials such as pulp, paper and cardboard will be discussed, as will hardware requirements for the industrial use of spectral imaging solutions, including adjustment and calibration techniques. The description of the software design focuses on the classification speed required.

Sorting points into neighborhoods (SPIN): data analysis and visualization by ordering distance matrices

Abstract: Summary: We introduce a novel unsupervised approach for the organization and visualization of multidimensional data. At the heart of the method is a presentation of the full pairwise distance matrix of the data points, viewed in pseudocolor. The ordering of points is iteratively permuted in search of a linear ordering, which can be used to study embedded shapes. Several examples indicate how the shapes of certain structures in the data (elongated, circular and compact) manifest themselves visually in our permuted distance matrix. It is important to identify the elongated objects since they are often associated with a set of hidden variables, underlying continuous variation in the data. The problem of determining an optimal linear ordering is shown to be NP-Complete, and therefore an iterative search algorithm with O(n3) step-complexity is suggested. By using sorting points into neighborhoods, i.e. SPIN to analyze colon cancer expression data we were able to address the serious problem of sample heterogeneity, which hinders identification of metastasis related genes in our data. Our methodology brings to light the continuous variation of heterogeneity---starting with homogeneous tumor samples and gradually increasing the amount of another tissue. Ordering the samples according to their degree of contamination by unrelated tissue allows the separation of genes associated with irrelevant contamination from those related to cancer progression. Availability: Software package will be available for academic users upon request. Contact: fedafna@wisemail.weizmann.ac.il Supplementary information: http://www.weizmann.ac.il/physics/complex/compphys/spin

Supplementary material for: Sorting Points Into Neighborhoods (SPIN): Data Analysis and Visualization by Ordering Distance Matrices

Abstract: Table 1 summarizes the parameters and running times for some examples given in this article. The results maydepend on the starting permutation and several restarts are sometimes needed to flnd the global minimum. However,one of the strengths of SPIN is that from a practical point of view, convergence to the global minimum is oftennot necessary. In most cases the local minima reached by SPIN are almost as informative for extracting structuralinformation.

Sorting of polystyrene microspheres using a Y-branched optical waveguide

Abstract: We demonstrate how a Y-branched optical waveguide can be used for microparticle sorting. Polystyrene microparticles, optically guided in the waveguide’s evanescent field, are directed down the desired, more strongly illuminated, output branch. The output of a fibre laser at a wavelength of 1066 nm is coupled to the waveguide by direct butting. The power distribution between the two output branches is selected by the relative position of the fibre to the waveguide input facet. This provides a simple method for reliable particle sorting with very high probability of success under appropriate conditions. The method can be easily combined with other particle manipulation techniques of interest for micro total analysis systems of the future.

A Dynamic Bounding Volume Hierarchy for Generalized Collision Detection

Abstract: We propose a new dynamic and efficient bounding volume hierarchy for breakable objects undergoing structured and/or unstructured motion. Our object-space method is based on different ways to incrementally update the hierarchy during simulation by exploiting temporal coherence and lazy evaluation techniques. This leads to significant advantages in terms of execution speed. Furthermore, we also show how our method lends itself naturally for an adaptive low memory cost implementation, which may be of critical importance in some applications. Finally, we propose two different techniques for detecting self-intersections, one using our hierarchical data structure, and the other is an improved sorting-based method.

Task demands control acquisition and storage of visual information.

Abstract: Attention and working memory limitations set strict limits on visual representations, yet researchers have little appreciation of how these limits constrain the acquisition of information in ongoing visually guided behavior. Subjects performed a brick sorting task in a virtual environment. A change was made to 1 of the features of the brick being held on about 10% of trials. Rates of change detection for feature changes were generally low and depended on the pick-up and put-down relevance of the feature to the sorting task. Subjects' sorting decision suggests that changes may be missed because of a failure to update the changed feature. The authors also explore how hand and eye behavior are coordinated for strategic acquisition and storage of visual information throughout the task.

Sorting nexin-2 is associated with tubular elements of the early endosome, but is not essential for retromer-mediated endosome-to-TGN transport

Abstract: Sorting nexins are a large family of phox-homology-domain-containing proteins that have been implicated in the control of endosomal sorting. Sorting nexin-1 is a component of the mammalian retromer complex that regulates retrieval of the cation-independent mannose 6-phosphate receptor from endosomes to the trans-Golgi network. In yeast, retromer is composed of Vps5p (the orthologue of sorting nexin-1), Vps17p (a related sorting nexin) and a cargo selective subcomplex composed of Vps26p, Vps29p and Vps35p. With the exception of Vps17p, mammalian orthologues of all yeast retromer components have been identified. For Vps17p, one potential mammalian orthologue is sorting nexin-2. Here we show that, like sorting nexin-1, sorting nexin-2 binds phosphatidylinositol 3-monophosphate and phosphatidylinositol 3,5-bisphosphate, and possesses a Bin/Amphiphysin/Rvs domain that can sense membrane curvature. However, in contrast to sorting nexin-1, sorting nexin-2 could not induce membrane tubulation in vitro or in vivo. Functionally, we show that endogenous sorting nexin-1 and sorting nexin-2 co-localise on high curvature tubular elements of the 3-phosphoinositide-enriched early endosome, and that suppression of sorting nexin-2 does not perturb the degradative sorting of receptors for epidermal growth factor or transferrin, nor the steady-state distribution of the cation-independent mannose 6-phosphate receptor. However, suppression of sorting nexin-2 results in a subtle alteration in the kinetics of cation-independent mannose 6-phosphate receptor retrieval. These data suggest that although sorting nexin-2 may be a component of the retromer complex, its presence is not essential for the regulation of endosome-to-trans Golgi network retrieval of the cation-independent mannose 6-phosphate receptor.

System and method for filtering search query results

Abstract: A system and method for sorting or filtering search query results, wherein such invention provides for a process to access a database of service provider(s) information, a process for searching such service provider information, and a process for selectively sorting or filtering such service provider information based on area, individuals or groups of individuals the user trusts, thus, communicating such information to the user or member through conventional telecommunications and/or network infrastructure.

Simple and optimal output-sensitive construction of contour trees using monotone paths

Abstract: Contour trees are used when high-dimensional data are preprocessed for efficient extraction of isocontours for the purpose of visualization. So far, efficient algorithms for contour trees are based on processing the data in sorted order. We present a new algorithm that avoids sorting of the whole dataset, but sorts only a subset of so-called component-critical points. They form only a small fraction of the vertices in the dataset, for typical data that arise in practice. The algorithm is simple, achieves the optimal output-sensitive bound in running time, and works in any dimension. Our experiments show that the algorithm compares favorably with the previous best algorithm.

Post-bit: multimedia ePaper stickies

Abstract: The present invention relates to a device and methods for storing, sorting, sharing and communicating information with a device, which uses a tangible real-world user interface. In an embodiment of the invention, the device is intended to facilitate communication of information through intuitive operations and commands.

Apparatus and methods for identifying and processing mail using an identification code

Abstract: Apparatus and methods consistent with the present invention provide for identifying and processing mail using an identification code on a mailpiece as a redundant source of identification information in a mail sorting system. In one embodiment, this information is stored in a temporary database and used for the identification and processing of mail in a Remote Bar Code System (RBCS). In this embodiment, the identification code enables the automation of mail sorting and other processing tasks, reducing costs and delays in mail delivery services. In another embodiment, the identification and processing of mail occurs in an Identification Code Sorting (ICS) system. In this embodiment, a long-term database allows for mail sorting and other processing tasks on a national or global level.

A model-based evolutionary algorithm for bi-objective optimization

Abstract: The Pareto optimal solutions to a multi-objective optimization problem often distribute very regularly in both the decision space and the objective space. Most existing evolutionary algorithms do not explicitly take advantage of such a regularity. This paper proposed a model-based evolutionary algorithm (M-MOEA) for bi-objective optimization problems. Inspired by the ideas from estimation of distribution algorithms, M-MOEA uses a probability model to capture the regularity of the distribution of the Pareto optimal solutions. The local principal component analysis (local PCA) and the least-squares method are employed for building the model. New solutions are sampled from the model thus built. At alternate generations, M-MOEA uses crossover and mutation to produce new solutions. The selection in M-MOEA is the same as in non-dominated sorting genetic algorithm-II (NSGA-II). Therefore, MOEA can be regarded as a combination of EDA and NSGA-II. The preliminary experimental results show that M-MOEA performs better than NSGA-II.

New sorting-based lossless motion estimation algorithms and a partial distortion elimination performance analysis

Abstract: In video encoding, block motion estimation represents a CPU-intensive task. For this reason, many fast algorithms have been developed to improve searching and matching phases. A milestone within the lossless approach is partial distortion elimination (PDE/SpiralPDE) in which distortion is the difference between the block to be coded and the candidate prediction block. In this paper, (i) we analyze distortion behavior from local information using the Taylor series expansion and show that our general analysis includes other previous similar approaches. (ii) Then, we propose two full-search (lossless), fast-matching, block motion estimation algorithms, based on the PDE idea. The proposed algorithms, called fast full search with sorting by distortion (FFSSD) and fast full search with sorting by gradient (FFSSG), sort the contributions to distortion and the gradient values, respectively, in order to quickly discard invalid blocks. Experimental results show that the proposed algorithms outperform other existing full search algorithms, reducing by up to 20% the total CPU encoding time (with respect to SpiralPDE), while the computation strictly required by the motion estimation is reduced by about 30%. (iii) Finally, we experimentally find an operational lower bound (based on standard test sequences) for the average number of checked pixels in the PDE approach, which measures the performance of the searching and matching phases. In particular, SpiralPDE achieves performances very close to the searching phase bound, while there is still a remarkable margin on the matching phase. We then show that our algorithms, aimed at improving the performances of the matching phase, achieve interesting results, significantly approaching this margin.

Systems and methods for using radio frequency identification tags to communicating sorting information

Abstract: A system for sorting an item, said item having sorting indicia associated therewith comprising: a plurality of RFID tags equipped with lights that illuminate in response to a communication; a plurality of sorting locations, wherein each of said sorting locations is associated with one of said plurality of RFID tags; a data capture device configured to capture said sorting indicia from said item; a sort assist tool that receives said sorting indicia from said data capture device and associates a sorting instruction; and an interrogator that receives said sorting instruction and communicates with one of said plurality of RFID tags based at least in part on said sorting instruction such that said light on said one of said plurality of RFID tags illuminates; according method and use of the RFID tags for indication of a location.

Choice, Ranking and Sorting in Fuzzy Multiple Criteria Decision Aid

Abstract: In this chapter we survey several approaches to derive a recommendation from some preference models for multiple criteria decision aid. Depending on the specificities of the decision problem, the recommendation can be a selection of the best alternatives, a ranking of these alternatives or a sorting. We detail a sorting procedure for the assignment of alternatives to graded classes when the available information is given by interacting points of view and a subset of prototypic alternatives whose assignment is given beforehand. A software dedicated to that approach (TOMASO) is briefly presented. Finally we define the concepts of good and bad choices based on dominant and absorbant kernels in the valued digraph that corresponds to an ordinal valued outranking relation. Aggregation with fuzzy environment, fuzzy choice, ordinal ordered sorting, choquet integral, TOMASO.

Ultra high-speed sorting.

Abstract: Background: Cell sorting has a history dating back approximately 40 years. The main limitation has been that, although flow cytometry is a science, cell sorting has been an art during most of this time. Recent advances in assisting technologies have helped to decrease the amount of expertise necessary to perform sorting. Methods: Droplet-based sorting is based on a controlled disturbance of a jet stream dependent on surface tension. Sorting yield and purity are highly dependent on stable jet break-off position. System pressures and orifice diameters dictate the number of droplets per second, which is the sort rate limiting step because modern electronics can more than handle the higher cell signal processing rates. Results: Cell sorting still requires considerable expertise. Complex multicolor sorting also requires new and more sophisticated sort decisions, especially when cell subpopulations are rare and need to be extracted from background. High-speed sorting continues to pose major problems in terms of biosafety due to the aerosols generated. Conclusions: Cell sorting has become more stable and predictable and requires less expertise to operate. However, the problems of aerosol containment continue to make droplet-based cell sorting problematical. Fluid physics and cell viability restraints pose practical limits for high-speed sorting that have almost been reached. Over the next 5 years there may be advances in fluidic switching sorting in lab-on-a-chip microfluidic systems that could not only solve the aerosol and viability problems but also make ultra high-speed sorting possible and practical through massively parallel and exponential staging microfluidic architectures. q 2005 International Society for Analytical Cytology Key terms: cell sorting; ultra high speed; flow cytometry

Microscale sorting cytometer

Abstract: The present invention provides a device and methods of use thereof in microscale cell sorting. This invention provides sorting cytometers, which trap individual cells within vessels following exposure to dielectrophoresis, allow for the assaying of trapped cells, such that a population is identified whose isolation is desired, and their isolation.

Unsupervised spatial pattern classification of electrical-wafer-sorting maps in semiconductor manufacturing

Abstract: In semiconductor manufacturing, the spatial pattern of failed devices in a wafer can give precious hints on which step of the process is responsible for the failures. In the literature, Kohonen's Self Organizing Feature Maps (SOM) and Adaptive Resonance Theory 1 (ART1) architectures have been compared, concluding that the latter are to be preferred. However, both the simulated and the real data sets used for validation and comparison were very limited. In this paper, the use of ART1 and SOM as wafer classifiers is re-assessed on much more extensive simulated and real data sets. We conclude that ART1 is not adequate, whereas SOM provide completely satisfactory results including visually effective representation of spatial failure probability of the pattern classes.

Method and system for activity based email sorting

Abstract: Messages of a user are ranked based on metrics derived from user actions with regard to the messages. Groupings of messages, such as conversations or a set of messages that are determined to be similar, may also be ranked. When new messages are received, their interest to the user is estimated based on rankings of messages and message groupings to which the new message is related. The new messages may be made more or less prominent based on the estimated interest to the user.