Design Pattern Mining Using Graph Matching

The identification of design pattern instances is important for program understanding and software maintenance. Aiming at the mining of design patterns in existing systems, this paper proposes a subgraph isomorphism approach to discover several design patterns in a legacy system at a time. The attributed relational graph is used to describe design patterns and legacy systems. The sub-graph isomorphism approach consists of decomposition and composition process. During the decomposition process, graphs corresponding to the design patterns are decomposed into sub-graphs, some of which are graphs corresponding to the elemental design patterns. The composition process tries to get sub-graph isomorphism of the matched graph if sub-graph isomorphism of each subgraph is obtained. Due to the common structures between design patterns, the proposed approach can reduce the matching times of entities and relations. Compared with the existing methods, the proposed algorithm is not linearly dependent on the number of design pattern graphs. Key words design pattern mining - attributed relational graph - subgraph isomorphism CLC number TP 311.5 Foundation item: Supported by the National Natural Science Foundation of China (60273075) and the Science Foundation of Naval University of Engineering (HGDJJ03019)Biography: LI Qing-hua (1940-), male, Professor, research direction: parallel computing.

Development of efficient and accurate skeletal mechanisms for hydrocarbon fuels and kerosene surrogate

In this paper,the methodology of the directed relation graph with error propagation and sensitivity analysis（DRGEPSA）,proposed by Niemeyer et al.（Combust Flame 157：1760-1770.2010）.and its differences to the original directed relation graph method are described.Using DRGEPSA,the detailed mechanism of ethylene containing 71 species and 395 reaction steps is reduced to several skeletal mechanisms with different error thresholds.The 25-species and 131-step mechanism and the 24-species and115-step mechanism are found to be accurate for the predictions of ignition delay time and laminar flame speed.Although further reduction leads to a smaller skeletal mechanism with 19 species and 68 steps,it is no longer able to represent the correct reaction processes.With the DRGEPSA method,a detailed mechanism for n-dodecane considering low-temperature chemistry and containing 2115 species and8157 steps is reduced to a much smaller mechanism with249 species and 910 steps while retaining good accuracy.If considering only high-temperature（higher than 1000 K）applications,the detailed mechanism can be simplified to even smaller mechanisms with 65 species and 340 steps or48 species and 220 steps.Furthermore,a detailed mechanism for a kerosene surrogate having 207 species and 1592 steps is reduced with various error thresholds and the results show that the 72-species and 429-step mechanism and the66-species and 392-step mechanism are capable of predicting correct combustion properties compared to those of the detailed mechanism.It is well recognized that kinetic mechanisms can be effectively used in computations only after they are reduced to an acceptable size level for computation capacity and at the same time retaining accuracy.Thus,the skeletal mechanisms generated from the present work are expected to be useful for the application of kinetic mechanisms of hydrocarbons to numerical simulations of turbulent or supersonic combustion.

Parametric message passing-based relative navigation in joint tactical information distribution system

Relative navigation is a key feature in the joint tactical information distribution system（JTIDS）.A parametric message passing algorithm based on factor graph is proposed to perform relative navigation in JTIDS.First of all,the joint posterior distribution of all the terminals＇ positions is represented by factor graph.Because of the nonlinearity between the positions and time-of-arrival（TOA） measurement,messages cannot be obtained in closed forms by directly using the sum-product algorithm on factor graph.To this end,the Euclidean norm is approximated by Taylor expansion.Then,all the messages on the factor graph can be derived in Gaussian forms,which enables the terminals to transmit means and covariances.Finally,the impact of major error sources on the navigation performance are evaluated by Monte Carlo simulations,e.g.,range measurement noise,priors of position uncertainty and velocity noise.Results show that the proposed algorithm outperforms the extended Kalman filter and cooperative extended Kalman filter in both static and mobile scenarios of the JTIDS.

Reduced Methane Combustion Mechanism and Verification,Validation,and Accreditation(VV&A)in CFD for NO Emission Prediction

In order to obtain a reduced methane combustion mechanism for predicting combustion field and pollutants accurately in CFD simulations with a lower computational cost,a reduced mechanism with 22 species and 65 steps of reactions from GRI-Mech 3.0 was obtained by direct relation graph method and sensitivity analysis.The ideal reactor calculation and VV&A(Verification,Validation,and Accreditation)in CFD were carried out using the proposed mechanism.The results showed that the proposed mechanism agrees well with the detailed mechanism in a wide range of operating conditions;the temperature field and species can be predicted accurately in CFD simulations(RANS and LES models),and the NO prediction error of an industrial gas turbine combustor outlet is less than 2×10-6.The proposed mechanism has high engineering values.

A Class of Association Schemes and Their Automorphisms

In this paper,we construct a class of association schemes by using pairs of subspaces of vector spaces and determine their full automorphism groups.