約束解方法 的英文怎麼說

中文拼音 [yāoshùjiěfāngfǎ]
約束解方法 英文
constrained-solution method
  • 約 : 約動詞[口語] （用秤稱） weigh
  • 束 : Ⅰ動詞1 （捆; 系） bind; tie 2 （控制; 約束）control; restrain Ⅱ量詞（用於捆在一起的東西） bundle;...
  • 解 : 解動詞（解送） send under guard
  • 方 : Ⅰ名詞1 （方形; 方體） square 2 [數學] （乘方） involution; power 3 （方向） direction 4 （方面） ...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  • 約束 : keep within bounds; restrain; bind; bound; boundage;tie; restraint; restriction; engagement; repr...
  • 方法 : method; means; way; technique; process; procedure; plan; device; recipe; fashion; tool; maneuver
  1. We analyze the assembly model and propose a mathematics model and tree - representing model of the assembly who not only has a small data size, but also can be manipulated easily. this thesis not only gives the virtual representing concept the instance representing one, but also defines the concept of assembly constraint such as coupling, being alignment, being coaxial and being equidirectional. based on such concepts, a revised newton - raphson iterative algorithm is proposed, which can deal with the singularity and ill - condition of jacobi matrix

    首先分析了裝配體的模型問題，提出了裝配體的數學模型及樹形式表示的裝配體表示模型，模型具有數據量小、操作簡單的優點：文章對所涉及的約束諸如耦合、對齊、同軸、同向的裝配體位置描述概念進行了定義，引入了裝配約柬概念，從而提高了裝配設計效率；在此基礎上，文章討論了裝配約束的求解方法，提出了newton rapson迭代法的改進演算法，使得系統能更好地處理jacobi矩陣的奇異和病態的情形。
  2. The numerical algorithm of solving the adjoint equations for different design cases have been developed by using finite volume methodology which is usually used to solve the flow governed equation. it includes the some important aspects, such as flux formulation, wall and far - field boundary treatment methodology, dissipative term formulation, etc. after the solution of the adjoint equations is obtained, the derivatives of the cost function with respect to all the design variables can be evaluated with the same operation. this can yields a significant saving over the other gradient - based techniques when there are many design variables

    （ 3 ）進行了應用控制理論和三維歐拉方程的機翼氣動反設計研究，以及有升力約束情形下機翼跨音速減阻問題研究，分別推導了相應的共軛方程及邊界條件數學表達形式，研究與發展了三維共軛方程的有限體積數值求解方法，及相應梯度公式的數值求解方法，通過對計算網格生成、流場計算、共軛方程數值求解、梯度求解和優化演算法等多方面的有效結合，成功發展了三維機翼的氣動反設計和跨音速減阻優化設計程序，成功地進行了多個設計算例研究。
  3. The ctm is suitable for the case that all e - type influentially uncontrollable subnets are state graphs, and the outstanding virtue is that the designed controller is explicit. the emm is suitable for the case that all f - type influentially uncontrollable subnets are normalized cascade petri nets, and the advantage is that control patterns can be on - line computed within polynomial times

    約束變換法適用於所有e -型影響不可控子網為狀態圖這種特殊的場合，用該方法所綜合的控制器最大的優點在於所董利達:浙江大學博士論文獲得的控制器是顯式的;特徵標識法適用於所有凡型影響不可控子網為規范化序狀petri網這種場合，用該方法設計的控制器在線運算工作量是多項式可解的。
  4. 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

    設計並實現了該特徵表示模型的數據結構。該特徵表示模型是系統各種演算法的基礎。不同於常見的用底層圖元（點、線、弧）進行設計的二維全約束求解方法，提出並實現了一種基於子圖的序列化草圖設計方法。
  5. The proposed classification method consists of two key processing stages : the improved constrained search on an interpretation tree and the following shape similarity measure computation

    所提的物體分類方法主要包括2個核心處理模塊，即改進的約束解釋樹搜索和形狀相似性度量計算。
  6. Therefore in the process of color design, when input the abstract words for describing the product color in cad environment, reference color scheme for the product color design will be acquired

    並採用基於約束的求解方法，完成了在語義空間中色彩方案表示和求解的全過程。
  7. At first every method of constraint solving is presented in this paper. through comparing the advantages and disadvantages of one method with another the method of constraint solving based geometrical constraint graph in which geometrical constraint system is expressed by graph, and which can deal with over - constraints and down - constraints is proposed

    本文首先總結了二維參數化設計中的各種約束求解方法，並權衡每種約束求解方法的利弊，提出了基於幾何約束圖的約束求解方法，此方法是用圖來表示幾何約束系統，能夠有效地處理欠約束和過約束的情況。
  8. For this reason, the thesis presents an approach based on constraint satisfaction, symbolic execution and extended finite state machines. it can analyze programs written in a subset of the c programming language

    針對上述情況，本文中提出了一種方法，它基於約束滿足問題求解方法和擴展有限狀態機上的符號執行演算法，能夠對c語言子集描述的程序進行分析。
  9. 3 、 chinese words divided syncopation technology is the difficulty of the query technique based on phrase. some divided syncopation such as mechanical matching method, feature phrase library method, restriction matrix method, syntax analysis method and comprehended syncopation method are emphasized

    對其中的幾種方法，如機械匹配法（即mm法） 、特徵詞庫法、約束矩陣法、語法分析法和理解切分法等做了詳細的比較和分析，並歸納出各自特點。
  10. This paper presents the images of circular points of the plane on which the 1d object translates, the constraints of circular points to camera intrinsic parameters, and the numerical solution to the constraints equations ( and then we obtain the camera intrinsic parameters )

    摘要給出了平移運動的一維物體所在平面的虛圓點圖像及其對攝像機內參數的約束，和約束方程的數值求解方法，從而獲得攝像機的內參數。
  11. Abstract : in this article an optimization method is applied to de sign open - type distribution networks. graph theory technology is used. its mathem at ical model considers both the investment of constructing lines and the cost of o peration. the main idea is getting the structure of tree network that meets with the technical constraint conditions and at the same time make the annual cost mi nimum. the examples of simulation show that this method is fast and effective

    文摘:將圖論優化技術應用於配電網路的優化設計，提出了一種適合於開式配電網路規劃的優化方法.所建的數學模型綜合考慮了待建線路的投資和運行費用.求解方法是以圖論中的最短路徑問題為基礎，配合以開式網路潮流演算法，並通過可行路徑的合理變換，得出滿足技術約束條件且使年計算費用取極小值的樹狀網路結構
  12. Then a method that adopts ideas of decomposition and coordination of large - scale system is put forward. it divides detecting procedure into two parts, one is to detect deadlocks in every equivalent sub - model and the other is to detect deadlocks between equivalent sub - models. the method can decrease the complexity of deadlock detecting of oohopn

    提出了oohopn模型的死鎖檢測方法，該方法將整個檢測過程分為兩部分：即首先驗證每個對象類的子模型是否是內部死鎖避免的，然後檢查對象間的同步約束；該方法提供了一種解決復雜問題的途徑。
  13. The graph - based geometric constraint solving method proposed by c. m. hoffmann is introduced and analyzed detailedly

    詳細分析了hoffmann等提出的基於圖構造方法的約束求解方法。
  14. We generated its grid surface on the fuselage or missile body according to the geometry projection relation between aerodynamic components and the bilinear interpolation approach. finally, we successfully developed a new algebra grid generation technique in virtue of the improved four - boundary interpolation. in this thesis, we put emphasis on the researches of aerodynamic inverse design and drag reduction questions for airfoil and wing using euler equations and control theory proposed by jameson

    （ 2 ）進行了應用控制理論和二維歐拉方程的翼型氣動反設計，以及有升力約束情形下翼型跨音速減阻問題研究，分別推導了相應的共軛方程及邊界條件的數學形式，並給出了相應的梯度求解公式形式，研究發展了共軛方程及梯度的數值求解方法，成功進行了多個翼型的反設計和減阻問題研究。
  15. Secondly, the problem of the curve - surface mutual transforming and smooth - finishing have been analyzed farther. for the surface intersecting problem : owing to the introduction of the boundary points, as long as the intersecting points on a certain line, the full intersecting line can be gained. the intersecting line either intersects at the boundary of the triangle surface or forms the loop ; during the course of tracking, the selecting of the pace is restricted by the curvature, the number of the gained intersecting points are not in proportion as the chord - length ; the intersecting points not only record the coordinate and store the parameter

    對兩曲面求交問題，當曲面細化足夠小時，曲面求交可近似看成曲面與平面相交問題，引進了邊界點的概念，因此只要知道交線上的任意點，就可以將跨越許多曲面片的整條交線計算出來，所求出的交線或者跨越曲面的邊界，或者形成交線環；從初始點出發跟蹤求解整條交線的過程中，步長的選擇採用了通過曲面片曲率來約束的方法，用該方法求出的交點在不同曲面片上的分佈數目不與弦長成正比；該求交方法包含了各曲面片的邊界線與交線的交點的求解，可獲得邊界交點的坐標值及其參數值。
  16. Considering high efficiency and wide range of constraint solving based on number, a method of parametric design based construct point is proposed. the method combines the advantages of two type of methods and improves the efficiency of constraint solving

    同時考慮到數值約束求解法有效率高和求解范圍廣等優點，提出了基於二維結構點的參數化設計方法，此方法是綜合了圖論方法和數值方法的混合方法，它同時具備兩種約束求解方法的優點，提高了約束求解的效率。
  17. Finally, the constraint dimensions of combined entity can be get with that formula. to prove correctness of this approach, the development system is based on autocad system, we introduced object - oriented technology including objectarx and visual c + + in the prototype system, the system achived the aim of solution the constraint dimensions of combined entity

    井以obectarx和msualch為開發工具，利用面向對象的技術、基於auocad為實現平臺，完成組合體的尺寸約束解的推理求解的實現，以對本文提出的尺寸約束解的推理求解的方法予以驗證，論證了本方法的正確性。
  18. Taking all the interval number s in the equations as optimal design variables and representing the lower and th e upper bounds of each interval number as the boundary constrain of the variable respectively, the maximum and the minimum of various components of the solution are achieved by using the constrained optimization method

    將方程組中的所有區間數都作為設計變量，區間量的變化區間作為相應的設計變量的邊界約束，運用約束優化法求出方程組解的各元素的最大值和最小值。
  19. Motivated by the practical requirements of robot path planning, a generalized constrained optimization problem gcop with not only logic and but also logic or relationships was proposed and a mathematical solution developed previously. this paper inherits the fundamental ideas of inequality and optimization techniques from the previous work, converts the obstacle avoidance problem into a semi - infinite constrained optimization problem with the help of the mathematical transformation, and proposes a direct path planning approach without cspace calculation, which is quite different from traditional methods. to show its merits, simulation results in 3d space have been presented

    他們在早期的系列研究中： 1提出了更一般的非線性優化問題generalized constrained optimization problem ，簡稱gcop ，即約束間的邏輯關系不但有「與and 」的關系，而且還有「或or 」的關系，並給出了在實際應用中可行的數學求解方法2利用了計算機圖形學中的constructive solid geometry csg方法來構建障礙物的不等式表述3將計算機cad中的插值方法與優化理論結合半無窮維優化，克服了路徑規劃問題中的局部最小值問題。
  20. Inplementation of the above in a prototype system named cacds in the first part of the thesis the general contents of computer aieded conceptual design and its status quo is inrtoduced. detailed definition of component feature model ( cfm ) and its relative operations are described in chapter 2. in chapter 3 we invited " " component feature space " as the key element in layout design, and a new constraints driven layout creation methodology, which is based on graph theory and human - computer cooperation, is discussed

    本文以國家863計劃項目? ? 「面向產品創新的計算機輔助概念設計技術的研究」為背景，以產品信息模型和求解方法為著眼點展開研究，主要貢獻在於： （ 1 ）拓展了組件特徵模型，使其可以支持概念早期設計階段的信息表達和推理； （ 2 ）提出了一種基於約束驅動，結合約束圖與人機合作的布局設計求解方法； （ 3 ）在cacd原型系統中，對上述兩點進行了實踐。
分享友人
分享到 Line

分享到臉書