An Improved Gradient Projection-based Decomposition Technique for Support Vector Machines

In this paper we propose some improvements to a recent decomposition technique for the large quadratic program arising in training support vector machines. As standard decomposition approaches, the technique we consider is based on the idea to optimize, at each iteration, a subset of the variables through the solution of a quadratic programming subproblem. The innovative features of this approach consist in using a very effective gradient projection method for the inner subproblems and a special rule for selecting the variables to be optimized at each step. These features allow to obtain promising performance by decomposing the problem into few large subproblems instead of many small subproblems as usually done by other decomposition schemes. We improve this technique by introducing a new inner solver and a simple strategy for reducing the computational cost of each iteration. We evaluate the effectiveness of these improvements by solving large-scale benchmark problems and by comparison with a widely used decomposition package.     

Numerical solution of the three‐dimensional parabolic equation with an integral condition

Developement of numerical methods for obtaining approximate solutions to the three dimensional diffusion equation with an integral condition will be carried out. The numerical techniques discussed are based on the fully explicit (1,7) finite difference technique and the fully implicit (7,1) finite difference method and the (7,7) Crank‐Nicolson type finite difference formula. The new developed methods are tested on a problem. Truncation error analysis and numerical examples are used to illustrate the accuracy of the new algorithms. The results of numerical testing show that the numerical methods based on the finite difference techniques discussed in the present article produce good results. © 2002 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 18: 193–202, 2002; DOI 10.1002/num.1040     

Anisotropic friction model of DNA electrophoresis in polymer solutions: Comparison with direct observations

The electrophoresis of DNA chains in uncrosslinked polymer solutions with a Brownian dynamics simulation with an anisotropic friction tensor was analyzed. According to the degree of anisotropy, three types of migration behavior are obtained: fluctuation without or with periodicity between U‐shaped and compact conformations, or migration with linear conformation. We found good agreement between our simulation results and the direct observations of DNA by fluorescence microscopy. © 2003 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 41: 1316–1322, 2003     

Cauchy problems for linear thermoelastic systems of type III in one space variable

The goal of the paper is to analyse properties of solutions for linear thermoelastic systems of type III in one space variable. Our approach does not use energy methods, it bases on a special diagonalization procedure which is different in different parts of the phase space. This procedure allows to derive explicit representations of solutions. These representations help to prove results for well‐posedness of the Cauchy problem, L^P–L^q decay estimates on the conjugate line and results for propagation of singularities. Copyright © 2005 John Wiley & Sons, Ltd.     

A generic view of Dantzig-Wolfe decomposition in mixed integer programming

The Dantzig-Wolfe reformulation principle is presented based on the concept of generating sets. The use of generating sets allows for an easy extension to mixed integer programming. Moreover, it provides a unifying framework for viewing various column generation practices, such as relaxing or tightening the column generation subproblem and introducing stabilization techniques.     

Shape Optimization for Semi-Linear Elliptic Equations Based on an Embedding Domain Method

We study a class of shape optimization problems for semi-linear elliptic equations with Dirichlet boundary conditions in smooth domains in ℝ². A part of the boundary of the domain is variable as the graph of a smooth function. The problem is equivalently reformulated on a fixed domain. Continuity of the solution to the state equation with respect to domain variations is shown. This is used to obtain differentiability in the general case, and moreover a useful formula for the gradient of the cost functional in the case where the principal part of the differential operator is the Laplacian. Online publication 23 January 2004.     

A computational strategy for multiscale systems with applications to Lorenz 96 model

Numerical schemes for systems with multiple spatio-temporal scales are investigated. The multiscale schemes use asymptotic results for this type of systems which guarantee the existence of an effective dynamics for some suitably defined modes varying slowly on the largest scales. The multiscale schemes are analyzed in general, then illustrated on a specific example of a moderately large deterministic system displaying chaotic behavior due to Lorenz. Issues like consistency, accuracy, and efficiency are discussed in detail. The role of possible hidden slow variables as well as additional effects arising on the diffusive time-scale are also investigated. As a byproduct we obtain a rather complete characterization of the effective dynamics in Lorenz model.     

复方单硝酸异山梨酯-阿司匹林双缓释微丸胶囊的研制(Ⅱ)

以乙基纤维素、丙烯酸树脂Ⅱ和丙烯酸树脂Ⅲ为骨架材料分别制备单硝酸异山梨酯和阿司匹林混合骨架缓释微丸，并通过包薄膜衣进一步控制药物的释放。通过测定微丸的释放度对处方工艺进行评价，选择最佳微丸灌装胶囊．胶囊中两种药物均达到良好的缓释效果。符合中国药典对缓释制剂的要求．其体外释放过程同时符合Higuchi方程和一级释药方程，R^2值均在0．995以上。     

工件带到达时间的两阶段柔性流水作业的近似算法

研究了工件带到时间的两阶段柔性流水作业的排序问题,基于求解流水作业和平行机问题的算法思想,提出两个相应的近似算法H(R)和H(MR(?)),证明了这两个算法的最坏情况性能比分别为3-1/m和2/5-1/m,讨论了界的紧性,并利用数值模拟以分析算法与最优值的近似性能比.     

On solving energy-dependent partitioned eigenvalue problem by genetic algorithm: The case of real symmetric Hamiltonian matrices

An energy-dependent partitioning scheme is explored for extracting a small number of eigenvalues of a real symmetric matrix with the help of genetic algorithm. The proposed method is tested with matrices of different sizes (30 × 30 to 1000 × 1000). Comparison is made with Löwdin’s strategy for solving the problem. The relative advantages and disadvantages of the GA-based method are analyzed