场源基本微元的对称性与场的性质

直接由标量基本微元（点源）和矢量基本微元（电流元等）的对称性和两个基本假设讨论基本微元产生的场矢量的性质。     

Vector-Orthogonality and Lanczos-Type Methods

A method for solving a linear system is defined. It is a Lanczos-type method, but it uses formal vector orthogonality instead of scalar orthogonality. Moreover, the dimension of vector orthogonality may vary which gives a large freedom in leading the algorithm, and controlling the numerical problems. The ideas of truncated and restarted methods are revisited. The obtained residuals are exactly orthogonal to a space of increasing dimension. Some experiments are done, the problem of finding automaticaly good directions of projection remains partly open.     

基于SVM局部后验概率融合方法研究

研究了基于支持向量机的后验概率的应用,提出了对样本集进行分解,以产生局部后验概率,根据模式的稳健性对局部后验概率进行凸组合融合的方法.     

Dual frames in connected with generalized sampling in shift-invariant spaces

The aim of this article is to derive stable generalized sampling in a shift-invariant space by using some special dual frames in L²(0,1). These sampling formulas involve samples of filtered versions of the functions in the shift-invariant space. The involved samples are expressed as the frame coefficients of an appropriate function in L²(0,1) with respect to some particular frame in L²(0,1). Since any shift-invariant space with stable generator is the image of L²(0,1) by means of a bounded invertible operator, our generalized sampling is derived from some dual frame expansions in L²(0,1).     

A result on sets,with applications to vector optimization

In this paper there is stated a result on sets in ordered linear spaces which can be used to show that some properties of the sets are inherited by their convex hulls under suitable conditions. As applications one gives a characterization of weakly efficient points and a duality result for nonconvex vector optimization problems.     

基于支持向量机的肤色滤波器

为了探测图像中的肤色像素，提出了一种新的方法-支持向量机（SVM：Support Vector Machine）方法.它是一种基于肤色的非特定人的面部定位方法，是非接触人机交互技术和机器视觉中的一个重要内容.实验结果表明，采用支持向量机方法较传统人工神经网络方法不仅有更高的探测准确性，而且具有更好的推广性能.由于SVM采用结构风险最小化（SRM：Structural Risk Minimization）准则，在最小化训练误差（经验风险）的同时，尽量缩小模型预测误差的上界，从而使模型有更好的泛化能力.     

Broadband Analysis of Holographic Power Combining Circuits

Holography is a promising technique for power combining applications in the frequency range of short millimeter and submillimeter waves. In this paper, quasi-optical holographic power combining circuits are investigated. An equivalent network is utilized which rigorously models horn arrays and biperiodic dielectric structures in order to design computer-generated holograms. We apply the network model to a 5-element quasi-optical power combiner and demonstrate its capability. The hologram is designed for 150 GHz and has an efficiency of 92.5 % with a 90 % bandwidth of 5.3 %. With the aid of a broadband waveguide power divider and a vector field measurement system, the circuit is analyzed.     

Cooperative games of choosing partners and forming coalitions in the marketplace

Two games of interacting between a coalition of players in a marketplace and the residual players acting there are discussed, along with two approaches to fair imputation of gains of coalitions in cooperative games that are based on the concepts of the Shapley vector and core of a cooperative game. In the first game, which is an antagonistic one, the residual players try to minimize the coalition's gain, whereas in the second game, which is a noncooperative one, they try to maximize their own gain as a coalition. A meaningful interpretation of possible relations between gains and Nash equilibrium strategies in both games considered as those played between a coalition of firms and its surrounding in a particular marketplace in the framework of two classes of n-person games is presented. A particular class of games of choosing partners and forming coalitions in which models of firms operating in the marketplace are those with linear constraints and utility functions being sums of linear and bilinear functions of two corresponding vector arguments is analyzed, and a set of maximin problems on polyhedral sets of connected strategies which the problem of choosing a coalition for a particular firm is reducible to are formulated based on the firm models of the considered kind.     

Solutions in Sobolev spaces of vector refinement equations with a general dilation matrix

In this paper, we present a necessary and sufficient condition for the existence of solutions in a Sobolev space W_p^k(ℝ^s) (1≤p≤∞) to a vector refinement equation with a general dilation matrix. The criterion is constructive and can be implemented. Rate of convergence of vector cascade algorithms in a Sobolev space W_p^k(ℝ^s) will be investigated. When the dilation matrix is isotropic, a characterization will be given for the L_p (1≤p≤∞) critical smoothness exponent of a refinable function vector without the assumption of stability on the refinable function vector. As a consequence, we show that if a compactly supported function vector φ∈L_p(ℝ^s) (φ∈C(ℝ^s) when p=∞) satisfies a refinement equation with a finitely supported matrix mask, then all the components of φ must belong to a Lipschitz space Lip(ν,L_p(ℝ^s)) for some ν>0. This paper generalizes the results in R.Q. Jia, K.S. Lau and D.X. Zhou (J. Fourier Anal. Appl. 7 (2001) 143–167) in the univariate setting to the multivariate setting. Dedicated to Professor Charles A. Micchelli on the occasion of his 60th birthday Mathematics subject classifications (2000) 42C20, 41A25, 39B12. Research was supported in part by the Natural Sciences and Engineering Research Council of Canada (NSERC Canada) under Grant G121210654.     

赋权矩阵及其性质

本文给出了以S为行权和向量的权矩阵类T_＋(S)中每个权矩阵都可逆的一个充要条件．