So, let's try another example here, and let's try a case now where instead of dealing with a neutral molecule we have an ion, so we have c n minus.
那么，让我们来试一下另外一个例子，这次不是一个中性原子,而是一个离子，氰离子。
In the case of France, there is the work of a brilliant military engineer called Vauban, v-a-u-b-a-n.
至于法国，这里有一位杰出的军事工程师的作品，工程师名叫 Vauban，v-a-u-b-a-n。
As a special case of the previous example, a segment of integers, [n.. m] can be thought of as a category.
上边例子的特殊情况一个整数片断[n. .M]可以被认为是一个范畴。
In the case of a TLU with an arbitrary number of inputs, n, the set of possible inputs corresponds to a set of points in N-dimensional space.
在TLU有任意数目的N个输入的情况下，一组可能的输入对应于n维空间中的一个点集。
N --O So we introduced this notation big O which generally refers to worst case.
的平方。，So，，N，squared。,这里我们介绍一个符号,它泛指最坏的情况。
In this case, choose the One-of-N policy as shown in Figure 10 and select Next.
在本案例中，选择如图10所示的One - of - n策略，并选择Next。
If you need only to compute the distance and not alignments, as is usually the case, it is easy to reduce this to o (n), since only the previous row is required to compute the next.
如果您只需要计算距离，不需要校准，就像通常情况那样，那么可以很容易地把空间需求降到O (n)，因为计算下一行只需要前面一行。
Therefore, if the total number of guards is n, no ready guard will go unselected for more than n successive selection operations, in the worst case.
所以，如果警卫的总数是n，那么在最坏的情况下，就绪的警卫没获得选中的次数不会连续超过 n 次。
N: Well, in that case, maybe I'll eat some more sandwiches!
尼基：嗯，既然这样，也许我会再多吃点三明治！
So let's start with a case when we have some number of the equations say n equations and n unknown.
所以让我们从一个例子入手，当我们有一些方程式，假定n个方程，n个未知数。
So, if we took the case of nitrogen, if we add an electron to nitrogen and go to n minus, we find that the change in energy is 7 kilojoules per mole.
如果我们以氮为例，如果我们给氮增加个电子令它变成-1价的氮，我们会发现能量的变化是，7，千焦每摩尔。
So, if we think about the second case here where we have c n minus, now we're talking about a molecule with a net charge of negative 1.
那么，如果我们考虑的是第二个例子,也就是氰离子，那么现在我们讨论的是一个净电荷量为负一的分子。
Merge sort has o (n log n) worst-case and average-case performance.
合并排序的最差性能和平均性能为o (nlog n)。
This is the subdirectory of the Lotus Domino data directory on the server that contains the simulated users mail databases - n this case the mail subdirectory.
这是服务器上LotusDomino数据目录中的子目录，其中包含模拟用户的邮件数据库 ——在这里是邮件子目录。
The myroot rule contains one or more rulerefs, each of which has a URI that points to another rule, in this case command1, which is the master rule for an n-gram.
myroot规则包含一个或多个 rulerefs，每个都有一个指向另一规则（本例中是 command1，它是一个 n 元语法的masterrule）的URI。
In this case S N A F U come from “situation normal, all fu**ed up.”
即，SNAFU="situationnormal, allfu**ed up"，（正常的情况全他妈乱了）。
In our statistics process the number of samples is N=736, the reason being some of the papers didn't have a clear source of case.
由于样本中有的研究论文并没有明显的案例来源地，因此此处统计所得的样本数N=736。
In this case, as the P-type and N-type materials, any material generally preferably used for thermoelectric pairs can be used.
在这种情况下，作为P型和N型材料，可以使用通常优选地用于热电偶的任何材料。
The first line of each test case contains two integers m and n, indicating the size of the maze.
每个测试案例的第一行包含两个整数M和N，表明迷宫的大小。
For each case, output sum (n) in one line, followed by a blank line. You may assume the result will be in the range of 32-bit signed integer.
对于每一种情况，SUM在空白行之后的单独的一行输出。假定所有的结果都在有符号的32位整型范围之内。
Unlike other self-balancing binary search trees that provide worst case O(log n) lookup time, scapegoat trees have no additional per-node overhead compared to a regular binary search tree.
和其它的提供了最坏情况O（logn）查找时间的自平衡二分查找树不同，替罪羊树与普通的二分查找树相比，并没有对每个节点增加额外的开销。
A case in point of this is the steady increase in crime in N. y. City.
这方面很好的例子就是纽约市的犯罪率在不断地上升。
The B is obviously redistributed in B steel within the whole carbonized and carbonitrided case because of the interaction between B with N and C during carbonizing and carbonitriding.
含硼钢渗碳和碳氮共渗时，由于硼与氮及碳之间的相互作用，硼在整个渗层范围内发生明显的再分布。
Well, whatever the case, it was cute. Do you live on N 7th too? We could hang out.
那个，无论如何，你当时还挺可爱。你是不是也住北七街？有空一起出来玩吧。
General, if we do not consider the length of pattern, a time complexity o (n) algorithm should be optimal, but the fact is not the case.
一般，如果不考虑模式串的长度，一个具有时间复杂度o (n)的算法应该是最优的了，但是事实不是如此。
In this paper, the density function of n-dimensional P-norm distribution is derived. Laplace, Normal, Rectangular and Degenerate ones are the specific case of one-dimensional P-norm distribution.
本文构造了n维p -范分布的密度函数，使拉普拉斯分布、正态分布、均匀分布与退化分布均为一维p -范分布的特例。
There are multiple test cases. Each case contains a positive integer N, followed by N positive numbers.
大楼中只有一个电梯，请求序列有N个正整数组成，数字表示电梯将在哪里停，按照顺序。
That, in a nutshell, is how D. N. s. works. (It stands for domain name system, in case that helps.)
简而言之，这就是D.N.S。的工作。(它代表了域名系统，如果有益的话。)
That, in a nutshell, is how D. N. s. works. (It stands for domain name system, in case that helps.)
简而言之，这就是D.N.S。的工作。(它代表了域名系统，如果有益的话。)
应用推荐