Sorting Complex Research Articles

PROSPECTS OF THE APPLICATION OF LOW-TEMPERATURE PYROLYSIS PROCESSES FOR THE THERMAL DESTRUCTION OF HYDROCARBON-CONTAINING WASTE OF VARIOUS ORIGINS

A generalized analysis of the existing methods of utilization of hydrocarbon-containing waste of various origins and practical data on the existing experience of using low-temperature pyrolysis processes for the thermal destruction of hydrocarbon-containing municipal and oil waste are presented. A series of studies of thermochemical processes of waste destruction were conducted for both municipal solid waste and industrial waste. The common feature that unites the objects of research is their wide morphology, the presence of the predominant proportion of hydrocarbons and their derivatives. To implement the process of low-temperature pyrolysis of hydrocarbon-containing waste of various origins, a universal installation with a rotating reactor is proposed. The features of its operation, technical characteristics and advantages are presented. The prospects for further development of low-temperature pyrolysis technology for the utilization of unsorted waste groups from sorting complexes are substantiated. Bibl. 30, Fig. 2, Tab. 2.

Algorithm for a simulation model for the selection of a rational type of vans on technological routes of the transport and recycling system for recycling of a metallurgical enterprise

The article presents an algorithm of the simulation model for selecting the rational type of trucks on the technological routes of the transport and production system of waste transportation in the conditions of a metallurgical enterprise. The study was conducted on the basis of formalized models and queuing systems theory. In the simulation, a discrete-event model of a closed queuing system was chosen as the basic model. In this model, cars are represented as requests that go through the following phases of service: loading at the temporary waste storage dump; movement to the unloading point (crushing and sorting complex); unloading raw materials to the crushing and sorting complex; returning to the loading point along the same route; servicing of vehicle breakdowns. The following data were used to build the simulation model through statistical studies of the transportation process on technological routes: vehicle loading time, vehicle unloading time, and time determined by the duration of vehicle failure. When constructing the algorithm of the simulation model, the duration of one experiment and the number of simulation experiments were determined using the methods of mathematical statistics and the theory of experiment planning. The modeling process begins with the input of the following initial data: the number of vehicle units, the average vehicle travel time, the current amount of raw materials in the crushing and sorting complex, the vehicle carrying capacity, the intensity of raw material supply to the crushing and sorting complex, the vehicle unloading time, the intensity of minor vehicle breakdowns, and the intensity of vehicle repair. The algorithm is built in accordance with the principles of special states and meets the requirements for discrete-event models. As a result of the algorithm development, it will be possible to determine the required number (types) of vehicles necessary to ensure the smooth functioning of this transport and production system, to determine the idle time coefficient and the coefficient of time losses due to technological delays of vehicles.
 Key words: modeling, simulation model, dump truck, carrying capacity, metallurgical slag, crushing and screening equipment.

Sorting out the sorting in omnichannel retailing

AbstractThe increasing complexity of today's omnichannels has led to challenges with logistics efficiency and customer utility. In this paper, we show how retailers address these challenges by sorting goods at multiple points across the logistics network and inside each material‐handling node. As contemporary research on the omnichannel sorting phenomenon is limited and fragmented, we conduct an abductive multiple case study to elaborate omnichannel logistics and transvection theory. It explains why retailers, depending on their omnichannel context, prepone some sorting activities upstream and postpone others to handle trade‐offs between customer utility and logistics efficiency. An artifact, including structured terminology, six sorting aspects, and an iconographic platform, is constructed to support the analysis of the extent, variety, and complexity of sorting at both the strategic network level and the operational material‐handling node level. We conclude by submitting 10 theoretical and actionable design propositions that support decision making in (re)designing omnichannel logistics networks and offer avenues for future research.

An Update on Coat Protein Complexes for Vesicle Formation in Plant Post-Golgi Trafficking.

Endomembrane trafficking is an evolutionarily conserved process for all eukaryotic organisms. It is a fundamental and essential process for the transportation of proteins, lipids, or cellular metabolites. The aforementioned cellular components are sorted across multiple membrane-bounded organelles. In plant cells, the endomembrane mainly consists of the nuclear envelope, endoplasmic reticulum (ER), Golgi apparatus, trans-Golgi network or early endosome (TGN/EE), prevacuolar compartments or multivesicular bodies (PVCs/MVBs), and vacuole. Among them, Golgi apparatus and TGN represent two central sorting intermediates for cargo secretion and recycling from other compartments by anterograde or retrograde trafficking. Several protein sorting machineries have been identified to function in these pathways for cargo recognition and vesicle assembly. Exciting progress has been made in recent years to provide novel insights into the sorting complexes and also the underlying sorting mechanisms in plants. Here, we will highlight the recent findings for the adaptor protein (AP) complexes, retromer, and retriever complexes, and also their functions in the related coated vesicle formation in post-Golgi trafficking.

Robustness and innovation along the endocytic route: Lessons from darkness.

What mechanisms ensure the loading of a SNARE into a nascent carrier? In this issue, Bowman et al. (2021. J. Cell Biol.https://doi.org/10.1083/jcb.202005173) describe an unprecedented mechanism where two sorting complexes, AP-3 and BLOC-1, the latter bound to syntaxin 13, work as a fail-safe to recognize sorting signals in VAMP7, a membrane protein required for fusion to melanosomes. Their observations define one of the first examples of distributed robustness in membrane traffic mechanisms.

On the Upper Bound of the Complexity of Sorting

It is shown that $${{\log}_{2}}(n!) + o(n)$$ pairwise comparisons is sufficient for sorting any subset of $$n$$ elements of a linearly ordered set.

Development dynamics of the industry in Khakassia, technological solutions for a coal cluster

Today the coal industry of Khakassia takes the third place according to the index of industrial production, regarding extraction of coal, among regions of Siberia and the 14th place in Russia. Its further development is connected with creation of a coal cluster on the basis of enterprises producing and processing coal. There are all necessary modern capacities in the Republic. There are two coal processing plants, crushing and sorting complexes and also favorable conditions for developing transport networks connected to the perspective centers of coal mining in the country, capable to increase volumes of producing and processing coal, to increase quality of products. It is noted that the foundation of coal mining in Russia was laid at the end of the 17th century. The first deposits began to be mined near modern Donbass (area of the Kalmius river and the river Seversky Donets). The coal industry is one of major export developing industries of local economy.

On the Complexity of Sorting by Reversals and Transpositions Problems.

In comparative genomics, rearrangements are mutations that affect a stretch of DNA sequences. Reversals and transpositions are well-known rearrangements, and each has a vast literature. The reversal and transposition distance, that is, the minimum number of reversals and transpositions needed to transform one genome into another is a relevant evolutionary distance. The problem of computing this distance when genomes are represented by permutations was proposed >20 years ago and received the name of sorting by reversals and transpositions problem. It has been the focus of a number of studies, but the computational complexity has remained open until now. We hereby solve this question and prove that it is NP-hard no matter whether genomes are represented by signed or unsigned permutations. In addition, we prove that a usual generalization of this problem, which assigns weights wρ for reversals and wτ for transpositions, is also NP-hard as long as wτ/wρ ≤ 1.5 for both signed and unsigned permutations.

Inducing Suffix and LCP Arrays in External Memory

We consider full text index construction in external memory (EM). Our first contribution is an inducing algorithm for suffix arrays in external memory, which runs in sorting complexity. Practical tests show that this algorithm outperforms the previous best EM suffix sorter [Dementiev et al., JEA 2008] by a factor of about two in time and I/O volume. Our second contribution is to augment the first algorithm to also construct the array of longest common prefixes (LCPs). This yields a new internal memory LCP array construction algorithm and the first EM construction algorithm for LCP arrays. The overhead in time and I/O volume for this extended algorithm over plain suffix array construction is roughly two. Our algorithms scale far beyond problem sizes previously considered in the literature (text size of 80GiB using only 4GiB of RAM in our experiments).

Abstract 45: Characterization of a Novel Integrin Binding Protein that is Essential for αIIbβ3 Outside-in Signaling and Hemostasis

Integrins are heterodimeric (α/β) membrane proteins that play fundamental roles in many biological processes, e.g. cell adhesion and spreading, which are important for platelet function and hemostasis. Integrin function is modulated by bi-directional transmembrane signaling: inside-out and outside-in, which is mediated through the interactions between integrin cytoplasmic tails and intracellular, regulatory proteins. Here, we show that VPS33B, a member of the Sec1/Munc18 (SM) family and component of the Class C core of the CORVET/HOPS sorting complexes, binds directly to the β subunit. Overexpression of VPS33B in CHO cells potentiated α IIb β 3 outside-in signaling but not inside-out signaling. Platelets, from megakaryocyte- and platelet-specific VPS33B conditional knockout mice we generated, had normal morphology yet their spreading on fibrinogen was impaired and they failed to support clot retraction. Platelet aggregation and ATP secretion in response to low-dose thrombin were reduced in the VPS33B knockout mice. α IIb β 3 -mediated endocytosis of fibrinogen was also defective. Tail bleeding times were prolonged in the VPS33B knockout mice. Furthermore, VPS33B acted upstream of the RhoA-ROCK-MLC and Rac1 dependent pathways that leads to clot retraction and cell spreading, respectively. Our work demonstrates that vesicular trafficking complexes are a novel class of modifiers of integrin function and in hemostasis. Our data also provide insights into the molecular mechanism and treatment of ARC syndrome.

Development of tiling automation for custom mosaic design

Mosaic is the art of design creation from tesserae, and for custom mosaic design the individual tesserae are assigned to certain positions unlike forming a random pattern. The variety of designs makes it difficult for automatic tile assembly; consequently, manual assembly is typically found in practice. This paper presents the development of a tiling automation to support custom mosaic design from uniform size square tiles. The system follows a product flow concept that the tesserae are sorted first to form a row prior to be assembled to a mosaic moving slowly on a conveyor. It allows a simple point-to-point movement for assembly. The complexity shifting from toolpath generation to tile sorting is handled in two steps: acquiring tiles needed for a row and rearranging the tiles according to the order. A shortest distance criterion has been applied for determining dispensing sequence. Hardware and software have been developed to illustrate the proposed tiling automation. This paper presents the development of a tiling automation to support custom mosaic design from a digital image.The system follows a product flow concept that tesserae are sorted first to form a row prior to be assembled to a mosaic.The complexity of tile sorting is handled in two steps: acquiring tiles needed for a row and rearranging the tiles according to the order.Hardware and software have been developed to illustrate the proposed tiling automation.

A* Algorithm Inspired Memory-Efficient Detection for MIMO Systems

Implementation of a best-first detection algorithm for multiple-input multiple-output (MIMO) systems requires large amounts of memory especially in large systems with high-order modulation. In this letter, we propose modified best-first detection algorithms in which the order of nodes is determined by both the original cost and the estimated future cost associated with each node, as inspired by an improved shortest path algorithm (A* algorithm). The modified algorithms maintain the detection optimality, reduce the memory requirement and sorting complexity, and achieve improved detection performance in memory-constrained scenarios.

The Sorting and Recycling Complex for Solid Domestic Waste for the Cities of Irkutsk Agglomeration

The Sorting and Recycling Complex for Solid Domestic Waste for the Cities of Irkutsk Agglomeration

Mitochondrial Proteins Tied to Key Fungal Cell Wall Vulnerabilities

Inactivating a specific protein within the mitochondria of Candida albicans disrupts activity in these organelles while also halting growth of this fungal pathogen, according to principal investigator Ana Traven of Monash University in Melbourne, Victoria, Australia, and her collaborators. The protein is one of several in the sorting and assembly machinery (SAM-37) complex of the mitochondrion, she says. Additionally, inactivating these mitochondrial proteins leads to cell wall defects, “providing insight into the complexity of cellular pathways that govern cell wall integrity.” Details of the research appear in the April 2012 Eukaryotic Cell (11:532–544).

Spatiotemporal regulation of chemical reactions by active cytoskeletal remodeling.

Efficient and reproducible construction of signaling and sorting complexes, both on the surface and within the living cell, is contingent on local regulation of biochemical reactions by the cellular milieu. We propose that in many cases this spatiotemporal regulation can be mediated by interaction with components of the dynamic cytoskeleton. We show how the interplay between active contractility and remodeling of the cytoskeleton can result in transient focusing of passive molecules to form clusters, leading to a dramatic increase in the reaction efficiency and output levels. The dynamic cytoskeletal elements that drive focusing behave as quasienzymes catalyzing the chemical reaction. These ideas are directly applicable to the cortical actin-dependent clustering of cell surface proteins such as lipid-tethered GPI-anchored proteins, Ras proteins, as well as many proteins that have domains that confer the ability to interact with the actin cytoskeleton. In general such cytoskeletal driven clustering of proteins could be a cellular mechanism to spatiotemporally regulate and amplify local chemical reaction rates in a variety of contexts such as signaling, transcription, sorting, and endocytosis.

Flat clathrin coats on endosomes mediate degradative protein sorting by scaffolding Hrs in dynamic microdomains

Endocytosed membrane proteins that are destined for degradation in lysosomes are ubiquitylated and recognised by sorting complexes on endosome membranes. The ubiquitin-binding sorting component Hrs as well as ubiquitylated cargo are enriched in a characteristic flat clathrin coat on the endosome membrane. The function of clathrin within this coat has not been investigated. Here, we show that both clathrin and the clathrin-box motif of Hrs are required for the clustering of Hrs into restricted microdomains. The C-terminus of Hrs, which contains the clathrin-box, is sufficient to redirect a phosphatidylinositol(3)-phosphate-binding protein into the Hrs- and clathrin-containing microdomains. Although these microdomains show little lateral diffusion in the membrane, they are dynamic structures that exchange Hrs and clathrin with similar kinetics, and acquire the downstream sorting component Tsg101. The clathrin-mediated clustering is essential for the function of Hrs in degradative protein sorting. We conclude that clathrin is responsible for concentrating Hrs in endosomal microdomains specialised for recognition of ubiquitylated membrane proteins, thus enabling efficient sorting of cargo into the degradative pathway.

The Optimal Alphabetic Tree Problem Revisited

TheOptimal Alphabetic Binary Tree(OABT) problem is equivalent to the Optimal Binary Search Tree problem where the weights are associated only with the leaves. The problem can be solved inO(nlogn) time, while the best known lower bound is Ω(n).In this paper we relate the complexity of the problem to the complexity of priority queue operations and the complexity of sorting. We giveO(nlogP(k))-time algorithm for the general OABT problem an-time algorithm for the integer OABT problem wherekis a number at most at large as the number of local minima,P(k) is the time complexity of priority queue insert/delete_min operation, andS(n) is the complexity of sorting in the given domain of weights. Our algorithms also give rise to linear time algorithms for some special cases.

On the complexity of topological sorting

Abstract In this paper, we discuss the implementation of the product of a symmetric matrix by a vector on a unidirectional ring of general-purpose processors. This kernel arises in several applications: we discuss one of them issued from control systems. The difficulty comes from the fact that only one half of the matrix is stored - in a distributed way - in the processor memories. We derive an efficient algorithm, and we analytically determine its performance as a function of the problem size n and of the number of processors p . The algorithm is shown to be optimal, both with or without the assumption that arithmetic and communications can overlap. The theoretical results are nicely corroborated by numerical experiments on a ring of 32 transputers.

Sorting n objects with a k-sorter

A k-sorter is a device that sorts k objects in unit time. The complexity of an algorithm that uses a k-sorter is defined as the number of applications of the k-sorter. In this measure, the complexity of sorting n objects is between n log n/k log k and 4n log n/k log k, up to first-order terms in n and k.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Lower bounds for sorting of sums

This paper addresses the following question: What is the complexity of sorting n numbers x 1,…, x n (by comparisons), if it is known in advance that x 1,…, x n are all sums of up to d out m numbers (n= Σ 0⩽s⩽d m s ) ? A lower bound due to Fredman concerning “Sorting X + Y” is extended to the following result: Let d ⩾ 2 be fixed, n, m as above. Then every comparison tree for n inputs that sorts all inputs of the form ( Σ rϵS w r ∣ S ⊆ {1,…, m}, ∣ S∣ ⩽ d), for w ϵ R m , has depth Ω(m d) = ϵ(n) . This lower bound is optimal. Furthermore, the case of sorting all subset sums of a vector is considered ( d = m): Let n = 2 m . Then every comparison tree for n inputs that sorts all inputs of the form (Σ rϵSw r∣S ⊆ {1,…,m}), w ϵ R m , has depth ⩾ 2 ⌞ m 3 ⌟ = Ω(n 1 3 . This lower bound is exponentially larger than those previously known for this problem.