We adapt techniques employed in the design of parallel sorting algorithms to propose new sequential and multi-core sorting operations. The proposed approach is used to develop asymptotically efficient deterministic and randomized sorting operations whose practical sequential and multi-core performance, as witnessed by an experimental study, matches or surpasses existing optimized sorting algori...

Efficient sorting is a key requirement for many computer science algorithms. Acceleration of existing techniques as well as developing new sorting approaches is crucial for many realtime graphics scenarios, database systems, and numerical simulations to name just a few. It is one of the most fundamental operations to organize and filter the ever growing massive amounts of data gathered on a dai...

One model for dendritic protein sorting in neurons is based on parallels with basolateral targeting in Madin-Darby Canine Kidney (MDCK) epithelial cells. The goal of this study was to further evaluate this model by analyzing the neuronal targeting of several proteins that contain well-defined basolateral sorting motifs. When we expressed FcRgammaII-B2 and CD44, two basolateral markers whose sor...

Sorting is an important operation for a number of embedded applications. As sorting large datasets may impose undesired performance degradation, acceleration units coupled to the embedded processor can be an interesting solution for speeding-up the computations. This paper presents and evaluates three hardware sorting units, bearing in mind embedded computing systems implemented with FPGAs. The...

Automated sorting for plastic recyclables has been seen as the way forward in the plastic recycling industry. Automated sorting provides significant improvements in terms of efficiency and consistency in the sorting process. In the case of macro sorting, which is the most common type of automated sorting, efficiency is determined by the mechanical details of the material handling system as well...

Sorting is a common and ubiquitous activity for computers. It is not surprising that there exist a plethora of sorting algorithms. For all the sorting algorithms, it is an accepted performance limit that sorting algorithms are linearithmic or O(N lg N). The linearithmic lower bound in performance stems from the fact that the sorting algorithms use the ordering property of the data. The sorting ...

We examine whether the sorting of differently achieving students into differently sized classes results in a regressive or compensatory pattern of class sizes for a sample of national school systems. Sorting effects are identified by subtracting the causal effect of class size on performance from their total correlation. Our empirical results indicate substantial compensatory sorting within and...

Modern flow cytometric cell sorters are all capable of so-called "high-speed sorting." However, there is confusion about exactly how fast a "high-speed" cell sorter can sort cells. There are many considerations in achieving the fastest sorting speed, as well as the highest quality sort results--cell recovery, purity, and functionality. This requires the same considerations required for "slow-sp...

OBJECTIVE Brain-computer interfaces (BCIs) are a promising technology for restoring motor ability to paralyzed patients. Spiking-based BCIs have successfully been used in clinical trials to control multi-degree-of-freedom robotic devices. Current implementations of these devices require a lengthy spike-sorting step, which is an obstacle to moving this technology from the lab to the clinic. A vi...

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 j...