求解運算 的英文怎麼說

中文拼音 [qiújiěyùnsuàn]
求解運算 英文
derivation
  • 求 : Ⅰ動詞1 （請求; 要求） ask; beg; request; entreat; beseech : 求人幫忙 ask sb a favour; ask a favou...
  • 解 : 解動詞（解送） send under guard
  • 運 : Ⅰ動詞1 （物體位置不斷變化） move; revolve 2 （搬運; 運輸） carry; transport 3 （運用） use; wield...
  • 算 : Ⅰ動詞1 （計算數目） calculate; reckon; compute; figure 2 （計算進去） include; count 3 （謀劃;計...
  • 運算 : [數學] operation; arithmetic; operating
  1. 4. an object detection method with em ( expectation maximum ) algorithm of dynamic layer representations is researched and improved. previous algorithm contains optical flow computation, affined transformation, and clustering algorithm, and it is not convenient for detecting object quickly

    4 .分析並改進了基於em （ expectationmaximum ）演算法的運動目標分層檢測演算法，早期演算法由於涉及光流場求解、仿射變換、聚類合併等復雜運算，計算量大，不適合圖像序列的快速處理。
  2. If we use exponentiation to encrypt or decrypt, the adversary can use logarithm to attack

    如果我們運用求冪運算來加密和解密，對手就可以運用對數進行攻擊。
  3. Because of the large scale of the p / g routing network in the memory chip layout, general linear equation group resolving algorithms for calculating the equivalent resistance between the nodes cannot satisfy the restrict of both memory space and running time simultaneously

    摘要由於存儲晶元版圖p / g網規模的巨大，對于計算電阻網路中節點間等效電阻問題，直接利用常規線性方程組求解演算法無法同時滿足內存空間與運行時間上的限制。
  4. The inversionless bm algorithm in rs decoder is implemented with serial mode, which avoids the inversion computation and only needs 3 finite - field multipliers. thus, the complexity of hardware implementation has been mostly reduced. a 3 - level pipe - line processing architecture is also used in the hardware and the coding circuit in rs coder is optimized by using the characteristics of the finite - field constant multiplier

    Rs解碼器的設計採用無逆bm演算法，並利用串列方式來實現，不僅避免了求逆運算，而且只需用3個有限域乘法器就可以實現，大大的降低了硬體實現的復雜度，並且因為在硬體實現上，採用了3級流水線（ pipe - line ）的處理結構。
  5. In audio robust watermark algorithm, watermark is embedded in transform domain by using the speediness, simplicity and multi - resolution of wavelet transform. when extracting watermarking, the audio is decomposed by single - level discrete 1 - d wavelet transform, and watermarking is extracted by ica based on kurtosis maximization. this method ’ s computational cost is low

    音頻水印利用小波變換快速、簡單和多解析度的特點來嵌入水印，提取的時候，先對觀測音頻文件進行一級小波分解，然後用基於最大峰值的ica方法進行水印提取，這種方法避免了其他盲源分離方法必需的求逆運算，所以計算量小。
  6. In this article, we use idea of turning dispersion into convergence and put all the well ' s points into the same unit net to think about it. and answer three questions of the distribution of well drilling by the way of searching for groups of points. fincite - step - searching underthe condition of translationg fcoordinate system or revolving coordinate system. to first question. we find two algo - rithms and make use of data that is given to find the solution. we seek coorlinate of net point is co. 361, 0. 461 ) and mostly four old well ' s points are utilized at the same time by first algorithim, which are no. 2, no, 4, no. 5, no. 10. by second algorithm, we rechon the coordinate of net point is co. 390, 0. 505 ). and that mostly four old well ' s points are utilizld which are no. 2, no. 4, no. 10. to second question, we turn it into the first question by angling awt the center of net point. we seek that mostly six old well ' s points are utilized at the same time, which are no. 1, no. 6, no. 7, no. 8, no. 9, no. 11, when net is angled 0. 78 radian. and net point is translated to ( 0. 75, 0. 076 ) ( at nwe coordinate system ). to third question, wefind a necessary and sufficient condition and affer algorithms, at last, we analyse algorithms

    運用化分散為集中的思想，把所有的井點都放在同一個單位網格內考慮.在坐標可平移、旋轉的條件下，利用尋找點群、有限步驟搜索法，對鉆井布局的三個問題進行了解答.對問題一，給出了兩個不同演算法.並對題目提供的數據進行了求解，演算法1得到的結點為（ 0 . 361 ， 0 . 461 ） ，最多有4個舊井點被同時利用，它們是第2 、 4 、 5 、 10個井點;演算法2得到的結點為（ 0 . 390 ， 0 . 505 ） ，最多有4個井點被利用，它們是第2 、 4 、 5 、 10個井點.對問題二，以結點為中心旋轉一定的角度后，歸結為問題一進行求解，求解結果為當網格傾斜角為0 . 78弧度（相對原坐標系） ，結點平移到（ 0 . 75 ， 0 . 076 ）點（在新坐標系下） ，可被同時利用的最多舊井點為6個，它們是第1 、 6 、 7 、 8 、 9 、 11個井點，對問題三，我們給出了充要條件，並給出了演算法.最後還分析了演算法的優劣性
  7. In some time - critical situation, continuous ssi is computation bottleneck of some solid modeling system. conventional approach for solving continuous ssi often uses intersection algorithm iteratively without taking the characteristic of the surface into account to simplify computation. the dissertation analyzes the intersect curve structure of continue surface, from the point of intersect curve ' s evolution, it describes the relationship between topology of offset surface intersect curve and topology transmit point ( ttp )

    等距曲面和運動曲面在cad cam領域中有著重要的應用，在一些時間敏感場合例如數控加工動態模擬，等距曲面和運動曲面等連續變化曲面求交運算已成為這些系統的計算瓶頸，連續變化曲面求交問題的通常解法是採用曲面求交演算法反復迭代計算交線，沒有考慮連續變化曲面交線之間的相似性進行求交簡化，效率上一直不能有很大的提高。
  8. The sms representation scheme allows a given specification to be decomposed into an ordered sequence of sub - sms, and attempts to match each sub - sms with one or more stored basic mechanical units. thus, the possible solutions are generated. the data structures, the decomposing and the synthesis algorithm are presented according to the established mathematical models and the data base system

    同時，結合關系型數據庫系統對運動方案設計知識庫的組織管理（包括基本變換單元信息的存儲、提取操作及數據流間的復雜關系建立） ，提出了方案設計的綜合求解演算法，實現了在計算機上進行方案設計的可計算自動求解。
  9. Based on the system engineering theory, and through detailed analysis of economic techniques of the engineering work plan examples of the common used long span steel truss structures, utilizing the sequenced layer analysis, the current paper will establish the long span engineering work plan index system. also by the fuzzy mathematical principles, it builds multi - layer fuzzy complex mathematics judgment and calculate the weight coefficient of each index by application of fuzzy power duality method ; and based upon the experts investigation method builds each index judgment matrix. finally applying the current popular update system tool - power builder 8. 0 developed the " optimization system of ( construction ) fuzzy work plan " to solve and carry out the multi - layered fuzzy combination judgment ; then step on the analysis and research on the reliability of the optimal solution for further achievement of the final objective of the fuzzy optimization in selecting the construction work plan of long - span steel truss realization

    本文以系統工程學的理論為基礎，通過工程實例對常用大跨度鋼桁架結構施工方案進行詳細的技術經濟分析，運用層次分析法建立起大跨度鋼桁架結構施工方案的指標體系，利用模糊數學原理建立了多層次模糊綜合評判數學模型，採用模糊權重二元對比法計算出各指標的權重系數，並採用專家調查法建立各指標的評判矩陣，利用目前最流行的工具系統- powerbuilder8 . 0編制了《建築施工方案模糊優選系統》求解計算，進行多層次模糊綜合評判；調整權重和隸屬度，對數學模型最優解的可靠性作了進一步的分析和研究，從而達到模糊優化選擇大跨度鋼桁架結構施工方案的最終目的。
  10. New algorithm for the transportation problem

    求解運輸問題的一種新演算法
  11. Next, according to the feature of different types of the industry chain, it is supposed that the manufacturing cost of suppliers and backward enterprises is known, with the method of the pricing of middle product, we set about the study on value attribution ? profit - distribution, and we use the regressively inductive method to find the scale of the profit - distribution. last, we use the situation of the industry chain of the data service inland and overseas to give evidence study

    然後，基於不同電信增值業務產業鏈模式的特點，假設電信增值業務產業鏈上企業的生產成本為共同知識，本文運用中間產品定價的方式，研究不同類型的產業鏈模式下電信運營商與sp商的利益分配方式，並通過逆向歸納法（動態博弈）求解計算它們的利益分配比例，為現實電信運營商的發展提供理論支持。
  12. This paper studies the method of innovative design of the scheme of hybrid turning and milling machine tool. it mainly includes the following innovative work : ( l ) a innovative scheme of the hybrid turning and milling machine tool are designed in this paper based on the study of methods of the movement - function innovation and the. design of the whole structure and the parallel mechanism theory. this scheme have the function of milling with five axis simultaneously and turning with three axis simultaneously ; ( 2 ) a design example of this machine too is given out ; ( 3 ) this paper solves the positive position solution, the inverse position solution and the passive joints solution of the fixed length 3 - prs parallel mechanism of the machine tool ; ( 4 ) simulation tests of movement function and solution methods are given out by the simulation method of virtual machine

    論文對混聯式車銑復合加工中心方案創新設計技術進行了探討研究，完成的主要創新性工作有： （ 1 ）論文在研究機床運動功能創成方法、總體結構方案設計方法和並聯機構的基礎上，設計出一種混聯式車銑復合加工中心的創成方案，該方案可以實現5軸聯動銑削加工和3軸聯動的車削加工功能； （ 2 ）給出了實現該方案的設計實例； （ 3 ）推導了該車銑復合加工中心的定桿長並聯機構3 - prs的位置逆解、位置正解和被動關節求解演算法； （ 4 ）應用虛擬樣機模擬方法進行了運動功能及求解演算法的模擬試驗。
  13. An iterative algorithm for a class of set - valued mixed variational inequalities is presented by means of resolvent operators of set - valued mappings, and the convergence of the iterative algorithm is discussed

    摘要利用集值映射的預解運算元，提出了求解一類集值混合變分不等式問題的迭代演算法，並討論了該演算法的收斂性，推廣了已有文獻的結果。
  14. We construct some new iterative algorithms with errors for solving these generalized fuzzy variational inclusions by using the resolvent operator technique for maximal - monotone mappings and prove the convergence of iterative sequences generated by the algorithms

    為了利用-極大單調映象的預解運算元技巧求解這類廣義模糊變分包含，我們建立了一些新的含誤差的迭代演算法，並證明了由這類演算法產生的迭代序列的收斂性。
  15. One is, based on answering the above open problem on a finite dimensional euclidean space by means of partially ordered theory, to research the existence of solutions, global error bounds of proximal solutions and sensitivity of parametric unique solutions and present a class of variable - parameter three - step iterative algorithms for generalized set - valued variational inclusion problems by using - resolvent operator of set - valued mapping. two is to consider the convexity, closedness and boundedness of the solution set of general set - valued variational inclusion problems and the sensitivity of the parametric solution set by means of graphical convergence theory. three is to discuss directly the existence of solutions by using analytical methods for set - valued mixed quasi - variational - like inequalities and suggest a class of direct variable - parameter three - step iterative algorithms for solving generalized set - valued variational inclusions

    研究分有三個方面：一是藉助于偏序理論在有限維歐氏空間中解決了上述公開問題，在此基礎上利用集值映射的-預解運算元，研究了廣義集值變分包含問題解的存在性、逼近解的全局誤差界、參數唯一解的靈敏性，並提出了一類變參數三步迭代演算法；二是藉助于圖收斂理論研究了一般集值變分包含問題解集的凸性、閉性和有界性以及參數解集的靈敏性；三是用分析的方法直接討論了集值混合擬類變分不等式問題解的存在性並提出了一類求解廣義集值變分包含問題的直接變參數三步迭代演算法。
  16. The key problem in apln - pddss is decision - making model, this thesis established a private logistics network model for armed police named apln, then established a series of decision - making models based on apln, include a route optimization model, a transportation problem model and a process monitor model, and implement a genetic algorithm for large scale transportation problem

    對于apln - pddss ，本文重點深入研究了系統的決策模型及其求解演算法，建立了武警物流網路模型，並建立了基於物流網路模型的運輸路徑優化模型、運輸問題模型、運輸任務控制模型等決策模型，研究並實現了一種針對大規模運輸問題的遺傳演算法。
  17. So, it is very necessary to construct uncertain parameters transportation models and solve it. this thesis based on the uncertainty theory : probability, fuzziness, rough set, from the appearance of uncertainty - - - randomness, fuzziness, roughness, together with the uncertain programming technique, and then systematically and roundly researched on the math ideology, math model, character of model and arithmetic of the uncertain multi - objective transportation problem

    論文基於不確定性理論:概率論、模糊數學、粗糙集理論，從不確定性的表現形式? ?隨機性、模糊性、粗糙性出發，採用不確定性規劃技術，較為系統和全面的研究了不確定性多目標運輸問題的目標規劃建模思想、數學模型、模型特性和模型求解演算法。
  18. First the dissertation carries out high level design of multi - object tracking and detection system based on three layers dynamic interaction system, puts forward system high level architecture, and gives introduction and analysis of system hardware and software structure, then expatiates on single - object detection and tracking algorithm including backgrounds matching and subtraction algorithm, object center algorithm etc. paper gives introduction to dynamic integration of intra - ava modules, implements single object detection and tracking

    本文首先對基於三層動態交互體系的多目標監控系統進行了總體設計，提出了系統的總體設計框架，並對系統的硬體結構和軟體結構進行了介紹和分析。然後，闡述了單運動目標入侵檢測及跟蹤演算法，其中包括基於塊匹配的背景匹配和背景差分演算法、目標中心求解演算法等，還簡要介紹了利用動態存儲器實現ava內部層各模塊的動態集成，實現了單目標的入侵檢測報警及跟蹤。
  19. Creating complex expressions such as the one in the preceding example requires a thorough understanding of the rules of operator precedence

    創建前面示例中這樣的復雜表達式要求徹底理解運算符優先級的規則。
  20. And then i will optimize the arithmetic of support vector machine, using the effective constrain method for quadratic programming, and based on the theory of chunking arithmetic in support vector machine. as the result, the optimized arithmetic ? ? single - dimension chunking arithmetic ( sdc ), is deduced. the new method will be applied on solving all the svm problem in this paper, and the result is very good

    首先，在支持向量機的求解演算法上做了優化，利用求解二次規劃的有效集方法和求解支持向量機的選塊演算法理論推導出了一元選塊演算法，並將該演算法應用於本文的所有支持向量機的求解過程中，得到了較佳的運算效果。
分享友人
分享到 Line

分享到臉書