He's introducing the reader to a mode of vision different from the vision typically permitted him from within the poem's more or less straightforward, linear, narrative boundaries.
他在向读者介绍一种不同于这首诗里,直白的线状叙述的界限,或多或少已经容许他,显露出的设想有所不同的先见之明。
The reference points are water freezing or boiling, and the interpolation is linear and then that morphed into the Kelvin scale as we're going to see later.
参考点是水的冰点和沸点,插值是线性的,随后它被发展成为开氏温标,我们之后会看到。
We saw some quadratic algorithms, typically those are things with multiple nested loops, or iterative or recursive calls, where you're doing, say, a linear amount of time but you're doing it a linear number of times and so it becomes quadratic, and you'll see other polynomial kinds of algorithms.
我们看过一些平方算法,他们一般进行了多次嵌套循环,或者递归迭代调用,对一个线性操作调用线性次,这样就变成平方次了,以后你们能看到,一些多项式算法。
Again, we're going to take the linear combination of those p atomic orbitals and make what are called pi or some more sigma molecular orbitals.
同样的,我们需要得到,原子p轨道的线性组合,然后组成我们所说的,π分子轨道或者sigma分子轨道。
We know that the Mycenaeans, or at least some small number of them could write, because we have the Linear B script, which we can read. There is no clue that there is such a thing as writing in the Homeric poems.
我们知道迈锡尼人中,至少小部分,是会写作的,因为我们找到了B类线形文字的遗稿,我们能够解读,但在荷马史诗中,却并没有任何线索表明写作这一点
You can choose a linear interpolation or quadratic, but you've got to choose it.
你可以选择线性插值或抛物线型插值,但你总要做出选择。
Typical characterization, not all the time, but typical characterization, is an algorithm that reduces the size of a problem by one, or by some constant amount each time, is typically an example of a linear algorithm.
我们学习过了线性算法,它的典型特征,不是通用的,但是比较典型的特征是,它是逐一减小问题的大小的,或者说是每次减小常数的大小。
Or should I just use the basically linear case?
我是否应该用线性排序呢?
That's it. Again, these other p dxy dyz - or the d x y, d y z, those are going to be those more complicated linear combinations, you don't need to worry about them.
同样,这些p轨道,或者,它们是一些,很复杂的线性组合,你们,不用管它。
I could still do the linear case, which is order n or I could say, look, take the list, let's sort it and then search it. But in that case we said well to sort it was going to take n log n time, assuming I can do that.
我仍然可以做O的线性搜索,或者也可以以这个列表为例,我们先将其进行排序,然后再进行查找,但是在这种情况下,要花费n,log,n的时间去对其进行排序。
应用推荐