Analysts say it remains to be seen whether the Palestinians' unilateral effort to get a U.N.security endorsement of a Palestinian state will be sustained or is no more than a publicity stunt meant to get Israel to make concessions.

VOA: standard.2009.11.16

And so when we get to n equals three that would be m shell by the spectroscopists' notation.

当n等于3的时候,根据光谱学家的标记法，那就是第m层。

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

So if I start off with a list of length n, how many times can I divide it by 2, until I get to something no more than two left?

我能够除以多少次2呢？,直到我得到的长度不超过2么？,对数次，对吧？就像刚才那位同学说的那样？

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

So, the optimal thing to do if you live in a world like this n is to get n as large possible and you can reduce the standard deviation of the portfolio very much and there's no cost in terms of expected return.

如果现实中也这样简单的话,那么你就尽量增大,这样就能让投资组合的标准差,就会大大降低,从预期收益率的角度来看,这样做的成本是零。

耶鲁公开课 - 金融市场课程节选

And that in the case of constant volume, U in this case that's my delta u, and then I'll H add my little delta n term to get delta H.

这是在等体情形下，此时的到的是Δ,然后我可以加上Δn的项来得到Δ

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

So instead you'd have to maybe if you start with wavelength, go over there, and then figure out velocity and do something more like kinetic energy equals 1/2 n b squared to get there.

这时你要先从波长开始，到这，然后算出速度,然后像动能等于1/2nb平方得到这。

麻省理工公开课 - 化学原理课程节选

How many times you can divide N by 2 before you get down to 1?

在得到1之前需要将N除以2做几次呢？

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

And you have to get N from experimental evidence.

同时你们也会通过实验得到N的值。

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

If you start with only one, you have two pieces of DNA, then you'll get 2 to the Nth fragments after N cycles because each cycle you're doubling the number.

如果你从仅仅一个DNA开始,你有两条DNA链,经过N次循环后,就得到二的N次方个DNA片段,因为每次循环都使其数量翻倍

耶鲁公开课 - 生物医学工程探索课程节选

I'm accessing a list. How long does it take for me to get the nth element of a list?

我取得数组的第N个元素,需要多长时间呢？

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

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.

所以我log，n遍的n次操作，就得到了,虽然花了不少时间得到了这个结论。

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

If you substitute it all in, you get basically order 2 to the n.

得到的是2的n次方个基本问题，指数级的，这是个问题，好。

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

It would be nice if it was less than linear, but linear is nice because then I'm going to get that n log in kind of behavior.

那么就是一个不错的算法，但是线性方案也是很好的,因为我需要做n次的log级的行为。

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

If they type in bogus characters, it's going to yell at them and make them retry, and eventually I'm going to get handed back an int, which I'm storing in n. Well, if I actually want to judge this number based on its magnitude, well, I can say now, "If n is greater than or equal to one."

如果他们键入了不合法的字符，它将对他们叫喊,然后叫他们重试，最终我将,得到一个int数，它是存储在n中的，好的，如果我的确想要根据它的量级来判定这个数字，好的，现在我可以指明，“是否n大于等于1“

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

And that's just a way of reminding you that we want to think carefully, but what are the things we're trying to measure when we talk about complexity here? It's both the size of the thing and how often are we going to use it? And there are some trade offs, but I still haven't said how I'm going to get an n log n sorting algorithm, and that's what I want to do today.

这只是在提醒你们我们要仔细的思考问题,但是当我们在讨论复杂性的时候,我们到底要衡量哪些东西？,是列表的大小和对其进行查找的频率吗？,这里面临一些取舍,但是我还没有说明,怎样得到一个n，log，n复杂度的排序算法,并且这是我今天想要讲的内容。

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