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

Page 1 Next

Displaying 1 – 20 of 65

Showing per page

Edon- ℛ ( 256 , 384 , 512 ) – an efficient implementation of Edon- ℛ family of cryptographic hash functions

Danilo Gligoroski, Svein Johan Knapskog (2008)

Commentationes Mathematicae Universitatis Carolinae

We have designed three fast implementations of a recently proposed family of hash functions Edon– ℛ . They produce message digests of length n = 256 , 384 , 512 bits and project security of 2 n 2 hash computations for finding collisions and 2 n hash computations for finding preimages and second preimages. The design is not the classical Merkle-Damgård but can be seen as wide-pipe iterated compression function. Moreover the design is based on using huge quasigroups of orders 2 256 , 2 384 and 2 512 that are constructed by using only bitwise...

Efficient calculation of the Reed-Muller form by means of the Walsh transform

Piotr Porwik (2002)

International Journal of Applied Mathematics and Computer Science

The paper describes a spectral method for combinational logic synthesis using the Walsh transform and the Reed-Muller form. A new algorithm is presented that allows us to obtain the mixed polarity Reed-Muller expansion of Boolean functions. The most popular minimisation (sub-minimisation) criterion of the Reed-Muller form is obtained by the exhaustive search of all the polarity vectors. This paper presents a non-exhaustive method for Reed-Muller expansions. The new method allows us to build the...

Efficient generation of 3D surfel maps using RGB-D sensors

Artur Wilkowski, Tomasz Kornuta, Maciej Stefańczyk, Włodzimierz Kasprzak (2016)

International Journal of Applied Mathematics and Computer Science

The article focuses on the problem of building dense 3D occupancy maps using commercial RGB-D sensors and the SLAM approach. In particular, it addresses the problem of 3D map representations, which must be able both to store millions of points and to offer efficient update mechanisms. The proposed solution consists of two such key elements, visual odometry and surfel-based mapping, but it contains substantial improvements: storing the surfel maps in octree form and utilizing a frustum culling-based...

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.

Currently displaying 1 – 20 of 65

Page 1 Next