先验式秘密共享方案及实现

分析了传统的秘密共享算法的不足之处,提出了相应的优化方案,形成了先验式秘密共享方案,包括初始化、份额更新、份额恢复和秘密重构,实现了先验式秘密共享协议的各种算法,充分考虑了秘密分享的各个阶段可能遇到的问题,并分别给出了相应的解决方案.     

系统辨识方法在微型飞行器建模中的应用

为对微型飞行器的飞行进行控制,需要建立其动力学模型。讨论了微型飞行器模型的系统辨识方法,设计了实验方法与采集装置,在数据处理、模型结构选择、模型评价等方面进行了探讨。简要介绍了输入输出端存在噪声时系统的线性最小二乘无偏辨识方法原理,最后给出了微型飞行器的纵向通道的仿真算例,结果表明,运用这种方法对微型飞行器进行建模是准确而有效的。     

Analysis of production lines with Coxian service times and no intermediate buffers

This paper uses the holding time model (HTM) method to derive an approximate analytic formula for the calculation of the mean throughput of a K-station production line with no buffers between any two successive stations. Service times follow the two-stage Coxian (C²) distribution at all stations. The paper provides a formula that relates the third moment of the service completion (or virtual service) time with the respective parameters of the service time, the repair time and the time to breakdown (the latter is assumed to follow the exponential distribution). In this way, it concludes that under certain conditions the two-stage Coxian distribution can be used to approximate any general distribution matching the first three moments of the service completion time distribution. The mean holding times (consisting of the service and blocking periods) of all stations of the line are obtained in an analytical form. Numerical results are provided for the mean throughput of lines with up to 20 stations. These results are shown to have a good accuracy compared against results obtained from the Markovian state method (for short lines) and results from simulation (for longer lines). © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 669–685, 1998     

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

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

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

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

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

提出了一种飞行器在给定地形和威胁分布的威胁场进行低空突防的航迹优化算法。该方法首先对地形的高程栅格数据进行了图形简化预处理,将各种威胁叠加到地形图上,构成一个包含各种威胁的特定威胁场,再对其建立合理的有向图数学建模,用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.     

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

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