value-based multiple software projects scheduling with genetic algorithm

Chinese Acad Sci, ISCAS Lab Internet Software Technologies

CO2 Flux Estimation by Different Regression Methods from an Alpine Meadow on the Qinghai-Tibetan Plateau

National Key Research and Development Program [2010CB833500]; National Natural Science Foundation of China [30590381]; Chinese Academy of Sciences [KZCX2-YW-432]

VGIS-COLLIDE: an effective collision detection algorithm for

Collision detection is an important component in simulation applications which are based on virtual geographic information system (VGIS). In this paper, an effective collision detection algorithm for multiple objects in VGIS, VGIS-COLLIDE, is presented. The algorithm firstly integrates existing quadtree, which is the global hierarchical structure of VGIS, with axis-aligned bounding box of object to perform the broad-phase of collision detection. After that, exact collision detection between two objects which have passed the broad-phase of collision detection is performed. The algorithm makes no assumption about input primitives or object's motion and is directly applicable to all triangulated models. It can be applicable to both rigid and deformable objects without preprocessing. The performance of the algorithm has been demonstrated in several environments consisting of a high number of objects with hundreds of thousands of triangles.

Semisupervised Dimensionality Reduction and Classification Through Virtual Label Regression

Semisupervised dimensionality reduction has been attracting much attention as it not only utilizes both labeled and unlabeled data simultaneously, but also works well in the situation of out-of-sample. This paper proposes an effective approach of semisupervised dimensionality reduction through label propagation and label regression. Different from previous efforts, the new approach propagates the label information from labeled to unlabeled data with a well-designed mechanism of random walks, in which outliers are effectively detected and the obtained virtual labels of unlabeled data can be well encoded in a weighted regression model. These virtual labels are thereafter regressed with a linear model to calculate the projection matrix for dimensionality reduction. By this means, when the manifold or the clustering assumption of data is satisfied, the labels of labeled data can be correctly propagated to the unlabeled data; and thus, the proposed approach utilizes the labeled and the unlabeled data more effectively than previous work. Experimental results are carried out upon several databases, and the advantage of the new approach is well demonstrated.

Fast Haar Transform Based Feature Extraction for Face Representation and Recognition

Subspace learning is the process of finding a proper feature subspace and then projecting high-dimensional data onto the learned low-dimensional subspace. The projection operation requires many floating-point multiplications and additions, which makes the projection process computationally expensive. To tackle this problem, this paper proposes two simple-but-effective fast subspace learning and image projection methods, fast Haar transform (FHT) based principal component analysis and FHT based spectral regression discriminant analysis. The advantages of these two methods result from employing both the FHT for subspace learning and the integral vector for feature extraction. Experimental results on three face databases demonstrated their effectiveness and efficiency.

Supervised Gaussian Process Latent Variable Model for Dimensionality Reduction

The Gaussian process latent variable model (GP-LVM) has been identified to be an effective probabilistic approach for dimensionality reduction because it can obtain a low-dimensional manifold of a data set in an unsupervised fashion. Consequently, the GP-LVM is insufficient for supervised learning tasks (e. g., classification and regression) because it ignores the class label information for dimensionality reduction. In this paper, a supervised GP-LVM is developed for supervised learning tasks, and the maximum a posteriori algorithm is introduced to estimate positions of all samples in the latent variable space. We present experimental evidences suggesting that the supervised GP-LVM is able to use the class label information effectively, and thus, it outperforms the GP-LVM and the discriminative extension of the GP-LVM consistently. The comparison with some supervised classification methods, such as Gaussian process classification and support vector machines, is also given to illustrate the advantage of the proposed method.

Correlation analysis of the structures and pK(a) values of carboxylic acids

The quantum-chemical descriptors were used for QSPR study of the structures of carboxylic acids and their pK(a) values. The algorithm of "Leaps and Bounds" regression was performed for selection of the variables. The CoMFA method was carried out for 3D-QSPR. As the introduction of the charge of oxygen atom(Q(2)), the results obtained by CoMFA were improved greatly.

The algorithm on automated aromaticity perception of molecules

It is important to detect the aromaticity of structures during the process of structure elucidation and output. In this paper, an alogrithm was proposed to detect the aromaticity of structures by the use of algorithm on ring identification. The results show that it could be used to identify most of the aromatic structure. It have been used as constraints of Expert System on Elucidation Structure of Organic Compounds(ESESOC) and a good result has been achieved.

Expert system for elucidation of structures of organic compounds (ESESOC) - Algorithm on stereoisomer generation

An algorithm for enumeration of stereoisomers due to asymmetric carbon, C=C double bond and so on has been developed. It consists of three steps. The output of stereoisomers can be represented by 2.5-dimensional connection table.

Automorphism group algorithm in computer-aided structure elucidation

It is necessary to generate automorphism group of chemical graph in computer-aided structure eluciation. In this paper, an algorithm is developed by all-path topological symmetry algorithm to build automorphism group of chemical graph. A comparison of several topological symmetry algorithm reveals that all-path algorthm can yield correct of class of chemical graph. It lays a foundation for ESESOC system for computer-aided structure elucidation.

Correlation analysis of the structures and gas-liquid chromatographic retention indices of amines

Quantitative structure-retention relationship(QSRR) was studied for amines to gas-liquid chromatography on three stationary phases of different polarities with the topological indices A(m) (A(m1), A(m2), A(m3)) and gravitational index GI. The algorithm of "Leaps and Bounds" was performed for selection of the variables. And the multi-regression and the quasi-Newton neural networks were employed for the calculation with better results.

Quantitative structure-property relationship research to the analysis of photoionization sensitivity of organic compounds in gas chromatography

The A(m) index and molecular connectivity index were used for studying the photoionization sensitivity of some organic compounds in gas chromatography. The analysis of structure-property relationship between the photoionization sensitivity of the compounds and the A(m) indices or molecular connectivity indices has been carried out. The genetic algorighm was used to build the correlation model in this field. The results demonstrate that the property of compounds can be described by both A(m) indices and molecular connectivity indices, and the mathematical model obtained by the genetic algorithm was better than that by multivariate regression analysis.