Critical Analysis of Hypothesis Tests in Federal Information Processing Standard (140-2)

This work presents an analysis of the existing dependencies between the tests of the FIPS 140-2 battery. Two main analytical approaches are utilized, the first being a study of correlations through the Pearson’s correlation coefficient that detects linear dependencies, and the second one being a novel application of the mutual information measure that allows detecting possible non-linear relationships. In order to carry out this study, the FIPS 140-2 battery is reimplemented to allow the user to obtain p-values and statistics that are essential for more rigorous end-user analysis of random number generators (RNG).     

Quantum Information Entropies on Hyperbolic Single Potential Wells

In this work, we study the quantum information entropies for two different types of hyperbolic single potential wells. We first study the behaviors of the moving particle subject to two different hyperbolic potential wells through focusing on their wave functions. The shapes of these hyperbolic potentials are similar, but we notice that their momentum entropy densities change along with the width of each potential and the magnitude of position entropy density decreases when the momentum entropy magnitude increases. On the other hand, we illustrate the behaviors of their position and momentum entropy densities. Finally, we show the variation of position and momentum entropies Sx and Sp with the change of the potential well depth u and verify that their sum still satisfies the BBM inequality relation.     

Solitonic Information Transmission in General Relativity

An exact solution of the vacuum Einstein＇s field equations is presented, in which there exists a congruence of null geodesics whose shear behaves like a travelling wave of the KdV equation. On the basis of this exact solution, the feasibility of solitonic information transmission by exploiting the nonlinearity intrinsic to the Einstein field equations is discussed.     

Multi-Classifier Fusion Based on MI–SFFS for Cross-Subject Emotion Recognition

With the widespread use of emotion recognition, cross-subject emotion recognition based on EEG signals has become a hot topic in affective computing. Electroencephalography (EEG) can be used to detect the brain’s electrical activity associated with different emotions. The aim of this research is to improve the accuracy by enhancing the generalization of features. A Multi-Classifier Fusion method based on mutual information with sequential forward floating selection (MI_SFFS) is proposed. The dataset used in this paper is DEAP, which is a multi-modal open dataset containing 32 EEG channels and multiple other physiological signals. First, high-dimensional features are extracted from 15 EEG channels of DEAP after using a 10 s time window for data slicing. Second, MI and SFFS are integrated as a novel feature-selection method. Then, support vector machine (SVM), k-nearest neighbor (KNN) and random forest (RF) are employed to classify positive and negative emotions to obtain the output probabilities of classifiers as weighted features for further classification. To evaluate the model performance, leave-one-out cross-validation is adopted. Finally, cross-subject classification accuracies of 0.7089, 0.7106 and 0.7361 are achieved by the SVM, KNN and RF classifiers, respectively. The results demonstrate the feasibility of the model by splicing different classifiers’ output probabilities as a portion of the weighted features.     

Theoretical Investigating Mechanisms of Drug-Resistance Generated by Mutation-Induced Changes in Influenza Viruses

Influenza A (A/H\begin{document}$ x $\end{document}N\begin{document}$ y $\end{document}) is a significant public health concern due to its high infectiousness and mortality. Neuraminidase, which interacts with sialic acid (SIA) in host cells, has become an essential target since its highly conserved catalytic center structure, while resistance mutations have already generated. Here, a detailed investigation of the drug resistance mechanism caused by mutations was performed for subtype N9 (A/H7N9). Molecular dynamics simulation and alanine-scanning-interaction-entropy method (ASIE) were used to explore the critical differences between N9 and Zanamivir (ZMR) before and after R294K mutation. The results showed that the mutation caused the hydrogen bond between Arg294 and ZMR to break, then the hydrogen bonding network was disrupted, leading to weakened binding ability and resistance. While in wild type (A/H7N9\begin{document}$ ^{ \rm{WT}} $\end{document}), this hydrogen bond was initially stable. Meanwhile, N9 derived from A/H11N9 was obtained as an R292K mutation. Then the relative binding free energy of N9 with five inhibitors (SIA, DAN, ZMR, G28, and G39) was predicted, basically consistent with experimental values, indicating that the calculated results were reliable by ASIE. In addition, Arg292 and Tyr406 were hot spots in the A/H11N9\begin{document}$ ^{ \rm{WT}} $\end{document}-drugs. However, Lys292 was not observed as a favorable contributing residue in A/H11N9\begin{document}$ ^{ \rm{R292K}} $\end{document}, which may promote resistance. In comparison, Tyr406 remained the hotspot feature when SIA, ZMR, and G28 binding to A/H11N9\begin{document}$ ^{ \rm{R292K}} $\end{document}. Combining the two groups, we speculate that the resistance was mainly caused by the disruption of the hydrogen bonding network and the transformation of hotspots. This study could guide novel drug delivery of drug-resistant mutations in the treatment of A/H\begin{document}$ x $\end{document}N9.     

任意信源随机和的一类随机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.