He urged revival of the slave-trade in the late 1850s, and he developed a theory of what he called warranteeism--w-a-r-r-a-n-t-e-e-I-s-m.

他促成了十八世纪五十年代后期,奴隶交易的复苏,还自己发明了一套理论,名为抵押品主义

耶鲁公开课 - 美国内战与重建课程节选

And I know a lot of people over at NYU for N Tisch, and it's very highly competitive.

我认识很多人为了N Tisch去纽约大学，竞争相当激烈。

选择 UCLA 的理由 - SpeakingMax英语口语达人

n If you want a literal percent, it's %% and then backslash n.

如果你想要一个百分比常量，就用%%，然后，反斜杠。

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

So, it turns out that n is not the only quantum number needed to describe a wave function, however. There's two more you can see come out of it.

事实上，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 invented it, we'd call it whatever your name is, but this is the guy who invented it, so it's called a Newton, usually denoted by a capital N.

如果是你发明的,我们就用你的名字当单位,但这个单位是他发明的,所以叫它牛顿,一般用大写字母 N 表示

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

So it's a more specific version of the equation where we have the n final equal to 2.

当我们令n等于2时,使这个这个方程变成更具体的版本。

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

So if n is greater than or equal to 1 and n is less than or equal to 3, let's just judge this thing a small number arbitrarily.

所以n大于等于1，并且n小于等于,我们武断的判定它为,一个小的数字。

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

We can think about the Lyman series, which is 1 where n equals 1. We know that that's going to be a higher energy difference, so that means that we're going to be in the UV range.

我们可以来看看Lyman系,也就是n等于,我们知道它的能量差更大,所以它在紫外光区内。

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

n l So negative e, which is sub n l, because it's a function of n and l in terms of quantum numbers.

也就是负的，E，下标是，因为它是一个,关于量子数，n，和，l，的函数。

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

This should make sense to you, because they don't, in fact, want to gain another electron, because that would mean that electron would have to go into a new value of n, a new shell, and that's really going to increase the energy of the system.

这对大家来说应该容易理解，因为它们实际上不想得到另一个电子，因为这意味着这个电子不得不,到一个新的，n，值更大的壳层上去，这将会增加系统的能量。

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

But that merging process only takes N steps, N*log N so that's N times log of N. Now, it's a little tricky to reason through this perhaps the first time, let's just take a very simple example and see if we can do a little sanity check here.

但这个合并过程只需要N步，所以时间复杂度是,第一次对此进行推论可能会有点儿棘手，我们举一个简单的例子,看看我们能否做一些完整性的检查。

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

So I'm not going to worry whether this item is a vase or a watch or painting I'm just going to say it's the n'th element.

所以我不用担心这个物品,是花瓶还是手表或者油画,我只要说这是第n个元素就好。

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

to the n, every value in the 1 bit vector we looked at last time is either 0 or 1. So it's a binary n number of n bits, 2 to the n.

从2到n，我们上次看到的,位向量的每个值不是0就是,所以它是n，比特的二进制数,从2到。

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

And when you're switching n's, you're actually getting quite a bit farther away.

而当你改变，n，的大小时，实际上每一步你都会变远了很多。

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

C-A-N-S-U An S in the side so Cansu, that was spelled C-A-N-S-U.

有一个S喔。

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