Reputation-based collaborative spectrum sensing scheme in cognitive radio networks

Collaborative spectrum sensing is proposed to improve the detection performance in cognitive radio (CR) networks. However, most of the current collaborative sensing schemes are vulnerable to the interference of the malicious secondary users (SUs). In this paper we propose a reputation-based collaborative spectrum sensing scheme to improve the security of cooperative sensing by mitigating the impacts of misbehaviors. The fusion center calculates the reputation rating of each SU according to their history reports to weight their sensing results in the proposed scheme. We analyze and evaluate the performance of the proposed scheme and its advantages over previous schemes in expansibility and integrity. Simulation results show that the proposed scheme can minimize the harmful influence from malicious SUs.     

基于MPC算法的电力系统负荷频率控制

针对在大规模电力系统互联情况下如何准确、快速控制系统负荷频率的问题,本文结合模型预测控制算法（MPC）,提出了一种多区域电力系统负荷频率控制方法.该方法实现了超前预测、多约束条件滚动优化和反馈校正,克服了传统PI调节方法对系统参数的敏感性,提高了负荷频率控制系统的稳定性和鲁棒性.文中对三区域电力系统进行建模,并在每个系统中设置了MPC控制器和PI控制器.仿真表明,在多区域系统、多约束条件下MPC算法在频率控制的稳定性和快速性方面远优于PI算法;当系统参数偏移10%时,MPC算法仍能保证控制性能.     

基于改进射线跟踪法的隧道环境无线信道仿真

隧道环境与陆地上移动通信有显著不同,需要对其无线信道特性进行研究.本文提出了一种改进的射线跟踪法,能够对隧道环境无线信道特性高效地仿真,降低了射线跟踪的计算复杂度,同时采用一种新的坐标系描述弯道的几何形状,便于对弯道部分进行射线跟踪.本文将路径损耗的仿真结果与北京地铁14号线的实测结果进行对比,对比表明：改进的射线跟踪法能够有效地预测路径损耗;直道中K因子在-8~25 d B范围内变化,且随着距离增大有减小的趋势.     

基于Marc和遗传算法的焊接工艺参数优化

焊接变形的大小主要受焊接速度、焊接电流、电压、送丝速度、焊接顺序等工艺参数的影响.根据焊接热加工特点和实际需要,针对设计变量数目繁多、类型多样的焊接工艺,采用遗传算法与有限元分析相结合的方式,对重点参数进行了优化.以二维平板对接焊的模型为例,以工件最小焊接变形量为优化目标,经过遗传算法进化后,结合有限元方法进行每组参数组合的焊接过程热力耦合分析,找出焊接能量和焊接速度的最优组合,为焊接工艺的优化和制定提供科学的评价和预测.     

Priority based data reporting algorithm in wireless sensor networks

A cluster-based organization with two phases to separate priority calculation and network activity operations is developed. In the election-state phase, clusters are organized by those nodes with sufficient residual energy level (REL) that are distributed as evenly as possible in the network. For each network round, each node decides its role (such as, cluster header (CH) or a normal node) and its priority level for activity operation. The priority level also affects the active/sleep scheduling in the node. In the steady-state phase, the positive priority levels of active nodes determine their activity order to avoid transmission collision, and to reduce redundant data transmission and sensing coverage. Since the data reporting to the sink is usually performed by a CH delivery chain, subsidiary CHs are selected to assist with data delivery and to share the loading of CHs. The formulae for computing priority levels are analyzed and verified by the examples with valid parameters. The experimental results show that the two phases efficiently consume node energy and achieve energy savings.     

Distribution system optimization planning based on plant growth simulation algorithm

An approach for the integrated optimization of the construction/expansion capacity of high-voltage/medium-voltage (HV/MV) substations and the configuration of MV radial distribution network was presented using plant growth simulation algorithm (PGSA). In the optimization process, fixed costs correspondent to the investment in lines and substations and the variable costs associated to the operation of the system were considered under the constraints of branch capacity, substation capacity and bus voltage. The optimization variables considerably reduce the dimension of variables and speed up the process of optimizing. The effectiveness of the proposed approach was tested by a distribution system planning.     

Cyclostationary property based spectrum sensing algorithms for primary detection in cognitive radio systems

To implement the primary signal without interference in cognitive radio systems, cognitive radios can detect the presence of the primary user in low SNR. Currently, energy detector is the most common way of spectrum sensing because of its low computational complexity. However, performance of the method will be possibly degraded due to the uncertainty noise. This paper illustrates the benefits of one-order and two-order cyclostationary properties of primary user’s signals in time domain. These feature detection techniques in time domain possess the advantages of simple structure and low computational complexity comparing with spectral feature detection methods. Furthermore, performance of the one-order and two-order feature detection is studied and the analytical results are given. Our analysis and numerical results show that the sensing performance of the one-order feature detection is improved significantly comparing with conventional energy detector since it is robust to noise. Meanwhile, numerical results show that the two-order feature detection technique is better than the one-order feature detection. However, this benefit comes at the cost of hardware burdens and power consumption due to the additional multiplying algorithm.     

基于模拟退火算法的物流配送路径优化问题分析

模拟退火算法是解决NP完全组合优化问题的有效近似算法,将该算法应用于路径优化问题中,利用该算法对类似货郎担问题的路径问题进行求解。针对城市道路行走不同的目标条件（路径最短、时问最短）进行优化,选择最佳行走路径,并用该算法优化得到的计算结果,结果表明该算法在解类似货郎担交通路径方面问题时具有较高的精确性。因而,该算法在解决城市道路交通问题方面具有一定的实用价值。     

基于粒子群算法的投影寻踪分类模型研究

投影寻踪分类模型将高维分析问题的数据投影到最佳投影方向上,将其转化为一维问题进行分析研究,其实质是一种降维处理技术,以达到在低维空间分析高维非线性数据的目的．寻找最佳投影方向是一个优化搜索过程,PSO算法可以有效地应用于投影寻踪分类模型中最佳投影方向的搜索．用最佳投影方向计算样本数据的最佳投影值,根据K-均值聚类算法对投影值进行聚类,获取聚类结果．     

基于蚁群算法的冷链物流路径优化研究

在实际生活中,如何选择最优的物流配送路线是物流车辆调度系统中的重要问题之一.针对物流配送路径优化问题,依据冷链物流配送基础理论,考虑成本、货物损失及制冷时长等因素,构建基于多配送中心的最小配送成本模型,建立由运输成本、制冷成本、损坏成本及绿色低碳成本组成的复合目标模型.利用蚁群算法求解,以某类冷链物流企业为例,通过MATLAB软件进行仿真实验,验证模型和算法的科学性及有效性,得出最短运输距离为39.06 km、成本为1437.48元的结论.相对于搜索禁忌算法和遗传算法,蚁群算法在多配送中心冷链物流路径优化方面,能够平均减少1.11 km的运输距离和51.21元成本,更好地解决物流路径优化问题,提高物流服务质量.     

Tool sequence optimization based on three logical modes of robot control via CPLEX optimization

Cluster tools have advantages of shorter cycle times, faster process development, and better yield for less contamination. The sequence of dual-arm cluster tools is a complex logistics process during the semiconductor production. Efficient use of cluster tools is naturally very significant to competitive fab operations. Generating an optimized sequence in a computationally efficient manner and assessing the quality of the requirements to improve the fab production are the key factors for semiconductor manufacturing productivity. The Petri net modeling is introduced to minimize the makespan of the process for the three different logical modes and select a better mode after comparing the makespan among the three logical modes. The tool sequence optimization problem is formulated as optimization firing transition sequences based on the Petri net and then the formulation is converted to be linearly solved by the branch-and-cut method in the standard commercial solver CPLEX. Special methods for the linear conversion are highlighted. Due to the limited calculation time requirement for the real production and the large scale of the problem, special methods for the efficiency tuning are applied according to the characteristics of the problem. Numerical testing is supported by one of the most advanced semiconductor enterprises and the computational results show significant improvement compared with the traditional manual sequence results.     

基于改进遗传算法的公交线网整体优化方法

先进公交系统(APTS)是智能交通系统(ITS)的重要组成部分,也是目前的研究热点问题.本文讨论的公交网络优化问题则是实现先进公交系统的先决与基础.然而,对于实际规模的问题,传统的技术难以经济有效的解决.为此,我们提出了新的优化模型,设计了改进的遗传算法用以求解该模型.改进的算法有两个特点:基于优先级的编码和多染色体的结构.     

Regenerative braking algorithm for an ISG HEV based on regenerative torque optimization

A novel regenerative braking algorithm based on regenerative torque optimization with emulate engine compression braking (EECB) was proposed to make effective and maximum use of brake energy in order to improve fuel economy. The actual brake oil pressure of driving wheel which is reduced by the amount of the regenerative braking force is supplied from the electronic hydraulic brake system. Regenerative torque optimization maximizes the actual regenerative power recuperation by energy storage component, and EECB is a useful extended type of regenerative braking. The simulation results show that actual regenerative power recuperation for the novel regenerative braking algorithm is more than using conventional one, and life-span of brake disks is prolonged for the novel algorithm.     

QoS awared power and admission controls based on non-cooperative game theory in wireless networks

In order to better accommodate heterogeneous quality of service (QoS) in wireless networks, an algorithm called QeS-aware power and admission controls (QAPAC) is proposed. The system is modeled as u non- cooperative game where the users adjust their transmit powers to maximize the utility, thus restraining the interferences. By using adaptive utility functions and tunable pricing parameters according to QoS levels, this algorithm can well meet different QoS reqniremcnts and improve system capacity compared with those that ignore the QoS differ- ences.     

基于遗传算法的城市区域交通信号控制系统仿真

城市交通信号控制是城市交通管理中的主要手段和途径。提出从系统最优原则出发制定交通管理策略的观点,建立城市区域系统最优模型,并基于MATLAB软件中的遗传算法给出求解。最后,通过两个典型交通路网模拟验证最优模型的适用性和合理性,并获得控制目标交叉口绿信比、延误数以及区域交通网络总的运行时间。     

基于蚁群算法优化的EPS系统PID控制

汽车电动助力转向系统是一个非线性时变的复杂系统,在对它进行控制时,单独采用常规PID控制难以达到平稳准确的效果,在此加入蚁群算法(ACO)对其进行优化而得到稳定的最优参数解.根据车辆动力学关系,建立了两自由度整车模型、电动助力转向系统模型以及带有蚁群算法优化的PID控制器模型.通过Matlab,对该模型进行仿真分析.仿真结果表明,蚁群算法和PID控制的结合,使系统控制更精确、运行更加平稳.     

多子种群PSO优化SVM的网络流量预测

针对网络流量的时变性和非平稳性特点,为提高网络流量预测精度,提出一种“多子种群”机制的粒子群算法和支持向量机的网络流量预测模型（Multi-Subpopulation Particle Swarm Opti-mization and Support Vector Machine,MSPSO-SVM）.首先支持向量机（Support Vector Machine,SVM）参数编码成粒子位置串,并根据网络训练集的交叉验证误差最小作为参数优化目标,然后通过粒子间信息交流找到最优SVM参数,并引入“多子种群”机制,解决粒子群优化（Particle SwarmOptimization,PSO）算法的早熟停滞缺陷,最后根据最优参数建立网络流量预测模型,并采用实际网络流量数据进行仿真测试.结果表明,相对于其他预测模型,MSPSO-SVM可以获得更优的SVM参数,网络流量预测精度得以提高,更加适用于复杂多变的网络流量预测.     

Fault reconfiguration of shipboard power system based on triple quantum differential evolution algorithm

Fault reconfiguration of shipboard power system is viewed as a typical nonlinear and multi-objective combinatorial optimization problem. A comprehensive reconfiguration model is presented in this paper, in which the restored loads, switch frequency and generator efficiency are taken into account. In this model, analytic hierarchy process(AHP) is proposed to determine the coefficients of these objective functions. Meanwhile, a quantum differential evolution algorithm with triple quantum bit code is proposed. This algorithm aiming at the characteristics of shipboard power system is different from the normal quantum bit representation. The individual polymorphic expression is realized, and the convergence performance can be further enhanced in combination with the global parallel search capacity of differential evolution algorithm and the superposition properties of quantum theory. The local optimum can be avoided by dynamic rotation gate. The validity of algorithm and model is verified by the simulation examples.     

基于人工鱼群算法的移动通信网络基站覆盖优化问题

基站覆盖优化问题是移动通信网络优化的核心问题．针对网络节点严重冗余，基站之间相互干扰的情况，提出了一个移动通信网络基站最优覆盖模型，并利用人工鱼群算法对移动通信网络基站覆盖优化问题进行求解，得到了最优设计方案．最后选取某城市核心区域对模型与算法进行了验证，仿真结果表明：本文提出的方法提高了移动通信网络基站的覆盖率，减少了节点冗余，从而达到减少网络建设成本，提高网络规划效率和准确度的网络优化目的．     

基于粒子群的城市交通信号两级模糊控制

针对城市交通流的特点,设计一种单交叉口多相位两级模糊控制器,有效地减少控制规则数,实现相序、绿信比、周期随交通状况而自适应变化,并采用粒子群算法对模糊控制器的隶属度函数进行优化。仿真结果表明,该系统能有效地提高交叉口的通行能力,减少车辆平均延误。