搜索结果: 1-15 共查到“complexity”相关记录479条 . 查询时间(0.078 秒)
The Historical Complexity of Tree Height Growth Dynamic Associated with Climate Change in Western North America
height growth site index global climate change species range species characteristics species ecological amplitude geographic locations western North America
2023/12/1
The effect of climate on tree growth has received increased interest in the context of climate change. However, most studies have been limited geographically and with respect to species. Here, sixteen...
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：The complexity of computing Markov perfect equilibrium in general-sum stochastic games
一般 随机博弈 马尔可夫完美均衡 计算复杂性
2023/5/12
Similar to the role of Markov decision processes in reinforcement learning, Markov games (also known as stochastic games) form the basis for the study of multi-agent reinforcement learning and sequenc...
【有机化学学术报告】Access Molecular Complexity by Breaking Symmetry of Dicarbonyl Compounds（图）
Molecular Complexity Breaking Symmetry Dicarbonyl Compounds
2023/6/20
【有机化学学术报告】Access Molecular Complexity by Breaking Symmetry of Dicarbonyl Compounds
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Does qubit connectivity impact quantum circuit complexity
量子比特连接 量子电路 复杂性
2023/4/13
Some physical implementation schemes of quantum computing -- such as those based on superconducting qubits, quantum dots, and cold atoms -- can apply two-qubit gates only on certain pairs of qubits. O...
With plants as a model, studying the ‘complexity and reproducibility’ of developmental biology（图）
植物 发育生物学 分子机制
2023/7/11
Nearly paper-thin, often with a complex two-dimensional shape, leaves may number into the hundreds of thousands on an organism like a white oak. Yet typically, each leaf appears quite similar in form.
Engineers use artificial intelligence to capture the complexity of breaking waves（图）
人工智能 破浪 复杂性 模型预测 海洋气候模拟
2023/6/19
Waves break once they swell to a critical height, before cresting and crashing into a spray of droplets and bubbles. These waves can be as large as a surfer’s point break and as small as a gentle ripp...
近日，我校以邬焜教授为首的人文学院信息哲学团队在国际高水平SCI期刊 Complexity 在线发表论文“Philosophical Analysis of the Meaning and Nature of Entropy and Negative Entropy Theories”，对当代信息科学兴起之初第一个关于信息本质解读的理论范式，即熵论和负熵论进行了具体解析。这是继2019年在线发表“...
Study reveals evolutionary clues to honeybees' social complexity（图）
evolutionary clues honeybees social complexity
2020/2/20
The complex social life of honeybees -- with their queens and workers cooperating to produce honey -- is deeply entrenched in the public's imagination. But the majority of the world's more than 20,000...
Structural complexity in forests improves carbon capture（图）
Structural complexity forests carbon capture
2019/10/17
Forests in the eastern United States that are structurally complex -- the arrangement of vegetation is varied throughout the physical space -- sequester more carbon, according to a new study in Ecolog...
Transparent Polynomial Commitment Scheme with Polylogarithmic Communication Complexity
polynomial commitments zero-knowledge proofs proximity testing
2019/9/16
We introduce novel efficient and transparent construction of the polynomial commitment scheme. A polynomial commitment scheme allows one side (the prover) to commit to a polynomial of predefined degre...
Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation
Fairness and Guaranteed Output Delivery MPC Round Complexity
2019/9/5
Two of the most sought-after properties of Multi-party Computation (MPC) protocols are fairness and guaranteed output delivery (GOD), the latter also referred to as robustness. Achieving both, however...
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...
Although Byzantine Agreement (BA) has been studied for three decades, perhaps somewhat surprisingly, there still exist significant gaps in our understanding regarding its round complexity. First, alth...
On the Round Complexity of Randomized Byzantine Agreement
Byzantine agreement lower bound round complexity
2019/7/31
We prove lower bounds on the round complexity of randomized Byzantine agreement (BA) protocols, bounding the halting probability of such protocols after one and two rounds.
Athena: A verifiable, coercion-resistant voting system with linear complexity
cryptographic protocols election schemes
2019/7/8
Seminal work by Juels, Catalano & Jakobsson delivered a verifiable, coercion-resistant voting system with quadratic complexity. This manuscript attempts to advance the state-of-the-art by delivering a...