移动定位技术的现状与发展趋势

基于位置服务为人们的日常生活带来了极大的方便,同时也推动了移动定位技术行业的快速发展。针对移动定位技术发展状况,分析目前主流定位技术的优劣,并对取得的突破作简单的总结归纳。     

基于全局/局部共现词对分布的汉越双语新闻事件线索分析

针对汉越双语新闻事件线索分析,提出了基于全局/局部共现词对分布的汉越双语事件线索生成方法。该方法首先将新闻话题词语分布作为全局词语表征全局事件,然后用一定时间粒度下新闻片段特有的时间、人物、地点等事件元素作为局部词语,分析新闻片段中全局词语和局部词语的共现关系,将全局/局部词语的共现规律作为监督信息,结合RCRP算法和汉越双语新闻的对齐语料,构建有监督话题生成主题模型,获得相应时间跨度下代表事件发展进程的子话题分布,通过子话题的分布反映事件发展的线索,从而构建出在线汉越双语事件线索生成模型。实验在汉越混合新闻数据集上进行,事件线索生成对比实验结果证明了提出的方法的有效性。
     

Ant colony optimization with immigrants schemes for the dynamic travelling salesman problem with traffic factors

Traditional ant colony optimization (ACO) algorithms have difficulty in addressing dynamic optimization problems (DOPs). This is because once the algorithm converges to a solution and a dynamic change occurs, it is difficult for the population to adapt to a new environment since high levels of pheromone will be generated to a single trail and force the ants to follow it even after a dynamic change. A good solution to address this problem is to increase the diversity via transferring knowledge from previous environments to the pheromone trails using immigrants schemes. In this paper, an ACO framework for dynamic environments is proposed where different immigrants schemes, including random immigrants, elitism-based immigrants, and memory-based immigrants, are integrated into ACO algorithms for solving DOPs. From this framework, three ACO algorithms, where immigrant ants are generated using the aforementioned immigrants schemes and replace existing ants in the current population, are proposed and investigated. Moreover, two novel types of dynamic travelling salesman problems (DTSPs) with traffic factors, i.e., under random and cyclic dynamic environments, are proposed for the experimental study. The experimental results based on different DTSP test cases show that each proposed algorithm performs well on different environmental cases and that the proposed algorithms outperform several other peer ACO algorithms.     

一种基于IHS和DWT变换的遥感图像融合方法

为了更好地进行不同分辨率图像的融合,提出了一种在Maflab平台上实现基于IHS变换与离散小波变换相结合的多光谱图像与高分辨率图像融合方法.实验结果分析表明,得到的融合图像与原多光谱图像相比,细节信息更为突出,整体信息更为丰富,基本达到了提高融合增强的目的.     

Circularly polarized patch antenna with simultaneously wide frequency tuning range and high gain performance

A tunable circularly polarized square patch antenna with parasitic elements is designed for a wide frequency tuning range and high gain characteristics. The proposed antenna is constructed by one main patch and four semi-elliptic parasitic units. By loading four varactor diodes and adjusting their capacitance values, the tunable feature is performed to reallocate the corresponding working frequency. Moreover, the diagonal corners of the antenna are cut and loaded with varactor diodes, which provide the appropriate perturbation between the two orthogonality modes of the antenna, so as to ensure the circular polarization characteristic in the entire operating tuning band. The experimental results demonstrate that the reflection coefficient and axial ratio are less than −13 dB and 3 dB, respectively. The proposed antenna features a relatively wide continuously tuning range of 24% within 1.9-2.3 GHz and a stable gain of over 7 dBi with a radiation efficiency of above 85%.     

A memetic ant colony optimization algorithm for the dynamic travelling salesman problem

Ant colony optimization (ACO) has been successfully applied for combinatorial optimization problems, e.g., the travelling salesman problem (TSP), under stationary environments. In this paper, we consider the dynamic TSP (DTSP), where cities are replaced by new ones during the execution of the algorithm. Under such environments, traditional ACO algorithms face a serious challenge: once they converge, they cannot adapt efficiently to environmental changes. To improve the performance of ACO on the DTSP, we investigate a hybridized ACO with local search (LS), called Memetic ACO (M-ACO) algorithm, which is based on the population-based ACO (P-ACO) framework and an adaptive inver-over operator, to solve the DTSP. Moreover, to address premature convergence, we introduce random immigrants to the population of M-ACO when identical ants are stored. The simulation experiments on a series of dynamic environments generated from a set of benchmark TSP instances show that LS is beneficial for ACO algorithms when applied on the DTSP, since it achieves better performance than other traditional ACO and P-ACO algorithms.     

An improved constraint satisfaction adaptive neural network for job-shop scheduling

This paper presents an improved constraint satisfaction adaptive neural network for job-shop scheduling problems. The neural network is constructed based on the constraint conditions of a job-shop scheduling problem. Its structure and neuron connections can change adaptively according to the real-time constraint satisfaction situations that arise during the solving process. Several heuristics are also integrated within the neural network to enhance its convergence, accelerate its convergence, and improve the quality of the solutions produced. An experimental study based on a set of benchmark job-shop scheduling problems shows that the improved constraint satisfaction adaptive neural network outperforms the original constraint satisfaction adaptive neural network in terms of computational time and the quality of schedules it produces. The neural network approach is also experimentally validated to outperform three classical heuristic algorithms that are widely used as the basis of many state-of-the-art scheduling systems. Hence, it may also be used to construct advanced job-shop scheduling systems.     

Population-Based Incremental Learning With Associative Memory for Dynamic Environments

In recent years, interest in studying evolutionary algorithms (EAs) for dynamic optimization problems (DOPs) has grown due to its importance in real-world applications. Several approaches, such as the memory and multiple population schemes, have been developed for EAs to address dynamic problems. This paper investigates the application of the memory scheme for population-based incremental learning (PBIL) algorithms, a class of EAs, for DOPs. A PBIL-specific associative memory scheme, which stores best solutions as well as corresponding environmental information in the memory, is investigated to improve its adaptability in dynamic environments. In this paper, the interactions between the memory scheme and random immigrants, multipopulation, and restart schemes for PBILs in dynamic environments are investigated. In order to better test the performance of memory schemes for PBILs and other EAs in dynamic environments, this paper also proposes a dynamic environment generator that can systematically generate dynamic environments of different difficulty with respect to memory schemes. Using this generator, a series of dynamic environments are generated and experiments are carried out to compare the performance of investigated algorithms. The experimental results show that the proposed memory scheme is efficient for PBILs in dynamic environments and also indicate that different interactions exist between the memory scheme and random immigrants, multipopulation schemes for PBILs in different dynamic environments.     

基于云隶属度支持向量机的舰船购置费时间序列预测

模糊支持向量机降低了传统支持向量机对异常点的敏感度,但其模糊隶属度函数对样本点的分类缺乏模糊性,影响舰船购置费预测的精度。因此,利用云理论能够科学表达模糊性的特点,设计了一种面向异常点模糊分类的云隶属度发生器;在支持向量机中引入这种云隶属度发生器,提出了一种基于云隶属度的支持向量机算法;构建了基于云隶属度支持向量机的舰船购置费时间序列预测模型。实验证明：该算法模糊地降低了模型对异常点的敏感度,并自适应地对支持向量约束水平进行寻优,提高了舰船购置费预测的精度。     

武器装备修理合同博弈中的信息价值研究

初步研究了武器装备修理过程中信息价值问题。结合具体实例,分析了在性态复杂的信息结构下,可能存在多种均衡,使得双方的博弈结果并不简单地依赖信息对称的程度,有利于军方合理、高效地发掘和利用信息,以提高武器装备修理的效益。