The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
A new supervised classification algorithm of a heavily distorted pattern (shape) obtained from noisy observations of nonstationary signals is proposed in the paper. Based on the Gabor transform of 1-D non-stationary signals, 2-D shapes of signals are formulated and the classification formula is developed using the pattern matching idea, which is the simplest case of a pattern recognition task. In the pattern matching problem, where a set of known patterns creates predefined classes, classification...
Intrusion detection is a critical component of security information systems. The intrusion detection process attempts to detect malicious
attacks by examining various data collected during processes on the protected system. This paper examines the anomaly-based intrusion detection
based on sequences of system calls. The point is to construct a model that
describes normal or acceptable system activity using the classification trees
approach. The created database is utilized as a basis for distinguishing...
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 ∈ Zwith offsets T n n = 1 N ⊂ [ 0 ,T ] . If the offsetsTn are chosen independently and uniformly at random from [0,T] and if the sample values of fare quantized with a first order Sigma-Delta algorithm, then with high probability the quantization error | f ( t ) − x10ff65;...
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 . 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...
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.
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....
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....
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.
Currently displaying 21 –
40 of
68