您要查找的是不是：
- All conceptions, including Content DataModel (CDM), Data Dependency Graph (DDG) and Data Update Subgraph (DUS)are defined. 以GUI抽象描述模型為基礎,本文提出了GUI內容數據的建模方法。 通過(guò)定義數據依賴(lài)圖和數據更新子圖記錄和表現數據間的依賴(lài)關(guān)系和變化。
- enriched data dependence graph 增強數據相關(guān)圖
- A dynamic program slice is obtained by recursively traversing the data and control dependence edges in the dynamic dependence graph of the program for the given test case[0,3]. 對于給定的測試用例{[0.;3];動(dòng)態(tài)程序片是通過(guò)以下方式獲得的:遞歸遍歷程序動(dòng)態(tài)依賴(lài)圖中的數據和控制依賴(lài)邊
- A more subtle problem is data dependency. 較錯綜復雜的問(wèn)題是依賴(lài)性。
- The effects of an ORDER BY clause on mixed-case data depend on the database collation and case sensitivity specified when the database is created. ORDER BY子句對混合大小寫(xiě)數據的影響取決于在創(chuàng )建數據庫時(shí)指定的數據庫歸類(lèi)和大小寫(xiě)。
- Value Prediction(VP) and Instruction Reuse(IR) are two novel techniques that have recently been proposed for exploiting the redundancy in programs to collapse data dependence. 值預測和指令重用是通過(guò)開(kāi)發(fā)程序執行結果的冗余來(lái)解決數據相關(guān)的兩種不同的新技術(shù)。
- How does a database help to solve the data dependency problem? 數據庫又如何協(xié)助解決數據依賴(lài)性問(wèn)題呢?
- Company code data depends on the company code organization. 公司代碼數據依賴(lài)于公司代碼組織。
- ADP) The Acyclic Dependencies Principle: Allow no cycles in the package dependency graph. 無(wú)環(huán)依賴(lài)原則(ADP):在包的依賴(lài)關(guān)系圖中不允許存在環(huán)。
- When dependency graph is constructed, each action can be assigned a rule for property adjustment. 當依賴(lài)關(guān)系圖被構造時(shí)，每個(gè)動(dòng)作都可以被賦予一個(gè)屬性調整的規則。
- The dependence graphs of different subprograms can be saved independently, which is easy to be reused. 各子程序的依賴(lài)圖可單獨存儲，便于重用。
- The dependency graph contains the dependency information between the variables in the solving problem. 依賴(lài)圖中保留了求解問(wèn)題中變量間的依賴(lài)信息。
- By default, the export operation includes steps that have a data dependency. 默認情況下,導出操作包含具有數據依賴(lài)性的步驟。
- The problems of over-constraint and under-constraint have been solved by using dependency graph based on the freedom analysis method. 摘要在自由度分析方法的基礎上使用依賴(lài)圖，解決了約束求解過(guò)程中的過(guò)約束和欠約束的處理問(wèn)題。
- The program dependence graphs can be constructed concurrently, for each PDG is independent.This is much fit for larger programs. 在依賴(lài)圖的計算中，子程序之間相對獨立，可根據子程序調用圖將所有子程序分組，使得同組的子程序可并發(fā)處理，可用于對大型代碼的分析。
- The accumulator set uses this information to generate an ordered set of accumulators depending on the feature dependency graph. 累加器集使用這些信息并根據特征依賴(lài)關(guān)系圖來(lái)生成累加器的一個(gè)有序集合。
- Upon looking at the problem closer, you can see, however, that the depth of the dependency graph tends to be shallow, and furthermore that some objects are natural endpoints. 但是,如果仔細考慮一下這個(gè)問(wèn)題,就會(huì )發(fā)現依賴(lài)圖的深度一般不大,而且某些對象是自然的端點(diǎn)。
- The direct dependency graph(DDG),direct dependency matrix(DDM),dependency relation matrix(DRM),degree of direct dependency(DDD) and minimal cover(MC) were defined. 然后定義了直接依賴(lài)圖、直接依賴(lài)矩陣、直接依賴(lài)度、依賴(lài)關(guān)系矩陣和最小覆蓋等概念。
- The best way to load the data depends on what kinds of operations are performed and how much data needs to be loaded. 裝入數據的最佳方法取決于所執行操作的類(lèi)型以及需要裝入多少數據。
