多载波码分多址在低密度二分图上的建模与分析

多载波码分多址是移动通信重要的多址技术之一,传统方法将扩频序列的构造和多用户检测单独考虑,未能做到发射机和接收机的一体化设计。受到低密度奇偶校验码的启发,基于图论建立多载波码分多址收发机模型,采用二分图定义码片和数据符号间的扩频关系。在此基础上,利用适合低密度二分图的消息传递算法完成多用户迭代检测,推导并分析洪水消息传递和串行消息传递两种检测机制。仿真结果表明,当传统的多载波码分多址系统陷入严重过载而不能正常通信的情况下,基于低密度二分图的多载波码分多址系统依然能够达到理想的传输性能,为下一代移动通信系统的设计提供了有益的参考。     

基于隐马尔可夫模型的IDS程序行为异常检测

提出一种新的基于隐马尔可夫模型的程序行为异常检测方法,此方法利用系统调用序列,并基于隐马尔可夫模型来描述程序行为,根据程序行为模式的出现频率对其进行分类,并将行为模式类型同隐马尔可夫模型的状态联系在一起。由于各状态对应的观测值集合互不相交,模型训练中采用了运算量较小的序列匹配方法,与传统的Baum Welch算法相比,训练时间有较大幅度的降低。考虑到模型中状态的特殊含义以及程序行为的特点,将加窗平滑后的状态序列出现概率作为判决依据。实验表明,此方法具有很高的检测准确性,其检测效率也优于同类方法。     

天线阵载波相位双差的欺骗干扰检测技术

针对采用单一发射天线的导航信号欺骗干扰,研究了基于天线阵载波相位双差的欺骗干扰检测技术,采用代数方法证明了三元非线阵是进行导航信号到达角无模糊解算的最少阵元数和阵型要求,并以相应阵型为基础,提出了基于天线阵载波相位双差的欺骗干扰检测量构造方法,给出了检测性能的分析方法,定义了用于限制检测性能下降的最小检测门限。采用蒙特卡洛方法对所提检测方法的检测性能进行了仿真,结果验证了理论分析的正确性。     

计算机网络攻击效果评估技术研究

计算机网络攻击效果评估技术是信息系统安全评估中一个重要而具有挑战性的课题。目前 ,相关的理论尚不成熟 ,有关的研究报道较少。简要总结了当前已经存在的主要信息安全的评估方法 ,在此基础上 ,从便于实际度量和计算的角度出发 ,提出了基于网络信息熵的评估技术、基于系统安全层次分析的安全评估框架和基于指标分析的网络攻击效果综合评估技术等三种评估模型 ,并分析了各自在使用中应注意的问题     

关联维数在梁式结构损伤检测中的应用

为探索有效实用的结构损伤检测方法,运用分形理论直接对结构振动信号进行关联维数分析,通过度量系统输出的奇异性来识别结构的局部损伤,提出了基于振动响应关联维数的结构损伤检测方法.简支梁损伤算例结果表明,该方法能够准确地检测出梁式结构单个和多个不同程度的损伤位置,同时关联维数指标变化值会随着损伤程度的增加而增大.与曲率模态指...     

Aircraft routing under the risk of detection

The deterministic problem for finding an aircraft's optimal risk trajectory in a threat environment has been formulated. The threat is associated with the risk of aircraft detection by radars or similar sensors. The model considers an aircraft's trajectory in three‐dimensional (3‐D) space and represents the aircraft by a symmetrical ellipsoid with the axis of symmetry directing the trajectory. Analytical and discrete optimization approaches for routing an aircraft with variable radar cross‐section (RCS) subject to a constraint on the trajectory length have been developed. Through techniques of Calculus of Variations, the analytical approach reduces the original risk optimization problem to a vectorial nonlinear differential equation. In the case of a single detecting installation, a solution to this equation is expressed by a quadrature. A network optimization approach reduces the original problem to the Constrained Shortest Path Problem (CSPP) for a 3‐D network. The CSPP has been solved for various ellipsoid shapes and different length constraints in cases with several radars. The impact of ellipsoid shape on the geometry of an optimal trajectory as well as the impact of variable RCS on the performance of a network optimization algorithm have been analyzed and illustrated by several numerical examples. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

基于人眼定位算法的驾驶员疲劳检测

研究了一种基于人眼定位的驾驶员疲劳检测方法。采用一种结合眼睛灰度及形状信息的人眼定位方法,进行眼睛准确定位,然后用处于睁开状态的眼睛模板与待测图像中的眼睛模板相匹配,对一定时间间隔内采集的图像进行人眼状态的开闭判定,由此判断驾驶员是否疲劳。实验表明,该方法可快速有效地进行驾驶员疲劳检测。     

基于正交试验法的冗余捷联惯组故障诊断实验方法研究

冗余捷联惯组是运载火箭控制系统的重要设备,需要对其进行故障检测和隔离以保证系统正常工作,所应用的故障检测算法需要进行有效性评估。由于惯组器件配置和故障形式的多样性,所有故障情形进行逐一测试不可能的,因此提出利用正交试验法安排实验,对广义似然比故障检测算法进行性能检测。试验结果表明应用正交试验实现了故障情形的良好覆盖性,有效减少了试验次数,并且从测试数据中验证了故障检测算法的有效性。     

Optimal patrol to uncover threats in time when detection is imperfect

Consider a patrol problem, where a patroller traverses a graph through edges to detect potential attacks at nodes. An attack takes a random amount of time to complete. The patroller takes one time unit to move to and inspect an adjacent node, and will detect an ongoing attack with some probability. If an attack completes before it is detected, a cost is incurred. The attack time distribution, the cost due to a successful attack, and the detection probability all depend on the attack node. The patroller seeks a patrol policy that minimizes the expected cost incurred when, and if, an attack eventually happens. We consider two cases. A random attacker chooses where to attack according to predetermined probabilities, while a strategic attacker chooses where to attack to incur the maximal expected cost. In each case, computing the optimal solution, although possible, quickly becomes intractable for problems of practical sizes. Our main contribution is to develop efficient index policies—based on Lagrangian relaxation methodology, and also on approximate dynamic programming—which typically achieve within 1% of optimality with computation time orders of magnitude less than what is required to compute the optimal policy for problems of practical sizes. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 557–576, 2014     

一种基于Cache的AES计时模板攻击方法

采用面向字节、分而治之的攻击思想,将AES主密钥按字节划分为若干子密钥块,为每个子密钥块的所有候选值搭建Cache计时信息模板,并采集未知密钥AES算法的Cache计时信息,使Pearson相关性算法与模板匹配,成功地恢复AES-128位密钥。实验结果表明：AES查找表和Cache结构缺陷决定了AES易遭受Cache计时模板攻击,而模板分析理论在时序驱动攻击分析中是可行的。