constraint graph 中文意思是什麼

constraint graph 解釋
約束圖
  • constraint : n. 1. 強迫，拘束。2. 約束，壓抑，拘泥。3. 強制力。4. 緊張感[狀態]。
  • graph : n. 1. 【數學】曲線圖；坐標圖，圖表。2. 統計曲線。vt. 用圖表表示，把…繪入圖表。n. 膠版。vt. 用膠版印刷。n. 【語言學】1. 詞的拼法。2. 表示音素的最小字母單位。
  1. 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

    本文首先總結了二維參數化設計中的各種約束求解方法，並權衡每種約束求解方法的利弊，提出了基於幾何約束圖的約束求解方法，此方法是用圖來表示幾何約束系統，能夠有效地處理欠約束和過約束的情況。
  2. Minimum - cost and minimum - time problem based on graph theory and fuzzy constraint

    利用約束滿意度解模糊線性規劃問題的方法的改進
  3. 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

    文摘:將圖論優化技術應用於配電網路的優化設計，提出了一種適合於開式配電網路規劃的優化方法.所建的數學模型綜合考慮了待建線路的投資和運行費用.求解方法是以圖論中的最短路徑問題為基礎，配合以開式網路潮流演算法，並通過可行路徑的合理變換，得出滿足技術約束條件且使年計算費用取極小值的樹狀網路結構
  4. Four approaches to geometric constraint solving, namely graph - based, rule - based, numerical computation - based and symbolic computation - based are described in detail

    對常見的4類求解方法：數值計算的方法、符號計算的方法、基於規則的方法、基於圖論的方法做了詳細的介紹。
  5. The graph - based geometric constraint solving method proposed by c. m. hoffmann is introduced and analyzed detailedly

    詳細分析了hoffmann等提出的基於圖構造方法的約束求解方法。
  6. Abstract : the feature definition and the feature classification are given firstly. then the constraint - based parametric feature model of mechanical part is set up. a graph called feature relation graph is used to represent the feature model and a dynamic linked list to build and store the model. using the oop technique, the author realized the feature model. based on the parametric feature model, the feature hierarchical parametrization is analyzed and a parametric example is also given

    文摘:首先系統給出了機械產品造型領域特徵的定義以及特徵的分類；其次，建立了基於約束的機械產品零件的參數化特徵模型，並用特徵關系圖的形式表達特徵模型，同時採用動態鏈表構建特徵模型並用面向對象技術實現了零件的參數化特徵模型；最後結合實例分析了基於特徵模型的零件特徵分級參數化實現過程。
  7. Modeling in conceptual design is a key technology in cacd system. considering the characteristics of conceptual design and the feature classification of vp, this paper presents a novel virtual prototype - based product model, v - desmodel. v - desmodel introduces virtual feature concept in product ' s view models, and employs expandable 3d entity - constraint graph to describe the constraints between design objects

    概念設計建模一直是計算機輔助概念設計系統的核心與關鍵技術，本文在分析虛擬原型的特徵分類以及概念設計過程特點的基礎上，提出一種基於虛擬原型的概念設計描述模型v - desmodel ，其核心特點是採用產品視圖模型描述設計對象，將虛擬特徵概念融入視圖模型中，並採用可擴展「三維實體?約束圖」描述設計對象之間的約束關系。
  8. In 2000, ian miguel build flexible planning, he import the “ soft ” constraint into graph planning, this lead the ability of flexible planning have a lot improve in deal with the problems in the real world

    Ianmiguel在2000年提出了靈活規劃器，它引入了一種稱為「軟」限制的方法，使得能處理經典圖規劃不能處理的一些現實問題。
  9. But goal graph build basis on the theory classical graph plan. therefore it can not deal with the “ soft ” constraint action and target. this paper is integrated the method of flexible planning and goal graph, and research the method of planning recognition

    但由於目標圖的識別方法是在經典的圖規劃的理論基礎上，因而它也不具備識別出靈活規劃中具有「軟」限制動作或目標的能力。
  10. Security constraints are consistent by modifying security constraint definition, and an effective classification assignment algorithm is given in this paper. we analyze the problem of inference channel and give solution to solve the problem during database analysis and design period. by analyzing the problems resulting from extending single - level transactions to multilevel transactions, we also give a multilevel secure transaction schedule algorithm based multiversion snapshot graph

    本文提出採用主從結構表的方法對blp模型加以改造，使得改造后的blp模型具有較高的可用性和安全性；通過修改安全約束的定義，使得安全約束之間始終是協調的，並給出一種高效的密級分配演算法；討論了推理通道問題，給出了在數據庫分析、設計等階段可以採用的對策；分析了事務從傳統的單級擴展到多級面臨的眾多難題，給出了一種基於多版本串列化圖的事務調度演算法；根據上述理論，開發了一個多級安全數據庫管理系統的原型系統。
  11. In this paper, the following tasks have been accomplished : ( 1 ) analyzing the constraint relation of parts to accomplish oriented functional relationship graph ( ofrg ) assembly modeling

    在本文中完成了以下的工作： （ 1 ）通過分析裝配體中零部件之間的約束關系，建立裝配體的有向功能關系圖（ ofrg ）裝配模型。
  12. Meanwhile, the semantics of syntactical structure, constraint condition and super activity graph were discussed. this idea defined the formal semantics appropriate for work flow for super activity graph and completed the establishment of the mathematical model of work flow. apart from that, the executive algorithm of the activity graph in the formal semantics of work flow activity graph were put forward

    同時對活動超圖的語法結構、約束條件及活動超圖的語義進行了討論，並為活動超圖定義了適用於工作流模型的形式化語義，從而完成工作流數學模型的建立，提出了工作流活動圖形式化語義中活動圖的執行演算法。
分享友人
分享到 Line

分享到臉書