Generalized aggregation operators are the tool for aggregation of fuzzy sets. The apparatus was introduced by Takači in [11]. -extension is a construction method of a generalized aggregation operator and we study it in the paper. We observe the behavior of a -extension with respect to different order relations and we investigate properties of the construction.
We introduce ternary wavelets, based on an interpolating 4-point C^2 ternary stationary subdivision scheme, for compressing fractal-like signals. These wavelets are tightly squeezed and therefore they are more suitable for compressing fractal-like signals. The error in compressing fractal-like signals by ternary wavelets is at most half of that given by four-point wavelets (Wei and Chen, 2002). However, for compressing regular signals we further classify ternary wavelets into 'odd ternary' and 'even...
In secret sharing, different access structures have different difficulty degrees for acceding to the secret. We give a numerical measure of how easy or how difficult is to recover the secret, depending only on the structure itself and not on the particular scheme used for realizing it. We derive some consequences.
In this paper, we face a generalization of the problem of finding the distribution of how long it takes to reach a “target” set T of states in Markov chain. The graph problems of finding the number of paths that go from a state to a target set and of finding the n-length path connections are shown to belong to this generalization. This paper explores how the state space of the Markov chain can be reduced by collapsing together those states that behave in the same way for the purposes of calculating...
In this paper we consider two versions of the Collatz-Wielandt quotient for a pair of nonnegative operators that map a given pointed generating cone in the first space into a given pointed generating cone in the second space. If the two spaces and two cones are identical, and is the identity operator, then one version of this quotient is the spectral radius of . In some applications, as commodity pricing, power control in wireless networks and quantum information theory, one needs to deal with...
We investigate the lattice of machine invariant classes. This is an infinite completely distributive lattice but it is not a Boolean lattice. The length and width of it is c. We show the subword complexity and the growth function create machine invariant classes.
Consider a graph directed iterated function system (GIFS) on the line which consists of similarities. Assuming neither any separation conditions, nor any restrictions on the contractions, we compute the almost sure dimension of the attractor. Then we apply our result to give a partial answer to an open problem in the field of fractal image recognition concerning some self-affine graph directed attractors in space.
We connect the discrete logarithm problem over prime fields in the safe prime case to the logarithmic derivative.