• And so what you want to do and again we'll come back to this later in the term, is something called regression testing.

    却又出问题了,然后你想怎么办呢?,我们会在这学期晚些时候,讨论这个被称为回归测试的东西。

    麻省理工公开课 - 计算机科学及编程导论课程节选

  • Congratulations again to those that did well and let's do what we can to get everybody over to the right of that blue line.

    再次鼓励那些取得好成绩的同学,让我们做我们能做的来让每个人,过及格线。

    麻省理工公开课 - 固态化学导论课程节选

  • So again, let's look at it. What does it say to do Well, it's basically saying a similar thing.

    它是怎么实现的?,它跟上种方法差不多一样吧。

    麻省理工公开课 - 计算机科学及编程导论课程节选

  • I'll show those again, but what I want to do mostly today is try to put a mathematical statement of the second law in place that corresponds to the verbal statements that we saw last time.

    今天我还将跟你们讲这些,但今天的重点是,对上次口头表述内容中的热力学,第二定律,的数学推导,我们上次看到的。

    麻省理工公开课 - 热力学与动力学课程节选

  • Now what I wanted you to do, is I want you all to play again.

    那么现在我们再重新玩一次

    耶鲁公开课 - 博弈论课程节选

  • Again, when we see this evidence, then it starts to help guide us about what we might do to make changes in society in general.

    当我们看到这些事实的时候,我们就知道可能应该怎么做,才能在整体上改变这个社会

    耶鲁公开课 - 关于食物的心理学、生物学和政治学课程节选

  • Well again, maybe what we need to do is not so much just imagine the same cycling going through week after week after week, but whole careers.

    但也许我们不需要,想象周而复始的循环,而是整个事业。

    耶鲁公开课 - 死亡课程节选

  • So, what I want to do today-- again, this is a parallel-holding-pattern lecture.

    我今天要讲的是,再次强调,这是一门同步课程

    耶鲁公开课 - 欧洲文明课程节选

  • What do we do to make them friends again?

    我们怎样才能让他们做回朋友呢?

    耶鲁公开课 - 心理学导论课程节选

  • So the question I want to leave you with today and that I want to pick up again on Wednesday is, ? in the end, what do societies require more of?

    所以我今天想留一个问题,下周二你们要得出一个答案,这个问题就是社会更需要什么?

    耶鲁公开课 - 政治哲学导论课程节选

  • Again, we know what to do.

    我们便知道怎么做了

    耶鲁公开课 - 基础物理课程节选

  • I was just finding very tunnel vision-like, the smallest elements at that moment in time which means I don't know anything about the other elements other than they are not the smallest and so no matter what with Selection Sort I had to repeat this again and again and again and if you do out the math it's roughly N squared steps in the worst case as well.

    我只有一个狭窄的视野,只知道某时刻的最小元素,就意味着我并不知道其他元素的任何情况,只知道它们不是最小的,所以不管怎样,在选择排序中,我就得一遍一遍地重复选择过程,在最坏情况下,大概需要N的平方次比较。

    哈佛公开课 - 计算机科学课程节选

  • Again, we're trying to see if it does what we think it might do.

    好了我们再来看看,它是不是按照我们的预想工作。

    麻省理工公开课 - 计算机科学及编程导论课程节选

  • The other obvious one to do would be worst case. Again, over all possible inputs to this function, what's the most number of steps it takes to do the computation?

    很明显另一种就是针对最坏的情况了,也就是在所有可能的输入,里面选出用的,步骤最多的那个输入?

    麻省理工公开课 - 计算机科学及编程导论课程节选

  • Well,maybe what we should have to do is revise the claim yet again.

    也许我们要做的事再度修改这个说法。

    耶鲁公开课 - 死亡课程节选

  • So if you end up not doing well, the moral of the story is not to go running off and dropping the class, but to figure out what you did right, what you didn't do right, how to make the second paper better and the third paper stronger, again.

    所以如果你们最终没有得到好成绩,这个课程不是让你们退却或是退课,但是去想想你所做的对的事,和不对的事,和怎么样让接下来的论文写得更好。

    耶鲁公开课 - 死亡课程节选

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

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

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