Since the SDO implementation is EMF based, the EMF traversal APIs can be used in order to traverse an SDO graph.
因为SDO实现是基于EMF的，所以可以使用EMF旋转api来旋转一个sdo图表。
However, this field would then be serialized from any object graph involving Item, despite the current stock level's irrelevance to, say, the customer's Order History.
但是，不管当前的库存水平是否与当前情况相关(比如对顾客的订单历史来说)，这个字段都会从包含Item的任何对象图中序列化出来。
In order to do this, we introduce a number of additional colors to the graph (see Figure 3).
为了这样做，我们向此图表引入许多附加颜色(参见图3)。
This chapter developed the concept of breaking down a project into activities in order to draw its graph, or network.
这一章提出将一个工程项目分解为若干工作这一概念，其目的是便于绘制网络图。
Later everyday spider crawl records me to be able to catch a graph look to everybody, in order to confirm this is true really.
以后每天的蜘蛛爬行记录我都会抓图给大家看，以证实这确实是真实的。
According to largest quantity of free discharge and order of designing peak flow quantity in the flood discharge, flood regulation routing formula of general graph is computed.
根据涵洞最大自由泄洪流量和设计洪峰流量在泄洪运行中出现的前后顺序，推算出概化图形的调洪演算公式。
We used more titration points in order to raise accuracy, We may get equivalence volumes of two polyprotic acids from graph.
为提高准确度，采用多点法，从图上可得到两种酸的等当点体积。
You can graph the order and speed at which website components load using the Resources Pane.
你可以使用资源面板将网站构成部分载入的顺序和速度显示为图表。
A new weight calculation method based on the statistics of gradient direction histogram is presented here in order to robustly realize graph cut.
本文给出新的基于梯度方向直方图统计的权值计算方法，实现稳定的图切割。
In order to storage the huge directed graph, a trifurcate chain-table storage structure is presented.
为了对大型有向图进行存储，提出了一种三叉链表式的存储结构。
ISDG, an improved system dependence graph, is proposed in order to better describe relationships in object-oriented programs. ISDG solves the description problem of parameterized objects.
针对面向对象语言程序，提出了一种改进后的系统依赖图：ISDG，用来更好地表示面向对象程序中的依赖关系，从而解决了对象类型参数和属性的表示问题。
In order to solve the problem of routing and wavelength assignment for priority-based dynamic operation in WDM networks, a dynamic RAW algorithm based on layered graph was proposed.
为了解决WDM网络中多优先级动态业务的路由选择与波长分配问题，提出了一种基于分层图模型的动态RAW算法。
This format is easier for clients to consume than the original object graph, which contains nested entities (order, details, and products).
这种格式要比原先的对象图式更易于由客户端使用，它包含了嵌套的实体(订单、细节和产品)。
In order to convert GIS based feeder maps into electric diagrams, a distribution network model based on the graph theory is developed.
为了将配电馈线的地理接线图转换为电气接线图，建立了基于图论的配电网模型。
In order to solve the problem of generating and optimizing the assembly sequences of a complex assembly, the oriented-mating graph model of the assembly and the related mating matrix are created.
为了解决复杂装配体装配序列生成与优化问题，首先建立装配体的有向关联图，生成对应的关联矩阵。
The recognition process is driven by the model graph in a top-down order.
识别由模型树图导引从上至下完成。
It USES random path kernel function to define the main graph kernel functions and gives different weights to backbone graph which have different order.
利用随机路径核函数来定义主干图核函数并对不同阶的主干图给予不同的权重。
In order to determine whether exist chromatic index critical graph of order 14, we should determine chromatic index critical of order 13 at first.
要想确定是否存在14阶色指数临界图，首先需要确定出13阶临界图的结构和特征。
Dijkstra algorithm and the graph function have been adopted in the designing of the system in order to make the consumers understanding easier.
系统设计采用了迪杰斯特拉算法和图形函数，以便用户更容易理解。
What is the maximum number of possible topological sorts of N-order Direct Acyclic Graph?
的n阶有向无环图的拓扑排序的可能的最大数量是多少？
Besides, in order to facilitate applications to check affectivity and consistency of this model, a formal concept model based on hyper-graph data structure is proposed.
同时，为使高层应用易于对模型进行有效性和一致性检查，采用超图数据结构形式化地定义了上述模型的概念模型。
The tenacity is a better parameter to measure the stability of a network g, as it takes into account both the quantity and order of components of the graph.
粘连度是一个较好的参数，因为它把网络被破坏后的最大分支的阶和分支的个数联合起来考虑。
In order to solve the intelligent transportation system in transportation network analysis and the shortest path problem, this paper proposes a weighted identification S-graph shortest path algorithm.
为解决智能交通系统中交通运输网络分析和最短路径问题，提出加权标识s -图最短路径算法。
Virtual Laboratory of Cryptology based on Components(VLCC) uses topological sorting in Directed Acyclic Graph(DAG) to manage the data-dependant and execute-order between components.
基于组件的密码学虚拟实验室（VLCC）采用有向无环图（DAG）的拓扑排序机制管理组件。
In this last processing, deformation graphs are divided into two types-boundary deformation graph and entire deformation graph in order to show deformation condition entirely;
其中，变形图分为两种—外框变形图和整体网格变形图，以便能综合显示变形情况。
In order to improve the performance of the image annotation, an image semantic annotation method based on multi-modal relational graph was proposed.
为了改善图像标注的性能，提出了一种基于多模态关联图的图像语义标注方法。
In order to reduce the outage probability and enhance the stability of cognitive system, an improved algorithm of spectrum allocation based on classical graph coloring model was proposed.
为了降低认知系统的通信中断概率，提高认知系统的稳定性，在经典的图论着色模型基础上提出了一种改进的频谱分配算法。
In order to reduce the outage probability and enhance the stability of cognitive system, an improved algorithm of spectrum allocation based on classical graph coloring model was proposed.
为了降低认知系统的通信中断概率，提高认知系统的稳定性，在经典的图论着色模型基础上提出了一种改进的频谱分配算法。
应用推荐