constraint rule 中文意思是什麼

constraint rule 解釋
約束規則
  • constraint : n. 1. 強迫，拘束。2. 約束，壓抑，拘泥。3. 強制力。4. 緊張感[狀態]。
  • rule : n 1 規則，規定；法則，定律；章程，規章；標準；（教會等的）教規，條例，教條；常例，慣例。2 統治，...
  1. The case - sensitivity rule does not apply if only one column, relation, or constraint with a particular name exists

    如果某個特定名稱只存在一個列、關系或約束，則不應用區分大小寫規則。
  2. Economists have stated a general rule concerning marginal utility for an individual faced with a given budget constraint and given price.

    經濟學家對一個面臨有限收入和一定價格的個人的邊際效用，總結了一條一般的法則。
  3. Now, there are quite research findings on both the algorithm for weighted association rule and the algorithm for constraint association rule, but there is few algorithm for weighted and constraint association rule. we propose the algorithm for the system of information of computer - saling to think about the different payoff for different fittings of computer and to get only the information that we are interested in. the algorithm is useful for the later management of the saling - computer

    目前國內、外對加權關聯規則提取演算法和約束關聯規則提取演算法的分別研究已取得了很多成果，但是結合這兩種情況，同時考慮加權與約束兩個因素的關聯規則提取演算法還不多見。筆者結合電腦賣場信息支持系統的實際需要，提出了既考慮配件的盈利不同，又兼顧挖掘感興趣的信息內容的關聯規則提取演算法。
  4. With the coming of information age, more and more people realize the importance of information. useful information hidden in plenty of data needs mining energently. the technology of data mining arises and develops unders such circumstance. the main tast of data mining is to extract or mine the useful information from the data. we can get great amount of data from the computer transaction every day. the data is very useful for us to make decisions on management. the paper concludes and introduces association rule about its concept, sort, model and step for mining the data, measure and some basic algorithm on the basis of the at research. at the same time, we analyse hopfield - network ' smodel, character, energy - function, movement - equation and so on. moreover, to the requirement of the system of information of computer - saling, we have done the following and there are good result. fisrt, considering the weight and constraint, we propose the algorithm for the weighted and constraint association rule

    本文首先對數據挖掘中的關聯規則和神經網路的已有成果作了詳細深入的調研，歸納和整理了關聯規則的概念、分類、關聯規則挖掘的模型與步驟、關聯規則的度量方法以及一些基本演算法；還歸納和整理了hopfield網路的模型、特徵、能量函數、運動方程等，並在此基礎上，結合電腦賣場信息支持系統提出的需求，做了如下工作，並取得了一定的成果和成效： （ 1 ）考慮加權與約束兩種情況，提出了既帶權重又帶約束的關聯規則提取演算法。
  5. I regard qsim as a kind of constraint satisfaction problem ( csp ), and improve the qualitative simulation algorithm by constraint logic programming ( clp ). fuzzy qualitative simulation develops conventional qsim on several facets, such as representation of qualitative value, state transition rule and filtering algorithms. it bridges the gap between pure qualitative and quantitative, and improve the efficien

    前者是將定性模擬演算法看作一類約束滿足問題，用約束邏輯程序加以改進，不僅為解決定性模擬問題提供了邏輯框架，而且也是一種規范化的程序描述語言；模糊定性模擬演算法則是對純定性模擬演算法在知識描述、狀態轉移規則、過濾演算法等方面的改進，是一類半定量描述方法，有利於在定性模擬領域綜合定量信息，同時提高演算法的效率。
  6. Then statistic correlation concept was introduced and based on which the rule interestingness measure was defined what we are interested in during the mining is those rules with strong item correlation. so the interesting measure introduced in this paper severed as a constraint for those independent or negative correlation rules. with it associated with the support and the confidence we can find only interesting or useful rules from data sets

    而我們的目的就是找出有益於決策的用戶感興趣的規則，所以對于關聯規則挖掘中許多規則是無趣甚至是誤導的情況，文中首先對其作了分析，針對項目集中可能出現的項目間的獨立和負相關情況，文中引入了概率論的統計相關概念，並在它的基礎上定義了有趣度量ri ，把有趣度結合到支持?信任框架的關聯規則挖掘中。
  7. Four approaches to geometric constraint solving, namely graph - based, rule - based, numerical computation - based and symbolic computation - based are described in detail

    對常見的4類求解方法：數值計算的方法、符號計算的方法、基於規則的方法、基於圖論的方法做了詳細的介紹。
  8. After studying various constraints, a constraint - based cluster using function partition based on angle dissimilarity, a partition sowntown means with least outspread tree method, and the quantity of customer ' s sale was forecasted by time - series analysis were presented. so, a series of cspr ( cluster sown town partition rule ) to manage lcc database was describe

    為實現對滿足約束條件的聚類尋找適當的方法，作者在分析聚類約束條件的基礎上，提出運用基於角度相異度的函數劃分法處理地理位置的約束條件，用最小生成樹聚類分析方法生成滿足多項約束條件的聚類，用時間序列預測技術使客戶銷量約束條件趨于完善。
  9. 2. this paper advanced mixed integer nonlinear programming ( minlp ) algorithms mixed with constraint programming ( cp ) to solve industrial process hybrid model mixed with logical rule. cp methods have proved to be successful in solving highly constrained discrete optimization and feasibility problems. it can effectively solve hybrid model mixed with logical rule by integrating cp, nonlinear programming and mixed integer linear programming

    本文針對結合邏輯的工業過程混雜模型，提出了結合約束程序（ cp ）的混合整數非線性規劃（ mfnlp ）演算法，採用cp方法求解模型的可行點，並採用milp cp方法求解演算法中的milp主問題，通過計算實例可看出，採用這種演算法比採用通用的轉化成minlp方法的計算時間大為減少。
  10. By object - oriented technic, the main matter, constructing, expression, class frame of field common data model ( fcdm ) and constructing technics liking entity definition, attributes, constraint rules. the object state transform rule and object based on conceptual cluster - role mechanism ( ccrm ) are importantly proposed

    作者用面向對象技術給出了領域公共數據模型fcdm （ fieldscommondatamodel ）的主要內容、建立與表達、類結構組織和實體定義、屬性、約束規則等構築技術，並重點介紹了對象狀態轉換規則和對象聚類機制及其特點。
  11. If an update to a row violates a constraint or rule, violates the null setting for the column, or the new value is an incompatible data type, the statement is canceled, an error is returned, and no records are updated

    如果對行的更新違反了某個約束或規則，或違反了對列的null設置，或者新值是不兼容的數據類型，則取消該語句、返回錯誤並且不更新任何記錄。
  12. In this paper, it first defines the rule of basic structures in xyz / e, analyzes the analogies between xyz / adl design elements and uml modeling elements and defines the conversion rule, and uses uml extension mechanism and object constraint language to perfect the conversion. and then it selects class diagram and composite structure new in uml2. 0 for research, defines how to convert them to xyz / adl. there has been some research for the conversion from uml state machine diagram, activity diagram and sequence diagram to xyz / e

    本文具體工作如下:從xyz / adl到uml的轉換，首先定義了xyz / adl的語義基礎? ? xyz / e的基本結構到uml的轉換規則，接著通過分析xyz / adl的設計元素和uml建模元素之間的語義相似，定義了二者之間的轉換規則，並用uml的擴展機制和對象約束語言ocl描述進一步的約束來完善相應的轉換過程;另外對于從uml到xyz / adl的轉換，本文著重對uml類圖進行研究，定義了從uml類圖到xyz / adl的轉換機制，也對uml2 . 0新增加的組成結構圖到xyz / adl的轉換進行了定義，同時亦對國內已經開展的uml狀態圖、活動圖、順序圖到xyz / e的轉換機制研究作了簡要介紹。
  13. Foreign - key constraint rule

    外鍵約束規則
  14. Under the background of packing design of bender, the packing algorithm of gradual advancement based on engineering - oriented constraint rule is presented

    摘要以彎管機布局設計為背景提出了一種基於工程約束規則的層次推進布局演算法。
  15. Moreover, we accelerate solution of packing problem to make packing result accord with actual requirement by applying engineering - oriented constraint rule to packing

    同時，在布局過程中引進了工程約束規則，加快了布局問題的求解，布局結果更符合實際要求。
  16. The sufficiency function is built for genetic algorithm based on constraint rule, and the genetic / tabu algorithm is introduced to process aggregating. the feasibility and efficiency of the algorithm are verified by the result of example

    將基因遺傳/禁忌混合演算法應用於加工工序的聚合問題，以工序聚合中的約束規則為基礎，建立了摘要遺傳演算法的適應度函數，通過實例驗證了混合演算法的有效性。
  17. Topics covered include : applications of rule chaining, heuristic search, logic, constraint propagation, constrained search, and other problem - solving paradigms, as well as applications of decision trees, neural nets, svms and other learning paradigms

    涉及的主題包括：鏈式規則的應用、啟發式搜索、邏輯、約束傳播、約束搜索和其它問題解決範例，另外還有決策樹的應用、神經網路、向量機（ svm ）以及其它學習範例。
  18. Second, this thesis systematically describes the framework and its basic modeling elements of esd. to overcome the drawback in fault analyzing capability of the esd method, the paper invents the cesd method, and gives out their basic modeling elements which include event, gate, condition, constraint and rule

    （ 2 ）介紹了esd的基本框架，針對esd在異常因果關系分析中的不足，提出了逆向esd方法，給出了逆向esd框架的基本元素，包括事件、邏輯門、條件、限制和關聯規則。
  19. At first, this thesis described the necessary of implementing dm in crm systems at on the basis of explaining the elementary concepts and principles of crm and dm, constructed a crm system framework with the center of dm. then, it ameliorated and expanded the models of traditional association rule and decision tree for classification, put forward association rule with time constraint and fuzzy decision tree for classification. the thesis amended traditional algorithms and showed the application methods of new models

    論文首先從客戶關系管理和數據挖掘的基本概念和原理入手，闡明了在客戶關系管理中應用數據挖掘的必要性，構建了以數據挖掘為核心的crm系統框架；然後，論文改進和擴展了傳統的關聯規則和決策分類樹模型，提出了具有確定性時間約束的關聯規則和模糊決策分類樹，並修改了傳統的挖掘演算法，通過示例展示了新模型的應用方法。
  20. After a comparative studying and analyzing three effective strategies for generating pair - cover test set by means of pcg, csg and a series of sample systems " experiments, we present an improved algorithm, which has a rule for ordering parameters extension and also solves constraint parameters problem

    本文還研究和分析了目前已有的三種有效的配對覆蓋測試集生成策略，並利用pcg圖和csg圖分析了它們各自的擴展演算法，還通過一組測試樣本系統綜合分析和比較了它們各自的效果。
分享友人
分享到 Line

分享到臉書