A new type SVM-projected SVM

Support vector machine (SVM), developed by Vapnik et al., is a new and promising technique for classification and regression and has been proved to be competitive with the best available learning machines in many applications. However, the classification speed of SVM is substantially slower than that of other techniques with similar generalization ability. A new type SVM named projected SVM (PSVM), which is a combination of feature vector selection (FVS) method and linear SVM (LSVM), is proposed in present paper. In PSVM, the FVS method is first used to select a relevant subset (feature vectors, FVs) from the training data, and then both the training data and the test data are projected into the subspace constructed by FVs, and finally linear SVM(LSVM) is applied to classify the projected data. The time required by PSVM to calculate the class of new samples is proportional to the count of FVs. In most cases, the count of FVs is smaller than that of support vectors (SVs), and therefore PSVM is faster than SVM in running. Compared with other speeding-up techniques of SVM, PSVM is proved to possess not only speeding-up ability but also de-noising ability for high-noised data, and is found to be of potential use in mechanical fault pattern recognition.     

Irreducible Representations of Wreath Products of Association Schemes

The wreath product of finite association schemes is a natural generalization of the notion of the wreath product of finite permutation groups. We determine all irreducible representations (the Jacobson radical) of a wreath product of two finite association schemes over an algebraically closed field in terms of the irreducible representations (Jacobson radicals) of the two factors involved.     

Sum-fuzzy implementation of a choice function using artificial learning procedure with fixed fraction

In one if his paper Luo transformed the problem of sum-fuzzy rationality into artificial learning procedure and gave an algorithm which used the learning rule of perception. This paper extends the Luo method for finding a sum-fuzzy implementation of a choice function and offers an algorithm based on the artificial learning procedure with fixed fraction. We also present a concrete example which uses this algorithm.     

类锂铝复合机制产生X光激光的等离子体状态

本文从速率方程出发,讨论了类锂铝复合等离子体的激发态结构,衰减常数,反转率和小信号增益等表征介质增益特性的物理量以及它们随电子温度,电子密度和光子逃逸几率的变化。找到了进行类锂铝离子通过复合机制产生X光激光设计应创造的等离子体状态目标区域。还讨论了这些物理量随原子序数变化的定标律。     

对称正则长波方程的一个守恒差分格式

本文考虑了具有齐次边界条件的对称正则长波方程的有限差分法．构造了一个两层守恒的有限差分格式,利用离散泛函分析方法分析了格式的收敛性和稳定性,从理论上得到了收敛阶为O(h~2 τ)．数值试验表明,我们的方法是可信的．     

Three-dimensional steady supersonic duct flow using Lagrangian formulation

In this paper, numerical simulation of three-dimensional supersonic flow in a duct is presented. The flow field in the duct is complex and can find its applications in the inlet of air-breathing engines. A unique streamwise marching Lagrangian method is employed for solving the steady Euler equations. The method was first initiated by Loh and Hui (1990) for 2-D steady supersonic flow computations and then extended to 3-D computation by the present authors Loh and Liou (1992). The new scheme is shown to be capable of accurately resolving complicated shock or contact discontinuities and their interactions. In all the computations, a free stream of Mach numberM=4 is considered.This article was processed using Springer-Verlag T_EX Shock Waves macro package 1.0 and the AMS fonts, developed by the American Mathematical Society.     

On the long‐time stability of the Crank–Nicolson scheme for the 2D Navier–Stokes equations

In this article we study the stability for all positive time of the Crank–Nicolson scheme for the two‐dimensional Navier–Stokes equations. More precisely, we consider the Crank–Nicolson time discretization together with a general spatial discretization, and with the aid of the discrete Gronwall lemma and of the discrete uniform Gronwall lemma we prove that the numerical scheme is stable, provided a CFL‐type condition is satisfied. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

解初值问题y″=g(x，y)的含参数块方法

1引言对于二阶常微分方程的初值问题y″=g(x,y),y(x_0)=y_0,y′(x_0)=y_0′,x_0(?)x(?)T(1)的数值解法的研究引起人们的广泛兴趣．对于直接积分(1),自从1976年J．D．Lambert和I．A．Waston提出二阶P-稳定方法和1978年G．Dahlquist证明P-稳定常系数线性多步方法的最高相容阶不超过2的重要结论以来,截止目前,已积累了许多高于2阶的P-稳定方法．例如,修正的Numerov方法,混合法(特殊形式RK的方法),多导法,Obrechkoff方法,显式RKN方法,单隐方法和对角隐式RKN方法等(顺便指出,文献[5,16]中所说的高阶方法的相容阶均不超过4)．所有这些方法,有些相     

On error operators related to the arbitrary functions principle

The error on a real quantity Y due to the graduation of the measuring instrument may be asymptotically represented, when the graduation is regular and fines down, by a Dirichlet form on R whose square field operator does not depend on the probability law of Y as soon as this law possesses a continuous density. This feature is related to the “arbitrary functions principle” (Poincaré, Hopf). We give extensions of this property to Rd and to the Wiener space for some approximations of the Brownian motion. This gives new approximations of the Ornstein-Uhlenbeck gradient. These results apply to the discretization of some stochastic differential equations encountered in mechanics.     

一类广义的Kdv方程的显式差分解

本文考察一类具耗散的广义KdV方程组■ (gradφ(■))_x ■_(xxx)-α■_(xx) γ■ =■(x,t,■)的周期初值问题的显式差分格式．利用有界延拓法证明了该差分格式的收敛性与稳定性,并给出了算法和数值例子．