All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 22 Next

Displaying 421 – 440 of 1507

Showing per page

Efficient RGB-D data processing for feature-based self-localization of mobile robots

Marek Kraft, Michał Nowicki, Rudi Penne, Adam Schmidt, Piotr Skrzypczyński (2016)

International Journal of Applied Mathematics and Computer Science

The problem of position and orientation estimation for an active vision sensor that moves with respect to the full six degrees of freedom is considered. The proposed approach is based on point features extracted from RGB-D data. This work focuses on efficient point feature extraction algorithms and on methods for the management of a set of features in a single RGB-D data frame. While the fast, RGB-D-based visual odometry system described in this paper builds upon our previous results as to the general...

EKF-based dual synchronization of chaotic colpitts circuit and Chua’s circuit

Shaohua Hong, Zhiguo Shi, Kangsheng Chen (2008)

Kybernetika

In this paper, dual synchronization of a hybrid system containing a chaotic Colpitts circuit and a Chua’s circuit, connected by an additive white Gaussian noise (AWGN) channel, is studied via numeric simulations. The extended Kalman filter (EKF) is employed as the response system to achieve the dual synchronization. Two methods are proposed and investigated. The first method treats the combination of a Colpitts circuit and a Chua’s circuit as a higher- dimensional system, while the second method...

Embeddings of hamiltonian paths in faulty k-ary 2-cubes

Shiying Wang, Shurong Zhang (2012)

Discussiones Mathematicae Graph Theory

It is well known that the k-ary n-cube has been one of the most efficient interconnection networks for distributed-memory parallel systems. A k-ary n-cube is bipartite if and only if k is even. Let (X,Y) be a bipartition of a k-ary 2-cube (even integer k ≥ 4). In this paper, we prove that for any two healthy vertices u ∈ X, v ∈ Y, there exists a hamiltonian path from u to v in the faulty k-ary 2-cube with one faulty vertex in each part.

Energía informacional útil.

Leandro Pardo Llorente (1981)

Trabajos de Estadística e Investigación Operativa

En este trabajo se adapta la medida de Información dada por Onicescu en 1966, denominada Energía Informacional, a situaciones en las cuales existe una función de utilidad definida sobre los resultados del experimento; a esa medida de Información la denominaremos Energía Informacional Útil.

Entropies of vague information sources

Milan Mareš (2011)

Kybernetika

The information-theoretical entropy is an effective measure of uncertainty connected with an information source. Its transfer from the classical probabilistic information theory models to the fuzzy set theoretical environment is desirable and significant attempts were realized in the existing literature. Nevertheless, there are some open topics for analysis in the suggested models of fuzzy entropy - the main of them regard the formal aspects of the fundamental concepts. Namely their rather additive...

Entropy generation in a model of reversible computation

Diego de Falco, Dario Tamascelli (2006)

RAIRO - Theoretical Informatics and Applications

We present a model in which, due to the quantum nature of the signals controlling the implementation time of successive unitary computational steps, physical irreversibility appears in the execution of a logically reversible computation.

Entropy jumps for isotropic log-concave random vectors and spectral gap

Keith Ball, Van Hoang Nguyen (2012)

Studia Mathematica

We prove a quantitative dimension-free bound in the Shannon-Stam entropy inequality for the convolution of two log-concave distributions in dimension d in terms of the spectral gap of the density. The method relies on the analysis of the Fisher information production, which is the second derivative of the entropy along the (normalized) heat semigroup. We also discuss consequences of our result in the study of the isotropic constant of log-concave distributions (slicing problem).

Entropy of random walk range

Itai Benjamini, Gady Kozma, Ariel Yadin, Amir Yehudayoff (2010)

Annales de l'I.H.P. Probabilités et statistiques

We study the entropy of the set traced by an n-step simple symmetric random walk on ℤd. We show that for d≥3, the entropy is of order n. For d=2, the entropy is of order n/log2n. These values are essentially governed by the size of the boundary of the trace.

Currently displaying 421 – 440 of 1507