Although the average was zero, each interval had a maximum (and a minimum) reading. In this graph, my APM is displaying a flat zero line indicating the average but also the maximum value.
虽然平均值是零，但是每一个时间间隔都有一个最大(和最小)读数。
Say you have a minimum, well, the tangent plane at this point, at the bottom of the graph is going to be horizontal.
如果你说这是个极小值，那么这点的切平面应该是水平的。
Though examples of common signal and sine signal, by the frequency spectrum graph and theoretical analysis, the minimum sample rate of the sampling theorem is made clear.
以一般信号和正弦信号为例，通过理论分析和频谱图示意，对抽样定理中最低抽样率的取值进行了明确的说明。
In the third chapter the criteria of the minimum bend rectilinear extension is derived from the transportation model of generalized equilibrium graph.
第三章在广平衡图模型的基础上，得到了最小折数纵横扩张的判别准则。
Minimizing retransmission nodes in broadcasting is equivalent to minimizing connected dominating set in graph theory, and finding a minimum connected dominating set is NP-complete for graphs.
广播过程中最小化参与转发节点数问题与图论中求解最小连通支配集问题等价，而在任意图中求解最小连通支配集是NP完全问题。
G is called a super restricted edge connected graph if every minimum restricted edge cut separates exactly one edge.
一个图是超级限制边连通的，如果它的任一极小限制边割都孤立一条有最小边度的边。
Binding number and minimum degree conditions for a graph to have fractional factors are studied.
研究了图有分数因子的联结数和最小度条件。
By using Hamilton graph, the problem of wagons placing-in and taking-out on branch-shaped sidings can be turned into searching Hamilton loop of minimum power.
运用图论中的哈密尔顿图，可以将树枝型专用线取送车问题，转化为求哈密尔顿图中权值最小的哈密尔顿回路问题。
The minimum labeling spanning tree(MLST) problem is an NP-hard problem in which, given a graph with labeled edges, one seeks a spanning tree with the least number of labels.
最小标记生成树就是其中之一，它的目标是给出一个边上带有颜色的图，计算使用颜色种类最少的生成树。
Bye formula and the algorithm, we can partition a graph of LSI element into a group of minimum exposure element, to advance exposure efficiency and lithophotography quality.
由此可分割LSI单元图形成最少曝光单元，以提高曝光效率和版图光刻质量。
Given attribute set and minimum cover set of functional dependencies over one relational schema, a new method for designing normalized XML schemas based on schema graph is proposed.
在给定关系模式的属性集及其函数依赖最小覆盖集的基础上，提出一种基于模式图的规范化XML模式设计方法。
In this paper it has been proved by the optimal tree construction of graph theory that Huffman's code is an optimal method of coding with minimum redundancy.
本文用图论中的最优树构成法证明哈夫曼编码方法是最小冗余的最优码。
The edge distinguishing number of a graph G is the minimum number of the distinguishing labelings (colors) of the edges in G for which destroys the symmetries of G.
图的边可区别数是破坏图对称性的最小可区别的边标号数（颜色数）。
The paper gives out an effective calculating method RMA, which changes an arbitrary non-directed graph into a R-side connected graph with minimum enhancement.
本文提出了一个最小地扩充任意无向连通图为r边连通图的有效算法rma。
The optimization problem of constructing a K-edge-connected directed graph from any given directed graph by adding a minimum set of edges is studied.
本文研究了以最小边集扩充一个任意有向图为K边连通有向图这一优化问题。
The crossing number of a graph is the minimum number of pairwise intersections of edges in a drawing of in the plane.
图的交叉数只在好画法中得到，好画法是指满足边自身不交叉，相关联的边不交叉，任意两条交叉的边至多交叉一次的画法。
The problem of seeking monitor-nodes for measuring the network traffic is regarded as the problem of finding out the minimum weak vertex cover of a graph which is NP-hard.
网络流量监测点问题可以抽象为图的最小弱顶点覆盖问题，而求解最小弱顶点覆盖问题是一个NP难题。
A recursive spectral bisection method is applied to partition non-structured triangular meshes in parallel CFD for the treatment of load balance and minimum cut graph bisection.
将递归谱对剖分方法应用于流体力学并行计算中的非结构网格分割，以解决负载平衡和最小切割问题。
Secondly, how to decide the structure of a graph to minimum broadcasting time?
极小广播图问题，即如何确定图的结构使得广播时间最短。
This paper discusses the application of adjacency matrix at the algorithm's analysis for traversing Graph, Minimum cost Spanning Tree, Topological sort and Critical Path.
对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。
Graph shows: with the increase in coal prices, the best ITD value decreases, the minimum total annual cost increases;
关系结果说明随着煤价增加，最佳初始温差值减小，最小年总费用增大；
Second, a minimum-weight spanning tree of the latter graph is computed.
其次求出后者的最小生成树；
Although a few researches have discussed the optimization problem under network coding scenario, their aim is to seek minimum-cost multicast sub-graph.
虽然也有不少研究关注网络编码应用中的优化问题，但都侧重于求解最小代价多播子图问题。
In respect to the shortest path problem of the weighed direct graph, the iterative method of minimum algebra is established.
最短初等链法是求解网络图最短路问题的通用算法，它突破了以往诸算法的局限性，适用范围广，具有广阔应用前景。
In respect to the shortest path problem of the weighed direct graph, the iterative method of minimum algebra is established.
最短初等链法是求解网络图最短路问题的通用算法，它突破了以往诸算法的局限性，适用范围广，具有广阔应用前景。
应用推荐