Data Structure is one of the fundamental areas of the computer science. Sorting is crucial in data structure, which creates the list of sequence items. In this paper, we present two techniques of sorting algorithm for natural numbers, which uses the array indexing methodology and insert that number into the proper index of the array without performing any element comparisons and swapping. The f...

Sorting networks are implementations of parallel sorting algorithms that have many important applications like routing where they are more powerful than other networks like the Omeganetwork [Law75]. Sorting networks are essentially combinational hardware circuits that consist of only compare/exchange modules. While a recursive definition of an asymptotically optimal sorting network is known [AK...

Building upon work of Milner, Leifer, Jensen and ourselves, we develop a theory of sorted bigraphical reactive systems. Concretely, we show how to automatically get a sorting on bigraphs sustaining the behavioural theory of pure bigraphical reactive systems by lifting a safe sorting on the underlying reactive system of abstract bigraphs. We back this result by a general construction of a safe s...

In polarized Madin-Darby canine kidney (MDCK) cells, the transferrin receptor (TR) is selectively delivered to the basolateral surface, where it internalizes transferrin via clathrin-coated pits and recycles back to the basolateral border. Mutant tailless receptors are sorted randomly in both the biosynthetic and endocytic pathways, indicating that the basolateral sorting of TR is dependent upo...

The pancake problem, which has attracted considerable attention, concerns the number of prefix reversals needed to sort the elements of an arbitrary permutation. The number of prefix reversals to sort permutations is also the diameter of the often studied n-dimensional Pancake network. We consider restricted pancake problem, when only k of the possible n− 1 prefix reversals are allowed.

Apical and basolateral proteins are maintained within distinct membrane subdomains in polarized epithelial cells by biosynthetic and postendocytic sorting processes. Sorting of basolateral proteins in these processes has been well studied; however, the sorting signals and mechanisms that direct proteins to the apical surface are less well understood. We previously demonstrated that an N-glycan-...

This paper studies new properties of the front and back ends of a sorting network, and illustrates the utility of these in the search for new bounds on optimal sorting networks. Search focuses first on the “outsides” of the network and then on the inner part. All previous works focus only on properties of the front end of networks and on how to apply these to break symmetries in the search. The...

Abstract. This paper considers integer sorting on a RAM. We show This paper considers integer sorting on a RAM. We show that adaptive sorting of a sequence with qn inversions is asymptotically equivalent to multisorting groups of at most q keys, and a total of n keys. Using the recent O(n √ log logn) expected time sorting of Han and Thorup on each set, we immediately get an adaptive expected so...

A new object sorting device using impulsive manipulation and air floating will be developed. First, two methods for impulsive object sorting are evaluated using computer simulation for the design of a sorting device. Second, an object sorting system with air floating will be developed. Finally, the developed system is evaluated experimentally.

This paper considers the job scheduling problem in virtual manufacturing cells (VMCs) with the goal of minimizing two objectives namely, makespan and total travelling distance. To solve this problem two algorithms are proposed: traditional non-dominated sorting genetic algorithm (NSGA-II) and knowledge-based non-dominated sorting genetic algorithm (KBNSGA-II). The difference between these algor...