基于静止图象的数字水印算法研究

随着因特网和多媒体技术的不断发展,数字媒体已成为人们获取知识的主要手段,但也带来一系列的问题:如作品侵权、非法复制和传播等。而数字水印技术作为版权保护的重要手段,已得到广泛的应用和研究。概述了数字水印技术,并提出了一种新的基于静止图象的数字水印算法。该算法的密钥由原始图象、水印图象和随机数发生器的种子共同决定。而且,该算法能承受有损压缩、旋转、剪切等几种攻击,经实验证明具有良好的鲁棒性。     

模糊控制与其它控制技术的融合研究

介绍了模糊控制技术针对复杂控制对象进行的控制规则和隶属度函数算法的改进,以及与其它控制技术的融合研究,总结出多种控制融合方式,并在此基础上讨论了对更加复杂的研究对象的分析方法的可行性。     

飞行器低空突防威胁建模与航迹优化算法

提出了一种飞行器在给定地形和威胁分布的威胁场进行低空突防的航迹优化算法。该方法首先对地形的高程栅格数据进行了图形简化预处理,将各种威胁叠加到地形图上,构成一个包含各种威胁的特定威胁场,再对其建立合理的有向图数学建模,用Dijkstra最短路算法进行航迹优化。航迹优化的过程中考虑了飞行器的过载限制,使优化航迹能够较好地满足飞行器各项性能指标及任务规划的要求,仿真结果显示,该算法简单快速,能很好地进行地形、威胁、障碍物的回避。     

防空导弹垂直发射转弯优化设计的新方法

防空导弹采用垂直发射方式时 ,最重要的要求就是导弹发射后在最短的时间内以最小转弯半径完成程序转弯 ,所以是一个快速最优控制问题 ,文章对连续系统的最优控制进行离散化 ,从而应用遗传算法对防空导弹垂直发射转弯程序进行了优化设计     

采用PageRank和节点聚类系数的标签传播重叠社区发现算法

基于标签传播的社区发现算法可以检测出复杂网络的重叠社区结构,因此提出了一种基于PageRank和节点聚类系数的重叠社区发现算法。该算法使用PageRank算法对节点的影响力进行排序,可以稳定社区发现结果,节点的聚类系数是一个与节点相关的值,使用节点聚类系数修改算法的参数并限制每个节点拥有最多标签的数量值,可以提高社区挖掘的质量。在人工网络和真实世界的网络上测试,实验验证了该算法能够有效地检测出重叠社区,并具有可接受的时间效率和算法复杂度。     

Timely exposure of a secret project: Which activities to monitor?

A defender wants to detect as quickly as possible whether some attacker is secretly conducting a project that could harm the defender. Security services, for example, need to expose a terrorist plot in time to prevent it. The attacker, in turn, schedules his activities so as to remain undiscovered as long as possible. One pressing question for the defender is: which of the project's activities to focus intelligence efforts on? We model the situation as a zero‐sum game, establish that a late‐start schedule defines a dominant attacker strategy, and describe a dynamic program that yields a Nash equilibrium for the zero‐sum game. Through an innovative use of cooperative game theory, we measure the harm reduction thanks to each activity's intelligence effort, obtain insight into what makes intelligence effort more effective, and show how to identify opportunities for further harm reduction. We use a detailed example of a nuclear weapons development project to demonstrate how a careful trade‐off between time and ease of detection can reduce the harm significantly.     

An exact branch‐and‐price algorithm for multitasking scheduling on unrelated parallel machines

We consider the multitasking scheduling problem on unrelated parallel machines to minimize the total weighted completion time. In this problem, each machine processes a set of jobs, while the processing of a selected job on a machine may be interrupted by other available jobs scheduled on the same machine but unfinished. To solve this problem, we propose an exact branch‐and‐price algorithm, where the master problem at each search node is solved by a novel column generation scheme, called in‐out column generation, to maintain the stability of the dual variables. We use a greedy heuristic to obtain a set of initial columns to start the in‐out column generation, and a hybrid strategy combining a genetic algorithm and an exact dynamic programming algorithm to solve the pricing subproblems approximately and exactly, respectively. Using randomly generated data, we conduct numerical studies to evaluate the performance of the proposed solution approach. We also examine the effects of multitasking on the scheduling outcomes, with which the decision maker can justify making investments to adopt or avoid multitasking.     

Shortest path interdiction problem with arc improvement recourse: A multiobjective approach

We consider the shortest path interdiction problem involving two agents, a leader and a follower, playing a Stackelberg game. The leader seeks to maximize the follower's minimum costs by interdicting certain arcs, thus increasing the travel time of those arcs. The follower may improve the network after the interdiction by lowering the costs of some arcs, subject to a cardinality budget restriction on arc improvements. The leader and the follower are both aware of all problem data, with the exception that the leader is unaware of the follower's improvement budget. The effectiveness of an interdiction action is given by the length of a shortest path after arc costs are adjusted by both the interdiction and improvement. We propose a multiobjective optimization model for this problem, with each objective corresponding to a different possible improvement budget value. We provide mathematical optimization techniques to generate a complete set of strategies that are Pareto‐optimal. Additionally, for the special case of series‐parallel graphs, we provide a dynamic‐programming algorithm for generating all Pareto‐optimal solutions.     

采用遗传算法的电控增压器电磁阀优化设计

运用Ansoft Maxwell软件建立电磁阀的动态响应特性仿真模型,并通过试验验证模型的准确性。利用模型集成ISIGHT软件的方法,对影响电磁阀动态响应特性的参数进行灵敏度分析,得出各个参数对动态响应特性的Pareto图。基于遗传算法对电磁阀进行多参数优化设计,获取最佳参数组合,并利用电磁阀动态响应特性试验台架,开展参数优化前后电磁阀动态响应特性的对比试验研究。试验结果表明：相比于原参数方案,参数优化后的电磁阀动态响应特性得到大幅度提升,其开启响应时间缩短了59.1%,关闭响应时间缩短了47.2%。     

复杂网络影响力极大化快速评估算法

分析复杂网络中影响力极大化问题,设计一种新的启发式算法框架。针对信息传递中节点的交互方式进行分析,给出节点在任意时刻处于信息接收态的概率。通过期望计算得到种子节点集传播影响力的近似估计,实现集群影响力快速计算,进而得到基于序列采样的影响力极大化快速评估算法。特别地,对于六个来自不同领域的真实网络上的影响力极大化问题进行了研究,仿真结果表明：该方法能够高效识别网络中具有重要传播影响力的节点集,在三种常见度量准则下的表现均明显优于三种影响力极大化问题基准算法。