不确定移动对象概率Skyline集的查询更新

Skyline查询的研究已从传统的静态Skyline操作延伸到动态的、不确定数据集上的Skyline查询和计算上。研究了移动环境下,查询点位置固定、目标点处于运动状态并且位置不确定情况下的连续概率Skyline计算问题。这个过程中,移动对象与查询对象之间的距离随时间不断变化。移动对象由于其运动状态导致位置无法精确定位,因此移动对象之间的支配关系只能采用概率形式表示,且随时间不断变化。给出了移动对象间的支配概率的定义,以及移动对象Skyline概率的定义,并定义了触发事件来记录对象支配概率发生变化的时刻,实现概率Skyline计算的连续跟踪和动态更新。提出了基于事件触发的连续概率Skyline查询算法(event triggered continuous probabilistic Skyline query for uncertain moving object,U-ECPS),对移动环境下的Skyline集进行连续查询和更新。大量的实验结果验证了U-ECPS算法的有效性。     

异类传感器实时信息融合的STMHM算法

异类传感器实时信息融合由于两类设备的数据率不同和数据误差的限制,一直未得到有效解决,提出一种空时二维多假设模型(STMHM)算法来解决该问题。设计的融合数据模型,将异类传感器的测量数据映射在二维直角坐标系下;按照新的融合数据模型分别构建两类传感器的目标量测空间和融合空间;设计量测空间时间初始化方法和目标实体空间的滤波算法;通过仿真验证表明:该算法能够实现异类传感器的信息融合,初次融合成功的确认时间在3～5个主动传感器扫描周期。     

无线传感网络覆盖中概率Voronoi模型及算法研究

覆盖是无线传感网络中最重要的问题之一,随机覆盖是目前研究的主流。基于Voronoi图的随机覆盖算法是无线传感网络领域的研究热点。目前研究中采用的Voronoi图,主要采用基于距离的Voronoi边赋权值模型,存在两个主要问题,即模型粗糙和监测节点不全。以实测的分段概率传感模型为基础,从多传感协同监测的角度构造一种概率Voronoi模型,试图解决以上问题。并且用基于概率Voronoi模型的最大突破路径算法验证了模型有效性。就掌握的文献来看,该模型是首次提出,具有较好的实用推广价值。     

基于颜色空间映射的自适应足球机器人视觉系统

为了解决足球机器人比赛中视觉信息检测问题,给出基于嵌入式多处理器体系结构的视觉系统框架,并研究了一种自适应阈值目标分割方法。该方法将视觉系统采集的图像从YCbCr颜色空间转换为一维颜色映射图像,并提出基于竞争学习的空间映射方法。同时使用小波变换方法来平滑颜色映射空间直方图和降低阈值搜索维数。然后使用基于映射图像直方图动态搜索阈值的方法来分割图像。最后,通过实验表明研究的视觉系统的有效性,能够实时准确地完成视觉处理任务。     

利用改进的差分进化算法求解等圆Packing问题

等圆Packing问题属于强约束的复杂组合优化问题之一,针对其强约束特点及难点,通过改进传统的差分进化算法,提出一种等圆Packing问题的求解方法。该改进算法特点是将有效解空间加入差分进化的变异约束中,并采用随机排序机制改进差分进化的选择机制。通过多次实验,表明此算法在求解小规模等圆Packing问题上取得的效果与目前所能找到的最优值相差不到0.6%,从而验证了演化计算在求解等圆Packing问题的可行性;与此同时,演化算法具有很好的收敛性,因此在其他强约束的复杂优化问题上将有很好的应用。     

对偶四元数线阵遥感影像几何定位

提出以对偶四元数为数学工具进行线阵CCD(电荷耦合元件)遥感影像几何定位的全新技术方法。利用对偶四元数建立遥感通用传感器严密成像模型,将光线束的位置和姿态统一用对偶四元数表示,通过传感器扫描光线在空间中的螺旋运动,实现像点到其对应地面点物方坐标的变换,从而克服了成像几何参数(外方位元素)之间的强相关性。按照空间刚体变换线性蒙皮混合理论,可以把刚体变换矩阵分解为平移和旋转两个部分,对平移部分进行线性插值,对旋转部分进行球面插值,从而实现线阵CCD遥感影像外方位元素的解算。按照所建立的成像几何模型,利用某地区Geoeye-1遥感影像进行几何定位实验,实验结果表明新算法获得的几何定位精度优于传统算法,能够解决定位参数之间的相关性问题。     

Ontological reasoning in the design space exploration of advanced cyber–physical systems

Cyber–physical systems are becoming increasingly complex. In these advanced systems, the different engineering domains involved in the design process become more and more intertwined. Therefore, a traditional (sequential) design process becomes inefficient in finding good design options. Instead, an integrated approach is needed where parameters in multiple different engineering domains can be chosen, evaluated, and optimized to achieve a good overall solution. However, in such an approach, the combined design space becomes vast. As such, methods are needed to mitigate this problem.In this paper, we show a method for systematically capturing and updating domain knowledge in the context of a co-design process involving different engineering domains, i.e. control and embedded. We rely on ontologies to reason about the relationships between parameters in the different domains. This allows us to derive a stepwise design space exploration workflow where this domain knowledge is used to quickly reduce the design space to a subset of likely good candidates. We illustrate our approach by applying it to the design space exploration process for an advanced electric motor control system and its deployment on embedded hardware.     

Searching minimax game trees under memory space constraint

Games such as CHESS, GO and OTHELLO can be represented by minimax game trees. Among various search procedures to solve such game trees,- and SSS^* are perhaps most well known. Although it is proved that SSS^* explores only a subset of the nodes explored by-, - is commonly believed to be faster in real applications, since it requires very little memory space and hence its storage management cost is low. Contrary to this folklore, however, this paper reports, using the OTHELLO game as an example, that SSS^* is much faster than-. It is also demonstrated that SSS^* can be modified to make the required memory space controllable to some extent, while retaining the high efficiency of the original SSS^*.This research was partially supported by the Ministry of Education, Science and Culture of Japan, under a Scientific Grant-in-Aid.     

Exact probabilistic testability measures for multi-output circuits

The computation of probabilistic testability measures has become increasingly important and some methods have been proposed, although the exact solution of the problem is NP-hard. An exact analytical method for singleoutput combinational circuits is extended to deal with multi-output circuits. Such circuits are reduced to singleoutput ones by introducing a dummy gate, the X-gate, and applying to the resulting graph the analysis based on supergates.