Shift-tolerance Property of Optical Security System using Phase-based Virtual Image

The shift-tolerance property of the encrypted image or the Fourier decrypting key in the Fourier space is proposed based on a phase-encoded virtual image. The encrypted data is obtained by the Fourier transform of the product of a phase-encoded virtual image to camouflage the original one and a random phase image. Therefore, even if unauthorized users analyze the encrypted image, they cannot reconstruct the required image. This virtual image protects the original one from being counterfeited and from unauthorized access. We demonstrate the robustness to data loss and shift of the encrypted data or the Fourier decrypting key in the proposed decryption technique using an interferometer.     

ON OPTIMAL ENVIRONMENTAL TAXATION AND ENFORCEMENT: INFORMATION,MONITORING AND EFFICIENCY

ABSTRACT. The purpose of the paper is to contribute to the narrowing of the distance between formal theory and practical environmental policy design. We formulate a general and comprehensive theoretical model in order to take into account the different informational and technological problems which characterize the definition and implementation of environmental taxes in a second best world where there also are distortionary taxes. Having formalized these problems, we present a general model which allows us to discuss the existence of efficient and implementable environmental quality objectives and policy instruments, and to analyze many particular cases.     

非线性时间序列互信息与Lempel-Ziv复杂度的相关性研究

为探究非线性动力学系统的互信息和复杂度的相关性，用Logistic映射、Lorenz模型和心电RR间期的非线性时间序列作为实验数据，计算多分段延时互信息和多分段Lempel-Ziv复杂度以及它们之间的相关系数.结果表明这些序列的互信息和复杂度呈强负相关，对Logistic方程生成的201个序列的不同段互信息和不同段复杂度之间的相关系数绝对值都大于0.9162，最大达0.9923；对94个心电RR间期序列都大于0.8555，最大达0.9860.研究还发现互信息比复杂度能更敏感地表现出非线性动力系统的特征. 关键词： 相关系数 互信息 Lempel-Ziv 复杂度 心电RR间期     

改进的遥感图像多种信息熵阈值分割算法

给出了一种新的图像信息量的表述方法,提出了五种基于信息熵的科学分割遥感图像的改进方法。用MATLAB对这些算法进行了实验仿真,并进行了算法性能优化。得出了各种不同算法的最佳阈值和耗时,并对它们进行了比较和分析。实验数据表明,新算法较以往的算法在分割效果和速度上都有明显的改善和提高。     

双随机相位编码光学加密系统的唯密文攻击

针对双随机相位编码光学加密系统的安全性分析表明，该系统属于线性对称分组密码系统，其线性性质为安全性留下极大隐患.在唯密文攻击下，仅根据密文估计出物面波函数的“支撑”(support)，然后利用迭代相位恢复算法获得物面波函数(其振幅是明文信息)，再根据物面波函数与频域密文的关系可推导出频谱平面的解密密钥.由于估计出来的物面波函数的“支撑”相对于真实的物面波函数的“支撑”有一定的平移，使得恢复的物面波函数与真实的物面波函数之间无论在振幅上还是相位上都存在平移，导致用推导出来的解密密钥去解密其他密文时所获得的明文与原始明文之间存在明显平移.然而，可依照这一先验信息，将估计出来的物面波函数的“支撑”在物面内遍历，从而找到逼近真实解密密钥的解.利用此解密密钥去解密其他密文时获得更好的解密效果. 关键词： 光学信息安全 双随机相位编码 唯密文攻击 函数支撑     

High-temperature protonic motion and low-temperature lattice deformation in one-dimensional hydrogen-bonded molecular chain in tetramethylpyrazine–chloranilic acid (1:1)

Recent theoretical advances have identified several computational algorithms that can be implemented utilizing quantum information processing (QIP), which gives an exponential speedup over the corresponding (known) algorithms on conventional computers. QIP makes use of the counter-intuitive properties of quantum mechanics, such as entanglement and the superposition principle. Unfortunately it has so far been impossible to build a practical QIP system that outperforms conventional computers. Atomic ions confined in an array of interconnected traps represent a potentially scalable approach to QIP. All basic requirements have been experimentally demonstrated in one and two qubit experiments. The remaining task is to scale the system to many qubits while minimizing and correcting errors in the system. While this requires extremely challenging technological improvements, no fundamental roadblocks are currently foreseen.     

基于光学相关的红外目标检测

光学图像处理技术能以复振幅、并行、高速度和巨量互连来处理信号。利用光学方法的半色调网屏技术实现了红外图像的假彩色编码,提高了红外图像的可识别性;利用光学相关识别技术构造了一种基于4f系统的光学图像实时相关识别系统,以实现对红外图像的实时处理和识别。     

光信息科学与技术专业的教学改革——双语教学

分析了光信息科学与技术专业的特点,探讨了该专业双语教学改革的特点和提高双语教学效果的方法,为专业发展提出了思路。     

光信息科学与技术专业的建设

就光信息科学与技术专业建设的专业定位、课程设置、学生毕业后的去向等问题发表了个人的看法。介绍了在这方面的一些做法,提供了有关数据,可供同类专业的建设参考。     

基于写相关支持向量描述的入侵防护审计模型研究

设计了基于写相关支持向量描述的安全审计模型来实现一个新的单类分类器,对系统调用中“写性质”子集进行监视和分析,并以此训练单类分类器,使偏离正常模式的活动都被认为是潜在的入侵。该模型仅利用正常样本建立了单分类器,因此系统还具有对新的异常行为进行检测的能力。通过对主机系统执行迹国际标准数据集的优化处理,只利用少量的训练样本,实验获得了对异常样本100%的检测率,而平均虚警率接近为0。