Hybrid immune algorithm based on greedy algorithm and delete-cross operator for solving TSP

This paper first introduces the fundamental principles of immune algorithm (IA), greedy algorithm (GA) and delete-cross operator (DO). Based on these basic algorithms, a hybrid immune algorithm (HIA) is constructed to solve the traveling salesman problem (TSP). HIA employs GA to initialize the routes of TSP and utilizes DO to delete routes of crossover. With dynamic mutation operator (DMO) adopted to improve searching precision, this proposed algorithm can increase the likelihood of global optimum after the hybridization. Experimental results demonstrate that the HIA algorithm is able to yield a better solution than that of other algorithms, which also takes less computation time.     

Decomposing the user-preference in multiobjective optimization

Preference information (such as the reference point) of the decision maker (DM) is often used in multiobjective optimization; however, the location of the specified reference point has a detrimental effect on the performance of multiobjective evolutionary algorithms (MOEAs). Inspired by multiobjective evolutionary algorithm-based decomposition (MOEA/D), this paper proposes an MOEA to decompose the preference information of the reference point specified by the DM into a number of scalar optimization subproblems and deals with them simultaneously (called MOEA/D-PRE). This paper presents an approach of iterative weight to map the desired region of the DM, which makes the algorithm easily obtain the desired region. Experimental results have demonstrated that the proposed algorithm outperforms two popular preference-based approaches, g-dominance and r-dominance, on continuous multiobjective optimization problems (MOPs), especially on many-objective optimization problems. Moreover, this study develops distinct models to satisfy different needs of the DM, thus providing a new way to deal with preference-based multiobjective optimization. Additionally, in terms of the shortcoming of MOEA/D-PRE, an improved MOEA/D-PRE that dynamically adjusts the size of the preferred region is proposed and has better performance on some problems.     

一种基于字典学习的压缩感知视频编解码模型

无线多媒体传感器网络中针对视频信号处理的两个重要的问题是如何高效编解码和如何抵抗信道误码。结合压缩感知和字典学习理论,提出了一种应用于无线传感器网络的基于字典学习的压缩感知视频编解码模型。模型整体采用压缩感知理论以降低编码端复杂度,提高系统抗误码性。编码端应用差分编码和跳帧模式大大减少了信道传输数据量;解码端采用字典学习算法增强图像的稀疏表示能力,从而提高视频重构精度。本模型在实现高效编码的同时将计算复杂度从编码端转移到解码端,从而满足编码端资源受限的应用场合。理论分析和仿真实验表明该模型可行并且有效。     

基于iPhone手机的数字码实时识别与应用

根据苹果手机拍摄防伪标签数字实时识别的需要,针对防伪数字字号较小的因素和苹果手机因拍摄距离的原因造成的图像缩小、数字模糊、背景复杂等问题进行处理,提高识别精度。首先通过人工选取数字码区域,并进行背景数字分离,定位获取数字图像;其次采用灰度化和二值化得到黑白图像;然后通过投影对数字码图像进行分割,并对每个数字图像进行归一化、锐化和细化;基于统计学抽取数字码的特征,采用最近邻域判别函数进行数字码识别,取得很好的识别效果。     

山西省近50年风速变化及突变特征分析

利用线性拟合、M-K方法对山西省22个气象观测站1960—2010年的逐日风速资料进行了倾向、突变、逐年代变化等特征分析。研究表明,近50年来山西省平均风速存在明显的下降趋势,平均风速由20世纪60年代的2.16 m/s下降到21世纪初的1.86 m/s;不同时间段呈现不同的变化特征,1979—1989年风速出现显著下降,年均递减率达到0.046 m/s,变率远超出其他时段;对近50年山西省平均风速进行M-K检验后发现,在1982年出现明显的突变点。山西省四季平均风速均呈下降趋势,四季风速下降速率最快的为春季,冬季次之,夏季风速下降速率最慢。同样,四季风速均发生突变,突变时间点分布在1980—1985年间。除8月外,山西省各个月份风速也呈下降趋势,且均出现突变现象。     

STM32单片机多串口通信仿真测试技术研究

使用 STM32单片机进行多串口通信,采用虚拟串口软件(VSPD)结合串口调试软件进行多串口通信发送和接收功能的仿真测试研究,克服了 RealView 软件不能仿真接收通信的缺点。介绍了虚拟串口和仿真串口的绑定方法,给出了各模块的软件代码。仿真测试结果表明,采用该方法,可以在没有硬件平台的情况下,完成基于 STM32多串口收发通信的软件开发应用。     

Less conservative stability criteria for linear systems with interval time‐varying delays

The problem of the stability of a linear system with an interval time‐varying delay is investigated. A new Lyapunov–Krasovskii functional that fully uses information about the lower bound of the time‐varying delay is constructed to derive new stability criteria. It is proved that the proposed Lyapunov–Krasovskii functional can lead to less conservative results than some existing ones. Based on the proposed Lyapunov–Krasovskii functional, two stability conditions are developed using two different methods to estimate Lyapunov–Krasovskii functional's derivative. Two numerical examples are given to illustrate that the two stability conditions are complementary and yield a larger maximum upper bound of the time‐varying delay than some existing results. Copyright © 2013 John Wiley & Sons, Ltd.     

Recover Fault Services via Complex Service-to-Node Mappings in Wireless Sensor Networks

With the motivation of seamlessly extending wireless sensor networks to the external environment, service-oriented architecture comes up as a promising solution. However, as sensor nodes are failure prone, this consequently renders the whole wireless sensor network to seriously faulty. When a particular node is faulty, the service on it should be migrated into those substitute sensor nodes that are in a normal status. Currently, two kinds of approaches exist to identify the substitute sensor nodes: the most common approach is to prepare redundancy nodes, though the involved tasks such as maintaining redundancy nodes, i.e., relocating the new node, lead to an extra burden on the wireless sensor networks. More recently, other approaches without using redundancy nodes are emerging, and they merely select the substitute nodes in a sensor node’s perspective i.e., migrating the service of faulty node to it’s nearest sensor node, though usually neglecting the requirements of the application level. Even a few work consider the need of the application level, they perform at packets granularity and don’t fit well at service granularity. In this paper, we aim to remove these limitations in the wireless sensor network with the service-oriented architecture. Instead of deploying redundancy nodes, the proposed mechanism replaces the faulty sensor node with consideration of the similarity on the application level, as well as on the sensor level. On the application level, we apply the Bloom Filter for its high efficiency and low space costs. While on the sensor level, we design an objective solution via the coefficient of a variation as an evaluation for choosing the substitute on the sensor level.     

Novel ultra‐compact two‐dimensional waveguide‐based metasurface for electromagnetic coupling reduction of microstrip antenna array

A novel ultracompact two‐dimensional (2D) waveguide‐based metasurface is proposed herein and applied for the first time to reduce mutual coupling in antenna array for multiple‐input multiple‐output applications. The unit cell of the proposed 2D waveguide‐based metasurface is ultracompact (8.6 mm × 4.8 mm, equal to λ₀/14.2 × λ₀/25.5) mainly due to the symmetrical spiral lines etched on the ground. The metasurface exhibits a bandgap with two transmission zeros attributing to the negative permeability in the vicinity of magnetic resonance and the negative permittivity in the vicinity of electric resonance. Taking advantage of these two features, a microstrip antenna array is then designed, fabricated, and measured by embedding an 8 × 1 array of the well‐engineered 2D waveguide‐based metasurface elements between two closely spaced (9.2 mm, equal to λ₀/13.3) H‐plane coupled rectangular patches. There is good agreement between the simulated and measured results, indicating that the metasurface effectively reduces antenna mutual coupling by more than 11.18 dB and improves forward gain. The proposed compact structure has one of the highest reported decoupling efficiencies among similar periodic structures with comparable dimensions. © 2015 Wiley Periodicals, Inc. Int J RF and Microwave CAE 25:789–794, 2015.