T1 THEOREM FOR BESOV SPACES ON NONHOMOGENEOUS SPACES

Suppose μ is a Radon measure on Rd, which may be non doubling. The only condition assumed on μ is a growth condition, namely, there is a constant Co ＞ 0 such that for all x ∈ supp(μ) and r ＞ 0,μ(B(x,r)) ≤ Corn, where 0 ＜ n ≤ d. We prove T1 theorem for non doubling measures with weak kernel conditions. Our approach yields new results for kernels satisfying weakened regularity conditions, while recovering previously known Tolsa's results. We also prove T1 theorem for Besov spaces on nonhomogeneous spaces with weak kernel conditions given in [7].     

基于改进QPSO算法的阵列天线方向图综合

 针对传统智能方法在方向图综合中易于早熟和局部寻优能力不足等缺陷,在基于量子位概率幅编码的量子粒子群优化算法(QPSO)的基础上,设计一种进行收敛停滞检测,并对粒子选择性变异的新量子粒子群算法,然后将其应用于阵列天线方向图综合.仿真结果表明,在多零点和低旁瓣约束情况下新算法均可以取得良好的优化效果,而且该算法相对于近邻粒子群算法(NPSO)和免疫克隆选择算法(ICSA)来说,在方向图综合中精度更高,速度更快,具有很好的推广能力.     

Computing Jacobi Symbols modulo Sparse Integers and Polynomials and Some Applications

We describe a polynomial time algorithm to compute Jacobi symbols of exponentially large integers of special form, including so-called sparse integers which are exponentially large integers with only polynomially many nonzero binary digits. In a number of papers sequences of Jacobi symbols have been proposed as generators of cryptographically secure pseudorandom bits. Our algorithm allows us to use much larger moduli in such constructions. We also use our algorithm to design a probabilistic polynomial time test which decides if a given integer of the aforementioned type is a perfect square (assuming the Extended Riemann Hypothesis). We also obtain analogues of these results for polynomials over finite fields. Moreover, in this case the perfect square testing algorithm is unconditional. These results can be compared with many known NP-hardness results for some natural problems on sparse integers and polynomials.     

一种面向HEVC的并行码率控制算法

视频通信时通常带宽有限,为了能在规定的目标码率下获得尽可能高质量的解码图像,需要在视频编码时进行码率控制.目前针对HEVC的并行编码以及对应码率控制已成为研究热点,现有并行结构下的平均比特率控制算法受到帧间依赖性的约束,待编码帧无法及时获得与其并行编码帧的实际比特数,因此本文算法通过预测并行帧的实际比特数来进行码率控制,并在此基础提出了自适应调整帧层量化参数补偿值.仿真结果表明,相比已有算法,前者减少码率误差约为3.38％,后者可提高PSNR约为0.204 dB同时减少约0.3％的码率误差.     

A rigorous proof of MIMO channel capacity’s increase with antenna number

It is well known that adding more antennas at the transmitter or at the receiver may offer larger channel capacity in the multiple-input multiple-output（MIMO） communication systems. In this letter, a simple proof is presented for the fact that the channel capacity increases with an increase in the number of receiving antennas. The proof is based on the famous capacity formula of Foschini and Gans with matrix theory.     

基于边缘计算的支持多密钥的加密图像检索

针对现有加密图像检索方案未考虑不同密钥加密图像集的情况,基于局部敏感哈希、安全近邻及代理重加密技术提出了基于边缘计算的支持多密钥的加密图像检索系统(包含基础方案和改进方案)。所提方案不但提高了图像查询效率、精度,而且降低了查询用户的额外计算开销。安全性分析表明,所提基础方案仅可抵抗已知密文攻击,而所提改进方案可抵抗已知背景攻击。基于实际数据集的实验性能测试表明,所提方案在实际应用场景中是可行的。     

Implementation of Fault-Tolerant Encoding Circuit Based on Stabilizer Implementation and “Flag” Bits in Steane Code

Quantum error correction (QEC) is an effective way to overcome quantum noise and de-coherence, meanwhile the fault tolerance of the encoding circuit, syndrome measurement circuit, and logical gate realization circuit must be ensured so as to achieve reliable quantum computing. Steane code is one of the most famous codes, proposed in 1996, however, the classical encoding circuit based on stabilizer implementation is not fault-tolerant. In this paper, we propose a method to design a fault-tolerant encoding circuit for Calderbank-Shor-Steane (CSS) code based on stabilizer implementation and “flag” bits. We use the Steane code as an example to depict in detail the fault-tolerant encoding circuit design process including the logical operation implementation, the stabilizer implementation, and the “flag” qubits design. The simulation results show that assuming only one quantum gate will be wrong with a certain probability p, the classical encoding circuit will have logic errors proportional to p; our proposed circuit is fault-tolerant as with the help of the “flag” bits, all types of errors in the encoding process can be accurately and uniquely determined, the errors can be fixed. If all the gates will be wrong with a certain probability p, which is the actual situation, the proposed encoding circuit will also be wrong with a certain probability, but its error rate has been reduced greatly from p to p2 compared with the original circuit. This encoding circuit design process can be extended to other CSS codes to improve the correctness of the encoding circuit.     

双量子比特系统耦合度J大小的测量

提出了一种可以精确测量有耦合的双量子比特系统的耦合项J的大小的方法.通过绝热近似计算得到了系统的哈密顿量的四个能级及其相对应的绝热本征态.利用求解得到的本征态计算分析了两低能级本征态的极化矢量,得到在对称系统中,耦合项J的大小等于使两低能级态的极化矢量长度发生突变时的外加磁场的z分量的值.此外,还利用两个不同的纠缠定义计算分析了系统的纠缠程度.在对称系统中,各个本征态的纠缠度和冯·诺伊曼熵基本相一致.     

Cryptanalysis and improvement of the YAK protocol with formal security proof and security verification via Scyther

Hao proposed the YAK as a robust key agreement based on public‐key authentication, and the author claimed that the YAK protocol withstands all known attacks and therefore is secure against an extremely strong adversary. However, Toorani showed the security flaws in the YAK protocol. This paper shows that the YAK protocol cannot withstand the known key security attack, and its consequences lead us to introduce a new key compromise impersonation attack, where an adversary is allowed to reveal both the shared static secret key between two‐party participation and the ephemeral private key of the initiator party in order to mount this attack. In addition, we present a new security model that covers these attacks against an extremely strong adversary. Moreover, we propose an improved YAK protocol to remedy these attacks and the previous attacks mentioned by Toorani on the YAK protocol, and the proposed protocol uses a verification mechanism in its block design that provides entity authentication and key confirmation. Meanwhile, we show that the proposed protocol is secure in the proposed formal security model under the gap Diffie‐Hellman assumption and the random oracle assumption. Moreover, we verify the security of the proposed protocol and YAK protocol by using an automatic verification method such as the Scyther tool, and the verification result shows that the security claims of the proposed protocol are proven, in contrast to those of the YAK protocol, which are not proven. The security and performance comparisons show that the improved YAK protocol outperforms previous related protocols.