基于规则模板的正则表达式分组算法

采用规则分组的方法解决确定型有限自动机(Deterministic Finite Automata,DFA)状态爆炸问题,随着分组数目的增加,匹配效率大大降低.本文提出正则表达式的输入驱动特性理论,并基于此提出了基于规则模板的分组算法——模板有限自动机.模板有限自动机算法基于规则模板对规则集进行分组,各分组分别构建匹配引擎.理论分析和实验表明,与典型的DFA改进算法相比,预处理时间和存储空间有2～3个数量级别的缩减,且匹配效率没有明显降低.     

Deriving a kinetic uncertainty relation for piecewise deterministic processes: from classical to quantum

From the perspective of Markovian piecewise deterministic processes (PDPs), we investigate the derivation of a kinetic uncertainty relation (KUR), which was originally proposed in Markovian open quantum systems. First, stationary distributions of classical PDPs are explicitly constructed. Then, a tilting method is used to derive a rate functional of large deviations. Finally, based on an improved approximation scheme, we recover the KUR. These classical results are directly extended to the open quantum systems. We use a driven two-level quantum system to exemplify the quantum results.     

Managing inventory and service levels in a safety stock‐based inventory routing system with stochastic retailer demands

The inherent uncertainty in supply chain systems compels managers to be more perceptive to the stochastic nature of the systems' major parameters, such as suppliers' reliability, retailers' demands, and facility production capacities. To deal with the uncertainty inherent to the parameters of the stochastic supply chain optimization problems and to determine optimal or close to optimal policies, many approximate deterministic equivalent models are proposed. In this paper, we consider the stochastic periodic inventory routing problem modeled as chance‐constrained optimization problem. We then propose a safety stock‐based deterministic optimization model to determine near‐optimal solutions to this chance‐constrained optimization problem. We investigate the issue of adequately setting safety stocks at the supplier's warehouse and at the retailers so that the promised service levels to the retailers are guaranteed, while distribution costs as well as inventory throughout the system are optimized. The proposed deterministic models strive to optimize the safety stock levels in line with the planned service levels at the retailers. Different safety stock models are investigated and analyzed, and the results are illustrated on two comprehensively worked out cases. We conclude this analysis with some insights on how safety stocks are to be determined, allocated, and coordinated in stochastic periodic inventory routing problem. Copyright © 2017 John Wiley & Sons, Ltd.     

Deterministic assisted clone of an unknown four-particle entangled cluster-type state

Two deterministic schemes are proposed to realize the assisted clone of an unknown four-particle entangled cluster- type state. The schemes include two stages. The first stage requires teleportation via maximal entanglement as the quantum channel. In the second stages of the protocols, two novel sets of mutually orthogonal basis vectors are constructed, With the assistance of the preparer through a four-particle or two-step two-particle projective measurement under these bases, the perfect copy of an original state can be produced. Comparing with the previous protocols which produce the unknown state and its orthogonal complement state at the site of the sender, the proposed schemes generate the unknown state deterministically.     

Optimal filtering of piecewise deterministic processes for source detection and separation in electric load monitoring

We wish to compute in discrete real time the best estimate for the composition of the total active power recorded at a customer's house, without any intrusion. A new solution for online characterization of the electric load is proposed. The solution is based on issues from the applied stochastic analysis of Markov processes. We specifically suggest that optimal filtering of a hybrid stochastic differential system covers entirely the detection and separation subproblems underlying the main problem.     

循环-循环块相位掩膜矩阵压缩双透镜成像

压缩成像(CI)是压缩传感(CS)理论的一个重要应用领域。本文在循环矩阵和分块矩阵的基础上提出一种新的循环-循环块相位掩膜矩阵可压缩双透镜成像方法,实现对图像的随机获取。模拟实验结果表明,新的相位掩膜矩阵CI可以在显著减少测量的同时,有效捕获图像信息重建原始图像;对于64pixel×64pixel的标准Lena和Cameraman图像,在只有原像素数58.6%的无噪声测量情况下,获得的重建信噪比(SNR)分别超过26dB和30dB。新相位掩膜矩阵的研究为确定性测量在CI领域的应用提供了更多的支撑,在拥有原循环和循环确定性测量优点的同时还拥有自身的块结构特点,可以进一步减少物理实现成本,并为新的照相机设计提供若干理论、计算和技术支撑。     

确定性小世界特性记忆网络的建模与算法

为了形象直观的了解脑功能记忆小世界网络的形成及演化机制,采用复杂网络确定性建模的方法对记忆过程进行模拟,通过记忆节点及连边的抽取,建立符合记忆解剖特征和逻辑意义的连边机制.以集合为数据结构的建模算法仿真了小世界特性的记忆网络,同时数据元素的检索算法符合记忆特征.通过理论分析和数据仿真表明对脑功能记忆网络进行确定性建模是可行的.     

基于GHZ态的三方量子确定性密钥分配协议

基于连续变量GHZ态的纠缠特性,提出一种三方量子确定性密钥分配协议,其中密钥由GHZ态的振幅产生,而相位可以用来验证信道的安全性.现有的量子确定性密钥分配协议一次只能向一个接收方传送密钥,现实生活中经常要向多个接收方发送确定性密钥.信息论分析结果表明,当信道传输效率大于0.5时,该协议可以同时向两个接收方安全传送确定性密钥,制备多重纠缠态后,该协议还能够扩展成多方量子确定性密钥分配协议,这极大提高了密钥的整体传送效率,而且连续变量量子GHZ态信道容量较高,因此该协议具有重要的现实意义.     

Normal projection: deterministic and probabilistic algorithms

We consider the following problem： for a collection of points in an n-dimensional space, find a linear projection mapping the points to the ground field such that different points are mapped to different values. Such projections are called normal and are useful for making algebraic varieties into normal positions. The points may be given explicitly or implicitly and the coefficients of the projection come from a subset S of the ground field. If the subset S is small, this problem may be hard. This paper deals with relatively large S, a deterministic algorithm is given when the points are given explicitly, and a lower bound for success probability is given for a probabilistic algorithm from in the literature.