where d(n) for a hidden node n, turns on (1) how much n influences any given output node; and (2) how much that output node itself influences the overall error of the net.
其中d(n)是隐藏节点 n 的函数，让我们来看（1）n对任何给出的输出节点有多大影响；（2）输出节点本身对网络整体的误差有多少影响。
To do this asynchronously, the net traverses the distorted pattern, and at each node, n, it asks whether n's value should be set to -1 or + 1.
如果是异步完成，网络会遍历失真的图案，在每一个节点n，它会询问n的值应该设置为-1还是+ 1。
Blank nodes are in the form _ : name, where name is an identifier for that blank node within a given set of N-Triples.
空节点的形式是_：name，其中name是给定的n - Triples集内该空节点的标识。
For each node n in the list L, carry out re-provisioning as follows
对于列表L 内的每个节点n，执行重新供应，如下所示
For required child nodes ({1.. 1}, {1.. n}) or dependent nodes, a navigation action is added that targets the creation page of the child node.
对于所需的子节点({1. . 1}、{1 . .n})或依赖节点，添加针对子节点创建页面的导航操作。
On the one hand, the more n influences an output node, the more n affects the net's overall error.
一方面，n影响一个输出节点越多，n造成网络整体的误差也越多。
For a dependent node that is related to its parent with a multiple {0..n} cardinality, it applies this pattern
对于一个与其亲节点具有 {0..n}关系的依赖节点来说，它应用此模式
At any time t, a node n is eligible for provisioning if t > T(n).
在任何的时间t，如果 t > T(n)，则节点 n具有供应资格。
The system is based on the spread of the primary tumor (t), the extent of lymph node involvement (n), and the presence or absence of metastases (m).
系统包括三个部分：原发肿瘤的扩散程度(t)；淋巴结的转移程度(N)和是否有了其他器官的转移(M)。
Is based on the n-tier model and supports browser users (client node) and mobile users (pervasive user node) accessing back-end applications.
基于n层模型，支持浏览器用户(client节点)和移动用户(pervasiveuser节点)访问后端应用程序。
UDDI Version 1 only supported a file-based replication scheme whose complexity grew as n-squared with the number of registry node implementations participating within a UDDI registry.
UDDI版本1仅支持基于文件的复制模式，随参与到uddi注册中心中的注册中心节点实现数目的增长，其复杂程度以n的平方增长。
The Numbers after the node names on the right-hand side indicate that it's the n-th concurrent compile.
右边节点名后面的数字指出了它是第n个当前编译文件。
On any node in the GPFS cluster, turn on the GPFS SNMP sub-agent: mmchnode — snmp-agent -n [COLLECTOR-NODE].
在GPFS集群中的任意节点上，启动GPFSsnmp子代理：mmchnode——snmp - agent - n [COLLECTOR - NODE]。
n.firstpos(): the set of XML nodes that match the first element of an XPath rooted at node n
firstpos() ：与根在节点n 上的XPath的第一个元素匹配的XML节点集
Fast calculating node voltage and sensitivity of node voltage to any system operating parameter is very important to the real time stakeout and analysis of voltage stabilization in a N-1 system.
快速求取n - 1网络下各节点电压和各节点电压对任一节点系统运行参数的灵敏度对于N - 1网络下的实时电压稳定监视和分析具有重要意义。
N. Node is in 10 Degrees Sagittarius.
全节点是在射手座10度。
N. Node is in 25 Degrees Gemini.
全节点在双子座25度。
Objective To evaluate the diagnostic accuracy of ultrasound miniature probe (UMP) examination in tumor invasion (t staging) and local lymphatic node metastasis (n staging) for colorectal carcinoma.
目的研究微超声探头(UMP)检查在结直肠癌t、N分期的准确率及结直肠癌术前分期中的诊断价值。
For node number n , the series equations can be written as a linear equations, also can be express as a triangle array as following.
此线性方程组可用追赶法求解，也可用高斯法求解，还可以采用迭代法求解。
Unlike other self-balancing binary search trees that provide worst case O(log n) lookup time, scapegoat trees have no additional per-node overhead compared to a regular binary search tree.
和其它的提供了最坏情况O（logn）查找时间的自平衡二分查找树不同，替罪羊树与普通的二分查找树相比，并没有对每个节点增加额外的开销。
Unlike other self-balancing binary search trees that provide worst case O(log n) lookup time, scapegoat trees have no additional per-node overhead compared to a regular binary search tree.
和其它的提供了最坏情况O（logn）查找时间的自平衡二分查找树不同，替罪羊树与普通的二分查找树相比，并没有对每个节点增加额外的开销。
应用推荐