外代数上复杂度为2的Koszul模

本文对外代数上复杂度为2的不可分解循环Koszul模M的极小投射分解进行了分析，构造出了基映射对应的矩阵的一种标准形式，进而刻划出了其合冲ΩM的滤链结构．     

The computational complexity of basic decision problems in 3-dimensional topology

We study the computational complexity of basic decision problems of 3-dimensional topology, such as to determine whether a triangulated 3-manifold is irreducible, prime, ∂-irreducible, or homeomorphic to a given 3-manifold M. For example, we prove that the problem to recognize whether a triangulated 3-manifold is homeomorphic to a 3-sphere, or to a 2-sphere bundle over a circle, or to a real projective 3-space, or to a handlebody of genus g, is decidable in nondeterministic polynomial time (NP) of size of the triangulation. We also show that the problem to determine whether a triangulated orientable 3-manifold is irreducible (or prime) is in PSPACE and whether it is ∂-irreducible is in coNP. The proofs improve and extend arguments of prior author’s article on the recognition problem for the 3-sphere.      

On the Locally Polynomial Complexity of the Projection-Gradient Method for Solving Piecewise Quadratic Optimisation Problems

This paper proposes a method for solving optimisation problems involving piecewise quadratic functions. The method provides a solution in a finite number of iterations, and the computational complexity of the proposed method is locally polynomial of the problem dimension, i.e., if the initial point belongs to the sufficiently small neighbourhood of the solution set. Proposed method could be applied for solving large systems of linear inequalities.     

On estimating model complexity and prediction errors in multivariate calibration: generalized resampling by random sample weighting (RSW)

The present paper focuses on determining the number of PLS components by using resampling methods such as cross validation (CV), Monte Carlo cross validation (MCCV), bootstrapping (BS), etc. To resample the training data, random non‐negative weights are assigned to the original training samples and a sample‐weighted PLS model is developed without increasing the computational burden much. Random weighting is a generalization of the traditional resampling methods and is expected to have a lower risk of getting an insufficient training set. For prediction, only the training samples with random weights less than a threshold value are selected to ensure that the prediction samples have less influence on training. For complicated data, because the optimal number of PLS components is often not unique or readily distinguished and there might exist an optimal region of model complexity, the distribution of prediction errors can be more useful than a single value of root mean squared error of prediction (RMSEP). Therefore, the distribution of prediction errors are estimated by repeated random sample weighting and used to determine model complexity. RSW is compared with its traditional counterparts like CV, MCCV, BS and a recently proposed randomization test method to demonstrate its usefulness. Copyright © 2010 John Wiley & Sons, Ltd.     

Organocatalytic Tandem Reaction to Construct Six‐Membered Spirocyclic Oxindoles with Multiple Chiral Centres through a Formal [2+2+2] Annulation

An efficient tandem reaction for the asymmetric synthesis of six‐membered spirocyclic oxindoles has been successfully developed through a formal [2+2+2] annulation strategy. The amine‐catalysed stereoselective Michael addition of aliphatic aldehydes to electron‐deficient olefinic oxindole motifs gave chiral C3 components, which were further combined with diverse electrophiles (activated olefins or imines) to afford spirocyclic oxindoles with versatile molecular complexity (up to six contiguous stereogenic centres, high diastereo‐ and enantioselectivities).     

Wavelet formulation of the polarizable continuum model

The first implementation of a wavelet discretization of the Integral Equation Formalism (IEF) for the Polarizable Continuum Model (PCM) is presented here. The method is based on the application of a general purpose wavelet solver on the cavity boundary to solve the integral equations of the IEF‐PCM problem. Wavelet methods provide attractive properties for the solution of the electrostatic problem at the cavity boundary: the system matrix is highly sparse and iterative solution schemes can be applied efficiently; the accuracy of the solver can be increased systematically and arbitrarily; for a given system, discretization error accuracy is achieved at a computational expense that scales linearly with the number of unknowns. The scaling of the computational time with the number of atoms N is formally quadratic but a N^1.5 scaling has been observed in practice. The current bottleneck is the evaluation of the potential integrals at the cavity boundary which scales linearly with the system size. To reduce this overhead, interpolation of the potential integrals on the cavity surface has been successfully used. © 2009 Wiley Periodicals, Inc. J Comput Chem, 2010     

Fisher information description of the classical-quantal transition

We investigate the classical limit of the dynamics of a semiclassical system that represents the interaction between matter and a given field. The concept of Fisher Information measure (F) on using as a quantifier of the process, we find that it adequately describes the transition, detecting the most salient details of the changeover. Used in conjunction with other possible information quantifiers, such as the Normalized Shannon Entropy (H) and the Statistical Complexity (C) by recourse to appropriate planar representations like the Fisher Entropy (F×H) and Fisher Complexity (F×C) planes, one obtains a better visualization of the transition than that provided by just one quantifier by itself. In the evaluation of these Information Theory quantifiers, we used the Bandt and Pompe methodology for the obtention of the corresponding probability distribution.     

Solving the logit-based stochastic user equilibrium problem with elastic demand based on the extended traffic network model

This paper proposes a novel extended traffic network model to solve the logit-based stochastic user equilibrium (SUE) problem with elastic demand. In this model, an extended traffic network is established by properly adding dummy nodes and links to the original traffic network. Based on the extended traffic network, the logit-based SUE problem with elastic demand is transformed to the SUE problem with fixed demand. Such problem is then further converted to a linearly constrained convex programming and addressed by a predictor–corrector interior point algorithm with polynomial complexity. A numerical example is provided to compare the proposed model with the method of successive averages (MSA). The numerical results indicate that the proposed model is more efficient and has a better convergence than the MSA.     

二阶数乘问题的一个最优算法

研究一个有趣的组合优化问题——二阶数乘问题.问题描述如下：给定n≥2个正整数a_1,a_2,…,a_n,设π为{1,2,…,n}的一个置换,表示该问题的一个解,试图找到一个置换π以至∑_（i=1）~n a_（π_i）a_（π_（i＋1））最小,在这里π_（n＋1）=π_1.给出了一个算法复杂度为O（n log n）的最优算法.