Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 14 of 14 for “"preimage"”.
-
ATPG based Preimage Computation: Efficient Search Space Pruning using ZBDD
Preimage Computation is a fundamental step in Formal Verification of VLSI designs. Conventional OBDD-based methods for Formal Verification suffer from spatial explosion, since large designs can blow up in terms of memory. On the other hand, SAT/ATPG based methods are less demanding on memory. But …
-
Response curves of deterministic and probabilistic cellular automata in one and two dimensions
… We approach this problem using patterns in preimage sets - that is, the set of blocks which iterate to the desired output. This allows us to construct a response curve - a relationship between the proportion of cells in state 1 after niterations as a function of the initial proportion. We …
-
Search-space Aware Learning Techniques for Unbounded Model Checking and Path Delay Testing
… model checking, we need the core image / preimage computation engines that perform forward / backward reachability analysis. First, we develop an ATPG engine, with search-space aware learning, that computes ``all solutions" for a given target objective and stores it as a decision diagram. …
-
The Complete Preimage of Euclidean K-Space Under an Open Mapping With The1-Regular Property and Whose Point Inverses Are Open 2-Cells Is Euclidean(k Plus 2)-Space
Made available in DSpace on 2014-12-11T18:23:45Z (GMT). No. of bitstreams: 1 7206926.pdf: 3145209 bytes, checksum: 3212c154ca63432b3b2871295b0d3241 (MD5) Previous issue date: 1971
-
Finite Subdivision Rules from Matings of Quadratic Functions: Existence and Constructions
Combinatorial methods are utilized to examine preimage iterations of topologically glued polynomials. In particular, this paper addresses using finite subdivision rules and Hubbard trees as tools to model the dynamic behavior of mated quadratic functions. Several methods of construction of …
-
Security proofs for the MD6 hash function mode of operation
… properties including (but not limited to) first-preimage resistance, second-preimage resistance, collision resistance, and for keyed hash functions, pseudorandomness. This work presents proofs of security for the mode of operation of the MD6 cryptographic hash function [32] - a candidate for the …
-
Noise resilience of proofs of quantumness
… bit flip noise affects the success rate of the preimage test more heavily than the equation test. Conversely, the phase flip noise affects the equation test more heavily than the preimage test. With a maximum tolerable error rate of 0.10% obtained from the simple noise models, the protocol is …
-
The eleven dimensional supergravity equations, resolutions and Lefschetz fiber metrics
… powers but possible multiplicities, at the preimage of the singular fibers in terms of parameters of size comparable to the length of the shrinking geodesic. This is joint work with Richard Melrose. In the third part, the resolution of a compact group action in the sense described by Albin …
-
Security Assessment of a Machine Learning Approach to Generate and Validate Digital Signatures
… algorithm used, which include collisions, preimage resistance, or poor performance. specializes in enabling systems to learn from data and improve performance over time without being explicitly programmed. Machine Learning algorithms leverage statistical techniques to identify patterns and …
-
D-colorable digraphs with large girth
… f(u)f(v) is an arc of C or f(u)=f(v), and the preimage of every vertex of C induces an acyclic subdigraph in D. We say that D is C-colorable if it admits a C-coloring and that D is uniquely C-colorable if it is surjectively C-colorable and any two C-colorings of D differ by an automorphism of …
-
D-colorable digraphs with large girth
… f(u)f(v) is an arc of C or f(u)=f(v), and the preimage of every vertex of C induces an acyclic subdigraph in D. We say that D is C-colorable if it admits a C-coloring and that D is uniquely C-colorable if it is surjectively C-colorable and any two C-colorings of D differ by an automorphism of …
-
Metric Geometry of Finite Subset Spaces
… a subset A of X(n) is open if and only if its preimage under q is open in the product space X^n.</p> <p>Given a space X, let H(X) denote all homeomorphisms of X. For any subclass C of homeomorphisms in H(X), the C-geometry of X refers to the description of X up to homeomorphisms in C. …
-
Search State Extensibility based Learning Framework for Model Checking and Test Generation
… this framework in a branch-and-bound based preimage computation engine. Next, we show that it can be used to perform an upper-approximation based state space traversal, which is essential to handle industrial-scale hardware designs. Finally, we propose a simple but elegant image extraction …
-
Abstraction Guided Semi-formal Verification
Abstraction-guided simulation is a promising semi-formal framework for design validation in which an abstract model of the design is used to guide a logic simulator towards a target property. However, key issues still need to be addressed before this framework can truly deliver on it's promise. …