-
VOA: special.2010.04.12
-
And the complete description, as I said, n l m is from n l and m.
我说过完整的描述，需要。
-
n I know this is okay because I'm not using n until I myself put something there.
我知道这是正确的因为我不会使用,直到我给它赋值了。
-
VOA: special.2009.06.07
-
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个元素就好。
-
Then, if n = 100--now I'm going to label this x differently, I'm now going to show the normal bell-shaped curve and I'm going to do this from 0 to .4.
如果n=100,现在我得重新标x值,我现在要画正态分布的钟形曲线了,在这儿用0到0.4
-
So, what we're saying is that we have n equals to 4, and m sub I being equal to negative 2.
我们说的是ｎ等于４,ｍｌ等于－２
-
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.
他促成了十八世纪五十年代后期,奴隶交易的复苏,还自己发明了一套理论,名为抵押品主义
-
Why didn't they keep right on going with G, H, I, J, K, L, M, N, O, P?
为什么他们不接着写下去呢,按照字母表
-
And so when we get to n equals three that would be m shell by the spectroscopists' notation.
当n等于3的时候,根据光谱学家的标记法，那就是第m层。
-
In the case of Nimes, N-I-M-E-S, which was largely a Protestant town, they knocked down the wall so the Protestants of Nimes could not defend themselves against this all-conquering Catholic monarch.
以尼姆为例,那儿曾经是一座新教徒的城市,但统治者们拆毁了围墙,所以新教徒们再也无法对抗,所向无敌的天主教统治者了
-
I declare a variable called n. I'm not giving it a value yet, so I had better be careful.
我申明一个变量n，我先不给它赋值，所以我最好小心点。
-
But it grows pretty rapidly, as n goes up, and I'm going to show you an example in a second.
解决问题需要的时间会急剧增长，一会儿我会让大家看个例子的,我想大家注意的还是。
-
In contrast, if we're taking the wave function and describing it in terms of n, l, m sub l, and now also, the spin, what are we describing here?
相反，如果我们考虑一个波函数,然后用ｎ，ｌ，ｍ小标ｌ,还有自旋，我们描述的是什么？
-
PROFESSOR: OK. We can have n 4, l 3, and then, sure, we can have m sub l equal negative 2 if l equals 3 What's the second value of l that we can have?
教授：嗯，我们有ｎ４，ｌ３,然后我们有ｍｌ等于－２，如果ｌ等于３,ｌ可以有的第二个值是多少？
-
So if on each iteration of merging I'm doing eight things or more generally, N. That then begs the question, how many levels of this tree are there actually?
可见对于合并我需要迭代8次,一般情况下是N，这取决于具体问题，那么在这棵树中一共有多少层呢？
-
Just by n, l, m, s is inadequate.
仅仅靠n，l，m，s是不够的。
-
N 6 Sixteen, so that's 16 times log base 2 of 16 and though I'm writing small here, log base 2 of 16, 16 this gives me 4 'cause 2 to the 4 equals 16.
是多少呢？，Well，，N，is，what？,16，那就是16乘以以2为底16的对数6,在这儿我将2写小一些，以2为底16的对数是4，因为2^4等于。
-
Again, the reason for that is because the energy only depends on the n value here, it doesn't depend on l or on m.
因为，能量,只和n的值有关，与l和m的值无关。
-
So, our next level up that we can go is going to be the n equals 2 energy level, but we also have an l and an m value, 0 so our lowest l is going to be a there.
所以下一个能量,是n等于2的能级，但我们还有l和m的值，所以我们最低的l等于。
-
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级的行为。
-
They divide by n-1 to make it an unbiased estimator of the population variance, but I'm just going to show it in a simple way here.
当除以n-1表示的是对总体的,无偏估计,我在这里只是说的简单一点
-
OK. What does that say? I'm going to change MinIndex min index to also point there n value is 8, j starts off here, and I say, OK, is the thing I'm looking at here smaller than that? Yes.
好的，这意味着什么？,我打算交换，让它也指向那里，MinVal是8，j从这里开始,我要找的值比这个小么？是的。
-
For n = --now I'm going to do n = 100.
对于n=...我假设n=100
-
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“
-
I'm plotting--this is the probability of various values of x/n.
这里是x/n等于各个值的概率
-
k * n m plus k all times log n is in general going to be much better than k times n.
在普遍情况下要远远好于,实际情况要取决于n和k的取值。
-
And I'm using the so-called "assignment operator," a single equals sign to store in n what?
我用了一个复制操作符“,一个等号向n中存储了什么？
-
Every Saturday morning I'm going through Stop 'N Shop and there's Nora Jones in the background playing.
每周六我都会路过"Stop 'N Shop"超市,那里总在放诺拉·琼斯的歌
-
And in this case, we go from 8 to 4 to 2 to 1 three times and then on each iteration of this algorithm, each pass across the board I'm touching N numbers, so that means I'm doing N things, log N times.
在这个例子中，我们从8得到4，到2，再到1，是3次,在这个算法的每次迭代中，每一趟我都会操作N个数，也就是所我每次要做N步操作，一共要做，log，N，次。
应用推荐