Showing papers on "Sorting published in 2004"

Unsupervised spike detection and sorting with wavelets and superparamagnetic clustering

Abstract: This study introduces a new method for detecting and sorting spikes from multiunit recordings The method combines the wavelet transform, which localizes distinctive spike features, with superparamagnetic clustering, which allows automatic classification of the data without assumptions such as low variance or gaussian distributions Moreover, an improved method for setting amplitude thresholds for spike detection is proposed We describe several criteria for implementation that render the algorithm unsupervised and fast The algorithm is compared to other conventional methods using several simulated data sets whose characteristics closely resemble those of in vivo recordings For these data sets, we found that the proposed algorithm outperformed conventional methods

Easy-to-use data report specification

Abstract: A method and system for the graphical specification and modification of reports is disclosed which enables data reports to be easily created via a report design dialogue The report design dialogue includes a group-level outline panel containing controls for grouping, as well as other report controls such as those for sorting and aggregating A method and system for creating a group-level outline panel using an existing database report is also disclosed Finally, a computer-readable medium storing a computer-interpretable data structure that stores one or more report specifications is disclosed

System and method for filtering and sorting data

Abstract: System and method for filtering and sorting data. The system includes data management system for displaying a data table having a plurality of rows and columns of data cells. Each of the columns in the data table has an associated filter cell whereby the user may input filter criteria. In response to receiving the filter criteria in the filter cells, a data management system filters and sorts each of the data cells in the data table. In one embodiment of the invention, the data management system records the order in which the user inputs the filter criteria and generates a sorting priority list that defines a sorting priority for the data cells. The data management system sorts the data cells using the sorting priority list. Furthermore, in one embodiment of the invention, the data management system displays the data cells that satisfy the filter criteria contiguously and interleaved between those data cells that do not satisfy the filter criteria.

The analysis of evolutionary algorithms on sorting and shortest paths problems

Abstract: The analysis of evolutionary algorithms is up to now limited to special classes of functions and fitness landscapes. E.g., it is not possible to characterize the set of TSP instances (or another NP-hard combinatorial optimization problem) which are solved by a generic evolutionary algorithm (EA) in an expected time bounded by some given polynomial. As a first step from artificial functions to typical problems from combinatorial optimization, we analyze simple EAs on well-known problems, namely sorting and shortest paths. Although it cannot be expected that EAs outperform the well-known problem specific algorithms on these simple problems, it is interesting to analyze how EAs work on these problems. The following results are obtained: - Sorting is the maximization of “sortedness” which is measured by one of several well-known measures of presortedness. The different measures of presortedness lead to fitness functions of quite different difficulty for EAs. - Shortest paths problems are hard for all types of EA, if they are considered as single-objective optimization problems, whereas they are easy as multi-objective optimization problems.

One-dimensional numerical model for nonuniform sediment transport under unsteady flows in channel networks

Abstract: In this study, the proposed one-dimensional model simulates the nonequilibrium transport of nonuniform total load under unsteady flow conditions in dendritic channel networks with hydraulic structures. The equations of sediment transport, bed changes, and bed-material sorting are solved in a coupling procedure with a direct solution technique, while still decoupled from the flow model. This coupled model for sediment calculation is more stable and less likely to produce negative values for bed-material gradation than the traditional fully decoupled model. The sediment transport capacity is calculated by one of four formulas, which have taken into consideration the hiding and exposure mechanism of nonuniform sediment transport. The fluvial erosion at bank toes and the mass failure of banks are simulated to complement the modeling of bed morphological changes in channels. The tests in several cases show that the present model is capable of predicting sediment transport, bed changes, and bed-material sorting in various situations, with reasonable accuracy and reliability.

Microfluidics: Sorting particles with light

Abstract: Microfluidic systems have great potential to perform complex chemical and biological processing and analysis on a single disposable chip. That goal is now a step closer with the demonstration of an efficient all-optical particle sorter.

Main Memory Evaluation of Monitoring Queries Over Moving Objects

Abstract: In this paper we evaluate several in-memory algorithms for efficient and scalable processing of continuous range queries over collections of moving objects. Constant updates to the index are avoided by query indexing. No constraints are imposed on the speed or path of moving objects or fraction of objects that move at any moment in time. We present a detailed analysis of a grid approach which shows the best results for both skewed and uniform data. A sorting based optimization is developed for significantly improving the cache hit-rate. Experimental evaluation establishes that indexing queries using the grid index yields orders of magnitude better performance than other index structures such as R*-trees.

Non-destructive on-chip cell sorting system with real-time microscopic image processing.

Abstract: Studying cell functions for cellomics studies often requires the use of purified individual cells from mixtures of various kinds of cells. We have developed a new non-destructive on-chip cell sorting system for single cell based cultivation, by exploiting the advantage of microfluidics and electrostatic force. The system consists of the following two parts: a cell sorting chip made of poly-dimethylsiloxane (PDMS) on a 0.2-mm-thick glass slide, and an image analysis system with a phase-contrast/fluorescence microscope. The unique features of our system include (i) identification of a target from sample cells is achieved by comparison of the 0.2-μm-resolution phase-contrast and fluorescence images of cells in the microchannel every 1/30 s; (ii) non-destructive sorting of target cells in a laminar flow by application of electrostatic repulsion force for removing unrequited cells from the one laminar flow to the other; (iii) the use of agar gel for electrodes in order to minimize the effect on cells by electrochemical reactions of electrodes, and (iv) pre-filter, which was fabricated within the channel for removal of dust contained in a sample solution from tissue extracts. The sorting chip is capable of continuous operation and we have purified more than ten thousand cells for cultivation without damaging them. Our design has proved to be very efficient and suitable for the routine use in cell purification experiments.

An Equilibrium Model of Sorting in an Urban Housing Market

Abstract: This paper introduces an equilibrium framework for analyzing residential sorting, designed to take advantage of newly available restricted-access Census microdata. The framework adds an equilibrium concept to the discrete choice framework developed by McFadden (1973, 1978), permitting a more flexible characterization of preferences than has been possible in previously estimated sorting models. Using data on nearly a quarter of a million households residing in the San Francisco Bay Area in 1990, our estimates provide a precise characterization of preferences for many housing and neighborhood attributes, showing how demand for these attributes varies with a household's income, race, education, and family structure. We use the equilibrium model in combination with these estimates to explore the effects of an increase in income inequality, the findings indicating that much of the increased spending power of the rich is absorbed by higher housing prices.

A dynamically tuned sorting library

Abstract: Empirical search is a strategy used during the installation of library generators such as ATLAS, FFTW, and SPIRAL to identify the algorithm or the version of an algorithm that delivers the best performance. In the past, empirical search has been applied almost exclusively to scientific problems. In this paper, we discuss the application of empirical search to sorting, which is one of the best understood symbolic computing problems. When contrasted with the dense numerical computations of ATLAS, FFTW, and SPIRAL, sorting presents a new challenge, namely that the relative performance of the algorithms depend not only on the characteristics of the target machine and the size of the input data but also on the distribution of values in the input data set. Empirical search is applied in the study reported here as part of a sorting library generator. The resulting routines dynamically adapt to the characteristics of the input data by selecting the best sorting algorithm from a small set of alternatives. To generate the run time selection mechanism our generator makes use of machine learning to predict the best algorithm as a function of the characteristics of the input data set and the performance of the different algorithms on the target machine. This prediction is based on the data obtained through empirical search at installation time. Our results show that our approach is quite effective. When sorting data inputs of 12M keys with various standard deviations, our adaptive approach selected the best algorithm for all the input data sets and all platforms that we tried in our experiments. The wrong decision could have introduced a performance degradation of up to 133%, with an average value of 44%.

A Cooperative Coevolutionary Multiobjective Algorithm Using Non-dominated Sorting

Abstract: The following paper describes a cooperative coevolutionary algorithm which incorporates a novel collaboration formation mechanism. It encourages rewarding of components participating in successful collaborations from each sub-population. The successfulness of the collaboration is measured by a non-dominated sorting procedure. The algorithm has demonstrated it can perform comparably with the NSGA-II on some multiobjective function optimization problems.

Sorting by Reversals in Subquadratic Time

Abstract: The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permutations of the same elements (e.g. orthologous genes), the problem consists in finding a most parsimonious scenario of reversals that transforms one genome into the other. We propose a method for sorting a signed permutation by reversals in time \(O(n\sqrt{n\log n})\). The best known algorithms run in time O(n 2), the main obstacle to an improvement being a costly operation of detection of so-called “safe” reversals. We bypass this detection and, using the same data structure as a previous random approximation algorithm, we achieve the same subquadratic complexity for finding an exact optimal solution. This answers an open question by Ozery-Flato and Shamir whether a subquadratic complexity could ever be achieved for solving the problem.

Dual input charger with cable sorting mechanism

Abstract: A charger capable of converting either alternating current or direct current power source, with a cable sorting mechanism, is disclosed. The device includes a main body to incorporate other components, an in-car connecting component which can be connected to the cigarette lighter of a car, a house connecting component which can be connected to the AC receptacle, and a cable sorting device having a spiral structure to smoothly store the charging cable. Because the dual input charger is so compact that a consumer can carry easily the charger and to choose either the in-car connecting component or the house connecting component, depending on the conditions he faces with. When the charging is finished, a consumer can readily grasp and rotate the charger to sequentially wind the charging cable into the continuous spiral groove of the cable sorting device.

Language Identification from Text Using N-gram Based Cumulative Frequency Addition

Abstract: This paper describes the preliminary results of an efficient language classifier using an ad-hoc Cumulative Frequency Addition of N-grams. The new classification technique is simpler than the conventional Naive Bayesian classification method, but it performs similarly in speed overall and better in accuracy on short input strings. The classifier is also 5-10 times faster than N-gram based rank-order statistical classifiers. Language classification using N-gram based rank-order statistics has been shown to be highly accurate and insensitive to typographical errors, and, as a result, this method has been extensively researched and documented in the language processing literature. However, classification using rank-order statistics is slower than other methods due to the inherent requirement of frequency counting and sorting of N-grams in the test document profile. Accuracy and speed of classification are crucial for a classier to be useful in a high volume categorization environment. Thus, it is important to investigate the performance of the N-gram based classification methods. In particular, if it is possible to eliminate the counting and sorting operations in the rank-order statistics methods, classification speed could be increased substantially. The classifier described here accomplishes that goal by using a new Cumulative Frequency Addition method.

Algorithms for Building Annular Structures with Minimalist Robots Inspired by Brood Sorting in Ant Colonies

Abstract: This study shows that a task as complicated as multi-object ‘ant-like annular sorting’ can be accomplished with ‘minimalist’ solutions employing simple mechanisms and minimal hardware. It provides an alternative to ‘patch sorting’ for multi-object sorting. Three different mechanisms, based on hypotheses about the behaviour of Leptothorax ants are investigated and comparisons are made. Mechanism I employs a simple clustering algorithm, with objects of different sizes. The mechanism explores the idea that it is the size difference of the object that promotes segregation. Mechanism II is an extension to our earlier two-object segregation mechanism. We test the ability of this mechanism to segregate an increased number of object types. Mechanism III uses a combined leaky integrator, which allows a greater segregation of object types while retaining the compactness of the structure. Its performance is improved by optimizing the mechanism's parameters using a genetic algorithm. We compare the three mechanisms in terms of sorting performance. Comparisons between the results of these sorting mechanisms and the behaviour of ants should facilitate further insights into both biological and robotic research and make a contribution to the further development of swarm robotics.

Sorting and Choice in English Secondary Schools

Abstract: This paper focuses on one of the outcomes arising from England’s choice based education system; the extent to which different types of pupils are sorted across schools. Pupil sorting will in turn impact on attainment outcomes, if there are peer group effects operating within schools. We consider three dimensions across which sorting may occur: ethnicity, income, and, for the first time using UK data, ability. We use a very large administrative dataset which contains linked histories of test scores for every pupil in England, as well as pupil level markers for ethnicity and low household income, and their home postcode (zip code). We first establish that choice is both feasible for and exercised by the majority of pupils in England. We then characterise and describe ability sorting and related it to feasibility of choice. We compare sorting across schools with sorting across neighbourhoods. We establish that post-residential school choice is an important component of the overall schooling decision. We show that there is a difference in the school-neighbourhood sorting relationship between areas that operate under different student-to-school assignment rules.

Cache-conscious sorting of large sets of strings with dynamic tries

Abstract: Ongoing changes in computer architecture are affecting the efficiency of string-sorting algorithms. The size of main memory in typical computers continues to grow but memory accesses require increasing numbers of instruction cycles, which is a problem for the most efficient of the existing string-sorting algorithms as they do not utilize cache well for large data sets. We propose a new sorting algorithm for strings, burstsort, based on dynamic construction of a compact trie in which strings are kept in buckets. It is simple, fast, and efficient. We experimentally explore key implementation options and compare burstsort to existing string-sorting algorithms on large and small sets of strings with a range of characteristics. These experiments show that, for large sets of strings, burstsort is almost twice as fast as any previous algorithm, primarily due to a lower rate of cache miss.

Spreadsheet grid-like control for a web-based collaboration system

Abstract: The present invention is provides a system and method for interacting with data from a collaboration system over a network. Collaboration data is obtained from the collaboration system and stored locally at the client. Operations such as sorting and filtering may be completed by the local client without any interaction from the collaboration server. When an operation such as adding, changing, and deleting data is performed the collaboration server is contacted to determine whether or not the change is valid. Changes made to the local data automatically update the data at the collaboration server. List controls are added to the browser user interface that are similar to a spreadsheet, such as MS Excel, which enables a user to view, add, change, or delete information corresponding to the data stored by the collaboration system in a manner in which they are familiar.

Data Structures: A Pseudocode Approach with C

Abstract: Part 1: Introduction 1. Basic Concepts 2. Recursion Part 2: Linear Lists 3. Stacks 4. Queues 5. General Linear Lists Part 3: Non-Linear Lists 6. Introduction to Trees 7. Binary Search Trees 8. AVL Search Trees 9. Heaps 10. Multiway Trees 11. Graphs Part 4: Sorting and Searching 12. Sorting 13. Searching Appendices A: ASCII Tables B: Structure Charts C: Integer and Float Libraries D: Selected C Libraries E: Mathematical Series and Recursive Relations F: Array Implementations of Stacks and Queues

Study on color image processing based intelligent fruit sorting system

Abstract: A machine vision system that can be used for automatic high-speed fruit sorting is proposed. Fruit area was first segmented out from image with an Ohta-color-space based thresholding algorithm; blob algorithm was utilized to remove noises in image; spline-interpolation based algorithm was adopted to detect fruit contour. In fruit sorting process, fruit's color ratio, which was calculated with HSI color space, was selected as classification feature. Fruit sorting was realized by classic Bayes classifier, whose parameters were obtained by a study module. This system was tested with Crystal Fuji apples, and an average sorting accuracy of 90% was achieved.

System and method for mining and searching localized business-marketing and informational data

Abstract: A system and method for searching records. One embodiment includes a method for searching comprising: receiving a search a term comprising a product term and a geography limitation; identifying a normalized term corresponding to the product term; identify a first set of records corresponding to the normalized term; sorting the first set of records according to the geography limitation; returning at least some of the first set of records according to the sort; identifying navigation links corresponding to the normalized term; identifying a second set of records corresponding to at least one of the navigation links; and returning at least some of the second set of records.

System and method for ordering query results

Abstract: A system, method and article of manufacture for managing query results and, more particularly, for sorting data records contained in a query result obtained in response to execution of a query against a database. In one embodiment, the data records in the query result are sorted on the basis of related information which is retrieved from a corresponding data source. In another embodiment, the sorting is performed on the basis of a value variance which is determined for each of the data records in the query result. In still another embodiment, the sorting is performed on the basis of a requested value range coverage. In yet another embodiment, the sorting is performed on the basis of suitability scores which are determined with respect to analysis routines which are configured for processing the query result.

Multi-objective Optimization of an Industrial Crude Distillation Unit Using the Elitist Non-Dominated Sorting Genetic Algorithm

Abstract: This study provides insights into the optimal operation of one of the most important refinery units, namely, the crude distillation unit (CDU). A steady state model based on (C+3) iteration variables is used to simulate an industrial column. The model is first tuned using some industrial data. The elitist non-dominated sorting genetic algorithm (NSGA-II) is used to solve a few meaningful multi-objective optimization problems. It is observed that current plant operation is sub-optimal and more profit can be realized for the same amount of energy cost using the optimal operating conditions found. Also, it was found that profit can be increased keeping the product properties within acceptable limits. The procedure used is quite general and can be applied to other CDUs.

A 1.5-Approximation Algorithm for Sorting by Transpositions and Transreversals

Abstract: One of the most promising ways to determine evolutionary distance between two organisms is to compare the order of appearance of orthologous genes in their genomes. The resulting genome rearrangement problem calls for finding a shortest sequence of rearrangement operations that sorts one genome into the other. In this paper we provide a 1.5-approximation algorithm for the problem of sorting by transpositions and transreversals, improving on a five years old 1.75 ratio for this problem. Our algorithm is also faster than current approaches and requires \(O(n^{3/2} \sqrt{\log{n}})\) time for n genes.