We consider the problem of estimating the directions of arrival of multiple communication signals arriving at an uniform linear array. By considering the conjugate cyclic crosscorrelations of the sensor outputsand using a Bayesian framework, we propose a direction finding algorithm that allows us to estimate the directions of arrival for a more signals than sensors scenario. The algorithm does ...

abstract: this paper presents the results of pullout tests on uniaxial geogrid embedded in silica sand under monotonic and cyclic pullout forces. the new testing device as a recently developed automated pullout test device for soil-geogrid strength and deformation behavior investigation is capable of applying load/displacement controlled monotonic/cyclic forces at different rates/frequencies an...

Graph-structured databases have numerous recent applications including the Semantic Web, biological databases and XML, among many others. In this paper, we study the maintenance problem of a popular structural index, namely bisimulation, of a possibly cyclic data graph. In comparison, previous work mainly focuses on acyclic graphs. In the context of database applications, it is natural to compu...

Composability and deadlock-freedom are important properties that are stated for transactional memory (TM). Commonly, the Semantics of TM requires linearization of transactions. It turns out that linearization of transactions that have cyclic communication brings incomposability and deadlock. Inspired from TM and Actors, this work proposes Transactors that provide facilities of isolation from TM...

Abstract. Sattolo’s algorithm creates a random cyclic permutation by interchanging pairs of elements in an appropriate manner; the Fisher-Yates algorithm produces random (not necessarily cyclic) permutations in a very similar way. The distributions of the movements of the elements in these two algorithms have already been treated quite extensively in past works. In this paper, we are interested...

It is well known that for bilateral teleoperation, force feedback information is needed. In this paper, we propose a control approach for bilateral teleoperation with uncertainties in the model of the slave robot and which does not use force sensors for haptic feedback. The controller design is based on a cyclic switching algorithm. In the first phase of the cyclic algorithm, we estimate the en...

This article introduces a new frequency domain approach for either MIMO system identification or source separation of convolutive mixtures of cyclostationary signals. We apply the joint diagonalization algorithm to a set of cyclic spectral density matrices of the measurements to identify the mixing system at each frequency bin up to permutation and phase ambiguity matrices. An efficient algorit...

In rostering problems, we need to find a schedule that satisfies various constraints. Ergonomic constraints, that place restrictions on a number of consecutive days, are common (Bourdais, Galinier, & Pesant 2003) . To model such rules, several global constraints have been introduced. For example, the STRETCH constraint (Hellsten, Pesant, & Beek 2004) is useful for limiting the length of stretch...

In recent years, there has been an explosion of publicly available Semantic Web data. In order to effectively integrate millions of small, distributed data sources and quickly answer queries, we previously proposed a tree structure query optimization algorithm that uses source selectivity of each query subgoal as the heuristic to plan the query execution and uses the most selective subgoals to ...

This paper develops a constant amortized time algorithm to produce a cyclic cool-lex Gray code for fixed-density binary necklaces, Lyndon words, and pseudo-necklaces. It is the first Gray code for these objects that achieves this time bound. The algorithm is applied: (i) to develop a constant amortized time cyclic Gray code for necklaces, Lyndon words, and pseudo-necklaces ordered by density an...