2.5D Elastic graph matching

In this paper, we propose novel elastic graph matching (EGM) algorithms for face recognition assisted by the availability of 3D facial geometry. More specifically, we conceptually extend the EGM algorithm in order to exploit the 3D nature of human facial geometry for face recognition/verification. In order to achieve that, first we extend the matching module of the EGM algorithm in order to capitalize on the 2.5D facial data. Furthermore, we incorporate the 3D geometry into the multiscale analysis used and build a novel geodesic multiscale morphological pyramid of dilations/erosions in order to fill the graph jets. We show that the proposed advances significantly enhance the performance of EGM algorithms. We demonstrate the efficiency of the proposed advances in the face recognition/verification problem using photometric stereo.     

Partitioned formulation of internal and gravity waves interacting with flexible structures

This paper presents a partitioned modeling of internal and gravity fluid waves that interact with flexible structures. The governing interaction model consists of three completely partitioned entities: fluid model, structural model, and interface model that acts as an internal constraint on the fluid–structure interface boundary. Thus, the proposed partitioned multi-physics modeling can employ two completely modular fluid and structure software modules plus an interface solver, hence amenable to partitioned solution algorithms. The interface discretization can exploit the nonmatching interface algorithm previously developed via the method of localized Lagrange multipliers. Also noted is that the present fluid model can make use of widely available finite element software for standard Poisson-type problems.     

Predication based immune network for multimodal function optimization

For the problem of indeterminate direction of local search, lacking of efficient regulation mechanism between local search and global search and regenerating new antibodies randomly in the original optimization version of artificial immune network (opt-aiNet), this paper puts forward a novel predication based immune network (PiNet) to solve multimodal function optimization more efficiently, accurately and reliably. The algorithm mimics natural phenomenon in immune system such as clonal selection, affinity maturation, immune network, immune memory and immune predication. The proposed algorithm includes two main features with opt-aiNet. The information of antibodies in continuous generations is utilized to point out the direction of local search and to adjust the balance between local and global search. PiNet also employs memory cells to generate new antibodies with high affinities. Theory analysis and experiments on 10 widely used benchmark problems show that when compared with opt-aiNet method, PiNet algorithm is capable of improving search performance significantly in successful rate, convergence speed, search ability, solution quality and algorithm stability.     

Limit cycle prediction of a neurocontrol vehicle system based on gain-phase margin analysis

Based on some useful frequency domain methods, this paper proposes a systematic procedure to address the limit cycle prediction of a neural vehicle control system with adjustable parameters. A simple neurocontroller can be linearized by using describing function method firstly. According to the classical method of parameter plane, the stability of linearized system with adjustable parameters is then considered. In addition, gain margin and phase margin for limit cycle generation are also analyzed by adding a gain-phase margin tester into open loop system. Computer simulations show the efficiency of this approach.     

Evaluation of different disinfection calculation methods using CFD

Computational Fluid Dynamics combined with a particle tracking technique provides valuable information concerning residence times and contact times in chemical reactors. In drinking water treatment, for example an accurate estimation of the disinfection is important to predict the microbial safety. Ozone contactors are widely used for disinfection, but the complex geometry of the system causes suboptimal hydraulics and requires optimizations of the flow. This results in a lower ozone dosage, which may reduce the formation of unwanted disinfection-by-products and the consumption of energy. To that end disinfection needs to be calculated precisely, accounting for the complex hydraulics. Several calculation methods estimating the disinfection performance of ozone contactors were evaluated using Computational Fluid Dynamics. For an accurate disinfection prediction, the full distribution of ozone exposures (CT values) is needed, only a mean CT value or residence time distribution provides insufficient information for an accurate disinfection prediction. Adjustments to the geometry of the ozone contactor that reduce the short-circuit flows resulted in an increase in disinfection capacity, whereas the mean CT value remained the same. A sensitivity analysis with respect to the kinetics was conducted. The gain in disinfection capacity obtained by optimizing the hydraulics was significant for typical values used in practice.     

An improved ant colony optimization algorithm for solving a complex combinatorial optimization problem

This paper presents an improved ant colony optimization algorithm (IACO) for solving mobile agent routing problem. The ants cooperate using an indirect form of communication mediated by pheromone trails of scent and find the best solution to their tasks guided by both information (exploitation) which has been acquired and search (exploration) of the new route. Therefore the premature convergence probability of the system is lower. The IACO can solve successfully the mobile agent routing problem, and this method has some excellent properties of robustness, self-adaptation, parallelism, and positive feedback process owing to introducing the genetic operator into this algorithm and modifying the global updating rules. The experimental results have demonstrated that IACO has much higher convergence speed than that of genetic algorithm (GA), simulated annealing (SA), and basic ant colony algorithm, and can jump over the region of the local minimum, and escape from the trap of a local minimum successfully and achieve the best solutions. Therefore the quality of the solution is improved, and the whole system robustness is enhanced. The algorithm has been successfully integrated into our simulated humanoid robot system which won the fourth place of RoboCup2008 World Competition. The results of the proposed algorithm are found to be satisfactory.     

Mining Web navigation patterns with a path traversal graph

Understanding the navigational behaviour of website visitors is a significant factor of success in the emerging business models of electronic commerce and even mobile commerce. However, Web traversal patterns obtained by traditional Web usage mining approaches are ineffective for the content management of websites. They do not provide the big picture of the intentions of the visitors. The Web navigation patterns, termed throughout-surfing patterns (TSPs) as defined in this paper, are a superset of Web traversal patterns that effectively display the trends toward the next visited Web pages in a browsing session. TSPs are more expressive for understanding the purposes of website visitors. In this paper, we first introduce the concept of throughout-surfing patterns and then present an efficient method for mining the patterns. We propose a compact graph structure, termed a path traversal graph, to record information about the navigation paths of website visitors. The graph contains the frequent surfing paths that are required for mining TSPs. In addition, we devised a graph traverse algorithm based on the proposed graph structure to discover the TSPs. The experimental results show the proposed mining method is highly efficient to discover TSPs.     

小波法的网络流量奇异谱估计

网络流量整形、调度、异常检测、管理与控制及保障QoS需求等都需要了解业务流的局部变化特性.本文给出离散小波及其模极大值的网络流量奇异谱估计算法及影响因素,并通过真实的网络业务数据对算法进行了评估和比较.实验结果表明,两种方法的奇异谱估计能有效刻画网络业务流的局部变化特征,并且能通过奇异谱特征参数之间的差别描述不同业务流之间的差异性,也表明了在一定条件下,离散小波模极大法更加优越.     

基于监督分类的震后高分辨率影像倒塌房屋快速识别

针对监督分类中样本设计与选取、关键特征提取两个关键环节,设计了多种不同样本提取方法和多种典型特征参数组合,对海地震后高分辨率影像倒塌房屋快速提取进行分析研究。结果表明,以倒塌样本与屋角样本作为训练样本,以灰度均值和灰度共生矩阵逆差矩作为参数组合,能够保证较好提取精度的同时,最大限度减少人工样本选取工作量,提高倒塌房屋快速提取效率。最后以该分类方法对玉树震后高分辨率影像的倒塌房屋进行自动识别,识别结果良好,进一步检验了该分类方法的有效性。