Compressed Storage for C-Temporal Relation Data Model Based on Improved Genetic Algorithm

针对时态数据库中存在数据冗余、数据量快速增长等问题,结合现有压缩技术,提出基于改进遗传算法的C-TrdM压缩存储技术。将各个时刻的时态关系数据分解为最小粒度的数据并进行编码,采用改进的遗传算法来计算待压缩数据中的最优存储数据以提高压缩比。算法的快速收敛性使去除数据冗余的速度得到提高。There is data redundancy temporal database and the quantities of temporal database are increasing fleetly,aiming at these problems,this paper puts forward compressed storage tactics based on improved genetic algorithm for temporal data which combine compress technology in existence in order to settle data redundancy in the course of temporal data storage.Temporal relation data at any moment is decomposed into least granularity data and be coded meanwhile.Optimized storage data are figured out by using improved genetic algorithm,and the ratio of compression is enhanced.Celerity astringency of the algorithm can heighten speed of removing data redundancy largely.广西教育厅科研基金资助项目(200707LX196);广西工学院自然科学基金资助项目(院科自0704102

Design of Carrier Synchronization Based on Costas Loop

介绍了平方变换法相干解调原理,从工程角度完善了载波提取的电路结构,消除了频移载波的误锁问题.提出用科斯塔斯环法来实现从2dPSk信号中提取相干载波,解决了提取的载波信号存在180度的相位含糊问题,为通信系统提高抗噪性能提供了条件.当载波频率很高时,工作频率较低的科斯塔斯环易于实现.并用SIMulInk设计出科斯塔斯环法提取载波的仿真电路图和进行相应的仿真实验.Theory of coherent demodulation based on method of square counterchange is introduced in this article.The structure of circuit for carrier recovery is perfected in engineering,and the problem of error-lock for frequency-shift carrier is eliminated.Costas Loop is put forward to achieve coherent carrier from 2DPSK signal in this article.The 180° phase's inexplicit problem which exist in carrier recovery is resolved.It improves the resisting noise property of communication system.When carrier frequency is higher,Costas loop is easy to implement carrier synchronization.Because the operating frequency of Costas loop is lower than square PLL.We scheme out emulational circuit diagram for carrier distilling with Costas loop by using simulink and process corresponding emulational experiment.国家自然科学基金项目(60873179);广西教育厅科研项目(200707LX196

High efficient and secure group key management scheme based on optimized GDH

针对gdH(grOuP dIffIE-HEllMAn)方案中节点可能成为系统的瓶颈以及计算复杂度、通信代价和存储复杂度远高于某些集中式方案等缺陷,提出并实现了一种基于优化gdH协商的高效安全的动态群组密钥管理方案,并对其安全性进行了证明。通过对计算量和通信量进行分析比较表明,优化gdH协商协议具有很大的优势,并且能够快速产生或更新组密钥,具有很强的实用性。There are some defects in GDH(group diffie-hellman) scheme,such as the node that may become the bottleneck of the system,and the computational complexity,cost of communications and storage complexity that are much higher than some centralized group key management program.An efficient and secure dynamic group key management scheme based on optimized GDH is proposed and implemented and its security is proven.The optimized GDH consensus agreement has great advantage than GDH by comparing and analysing the volume of calculating and traffic.At the same time,the optimized GDH consensus agreement can quickly produce and update group key,and it owns highly practicability.国家自然科学基金资助项目(60873179);广西教育厅科研资助项目(200707LX196

A quickly-speed running watermarking algorithm based on quantum evolutionary algorithm

针对传统基于人类视觉系统特性的空间域与变换域相结合的水印算法中嵌入信息量小、嵌入位置定位及检测准确率低和算法运行速度慢等缺陷,提出并实现一种基于量子进化算法(QEA)的快速水印新算法。仿真实验结果表明,新算法不仅生成水印图像的速度快,而且对各种攻击具有良好的敏感性和鲁棒性。新算法在应用中有较大的灵活性,并且具有可嵌入信息容量大、运算速度快和可操作性强等特点。There are limitations such as smaller embedded information capacity,lower accurate rate for positioning embedded location and detection and slower running speed in traditional watermarking algorithm which combines spatial domain and transform domain based on characteristics of human visual system.A quickly-speed running watermarking algorithm based on quantum evolutionary algorithm is proposed and implemented.The simulation results show that the proposed algorithm owns not only faster watermark image generation,but also have good sensitivity and robustness for all kinds of attacks.The proposed algorithm is more flexible in application,and it can embed more information and improve the computing speed.The method can be easily operated.国家自然科学基金资助项目(60873179);广西教育厅科研资助项目(200707LX196

JUNO Sensitivity on Proton Decay p→νˉK+p\to \bar\nu K^+ Searches

The Jiangmen Underground Neutrino Observatory (JUNO) is a large liquid scintillator detector designed to explore many topics in fundamental physics. In this paper, the potential on searching for proton decay in $p\to \bar\nu K^+$ mode with JUNO is investigated.The kaon and its decay particles feature a clear three-fold coincidence signature that results in a high efficiency for identification. Moreover, the excellent energy resolution of JUNO permits to suppress the sizable background caused by other delayed signals. Based on these advantages, the detection efficiency for the proton decay via $p\to \bar\nu K^+$ is 36.9% with a background level of 0.2 events after 10 years of data taking. The estimated sensitivity based on 200 kton-years exposure is $9.6 \times 10^{33}$ years, competitive with the current best limits on the proton lifetime in this channel

JUNO sensitivity on proton decay p → ν K + searches*

The Jiangmen Underground Neutrino Observatory (JUNO) is a large liquid scintillator detector designed to explore many topics in fundamental physics. In this study, the potential of searching for proton decay in the $p\to \bar{\nu} K^+$ mode with JUNO is investigated. The kaon and its decay particles feature a clear three-fold coincidence signature that results in a high efficiency for identification. Moreover, the excellent energy resolution of JUNO permits suppression of the sizable background caused by other delayed signals. Based on these advantages, the detection efficiency for the proton decay via $p\to \bar{\nu} K^+$ is 36.9% ± 4.9% with a background level of $0.2\pm 0.05({\rm syst})\pm$$0.2({\rm stat})$ events after 10 years of data collection. The estimated sensitivity based on 200 kton-years of exposure is $9.6 \times 10^{33}$ years, which is competitive with the current best limits on the proton lifetime in this channel and complements the use of different detection technologies