Search results for "RDW"
showing 10 items of 1401 documents
Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments
2013
This article studies the vehicle routing problem with trailers and transshipments VRPTT, a practically relevant, but challenging, generalization of the classical vehicle routing problem. The article makes three contributions: i Building on a nontrivial network representation, two mixed-integer programming formulations for the VRPTT are proposed. ii Based on these formulations, five different branch-and-cut algorithms are developed and implemented. iii The computational behavior of the algorithms is analyzed in an extensive computational study, using a large number of test instances designed to resemble real-world VRPTTs.Copyright © 2013 Wiley Periodicals, Inc. NETWORKS, Vol. 631, 119-133 20…
An Efficient Implementation of Distributed Routing Algorithms for NoCs
2008
The design of NoCs for multi-core chips introduces new design constraints like power consumption, area, and ultra low latencies. Although 2D meshes are preferred, heterogeneous blocks, fabrication faults, reliability issues, and chip virtualization may lead to the need of irregular topologies or regions. In this situation, efficient routing becomes a challenge. Although the use of routing tables at switches is flexible, it does not scale in terms of latency and area due to its memory requirements. LBDR (logic-based distributed routing) is proposed as a new routing method that removes the need of using routing tables at all. LBDR enables the implementation of many routing algorithms on most …
Simulating spin models on GPU
2010
Over the last couple of years it has been realized that the vast computational power of graphics processing units (GPUs) could be harvested for purposes other than the video game industry. This power, which at least nominally exceeds that of current CPUs by large factors, results from the relative simplicity of the GPU architectures as compared to CPUs, combined with a large number of parallel processing units on a single chip. To benefit from this setup for general computing purposes, the problems at hand need to be prepared in a way to profit from the inherent parallelism and hierarchical structure of memory accesses. In this contribution I discuss the performance potential for simulating…
Atypical transistor-based chaotic oscillators: Design, realization, and diversity
2017
In this paper, we show that novel autonomous chaotic oscillators based on one or two bipolar junction transistors and a limited number of passive components can be obtained via random search with suitable heuristics. Chaos is a pervasive occurrence in these circuits, particularly after manual adjustment of a variable resistor placed in series with the supply voltage source. Following this approach, 49 unique circuits generating chaotic signals when physically realized were designed, representing the largest collection of circuits of this kind to date. These circuits are atypical as they do not trivially map onto known topologies or variations thereof. They feature diverse spectra and predom…
Step-by-Step Control of the Dynamics of a Superconducting QED-like System
2007
We discuss the modus operandi of a theoretical scalable coupling scheme to control step by step the time evolution of a pair of flux qubits embedded in a lossy resonant cavity. The sequential interaction of each qubit with the quantized cavity mode is controlled by externally applied magnetic fluxes. Our analysis indicates that indirect qubit-qubit interactions, with the electromagnetic mode acting as a data bus, can be selectively performed and exploited both for the implementation of entangling gates and for the generation of states with a priori known characteristics.
On the analysis of a random walk-jump chain with tree-based transitions and its applications to faulty dichotomous search
2018
Random Walks (RWs) have been extensively studied for more than a century [1]. These walks have traditionally been on a line, and the generalizations for two and three dimensions, have been by extending the random steps to the corresponding neighboring positions in one or many of the dimensions. Among the most popular RWs on a line are the various models for birth and death processes, renewal processes and the gambler’s ruin problem. All of these RWs operate “on a discretized line”, and the walk is achieved by performing small steps to the current-state’s neighbor states. Indeed, it is this neighbor-step motion that renders their analyses tractable. When some of the transitions are to non-ne…
Selfish vs. Unselfish Optimization of Network Creation
2005
We investigate several variants of a network creation model: a group of agents builds up a network between them while trying to keep the costs of this network small. The cost function consists of two addends, namely (i) a constant amount for each edge an agent buys and (ii) the minimum number of hops it takes sending messages to other agents. Despite the simplicity of this model, various complex network structures emerge depending on the weight between the two addends of the cost function and on the selfish or unselfish behaviour of the agents.
Adaptive sparse representation of continuous input for tsetlin machines based on stochastic searching on the line
2021
This paper introduces a novel approach to representing continuous inputs in Tsetlin Machines (TMs). Instead of using one Tsetlin Automaton (TA) for every unique threshold found when Booleanizing continuous input, we employ two Stochastic Searching on the Line (SSL) automata to learn discriminative lower and upper bounds. The two resulting Boolean features are adapted to the rest of the clause by equipping each clause with its own team of SSLs, which update the bounds during the learning process. Two standard TAs finally decide whether to include the resulting features as part of the clause. In this way, only four automata altogether represent one continuous feature (instead of potentially h…
Analysis of the influence of processor hidden registers on the accuracy of fault injection techniques
2004
Modern processors tend to increase the number of registers, being part of them not accessible by the instruction set. Traditionally, the effect of faults in these hidden registers has not been considered during system validation using fault injection. In this paper, a study of the importance of faults in hidden registers is performed. Firstly, we have analysed the sensitivity of hidden registers to faults in combinational logic. In a second phase, we have analysed the impact of the faults occurred in hidden registers on system behaviour. A broad set of permanent and transient faults have been injected into the models of two typical commercial microcontrollers, using a VHDL-based fault injec…
Hybrid Energy Storage for Underground Mining EV
2021
One of the main concerns when it comes to contributions to the carbon footprint is the consumption of fuel by vehicles, more specifically that of mining vehicles. One solution to this problem is replacing the combustion engine vehicles with electric vehicles. This also poses the problem of low power density. This paper proposes a solution of using supercapacitors and hybrid capacitors with the aim of investigating how they can affect the performance of electric vehicles. For this purpose, a background of fuel consumption and alternative solutions to the problem are discussed, a prototype was designed and built. It was found that when supercapacitors and hybrid capacitors were used in combin…