Results 161 to 170 of about 39,607 (176)
Some of the next articles are maybe not open access.
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
Metric Mean Dimension via Preimage Structures
Journal of Statistical PhysicsLet \((X, d)\) be a compact metric space and \(f : X\to X\) be a continuous map. \textit{M. Hurley} [Ergodic Theory Dyn. Syst. 15, No. 3, 557--568 (1995; Zbl 0833.54021)] introduced the topological preimage entropy of \(f\) as follows \[ h_m(f)=\lim_{\varepsilon \rightarrow 0} h_m(f,\varepsilon ) =\underset{n\rightarrow \infty }{\lim \sup }\frac{1}{n ...
Chunlin Liu, Fagner B. Rodrigues
openaire +1 more source
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 +4 more sources
Mathematical Notes, 2006
This paper is a relative version of [\textit{R. Dobrenko} and \textit{Z. Kucharski}, Fundam. Math. 134, No. 1, 1--14 (1990; Zbl 0719.55002)]. Given a relative map \(f\colon (X,X_0)\to (Y, Y_0)\) and a subset \(B\) of \(Y\), the author of this paper discusses the estimation of the minimal number \(MP_{\text{rel}}(f, B)=\min _g | g^{-1}(B)| \) of ...
openaire +1 more source
This paper is a relative version of [\textit{R. Dobrenko} and \textit{Z. Kucharski}, Fundam. Math. 134, No. 1, 1--14 (1990; Zbl 0719.55002)]. Given a relative map \(f\colon (X,X_0)\to (Y, Y_0)\) and a subset \(B\) of \(Y\), the author of this paper discusses the estimation of the minimal number \(MP_{\text{rel}}(f, B)=\min _g | g^{-1}(B)| \) of ...
openaire +1 more source
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
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 +1 more source
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 +1 more source
Proceedings of the American Mathematical Society, 1987
Let K be a satellite knot with companion K' in \(S^ 3\). An embedding of the solid torus with core K' containing K which maps K' onto the unknot in \(S^ 3\) maps K onto a ``preimage'' or ``pattern'' \(K_ 0\) of K. Denote by \(K_ 0...>K_ n>....\) The proof uses Thurston's uniformization theorem and Gromov's invariant. A ``complexity'' c(K) consisting of
openaire +1 more source
Let K be a satellite knot with companion K' in \(S^ 3\). An embedding of the solid torus with core K' containing K which maps K' onto the unknot in \(S^ 3\) maps K onto a ``preimage'' or ``pattern'' \(K_ 0\) of K. Denote by \(K_ 0...>K_ n>....\) The proof uses Thurston's uniformization theorem and Gromov's invariant. A ``complexity'' c(K) consisting of
openaire +1 more source
Preimage Awareness in Linicrypt
2023 IEEE 36th Computer Security Foundations Symposium (CSF), 2023Zahra Javar, Bruce M. Kapron
openaire +1 more source
Generalized preimage of conics
2009This paper focuses on the preimage of conics in dimension n. We use a parameter space to determine the Euclidean straight lines which cross the given pixel set. Those lines are gathered in the generalized preimage of the pixel set. To adapt this method to the Pythagorean model, based on the Euclidean distance d2, we propose the preimage for circles ...
Andres, Eric, Largeteau-Skapin, Gaëlle
openaire +1 more source