constraint set 中文意思是什麼

constraint set 解釋
約束集合
  • constraint : n. 1. 強迫，拘束。2. 約束，壓抑，拘泥。3. 強制力。4. 緊張感[狀態]。
  • set : SET ＝safe electronic transaction 安全電子交易〈指用信用卡通過因特網支付款項的商業交易〉。n 【埃...
  1. On the premise of a given set of material parameter, structural boundary shape and condition, design variables - thickness of plate and shell, is designed to minimize the structural weight subjected to the constraint conditions. 1. for the problem with size and stress constraints, full stress design method is used to solve the sectional optimization of plate and shell structures

    在給定了板殼的材料常數、板殼結構的邊界形狀和邊界條件的前提下，確定表徵板殼厚度的設計變量，在滿足約束條件下實現結構重量最小： 1 .對于尺寸和應力約束的問題，使用滿應力方法求解。
  2. When you want to track a deadline for a specific task but do n ' t want to lock your schedule by setting an inflexible finish constraint, you can set a deadline date for the task.

    當您想通過設置「非彈性完成日期限制」跟蹤某項特定任務的期限但又不想鎖定日程時，可設置任務的期限。
  3. Although a deadline date behaves like a flexible constraint and has little impact on scheduling, this feature is useful whenever you want to set both a constraint and a deadline for a task.

    雖然期限的作用像彈性限制而且對日程排定沒什麼影響，但當您既想設置任務限制又想設置任務期限時，此項功能就很有用。
  4. In the light of the weakness of the traditional method, this thesis improves the point spread function ( psf ) of the imaging system. meanwhile, this thesis adds line process as a priori to set up several convex constraint sets

    針對傳統凸集投影估計法的缺點，本文提出了改進的點擴散函數，同時利用圖像的先驗知識，提出了加入線過程作為凸約束。
  5. Constraint checking can be set on or off

    可以將約束檢查設置為on或off
  6. Trust region methods has drawn our attention increasingly as one approximating method guarantees general convergence. its basic step is as follows : first, we set trust - region radius, and then we get a trial step produced by constraint quadratical model

    信賴域方法是近年來日益受到關注的一種新的保證演算法整體收斂性的逼近方法，信賴域方法的基本步驟是首先指定一個信賴域半徑，然後用帶約束的二次模型來確定搜索方向與步長大小。
  7. In the paper, the transmission power of section constituted by the assigned branch is seen as objective function, assigning the adjustable generators both in sending system and receiving system, assigning the faults set, including the constraint conditions such as the differences between the angles of rotor and the inertia center angel of the whole system, the thermal stability of branch and node voltage, obtaining the results by using interior - point solution and line - predominant jordan

    本文提出的考慮暫態穩定約束的可用輸電能力演算法是以指定線路組成的斷面的傳輸功率為目標函數，指定送端系統和受端系統中參考調節的發電機，指定故障集情況下，以發電機轉子相對全系統慣性中心的角度差、線路熱穩定、節點電壓等構成約束條件，採用內點法和行主元約當逐行消去法求解問題的最優解。
  8. An algorithm to resolve the coupling effect problem is proposed during the cross point assignment ( cpa ) stage. in the algorithm, the priority queue concept and the rip - up and reroute strategy are combined to control crosstalk noise caused by interconnect coupling capacitance. first, the nets are arranged into different priority queues according to their weighted sum of their length and criticality. then, the cpa problem for one queue of nets is translated into a linear assignment problem. after the assignment of one queue of nets, a post - cpa checking routine is performed to check and rip up the net pairs which violate the crosstalk noise constraint and then push them into the next queue to be reassigned. the algorithm is tested by a set of bench mark examples, and the experimental results are promising

    提出了一種在過點分配階段解決噪聲耦合效應問題的演算法.該演算法採用優先隊列同拆線重布策略相結合的方法，控制由互連線耦合電容引起的串擾噪聲.演算法中，首先按照線長和約束限制，將線網劃分到若干個優先隊列中.然後，將每個優先隊列的過點分配問題轉換為線性分配問題.在完成一個線網隊列的分配后，通過過點分配后處理過程檢查串擾約束滿足情況，對違反約束的線網對進行拆除，放入后續線網隊列進行重新分配.實驗數據表明，該演算法能夠取得好的效果
  9. Abstract : an algorithm to resolve the coupling effect problem is proposed during the cross point assignment ( cpa ) stage. in the algorithm, the priority queue concept and the rip - up and reroute strategy are combined to control crosstalk noise caused by interconnect coupling capacitance. first, the nets are arranged into different priority queues according to their weighted sum of their length and criticality. then, the cpa problem for one queue of nets is translated into a linear assignment problem. after the assignment of one queue of nets, a post - cpa checking routine is performed to check and rip up the net pairs which violate the crosstalk noise constraint and then push them into the next queue to be reassigned. the algorithm is tested by a set of bench mark examples, and the experimental results are promising

    文摘:提出了一種在過點分配階段解決噪聲耦合效應問題的演算法.該演算法採用優先隊列同拆線重布策略相結合的方法，控制由互連線耦合電容引起的串擾噪聲.演算法中，首先按照線長和約束限制，將線網劃分到若干個優先隊列中.然後，將每個優先隊列的過點分配問題轉換為線性分配問題.在完成一個線網隊列的分配后，通過過點分配后處理過程檢查串擾約束滿足情況，對違反約束的線網對進行拆除，放入后續線網隊列進行重新分配.實驗數據表明，該演算法能夠取得好的效果
  10. For problems whose objective function or constraint functions have sharp curves on their contour maps ( such as the rosenbrock ' s function which has banana shape contours ), monotonicity may cause a series of very small steps, causing a huge number of iteration to reach their solutions. by using the nonmonotone technique, we get the sequence of successful interative point which should make the objective function mono - tonically decreasing. hence, we use both trust region strategy and line search technique and make each iterate generate an acceptable trial step in interior feasible set as next interative point

    我們利用非單調技術得到使目標函數非單調下降的迭代點，因為非單調克服高度非線性化函數的求解問題，從而避免了只使用單調搜索在「峽谷」現象局部最優解被卡的情況，我們用信賴域策略和非單調線搜索技術相結合的方法，使演算法產生的迭代步落在可行域內點，同時又在信賴域內滿足接受準則。
  11. Based on the analysis of all kinds of spaces in the surgical environment of orthopaedic clinic, the set with constraint - activated functions is adopted to describe clinical spaces

    摘要在分析骨科臨床手術環境中各類空間的基礎上，用帶有約束激活函數的集合對臨床空間進行了描述。
  12. This constraint strongly influenced the design of xquery by providing a set of primitive types, a type - definition facility, and an inheritance mechanism

    該約束通過提供一組原語類型、類型定義工具和繼承機制，極大地影響了xquery的設計。
  13. Basing on the positional characteristics of double cusps produced in the track of link points of planar four - bar linkage and combining with the synthetic equation of conventional track generator, the constraint equation set for the position of track generator that could realize two cusps ; and by means of successive elimination to obtain the most simplified forms of constraint equation set

    摘要基於平面四桿機構連桿點軌跡產生雙尖點的位置特性，結合常規軌跡發生器綜合方程，建立了能實現雙尖點的軌跡發生器的位置約束方程組，並經過逐次消元，得到了約束方程組的最簡形式。
  14. 2. for the problem with size, stress and displacement constraints, the stress constraint is transformed into movable lower bounds of sizes, the displacement constraint is transformed into an approximate function which explicitly includes design variables by using mohr integral theory. a mathematical programming model of the optimization problem is set up. the dual programming of the model is approached into a quadratic programming model

    2 .對于尺寸、應力和位移約束的問題，將應力約束化為動態下限，用單位虛荷載方法將位移約束近似顯式化，構造優化問題的數學規劃模型，將其對偶規劃處理為二次規劃問題，採用lemke演算法進行求解，得到滿足尺寸、應力和位移約束條件的截面最優解。
  15. The main contributions of the dissertation are as follow : ( 1 ) the possibility of generation hexahedron mesh through tetrahedron conversion method was studied, and a set of feasible method to deal with the boundary condition of constraint and loads has been brought forward

    本文的主要工作包括如下幾個方面： （ 1 ）研究了在紫瑞cae基礎上採用四面體轉換法進行六面體網格全自動剖分的可行性並對約束和載荷的處理提出了一套可行的方案。
  16. The point here is that you don t need to get too caught up in the latest data binding fad, or use your buddy s favorite xml constraint set, or java 5. 0 s newest features

    需要指出的是，您不需要緊跟最新的數據綁定時尚，也不需要使用您的夥伴最喜歡的xml約束集，也不用關心java 5 . 0的最新特性。
  17. To ensure that these local files are used instead of the online resources, developers often change the constraint set of the xml and point the system id of the entity reference definition to the local copy of a file or downloaded resource

    要確保使用這些本地文件而不是使用在線資源，開發人員經常更改xml的約束集並將實體引用定義的系統標識指向文件或下載資源的本地副本。
  18. In this case, the definition is for two attributes that all or most elements in a constraint set should have

    在這個例子中，定義了兩個屬性，約束集中全部或大多數元素都應該具有這兩個屬性。
  19. While it would surely be possible to represent a constraint set in xml for purposes of communicating it, xml has no inherent mechanism for enforcing constraints of this sort dtds and schemas are constraints of a different, more limited sort

    雖然的確有為了溝通目的而以xml表示約束集的可能性，但是xml沒有實施這種約束的固有機制（ dtd和模式是不同的、更有限的約束種類） 。
  20. The algorithms do not use any pivotal operation, but use the generalized ( e, d ) - active constraint set to determine the generalized projection matrices. the diagonal matrix of the projection matrix is a new construction method and it is the main function to insure the finite termination

    演算法不使用任何轉軸運算，僅用（ ， ） ?積極約束集確定廣義投影陣，該投影陣中的對角陣是一種新的構造方法，它在保證演算法的有限步收斂中起十分重要的作用。
分享友人
分享到 Line

分享到臉書