基于服务器端会话追踪的Web查询服务的研究

在探讨了Web查询服务的典型模型后,论文阐述了服务器端会话追踪机制的实现方式,设计了基于服务器端会话追踪的Web查询服务的典型解决方案。该设计方案可以较为安全地保存和维护客户的上下文信息,可靠地跟踪用户查询所处的状态,有效地实现有状态的Web查询服务。     

网络安全事件的关联分析方法的比较研究

随着当前攻击手段和技术的日益复杂化,一次入侵事件往往需要多个步骤才能完成,这些步骤都是彼此相关的。但是传统的入侵检测集中于检测底层的入侵或异常,所检测到的结果也仅仅是一次完整入侵的一部分,所以不能将不同的报警结合起来以发现入侵的逻辑步骤或者入侵背后的攻击策略。关联分析技术将不同分析器上产生的报警进行融合与关联分析,极大地减少了报警的数量,降低了入侵检测的误报率,并且适当的减少了入侵检测的漏报率。文中在对网络安全事件关联分析方法的系统结构进行分析后,着重介绍了当前比较流行的几种网络安全事件关联分析方法,最后对各种方法进行了比较研究。     

一种基于空间到达角的卫星电子侦察信号分选方法

在建立简化的卫星电子侦察空间模型的基础上，提出了一种利用空间到达角分选卫星电子侦察信号的新方法。通过仿真实验验证了这种方法的可行性。该方法可用于密集信号的预处理。     

IKE协议的安全性分析

在简略介绍IKE协议RFC2409工作机制的基础上,对协议现有的安全问题进行了分析,并针对协议阶段1中主模式与积极模式下身份保护存在的问题提出了协议修改建议,对阶段1中安全联盟建立的可靠性进行了探讨以加强协议抵御DoS攻击的能力。     

数字电视的条件接收系统

数字电视的兴起使人们能够欣赏到高质量的电视节目,伴随数字电视的成熟,条件接收系统(CAS)得到很好的发展。主要介绍数字电视条件接收系统相关技术的发展、基本功能、安全机制、工作原理及其安全性要求。     

最佳基数排序

基数排序由于其效率高而被广泛应用。通常,基数排序所用的基数是10,然而,如果求得一个基数r_(best),并且用r_(best)为基数进行基数排序使排序时间达到最小,则这将具有非常重要的意义。本文给出了求r_(best)的方法,分析了以r_(best)为基数进行基数排序的时间复杂度,提出了进一步提高效率的措施,并将以r_(best)为基数的基数排序速度与以10为基数的基数排序进行了比较。     

A digital secure image communication scheme based on the chaotic Chebyshev map

In this paper, a simple image secure communication scheme based on the chaotic Chebyshev map and chaos synchronization is proposed. The scheme relies on the excellent correlation property of chaotic sequences, which is very desirable for secure image communication. The results obtained by computer simulation indicate that the transmitted source image can be correctly and reliably recovered using the proposed scheme, even through a noisy channel. Notably, the scheme possesses relatively high security and can be easily implemented. Moreover, the quality of the recovered image is satisfactory, quantified by such common criteria as the bit‐error rate performance. Copyright © 2004 John Wiley & Sons, Ltd.     

管理信息系统建设中数据库的系统设计与管理

提出用系统的观念分类和管理数据库，挖掘数据库在管理信息系统建设中的潜在能力。     

Networks for sorting multitonic sequences

Lee and Batcher have designed networks that efficiently merge k separately provided sorted sequences of known lengths totalling n. We show that the design is still possible, and in fact easier to describe, if we do not make use of the lengths, or even the directions of monotonicity, of the individual sequences—the sequences can be provided in a single undelimited concatenation of length n. The depth of the simplest resulting network to sort sequences that are “k-tonic” and of length n is , generalizing Batcher's 1968 results for the extreme values of k (k=2 corresponding to merging, and k=n/2 corresponding to general sorting).The exposition is self-contained and can serve even as an introduction to sorting networks and Batcher's results.     

Deterministic secure quantum communication without unitary operation based on high-dimensional entanglement swapping

By analysis of the basic properties of entanglement swapping of high-dimensional Bell states,a universal and general deterministic secure quantum communication(DSQC)protocol is proposed,in which unitary operation is not required.By making use of the results of high-dimensional Bell measurement,the sender and the receiver can encode and decode the message respectively by performing the modular addition and subtraction.Two mutually complementary bases are constructed;and according to the property of mutual complement,a method for checking security of the high-dimensional quantum channel is put forward.Some common attack strategies are analyzed,and the corresponding error rates are calculated.Then the upper bound of the threshold of error rate is deduced.