搜索结果: 1-15 共查到“Explicit”相关记录188条 . 查询时间(0.046 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Stokes phenomenon and isomonodromy deformation equations: Explicit solution to the Riemann-Hilbert problem and integrability of the isomonodromy equation
斯托克斯现象 等单向变形方程 黎曼-希尔伯特问题 显式解 单场方程 可积性
2023/5/6
Stokes phenomenon states that the asymptotic behavior of functions can differ in different regions of the complex plane, and that these differences can be described in a quantitative way. These quanti...
Key Encapsulation Mechanism with Explicit Rejection in the Quantum Random Oracle Model
quantum random oracle model key encapsulation mechanism explicit rejection
2019/1/26
The recent post-quantum cryptography standardization project launched by NIST increased the interest in generic key encapsulation mechanism (KEM) constructions in the quantum random oracle (QROM). Bas...
Four-state Non-malleable Codes with Explicit Constant Rate
information theoretic cryptography non-malleability
2017/9/26
Non-malleable codes (NMCs), introduced by Dziembowski, Pietrzak and Wichs (ITCS 2010), generalize the classical notion of error correcting codes by providing a powerful guarantee even in scenarios whe...
Transfer from implicit to explicit phonological abilities in first and second language learners
implicit phonological abilities explicit phonological abilities second language learning
2017/8/29
Children's abilities to process the phonological structure of words are important predictors of their literacy development. In the current study, we examined the interrelatedness between implicit (i.e...
Much research has been devoted to studies of and algorithms for memory management based on garbage collection or explicit allocation and deallocation. An alternative approach, region-based memory mana...
Modelgen: Mining Explicit Information Flow Specifications from Concrete Executions
Dynamic analysis specification mining information flow
2016/5/24
We present a technique to mine explicit information flow specifications from concrete executions. These specifications can be consumed by a static taint analysis, enabling static analysis to work even...
Interactively Verifying Absence of Explicit Information Flows in Android Apps
interactive verification abductive inference specifications from tests
2016/5/24
App stores are increasingly the preferred mechanism for distributing software, including mobile apps (Google Play),desktop apps (Mac App Store and Ubuntu Software Center),computer games (the Steam Sto...
Explicit Non-Malleable Codes Resistant to Permutations
Non-malleable Codes Explicit Construction Information Theoretic
2016/1/23
The notion of non-malleable codes was introduced as a relaxation of standard error-correction and error-detection. Informally, a code is non-malleable if the message contained in a modified codeword...
Explicit Optimal Binary Pebbling for One-Way Hash Chain Reversal
hash chains pebbling in-place algorithms
2016/1/23
We present explicit optimal binary pebbling algorithms for reversing one-way hash chains. For a hash chain of length 2k , the number of hashes performed in each output round does not exceed dk/2e, ...
Explicit endomorphism of the Jacobian of a hyperelliptic function field of genus 2 using base field operations
public-key cryptography hyperelliptic curves
2016/1/9
We present an efficient endomorphism for the Jacobian of a curve C of genus 2 for divisors having a Non
disjoint support. This extends the work of Costello in [12] who calculated explicit formul?for ...
Explicit Non-malleable Codes Resistant to Permutations and Perturbations
Non-malleable Codes Explicit Construction Information Theoretic
2016/1/6
A non-malleable code protects messages against various classes of tampering. Informally, a
code is non-malleable if the message contained in a tampered codeword is either the original
message, or a ...
A More Explicit Formula for Linear Probabilities of Modular Addition Modulo a Power of Two
Modular addition modulo a power of two Linear probability Symmetric cipher
2016/1/5
Linear approximations of modular addition modulo a power of two was studied by Wallen in 2003. He presented an efficient algorithm for computing linear probabilities of modular addition. In 2013 Scult...
Implicit and Explicit Awareness of a Phonics Rule in the Word Recognition of Students With and Without Learning Disabilities
Phonics Rule Student
2015/9/22
This study investigates the ability of students with and without learning disabilities to learn a phonics rule implicitly and the ability of these students to report accurately about the rule verbally...
EXPLICIT CLASS FIELD THEORY FOR GLOBAL FUNCTION FIELDS
EXPLICIT CLASS FIELD THEORY GLOBAL FUNCTION FIELDS
2015/8/26
Let F be a global function field and let F ab be its maximal abelian extension. Following an approach of D. Hayes, we shall construct a continuous homomorphism ρ: Gal(F ab/F) → CF , where CF is the id...
AN EXPLICIT JACOBIAN OF DIMENSION 3 WITH MAXIMAL GALOIS ACTION
EXPLICIT JACOBIAN DIMENSION 3 MAXIMAL GALOIS ACTION
2015/8/26
We gives an explicit genus 3 curve over Q such that the Galois action on the torsion points of its Jacobian is a large as possible. That such curves exist is a consequence of a theorem of D. Zureick-B...