Full STW collectors have the benefit of being able to trace through object references and JVM internal structures without the application perturbing the links in the object graph.
全面的STW收集器具有以下优点：可以跟踪对象引用和JVM内部结构，应用程序不会干扰对象图中的链接。
The fancy mathematical name he has for this map is a “social graph”, a model of nodes and links in which nodes are people and connections are friendships.
他给这一地图起了一个富于想象力而又很数学化的名字“社会图”，它是一个由节点和连接节点的线组成的数学模型，其中节点就是一个个的人而人与人的连线则代表他们的友谊。
The first step in building our roughly defined graph is to acquire the number of links between interrelated Web pages.
构建粗略定义的图形的第一个步骤是获得相关web页面之间的链接数量。
With the linear graph and adjacent matrix method of graph theory, the possible forms of this mechanism are discussed by analyzing that of kinematic chain with 4~8 links connected by planar low pair.
运用图论的线图和邻接矩阵方法从分析平面低副4～8杆运动链的可能形式出发，分析了以连杆为起始构件这类机构的可能有的形式。
With this model, the group argumentative information could be structured as a graph which consisted of utterance nodes and semantic links.
该模型将群体研讨发言信息组织成由发言节点和语义边构成的图。
The graph arranges rows and columns alphabetically or by the number of links per node.
图形会依字母顺序或依每个节点连结的数目排列资料列与资料行。
Based on that, the relationships between the W-polynomial of a polyhedral graph and the HOMFLY polynomials of four kinds of polyhedral links are established.
以此为基础，我们建立了一个多面体图的W -多项式和四类链环的HOMFLY多项式之间的关系。
Based on knot theory and graph theory, the paper simplifies the computation for HOMFLY polynomial of polyhedral links.
基于纽结理论和图论，文章简化了多面体链环的HOMFLY多项式的计算。
For an arbitrary polyhedral graph, four classes of polyhedral links can be obtained by applying the operation of 'x-tangle covering 'to the related reduced sets.
对任意一个多面体图，四类多面体链环可以通过应用‘X -缠绕覆盖’到相关的简化集中得到。
For an arbitrary polyhedral graph, four classes of polyhedral links can be obtained by applying the operation of 'x-tangle covering 'to the related reduced sets.
对任意一个多面体图，四类多面体链环可以通过应用‘X -缠绕覆盖’到相关的简化集中得到。
应用推荐