A new sorting network with exactly the same size and depth as the odd-even sorting network is presented. This sorting network is designed using the zero-one principle, and proceeds by first sorting pairs of bits and sorting the pairs into lexicographic order.

Polarized distribution of plasma membrane transporters and receptors in epithelia is essential for vectorial functions of epithelia. This polarity is maintained by sorting of membrane proteins into apical or basolateral transport containers in the trans-Golgi network and/or endosomes followed by their delivery to the appropriate plasma membrane domains. Sorting depends on the recognition of sor...

Sorting is still one of the most important problems in Computer Science. Work in transformational programming and automatic program synthesis provided the insight that led to Merritt’s inverted taxonomy of sorting algorithms, a high-level, top-down, conceptually simple and symmetric categorization of sorting algorithms. More recent work in logic-based program synthesis by Lau has produced a log...

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