搜索结果: 1-15 共查到“Knowledge”相关记录1286条 . 查询时间(0.157 秒)
首届国际组织胜任力大赛(IO SDG KNOWLEDGE SHARING)参赛方案与报名通道
国际组织 胜任力 参赛方案 报名通道 IO SDG KNOWLEDGE SHARING
2023/3/19
为深化国际组织和全球治理相关领域的研究，推动国际组织人才培养，提高学生对国际组织问题的兴趣和关注度，增加学生对国际组织有关知识的了解，为关注全球治理、未来有志参与国际组织工作的学生提供学习交流的平台，培养分析和解决问题的能力，促进其理论素养和实践能力的提升，北京外国语大学定于2022年12月至2023年4月发起并举办首届国际组织胜任力大赛。
中国人民大学统计学院吕晓玲教授、王菲菲副教授就联合文本主题建模问题在《Data Mining and Knowledge Discovery》发表论文（图）
吕晓玲 王菲菲 建模 文本
2024/11/26
中国人民大学统计学院吕晓玲教授、王菲菲副教授在《Data Mining and Knowledge Discovery》发表论文。该研究主要探讨了两种带有联动作用的文本主题建模问题。研究中提出了一种全新的Joint Dynamic Topic Model(JDTM)模型，该模型在传统的动态主题模型的基础上，通过建立两种文本在时间上的前后关联性，可以挖掘两类文本的“超前-滞后”作用（lead-lag...
Knowledge of severe storm patterns may improve tornado warnings（图）
Knowledge severe storm patterns tornado warnings
2020/7/10
Advanced radar techniques may help distinguish which severe storms are likely to produce dangerous tornadoes, leading to more accurate warnings, according to National Science Foundation-funded sc...
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...
PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge
zk-SNARKs SRS
2019/8/22
zk-SNARK constructions that utilize an updatable universal structured reference string remove one of the main obstacles in deploying zk-SNARKs [GKMMM, Crypto 2018]. The important work of Maller et al....
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...
Efficient Perfectly Sound One-message Zero-Knowledge Proofs via Oracle-aided Simulation
zero-knowledge NIZK RSA ZAP
2019/6/26
In this paper we put forth new one-message proof systems for several practical applications, like proving that an El Gamal ciphertext (over a multiplicative group) decrypts to a given value and correc...
Efficient Lattice-Based Zero-Knowledge Arguments with Standard Soundness: Construction and Applications
Lattice Zero-Knowledge Argument
2019/6/26
We provide new zero-knowledge argument of knowledge systems that work directly for a wide class of language, namely, ones involving the satisfiability of matrix-vector relations and integer relations ...
Black-Box Language Extension of Non-Interactive Zero-Knowledge Arguments
NIZK USS-NIZK black-box construction
2019/6/13
Highly efficient non-interactive zero-knowledge arguments (NIZK) are often constructed for limited languages and it is not known how to extend them to cover wider classes of languages in general. In t...