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

Displaying 201 – 220 of 966

Showing per page

Coarse quantization for random interleaved sampling of bandlimited signals∗∗∗

Alexander M. Powell, Jared Tanner, Yang Wang, Özgür Yılmaz (2012)

ESAIM: Mathematical Modelling and Numerical Analysis

The compatibility of unsynchronized interleaved uniform sampling with Sigma-Delta analog-to-digital conversion is investigated. Let f be a bandlimited signal that is sampled on a collection of N interleaved grids  {kT + Tn} k ∈ Z with offsets { T n } n = 1 N ⊂ [ 0 , T ] . If the offsets Tn are chosen independently and uniformly at random from  [0,T]  and if the sample values of f are quantized with a first order Sigma-Delta algorithm, then with high probability...

Codes générateurs minimaux de langages de mots bi-infinis

Jeanne Devolder (2010)

RAIRO - Theoretical Informatics and Applications

In this paper we give two families of codes which are minimal generators of biinfinite languages: the family of very thin codes (which contains the rational codes) and another family containing the circular codes. We propose the conjecture that all codes are minimal generators.

Colouring of cycles in the de Bruijn graphs

Ewa Łazuka, Jerzy Żurawiecki (2000)

Discussiones Mathematicae Graph Theory

We show that the problem of finding the family of all so called the locally reducible factors in the binary de Bruijn graph of order k is equivalent to the problem of finding all colourings of edges in the binary de Bruijn graph of order k-1, where each vertex belongs to exactly two cycles of different colours. In this paper we define and study such colouring for the greater class of the de Bruijn graphs in order to define a class of so called regular factors, which is not so difficult to construct....

Compatibility relations on codes and free monoids

Tomi Kärki (2008)

RAIRO - Theoretical Informatics and Applications

A compatibility relation on letters induces a reflexive and symmetric relation on words of equal length. We consider these word relations with respect to the theory of variable length codes and free monoids. We define an (R,S)-code and an (R,S)-free monoid for arbitrary word relations R and S. Modified Sardinas-Patterson algorithm is presented for testing whether finite sets of words are (R,S)-codes. Coding capabilities of relational codes are measured algorithmically by finding minimal and maximal relations....

Computation of centralizers in Braid groups and Garside groups.

Nuno Franco, Juan González-Meneses (2003)

Revista Matemática Iberoamericana

We give a new method to compute the centralizer of an element in Artin braid groups and, more generally, in Garside groups. This method, together with the solution of the conjugacy problem given by the authors in [9], are two main steps for solving conjugacy systems, thus breaking recently discovered cryptosystems based in braid groups [2]. We also present the result of our computations, where we notice that our algorithm yields surprisingly small generating sets for the centralizers.

Conditional distributivity of overlap functions over uninorms with continuous underlying operators

Hui Liu, Wenle Li (2024)

Kybernetika

The investigations of conditional distributivity are encouraged by distributive logical connectives and their generalizations used in fuzzy set theory and were brought into focus by Klement in the closing session of Linzs 2000. This paper is mainly devoted to characterizing all pairs ( O , F ) of aggregation functions that are satisfying conditional distributivity laws, where O is an overlap function, and F is a continuous t-conorm or a uninorm with continuous underlying operators.

Connections between object classification criteria using an ultrasonic bi-sonar system

Bogdan Kreczmer (2016)

International Journal of Applied Mathematics and Computer Science

The paper presents connections between the criteria which make three types of objects possible to be recognized, namely, edges, planes and corners. These criteria can be applied while a binaural sonar system is used. It is shown that the criteria are specific forms of a general equation. The form of the equation depends on a single coefficient. In the paper, the meaning of this coefficient is discussed. The constructions of the arrangement of objects are presented and are bound with values of the...

Currently displaying 201 – 220 of 966