| 1. | On infinite family of tight optimal double loop networks
关于紧优双环网络的无限族 |
| 2. | Infinite families of 4 - tight and 5 - tight optimal double - loop networks
4紧优和5紧优双环网络无限族 |
| 3. | Protection plan of beijing - shanghai - guangdong high - speed loop network
浅析京沪穗高速环网络保护方案 |
| 4. | Circulant networks are widely used in the design of local networks and various parallel processing systems
环网络广泛应用于计算机局域网设计和各种并行处理系统 |
| 5. | A universal algorithm for detecting all simple paths between any two nodes in weighted directed acyclic network was presented
提出了一种有向无环网络中任意两节点间所有简单路径的通用搜索算法。 |
| 6. | We mainly study the case / = 3 , that is triple loop networks . the upper bounds for the diameters of triple loop networks are given . when n is limited , the conditions for the optimal triple loop networks are obtained
本文重点研究了l 3的情形，即三环网络，给出其直径的上界，并给出n不太大时，三环网络取得最优的一个条件 |
| 7. | Major contributions of this thesis include : 1 ) advances a new algorithm a ~ ( h ) to compute all possible paths , the shortest ( longest ) path and the ( immediate ) ancestor or descendent relation between two nodes on a simple directed acyclic network
本文取得的创新性成果主要表现在以下几个方面： 1 )对简单有向无环网络中任意两个结点之间的所有可能路径、最短(长)路径以及(直接)前驱后继等问题，本文提出一种新的算法a ~ h 。 |
| 8. | Domain ontology can be modeled a simple directed acyclic network , subsumption relation between two concepts can be computed by the ( immediate ) ancestor or descendent algorithm in a ~ ( h ) , association degree between two concepts can be computed by the shortest path algorithm in a ~ ( h )
领域本体可以模型化为一个简单有向无环网络，概念之间的包含关系可以通过a ~ h中的(直接)前驱后继算法来求解，而概念之间的关联度可以通过a ~ h中的最短路径算法来求解。 |
| 9. | The characteristics of the extended model are as follows : the network structure is a closed loop network ; the allocation of manufactured and remanufactured products that can ' t be replaced with each other is comprehensively considered ; and the locations of potential manufacturing / remanufacturing facilities , warehouses and disassembly centers are addressed
该模型特点是：网络结构为闭环网络；正向物流中统筹考虑再生品和新产品的物流分配，再生品和新产品不能相互替代；解决了新建装配厂、存储批发商及拆解中心的选址问题。 |
