Search results for "routing"
showing 10 items of 587 documents
THE ROLE OF CYTOKININS AND ETHYLENE INHIBITORS ON LENTICEL HYPERTROPHY GENERATION AND ETHYLENE PRODUCTION IN IN VITRO CULTURES OF POPULUS EUPHRATICA …
1995
Populus euphratica Olivier is native to the Irano—Turanian areas (Middle East). Elche (Alicante province, SE Spain) is known to be its only European location. Nodal segments from root shoots were established in vitro in a Murashige and Skoog medium supplemented with several cytokinins. Ethylene inhibitors AgNO3 and CoCl2 were used in combination with kinetin. Hormone-free media supplemented with sucrose (20–60 mg 1−1) was also tested. Ethylene was measured by gas chromatography, and both the percentage of sprouting shoots and lenticel hypertrophy in cultures were recorded. Ethylene production was higher in cultures supplemented with cytokinins (especially with meta-topolin), with high sprou…
Novel Fault-Tolerant Routing Technique for ZMesh Topology based Network-on-Chip Design
2020
This paper proposes a novel fault-tolerant routing technique for ZMesh topology based Network-on-Chip (NoC) design. The proposed algorithm caters the link faults and routes the data packets seamlessly to the destination. This algorithm has been compared with the existing techniques proposed for mesh topology counterparts. The experimentations have been carried out by increasing ZMesh network size and percentage of link faults. The results show that in the event of link failures the proposed algorithm routes the data from source to destination flawlessly.
Joint route planning under varying market conditions
2007
PurposeTo provide empirical evidence on the level of savings that can be attained by joint route planning and how these savings depend on specific market characteristics.Design/methodology/approachJoint route planning is a measure that companies can take to decrease the costs of their distribution activities. Essentially, this can either be achieved through horizontal cooperation or through outsourcing distribution to a logistics service provider. The synergy value is defined as the difference between distribution costs in the original situation where all entities perform their orders individually, and the costs of a system where all orders are collected and route schemes are set up simulta…
Joint Route Planning under Varying Market Conditions
2006
Purpose - To provide empirical evidence on the level of savings that can be attained by joint route planning and how these savings depend on specific market characteristics.Design/methodology/approach - Joint route planning is a measure that companies can take to decrease the costs of their distribution activities. Essentially, this can either be achieved through horizontal cooperation or through outsourcing distribution to a Logistics Service Provider. The synergy value is defined as the difference between distribution costs in the original situation where all entities perform their orders individually, and the costs of a system where all orders are collected and route schemes are set up s…
On the Greedy Algorithm for the Shortest Common Superstring Problem with Reversals
2015
We study a variation of the classical Shortest Common Superstring (SCS) problem in which a shortest superstring of a finite set of strings $S$ is sought containing as a factor every string of $S$ or its reversal. We call this problem Shortest Common Superstring with Reversals (SCS-R). This problem has been introduced by Jiang et al., who designed a greedy-like algorithm with length approximation ratio $4$. In this paper, we show that a natural adaptation of the classical greedy algorithm for SCS has (optimal) compression ratio $\frac12$, i.e., the sum of the overlaps in the output string is at least half the sum of the overlaps in an optimal solution. We also provide a linear-time implement…
On the Convergence of Tsetlin Machines for the IDENTITY- and NOT Operators
2020
The Tsetlin Machine (TM) is a recent machine learning algorithm with several distinct properties, such as interpretability, simplicity, and hardware-friendliness. Although numerous empirical evaluations report on its performance, the mathematical analysis of its convergence is still open. In this article, we analyze the convergence of the TM with only one clause involved for classification. More specifically, we examine two basic logical operators, namely, the "IDENTITY"- and "NOT" operators. Our analysis reveals that the TM, with just one clause, can converge correctly to the intended logical operator, learning from training data over an infinite time horizon. Besides, it can capture arbit…
Randomized Block Frank–Wolfe for Convergent Large-Scale Learning
2017
Owing to their low-complexity iterations, Frank-Wolfe (FW) solvers are well suited for various large-scale learning tasks. When block-separable constraints are present, randomized block FW (RB-FW) has been shown to further reduce complexity by updating only a fraction of coordinate blocks per iteration. To circumvent the limitations of existing methods, the present work develops step sizes for RB-FW that enable a flexible selection of the number of blocks to update per iteration while ensuring convergence and feasibility of the iterates. To this end, convergence rates of RB-FW are established through computational bounds on a primal sub-optimality measure and on the duality gap. The novel b…
Online shortest paths with confidence intervals for routing in a time varying random network
2018
International audience; The increase in the world's population and rising standards of living is leading to an ever-increasing number of vehicles on the roads, and with it ever-increasing difficulties in traffic management. This traffic management in transport networks can be clearly optimized by using information and communication technologies referred as Intelligent Transport Systems (ITS). This management problem is usually reformulated as finding the shortest path in a time varying random graph. In this article, an online shortest path computation using stochastic gradient descent is proposed. This routing algorithm for ITS traffic management is based on the online Frank-Wolfe approach.…
Routing quantum information in spin chains
2013
Two different models for performing efficiently routing of a quantum state are presented. Both cases involve an XX spin chain working as data bus and additional spins that play the role of sender and receivers, one of which is selected to be the target of the quantum state transmission protocol via a coherent quantum coupling mechanism making use of local/global magnetic fields. Quantum routing is achieved, in the first of the models considered, by weakly coupling the sender and the receiver to the data bus. In the second model, strong magnetic fields acting on additional spins located between the sender/receiver and the data bus allow us to perform high fidelity routing.
The General Routing Problem polyhedron: Facets from the RPP and GTSP polyhedra
1998
[EN] In this paper we study the polyhedron associated with the General Routing Problem (GRP). This problem, first introduced by Orloff in 1974, is a generalization of both the Rural Postman Problem (RPP) and the Graphical Traveling Salesman Problem (GTSP) and, thus, is NP -hard. We describe a formulation of the problem such that from every non-trivial facet-inducing inequality for the RPP and GTSP polyhedra, we obtain facet-inducing inequalities for the GRP polyhedron, We describe a new family of facet-inducing inequalities for the GRP, the honeycomb constraints, which seem to be very useful for solving GRP and RPP instances. Finally, new classes of facets obtained by composition of facet-i…