For this report, you want to display a graph of total memory usage per user and then, in a table, break that memory usage down on a per-session basis.
对于这个报告，你需要显示每个用户当前的内存使用情况图，然后在一个表中按照每个会话将内存使用划分。
The curve graph shows that the percentage of family income has declined sharply, accounting for only 13 percent of the total.
曲线图表明，家庭收入比例急剧下降，只占总数的13%。
Each question takes up a proportion of the graph relative to its total of votes.
每个问题占了图形相对于总投票数的部分比例。
Have a look at this graph. It shows the total sales to date.
看一下这个曲线图，它显示了最新的总销售状况。
In this paper the total chromatic conjecture is verified to be true for complete 4-partite graph.
本文对所有4部完全图证实了全着色猜想。
If the relationship between total variable cost and volume of output can be shown as a curved line on a graph, the relationship is said to be curvilinear.
如果产量与总变动成本的变动关系在图上表现出来的是一条曲线，则称是曲线关系。
Each view provides an area graph that charts the progress of completed work against the total estimated work for the specified time duration.
每个视图都提供一个区域图，该图按指定持续时间内估计的总工作量，绘制已完成的工作进度。
A constructible definition of the directed acyclic graph was described, and the reason why exists a solution that does not exceed the total execution time of all tasks was explained.
描述了有向无回路图的构造性定义，指出问题一定有不超过所有任务执行时间总和的解。
This paper presents a total variation(TV) image denoising algorithm based on graph cut.
本文提出一种基于图割的全变差（TV）图像去噪算法。
The adjacent vertex distinguishing total chromatic number is obtained for the flower graph.
得到了花图的邻点可区别全色数。
Given an undirected graph with weights on the vertices, the maximum weight clique problem is to find a subset of mutually adjacent vertices (i. e., a clique) having the largest total weight.
给定顶点赋权的无向图，图的最大权团问题是寻找每个顶点都相邻的顶点子集(团)具有最大权。
The adjacent vertex distinguishing total chromatic number is obtained for the middle graphs of path, cycle, star and fan graph.
本文考虑了图的中间图的邻点可区别全色数，并确定了路、圈、星图和扇图的中间图的邻点可区别全色数。
The graph above shows the total notional value of derivatives relative to US Wealth measures.
以上图表显示：在当前的金融衍生产品的名义价值相对于美国财富措施。
In this paper, We obtain the total genus polynomials for two new classes of 4-regular graphs by using the joint tree model of a graph embedding introduced by Yanpei Liu.
本文利用刘彦佩提出的嵌入的联树模型，得出了两类新的四正则图的完全亏格多项式，并推导出已有结果的两类图的完全亏格多项式。
In this paper, We obtain the total genus polynomials for two new classes of 4-regular graphs by using the joint tree model of a graph embedding introduced by Yanpei Liu.
在刘彦佩提出的联树法的基础上，通过分类一类新图类的可定向嵌入曲面求出了这类图类的可定向嵌入的亏格分布。
Graph shows: with the increase in coal prices, the best ITD value decreases, the minimum total annual cost increases;
关系结果说明随着煤价增加，最佳初始温差值减小，最小年总费用增大；
This graph shows a total of 1086 Man-days spent on this project. 29.4% or 319.5 of these Man-days are a result of Feedback Fixing (both client side and our side).
这个图标反映了在这个项目上所用的整整1086个工作日。这些工作日中的29.4%或319.5都是修改反馈造成的(客户和我们自身双方的原因)。
This graph shows a total of 1086 Man-days spent on this project. 29.4% or 319.5 of these Man-days are a result of Feedback Fixing (both client side and our side).
这个图标反映了在这个项目上所用的整整1086个工作日。这些工作日中的29.4%或319.5都是修改反馈造成的(客户和我们自身双方的原因)。
应用推荐