Zobrazeno 1 - 10
of 1 093
pro vyhledávání: '"Wang, Zicheng"'
The endless stream of vulnerabilities urgently calls for principled mitigation to confine the effect of exploitation. However, the monolithic architecture of commodity OS kernels, like the Linux kernel, allows an attacker to compromise the entire sys
Externí odkaz:
http://arxiv.org/abs/2409.09606
Three-dimensional (3D) quantum XYZ product can construct a class of non-CSS codes by using three classical codes. However, their error-correcting performance has not been studied in depth so far and whether this code construction can be generalized t
Externí odkaz:
http://arxiv.org/abs/2408.03123
The balance between exploration (Er) and exploitation (Ei) determines the generalization performance of the particle swarm optimization (PSO) algorithm on different problems. Although the insufficient balance caused by global best being located near
Externí odkaz:
http://arxiv.org/abs/2406.16500
Point cloud analysis has seen substantial advancements due to deep learning, although previous Transformer-based methods excel at modeling long-range dependencies on this task, their computational demands are substantial. Conversely, the Mamba offers
Externí odkaz:
http://arxiv.org/abs/2405.15463
In this paper, we delve into a new task known as small object editing (SOE), which focuses on text-based image inpainting within a constrained, small-sized area. Despite the remarkable success have been achieved by current image inpainting approaches
Externí odkaz:
http://arxiv.org/abs/2405.09114
In this study, we develop consistent estimators for key parameters that govern the dynamics of tumor cell populations when subjected to pharmacological treatments. While these treatments often lead to an initial reduction in the abundance of drug-sen
Externí odkaz:
http://arxiv.org/abs/2403.13081
The low coding rate of quantum stabilizer codes results in formidable physical qubit overhead when realizing quantum error correcting in engineering. In this letter, we propose a new class of hypergraph-product code called TGRE-hypergraph-product cod
Externí odkaz:
http://arxiv.org/abs/2402.09648
Autor:
Yi, Zhengzhong, Liang, Zhipeng, Wang, Zicheng, Chen, Jiahan, Qiu, Chen, Wu, Yulin, Wang, Xuan
Quantum stabilizer codes face the problem of low coding rate. In this article, following the idea of recursively expanding Tanner graph proposed in our previous work, we try to construct new stabilizer codes with high coding rate, and propose XZ-type
Externí odkaz:
http://arxiv.org/abs/2402.07823
Code distance is an important parameter for quantum stabilizer codes (QSCs). Directly precisely computing it is an NP-complete problem. However, the upper bound of code distance can be computed by some efficient methods. In this paper, employing the
Externí odkaz:
http://arxiv.org/abs/2402.06481
A zeroth-order Hessian estimator aims to recover the Hessian matrix of an objective function at any given point, using minimal finite-difference computations. This paper studies zeroth-order Hessian estimation for low-rank Hessians, from a matrix rec
Externí odkaz:
http://arxiv.org/abs/2402.05385