一种基于支持向量机的手写汉字识别方法

本文提出了一种新的基于支持向量机手写汉字识别方法.支持向量机作为一种新的机器学习方法,由于其建立在结构风险最小化准则之上,而不是仅仅使经验风险达到最小,从而使得支持向量分类器具有较好的推广能力.本文首先讨论了支持向量机的基本原理,然后,针对支持向量机识别大类别手写汉字所遇到的特殊问题,文章进行了分析和阐述,并在此基础上,提出了基于最小距离分类器预分类的两级分类策略.最后,针对GB2312-80的1034个汉字类别的120套手写样本,进行了实验仿真.实验结果表明,本文方法的汉字识别率较距离分类器有较大提高,其中多项式核函数的支持向量分类器,识别率平均提高3.38％,表明了本文方法的有效性.     

En">Characters and Composition Factor Multiplicities for the Lie Superalgebra $${\mathfrak{g}}{\mathfrak{l}}$$ ( m / n )

The multiplicities a of simple modules L in the composition series of Kac modules V lambda for the Lie superalgebra (m/n ) were described by Serganova, leading to her solution of the character problem for (m/n ). In Serganova's algorithm all with nonzero a are determined for a given this algorithm, turns out to be rather complicated. In this Letter, a simple rule is conjectured to find all nonzero a for any given weight . In particular, we claim that for an r-fold atypical weight there are 2r distinct weights such that a = 1, and a = 0 for all other weights . Some related properties on the multiplicities a are proved, and arguments in favour of our main conjecture are given. Finally, an extension of the conjecture describing the inverse of the matrix of Kazhdan–Lusztig polynomials is discussed.     

On the Approximation of Functions on Locally Compact Abelian Groups

Questions of approximative nature are considered for a space of functions L ^p(G, ), 1 p , defined on a locally compact abelian Hausdorff group G with Haar measure . The approximating subspaces which are analogs of the space of exponential type entire functions are introduced.     

GaAs：Cr探测器中子辐照改性研究

介绍了一种新型脉冲辐射探测器以及提高其性能的一种方法,并报告了探测器性能与中子积分通量关系的实验结果。     

Parameter Inequalities for Orthogonal Arrays with Mixed Levels

An important question in the construction of orthogonal arrays is what the minimal size of an array is when all other parameters are fixed. In this paper, we will provide a generalization of an inequality developed by Bierbrauer for symmetric orthogonal arrays. We will utilize his algebraic approach to provide an analogous inequality for orthogonal arrays having mixed levels and show that the bound obtained in this fashion is often sharper than Raos bounds. We will also provide a new proof of Raos inequalities for arbitrary orthogonal arrays with mixed levels based on the same method.     

A stabilization law for two semi-infinite interacting strings of characters

We consider a Markov chain that describes the evolution of two interacting strings of symbols. The transitions probalitities of this Markov chain depend only on the rightmost symbols of both strings. The main goal of the present paper is to prove a limit theorem (stabilization law): the distribution of the rightmost symbols converges to some limit correlation function.1 Partially supported by FAPESP (2002/01501-9) and RFBR (02-01-00415)2 Partially supported by RFBR (02-01-00415)     

A localization argument for characters of reductive Lie groups

This article provides a geometric bridge between two entirely different character formulas for reductive Lie groups and answers the question posed by Schmid (in: Deformation Theory and Symplectic Geometry, Mathematical Physics Studies, Vol. 20, Kluwer Academic Publishers, Dordrecht, 1997, pp. 259-270).A corresponding problem in the compact group setting was solved by Berline et al. (Heat Kernels and Dirac Operators, Springer, Berlin, 1992) by an application of the theory of equivariant forms and particularly the fixed point integral localization formula. This article (besides its representation-theoretical significance) provides a whole family of examples where it is possible to localize integrals to fixed points with respect to an action of a noncompact group. Moreover, a localization argument given here is not specific to the particular setting considered in this article and can be extended to a more general situation.There is a broadly accessible article (Libine, A Localization Argument for Characters of Reductive Lie Groups: An Introduction and Examples, 2002, math.RT/0208024) which explains how the argument works in the case, where the key ideas are not obstructed by technical details and where it becomes clear how it extends to the general case.     

Detecting Mass Points of Representing Measures

We discuss a possibility of deciding whether measures representing a moment sequence or realizing orthogonality of polynomials have atoms. This is done on the real line and in several variables.     

The Orders of Related Elements of a Finite Field

All finite fields q (q 2, 3, 4, 5, 7, 9, 13, 25, 121) contain a primitive element for which + 1/ is also primitive. All fields of square order q ² (q 3, 5) contain an element of order q + 1 for which + 1/ is a primitive element of the subfield q. These are unconditional versions of general asymptotic results.