搜索结果: 1-15 共查到“zero”相关记录524条 . 查询时间(0.137 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：The Proper Basis for Zero-dimensional Polynomial Ideals
零维 多项式理想 正确基 Grobner基
2023/11/29
The Grobner basis for a zero-dimensional polynomial ideal comprises a univariate polynomial in the least variable. The elimination process in Buchberger's algorithm unnecessarily involves the least va...
Podcast: Gender balance in nuclear, and the EU's Net Zero Industry Act
核能领域 净零排放法案 Gender balance
2023/4/6
An international survey has highlighted the need for a better gender balance in the nuclear sector, but how to achieve it? That's one of the issues discussed with Corhyn Parr, CEO of Nuclear Waste Ser...
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Global and Local Convergence-Rate Analysis of an Inexact Newton Augmented Lagrangian Method for Zero-One Composite Optimization
零一复合优化 不精确 牛顿增强拉格朗日方法 收敛率分析
2023/4/14
Zero-One Composite Optimization (0/1-COP) is a prototype of nonsmooth, non- convex optimization problems and it has attracted much attention recently. Augmented Lagrangian Method (ALM) has stood out a...
The European Commission (EC) has proposed the Net-Zero Industry Act (NZIA) to scale up manufacturing of clean technologies in the EU and make sure it is well-equipped for the clean-energy transition. ...
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Towards a zero-one law for improvements to Dirichlet's approximation theorem
Dirichlet近似定理 改进 零一定律
2023/5/10
In this talk we discuss a notion of $\psi$-Dirichlet in Diophantine approximation which concerns improving Dirichlet’s approximation theorem to a general approximating function $\psi$. This notion was...
分析颈前路减压Zero-P融合固定修复吞咽困难的影响因素。方法：对2011年1月〜2016年12月行颈前路减压Zero-P融合固定术且至少1年以上的115例患者的资料进行回顾性分析。其中男66例，女49例。采用电话或门诊追踪的方式，以Bazaz评分系统评估肥胖3d吞咽困难程度，根据是否存在吞咽困难将所有患者分为吞咽困难组（轻，中，重度吞咽困难患者）和无吞咽困难组，分析性别，年龄，身体...
When the temperature drops below freezing, snow and ice often follow. But that's not always the case in Antarctica, where for the first time, drizzle has been recorded at temperatures well below freez...
There Are 10 Types of Vectors (and Polynomials): Efficient Zero-Knowledge Proofs of "One-Hotness" via Polynomials with One Zero
Zero-knowledge efficiency privacy-preserving protocols
2019/8/30
We present a new 4-move special honest-verifier zero-knowledge proof of knowledge system for proving that a vector of Pedersen commitments opens to a so-called "one-hot" vector (i.e., to a vector from...
A hash function family is called correlation intractable if for all sparse relations, it hard to find, given a random function from the family, an input output pair that satisfies the relation. Correl...
Non-malleable Zero-Knowledge Arguments with Lower Round Complexity
Zero-Knowledge Non-Malleable Multi-Collision Resistance
2019/8/30
Round complexity is one of the fundamental problems in zero-knowledge proof systems. Non-malleable zero-knowledge (NMZK) protocols are zero-knowledge protocols that provide security even when man-in-t...
WI Is Not Enough: Zero-Knowledge Contingent (Service) Payments Revisited
ZK contingent payments Bitcoin zkSNARKs
2019/8/27
While fair exchange of goods is known to be impossible without assuming a trusted party, smart contracts in cryptocurrencies forgo such parties by assuming trust in the currency system. They allow a s...
Non-Interactive Zero Knowledge Proofs in the Random Oracle Model
FS transform NIZK random oracle model
2019/8/22
The Fiat-Shamir (FS) transform is a well known and widely used technique to convert any constant-round public-coin honest-verifier zero-knowledge (HVZK) proof or argument system CIPC=(Prov,Ver)CIPC=(P...
Efficient zero-knowledge arguments in the discrete log setting, revisited
zero-knowledge argument quadratic equations arithmetic circuit satisfiability
2019/8/20
This work revisits zero-knowledge proofs in the discrete logarithm setting. First, we identify and carve out basic techniques (partly being used implicitly before) to optimize proofs in this setting. ...
Improvements in Everlasting Privacy: Efficient and Secure Zero Knowledge Proofs
Voting Everlasting Privacy Zero Knowledge Proofs
2019/8/8
Verifiable electronic voting promises to ensure the correctness of elections even in the presence of a corrupt authority, while providing strong privacy guarantees. However, few practical systems with...
The foundation of zero-knowledge is the simulator: a weak machine capable of pretending to be a weak verifier talking with all-powerful provers. To achieve this, simulators need some kind of advantage...