Sorting

This paper presents a new intensity-to-time processing paradigm suitable for very large scale integration (VLSI) computational sensor implementation of global operations over sensed images. Global image quantities usually describe images with fewer data. When computed at the point of sensing, global quantities result in a low-latency performance due to the reduced data transfer requirements between an image sensor and a processor. The global quantities also help global top-down adaptation: the quantities are continuously computed on-chip, and are readily available to sensing for adaptation. As an example, we have developed a sorting image computational sensor-a VLSI chip which senses an image and sorts all pixel by their intensities. The first sorting sensor prototype is a 21 2 2 2 26 array of cells. It receives an image optically, senses it, and computes the image's cumulative histogram-a global quantity which can be quickly routed off chip via one pin. In addition, the global cumulative histogram is used internally on-chip in a top-down fashion to adapt the values in individual pixel so as to reflect the index of the incoming light, thus computing an "image of indices." The image of indices never saturates and has a uniform histogram.

Clio, the IBM Research system for expressing declarative schema mappings, has progressed in the past few years from a research prototype into a technology that is behind some of IBM's mapping technology. Clio provides a declarative way of specifying schema mappings between either XML or relational schemas. Mappings are compiled into an abstract query graph representation that captures the transformation semantics of the mappings. The query graph can then be serialized into different query languages, depending on the kind of schemas and systems involved in the mapping. Clio currently produces XQuery, XSLT, SQL, and SQL/XML queries. In this paper, we revisit the architecture and algorithms behind Clio. We then discuss some implementation issues, optimizations needed for scalability, and general lessons learned in the road towards creating an industrial-strength tool.

The common tusk in computer gruphics is to visuulise models of real world objects. These models are often represented by triungulur mesh, which can be very large und complex (thousands or million triangles). Since we want U fust und inteructive munipulution with the models, we need either to improve our gruphics hurdwure or to find any method for reducing number of triangles in the mesh. We present here u fust ulgorithm for triungulur mesh reduction bused on the principle of mesh decimution.

A framework for measuring the performance of distributed programs is presented. This framework includes a model of distributed programs, a description of the measurement principles and methods, and a guideline for implementing these ideas. The author describes a measurement system called the Distributed Programs Monitor (DPM), which he has constructed on the basis of these concepts. DPM has been implemented and used for measurement studies on two different operating systems, DEMOS/MP and Berkeley Unix.

The problem addressed in this paper is the allocation of multiple advertisements on a Web banner, in order to maximize the revenue of the allocated advertisements. It is essentially a two-dimensional, single, orthogonal, knapsack problem, applied to pixel advertisement. As this problem is known to be NP-hard, and due to the temporal constraints that Web applications need to fulfill, we propose several heuristic algorithms for generating allocation patterns. The heuristic algorithms presented in this paper are the left justified algorithm, the orthogonal algorithm, the GRASP constructive algorithm, and the greedy stripping algorithm. We set out an experimental design using standard banner sizes, and primary and secondary sorting criteria for the set of advertisements. We run two simulations, the first simulation compares the heuristics with an optimal solution found using brute force search, and the second simulation compares the heuristic algorithms to gain a better insight into their performance. Finding a suitable pattern generating algorithm is a trade-off between effectiveness and efficiency. Results indicate that allocating advertisements with the orthogonal algorithm is the most effective. In contrast, allocating advertisements using the greedy stripping algorithm is the most efficient. Furthermore, the best settings per algorithm for each banner size are given.

Abstract: ASP .NET web applications typically employ server controls to provide dynamic web pages, and data-bound server controls to display and maintain database data. Most developers use default properties of ASP .NET server controls when developing web applications, which allows for rapid development of workable applications. However, creating a high-performance, multi-user, and scalable web application requires enhancement of server controls using custom-made code. In this empirical study we ...

ABSTRACT Central Processing Units (CPUs) are task-parallel, latency-oriented processors, while Graphics Processing Units (GPUs) are data-parallel, throughput oriented processors. Besides their traditional use as graphics coprocessors, the GPUs have been used in recent years for general purpose computations, too. Rapid development of graphics hardware led to an extensive use in both scientific and commercial applications. Numerous papers report high speedups in various domains. This paper presents an effort to bring GPU computing closer to programmers and wider community of users. GPU computing is explored through NVIDIA Compute Unified Device Architecture (CUDA) that is currently the most mature application programming interface (API) for general purpose computation on GPUs.

Hubs are special facilities that serve as switching, transshipment and sorting points in many-to-many distribution systems. The hub location problem is concerned with locating hub facilities and allocating demand nodes to hubs in order to route the traffic between origin-destination pairs. In this paper we classify and survey network hub location models. We also include some recent trends on hub location and provide a synthesis of the literature. inter-hub connections; and that no direct service (between two non-hub nodes) is allowed. Although these assumptions are relaxed in some studies, this paper assumes that these three assumptions are satisfied unless otherwise stated. This paper classifies and surveys network hub location models. In network hub location problems there is a given network with n nodes on which the set of origins, destinations and potential hub locations are identified. The flow between origin-destination pairs, an attribute of interest associated with flows on links in the network (cost, time, distance, etc.) and the hub-to-hub transportation discount factor a are known.

This paper is intended to develop an algorithm visualization, particularly selection sorting for an Algorithm and Programming course. Algorithm visualization technology graphically illustrates how algorithms work. This visualization can be used to explain how all data move to the proper position in order to be sorted in a display computer for education. This research consists of 6 steps which are concept, design, obtaining content material,
assembly, testing, and distribution. During the testing step, the application is run and checked to confirm that it performs exactly what the author has intended and the students can learn selection sorting algorithm by studying the visualization. Subjects of the research were students at Department of Informatics Universitas Persada Indonesia YAI for implementation of the learning. The data were analysed using the analytic descriptive method and interpreted in a narrative way based on the research findings. The algorithm visualization indicates that students increase their motivation and ability to program variety of sorting in programming language they learn.

Most contemporary processors offer some version of Single Instruction Multiple Data (SIMD) machinery -vector registers and instructions to manipulate data stored in such registers. The central idea of this paper is to use these SIMD resources to improve the performance of the tail of recursive sorting algorithms. When the number of elements to be sorted reaches a set threshold, data is loaded into the vector registers, manipulated in-register, and the result stored back to memory. Three implementations of sorting with two different SIMD machineries -x86-64's SSE2 and G5's AltiVec -demonstrate that this idea delivers significant speed improvements. The improvements provided are orthogonal to the gains obtained through empirical search for a suitable sorting algorithm . When integrated with the Dynamically Tuned Sorting Library (DTSL) this new code generation strategy reduces the time spent by DTSL up to 22% for moderately-sized arrays, with greater relative reductions for small arrays. Wall-clock performance of d-heaps is improved by up to 39% using a similar technique.

Sorting is one of the most well-known problems in computer science and is frequently used for benchmarking computer systems. It can contribute significantly to the overall execution time of a process in a computer system. Dedicated sorting architectures can be used to accelerate applications and/or to reduce energy consumption. In this paper, we propose an efficient sorting network aiming at accelerating the sorting operation in FPGA-based embedded systems. The proposed sorting network is implemented based on an Optimized Oddeven sorting method ( ) using fully pipelined combinational logic architecture and ring shape processing. Consequently, generates the sorted array of numbers in parallel when the input array of numbers is given, without any delay or lag. Unlike conventional sorting networks, sorting network does not need memory to hold data and information about sorting, and neither need input clock to perform the sorting operations sequentially. We conclude that by using in FPGA-based image processing, we can optimize the performance of filters such as median filter which demands high performance sorting operations for realtime applications.

In this paper, we consider sorting problem with n elements distributed over a number of processing entities in a distributed system. We have derived an alternative, efficient algorithm with the worst case lower bound of (n − 1) rounds for distributed sorting on a line network, where n is the number of processors. The proposed distributed sorting algorithm improves the performance of each processor without creating copies of (n − 2) elements at intermediate processors and reduces the execution time of Sasaki's time−optimal algorithm [A.Sasaki, A time-optimal distributed sorting algorithm on a line network, Inform. Process. Lett., 83(2002) pp. 21-26]. Also all processors do not necessarily perform the disjoint comparison-exchange operations and simulation results show that the proposed algorithm results in better execution time with the identity of processors. This algorithm could also be extended for sorting the distributed elements on the linear embedding obtained from a general network.

Fast bit-reversal algorithms have been of strong interest for many decades, especially after Cooley and Tukey introduced their FFT implementation in 1965. Many recent algorithms, including FFTW try to avoid the bit-reversal all together by doing in-place algorithms within their FFTs. We therefore motivate our work by showing that for FFTs of up to 65.536 points, a minimally tuned Cooley-Tukey FFT in C using our bit-reversal algorithm performs comparable or better than the default FFTW algorithm.

Block sorting is used in connection with optical character recognition (OCR). Recent work has focused on finding good strategies which perform well in practice. Block sorting is N P-hard and all of the previously known heuristics lack proof of any approximation ratio. We present here an approximation algorithm for the block sorting problem with approximation ratio of 2 and run time O(n 2 ). The approximation algorithm is based on finding an optimal sequence of absolute block deletions.

The meta-paper describes and analyzes the performance of sorting algorithms: SelectionSort, InsertionSort, BubbleSort, ShellSort, QuickSort and MergeSort. The analysis consists of comparing algorithms using three performance metrics: number of key comparisons, copy number of records held and the total time spent sorting. Resumo. O meta-artigo descreve e analisa o desempenho dos algoritmos de ordenação: SelectionSort, InsertionSort, BubbleSort, ShellSort, QuickSort e MergeSort. A análise consiste em comparar os algoritmos considerando três métricas de desempenho: número de comparações de chaves, número de cópia de registros realizadas e o tempo total gasto para ordenação. Palavras-Chave. métodos, ordenação, bubble ,quick, merge.

Fig. 1. Transparency and Anti-Aliasing play an important role in visual cues and image quality of computer-generated images. Achieving real-time rendering with high-quality images is challenging. In this tutorial, we summarize state-of-the-art techniques to handle both problems.

Acquiring knowledge about algorithms and programming skills is a difficult and complex process in particular. Various algorithm visualization systems have been developed, using animation techniques to illustrate the behavior of basic algorithms, to facilitate students' learning and skills development. This paper presents DAVE, an interactive dynamic algorithm visualization system for the introductory lessons in algorithm design and programming. DAVE allows students' experimentation not only with sample algorithms, constructed by the designer, but, mainly, with the automatic animation of their own algorithms.

The Automatic Sorting Machine is used to sort different types of products or commodities based on the barcode provided on them. This gives a provision to reduce the manual effort and hence human error by replacing the conventional methods of sorting in areas involving hectic sorting. The system comes into play in airports and other industrial distribution centres where the products or commodities have to be sorted into batches in order to take them to their respective destination. The products are put on a conveyer system where they are scanned for the particular barcode provided on them. Depending on the barcode, they are placed on the respective carriers automatically where these carriers dispatch them to the corresponding destinations.

Many freshmen students of computer science are unaware of the requirements and job profiles of their future professional domain. To provide them with a deeper insight into the requirements of their future jobs at an early point of their studies, we designed a software engineering simulation project that focuses on the main tasks a software engineer has to deal with in professional life. More precisely, this project focuses on the major software-technical, methodological and practical competencies every computer scientist-to-be must acquire. Thus, this introductory software engineering project serves as a kind of “kick off meeting” for freshmen students in computer science. It creates an initial insight into and understanding of the overall interrelation of the different tasks and skills that will be a crucial part both of their study process as well as of their future professional career.

Today implementation of sort leads to lower and easier order time. Our purpose in this article are trying to introduce an algorithm with lower cost of Bubble sort and nearly same as Selection sort. A way is in orderly inserting of elements in another array. Sort is an algorithm that arranges all elements of an array, orderly. This algorithm has sequential form. The order of Selection sort complexity is nearly least than Bubble sort.

A large body of empirical literature indicates that, contrary to predictions from economic theory, wages in the informal sector increase after a minimum wage hike. This phenomenon was so far explained as a byproduct of a signal (a lighthouse) conveyed by statutory minima to wage setting in the informal sector. A simple matching model shows that an increase in wages in the informal sector may also be induced by significant sorting and composition effects between the formal and the shadow sectors in the aftermath of the increase in the minimum wage. Using data on Brazil, we find that sorting accounts for at least one third of the increase in average wages in the informal sector after a minimum wage hike. This contribution of endogenous sorting to wage dynamics in the informal sector is also increasing over time.

We present a fast algorithm for two-dimensional median filtering. It is based on storing and updating the gray level histogram of the picture elements in the window. The algorithm is much faster than conventional sorting methods. For a window size of m × n, the computer time required is 0(n).

Credit risk concentration is one of the leading topics in modern finance, as the bank regulation has made increasing use of external and internal credit ratings. Concentration risk in credit portfolios comes into being through an uneven distribution of bank loans to individual borrowers (single-name concentration) or in a hierarchical dimension such as in industry and services sectors and geographical regions (sectorial concentration).To measure single-name concentration risk the literature proposes specific concentration indexes such as the Herfindahl–Hirschman index, the Gini index or more general approaches to calculate the appropriate economic capital needed to cover the risk arising from the potential default of large borrowers.However, in our opinion, the Gini index and the Herfindahl–Hirschman index can be improved taking into account methodological and theoretical issues which are explained in this paper.We propose a new index to measure single-name credit concentration risk and we prove the properties of our contribution.Furthermore, considering the guidelines of Basel II, we describe how our index works on real financial data. Finally, we compare our index with the common procedures proposed in the literature on the basis of simulated and real data.

1. LATAR BELAKANG Pencarian (searching) merupakan suatu pekerjaan yang sering dikerjakan dalam kehidupan sehari-hari. Ada kalanya kita mencari sesuatu dengan tujuan hanya untuk mengetahui apakah data tersebut ada dalam sekumpulan data atau tidak, sementara di lain waktu mungkin kita menginginkan posisi dari data yang dicari tersebut. Dalam Algoritma pencarian (searching,) ada beberapa metode pencarian Seperti: Metode linier (Linear Search), Metode Biner (Binary Search), Metode interpolasi (Interpolation Search). Masing-masing algoritma memiliki prasyarat dan cara serta waktu pelaksanaan yang berbeda. Pemilihan atas metoda pencarian dilakukan berdasarkan keadaan dan keinginan pengguna metoda yang biasanya tergantung pada jumlah data, jenis data dan struktur data yang digunakan. Sedangkan sorting mempunyai beberapa metode dalam pengurutan, diantaranya: Bubble Sorting, Selection Sorting, Insertion Sorting, Merge Sorting, Quick Sorting. Judul laporan praktikum matakuliah praktikum algoritma dan pemrograman III ini adalah Searching dan Sorting. Searching dibagi menjadi dua bagian, yaitu: Sequential Search dan Binary Search. Salah satu tujuan membuat laporan praktikum ini adalah sebagai syarat kelulusan matakuliah praktikum Algoritma dan Pemrograman III. 2. RUMUSAN 1. Bagaimana merancang searching dan sorting. 2. Bagaimana mengimplementasikan program searching dan sorting.PHP?

Decomposition is a basic strategy in traditional multiobjective optimization. However, it has not yet been widely used in multiobjective evolutionary optimization. This paper proposes a multiobjective evolutionary algorithm based on decomposition (MOEA/D). It decomposes a multiobjective optimization problem into a number of scalar optimization subproblems and optimizes them simultaneously. Each subproblem is optimized by only using information from its several neighboring subproblems, which makes MOEA/D have lower computational complexity at each generation than MOGLS and nondominated sorting genetic algorithm II (NSGA-II). Experimental results have demonstrated that MOEA/D with simple decomposition methods outperforms or performs similarly to MOGLS and NSGA-II on multiobjective 0-1 knapsack problems and continuous multiobjective optimization problems. It has been shown that MOEA/D using objective normalization can deal with disparately-scaled objectives, and MOEA/D with an advanced decomposition method can generate a set of very evenly distributed solutions for 3-objective test instances. The ability of MOEA/D with small population, the scalability and sensitivity of MOEA/D have also been experimentally investigated in this paper.

Plato in the Myth of Er alters the traditional view of the cosmos in Ancient Greece to allow for the doctrine of metempsychosis. The modification is threefold. A new topography is needed so that souls can circulate forever through heaven and the underworld. New social rites
are called for by an expanding demography: many souls being in transit, Plato suggests taking to the cosmos military and religious practices adapted to bigger crowds, and also adapts the traditional practice of drawing lots to big numbers. New analogies are also needed to give to
the many a representation of the mechanism of the universe: Plato brings the fuse of the spinner into the Sky in order to achieve that goal.
Platon, dans le Mythe d’Er, modifie la représentation traditionnelle du cosmos en Grèce ancienne pour y faire place à la doctrine de la transmigration des âmes. La modification concerne la topographie du Ciel et des Enfers de telle sorte que puisse s’y dérouler une circulation perpétuelle des âmes. Il s’agit aussi d’une modification démographique et sociale : le cosmos est traversé par un grand flux d’âmes, et Platon est amené à y transposer des pratiques militaires et religieuses adéquates aux collectivités, et à envisager une modification de la pratique traditionnelle du tirage au sort pour l’adapter aux grands nombres. Enfin, il donne une nouvelle analogie technique à la représentation de l’univers, avec la reconstitution grandiose de la mécanique céleste à partir du fuseau de la fileuse.

This paper presents a parallel sorting algorithm called Cubesort. Cubesort sorts N data items by performing a number of rounds, each of which partitions the N data items into groups of size S and sorts within the groups. For many values of N and S, Cubesort requires fewer such rounds than are required by any previously published algorithm. Cubesort can also be used to sort N data items on hypercube, shuffle-exchange, and cube-connected cycles computers with P processors in time U(N log* N/P log(N/P)) over a wide range of the parameters N and P. In particular, when N = Plrl/' and k is a constant, Cubesort sorts on the above parallel computers in O(N log N/P) time, thus obtaining an optimal processortime product for comparison sorting. The application of Cubesort to general routing problems is also discussed. o

This research was conducted to investigate the effect of sorting and dehulling postharvest practices on the pasting properties of flours of kabuli (Habru variety) and desi (local) chickpea and faba bean (local) grains. The legume samples were obtained from Hawassa University's Agronomy section and prepared for the experiments. The pasting behavior of the flour samples was observed to be greatly influenced by separate and combined sorting and dehulling treatments. The pasting curve of the kabuli type chickpea was observed to be higher than that of the desi type and faba bean flours. The dehulling process had the highest influence on the pasting curves of the samples. The combined sorting and dehulling treatments improved the pasting characteristics of faba bean and desi chickpea flours to a greater extent, revealing the importance of the treatments for the preparation of these grains as ingredients for commercially processed food products.It was observed that the pasting curves of the treated flour samples were generally higher than the control samples. Sorting and dehulling separately and in combination can be used to improve the functionality of slurries or pastes prepared from chickpea and faba bean flours.

The growing complexity of modern processors has made the generation of highly efficient code increasingly difficult. Manual code generation is very time consuming, but it is often the only choice since the code generated by today's compiler technology often has much lower performance than the best hand-tuned codes. A promising code generation strategy, implemented by systems like ATLAS, FFTW, and *

NHS Direct, the 24-hour telephone helpline providing information and advice about health problems, is available throughout England and Wales. It was envisaged as a nurse-led service presenting a new opportunity for the nursing profession. Free text comments from a postal survey of NHS Direct nurses revealed that a large proportion of nurses were happy with working in NHS Direct, and that it presented some nurses with the opportunity of a new and challenging role. However, a minority found the work monotonous and felt that NHS Direct is likely to face the challenge of staff retention. r : S 0 0 2 0 -7 4 8 9 ( 0 2 ) 0 0 0 2 5 -1

In order to produce synthesis gas (syngas), four reforming processes including two stand-alone primary and secondary reformers and two combined configurations are investigated. With changing operating parameters and arrangement of the reformers (i.e. stand-alone, parallel, and series), the syngas may be obtained for different applications such as methanol, Fischer-Tropsch (FT), and ammonia synthesis. After study of several arrangements, the selected cases are simulated. Due to the shift some reforming duty from the primary reformer to the secondary one, the primary size and the total fired duty are reduced. The Non-Sorting Genetic Algorithm II (NSGA-II) optimization method is applied for the problem based on the practical point of view. It is shown that the parallel case is preferable in accordance to the high productivity object. For an optimum point, parallel case has 58% of productivity of syngas more than that of series one. However, the series configuration consumes lower fuel (361.1 kmol h−1, in comparison to the parallel case with 437.19) and releases lower amount of CO2 emission. It is shown that the series arrangement has an average of 13.22% of released CO2 molar flow less than that of parallel arrangement.

Unlike several studies, which employed mostly descriptive and exploratory approaches in explaining malpractice, this study contributes to knowledge by empirically examining the malpractice phenomenon with respect to its: common manifestations, initiator and relationship with selected demographic and psychological factors. The survey involved the administration of questionnaires to a conveniently selected sample of 350 Undergraduates from three Universities (a federal, a state and a private owned University) in Edo State, Nigeria. Data obtained were analyzed using both descriptive and inferential statistics. Result obtained revealed that "Giraffing" was the commonest form of malpractice among undergraduates. Intention to engage in malpractice was found to be higher among males and students in public Universities. Level of preparation and perceived difficulty of examination were found to be the most significant psychological variables affecting intention to engage in malpractice. Curbing malpractice will therefore require Government and University authorities to strategize on managing these two variables.

This paper describes a direct analysis study carried out in a recycling unit for waste electrical and electronic equipment (WEEE) in Portugal to characterize the plastic constituents of WEEE. Approximately 3400 items, including cooling appliances, small WEEE, printers, copying equipment, central processing units, cathode ray tube (CRT) monitors and CRT televisions were characterized, with the analysis finding around 6000 kg of plastics with several polymer types. The most common polymers are polystyrene, acrylonitrile-butadiene-styrene, polycarbonate blends, high-impact polystyrene and polypropylene. Additives to darken color are common contaminants in these plastics when used in CRT televisions and small WEEE. These additives can make plastic identification difficult, along with missing polymer identification and flame retardant identification marks. These drawbacks contribute to the inefficiency of manual dismantling of WEEE, which is the typical recycling process in Portugal. The information found here can be used to set a baseline for the plastics recycling industry and provide information for ecodesign in electrical and electronic equipment production.

Optimization of the whole plant instead of important individual units is essential for maximizing savings and operational efficiency. Often, there are conflicting objectives for optimizing industrial processes. Many previous studies on multi-objective optimization involved a few critical units (and not complete plants) using models and simulation programs specifically developed for the respective application. Developing rigorous models and a separate code for simulating a complete plant, for the sake of multi-objective optimization is difficult and time consuming. There is potential to make this task easier by employing available process simulators such as Aspen Plus and Hysys. But these simulators do not currently have multi-objective optimization tools. Hence, an interface has been developed between Non-dominated Sorted Genetic Algorithm (NSGA-II) and Hysys. Plant-wide optimization using this interface involves three main steps: (a) development and testing of Hysys model for steady simulation of the process under study; (b) sensitivity analysis and selection of objectives, decision variables and constraints; and (c) optimization of the process for multiple objectives using NSGA-II. This paper describes optimization of a styrene unit/plant for multiple objectives using the interface and compares the obtained results with those obtained using an independently developed simulation program.

This paper introduces a new hybrid algorithm that utilizes three algorithms: quicksort, merge sort, and selection sort in order to speed the sorting process for large arrays. The proposed new algorithm is called the "Three-in-One Sort". It works by first splitting an array of elements into sub-arrays, and then applying quicksort to each of the resulting sub-arrays in parallel and then merging them back in parallel into a single array. This paper proves that an unsorted array of large elements can be sorted quicker by using the proposed new Three-in-One Sort algorithm than by using the quick sort algorithm or merge sort algorithm alone. This paper goes on to present a comparison between the proposed new algorithm and the following three main algorithms (and their variants) in order to compare efficiency: quicksort, merge sort, and selection sort. The results showed that the new proposed algorithm is more efficient on large arrays by a significant amount of time.

Arrivés dans le courant des années 1990, les mineurs non accompagnés sont des individus de moins de 18 ans qui, après un parcours migratoire, se trouvent sur le territoire français sans leur représentant légal. Enfants en danger devant être pris en charge inconditionnellement par les services départementaux compétents, pourquoi ces mineurs sont-ils devenus les objets d’une politique du tri et du contrôle ? Comment ces considérations ont-elles pu s’inviter dans le champ de la protection de l’enfance ? Qui sont les acteurs impliqués dans ce basculement du parcours dédié aux mineurs non accompagnés ? Mineurs à protéger d’un côté et étrangers à contrôler de l’autre, cette population est perçue à travers des représentations bipolaires qui ont conduit à l’édification de frontières administratives, institutionnelles et symboliques jalonnant aujourd’hui le parcours de l’accueil de ces jeunes. Alors que leur minorité et leur isolement devraient suffire à justifier une prise en charge, le soupçon qui plane sur ces jeunes a fait de ces deux critères des données scrupuleusement vérifiées par les autorités. La contribution revient sur la logique de sous-traitance de la mission d’évaluation et de mise à l’abri ayant permis d’exclure ces mineurs du circuit traditionnel de la protection de l’enfance. Associations, organisations humanitaires, société civile, ministère de la Justice incarnent les nouveaux protagonistes d’un paysage de l’accueil, où les idéaux et les engagements en matière de défense du droit des enfants ont été relégués au second plan.

Mots-clés : mineurs non accompagnés, sous-traitance, protection de l’enfance, politique migratoire, discrimination, associations, contrôle, tri

Arrived in the course of the 1990s, unaccompanied minors are individuals under 18 who, after a migratory journey, are on French territory without their legal representative. Children at risk to be cared for unconditionally by the relevant departmental services, why these minors have become the objects of a policy of sorting and control? How could these considerations have been invoked in the field of child protection? Who are the actors involved in this changeover of the path dedicated to unaccompanied minors? Minors to protect on one side and foreigners to control on the other, the bipolarity of representations that surrounds this population has led to the construction of administrative, institutional and symbolic boundaries that today mark the course of the reception of these youth. While their minority and their isolation should be sufficient to justify a care, the suspicion that hangs over these young people made these two criteria data scrupulously verified by the authorities. The contribution goes back to the logic of subcontracting the evaluation and shelter mission which made it possible to exclude these minors from the traditional circuit of child protection. Associations, humanitarian organizations, civil society, the Ministry of Justice, embody the new protagonists of a welcoming landscape where ideals and commitments to the defense of the rights of children have been relegated to the background.

Keywords: unaccompanied minors, subcontracting, child protection, migration policy, discrimination, associations, control, sorting

Early endosome-to-trans-Golgi network (TGN) transport is organized by the retromer complex. Consisting of cargo-selective and membrane-bound subcomplexes, retromer coordinates sorting with membrane deformation and carrier formation. Here, we describe four mammalian retromers whose membrane-bound subcomplexes contain specific combinations of the sorting nexins (SNX), SNX1, SNX2, SNX5, and SNX6. We establish that retromer requires a dynamic spatial organization of the endosomal network, which is regulated through association of SNX5/SNX6 with the p150 glued component of dynactin, an activator of the minus-end directed microtubule motor dynein; an association further defined through genetic studies in C. elegans. Finally, we also establish that the spatial organization of the retromer pathway is mediated through the association of SNX1 with the proposed TGN-localized tether Rab6-interacting protein-1. These interactions describe fundamental steps in retromer-mediated transport and establish that the spatial organization of the retromer network is a critical element required for efficient retromer-mediated sorting.