Page 1 Next

Displaying 1 – 20 of 25

Showing per page

Decidability of code properties

Henning Fernau, Klaus Reinhardt, Ludwig Staiger (2007)

RAIRO - Theoretical Informatics and Applications

We explore the borderline between decidability and undecidability of the following question: “Let C be a class of codes. Given a machine 𝔐 of type X, is it decidable whether the language L ( 𝔐 ) lies in C or not?” for codes in general, ω-codes, codes of finite and bounded deciphering delay, prefix, suffix and bi(pre)fix codes, and for finite automata equipped with different versions of push-down stores and counters.

Deciding knowledge in security protocols under some e-voting theories

Mouhebeddine Berrima, Narjes Ben Rajeb, Véronique Cortier (2011)

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

In the last decade, formal methods have proved their interest when analyzing security protocols. Security protocols require in particular to reason about the attacker knowledge. Two standard notions are often considered in formal approaches: deducibility and indistinguishability relations. The first notion states whether an attacker can learn the value of a secret, while the latter states whether an attacker can notice some difference between protocol runs with different values of the secret. Several...

Deciding knowledge in security protocols under some e-voting theories

Mouhebeddine Berrima, Narjes Ben Rajeb, Véronique Cortier (2011)

RAIRO - Theoretical Informatics and Applications

In the last decade, formal methods have proved their interest when analyzing security protocols. Security protocols require in particular to reason about the attacker knowledge. Two standard notions are often considered in formal approaches: deducibility and indistinguishability relations. The first notion states whether an attacker can learn the value of a secret, while the latter states whether an attacker can notice some difference between protocol runs with different values of the secret. Several...

Decomposition of vibration signals into deterministic and nondeterministic components and its capabilities of fault detection and identification

Tomasz Barszcz (2009)

International Journal of Applied Mathematics and Computer Science

The paper investigates the possibility of decomposing vibration signals into deterministic and nondeterministic parts, based on the Wold theorem. A short description of the theory of adaptive filters is presented. When an adaptive filter uses the delayed version of the input signal as the reference signal, it is possible to divide the signal into a deterministic (gear and shaft related) part and a nondeterministic (noise and rolling bearings) part. The idea of the self-adaptive filter (in the literature...

Detection of influential points by convex hull volume minimization

Petr Tichavský, Pavel Boček (1998)

Kybernetika

A method of geometrical characterization of multidimensional data sets, including construction of the convex hull of the data and calculation of the volume of the convex hull, is described. This technique, together with the concept of minimum convex hull volume, can be used for detection of influential points or outliers in multiple linear regression. An approximation to the true concept is achieved by ordering the data into a linear sequence such that the volume of the convex hull of the first...

Detection of moving objects in image sequences using 3D velocity filters

Sam Schauland, Joerg Velten, Anton Kummert (2008)

International Journal of Applied Mathematics and Computer Science

A movement analysis of objects contained in visual scenes can be performed by means of linear multidimensional filters, which have already been analyzed in the past. While the soundness of the results was convincing, interest in those systems declined due to the limited computational power of contemporary computers. Recent advances in design and implementation of integrated circuits and hardware architectures allow realizing velocity filters if the n-D system is carefully adapted to the analyzed...

Determinant of Some Matrices of Field Elements

Yatsuka Nakamura (2006)

Formalized Mathematics

Here, we present determinants of some square matrices of field elements. First, the determinat of 2 * 2 matrix is shown. Secondly, the determinants of zero matrix and unit matrix are shown, which are equal to 0 in the field and 1 in the field respectively. Thirdly, the determinant of diagonal matrix is shown, which is a product of all diagonal elements of the matrix. At the end, we prove that the determinant of a matrix is the same as the determinant of its transpose.

Diophantine equations and class number of imaginary quadratic fields

Zhenfu Cao, Xiaolei Dong (2000)

Discussiones Mathematicae - General Algebra and Applications

Let A, D, K, k ∈ ℕ with D square free and 2 ∤ k,B = 1,2 or 4 and μ i - 1 , 1 ( i = 1 , 2 ) , and let h ( - 2 1 - e D ) ( e = 0 o r 1 ) denote the class number of the imaginary quadratic field ( ( - 2 1 - e D ) ) . In this paper, we give the all-positive integer solutions of the Diophantine equation Ax² + μ₁B = K((Ay² + μ₂B)/K)ⁿ, 2 ∤ n, n > 1 and we prove that if D > 1, then h ( - 2 1 - e D ) 0 ( m o d n ) , where D, and n satisfy k - 2 e + 1 = D x ² , x ∈ ℕ, 2 ∤ n, n > 1. The results are valuable for the realization of quadratic field cryptosystem.

Currently displaying 1 – 20 of 25

Page 1 Next