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 17 Next

Displaying 321 – 340 of 961

Showing per page

Filtering of signals transmitted in multichannel from Chandrasekhar and Riccati recursions.

S. Nakamori, A. Hermoso, J. Jiménez, J. Linares (2005)

Extracta Mathematicae

In this paper two recursive algorithms are proposed and compared as a solution of the least mean-squared error linear filtering problem of a wide-sense stationary scalar signal from uncertain observations perturbed by white and coloured additive noises. Considering that the state-space model of the signal is not available and that the variables modelling the uncertainty are not independent, the proposed algorithms are derived by using covariance information. The difference between both algorithms...

Finite completion of comma-free codes. Part 1

Nguyen Huong Lam (2004)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

This paper is the first step in the solution of the problem of finite completion of comma-free codes. We show that every finite comma-free code is included in a finite comma-free code of particular kind, which we called, for lack of a better term, canonical comma-free code. Certainly, finite maximal comma-free codes are always canonical. The final step of the solution which consists in proving further that every canonical comma-free code is completed to a finite maximal comma-free code, is intended...

Finite Completion of comma-free codes Part 1

Nguyen Huong Lam (2010)

RAIRO - Theoretical Informatics and Applications

This paper is the first step in the solution of the problem of finite completion of comma-free codes. We show that every finite comma-free code is included in a finite comma-free code of particular kind, which we called, for lack of a better term, canonical comma-free code. Certainly, finite maximal comma-free codes are always canonical. The final step of the solution which consists in proving further that every canonical comma-free code is completed to a finite maximal comma-free code, is intended...

Finite completion of comma-free codes. Part 2

Nguyen Huong Lam (2004)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

This paper is a sequel to an earlier paper of the present author, in which it was proved that every finite comma-free code is embedded into a so-called (finite) canonical comma-free code. In this paper, it is proved that every (finite) canonical comma-free code is embedded into a finite maximal comma-free code, which thus achieves the conclusion that every finite comma-free code has finite completions.

Finite Completion of comma-free codes Part 2

Nguyen Huong Lam (2010)

RAIRO - Theoretical Informatics and Applications

This paper is a sequel to an earlier paper of the present author, in which it was proved that every finite comma-free code is embedded into a so-called (finite) canonical comma-free code. In this paper, it is proved that every (finite) canonical comma-free code is embedded into a finite maximal comma-free code, which thus achieves the conclusion that every finite comma-free code has finite completions.


Flow control in connection-oriented networks: a time-varying sampling period system case study

Przemysław Ignaciuk, Andrzej Bartoszewicz (2008)

Kybernetika

In this paper congestion control problem in connection-oriented communication network with multiple data sources is addressed. In the considered network the feedback necessary for the flow regulation is provided by means of management units, which are sent by each source once every M data packets. The management units, carrying the information about the current network state, return to their origin round trip time RTT after they were sent. Since the source rate is adjusted only at the instant of...

Formalization of Integral Linear Space

Yuichi Futa, Hiroyuki Okazaki, Yasunari Shidama (2011)

Formalized Mathematics

In this article, we formalize integral linear spaces, that is a linear space with integer coefficients. Integral linear spaces are necessary for lattice problems, LLL (Lenstra-Lenstra-Lovász) base reduction algorithm that outputs short lattice base and cryptographic systems with lattice [8].

Formalization of the Advanced Encryption Standard. Part I

Kenichi Arai, Hiroyuki Okazaki (2013)

Formalized Mathematics

In this article, we formalize the Advanced Encryption Standard (AES). AES, which is the most widely used symmetric cryptosystem in the world, is a block cipher that was selected by the National Institute of Standards and Technology (NIST) as an official Federal Information Processing Standard for the United States in 2001 [12]. AES is the successor to DES [13], which was formerly the most widely used symmetric cryptosystem in the world. We formalize the AES algorithm according to [12]. We then verify...

Formalization of the Data Encryption Standard

Hiroyuki Okazaki, Yasunari Shidama (2012)

Formalized Mathematics

In this article we formalize DES (the Data Encryption Standard), that was the most widely used symmetric cryptosystem in the world. DES is a block cipher which was selected by the National Bureau of Standards as an official Federal Information Processing Standard for the United States in 1976 [15].

From Bi-ideals to Periodicity

Jānis Buls, Aivars Lorencs (2008)

RAIRO - Theoretical Informatics and Applications

The necessary and sufficient conditions are extracted for periodicity of bi-ideals. They cover infinitely and finitely generated bi-ideals.

From the Slit-Island Method to the Ising model: Analysis of irregular grayscale objects

Przemysław Mazurek, Dorota Oszutowska-Mazurek (2014)

International Journal of Applied Mathematics and Computer Science

The Slit Island Method (SIM) is a technique for the estimation of the fractal dimension of an object by determining the area-perimeter relations for successive slits. The SIM could be applied for image analysis of irregular grayscale objects and their classification using the fractal dimension. It is known that this technique is not functional in some cases. It is emphasized in this paper that for specific objects a negative or an infinite fractal dimension could be obtained. The transformation...

Funciones de entropía asociadas a medidas de Csiszar.

Miquel Salicrú Pagès, Carles Maria Cuadras (1987)

Qüestiió

En este trabajo se presentan las medidas de entropía que provienen de la distancia, en el sentido de Csiszar, entre una distribución y la distribución en la que todos los sucesos son equiprobables. En segundo lugar, se estudian condiciones para la concavidad y no negatividad de las medidas propuestas. Finalmente, se obtienen los funcionales Φ-entropía como casos particulares de las medidas estudiadas.

Currently displaying 321 – 340 of 961