"The problem with resistance means that we might be facing a situation where our currently, mostly susceptible epidemic is replaced in a decade or two by mostly multi-drug resistant disease,".
VOA: standard.2009.12.09
So, where is Nabokov in here? I think that's one of the places where Nabokov is. It's Nabokov meditating on this problem.
那么,在这一段中纳博科夫在哪里呢?我,认为这是他所,存在的一个地方,纳博科夫正在沉思这个问题。
This is where Milton began to consider the problem of temptation that, of course, will become so important to Paradise Lost.
正是从这里弥尔顿开始思考诱惑的问题,当然,诱惑的问题在《失乐园》中变得十分重要。
"There is a problem with the judiciary. There is a problem with the notion of being able to take cases to the courty, cases where journalists are threatened, publications are supressed, or information distorted.
VOA: standard.2009.11.02
A log algorithm typically is one where you cut the size of the problem down by some multiplicative factor.
对数级复杂度的算法就是指,通过一系列常量级步数的操作,可以将问题的规模。
"It is an age-old problem in politics, where in general in American politics, the candidate who appeals most to the most fervent members of the party wins the primary and then often has a very difficult time appealing to the broader electorate."
VOA: standard.2010.05.19
Where is the ingenuity there and how can we leverage that in our own problem solving?
那么其独创性在哪里?,我们在解决实际问题时该怎么去利用它?
This is where, the way that we should start every problem set or ever problem.
这是我们,解决任何问题的最初一步。
Well, this is an approach that's been used in a variety of vaccines, most successfully with Hepatitis B, so the problem is where do you get these proteins?
这种方式,已经为许多种疫苗使用,乙型肝炎疫苗是最成功的,但问题是该从哪里获得这些蛋白质呢
Right now at this point in our course, whenever you have a problem where there is some body and someone says, "Write all the forces on it", what you have to do is very simple.
现在在我们这个课程里,如果你遇到一道题目,题目给了你一个物体,并要求你,"写出该物体所受的所有力",你要做的其实很简单
Immanuel Kant described very well the problem with skepticism when he wrote "Skepticism is a resting place for human reason, where it can reflect upon its dogmatic wanderings, but it is no dwelling place for permanent settlement."
康德曾很贴切地描述了怀疑论的不足,他写道,怀疑论是人类理性暂时休憩的场所,是理性自省,以伺将来做出正确抉择的地方,但绝非理性的永久定居地“
and we like log algorithms, because they're really fast. A typical characteristic of a log algorithm is a pro-- or sorry, an algorithm where it reduces the size of the problem by a constant factor.
并且我们也很喜欢对数算法,因为它很快,对数算法的典型特性是高速,哦,抱歉,是他能以常数因子的速度,降低问题的大小,很明显。
But let's look for a slight variant of it, where greedy is not so good. And that's what's called the zero-one knapsack problem.
但是让我们找一找它的一些变种,在这些变种中贪婪算法用处不大,这些问题也就是0/1背包问题。
So the running time of the problem where the input is T of size N as expressed here formulaically, T of N, the running time of an algorithm, given an input of size N. You know what?
因此一个输入为N的问题的运行时间,在这儿的公式表示为,如果输入为N,那么此算法的运行时间,是多少呢?
应用推荐