任意信源随机和的一类随机Shannon-McMillan定理

采用构造相容分布与非负上鞅的方法研究任意信源随机和相对熵密度的强极限定理,并由此得出若干任意信源,m阶马氏信源,无记忆信源的随机Shannon-Mcmillan定理.将已有的关于离散信源的结果加以推广.     

基于双混沌置乱和扩频调制的彩色图像盲水印算法

提出了一种新的适应彩色图像的盲水印算法,先对宿主图像的绿色分量以8×8像素分块进行离散余弦变换(DCT)变换,用logistic映射生成两个混沌序列,然后用混沌序列置乱加密二值水印图像,并用两个互不相关的伪随机序列扩频调制水印,最后将调制好的水印嵌入到DCT变换域的中频子带系数上,进行分块DCT反变换得到水印化图像.提取水印时,通过比较两个伪随机序列和水印化图像的相关性大小来提取水印,不需要原始图像的参与,为盲提取水印算法.实验结果证明本文算法能有效地抵抗JPEG压缩、加噪、剪切等常见攻击,绿色分量嵌入水印比红色和蓝色分量嵌入水印能更好地抵抗JPEG压缩的攻击.     

基于自相关函数的激光散斑统计半径的测量

为了测量激光散斑的统计半径,运用统计光学理论推导了二维近场散斑光强的归一化自相关函数,并提出了通过求解散斑图像自相关拟合函数的系数来计算激光散斑统计半径的一种测量方法,利用该测量方法编制的测量软件可以方便地计算出激光散斑的统计半径.通过对尺寸已知的模拟散斑的测量,测量结果与实际尺寸相吻合,证实了该测量方法的可行性.     

基于Arnold变换的图像逆置乱算法

针对Arnold变换的周期依赖于图像的阶数这一特性,提出了一种反变换算法.该算法通过分析加密图像任一点处两坐标分量间关系,得到原图像相应点的坐标,从而实现图像的解密.该反变换也可作为图像置乱的正变换,相应的反变换就是Arnold变换.在此基础上,把二维反变换算法推广到m维的情形.实验结果表明,对于已应用Arnold变换进行预处理的置乱图像,在无须计算原图像变换周期的前提下可快速实现图像的逆置乱,该过程具有确定性,其迭代次数与预处理置乱次数相等.     

Quantum Tunneling of Massive Particles from a Garfinkle-Horowitz-Strominger Dilatonic Black Hole

Hawking radiation is viewed as a process of quantum tunneling. The massive particles‘ tunneling from Garfinkle-Horowitz-Strominger black hole is investigated. Using Jingyi Zhang‘s de Broglie wave method, we get the unthermal spectrum, and the result is consistent with the underlying unitary theory.     

Age Analysis of Status Updating System with Probabilistic Packet Preemption

The age of information (AoI) metric was proposed to measure the freshness of messages obtained at the terminal node of a status updating system. In this paper, the AoI of a discrete time status updating system with probabilistic packet preemption is investigated by analyzing the steady state of a three-dimensional discrete stochastic process. We assume that the queue used in the system is Ber/Geo/1/2*/η, which represents that the system size is 2 and the packet in the buffer can be preempted by a fresher packet with probability η. Instead of considering the system’s AoI separately, we use a three-dimensional state vector (n,m,l) to simultaneously track the real-time changes of the AoI, the age of a packet in the server, and the age of a packet waiting in the buffer. We give the explicit expression of the system’s average AoI and show that the average AoI of the system without packet preemption is obtained by letting η=0. When η is set to 1, the mean of the AoI of the system with a Ber/Geo/1/2* queue is obtained as well. Combining the results we have obtained and comparing them with corresponding average continuous AoIs, we propose a possible relationship between the average discrete AoI with the Ber/Geo/1/c queue and the average continuous AoI with the M/M/1/c queue. For each of two extreme cases where η=0 and η=1, we also determine the stationary distribution of AoI using the probability generation function (PGF) method. The relations between the average AoI and the packet preemption probability η, as well as the AoI’s distribution curves in two extreme cases, are illustrated by numerical simulations. Notice that the probabilistic packet preemption may occur, for example, in an energy harvest (EH) node of a wireless sensor network, where the packet in the buffer can be replaced only when the node collects enough energy. In particular, to exhibit the usefulness of our idea and methods and highlight the merits of considering discrete time systems, in this paper, we provide detailed discussions showing how the results about continuous AoI are derived by analyzing the corresponding discrete time system and how the discrete age analysis is generalized to the system with multiple sources. In terms of packet service process, we also propose an idea to analyze the AoI of a system when the service time distribution is arbitrary.     

结合隐藏技术的新颖语音检索算法

采用一种新颖的结合信息隐藏技术的语音检索算法,该算法将保密语音和伪语音分割成多段,利用经典的LSB算法分别隐藏到不同的音频,并存储在磁盘空间中．提取语音码流时,利用小波变换第一级细节分量系数能量的大小找到相应的载体音频,提取其中的语音码流,并建立语音库．利用特定人语音检索技术,检出相应的语音码流,合并语音码流得到真正的保密语音．研究表明：新算法的查准率和查全率可以达到很高的水平,为信息隐藏技术的发展开辟了一条新的研究道路,同样扩大了语音检索技术的应用范围。     

基于无线PKI-PMI实现安全的移动电子政务

移动电子政务作为电子政务一个新的分支,为电子政务提供了强大的扩展能力和移动能力,针对移动电子政务的安全需求,探讨了将无线PKI-PMI应用于实现安全移动电子政务的方案,在分析移动电子政务和无线PKI体系结构的基础上,讨论了该方案的关键技术。     

Application of Two Novel Acoustic Emission Parameters on Identifying the Instability of Granite

The issue of monitoring and early warning of rock instability has received increasing critical attention in the study of rock engineering. To investigate the damage evolution process of granite under triaxial compression tests, acoustic emission (AE) tests were performed simultaneously. This study firstly introduced two novel parameters, i.e., the coefficient of variation (CoV) of the information entropy and correlation dimension of the amplitude data from the AE tests, to identify the precursor of the failure of granite. Then the relationship between the changes in these parameters and the stress-time curve was compared and analyzed. The results of this study show that: (1) There is a strong correlation between the CoV of the information entropy and the failure process of granite. The granite failed when the CoV curve raised to a plateau, which could be used as an indicator of rock instability. (2) The fluctuation of the correlation dimension indicates the different stages during the loading process, i.e., the initial compaction stage, the linear elastic stage, the yield stage, and the failure stage. Each stage contains a descending and a rising process in the correlation dimension curve, and the exhibited starting point or the bottom point at the correlation dimension curve could be selected as the indicator point for the rock instability. (3) The combined analysis of the Information entropy and Correlation dimension can improve the accuracy of rock instability prediction. This study provides new insights into the prediction of rock instability, which has theoretical implications for the stability of subsurface engineering rock masses.     

Formalising the Pathways to Life Using Assembly Spaces

Assembly theory (referred to in prior works as pathway assembly) has been developed to explore the extrinsic information required to distinguish a given object from a random ensemble. In prior work, we explored the key concepts relating to deconstructing an object into its irreducible parts and then evaluating the minimum number of steps required to rebuild it, allowing for the reuse of constructed sub-objects. We have also explored the application of this approach to molecules, as molecular assembly, and how molecular assembly can be inferred experimentally and used for life detection. In this article, we formalise the core assembly concepts mathematically in terms of assembly spaces and related concepts and determine bounds on the assembly index. We explore examples of constructing assembly spaces for mathematical and physical objects and propose that objects with a high assembly index can be uniquely identified as those that must have been produced using directed biological or technological processes rather than purely random processes, thereby defining a new scale of aliveness. We think this approach is needed to help identify the new physical and chemical laws needed to understand what life is, by quantifying what life does.