您要查找的是不是:
- All conceptions, including Content DataModel (CDM), Data Dependency Graph (DDG) and Data Update Subgraph (DUS)are defined. 以GUI抽象描述模型为基础,本文提出了GUI内容数据的建模方法。 通过定义数据依赖图和数据更新子图记录和表现数据间的依赖关系和变化。
- enriched data dependence graph 增强数据相关图
- 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];动态程序片是通过以下方式获得的:递归遍历程序动态依赖图中的数据和控制依赖边
- A more subtle problem is data dependency. 较错综复杂的问题是依赖性。
- 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子句对混合大小写数据的影响取决于在创建数据库时指定的数据库归类和大小写。
- 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. 值预测和指令重用是通过开发程序执行结果的冗余来解决数据相关的两种不同的新技术。
- How does a database help to solve the data dependency problem? 数据库又如何协助解决数据依赖性问题呢?
- Company code data depends on the company code organization. 公司代码数据依赖于公司代码组织。
- ADP) The Acyclic Dependencies Principle: Allow no cycles in the package dependency graph. 无环依赖原则(ADP):在包的依赖关系图中不允许存在环。
- When dependency graph is constructed, each action can be assigned a rule for property adjustment. 当依赖关系图被构造时,每个动作都可以被赋予一个属性调整的规则。
- The dependence graphs of different subprograms can be saved independently, which is easy to be reused. 各子程序的依赖图可单独存储,便于重用。
- The dependency graph contains the dependency information between the variables in the solving problem. 依赖图中保留了求解问题中变量间的依赖信息。
- By default, the export operation includes steps that have a data dependency. 默认情况下,导出操作包含具有数据依赖性的步骤。
- The problems of over-constraint and under-constraint have been solved by using dependency graph based on the freedom analysis method. 摘要在自由度分析方法的基础上使用依赖图,解决了约束求解过程中的过约束和欠约束的处理问题。
- The program dependence graphs can be constructed concurrently, for each PDG is independent.This is much fit for larger programs. 在依赖图的计算中,子程序之间相对独立,可根据子程序调用图将所有子程序分组,使得同组的子程序可并发处理,可用于对大型代码的分析。
- The accumulator set uses this information to generate an ordered set of accumulators depending on the feature dependency graph. 累加器集使用这些信息并根据特征依赖关系图来生成累加器的一个有序集合。
- 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. 但是,如果仔细考虑一下这个问题,就会发现依赖图的深度一般不大,而且某些对象是自然的端点。
- The direct dependency graph(DDG),direct dependency matrix(DDM),dependency relation matrix(DRM),degree of direct dependency(DDD) and minimal cover(MC) were defined. 然后定义了直接依赖图、直接依赖矩阵、直接依赖度、依赖关系矩阵和最小覆盖等概念。
- The best way to load the data depends on what kinds of operations are performed and how much data needs to be loaded. 装入数据的最佳方法取决于所执行操作的类型以及需要装入多少数据。