对偶的

This thesis is mainly about to discuss the commutativity and the algebra properties of dual Toeplitz operators, and to prove the boundedness and compactness of products of Hankel operators in the several complex variables.

本文主要研究的是多变量的对偶Toeplitz算子的交换性和代数性质，以及Hankel算子乘积的有界性和紧性。

In anti-fuzzy number space, the conjugate mapping of convex fuzzy mapping is concerned, and convexities of conjugate set and conjugate mapping of convex fuzzy mapping are proved.

在研究模糊向量空间、模糊凸集和模糊凸映射的基础上，我们研究了模糊规划的Lagrange对偶和凸模糊规划的KKT条件，并将有关结果应用到模糊线性规划和模糊二次规划的研究中。

It order to overcome the difficulties in representation of developable surface s utilizing traditional approaches,based the concept of duality between points and planes in 3D projective space, a direct explicit method of computer-aided design for developable surface s was presented.

基于三维射影空间中点和平面间的对偶性，提出了计算机辅助设计五次样条上可展曲面的一种简单且有效的方法，通过采用该方法，可利用具有B啨zier和B样条基的控制平面设计可展曲面。

By means of the dual of Said-Ball basis, the Marsden identity is got in terms of Said-Ball basis, and a degree reduction algorithm for Said-Ball curves is presented through the transform from Bezier curves to Said-Ball curves.

利用Said-Ball基函数的对偶基，得到幂基函数在Said-Ball基下的Marsden恒等式，及从Bézier曲线到Said-Ball曲线的转换。并给出Said-Ball曲线的降阶赋值算法。

Based on the usual sulotion of the problem, we give the form of dual problem of the fuzzy linear programming. Finally, we give a theorem about it.

在带模糊约束线性规划的求解方法基础上，提出了它的对偶问题的形式及相关的定理。

Relationship between the dual form and primal form of solution based on SVM method in a frameable reproducing kernel Hilbert space is studied.

在基于标架型的再生核希尔伯特空间中，研究了SVM算法下，解的对偶形式和原形式之间的关系，进而将SVM算法与最小二乘法相结合，讨论了支持向量机的半参数估计。

Considering the particularity of the road network and the demand of the shortest path algorithm for the road network information, a new method of representation and storage of the road network to enhance the real-timeness of the shortest path algorithm was proposed based on the basic idea of the dual graph representation to improve the forward star structure.

考虑实际道路网络的特殊性以及最短路径算法对路网信息的要求，运用对偶图法的基本思想对前向关联边结构进行了改进，提出了一种能够提高路径优化算法实时性的路网表达方法与数据存储结构，并用Dijkstra和A*最短路径算法进行了验证。

This paper emploies a collection of discrete and limit topological events which simulates topological changes of Delaunay diagrams,the dual graph of Voronoi diagrams,to realize maintaining Voronoi diagrams of moving points.

通过一组离散的，有限的事件序列对其对偶图Delaunay图拓扑改变过程的模拟来实现对移动点Voronoi图拓扑结构的维护。

The optimality conditions of Kuhn-Tueker and Fritz John's saddle points of vector optimization for generalized subconvex-like mapping are presented. Lagrange dual mapping and relationships among optimality conditions of saddle points, efficient and weak efficient solutions for vector and scalar optimization are established.

在拓扑向量空间框架内研究广义锥次类凸映射的向量优化，给出了广义锥次类凸映射的Kuhn-Tucker和Fritz John鞍点的最优性条件和Lagrange对偶，建立鞍点最优性条件与向量优化有效解和弱有效解之间的联系。

In addition, this paper gives the definition of the dual system. This definition can be used in the condition of independence and dependence.

另外，在结构函数定义的基础上，本文又给出了对偶结构函数的定义，这个定义对部件之间独立和相依的情况都是成立的。

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

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

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

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