intersection process 中文意思是什麼

intersection process 解釋
交割過程
  • intersection : n. 1. 橫斷,橫切;交叉,相交。2. 【數學】交集。3. 交點,交叉線,十字路口。4. 邏輯乘法。
  • process : n 1 進行,經過;過程,歷程;作用。 2 處置,方法,步驟;加工處理,工藝程序,工序;製作法。3 【攝影...
  1. The fourth chapter outlines mathematic thinking method ' s meaning, explores a little understanding of mathematic thinking method ' s process teaching, and commentates its merits by the examples of " the teaching of mathematic inductive method " and " the teaching of intersection "

    第四章簡述了數學思想方法的含義,探討了對數學思想方法進行過程教學的若干認識,並以「數學歸納法的教學」 、 「交集的教學」為例闡述了對數學思想方法進行過程教學的好處。
  2. 4 - intersection theory in point set topology is cited into time domain and topological relation between several temporal forms are analyzed in detail. besides, the paper uses temporal topological relation to describe cadastral changing process particularly

    把點集拓撲學中的四元組理論引用到了時間域中,詳細地分析了幾種時間形式之間的拓撲關系,用四元組描述的時態拓撲關系對地籍變更過程進行了詳細的描述。
  3. This is a heuristic strategy. it can reduce the intersection tests need to be computed between bounding volumes by tracing the traverse process in previous time to gain traverse path in current time. the correctness and validity of collision detection can be guaranteed by maintaining the tracing list

    這是一個啟發式的策略,通過跟蹤國防科學技術大學研究生院學位論文上一時間采樣點對包圍盒樹的遍歷過程,確定當前時間采樣點的遍歷路徑,從而有效地減少了遍歷過程中包圍盒相交測試的次數,提高了演算法效率,同時通過對跟蹤表的維護,保證了碰撞檢測的正確性和有效性。
  4. Measurements for the following anatomical structures were obtained with the aid of a microscope, the distance between mastoid process and transverse process of the atlas, occipital condyle, and superior lateral loop ; the distances between the midline and the v3 at three levels : 1 ) the distal ( dural ) ring ; 2 ) the intersection with the anterior ramus of the c - 2 ; and 3 ) the upper level of the transverse foramen of the atlas ; the diameter of v3h at the origin of the muscular artery and at the sites of penetrating the dural ring ; the width of the v3 at the intersection with the anterior ramus of the c - 2 and at the sites of penetrating the transverse foramen of the atlas

    V _ 3h和v _ 3v各有兩個分支: v _ 3h分出肌動脈支和腦膜后動脈支; v _ 3v分出肌動脈支和根肌動脈支,第一、二脊神經發出的前後支分別與它們又毗鄰關系。通過手術顯微鏡測量下述解剖結構:乳突尖與環椎橫突尖、枕髁外側緣、 v _ 3上外側袢的距離;椎動脈v _ 3段在穿硬膜環、與第二頸神經前支交叉、環椎橫突孔上緣三處與中線的距離; v _ 3h在發出肌支處和穿硬膜天渾醫科大學碩士研究主學位論文環處的直徑; v3v在與第二頸神經前支交叉處和穿環椎橫突孔處的直徑。
  5. This kind of product applies to elevators 、 hospitals 、 an intersection 、 factories etc., avoiding any interference to the process of monitoring the image from any kind of furious electromagnetic signal and electric waves signal

    本產品主要適用於電梯、醫院、路口、廠區等各種環境,防止監視視頻傳輸過程中受到各種強烈電磁信號及電波信號(如電機、馬達等大功率的瞬間啟動電流干擾等)對視頻信號的干擾。
  6. This paper emphatically researched the problem how to calculate the intersection point between workpiece that rotated with variational angle velocity and milling cutter that moved with complicated track and rotated with high speed. furthermore it adopted the discrete curve surface method for every milling cutter, and treated image frame as the control parameter of position of milling cutter during the intersection calculation process, so the algorithm of intersection between workpiece and milling cutter was obtained. the paper also discussed further three - dimension graphic problem of manufacture process

    文中對做變角速度運動的工件和運動軌跡復雜的高速自轉中的銑刀求交問題進行了重點研究,採用將銑刀上的每個刀尖劃出的曲面離散化的方法,以圖像顯示的幀數作為求交計算過程的銑刀位置的控制參量,得出了銑刀與工件的求交演算法。
  7. Finding intersections among 2d curves is a basic problem in cad / cg, and widely used in the fields of intelligent information systems, such as gis, image process, etc. it ' s difficult to find curve intersection directly

    二維曲線求交是計算機輔助設計與圖形學中的一個基本問題,在gis 、圖像處理等智能信息系統領域具有十分廣泛的應用。
  8. A new data storage structure is designed to resolve the difficulty in arrangement of unorderly intersection points and accelerate the measuring process during curvilinear distance between two points measuring

    本文在實現空間兩點間曲線距離的測量時,設計了一種新的數據存貯結構,解決了雜亂交點的排序這一難題,提高了測量速度。
  9. In this paper, i will present some algorithms of polyhedral visual hull reconstruction : ( 1 ) polyhedral v isual h ull generation a igorithm b ased one dge - pool - searching, which constrains the 3 - d intersections into the 2 - d planes intersection via the epipolar theory to reduce the complexity a nd c an r educe t he t imes f or c ones t o b e p rejected o nto t he i mage p lanes, i n which we induced the index list to every points on the surface of object, and connected the related points to get sub polygons on surface and in turn get the mesh model, we replace triangulation process of disordered points cloud by edge - pool searching. ; ( 2 ) reconstruction based on degenerated - polygon - intersection, which have the following improvements on traditional bull intersection : using degenerated polygon to orga nize intersected area on cone face, which may be discontinuous ; a fast intersection algorithm of polygons on the cone face based on degenerated polygons, which is consistent between the continuous polygons and the discontinuous ones. the intersection of degenerated polygons is similar to the convergence of two ordered lists, which is comparably simple to the bull operation ; ( 3 ) reconstruction algorithm based on ray - tracing, in which all the rays that run through the vertex on silhouette of object will intersect with all the cones correspondent to other silhouette, and we have to calculate the intersection of all such line segments, the endpoints of which are considered to lie on the surface of object and we will get the point cloud on the surface of object

    同時利用共極線原理把三維計算投影到二維平面以降低求交計算的復雜度,該演算法可以減少光錐向圖像平面投影計算的次數,以邊池搜索取代散亂點集上進行的三角剖分; ( 2 )基於退化多邊形求交的多面體可見殼模型重構,系統引入退化多邊形的概念,把錐體平面的交集中不連通的部分用一個退化多邊形來表示,並引入了新的基於退化多邊形的求交演算法,與傳統多面體可見殼重構相比,該演算法有以下幾點創新:在圖像平面以退化多邊形組織投影錐體和物體輪廓的交集,把任意錐面與物體輪廓的交集歸一到一個退化多邊形;基於退化多邊形的二維平面上多邊形快速相交演算法,該演算法在一定程度上就是兩個有序鏈表的合併,大大簡化了先前的布爾求交計算; ( 3 )基於光線跟蹤的演算法,該演算法中所有通過輪廓頂點的光線和對應其它圖像輪廓的光錐進行求交計算,最後得到每次求交計算得到線段的交集,該線段的頂點就認為是物體表面點,從而得到物體表面的點雲。
  10. Education process on modern higher learning is a unit process of teaching and learning by teacher and students for the aim of indivical and social of knowledge that is a unit of multi aspects, correlation, intersection and infiltration

    摘要現代大學教學過程是教師和學生為實現知識的個體化和知識的社會化目標而共同進行的教與學相統一的過程,其功能既是多方面的,更是相互聯系,交叉滲透的統一體。
  11. We analyze the surroundings that the school - based teacher training model confronted. in the present world at the intersection of the centuries, in view of education confronted the fierce international competence, the leaders of all countries are going all out to develop the teacher training in order to improve the quality of the education. at the same time, the teacher - profession process is develop rapidly, the teacher education model leads to school - based teacher education model. part two

    本論文將校本教師培訓模式內涵界定為是整個教師培訓模式中的有機組成部分,是學校校長以校本理念為指導,通過依託校本教師發展團體,以一般教師為培訓主體,使核心教師發揮培訓主導作用,以反思性實踐為q中介,多向互動;促成學校和割幣共同支展的教師培訓運行基衣框架。
  12. The process simulation of numerically controlled machine tool is the pivotal technology of vm, and also the intersection of the modern technology such as numerical control, simulation and virtual reality technology

    而數控加工過程模擬是虛擬製造的關鍵技術之一,也是數控技術、模擬技術與虛擬現實技術等先進技術的交叉應用學科之一。
  13. The conventional ways has low efficiency, which result in the application of overlap grid in moving - grid problem, which need re - disposes the interpolating connection in every step in time direction, is very difficult considering the computational efficiency. aim at the above problem in application of overlap grid, this paper using an new manner rooting in analysissitus to put forward a “ method of distinguishing points of intersection ” and develop corresponding computational soft, which could realize the automatic and shape - independent pre - disposal process for overlap grid. to deal with the problem of low efficiency for pre - disposal process in moving - grid, this paper bring forward the “ mosaic ” method and adt method which based on the huge memory of modern computer

    對于重疊網格在動網格應用中的計算效率問題,本文通過進一步研究插值信息的高速查詢方法,提出不同於傳統演算法思路,以現代計算機大內存為基礎,用計算機物理內存空間換計算時間的」 mosaic 」方法以及應用基於二叉樹數據結構的adt ( alternatingdigitaltree )方法兩類方法,成功的將原處理時間提高了兩個數量級? ?即將網格規模在百萬量級的重疊網格預處理時間從傳統方法的耗時30 60分鐘提高到幾十秒鐘,從而成功解決了這一問題。
  14. So, with the help of the divisional envelope pitch, lots of unnecessary detection of triangles intersection wo n ' t be carried out. and it speed the process of model simplification

    與cohen的演算法相比,採用分解式包絡片來控制模型簡化誤差后,可以節省很多不必要的三角形相交判斷,大大加快了包絡構造和模型簡化的速度。
分享友人