• How many binary trees can find that haven Node and the height of these tress are n-3?

    多少二叉可以发现n节点这些枝条n - 3高度吗?

    youdao

  • 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 的函数,让我们来看(1n任何给出输出节点有多大影响;(2)输出节点本身对网络整体误差多少影响。

    youdao

  • 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。

    youdao

  • 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节点标识

    youdao

  • For each node n in the list L, carry out re-provisioning as follows

    对于列表L每个节点n执行重新供应如下所示

    youdao

  • 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})依赖节点,添加针对子节点创建页面导航操作

    youdao

  • On the one hand, the more n influences an output node, the more n affects the net's overall error.

    一方面n影响一个输出节点越多n造成网络整体误差也越多。

    youdao

  • For a dependent node that is related to its parent with a multiple {0..n} cardinality, it applies this pattern

    对于一个与其节点具有 {0..n}关系依赖节点来说,应用模式

    youdao

  • At any time t, a node n is eligible for provisioning if t > T(n).

    任何时间t如果 t > T(n),则节点 n具有供应资格。

    youdao

  • 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)。

    youdao

  • 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节点)访问后端应用程序

    youdao

  • 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的平方增长。

    youdao

  • The Numbers after the node names on the right-hand side indicate that it's the n-th concurrent compile.

    右边节点后面数字指出n个当前编译文件。

    youdao

  • 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]。

    youdao

  • n.lastpost(): the set of XML nodes that match the last element of an XPath rooted at node n

    lastpost() :与节点 n XPath最后一个元素匹配XML节点

    youdao

  • n.firstpos(): the set of XML nodes that match the first element of an XPath rooted at node n

    firstpos() :与节点nXPath第一元素匹配XML节点

    youdao

  • 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网络下的实时电压稳定监视分析具有重要意义。

    youdao

  • N. Node is in 10 Degrees Sagittarius.

    节点射手座10

    youdao

  • N. Node is in 25 Degrees Gemini.

    节点双子座25

    youdao

  • 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)检查直肠癌tN分期准确率及结直肠癌术前分期中的诊断价值。

    youdao

  • For node number n , the series equations can be written as a linear equations, also can be express as a triangle array as following.

    线性方程组可用追赶法求解,也可用高斯法求解,可以采用迭代法求解。

    youdao

  • 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.

    其它提供了最坏情况Ologn查找时间自平衡二分查找不同,替罪羊树与普通的二分查找树相比,并没有对每个节点增加额外开销

    youdao

  • 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.

    其它提供了最坏情况Ologn查找时间自平衡二分查找不同,替罪羊树与普通的二分查找树相比,并没有对每个节点增加额外开销

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定