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

Displaying 101 – 120 of 1497

Showing per page

A related-key attack on iterated chaotic ciphers

Yang Yang, Chenhui Jin (2008)

Kybernetika

In this paper, we present a new type of attack on iterated chaotic ciphers using related keys. Based on the fact that a chaotic sequence is not sensitive to the less significant bits of initial conditions and parameters, a divide- and-conquer attack on iterated chaotic ciphers was presented by us before, which significantly reduces the computing complexity of attacks. However, if the information leaked is significant according to the distribution of the coincidence degrees, a measure for the information...

A short note on multivariate dependence modeling

Vladislav Bína, Radim Jiroušek (2013)

Kybernetika

As said by Mareš and Mesiar, necessity of aggregation of complex real inputs appears almost in any field dealing with observed (measured) real quantities (see the citation below). For aggregation of probability distributions Sklar designed his copulas as early as in 1959. But surprisingly, since that time only a very few literature have appeared dealing with possibility to aggregate several different pairwise dependencies into one multivariate copula. In the present paper this problem is tackled...

A simultaneous localization and tracking method for a worm tracking system

Mateusz Kowalski, Piotr Kaczmarek, Rafał Kabaciński, Mieszko Matuszczak, Kamil Tranbowicz, Robert Sobkowiak (2014)

International Journal of Applied Mathematics and Computer Science

The idea of worm tracking refers to the path analysis of Caenorhabditis elegans nematodes and is an important tool in neurobiology which helps to describe their behavior. Knowledge about nematode behavior can be applied as a model to study the physiological addiction process or other nervous system processes in animals and humans. Tracking is performed by using a special manipulator positioning a microscope with a camera over a dish with an observed individual. In the paper, the accuracy of a nematode's...

A survey of subpixel edge detection methods for images of heat-emitting metal specimens

Anna Fabijańska (2012)

International Journal of Applied Mathematics and Computer Science

In this paper the problem of accurate edge detection in images of heat-emitting specimens of metals is discussed. The images are provided by the computerized system for high temperature measurements of surface properties of metals and alloys. Subpixel edge detection is applied in the system considered in order to improve the accuracy of surface tension determination. A reconstructive method for subpixel edge detection is introduced. The method uses a Gaussian function in order to reconstruct the...

A Test for the Stability of Networks

Agnieszka Rowinska-Schwarzweller, Christoph Schwarzweller (2013)

Formalized Mathematics

A complex polynomial is called a Hurwitz polynomial, if all its roots have a real part smaller than zero. This kind of polynomial plays an all-dominant role in stability checks of electrical (analog or digital) networks. In this article we prove that a polynomial p can be shown to be Hurwitz by checking whether the rational function e(p)/o(p) can be realized as a reactance of one port, that is as an electrical impedance or admittance consisting of inductors and capacitors. Here e(p) and o(p) denote...

A tight bound for exhaustive key search attacks against Message Authentication Codes

Vinícius G. P. de SÁ, Davidson R. Boccardo, Luiz Fernando Rust, Raphael C. S. Machado (2013)

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

A Message Authentication Code (MAC) is a function that takes a message and a key as parameters and outputs an authentication of the message. MAC are used to guarantee the legitimacy of messages exchanged through a network, since generating a correct authentication requires the knowledge of the key defined secretly by trusted parties. However, an attacker with access to a sufficiently large number of message/authentication pairs may use a brute force algorithm to infer the secret key: from a set...

A topological asymptotic analysis for the regularized grey-level image classification problem

Didier Auroux, Lamia Jaafar Belaid, Mohamed Masmoudi (2007)

ESAIM: Mathematical Modelling and Numerical Analysis

The aim of this article is to propose a new method for the grey-level image classification problem. We first present the classical variational approach without and with a regularization term in order to smooth the contours of the classified image. Then we present the general topological asymptotic analysis, and we finally introduce its application to the grey-level image classification problem.

Currently displaying 101 – 120 of 1497