1) degenerate cuts
退化割平面
2) non-degenerate hyperplanes set
非退化超平面系
1.
Based on a refined normality criteria of Zhenhan Tu and the hyperbolicity in value distribution theory,we get some normality criteria for families of holomorphic mappings omitting non-degenerate hyperplanes set into complex projective space;some analogous results are also obtained.
基于涂振汉的一个改良的正规性准则 ,并且运用值分布理论中的一个双曲性判定 ,得到了复投射空间中去掉非退化超平面系的一个正规性定则 ,同时得到了一些相应的推
3) secant facet
切割平面
1.
In mathematics,an ellipsoidal surface can be approximated by a series of continuous secant facets,each of which passes through four corner points of corresponding grid formed by two geodetic parallels and two meridians and is taken as mapping plane.
以规则的经纬网格为单元,以每4个网格角点所构成的平面来切割并逼近椭球面,椭球面上同纬度的点子均以椭球短轴上的相应点为投影中心投影到各切割平面,采用这种类似楔形的投影方式,将减小长度投影变形的最大值,并使相邻图幅之间保持空间连续。
2.
In this projection mode, the ellipsoidal surface can be approximated mathematically by a series of continuous secant facets which are all isosceles trapezoids.
本文主要采用了两种投影方式将椭球面上的各点按经纬网格投影到相应的切割平面上：楔形投影和按各点的椭球面法线进行投影。
4) cutting plane
割平面
1.
Based on the result that a global optimal solution to linear bilevel programming occurs at an extreme point of its constraint region, we discuss the structural feature of its feasible region and propose a global convergent algorithm which make use of cutting plane technique.
利用线性双层规划的全局最优解可在其约束域的极点上达到这一性质,通过对问题可行解集合的结构进行探讨,引进一种割平面技术,提出了一个求解线性双层规划的全局收敛算法,并通过一个算例说明了算法的求解过程。
2.
In this paper, we analyze the methods from two aspects, cutting planes and branching on the basis of branch-and-cut algorithms.
本文在此方法的基础上,从割平面和分支两方面对该方法进行分析。
3.
An analytic center cutting plane method is given,which solves a linear relaxation of the dual semidefinite program in every iteration,and uses an analytic center of cutting plane as the next iteration point.
给出了半定规划的解析中心割平面算法,它可以用于求解较大规模的半定规划问题。
5) cutting plane method
割平面法
1.
Moreover,a cutting plane method of interactive linear multiple object decision which is more practical for decision process is used to solve the model.
利用更接近于实际决策过程的交互式线性多目标决策的割平面法对模型求解 ,给出了计算实例与分析 。
2.
The experimental result show that they are better than the Gomory cutting plane method on the average.
结果表明：总体而言，它们都优于Gomory割平面法。
3.
In the paper gives a way for a kind of acceleration getting the solution, by the appropriatetransformation to the gomory condition of cutting plane method that solved integral linear program-ming problem.
通过对解整数规划问题的割平面法中Gomory约束适当交换,给出一种加速获解的办法。
6) plane segmentation
平面分割
1.
Considering the features of 3D modeling, the parallel algorithm of plane segmentation was designed and implemented, and some important problems were discussed, such as the ways of data distributing and communication in processors.
针对三维建模的特点,设计和实现了平面分割的并行算法,重点阐述了并行算法中各进程的数据分配和通信方式等关键问题。
补充资料：表示的退化系列
表示的退化系列
degenerate series of representations
表示的退化系列【血群班”扭淡对.ofre哪，幽山出;。upo糊eoua，c印二nPe八eTa.几e一益」 半单Lle群G的由其非极小抛物子群P的特征标诱导的表示集.设n为基础根系，使得G的BOrel子群B的Lie代数由Ca比现子代数及所有根向量气恤<0)生成.所有包含B的抛物子群尸和n的所有子系集几Cn之间存在一个一一对应;当n。非空时尸铸B，群尸的Lie代数由〔妞d近n子代数，气仁<0)及气位‘几)生成.设尸在函数类C的(G)中的特征标x诱导的群G的表示为兀饮).存在特征标x，使得二勿能扩充为群‘在刀(Z)上的酉表示，这里Z为G的子群，其Lie代数由向量气仁>0，:诺勾生成;这里人是几的加性包.这类表示称为表示的基本退化系列中的表示.表示的补退化系列可用二功中其他标量积扩充二叻(关于x的某些值)而得到，群G“SL伪，C)表示的退化系列中的表示是不可约的.
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条