Search results for "Synchronizing"
showing 10 items of 15 documents
Gray code for permutations with a fixed number of cycles
2007
AbstractWe give the first Gray code for the set of n-length permutations with a given number of cycles. In this code, each permutation is transformed into its successor by a product with a cycle of length three, which is optimal. If we represent each permutation by its transposition array then the obtained list still remains a Gray code and this allows us to construct a constant amortized time (CAT) algorithm for generating these codes. Also, Gray code and generating algorithm for n-length permutations with fixed number of left-to-right minima are discussed.
A Fast Algorithm Finding the Shortest Reset Words
2013
In this paper we present a new fast algorithm for finding minimal reset words for finite synchronizing automata, which is a problem appearing in many practical applications. The problem is known to be computationally hard, so our algorithm is exponential in the worst case, but it is faster than the algorithms used so far and it performs well on average. The main idea is to use a bidirectional BFS and radix (Patricia) tries to store and compare subsets. Also a number of heuristics are applied. We give both theoretical and practical arguments showing that the effective branching factor is considerably reduced. As a practical test we perform an experimental study of the length of the shortest …
Multiple UAV cooperative path planning via neuro-dynamic programming
2004
In this paper, a team of n unmanned air-vehicles (UAVs) in cooperative path planning is given the task of reaching the assigned target while i) avoiding threat zones ii) synchronizing minimum time arrivals on the target, and iii) ensuring arrivals coming from different directions. We highlight three main contributions. First we develop a novel hybrid model and suit it to the problem at hand. Second, we design consensus protocols for the management of information. Third, we synthesize local predictive controllers through a distributed, scalable and suboptimal neuro-dynamic programming (NDP) algorithm.
Synchronization of Two Photoelastic Light Modulators to Obtain Müeller Matrix
2013
We report a method for the temporal synchronization of two photoelastic light modulators. For synchronizing, we used the transistor-transistor logic output signals from each modulator, which contain the information on the light polarization. These signals were introduced in a phase-detector circuit, which provided the phase difference value between both modulators. Three optical devices were used to test the synchronization method proposed: a polarizer, a half-wave, and a quarter-wave retarder plate. The value of each of the elements of the Mueller matrix for these devices was obtained using the method of the 36 measurements. The results show a high correlation between the theoretical and e…
Online Pricing via Stackelberg and Incentive Games in a Micro-Grid
2019
This paper deals with the analysis and design of online pricing mechanisms in micro-grids. Two cases are studied in which the market layer is modeled as an open-loop and closed-loop dynamical system respectively. In the case of open-loop market dynamics, the price is generated as equilibrium price of a Stackelberg game with an incentive strategy. In such Stackelberg game, the leader is the energy supplier, the follower is the consumer, and the leader plays an incentive strategy. In the case of closed-loop market dynamics, the price is obtained as a function of the power supplied and the demand. A stability analysis is provided for both cases, which sheds light on the transient and steady-st…
Synchronizing Two Superconducting Qubits through a Dissipating Resonator
2021
A system consisting of two qubits and a resonator is considered in the presence of different sources of noise, bringing to light the possibility of making the two qubits evolve in a synchronized way. A direct qubit–qubit interaction turns out to be a crucial ingredient, as well as the dissipation processes involving the resonator. The detrimental role of the local dephasing of the qubits is also taken into account.
A robust blind 3-D mesh watermarking based on wavelet transform for copyright protection
2019
Nowadays, three-dimensional meshes have been extensively used in several applications such as, industrial, medical, computer-aided design (CAD) and entertainment due to the processing capability improvement of computers and the development of the network infrastructure. Unfortunately, like digital images and videos, 3-D meshes can be easily modified, duplicated and redistributed by unauthorized users. Digital watermarking came up while trying to solve this problem. In this paper, we propose a blind robust watermarking scheme for three-dimensional semiregular meshes for Copyright protection. The watermark is embedded by modifying the norm of the wavelet coefficient vectors associated with th…
Diagonal space time hadamard codes with erasure decoding algorithm
2005
A major challenge in the area of space time (ST) codes is to find codes suitable for efficient decoding, thus overcoming the problem of many existing ST code designs which require maximum-likelihood (ML) decoding. A solution could be to apply single-input single-output (SISO) channel codes and theory over temporal channel fading to the multi-input single-output (MISO) code construction and classical suboptimum decoding methods. For these purposes, an ST code construction which allows the use of efficient decoding algorithms is described. We propose a concatenated code, where the inner code is the diagonal ST Hadamard (D-STH) code with Paley constructions and the outer code is an algebraic b…
Synchronizing eye tracking and optical motion capture : How to bring them together
2018
Both eye tracking and motion capture technologies are nowadays frequently used in human sciences, although both technologies are usually used separately. However, measuring both eye and body movements simultaneously would offer great potential for investigating cross- modal interaction in human (e.g. music and language-related) behavior. Here we combined an Ergoneers Dikablis head mounted eye tracker with a Qualisys Oqus optical motion cap- ture system. In order to synchronize the recordings of both devices, we developed a gener- alizable solution that does not rely on any (cost-intensive) ready-made / company-provided synchronization solution. At the beginning of each recording, the partic…
On the decomposition of prefix codes
2017
Abstract In this paper we focus on the decomposition of rational and maximal prefix codes. We present an effective procedure that allows us to decide whether such a code is decomposable. In this case, the procedure also produces the factors of some of its decompositions. We also give partial results on the problem of deciding whether a rational maximal prefix code decomposes over a finite prefix code.