-
They also found some stockpiles of the virus from the 1950s that they still had on an Army base in Maryland,I think.
政府也在马里兰军队驻地发现了,从十九世纪五十年代储存到现在的病毒
-
but I've never, ever, ever played third base. Everything except for third base.
但我从来没打过三垒的位置。除了三垒，我打过所有的位置。
-
it's looking first to see am I in the base case, which I'm done. If I'm not I'm just going to reduce this to a smaller computation.
注意这个计算是干什么的，它先判断我是否属于基础事件,这个我已经做过了。
-
I'd only have 16 possible two base sequences, that's not enough to specify over 20 amino acids.
如果两个碱基一组那一共只有十六种组合,不够和二十种氨基酸来一一对应
-
And by nihilism, I mean the view that every preference, however squalid, base or sordid, must be regarded as the legitimate equal of every other.
我所谓的虚无主义,意指所有偏好，无论如何卑鄙，拙劣，或下贱都必需被视为,与所有其它同等合法。
-
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等于。
-
And then later on, I played pitcher, short stop, first base, outfield,
后来我打过投球手、游击手、一垒位置和外场，
-
And as long as that smaller computation reduces to another smaller computation, eventually I ought to get to the place where I'm down in that base case.
如果我不属于基础事件,那么我需要把它简化为更简单的计算，随着计算的不断简化,最终我能分解成基础事件。
-
Well let's see. My fall back is, I could just do linear search, walk down the list one at a time, just comparing those things. OK. So that's sort of my base. But what if I wanted, you know, how do I want to get to that sorted list? All right?
我只能做线性搜索了,一次遍历一遍列表，一个一个比较，但如果我想要,那怎样得到有序的列表呢？,现在的一个问题是，我们排序之前？
-
There's the base case. If it's longer than one, what do I want to do? Well I'd like to check the two end points to see are they the same character? And if they are, then oh, I just need to know is everything else in the middle a palindrome?
如果只有一个元素也是回文，这是基本事件,如果比一个长的话那么我应该怎么做？,我将会查看两头是否相同？,如果是的,我只要知道中间剩下的部分是不是回文即可？
-
So I'm first going to compute something base move Think of this as kind of the basis from which we'll be computing the actual move.
所以我先计算叫,的东西，called，the，base，move。,它是我们计算实际值时,用到的初值。
-
Need to get the base in. Second thing I want to do, I need to get the height, so I'm going to input a value for the height, also as a float, a floating point.
也就是输入底的值，第二件我想要做的，事情就是得到三角形的高,因此我会输入一个值作为三角形的高，同样也是一个浮点数。
-
So if I were to solve this problem, here's the way I would do it. I would say, first thing I want to do, is I want to input a value for the base as a float.
如果我想要解决这个问题，这就是我要解决它的方式了，第一件我要做的事情就是要,输入一个浮点数作为三角形的底。
-
When do I get down to the base case?
哦对，你又说到我前头去了？
-
So if you have plasmid where you know all the base pairings than you could go through that plasmid and say I want to cut it right here.
如果你已经知道某个质粒上的所有序列,你就可以决定从哪里切开质粒
-
It says, if I am in the base case, if b is equal to 1, the answer is just a.
首先解决基本的，如果b等于1的话，那么答案就是a了。
-
And that then let's me get to, basically, base this code. Having done that, height I simply call base with get float, I call height with get float, and do the rest of the work.
现在让我们看看这段代码，其实已经写好了，我简单的调用下，用来得到一个浮点数，再调用下，来得到另外一个浮点数，然后做剩下的工作就可以了。
-
I need a so-called base case even in my analysis here.
在分析过程中我需要一个所谓的基本条件。
-
If I'm talking about two DNA strands and they differ only in one or two base pairs they won't be exact complements and they won't form this double helix.
假设有两条DNA单链,有一两个碱基不能配对,它们就不能完全互补,也无法形成双螺旋形结构
-
But I want to stress again, as long as I do the base case right and my inductive or recursive step reduces it to a smaller version of the same problem, the code will in fact converge and give me out an answer.
就开心的去做吧,但是我想再次强调,只要基础事件处理正确而我的递归,或递推步骤能把它简化为更简单的同类问题,那么这段代码就可以收敛。
-
And the code over here says, OK gee, if I'm in the base case do something.
如果我属于基础事件就进行一些操作，而我不是，所以往下看这儿。
-
Now, this is not the nicest way to do it but it'll work. I can look at the type of the value of base and compare it to the type of an actual float and see, are they the same?
这不是最好的办法但它确实有用,我可以得到底的值的类型然后,和一个真的浮点数的类型比比,看他们是不是一样？
-
The second question I want to ask is what's the base case? When do I get down to a problem that's small enough that it's basically trivial to solve? Here it was lists of size one. I could have stopped at lists of size two right. That's an easy comparison.
第二个问题是什么是基础条件？,我要将问题分解到何时才使得问题,小到可以解决的基本问题？,这里是当列表的长度为1有时候,我也可以在长度为2的时候停止分解,那是一个非常简单的对比。
-
It says check to see if I'm in that base case.
这段代码是检查目前是否是最基本的情况。
-
Notice if I'm going to have two different sub problems I need to have two base cases here to catch this. And if I only had one it would error out. And as a consequence, I can go off and ask about rabbits. Let's see.
我需要定义两个基础事件来处理它,如果我只有一个基础事件的话就会产生错误,这样我就能够知道到底有多少只兔子了,让我们来看看，在第12个月末,没那么简单，在第二年末兔子就很多了。
-
I'm going to go there initially, so I can move this over here, so I can get the base part of that over there, I want to put that one there before I put this over here, finally I get to the point where I can move the bottom one over now I've got to be really careful to make sure that I don't cover up the bottom one in the wrong way before I get to the stage where I wish they were posts and there you go.
我要先把其他的放到多余的柱子上，然后把最底下的放到目标柱子上，我要在把除了最底下的圆盘，其他的圆盘挪过来之前,把最下面的圆盘放在这儿,因此我得出了最下面的盘子,应该如何摆放的结论,当我没得到其他盘子的正确摆放位置的时候,要很小心的确认没把错误的盘子,放在最下面的盘子上面。
-
And again, if I just run this, just to show that it's going to do the right thing, it says enter base, I'm obnoxious, it says oops, wasn't a float, so we'll be nice about it and I enter a height, and it prints out what I expected. I just concatenated those strings together, by the way, at the end.
我再来运行下看是不是做对了,提示输入底，噢，它提示说不是浮点数，我很高兴，然后我输入一个,浮点数作为高度显示结果和我预期的相同,顺便说一句,我只是在最后把这些字符串连接起来了。
应用推荐