Results 121 to 130 of about 2,222 (156)
Some of the next articles are maybe not open access.
International Journal of Bifurcation and Chaos, 1999
Several entropy-like invariants have been defined for noninvertible maps, based on various ways of measuring the dispersion of preimages and preimage sets in the past. We investigate basic properties of four such invariants, finding that their behavior in some ways differs sharply from the analogous behavior for topological entropy.
Nitecki, Zbigniew, Przytycki, Feliks
openaire +2 more sources
Several entropy-like invariants have been defined for noninvertible maps, based on various ways of measuring the dispersion of preimages and preimage sets in the past. We investigate basic properties of four such invariants, finding that their behavior in some ways differs sharply from the analogous behavior for topological entropy.
Nitecki, Zbigniew, Przytycki, Feliks
openaire +2 more sources
Preimages of the Numerical Range
The American Mathematical Monthly, 2017AbstractFor a nonnormal two-by-two matrix B, there exist two open disjoint subsets of the complex unit sphere from which the mapping z*Bz is a bijection onto the interior of the numerical range of B. Moreover, the union of the closures of these two subsets, up to rotation, yields the entire unit sphere.
John Clifford +2 more
openaire +2 more sources
Images and Preimages in Random Mappings
SIAM Journal on Discrete Mathematics, 1997We present a general theorem that can be used to identify the limiting distribution for a class of combinatorial schemata. For example, many parameters in random mappings can be covered in this way. In particular, we can derive the limiting distribution of those points with a given number of total predecessors.
Drmota, Michael, Soria, Michèle
openaire +2 more sources
2006
This article presents a rare case of a deterministic second preimage attack on a cryptographic hash function. Using the notion of controllable output differences, we show how to construct second preimages for the SMASH hash functions. If the given preimage contains at least n+1 blocks, where n is the output length of the hash function in bits, then the
Mario Lamberger +3 more
openaire +2 more sources
This article presents a rare case of a deterministic second preimage attack on a cryptographic hash function. Using the notion of controllable output differences, we show how to construct second preimages for the SMASH hash functions. If the given preimage contains at least n+1 blocks, where n is the output length of the hash function in bits, then the
Mario Lamberger +3 more
openaire +2 more sources
Mathematical Proceedings of the Cambridge Philosophical Society, 1992
All manifolds in this paper are piecewise linear (or smooth if one wishes).
Rong, Yongwu, Wang, Shicheng
openaire +2 more sources
All manifolds in this paper are piecewise linear (or smooth if one wishes).
Rong, Yongwu, Wang, Shicheng
openaire +2 more sources
Images and preimages of -filterbases
Fuzzy Sets and Systems, 2006The paper is concerned with the notion of \(L\)-filterbase formed on a strictly two-sided, commutative quantale lattice \(L\). Considering that \(L\) is a complete lattice and \(\phi\) is a function \(\phi: X\to Y\), the Zadeh image and preimage operators are defined in the form \[ \phi^{\rightarrow}_L(f)(y)= \bigvee\{f(x)\mid\phi(x)= y\},\qquad \phi^{\
Kim, Yong Chan, Ko, Jung Mi
openaire +2 more sources
Preimage Problems for Reaction Systems
2015We investigate the computational complexity of some problems related to preimages and ancestors of states of reaction systems. In particular, we prove that finding a minimum-cardinality preimage or ancestor, computing their size, or counting them are all intractable problems, with complexity ranging from ^[log] to (poly)
DENNUNZIO, ALBERTO +3 more
openaire +5 more sources
On Preimage Entropy of a Sequential Mapping
Open Systems & Information Dynamics, 2008Biś [2] introduced the notion of entropy-like invariants as an extension of the concept of pointwise preimage entropy. This paper follows Biś concept and extends the behaviour of preimage entropy to the case of a fixed sequence of maps. Therefore, some results are obtained, and we also show that for any continuous maps S and T from a compact metric ...
openaire +1 more source
Preimage Relations and Their Matrices
1998Information systems (in the sense of Pawlak) are used for representing properties of objects by the means of attributes and their values. However, sometimes there are situations in which we cannot give an exact value of an attribute for an object; we can only approximate the incompletely known value by a subset of values, in which the actual value is ...
openaire +2 more sources
Preimage Awareness in Linicrypt
2023 IEEE 36th Computer Security Foundations Symposium (CSF), 2023Zahra Javar, Bruce M. Kapron
openaire +2 more sources