Deformation Transfer to Multi‐Component Objects

We present a simple and effective algorithm to transfer deformation between surface meshes with multiple components. The algorithm automatically computes spatial relationships between components of the target object, builds correspondences between source and target, and finally transfers deformation of the source onto the target while preserving cohesion between the target's components. We demonstrate the versatility of our approach on various complex models.     

A heuristic method for learning Bayesian networks using discrete particle swarm optimization

Bayesian networks are a powerful approach for representing and reasoning under conditions of uncertainty. Many researchers aim to find good algorithms for learning Bayesian networks from data. And the heuristic search algorithm is one of the most effective algorithms. Because the number of possible structures grows exponentially with the number of variables, learning the model structure from data by considering all possible structures exhaustively is infeasible. PSO (particle swarm optimization), a powerful optimal heuristic search algorithm, has been applied in various fields. Unfortunately, the classical PSO algorithm only operates in continuous and real-valued space, and the problem of Bayesian networks learning is in discrete space. In this paper, two modifications of updating rules for velocity and position are introduced and a Bayesian networks learning based on binary PSO is proposed. Experimental results show that it is more efficient because only fewer generations are needed to obtain optimal Bayesian networks structures. In the comparison, this method outperforms other heuristic methods such as GA (genetic algorithm) and classical binary PSO.     

Building a database for product design knowledge retrieval—A case study in robotic design database

In product design process, when dealing with technical problems or initiating a new design, R&D personnel would often turn to technical database to seek inspiration. The building of a database with such documents has not been systematically dealt with. In this paper, several issues on how to build up a product design database are investigated: input source, sampling scheme and quality control. A case study of building a database for robotic design is used to demonstrate the concept. It is an archive of more than 1500 relevant technical papers. A total of 16 graduates are employed as operators in the labeling process and subsequently the hypothesis tests are utilized to process the labeling results. To ensure this database quality, the labeling consistency of each operator and the understanding of each category are tested. With the use of statistical methods, this work proposes a feasible and practical way to create such a database for product design.     

Distributed bandwidth allocation based on alternating evolution algorithm

In a network, end nodes have to compete for bandwidth through some distributed congestion control algorithms. It is a great challenge to ensure the efficiency and fairness of the distributed control algorithms. TCP congestion control algorithms do not perform well in terms of their efficiency and fairness in high speed networks. In this paper, we propose a novel asymptotic evolution algorithm based on the Logistic Model to allocate limited bandwidth resource. The algorithm introduces an explicit bandwidth pre-allocation factor. The factor is carried by the packet and is computed in routers based on the information of the router capacity, the aggregate load, and the instantaneous queue length; therefore the algorithm does not require the routers to keep the per-flow state. According to this pre-allocation bandwidth factor, the senders asymptotically adjust their sending rate and the bandwidth factor changes asymptotically along with the variation of the aggregate load and the queue length in the routers; therefore the sending rate and the pre-allocation bandwidth factor form alternating evolution and eventually reach a steady state.     

Rough approximations based on intersection of indiscernibility,similarity and outranking relations

Rough sets theory has proved to be a useful mathematical tool for dealing with the vagueness and granularity in information tables. Classical definitions of lower and upper approximations were originally introduced with reference to an indiscernibility relation. However, indiscernibility relation is still restrictive for many applications. Many real-world problems deal with assignment of some objects to some preference-ordered decision classes. And, the objects are described by a finite set of qualitative attributes and quantitative attributes. In this paper, we construct the indiscernibility relation for the subset of nominal attributes, the outranking relation for the subset of ordinal attributes, and the similarity relation for the subset of quantitative attributes. Then the global binary relation is generated by the intersection of indiscernibility relation, outranking relation and similarity relation. New definitions of lower and upper approximations of the upward and downward unions of decision classes are proposed based on the global relation. We also prove that the lower and upper approximation operations satisfy the properties of rough inclusion, complementarity, identity of boundaries, and monotonicity.     

Information diffusion-based spatio-temporal risk analysis of grassland fire disaster in northern China

This study presents a Geographical Information Systems (GIS) and information diffusion-based methodology for spatio-temporal risk analysis of grassland fire disaster to livestock production in the grassland area of the northern China. We employed information matrix to analyze and to quantify fuzzy relationship between the number of annual severe grassland fire disasters and annual burned area. We also evaluated the consequences of grassland fire disaster between 1991 and 2006 based on historical data from 12 northern China provinces. The results show that the probabilities of annual grassland fire disasters and annual damage rates on different levels increase gradually from southwest to northeast across the northern China. The annual burned area can be predicted effectively using the number of annual severe grassland fire disasters. The result shows reliability as tested by two-tailed Pearson correlation coefficient. This study contributes a reference in decision making for prevention of grassland fire disaster and for stockbreeding sustainable development planning. The fuzzy relationship could provide information to make compensation plan for the disaster affected area.     

PostgreSQL存储过程移植方法

在对PostgreSQL存储过程处理机制进行研究的基础上,分析了Oracle存储过程移植到PostgreSQL时的语法、参数默认值、out参数、事务回滚、游标和内置函数等问题,并从成本、收益和技术难度的角度比较了两种存储过程移植方法--改写存储过程方法和扩展PostgreSQL的存储过程功能方法.深入研究了通过扩展PL/pgSQL源码来调整PostgreSQL存储过程功能的PLSE方法.     

航空相机检测系统软件设计

为了检测航空相机工作是否正常,并可对有故障相机进行故障诊断,该文设计了一套自动测试软件系统。该系统能模拟飞机的任务管理系统与相机以ARINC429总线传输方式传输数据,并按相机记录信息的要求,提供时间、地速、高度等信息,以便控制相机的工作参数并记录相关信息,完成对航空相机性能的测试。     

基于CCl101的分布式节能测控网络设计

设计并实现了一种基于无线收发器芯片CCll01的测控网络,简要介绍了网络中链路层协议的工作机制及相应硬件电路设计;详细分析了使用CCll01进行无线通信时的节能设计和防冲突设计原理,计算并给出了CCll01的有关内部寄存器的取值,同时也说明了使用PIC单片机PICl8F66J60进行局域网互连的软硬件设计方法;介绍了最终系统的实现情况及应用前景。     

单磁悬浮系统的纵向解耦控制研究

磁悬浮系统是复杂的强耦合系统,研究中未充分考虑轨道的弹性形变,会造成磁浮列车和轨道之间产生耦合振动的现象,而考虑这一因素对系统的影响无疑增加了研究的难度;为了便于问题的求解,采用非线性系统理论解耦的方法,对单电磁铁悬浮系统进行纵向解耦控制,并对解耦后的子系统进行极点配置使其满足要求的性能指标;仿真结果表明该方法有效地使复杂问题简单化,并且能够实现系统的全局稳定和良好的动态性能.