高动态GPS抗干扰算法仿真研究

对于高动态条件下GPS(global positioning system)接收机的抗干扰问题,研究等距线阵接收信号模型和基于协方差矩阵扩张的基本原理,并仿真分析了2种基于协方差矩阵扩张的经典抗干扰算法：Mailloux算法和Zatman算法在高动态环境下的作用效果。经过Matlab仿真,结果表明,相比与常规方法,Mailloux方法和Zatman方法在阵元是等距线阵时,都能有效地加宽从干扰方向上形成的零陷,能够提高在高动态环境下的抗干扰效果,使接收机能够捕获卫星信号。     

A novel facial emotion recognition scheme based on graph mining

Recent years have seen an explosion in graph data from a variety of scientific, social and technological fields. From these fields, emotion recognition is an interesting research area because it finds many applications in real life such as in effective social robotics to increase the interactivity of the robot with human, driver safety during driving, pain monitoring during surgery etc. A novel facial emotion recognition based on graph mining has been proposed in this paper to make a paradigm shift in the way of representing the face region, where the face region is represented as a graph of nodes and edges and the gSpan frequent sub-graphs mining algorithm is used to find the frequent sub-structures in the graph database of each emotion. To reduce the number of generated sub-graphs, overlap ratio metric is utilized for this purpose. After encoding the final selected sub-graphs, binary classification is then applied to classify the emotion of the queried input facial image using six levels of classification. Binary cat swarm intelligence is applied within each level of classification to select proper sub-graphs that give the highest accuracy in that level. Different experiments have been conducted using Surrey Audio-Visual Expressed Emotion (SAVEE) database and the final system accuracy was 90.00%. The results show significant accuracy improvements (about 2%) by the proposed system in comparison to current published works in SAVEE database.     

数据挖掘在图像信息隐写分析中的应用

提出数据挖掘在图像信息隐写分析中的应用。首先计算原始图像和隐写图像在通用图像质量指标下的失真测度,然后利用数据挖掘技术建立一个预测模型,完成失真测度到已知隐写概率的映射,模型的输出即为预测隐写概率。实验结果表明,使用该方法得到的预测隐写概率和已知隐写概率的相关度,当使用训练样本时达到0.951以上,使用测试样本时达到0.943以上,达到了很好的预测效果。     

Sojourn times in G/M/1 fork‐join networks

We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of its m tasks are finished. The sojourn time (or response time) of a job in this G/M/1 fork‐join network is the total time it takes to complete the m tasks. Our main result is a closed‐form approximation of the sojourn‐time distribution of a job that arrives in equilibrium. This is obtained by the use of bounds, properties of D/M/1 and M/M/1 fork‐join networks, and exploratory simulations. Statistical tests show that our approximation distributions are good fits for the sojourn‐time distributions obtained from simulations. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Scheduling jobs with piecewise linear decreasing processing times

We study the problems of scheduling a set of nonpreemptive jobs on a single or multiple machines without idle times where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objectives are the minimization of makespan and minimization of total job completion time. The single machine problems are proved to be NP‐hard, and some properties of their optimal solutions are established. A pseudopolynomial time algorithm is constructed for makespan minimization. Several heuristics are derived for both total completion time and makespan minimization. Computational experiments are conducted to evaluate their efficiency. NP‐hardness proofs and polynomial time algorithms are presented for some special cases of the parallel machine problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 531–554, 2003     

Parallel machine scheduling with job assignment restrictions

In the classical multiprocessor scheduling problem independent jobs must be assigned to parallel, identical machines with the objective of minimizing the makespan. This article explores the effect of assignment restrictions on the jobs for multiprocessor scheduling problems. This means that each job can only be processed on a specific subset of the machines. Particular attention is given to the case of processing times restricted to one of two values, 1 and λ, differing by at most 2. A matching based polynomial time ε‐approximation algorithm is developed that has a performance ratio tending to . This algorithm is shown to have the best possible performance, tending to 3/2, for processing times 1 and 2. For the special case of nested processing sets, i.e., when the sets of machines upon which individual jobs may be assigned are non‐overlapping, the behavior of list scheduling algorithms is explored. Finally, for assignment restrictions determined by just one characteristic of the machines, such as disc storage or memory constraint in the case of high performance computing, we contribute an algorithm that provides a 3/2 worst case bound and runs in time linear in the number of jobs. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

浅析军用认知无线电的优势

认知无线电作为一种智能无线电技术,可赋予军用无线通信系统以电磁环境感知能力,有效解决战场频谱利用率和管理的问题,对军事通信产生了深远的影响.介绍了军用认知无线电的现状,分析了军用认知无线电的特性,重点讨论了军用认知无线电在军事通信中的优势.     

基于DW+OLAP+DM的器材保障决策支持系统设计

针对我军当前器材保障状况,阐述了基于数据仓库、联机分析处理和数据挖掘技术的决策支持系统的设计方案和开发理论。通过分析器材保障决策支持的特点,确定了器材保障决策支持系统的需求。具体论述了器材保障决策支持系统的设计步骤,重点讨论了数据仓库多维数据结构的设计。     

基于机器翻译的原型句蜕及其包装研究

首先简要介绍了HNC理论及其机器翻译观,结合机器翻译的难点与原型句蜕存在的普遍性,说明了解决原型句蜕变换的意义:接着对原型句蜕构成现象进行了描述,从汉英语义块构成对比分析中导出了汉英变换规则;从现有的机器翻译系统所暴露的问题中,说明原型句蜕变换对提高机器翻译质量的必要性和可行性;最后是对本文的结论和说明。     

The Illusion of Afghanistan’s Electoral Representative Democracy: The Cases of Afghan Presidential and National Legislative Elections

This article is the latest in a series of published articles systematically examining Afghan Presidential and legislative elections. Structural problems including fraud, ethno-linguistic block voting, and the Single Non-Transferable Vote have had significant impacts on the development of Afghan democratic elections. The challenge now facing the current Afghan government and future elections is the daunting task of uniting the Afghan people while not repeating the electoral mistakes of the past. The tricky balancing act of fostering an overarching national identity without being perceived as privileging particular identities requires strong leadership and a willingness to challenge traditional ethnic, linguistic, and religious norms when need be. Karzai and Ghani Administrations have seriously failed relative to this dynamic.