Multi-agent and driving behavior based rear-end collision alarm modeling and simulating

Distance-between-vehicle-measurement is the only factor in traditional car rear-end alarm system. To address the above problem, this paper proposes an alarming model based on multi-agent systems (MAS) and driving behavior. It consists of four different types of agents that can either work alone or collaborate through a communications protocol on the basis of the extended KQML. The rear-end alarming algorithm applies the Bayes decision theory to calculate the probability of collision and prevent its occurrence real-time. The learning algorithm of driving behavior based on ensemble artificial neural network (ANN) and the decision procedure based on Bayes’ theory are also described in this paper. Both autonomy and reliability are enhanced in the proposed system. The effectiveness and robustness of the model have been confirmed by the simulated experiments.     

教学科研实践一体化,知识能力素质齐增长——软件工程专业实践创新教学改革探索

<正>加强学生工程实践能力的培养是高校工科教育改革的重要内容,其中培养学生的科研实践能力是教学改革和科研实践的重要组成部分。软件工程专业是国家示范性软件学院率先设立的面向工业界培养软件工程师的专业,因此对实践能力的要求更高。华东师范大学软件学     

用组态王开发钢包精炼炉监控系统

运用"Kingview 6.53"组态软件的强大功能开发了钢包精炼炉监控系统,以实现对电极、高压、冶炼、液压、氩气、冷却等各个系统运行状况的实时监控、故障报警、数据报表趋势分析与打印、历史数据记录及查询等功能.该系统图形界面友好、数据采集实时性好且准确可靠、操作方便、安全稳定.     

变频器故障分析及处理

从参数设置、过电压、过电流、过负载等方面详细分析了变频器常见故障产生的原因及处理方法.     

Optimal replacement policy for a two-dissimilar-component cold standby system with different repair actions

In this paper, a cold standby repairable system consisting of two dissimilar components and one repairman is studied. When failures occur, the repair of both component 1 and component 2 are not ‘as good as new’. The consecutive operating times of component 1 after repair constitute a decreasing geometric process, while the repair times of component 1 are independent and identically distributed. For component 2, its failure is rectified by minimal repair, and the repair time is negligible. Component 1 has priority in use when both components are good. The replacement policy N is based on the failure number of component 1. Under policy N, we derive the explicit expression of the long-run average cost rate C(N) as well as the average number of repairs of component 2 before the system replaced. The optimal replacement policy N*, which minimises the long-run average cost rate C(N), is obtained theoretically. If the failure rate r(t) of component 2 is increasing, the existence and uniqueness of the optimal policy N* is also proved. Finally, a numerical example is given to validate the developed theoretical model. Some sensitivity analyses are provided to show the influence of some parameters, such as the costs for replacement and repair, and the parameters of the lifetime and repair time distributions of both components, to the optimal replacement policy N* and corresponding average cost rate C(N*).     

A hybrid adaptive cuckoo search optimization algorithm for the problem of chaotic systems parameter estimation

This paper introduces a novel hybrid adaptive cuckoo search (HACS) algorithm to establish the parameters of chaotic systems. In order to balance and enhance the accuracy and convergence rate of the basic cuckoo search (CS) algorithm, the adaptive parameters adjusting operation is presented to tune the parameters properly. Besides, the exploitation capability of the CS algorithm is enhanced a lot by integrating the orthogonal design strategy. The functionality of the HACS algorithm is tested through the Lorenz system under the noise-free and noise-corrupted conditions, respectively. The numerical results demonstrate that the algorithm can estimate parameters efficiently and accurately, and the capability of noise immunity is also powerful. Compared with the basic CS algorithm, genetic algorithm, and particle swarm optimization algorithm, the HACS algorithm is energy efficient and superior.     

CS-Chord:基于聚类分离的分布式高维向量索引

M-Chord是一种基于P2P网络的高维向量索引,其聚类边缘的向量容易与搜索圆频繁相交,使得查找的区域增多,降低了M-Chord的效率。提出一种基于聚类分离的分布式高维向量索引(CS-Chord),将边缘区域的高频检索向量从Chord环中分离出来,集中存储在服务器上,中心区域的向量仍存储于Chord环中,节省了大量资源的定位时间,从而提高检索效率。实验结果表明:在查询半径为0.2时,CS-Chord距离计算次数约为2000,比M-Chord减少了约2500次;CS-Chord消息转发次数约降低150次,仅为M-Chord的50%。