Multiconsensus of second order multiagent systems with directed topologies

A novel multiconsensus problem is introduced in multiagent systems. The states of multiple agents in each subnetwork asymptotically converge to a consistent value with information exchanges among subnetworks. The multiconsensus problem of second order multiagent systems with directed topologies is studied. Three linear protocols are proposed to solve the multiconsensus problem. Necessary and sufficient conditions are derived based on matrix theory. Simulations are provided to demonstrate the effectiveness of the theoretical results.     

煤矿调度电话录音上传及远程回放的实现

文章介绍了煤矿现有的调度电话录音系统,设计了调度电话监控上传系统来实现录音文件的上传和调度电话查询系统实现录音文件的查询和远程回放。系统通过输入查询取代了传统的人工查询的工作方式,大大节约了生产调度成本,同时为煤矿人员考勤和定位也提供了准确依据。由于其配置容易、操作方便、实用性高,因此具有很好的维护性和推广性。     

虚拟人运动中受扰的平衡保持算法

为了更加真实且实时地模拟运动中虚拟人恢复平衡的反应动作,提出一种针对受到外界作用力扰动的虚拟人平衡保持算法.首先通过虚拟人质心位移和速度来判断平衡性;然后借助生物力学的研究成果设计了具有人体特性的虚拟人运动受扰后的平衡保持方法,并用动力学进行模拟,驱动虚拟人完成平衡恢复.实验结果表明:该算法计算效率高,符合人体的生物力学特性,并且具有良好的交互性与较好的视觉效果,适用于虚拟人动画合成.     

用扫描链重构来提高EFDR编码的测试压缩率和降低测试功耗

为了解决系统芯片测试中日益增长的测试数据和测试功耗的问题,提出一种不影响芯片正常逻辑功能的扫描链重构算法--Run-Reduced-Reconfiguration(3R).该算法针对扩展频率导向游程(EFDR)编码来重排序扫描链和调整扫描单元极性,重新组织测试数据,减少了游程的数量.从而大人提高了EFDR编码的测试压缩率并降低测试功耗;分析了扫描链调整对布线长度带来的影响后,给出了权衡压缩率和布线长度的解决方案.在ISCAS89基准电路上的实验结果表明,使用3R算法后,测试压缩率提高了52%,测试移位功耗降低了53%.     

SoC测试访问机制和测试壳的蚁群联合优化

针对系统级芯片(SoC)测试壳优化和测试访问机制的测试总线划分问题,提出了基于蚁群算法的SoC Wrapper/TAM联合优化方法.构造蚁群算法时首先进行IP核的测试壳优化,用于缩短最长扫描链长度,减少单个IP核的测试时间;在此基础上进行TAM结构的蚁群优化,通过算法迭代逼近测试总线的最优划分,从而缩短SoC测试时间.对ITC2002基准SoC电路进行实验的结果表明,该方法能有效地解决SoC测试优化问题.     

基于LabVIEW的催化剂程序升温表征系统应用软件开发

开发基于LabVIEW的程序升温分析应用软件,主要用于催化剂程序升温表征实验.用AI自控仪表监控气路和电路的主要参数.基于LabVIEW的软件控制和采集主要参数.软件数据分析部分可分析采集程序升温图形的峰信息.测试了工业合成气转化用催化剂,表明本系统工作可靠,设计符合要求.     

基于ATML标准的测试信息描述研究

当前测试领域缺乏一个广为接受的测试信息交换标准,这已成为自动测试系统向前发展的一个瓶颈,为了解决此问题,IEEE发布了ATML标准,该标准使用XML语言进行ATS的测试信息的标准化交换;文章首先介绍了ATML标准的目标与具体组成,然后以测试结果为例,实现了基于ATML标准的测试结果信息的标准化描述;为了方便测试软件的开发,本文开发了测试结果组件,测试软件中直接调用测试结果组件以生成符合ATML标准的测试结果文件。     

复杂产品开发项目调度问题的模糊优化算法

对具有不确定时间参数的复杂产品开发项目调度问题,提出一种有效的模糊优化调度算法-基于预测的模糊BoP项目调度算法.首先,用模糊数表示不确定的时间参数,并构造相应的模糊数运算方法,对适合于确定性调度问题的BoP算法进行扩展,使其能处理模糊性时间参数.其次,修正了BoP算法中子项目调度方法,提高了算法的调度性能,降低了计算复杂度.大量的数值仿真实验表明,与基于启发式规则的调度算法相比,模糊BoP算法更适合于具有不确定时间参数的复杂产品开发项目调度问题.     

Conference key agreement protocol with non-interactive fault-tolerance over broadcast network

Most conventional conference key agreement protocols have not been concerned with a practical situation. There may exist some malicious conferees who attempt to block conference initiation for some purposes, e.g. commercial, political or military benefit. Instances where conference must be launched immediately due to emergency, efficient detection of malicious behavior would be needed. Recently, Tzeng (IEEE Trans. Comput. 51(4):373–379, 2002) proposed a fault-tolerant conference key agreement protocol to address the issue where a conference key can be established among conferees even though malicious conferees exist. However, his protocol might be complex and inefficient during fault-detection. In the case where a malicious conferee exists and a fault-tolerant mechanism is launched, complicated interactions between conferees will be required. In this paper, we introduce a novel strategy, where any malicious conferee may be identified and removed from the conferee list without any interaction. With such a non-interactive fault-tolerance, conferences could be established and started efficiently. A complete example of our protocol will be given to describe the fascinating fault-tolerance. We analyse the security of our protocol regarding four aspects, i.e. correctness, fault-tolerance, active attack and passive attack. The comparisons of performance between our protocol and that of Tzeng are also shown. As a whole, the advantage of our protocol is superior to that of Tzeng under the situation where malicious conferees exist.