Located actions in process algebra with timing
We propose a process algebra obtained by adapting the process algebra with continuous relative timing from Baeten and Middelburg [Process Algebra with Timing, Springer, 2002, Chap. 4] to spatially located actions. This process algebra makes it possible ...
A refined VQ-based image compression method
This paper presents a refined VQ-based image compression method which modifies the traditional VQ-based image compression method. The refined VQ-based image compression method further lossless encodes the compression data which is generated by the ...
Consistency conditions in fuzzy consumers theory
This paper is concerned with consistency properties for fuzzy consumers. We introduce the consistency conditions <i>F</i>α, <i>F</i>β, <i>F</i>δ as fuzzy forms of Sen's properties α, β and δ. Other consistency conditions are also studied: <i>F</i>α2, <i>...
On the relationship between monadic and weak monadic second order logic on arbitrary trees, with applications to the mu-calculus
In 1970 [26], in Weakly definable relations and special automata, Math. Log. and Found. of Set Theory, pp 1-23, Rabin shows that a language is recognizable by a tree automaton with Büchi like infinitary condition if and only if it is definable as the ...
Asymptotics for length and trajectory from cumulative chord piecewise-quartics
We discuss the problem of estimating the trajectory of a regular curve γ : [0, <i>T</i>] → R<sup>n</sup> and its length <i>d</i>(γ) from an ordered sample of interpolation points <i>Q</i><inf>m</inf> = {γ(<i>t</i><inf>0</inf>), γ(<i>t</i><inf>1</inf>),...
C1 Interpolation with cumulative chord cubics
Cumulative chord <i>C</i><sup>1</sup> piecewise-cubics, for unparameterized data from regular curves in R<sup>n</sup>, are constructed as follows. In the first step derivatives at given ordered interpolation points are estimated from ordinary (non-<i>C</...
Dual LDA for face recognition
The complete theory for Fisher and dual discriminant analysis is presented as the background of the novel algorithms. LDA is found as composition of projection onto the singular subspace for within-class normalised data with the projection onto the ...
Fast index filtering in vector approximation file
Several fast filtering attributes are analysed for vector interval (cell) pruning while querying the vector approximation file. Beside distance range, sum and median features their deviation forms are introduced. Range and <i>K</i>-NN queries are ...
A method to prove non-reachability in priority duration Petri nets
Times and priorities are important concepts that are frequently used to model real-world systems. Thus, there exist extensions for Petri nets which allow to model times and priorities. In contrast, many proof techniques are based on classical (time-less ...
Image indexing by distributed color temperature descriptions
The paper presents new methods for image content indexing by the use of color temperature feature. A descriptor for dominant color temperature is introduced, for which two types of queries are discussed: a query by color temperature value and a query by ...
Scenery image segmentation using support vector machines
This paper presents an effective and efficient method for solving scenery image segmentation by applying the SVMs methodology. Scenery image segmentation is regarded as a data classification problem, and is effectively answered by the proposed method in ...
Enhanced of key agreement protocols resistant to a denial-of-service attack
The denial-of-service attack, a malicious client executes a key agreement protocol simultaneously many times to exhaust the server's memory or computing resource and to interfere the honest client connecting with the server. It is a serious problem in ...