视频图像中动态目标检测系统的FPGA硬件设计

为解决传统视频图像数据处理时,通常以软件为基础,存在工作量大、存储时间长的问题,提出了基于FPGA硬件结构处理的设计,提高系统的处理速度和实时性.针对图像处理问题,采用背景差分法检测运动目标,通过二值化方法剔除图像中的静止场景,然后再做形态滤波,消除空洞和噪声点,最后提取出目标中心点,达到检测运动目标的目的.同时加入sobel边缘检测模块,扩展运动目标检测体系结构,在检测目标时,系统能够根据物体的形状以及它的运动路径,来识别对象并对其检测结果进行分类.此外,对一些特定环境,设置适当禁区,当目标中心点进入禁区时,做出相应判断.硬件设计和Verilog HDL程序编写完成后,在Modelsim中做仿真验证,可以得到正确的目标检测结果.     

一种改进的基于规则实例多覆盖分类算法

基于规则分类算法提取的规则集通常存在3个问题:首先,提取的分类规则集中短规则过少,致使高质量的规则不多;其次,规则集中规则数量少,训练数据中几乎所有实例仅被规则覆盖一次;第三,虽然提取大量的规则,但是训练数据中存在一些小类样本的实例不能被任何一条规则覆盖。本文提出一种改进的基于规则的实例多覆盖分类算法(Rule-based classification with instances covered by multiple rules, RCIM),其特点是:(1)为了提高规则的质量,在选择生成规则的第1项时不仅考虑属性值的好坏,而且还考虑了属性值补的好坏;(2)一次产生尽量多,高质量的规则,而且当训练数据的实例至少被两条规则覆盖后才将其删除;(3)当遇上难以判断的测试数据时,对测试数据的各个属性值进行二次学习提取规则。算法RCIM不仅可以有效地提取大量的规则,而且较大程度地提高了规则的质量。通 过在大量数据上实验结果表明,RCIM比许多其他算法取得了更高的分类准确率。     

Event‐triggered distributed constrained consensus

We consider a distributed consensus problem for continuous‐time multi‐agent systems with set constraints on the final states. To save communication costs, an event‐triggered communication‐based protocol is proposed. By comparing its own instantaneous state with the one previously broadcasted to neighbours, each agent determines the next communication time. Based on this event‐triggered communication, each agent is not required to continuously monitor its neighbours' state and the communication only happens at discrete time instants. We show that, under some mild conditions, the constrained consensus of the multi‐agent system with the proposed protocol can be achieved with an exponential convergence rate. A lower bound of the transmission time intervals is provided that can be adjusted by choosing different values of parameters. Numerical examples illustrate the results. Copyright © 2016 John Wiley & Sons, Ltd.     

一种以人为中心的智能化城市交通综合监控方法

随着我国城市化的进程、汽车行业的蓬勃发展和人民生活水平的日益提高,行驶在城市道路上的车辆越来越多,造成了一系列的问题,如何更加高效地监控城市交通,近年来已经成为了研究重点。研究表明,交通监控员通过远程调阅路面监控录像的模式,实施有效监控的推荐显示屏幕个数只有4个,因此,传统的交通监控模式将导致很高的交通事件漏报率和误报率。针对这些问题,提出了一个以人为中心的智能化城市交通监控方法,主要特点包括:1．采用眼球追踪技术,对交通监控员的眼球活动状态进行跟踪和分析,根据已建立的事件模型和判定模型进行快速屏幕切换操作;2．通过结合RFID技术,对道路上车辆的RFID标签进行追踪和统计分析,根据模型进行交通事件快速预警和关联分析。该方法的使用比较简单,能有效提升交通监控员的交通事件发现率。     

Active fault tolerant control of discrete event systems using online diagnostics

The aim of this paper is to deal with the problem of fault tolerant control in the framework of discrete event systems modeled as automata. A fault tolerant controller is a controller able to satisfy control specifications both in nominal operation and after the occurrence of a fault. This task is solved by means of a parameterized controller that is suitably updated on the basis of the information provided by online diagnostics: the supervisor actively reacts to the detection of a malfunctioning component in order to eventually meet degraded control specifications. Starting from an appropriate model of the system, we recall the notion of safe diagnosability as a necessary step in order to achieve fault tolerant control. We then introduce two new notions: (i) “safe controllability”, which represents the capability, after the occurrence of a fault, of steering the system away from forbidden zones and (ii) “active fault tolerant system”, which is the property of safely continuing operation after faults. Finally, we show how the problem can be solved using a general control architecture based on the use of special kind of diagnoser, called “diagnosing controller”, which is used to safely detect faults and to switch between the nominal control policy and a bank of reconfigured control policies. A simple example is used to illustrate the new notions and the control architecture introduced in the paper.     

Group path covering and distance two labeling of graphs

For a positive integer d, an L(d,1)-labeling f of a graph G is an assignment of integers to the vertices of G such that |f(u)−f(v)|?d if uv∈E(G), and |f(u)−f(v)|?1 if u and u are at distance two. The span of an L(d,1)-labeling f of a graph is the absolute difference between the maximum and minimum integers used by f. The L(d,1)-labeling number of G, denoted by λd,1(G), is the minimum span over all L(d,1)-labelings of G. An L^′(d,1)-labeling of a graph G is an L(d,1)-labeling of G which assigns different labels to different vertices. Denote by the L^′(d,1)-labeling number of G. Georges et al. [Discrete Math. 135 (1994) 103-111] established relationship between the L(2,1)-labeling number of a graph G and the path covering number of Gc, the complement of G. In this paper we first generalize the concept of the path covering of a graph to the t-group path covering. Then we establish the relationship between the L^′(d,1)-labeling number of a graph G and the (d−1)-group path covering number of Gc. Using this result, we prove that and for bipartite graphs G can be computed in polynomial time.     

Partial order reduction for state/event LTL with application to component-interaction automata

Software systems assembled from a large number of autonomous components become an interesting target for formal verification due to the issue of correct interplay in component interaction. State/event LTL (Chaki et al. (2004, 2005) [1] and [2]) incorporates both states and events to express important properties of component-based software systems.The main contribution of this paper is a partial order reduction technique for verification of state/event LTL properties. The core of the partial order reduction is a novel notion of stuttering equivalence which we call state/event stuttering equivalence. The positive attribute of the equivalence is that it can be resolved with existing methods for partial order reduction. State/event LTL properties are, in general, not preserved under state/event stuttering equivalence. To this end we define a new logic, called weak state/event LTL, which is invariant under the new equivalence.To bring some evidence of the method’s efficiency, we present some of the results obtained by employing the partial order reduction technique within our tool for verification of component-based systems modelled using the formalism of component-interaction automata (Brim et al. (2005) [3]).     

Multi‐agent system for knowledge‐based event recognition and composition

This work presents a multi‐agent system for knowledge‐based high‐level event composition, which interprets activities, behaviour and situations semantically in a scenario with multi‐sensory monitoring. A perception agent (plurisensory agent and visual agent)‐based structure is presented. The agents process the sensor information and identify (agent decision system) significant changes in the monitored signals, which they send as simple events to the composition agent that searches for and identifies pre‐defined patterns as higher‐level semantic composed events. The structure has a methodology and a set of tools that facilitate its development and application to different fields without having to start from scratch. This creates an environment to develop knowledge‐based systems generally for event composition. The application task of our work is surveillance, and event composition/inference examples are shown which characterize an alarming situation in the scene and resolve identification and tracking problems of people in the scenario being monitored.     

关于INTEL96系列单片机中HSO事件的设置

就ＭＣＳ－９６系列单片机中设置ＨＳＯ事件时,若事件的触发时间超过定时器Ｔ１、Ｔ２的溢出间隔的问题进行了讨论,给出了具体的解决方案,对许多文献资料中关于这一问题的论述进行了补充,具有实用意义。     

基于CHECK方式的联锁仿真系统的设计与实现

针对城市轨道交通包括地铁、轻轨等的过渡信号系统的特点,研制了CHECK方式的列车运行控制系统1。文章在分析基于CHECK方式的联锁与闭塞系统的工作原理的基础上,给出了联锁仿真系统的数学模型,提出了用“事件调度法”这一仿真技术实现CHECK方式的联锁系统的仿真,并予以实现,满足了实际应用的需要。