查询词典 integer polyhedron

The authors present a new algorithm in this paper. Firstly, a vector pointing from one polyhedron to the other is picked. Then the authors start to find an intersection plane of one polyhedron based on the scalar product of the norm vector of the plane and the picked vector.

就这一问题，给出了一种新的算法，其思想是取一个从一个凸多面体指向另一个多面体的向量，根据两个多面体中的面与这一向量的相对位置关系来寻找相交的平面。

Polyhedron -base Structure,which consists of space-filling polyhedron models,is a new type of space structure.

多面体空间结构是一种新型的空间结构类型，基于能够填充三维空间的多面体模型而构成。

This article outlines the integer aliquot concept in the first primary theory of numbers, the basic nature, as well as some special integer divisible characteristics.

本文先概述初等数论中整数的整除概念、基本性质，以及一些特殊整数的可除性特征。

Carries on the classification to the question, analyzes each kinds of questions the explanation mentality, inquires and summarizes that it can 100 within the odd number aliquot aliquot characteristic, finally discovered that any integer can by the lowliest place digit be 1,3,7,9 aliquot integer characteristics according to the lowliest place numeric classification, each kind has certain rule.

对问题进行分类，分析各类问题的解答思路，探寻、总结出能被100以内奇数整除的整除特征，结果发现任何一个整数能被末位数字是1，3，7，9整除的整数特征可按末位数字分类，每一类都有一定的规律。

Finally, we obtain the solutions of the 0-1 Integer Programming problem. The most merit of the model is its automatization characteristic, and the model fits to solve arbitrary 0-1 Integer Programming problem having arbitrary variable element.

该模型的最大优点在于具有自动化的特点；同时，从理论上来讲，该模型适合含有任意变量的任意0-1整数规划问题的求解。

We studied the asymptotic properties of the integer part of the k-th root positive integer and gave an interesting asymptotic formula.

研究了一个关于正整数κ次根的整数部分序列的均值，并利用初等的方法得到了一个有趣的渐近公式： 3。

A verifier can be convinced that the committed number x is neither less than the integer a nor more than the integer baiter the protocol is operated only once, and hence the exact proof that x lies in the interval is achieved.

为了去掉这种方法上的重复性，通过联合运用两承诺值相等协议及CFT证明协议提出了一个证明承诺值位于特定区间的新协议，协议运行一次便可使验证者确信承诺值x位于区间中。

In the problem, there are m persons who are to be assigned to do n jobs, and the number of the persons who are assigned to do the jth job is bj, where bj is an unknown positive integer number to be calculated such that djbjej, dj and ej are known positive integer number (j=1,2,…,n) such that ∑nj=1bj=m and m≥n.

考虑一类较一般的最优指派问题：欲指派m个人做n项工作，要求每个人只做一项工作，第j项工作可以由bj个人共同去做，其中bj是待求未知数，满足dj≤bj≤ej(即ej，dj为第j项工作所需人数的上下限)及∑nj=1bj=m，dj，ej为已知常数，j=1，…，n。

In the thesis , we give combinatorial proof of some q-identities using integer partition.In the thesis some vital identities with binomial coefficient are given with their combinatorial proof, and the q-analogues of some identities are offered with corresponding combinatorial proof using integer partition.

本文给出了一些重要的二项式系数恒等式的组合证明或组合解释，并从分拆的角度给出了一些q-恒等式的组合证明，其中突出的成果是给出了平方和恒等式的一个直接的组合证明并给出了偶数平方和与奇数平方和的q-模拟及组合证明。

Common fraction :a fraction having an integer as a numerator and an integer as a denominator.

分数：一个有整数分子和整数分母的分数。

When this condition occurs, inbound replication with the source partner is stopped on the destination domain controller and event ID 2042 is logged in the Directory Services event log.

计算机密码学是研究计算机信息加密、解密及其变换的科学，是数学和计算机的交义学科，也是一门新兴的学科。

Instructions: click on the thumbnails to see a larger image, then use the left-right arrow keys to scroll through the slideshow.

使用说明：滑鼠点在小图上即可放大观赏。开启后键盘左右键可用来换照片。