查询词典 unique factorization domain

By using the QCD factorization approach, we calculated the new physics contributions to the branching ratios of eight two-body charmless decays: B → Kπ, Kη~ After the inclusion of new physics corrections in the MSSM, the agreement between theoretical predictions and the measured values are improved.

2我们还在最小超对称标准模型下，计算了对B→KπKη~(等8个非粲强子衰变道的新物理修正。从整体上来看，新物理修正改善了理论预言和实验数据之间的符合程度。

By using the theory of factor theorem and determinant in higher Alge-bra, the factorization method of Circulant Symmetric function is given.

本文利用高等代数的因式定理理论和行列式理论，给出了轮换对称函数的因式分解方法。

Then,a new fast algorithm of the minimal norm least squares solution for linear system whose coefficients is an m×n symmetric Loewner matrix with full column rank is given by forming a special block matrix and researching the triangular factorization of its inverse.

对于工程计算中常常遇到的一类线性方程组的求解，通过构造特殊分块矩阵并研究其逆矩阵的三角分解，给出了求秩为n的m×n阶对称Loewner矩阵为系数阵的线性方程组，及极小范数最小二乘解的快速算法，该算法的计算复杂度为O+O(n2)，而一般方法的计算复杂度为O(mn2)+O(n3)。

In this paper, for m× n Loewner-type matrix or symmetric Loewner-type matrix with full column rank, we form special block matrix firstly and research their triangular factorization or of its inverse, and then get the fast algorithm of the minimal norm least squaresolution .

本文对于秩为n的m×n阶Loewner型或对称Loewner型矩阵L，通过构造特殊分块矩阵并研究其逆的三角分解或自身三角分解，进而得到了线性方程组Lx=b的极小范数最小二乘解快速算法，计算复杂度为O+O(n~2)，而一般方法的计算复杂度为O(mn~2)+O(n~3)。

A new fast algorithm of the minimal norm least squares solution for the linear system whose coefficient matrix is an m×n Loewner-type matrix with full column rank is given by forming a special block matrix and researching its triangular factorization.

通过构造特殊分块矩阵及其三角分解给出了求秩为n的m×n阶Loewner型矩阵为系数阵的线性方程组极小范数最小二乘解的快速算法，该算法的计算复杂度为O+O(n2)，而一般方法的计算复杂度为O(mn2)+O(n3)。

In Chapter three, by constructing a special partitioned matrix and studying the fast triangular factorization of its inverse matrix, we respectively give fast algorithms for the minimal norm least squares solutions of linear equations which coefficient matrices are n×m Toeplitz type matrices and Vandermonde-Loewner type matrices with full column rank.

第三章通过构造特殊分块矩阵并研究其逆矩阵的快速三角分解，分别给出了求以秩为m的n×m阶Toeplitz型矩阵和Vandermonde-Loewner型矩阵为系数阵的线性方程组极小范数最小二乘解的快速算法，并通过算例将新算法与已有的法方程组的方法和正交化方法作了比较。

In this paper, firstly the elimination tree theory is introduced in brief, and the structure of Jacobian matrix is determined by use of symbolic factorization; then by use of sparse vector method each column of lower triangular matrix L and each row of upper triangular matrix U are solved.

介绍了消去树理论，并采用符号因子分解技术确定雅可比矩阵的结构，然后采用稀疏向量法求取L阵的每行和U阵的每列。

In this paper, we introduce the algorithm of Schoof-Elkies-Atkin to compute the order of elliptic curves over finite fields. We give out a fast algorithm to compute the division polynomial f〓 and a primitive point of order 2〓. This paper also gives an improved algorithm in computing elliptic curve scalar multiplication. Using the method of complex multiplication, we find good elliptic curves for use in cryptosystems, and implemented ElGamal public-key scheme based on elliptic curves. As a co-product, we also realized the algorithm to determine primes using Goldwasser-Kilian's theorem. Lastly, the elliptic curve method of integer factorization is discussed. By making some improvement and through properly selected parameters, we successfully factored an integer of 55 digits, which is the product of two 28-digit primes.

本文介绍了计算有限域上椭圆曲线群的阶的Schoof-Elkies-Atkin算法，在具体处理算法过程中，我们给出了计算除多项式f〓的快速算法和寻找2〓阶本原点的快速算法；标量乘法是有关椭圆曲线算法中的最基本运算，本文对[Koe96]中的椭圆曲线标量乘法作了改进，提高了其运算速度；椭圆曲线的参数的选择直接影向到椭圆曲线密码体的安全性，文中利用复乘方法构造了具有良好密码特性的椭圆曲线，并实现了椭圆曲线上ElGamal公钥体制；文中还给出了利用Goldwasser-Kilian定理和椭圆曲线的复乘方法进行素数的确定判别算法；最后讨论了利用椭圆曲线分解整数的方法并进行了某些改进，在PC机上分解了两个28位素数之积的55位整数。

It is based on the difficulty of computing the discrete logarithm modulo for a composite number and the factorization problem of large integer.The size of the group signature and verification time of the group signature are equivalent to that of an individual signature.

该方案的安全性是基于求离散对数和RSA大整数因式分解的困难，其群签名长度和群签名的验证时间只相当于一般个人签名。

Uenced by lighting, expres-sion, view, and age, we apply tensor factorization to extracting multi-factor representationfor faces and propose a TF-based model for facial view estimation and an algorithm with themeasure of correlation between tensor representation and view factor.

考虑到人脸图像受光照、表情、视角、年龄等多种因素的影响，我们用张量分解方法同时提取人脸图像中的多因子表征，进而构建一个基于张量分解的人脸视角感知模型。

Vishnu entered a dark fourth dimensional dream that did not support his field or continued life.

毗瑟挐进入了一个第四密度的黑暗梦想，那里并不支持他的能量场或继续生命。

Leaders and decision-making persons use it to collect the data, including the information of unit work, handing in fee, oweing fee, prepaying fee,changing and afterpaying and account transfering of joining-insurance employee, and account paying of all kinds of insurances from hospitalization insurance institutions.The collected data is picked up, organized, switched and showed to user.

该子系统主要面向各级领导、决策分析人员；从各个医疗保险经办机构和定点医疗机构采集数据，包括在各个医疗保险经办机构处理的单位办公信息，单位缴费、欠费、预缴费信息，参保职工变更信息，参保职工增减变动信息，参保职工补缴信息，参保职工帐户划拨信息：包括各定点医疗机构处理的各险种帐户支出信息，各险种的统筹金支付信息等；将采集的数据提取，组织和转换，然后展示给用户。