查询词典 node

Analysis for testability is widely used in DFT and test pattern generation, but most testability analysis algorithms have the shortcoming of either inaccuracy or being too complicated. A new method to calculate the signal probabilities of the nodes in IC is pre-sented in Chapter 7 of this dissertation. The signal probabilities by our method is more exact than by the previous ones. A symbol of the signal probability at the fan-out node is created and is propagated to the RFON (Reconvergent Fan-out Nodes). At the RFON, the expression containing the symbol is simplified using the rule which corresponds to the law of identity in Boolean algebra. After the expression is simplified, the symbol is substituted with its numeric value. Theoretical analysis shows that this method is concise and has a low computing complexity.

可测试性分析在可测试性设计和测试生成中都有着广泛的应用，然而大部分的可测性分析方法都存在不精确或者过于复杂的毛病，在第七章中作者提出了一种新的计算IC电路节点的信号概率值的符号算法，该算法得出的信号概率值比用以往的算法法得出的要更准确，也更简洁，针对电路中的扇出节点重汇聚现象，我们在每一个扇出节点定义了一个信号概率的符号，在以后的计算中一直使用该符号参与计算，直到该符号传播至重汇聚处，利用一定的规则把含符号的表达式化简，再将符号的真实值代入，在计算符号概率的过程中定义了一个和布尔代数中的同一律相对应的运算规则，通过该运算规则，使得信号概率的结果更加准确，符号算法具有简洁方便，计算复杂度小的特点 4。

Huffman tree implemented using a genealogy program, you can find her son, the father node, and the family algebra, etc.

详细说明：一个用哈夫曼树实现的家谱程序，可以查找儿子，父亲节点以及这个家族的代数等。

Firstly,the ML model was given to determine father node, evolutionary time and the relationship between conserved probability and similarity.

分别建立了确定父节点的ML模型、确定进化时间的ML模型以及保守概率与相似度关系模型；并通过递推，逐步恢复生物进化的原过程。

Firstly, the ML model was given to determine father node, evolutionary time and the relationship between conserved probability and similarity. Then the process of organism evolution was recovered.

分别建立了确定父节点的ML模型、确定进化时间的ML模型以及保守概率与相似度关系模型；并通过递推，逐步恢复生物进化的原过程。

To overcome the above problems,authors present a Hierarchical algorithm based on Communication range Restraining Clustering.It first studies single-level protocol based on Communication range Restraining Clustering and then father node is selected in every layer in terms of communication range restraining to reduce the number of data package transmission.

针对这种问题，提出了一种基于通信范围约束的多层簇类算法，基于单层次的数据融合结构，给出了多层次的数据融合，然后对每一层簇头通过通信范围选择父节点，减少数据包传输次数。

The algorithm partitions the content of web page into five sections,and then prunes the sections which have the same contents with the father node of Web page in website graph representation.

但是，在语义网络成为主流网络资源载体之前，在传统互联网络环境下的信息获取问题很多，包括由于软件系统无法理解网页真实内容及其

The fault diagnostic method that applies product structure tree to organize diagnostic knowledge and utilizes FMEA information to establish diagnostic rule between father node and children nodes was presented.

提出了以产品结构树为诊断知识的组织框架和利用FMEA(Failure Mode and E ffect Analysis)信息建立父节点与子节点间的诊断规则的故障诊断方法。

Parties were first partitioned to form a tree, then n representations from n nodes which were children nodes of the corresponding father node in the above level agree on a group key in this round by invoking the BCP scheme.

群内成员先进行树结构的划分，每n个节点作为相应上一级节点的孩子节点，n个节点分别选定代表，n个代表通过调用协议BCP协商密钥得到本轮即相应父亲节点的子密钥，重复进行上述过程最终可以得到群组密钥。

This algorithm defines route valid term,the father node priority queue,and proposes the overlapping backoff window strategy.Simulation result shows this algorithm can construct the route tree effectively.

算法定义路由有效期、父节点优先级队列，并结合跨层设计思想，修改MAC退避算法，提出交叉退避窗口策略，并经仿真实验证明能够有效地构造出较优的路由树。

For two examples, result testifies that it is feasible to use in nonlinear restriction optimization. Chapter 3 is important part in the paper. Analyze and research BP network, concealed node number of network former frame newly. Give new supplement and advice about How to select study velocity and activation function in BP algorithm.

第3章是论文中最重要的一章，通过实例分析研究了BP网络，对网络模型结构的隐层节点数进行分析和新的探讨；对BP算法中的学习速率和激活函数的选取进行了新的补充和建议；对网络的拓扑结构进行了新的构造；对人工神经网络收敛依据提出了新的判断原则。

Many will continue to choose to live in duality and in conflict.

许多人将继续选择活在二元对立性和冲突中。

I find that students of the University of Physical Education all wear sportswear at first sight.

我发现：体育大学的学生乍一看，都是穿运动衣，大家都一样