乘

In view of the existing problems of traditional resource allocating networks, a design method for RAN based on rough set and orthogonal least square was proposed. Firstly, rough set was applied to intelligent data analysis for extracting typical characteristics from the training samples, and then OLS was used to select best centers as the hidden layer nodes.

针对常用的资源分配网络存在的问题，提出了一种基于粗糙集和正交最小二乘的资源分配网络设计方法，通过粗糙集数据分析与处理提取训练样本中典型的数据特征，再结合正交最小二乘学习算法选取对输出能量贡献最大的数据中心加入到隐层节点。

In view of the existing problems of traditional resource allocating networks, a design method for RAN based on rough set and orthogonal least square was proposed. Firstly, rough set was applied to intelligent data analysis for extracting typical characteristics from the training samples, and then OLS was used to select best renters as the hidden layer nodes.

针对常用的资源分配网络存在的问题，提出了一种基于粗糙集和正交最小二乘的资源分配网络设计方法，通过粗糙集数据分析与处理提取训练样本中典型的数据特征，再结合正交最小二乘学习算法选取对输出能量贡献最大的数据中心加入到隐层节点。

This thesis discussed the recursive least square algorithm, the linear least square algorithm and recursive orthogonal least square algorithm for the RBPNNs.

文中讨论了递推最小二乘算法、线性最小二乘法和递推正交最小二乘算法用于径向基概率神经网络的训练问题。

This thesis discussed the recursive least square algorithm , M-P pseudo-inverse algorithm and recursive orthogonal least square algorithm for the RBPNNs.

文中讨论了递推最小二乘算法、M-P伪逆算法和递推正交最小二乘算法用于径向基概率神经网络的训练问题。

The algorithm has following properties: Although the merit function has the form of least squares of a system of overdetermined equations, in the Newton equation of our algorithm, only the coefficient matrix of the system of overdetermined equations is used instead of its product as in Guass-Newton method for solving the least squares problems. That is, our Newton method is more like that for the system of nonlinear equations rather than that for LSPs. The global convergence is obtained for VLCP with vertical block P_0 + R_0 matrix; The local quadratic convergence rate is proved under the condition that the solution is BD-regular; Although there is only a Newton equation in our algorithm, the finite convergence property can be shown if matrix is vertical block P— matrix (without the hypotheses of strict complementarity).

该算法具有下列特点：所构造的价值函数虽然具有超定方程组的最小二乘问题的形式，但在基此建立的Newton算法中，其Newton方程的形式更象非线性方程组的Newton法中的Newton方程，仅利用了超定方程组的系数矩阵本身的信息，避免了一般最小二乘问题的Guass-Newton法中必须计算系数矩阵的乘积的工作量；对竖块P_0+R_0矩阵的垂直线性互补问题，算法具有全局收敛性；在解是BD-正则条件下，证明了算法的局部二次收敛性；虽然算法只含一个Newton方程，但对竖块P-矩阵垂直线性互补问题，算法具有有限步收敛性。

Partial least squares regression method is adopted to realize robust regression of MLS-SVM.

利用偏最小二乘回归方法对多核最小二乘支持向量机进行了鲁棒回归。

More than 30 kinds of meshfree methods are reviewed in this paper in the light of weighted residual method, and different meshfree methods can be viewed as different forms of weighted residual method and/or with different approximation functions. Various kinds of meshfree approximate schemes are presented in detail, including moving least square approximation, kernel and reproducing kernel approximation, partition of unity approximation, radial basis approximation, radial point interpolation and natural neighbor interpolation.

详尽介绍了各种无网格近似方案(包括移动最小二乘近似、核近似和重构核近似、单位分解近似、径向基函数近似、点插值近似、自然邻接点插值近似等)和无网格法中常用的各类加权余量法(伽辽金格式、配点格式、局部弱形式、加权最小二乘格式和边界积分格式等)，并讨论了数值积分方法和边界条件的处理等问题。

We gen-eralize the holomorphic pointwise multiplier to pluriharmonic and〓-harmonic pointwise multiplier on the Bergman space.Somecharacterizations of such pointwise multipliers are gotten.

解析点乘子推广到多调和或〓调和的情形我们是在Bergman空间上做的，得出了关于Bergman空间上点乘子的一些性质。

A theorem of the alternative for the generalized subconvexlike set-valued maps is established using the separation theorem of convex sets in a Banach spaces, the concept of weak Benson proper efficient elements for a vector optimization problem is introduced, and the optimality necessary and sufficient Lagrange conditions for a vector set-valued map constrained optimization problem with the weak Benson proper efficiency is developed, with which the optimality Lagrange conditions for a nonconvex vector top-base constrained optimization of set-valued maps with the Benson proper efficiency are obtained.

刘莹 ，刘三阳，盛宝怀运用凸集分离定理对广义锥次类凸集值映射建立了一种择一性定理。引入向量优化弱Benson真有效元的概念，对带约束的非凸向量集值优化问题建立了在弱Benson真有效意义下有效元应满足Lagrange乘子型的必要及充分条件，并用这一结果建立了多目标主从非凸向量集值优化在弱Benson真有效意义下最优解的Lagrange乘子型充要条件。

In this paper, we show that when the data matrices are $2\times 2$ and $3\times 3$-dimensional, we can transfer the problem into an optimization problem with quadratic matrix inequality constraints, based on another equivalent robust optimization problem converted from the original one.

本文表明，当数据矩阵为2乘2阶，3乘3阶矩阵时，我们可以把上述问题转化成二次矩阵不等式约束的最优化问题。

In the United States, chronic alcoholism and hepatitis C are the most common ones.

在美国，慢性酒精中毒，肝炎是最常见的。

If you have any questions, you can contact me anytime.

如果有任何问题，你可以随时联系我。