查询词典 distinguished polynomial

Igusa's p-adic zeta function is associated to a polynomial f in several variables over the integers and to a prime p. It is a meromorphic function which encodes for every i the number of solutions M_i of f=0 modulo p^i.

在探究利用辐射型基底函数去解超奇异积分方程的数值解，我们选择了多重二次曲面函数和薄板型云线以及李纳德多项式去估计我们的解。

Then using polynomial as digital filter, it gains smooth curve function to depict the metatarsus region edge.

然后，由高次多项式进行数字滤波，再对滤波后的边缘曲线，利用先验知识，依据平均曲率的变化，自适应地选取不同的函数模型，提取出相应特征，自动识别边缘形状。

In this paper,a rational approximation method of the norm of parametric speed is given,which is more effective than the polynomial approximation.

文章根据等距曲线逼近的关键在于对其参数速度模的逼近，提出了对参数速度模有理逼近的2种形式，在此基础上给出了平面Bézier曲线等距曲线的逼近函数和误差估计函数，并导出了保持法矢平移方向的代数方式的等距有理逼近算法。

We have proved that there exist only one type of cubic polynomial thermal minimal surface. Some basic properties of it have been discussed and the free-selfintersect region is given. In additional, the quartic minimal surface is discussed.

在本文中我们从等温参数化出发，利用等温参数极小曲面的调和性质讨论了参数多项式极小曲面的存在性和唯一性问题，证明了三次等温参数多项式极小曲面的唯一性，给出了高次参数多项式曲面是极小曲面的一个条件，并在此基础上给出了若干高次参数多项式极小曲面的例子。

A polynomial algorithm about minimal marking of structural live Petri nets was presented. In an empty marking net, it was verified that the reproducibility can be held under operations. These results can be used in process mining.

本文还利用结构理论解决了结构活网到活系统的极小标识求解算法，并对Petri网的一类特殊性质：空标识可再生性进行了求证，解决了空标识可再生网在运算中的保持条件。

A fast algorithm for computing the linear complexity and the minimal polynomial of a binary sequence with period 2〓p〓 is proposed, and generalized one for determining the linear complexity of a sequence with period p〓q〓 over GF .

提出确定周期为2〓p〓的二元序列的线性复杂度和极小多项式的一个快速算法，并推广为计算GF上周期为p〓q〓序列的线性复杂度和极小多项式的快速算法。

In this paper, we discuss the number of the orthonormal set of exponential function in other cases. And we prove that either isn't a root of a equation of "odd" type or is even, any orthonormal set of exponential function in has at most two elements, where is the minimal primitives polynomial for.

本文讨论当ρ为其余情形时，指数型正交序列集中元素个数，证明了当ρ^(-1)不是奇数型方程的根或者其本原最小多项式g满足g为奇数时，则L^2中任何指数型正交集至多含有两个元素。

This paper begin with a review of curves and surfces modeling, then we discuss the parametric polynomial minimal surface. This is followed by a discussion of the representations of catenoids and helicoids. Next, we discuss the numeric approximations to the minimal surfaces with piecewise polygons and B-Spline surfaces.

全文安排如下首先，我们简要回顾曲面造型历史和发展现状在第二和第三章，讨论参数多项式极小曲面；在第四章讨论悬链面和螺旋面的表示；在第五章讨论极小曲面的分片线性逼近；在第六章讨论极小曲面的B-样条逼近；最后，我们对全文做简单的总结。

Minimal polynomial.

极小多项式。

A"bit-mismatch"squarer and a"digit-serial"polynomial multiplier have been designed for finite field arithmetic and the modular inverse in GF (2〓) can be calculated under the combination of the squarer and the multiplier. Based on the Montgomery method for the elliptic curve scalar multiplication, a new improved process has been put forward in the thesis.

论文改进了标量乘法Montgomery算法流程，利用寄存器间的数据交换，将0和1两种情况下的中间结果"点加一倍点"操作统一起来，简化了控制流程，使关键路径延时下降，而且减少了运算单元输入输出的连线逻辑。

Nowadays, most of research are to build a transmutative Petri Nets through adding controlling place sets, controlling arc sets and controlling policy to the basic Petri Nets, while the Controlled Petri Nets could be used to argue many controlling theory problems conveniently and to induce many logically and physically supervisory and solve the Event Feedback Controlling Problems and State Feedback Controlling Problem in DEDS supervisory theory.

目前大多数的研究表现为在变形后的受控Petri网基础上，利用各种方法求得各种逻辑型、结构型控制器，解决DEDS监控理论中的事件反馈控制问题与状态反馈控制问题。

On one hand, there are discussions with the works council and union about extension of short time working up to the end of September.

一方面，有讨论，工程理事会和联盟关于延长工作时间短至9月底。