相交的

基本解释 (translations)

intersectant

与相交的相关的网络例句 [注：此内容来源于网络，仅供参考]

We posed the concept of sufficient intersection about s(1≤s≤n) algebraic hypersurfaces in n-dimensional space and proved the dimension of polynomial space Pm(which denotes the space of all multivariate polynomials of total degree≤m) on the algebraic manifold S=s(f1,…, fs) where f1(X=0,…, f s=0denote s algebraic hypersurfaces of sufficient intersection, then gave a convenient expression for dimension calculation by using the backw ard difference operator.

给出了n维空间中s(1≤s≤n)个代数超曲面充分相交的概念，证明了n元m次多项式空间Pm在充分相交的代数流形S=s(f1，…， fs)（f1=0，…， fs=0表示s个代数超曲面）上的维数，并利用倒差分算子给出一个方便计算的表达式；构造了沿代数流形上插值适定结点组的叠加插值法；证明了在充分相交的代数流形上任意次插值适定结点组的存在性；给出代数流形上插值适定结点组的性质和判定条件。

One of two points of intersection of the Earth's axis and the celestial sphere.

地轴延线与天球相交的两点之一。

If the curve is concave, the highest curve that touches the budget constraint must be either on horizontal axis or vertical axis, and we call that "corner solution".

因为还可以把曲线再往右上方移，直到无差别曲线横轴或者纵轴相交的点刚好重合在 budget constraint上，那样才是最优。

Andwe get two results that kinematic measure of the random pairs of needles intersect inconvex body K and the random pairs of needles intersect at a point in convex body Kby calculation. Thereby, the result of geometric probability problem and its inferencesare gained.

通过计算得出针偶与凸体K相交的运动测度和针偶与凸体K相交且针偶的交点属于凸体K的运动测度这两个结果，从而解决了这一几何概率问题，并得到了相关的一些推论。

Finally, the analysis and comparison with classical models show that DDLO can precisely describe the detailed intersection of directed line objects and distinguish intersection and tangency, while HBT can only distinguish fixed 68 simple relations.

对比分析显示，与HBT等现有经典模型相比，DDLO模型能够精确描述有向线对象多次相交的细节，能区分相交与相切，而HBT模型只能分辨固定的68种简单关系。

That is, formally speaking, a representation or encoding over an alphabet ∑ of a set D is a function f from D to 2^∑* that satisfies the following condition: f(e1) and f(e2) are disjoint nonempty sets 不相交的非空子集 for each pair of distinct elements e1 and e2 in D.

形式地说，对信息对象集合 D 进行基于字母表∑的物化或编码是从 D 到 2^∑*的函数 f，并且函数 f 满足以下条件：对于 D 内任一对不相同的元素 e1 和 e2，f(e1)和 f(e2)是不相交的非空子集。

Bifurcations of Zero Crossings: The isotopy theorem [50], [1] shows that transversal intersections are structur-ally stable, i.e., that "transversal zero-crossings" are structurally stable: their topological properties do not change if the size of the filter is slightly changed.

零相交的叉路：同位定理[50]， [1]表示，横截交叉点结构地是槽枥，即，"横截零相交"结构地是槽枥：他们的拓扑学物产不改变，如果轻微地改变大小过滤器。

For a given ray and a complex scene including dense triangle meshes, this approach can cull most nonintersecting triangles by a simple rejection test that only involves triangle/plane intersection tests.

针对由稠密三角形网格组成的复杂场景，算法通过三角形和测试平面的相交判断剔除与投射光线不相交的绝大多数三角面片。

The curve begins at the point where the ellipse intersects the first radial and extends counterclockwise to the point where the ellipse intersects the second radial. A radial is a line segment drawn from the center of the ellipse to a specified endpoint on the ellipse.

曲线由椭圆与第一个径向线相交的点开始逆时针延伸到椭圆与第二个径向线相交的点（径向线是指从椭圆的中心向椭圆上给定的终点之间的一段连线）。

Given a graph G representing a network topology, and a collection T ={(s1 , t1 )...} of pairs of vertices in G representing connection request, the maximum edge-disjoint paths problem is an NP-hard problem that consists in determining the maximum number of pairs inT that can be routed in G by mutually edge-disjoint si ti paths.

由于图G代表的网络拓扑，并且收藏笔=( S1及T1期……的顶点G大代表连接请求，最大边不相交的路径问题是一个NP-hard问题，它包括确定最多偶笔可以改为G大相互边相交硅钛路径。

与相交的相关的网络解释 [注：此内容来源于网络，仅供参考]

disjoint sets：不相交的集

disjoint 不相交的 | disjoint sets 不相交的集 | disjunction 析取

disjoint sets：不相交的集;分离集

不相交的序列 disjoint sequences | 不相交的集;分离集 disjoint sets | 析取项 disjunct

disjoint sets：不相交的集Btu中国学习动力网

disjoint 不相交的Btu中国学习动力网 | disjoint sets 不相交的集Btu中国学习动力网 | disjunction 析取Btu中国学习动力网

Disjoint：不相交的

discriminant 判别式 | disjoint 不相交的 | disjoint sets 不相交的集

intersecting：相交的

intersecting parallels 井字型 | intersecting 相交的 | intersection control routine 交互控制系统

mutually disjoint events：互不相交事件

mutually disjoint 互不相交的 | mutually disjoint events 互不相交事件 | mutually disjoint subsets 互不相交子集

mutually disjoint：互不相交的

mutual information 交互信息 | mutually disjoint 互不相交的 | mutually disjoint events 互不相交事件

pairwise disjoint：两两不相交(的)

outcome 结果 | pairwise disjoint 两两不相交(的) | pairwise mutually exclusive events 两两互斥事件

pairwise disjoint：相交的

pairing 配对 | pairwise disjoint 相交的 | pairwise distinct 同的

intersectant：相交的

intersect 横断 | intersectant 相交的 | intersected 分割的