點線表示法 的英文怎麼說

中文拼音 [diǎnxiànbiǎoshìfǎ]
點線表示法 英文
point representation
  • 點 : Ⅰ名詞1 （液體的小滴） drop （of liquid） 2 （細小的痕跡） spot; dot; speck 3 （漢字的筆畫「、」）...
  • 線 : 名詞1 （用絲、棉、金屬等製成的細長的東西） thread; string; wire 2 [數學] （一個點任意移動所構成的...
  • 表 : Ⅰ名詞1 （外面;外表） outside; surface; external 2 （中表親戚） the relationship between the child...
  • 示 : Ⅰ動詞（擺出或指出使人知道; 表明） show; indicate; signify; instruct; notify Ⅱ名詞1 [書面語] （給...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  • 表示 : show; express; mean; indicate; expression; presentation; signifying; remark; representation
  1. Structure that represents the nz component of the vertex normal

    欄位是表示頂點法線的nz分量的
  2. Firstly, we generalize and analyze the advantages and present research of elliptic curve cryptography ; secondly, we study the basic theory of the ecc ; thirdly, we illustrate the safety of the ecc and discuss the elliptic curve key agreement scheme, elliptic curve encryption scheme and elliptic curve digital signature algorithm ; fourthly, we study fast algorithms of the multiplication and inversion multiplication of the element of in the underlying finite field f2m whose characteristic is two represented by the two basis of optimal normal basis and polynomial basis. we make improvements to the fast algorithm of the polynomial basis multiplication by hankerson and base on the experiments, we describe the properties and compare the advantages of the multiplication and inversion multiplication of the elements in f2m field under optimal normal bases and polynomial basis. results concluding from the study car be used as references in the realization of the elliptic curve cryptosystem ; fifthly, we overview the current fast algorithm of point multiplication, improve the fix base point comb algorithm, advance the speed of the whole system and remark the advantages and disadvantages of the popular algorithms based upon the experimental datas ; sixthly we realize the algorithm library of elliptic curve cryptography based on the f2m. only change slightly in our algorithm library can we realize the ecdh, eces, ecdsa based onf2m of anysize ; seventhly, we realize the ecc on two secure elliptic curves, including ecdh, eces, ecdsa

    本文首先介紹並分析了橢圓曲線密碼體制的優點及研究現狀；其次研究了橢圓曲線密碼體制的基本理論；第三，分析了橢圓曲線密碼的安全性並介紹了密鑰共享，加密，數字簽名等橢圓曲線密碼體制；第四，深入研究了特徵為2的有限域f _ 2m中的元素在多項式基和最優正規基表示下的乘法運算和乘法逆運算的快速演算法，並對hankerson等人提出的多項式基下的乘法運算的快速演算法作了改進，而且在實驗的基礎上不僅分析研究了f _ 2m域中元素在多項式基和最優正規基表示下的乘法和乘法逆運算的性能，還對這兩種基表示下的f _ 2m域中元素運算效率的優劣作了比較和研究，所得的結論可供在實現橢圓曲線密碼體制時參考；第五，研究了目前流行的計算橢圓曲線標量乘法的快速演算法，同時改進了固定基點梳形法，提高了整個系統的速度，並在實驗的基礎上分析研究了流行演算法的優劣；第六，實現了基於f _ 2m的橢圓曲線密碼體制的演算法庫，在我們的演算法庫中只需稍微改變便能實現基於任意尺寸的f _ 2m上的ecdh ， eces ， ecdsa等橢圓曲線密碼體制；第七，實現了兩條安全橢圓曲線上的橢圓曲線密碼體制，包括ecdh ， eces ， ecdsa 。
  3. First, the paper summarizes a group building csg entity and makes combination mode of csg entities clear, by abstracting building model and analyzing building graphic objects. depending on this model, the article describes topology relations of the 3d architecture model inner based on the point, line, surface and entity. finally, in the developing environment vc + +, based on the opengl techniques, 3d building model of tyut office building is implemented by csg

    首先，通過對建築模型抽取和建築圖形對象的分析，總結了一組描述建築模型的建築csg體元，揭示了建築模型csg體元之間的組合形態，提出一種基於csg的組合建模方案來構造三維建築模型；然後在此模型基礎上進行了基於點、線、面、體的表達方式描述了建築模型內部拓撲空間關系，簡要介紹了建築模型的體裝配方法；最後利用opengl技術在visualc + +下實現了工大辦公樓的csg建模實驗。
  4. In the closeup view on the lower left, also color coded by x - ray energies, the point sources have been taken out to emphasize the hot gas clouds in the central regions of the antennae

    在左下的放大圖中（仍按x射線波段的著色法表示） ，點源已被扣除，這樣就可以突出觸角星系中心區域的熱氣體雲。
  5. A new approach to parametric design is presented, which is child - graph based, and which design a 2d sketch in sequence. in this approach, the sketch is designed with simple elements such as points, segments, circles or child - graphs which is combination of above simple elements ; geometric elements is designed in sequence can implement the function of unwell defined ( less - constrain ) parametric design. 2dand 3d constrains is treated consistently

    設計並實現了該特徵表示模型的數據結構。該特徵表示模型是系統各種演算法的基礎。不同於常見的用底層圖元（點、線、弧）進行設計的二維全約束求解方法，提出並實現了一種基於子圖的序列化草圖設計方法。
  6. By successful solution of non - linear magnetic fields and revision of the program, we can reach following conclusions : in the computation of nonlinear magnetic fields, if iteration method is used, under - relaxation is necessary when amending the permeability distribution in soft magnetic materials ; and when < wp = 5 > calculating the equivalent current density in permanent magnets, under - relaxation is not a necessity ; when searching for permeability values by interpolation method on the demagnetization curve of soft magnetic materials, if a fixed saturation point is set, around this point an abrupt change of permeability values will be obtained ; this sudden change may cause a little problem in the smoothness of magnetic field distribution ; because the magnetic circuits of microwave tubes are too complicated, in the author ' s view, to describe the working state of a magnet system, the working points of magnets can not do it properly but average energy production of magnets will serve ; as to indicate the quality of a magnet system design for microwave tubes, the efficiency of magnetic energy utilization will be a very good criterion

    由此得出結論，在非線性磁場計算中：採用迭代法的情況下，在各迭代循環之間進行磁導率修正時，一個欠鬆弛迭代過程是必需的；對永磁體中的等效電流修正時可以不作欠鬆弛迭代；在純鐵的磁化曲線上指定某一個固定的磁感應強度為磁飽和值，會使得插值求出的磁導率在該磁飽和值附近有一突變，這一突變對計算結果中磁場分佈變化的光滑性稍有影響。在微波管磁系統設計中，由於微波管磁路比較復雜，作者認為磁體的工作點並不能很好地反映磁體的工作狀態，而採用平均磁能積為衡量磁體工作狀態的標準更加符合微波管磁系統的實際情況；要表示磁系統設計好壞的程度，則用磁能利用的效率為標準更好。
  7. An accelerated direct rendering algorith of isosurface for 3d data sets is presented. the problem for calculating the intersections of the ray and the bounding cells pierced by the isosurface can be viewed as the problem of sampling alonga 3d discreteray. it is shown that the algorithm is better on memory requirement and speed than traditional algorithm through its realization on pc

    提出等值面直接顯示演算法，充分利用數據空間的相關性，把體素分為邊界體素和內部體素，並採用體數據邊界表示法，降低了內存.繪制等值面時，將視線與邊界體素的求交運算轉化為對離散視線上點的掃描，避開對整個體數據空間的遍歷，從而減少了計算量。
  8. Structure that represents the nx component of the vertex normal

    欄位是表示頂點法線的nx分量的
  9. Structure that represents the ny component of the vertex normal

    欄位是表示頂點法線的ny分量的
  10. Floating - point value that represents the ny component of the vertex normal

    表示頂點法線的ny分量的浮點值。
  11. Floating - point value that represents the nz component of the vertex normal

    表示頂點法線的nz分量的浮點值。
  12. Floating - point value that represents the nx component of the vertex normal

    表示頂點法線的nx分量的浮點值。
  13. The representation of the process of simplification of dfsm is researched, the disadvantage of the linear sequential representation are pointed out, the representation of the process of simplification of dfsm called simplification tree are given, which is intuitionistic and effective

    摘要文章討論確定有限狀態機（ dfsm ）簡化過程的表示問題，指出傳統的線性順序法存在直觀性差、層次不分明、難于理解的不足，提出簡化樹法，它具有直觀、有效的特點。
  14. Two test methods are employed : one is loading the samples before thawing, and the other is loading the samples after completely thawed. the coefficient of thaw settlement as a function of granule, as a function of water, and also as a function of dry density are protracted ; besides, the consolidation coefficient of thawed samples as a function of granule, as a function of water, and as a function of dry density are protracted. we can discover from the test results that the thaw - settlement coefficient and the consolidation coefficient of thawed samples are mainly relevant to the granule, dry density and the water content they have little to do with the geology and geography factor of the frozen soils

    為了研究季節凍土區工業民用建築的基礎淺埋穩定性問題，特開展了有關季節凍土的融化壓縮特性的研究，先後在內蒙古農業大學三個比較典型的建築地點取了將近三百個試樣，在室內進行試驗，採取兩種試驗方法即先融化后壓縮試驗法和同時融化壓縮試驗法，通過對這三個不同地點的兩種不同的試驗方法的試驗結果進行對比分行，分別繪制了融沉系數與凍土的含水（冰）量、干容重以及顆粒級配的關系曲線;融化壓縮系數與凍土的含水（冰）量、干容重以及顆粒級配的關系曲線，由試驗結果發現凍土的融沉系數和融化壓縮系數都與凍土的含水量呈正向相關關系，可近似的用線性方程來表示;兩種實驗方法的總沉降量與凍土的含水量呈正向相關關系，與凍土的干容重呈反向相關關系，也可以近似的用線性方程來表示。
  15. The author ' s work gives new way, which is beneficial to real time interaction and can efficiently reduce computing time as well as data storage amount. these algorithms can find good use in numerical machining, robotics, form - position tolerance and computer graphics. ( 3 ) degree reduction for nurbs curves and surfaces by applying the theory of the best uniform approximation of chebyshev polynomials and the explicit matrix representation of nurbs curves, this thesis centers on the research of the explicit nearly best approximation of multi - degree reduction of nurbs curves

    以上關于等距曲線的幾何逼近與代數逼近的演算法改革了當前國際圖形界只能對基曲線沿法矢方向平移定距離的點作近似逼近的固定模式，創造了利於交互操作，能有效地減少計算量及數據存儲量的新方法，可在數控加工、浙江大學碩士學位論文機器人、形位公差學、計算機圖形學中獲得很好的應用（ 3 ） nurbs曲線曲面降階應用nurbs曲線的顯式矩陣表示及chebyshev多項式逼近理論，以實現nurbs曲線顯式一次性降多階的近似最佳逼近為目標進行了研究
  16. In the use of the recurrence definition and the matrix presentation of nurbs curve, the algorithm of curve is outlined from the correspondent algorithm of b - spline, concerning on the evaluating, derivative, integral, knots inserting and degree elevating

    利用nurbs曲線基函數的定義和nurbs曲線的矩陣表示，從b樣條的相關演算法出發，可解決nurbs曲線的求值、求導、求積演算法和nurbs曲線的節點、升階演算法等問題。
  17. Represents the vertex normal data

    表示頂點法線數據。
  18. The concept of otn node transmission model is introduced. the requirement of otn node transmission model is discussed. this model uses the frequency domain transmission matrix to express the otn node transport characteristics. the simplified model based on wdm and im - dd systems, the relationship between node characteristics and model parameters and measurement of model parameters are also discussed. at last a briefly discussion on how to develop the otn simulation and cad software based on our model is demonstrated

    在線性時不變的假設下，提出利用頻域傳輸矩陣來表示節點傳輸特性的方法給出了oxc和oadm兩類光傳送網節點的統一的表示根據目前通用的波分復用強度調制直接檢波系統的特點對復雜的頻域傳輸矩陣進行了簡化並對通常所關心的節點主要性能指標與模型參數的關系模型參數的測量和計算模型的設計與計算機模擬輔助設計軟體開發的銜接問題進行了討論。
  19. In the dissertation, a " fast shamir algorithm represented by five - element joint sparse form " is presented. and it is demonstrated that comparing with other similar algorithms, the total numbers of the computation of our algorithm can be saved about 10 %, in the case of 192bit key. ( 5 ) in the implementation of elliptic curve cryptosystem, one of the key steps is to design and implement the base - point choice algorithm of elliptic curve finite group

    已經證明，用本文提出的「五元聯合稀疏形式表示的shamir演算法」計算標量乘法對，在192bit的密碼體制中，其計算量比同類演算法平均減少了10兒（ 5 ）實現橢圓曲線密碼體制還有一個關鍵的步驟，就是橢圓曲線有限群基點選取演算法的設計與實現。
  20. The developments of high - speed circuits and mmic pose the problem of analyzing the circuits characterized both in time and frequency domains. a variety of mixed time - frequency methods have been developed during the last quarter century in the research of the vlsi interconnect and package analysis and nonlinear steady - state analysis. this paper examines these methods from a unified point of view. various mixed problems are formulated as circuit equations in the mixed time - frequency domain. fundamental approaches to slove the equations are given, from which all of the published mixed methods can be naturally deduced. this facilitates the comprehension of these methods and is helpful for their applications. some new ideas are proposed based on the cross reference among these different kinds of methods

    隨著高速集成電路及mmic （微波單片集成電路）的發展，提出了對時-頻混合表示電路進行分析的任務.本文用統一的觀點考察了通常屬于高速電路互連與封裝分析、非線性電路穩態響應分析兩個不同方面的混合分析問題，指出這類問題的實質是要求解一個時-頻混合的電路方程，給出了求解這一方程的基本思路，闡明了現有的各種方法是如何從這一基本思路導出的.這可為認識這些方法的本質與聯系，促進它們的應用與發展提供參考.此文還探討了某些方法之間的相互借鑒，提出了若干新的想法
分享友人
分享到 Line

分享到臉書