The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper presents a system for automating sound synthesis parameters during live musical performances. It is a novel practical solution for keyboard players who need to manually control numerous synthesis parameters while playing at the same time. Our idea was to let musicians define how parameters will change through time by inserting automation data into a prerecorded musical piece. During a live...
The most timing critical part of logic design usually contains one or more arithmetic operations, in which addition is commonly involved. The carry-skip adder, which is designed to reduce the time needed to propagate the carry by skipping over groups of consecutive adder stages, is known to be comparable in speed to the carry look-ahead technique while it uses less logic area and less power. Nevertheless,...
We developed a new post-synthesis algorithm that minimizes leakage power while strictly preserving the delay constraint. A key aspect of the approach is a new threshold voltage (VT) assignment algorithm that employs a cost function that is globally aware of the entire circuit. Thresholds are first raised as much as possible subject to the delay constraint. To further reduce leakage, the delay constraint...
Synchronous dataflow (SDF) models are gaining increased attention in designing software-intensive embedded systems. Especially in the signal processing and multimedia domain, dataflow-oriented models of computation are commonly used by designers reflecting the regular structure of algorithms and providing an intuitive way to specify both sequential and concurrent system functionality. Furthermore,...
This paper considers the consensus problem of double integrator multi-agent systems where each agent is subject to input saturations, and the velocity (second state) of each agent is not available for feedback. We present a unified approach to the consensus algorithms design that extends most of the existent consensus algorithms developed for double integrator multi-agents in ideal situations to handel...
This work presents a stochastic dynamic programming (SDP) algorithm that aims at minimizing an economic criteria based on the total energy consumption of a range extender electric vehicle (REEV). This algorithm integrates information from the REEV's navigation system in order to obtain some information about future expected vehicle speed. The model of the vehicle's energetic system, which consists...
In this paper a network of vehicles moving in a two dimensional plane, described by double integrator dynamics, is stabilized by a novel distributed control methodology, to maintain a formation. The distributed control architecture employs static output feedback using an artificial delay. Delays in communication of the relative information are exploited to stabilize the network system using state...
In this paper, we propose a dynamic secure routing game framework to effectively combat jamming attacks in distributed cognitive radio networks. We first propose a stochastic multi-stage zero-sum game framework based on the directional exploration of ad hoc on-demand distance vector (AODV) algorithms. The zero-sum game captures the conflicting goals between malicious attackers and honest nodes and...
Train rescheduling is crucial and hard work in railway operation. The paper presented a greedy algorithm that could achieve good solution in a short time firstly. It then analyzed the characteristics of the algorithm further and added some extra rescheduling strategies in the process of greedy choice in each step to improve the quality of solution. The experiments' data showed that it was pretty effective.
Change point discovery is an important problem in data mining and industrial systems. Different approaches have been proposed and some of the most promising approaches are based on singular spectrum analysis (SSA). These algorithms have the advantages of requiring no ad-hoc tuning for different types of signals and having a built-in noise attenuation mechanism. In this paper we try to unify these...
Network virtualization is a promising technique for building the Internet of the future since it enables the low cost introduction of new features into network elements. An open issue in virtualization is how to search for an efficient mapping of virtual network elements onto those of the existing physical network, also called the substrate network. Mapping is an NP-hard problem and existing solutions...
Video transmission in multiparty video conferencing is challenging due to the demanding bandwidth usage and stringent latency requirement. In this paper, we systematically analyze the problem of collaborative stream routing using one-hop forwarding assistance in a bandwidth constraint environment. We model the problem as a multi-source degree-constrained multicast tree construction problem, and investigate...
The glowworm swarm optimization algorithm is used to solve the multi-constrained QoS multicast routing problem and QoS-GSO algorithm is presented. Our test shows that the algorithm can find optimal solution quickly and has better performance than GA and ACO. Furthermore, for the larger multi-constrained QoS multicast routing problem, the QoS-GSO algorithm can also quickly obtain the correct solution,...
To overcome the flaw of energy efficiency drop in broad band wireless communication with the short time sleep, the energy-saving mechanism of the sleep mode operation was researched in IEEE 802.16e. In this paper we propose a dynamic algorithm to tune the ratio of the sleep windows and receive windows according to the traffic load. Then, a Markov chain model was set up to analyze the energy efficiency...
This research aims to improve the quality of MPEG-4 video transmission over MANET using cross layer paradigm that transfer the MPEG-4 video priority information from application to medium access control (MAC) layer. This information is used by proposed adopting dynamic mapping algorithm (ADMA) along with other information as access category (AC) congestion from MAC and hop count to destination from...
This paper will present an enhanced Dynamic Source Routing (DSR) routing protocol where it utilizes the IPv6 Flow Label to provide Quality-of-Service (QoS) to the real time applications in IPv6 wireless ad hoc networks. Conventional DSR routing protocol is enhanced to induce better QoS in dynamic nature ad hoc networks. Internet Engineering Task Force (IETF) presented Flow Label with 20 bits in the...
Congestion control can be regarded a distributed system, which consists of source algorithm like TCP, and link algorithm, such as active queue management (AQM). Shadow price has been derived from optimization theory to be implemented in routers as the AQM algorithm. In this paper, a control theoretic approach to analysis and design of the price is presented to enhance the AQM performance. We analyze...
Distributed virtual simulations deployed on shared resources can frequently undergo loss of performance due to external background load, improper placement of simulation entities, or dynamic simulation load changes. The High Level Architecture (HLA) was designed as a solution for coordinating the execution of distributed simulations. Even though this framework offers management services to organize...
This paper studies two online scheduling problems on parallel machines that process computing jobs arriving stochastically in a batch pattern. With the objective function as minimizing total completion time of weighted jobs or minimizing total latency of job completion, we propose two solutions for above scheduling problems, respectively. With the assumption that the processing time of a batch is...
This paper investigates the backoff algorithm for Narrowband Power Line Communications (PLC) Medium Access Control (MAC) protocol. Specifically, the paper considered the MAC designed by Yitran and implemented within its Differential Code Shift Keying (DCSK) technology. In this algorithm width of the contention window is calculated based on the estimated number of active nodes in the network. Further...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.