• Scenario 2: Triggering a flow every "n" seconds at a certain time of day.

    场景2特定时间n触发一次

    youdao

  • Allowing this to happen time and time again will slow your metabolism down, down, d-o-w-n ..。

    如果放任这种情况一次次出现,新陈代谢越来越,越来越慢……

    youdao

  • Use Step 3 to calculate n, the number of task executions whose cumulative execution time is sufficiently large.

    使用步骤3计算n执行task次数,这些次执行累计时间必须足够

    youdao

  • So I have n operations log n times, n log n there we go, n log n. Took us a long time to get there, but it's a nice algorithm to have.

    所以logn遍的n操作得到了,虽然了不少时间得到了这个结论。

    youdao

  • The red-black tree is O(log n) in time for most operations, while the previous scheduler employed O(1), using a priority array with a fixed number of priorities.

    对于大多数操作,红执行时间O(logn),以前的调度程序通过具有固定优先级的优先级数使用 O(1)。

    youdao

  • The goal behind measuring n executions of task (n >= 1) is to make the cumulative execution time so large that all the time measurement errors I discuss above become insignificant.

    度量taskn执行目的在于,让累计执行时间足够大,从而减少前面讨论所有时间度量误差的影响。

    youdao

  • Answer: you can always turn off global logging by setting global_logging to N. However, if you want to shave every millisecond from your stored procedure's execution time, comment out all CALL DB2.

    解答可以通过将global_logging设置n全局关闭日志功能然而如果希望节省存储过程执行时的每一毫秒的时间,那么在确信SQL - PL和外部存储过程都已经准备好之后,就可以注释掉所有的CALL DB2。

    youdao

  • N the 20th century, mankind has created material and spiritual wealth unmatched by any other time in history.

    20世纪人类创造物质精神财富超过了以往任何一时代

    youdao

  • Shor's algorithm, for example, is able to find the period of a function of N bits in polynomial time.

    例如 Shor算法多项式时间找到一个N函数周期

    youdao

  • Observing Wall-E’s surroundings, the audience gleans that, in some bygone time, a conglomerate called BnL (for “Buy N Large”) filled the earth with megastores and tons of garbage.

    观察瓦力周围环境观众们了解过去的某个时候一家Bnl(英语“N”的缩写)的集团公司,它的超大型商场数以吨计的垃圾充斥地球

    youdao

  • Although the algorithm itself is complex, it is extremely efficient in practice and operates in o (log n) time.

    虽然算法本身复杂但它实践应用中的效率很高,可以按照o (logn)的时间操作。

    youdao

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

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

    youdao

  • This is unexpected because hash maps have constant time search whereas trees have log(n) search.

    出乎意料因为hashmap搜索时间常量trees的搜索时间却是log(n)。

    youdao

  • Listing 2's implementation runs in o (n) time. I won't prove this, but the running time of Listing 1's naive, recursive implementation is exponential in n.

    清单2中的实现所需时间比清单1短许多,清单2运行时间O (n),清单1中的递归实现的运行时间n指数

    youdao

  • Suppose you had peeked inside the box at the time when the NumbersInt process had already output integers up to a certain n-1.

    假设NumbersInt进程已经把整数输出某个n - 1的时候偷看到了箱子内部

    youdao

  • You can quit adduser any time by typing Ctrl - C , and at the end you will have a chance toapprove your new user or simply type n for no.

    可以任何时候键入Ctrl-C退出adduser,最后次机会来批准用户否则简单地键入n选择no

    youdao

  • x So the mole fraction at any time is n minus x divided by the total number of moles, x which we just calculated as n plus x.

    任何时候摩尔分数n,除以摩尔就是我们计算n

    youdao

  • When xCAT reports that n is booted with the new operating system, instruct TORQUE to enable scheduling jobs to n, set T(n) to the current time plus a quiescent time Q, and move n from L to C.

    xCAT报告n操作系统引导时,指示TORQUE启用 n调度作业T(n) 设当前时间外加停止时间Q nL 移C

    youdao

  • The time to do this in the regular way scales as o (n) (if it takes 1ms to add 100 integers, it takes roughly 2ms to add 200 integers, and so on).

    普通方法实现这种操作所需要时间O (N)(如果100个整数进行求和需要1ms那么对200个整数进行求和需要2 ms,依此类推)。

    youdao

  • Some women take time "to warm up to it," says Marcella Weiner, EdD, PhD, an adjunct professor at Marymount Manhattan College in Brooklyn, N. Y. "Going in and leaving quickly isn't their thing."

    玛赛拉·维纳教育学博士,同时也是位于纽约州布鲁克林区的玛丽曼哈顿学院副教授,她认为有些女人是慢慢的才会进入状态,速战速决根本不是她们的风格

    youdao

  • In addition to the Yale program, which could take several years, he is on track to earn a master's degree in film from New York University this spring. " it's a full-time program, "an n.

    除了可能要花上耶鲁学习计划还正努力今年春天获得纽约大学电影硕士学位

    youdao

  • N that's time we met too.

    我们也是那个时候认识

    youdao

  • Its primary motivation is to reduce the elapsed time of federated queries by enabling overlapped processing of remote queries that provide data to n-ary operators.

    主要动机通过允许重叠处理提供数据n - ary操作符远程查询减少联邦查询所花费时间

    youdao

  • N 'deh kisses Grace on her human mouth for the first, and last, time.

    N'deh第一也是最后一亲吻人类形态grace的嘴唇。

    youdao

  • He spends most of his time at the nets 'practice center in east rutherford n. j.

    多数时间网建于东卢瑟福的训练中心度过。

    youdao

  • If you have an N81 phone, you can now buy N-Gage 2.0 games, and this time, I think Nokia did things right.

    如果拥有N81手机,你现在就能购买n - Gage 2.0的游戏了。我们觉得Nokia在游戏策略上,终于了一

    youdao

  • String.word (n) Gets the NTH word of string "Now is the time".word (2) returns "is".

    word (n)得到字符串n单词Nowisthetime ” . word(2)返回“ is ”。

    youdao

  • Management neglects to properly estimate the time needed to formulate the n-tier strategy conversion and the time for the product development team to become familiar with the n-tier technologies.

    管理层没有正确估计实现n 层架构转换所需时间产品开发团队熟悉 n技术所需的时间。

    youdao

  • Management neglects to properly estimate the time needed to formulate the n-tier strategy conversion and the time for the product development team to become familiar with the n-tier technologies.

    管理层没有正确估计实现n 层架构转换所需时间产品开发团队熟悉 n技术所需的时间。

    youdao

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

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

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