
词语导航
基本信息
词语:最小图
繁体:最小圖
拼音:zuì xiǎo tú
英语翻译
【计】 minimal graph
分词翻译
最小的英语翻译:
least
【医】 min.; minima; minimum
【经】 minimum
图的英语翻译:
chart; drawing; fig.; map; plot; picture; intention; attempt; plan
【计】 diagram; graphtyper
【化】 diagram
【医】 chart; column diagram; diagram; graph; map; picture; schema; scheme
sheet
翻译例句
1. 图6显示的是第二种方法,该方法只使用单个输入和输出条件,但它会把所有未连接的输入和输出的最小增殖次数设置为零。
Figure 6 shows the second approach, which USES only a single input and output criterion, but sets the minimum multiplicity of all disconnected inputs and outputs to zero.
2. 图20中的模式显示的是第一种解决方案,在其中,项目D被作为Task4的输入,它的最小增殖次数被设置为零。
The pattern in Figure 20 shows the first solution, where the minimum multiplicity of item D as input of Task 4 is set to zero.
3. 这幅Kepler-10b类地行星的艺术效果图呈现出2011年1月公布地已知的最小的行星.
This artist"s concept of Kepler-10b shows the smallest known exoplanet, announced in January 2011.
4. 图3和图4中的输入和输出逻辑选项卡显示了已经定义的最大(和最小)输入和输出数目。
The input logic and output logic tabs in Figures 3 and 4 show the defined minimum and maximum of the inputs and outputs.
5. 我们同时还包含进了集合包,对一系列诸如和,最小,最大,历史图以及计数等等的公共操作提供了内置的支持。
We"ve also included the Aggregate Package with built-in support for a number of common operations such as Sum, Min, Max, Histogram, and Count.
6. 图8显示了结果,其中流程图已减小到最小大小。
Figure 8 shows the results, with the diagram reduced to the minimum size.
7. 任何情况下的目的都是使转换对图影响最小,这样业务分析师才能认识和理解可执行过程图。
In any case, the goal is to have a minimal impact on the diagram so that the business analyst recognizes and understands the diagram of the executable process.Www.weNtIyI.coM
8. 图15展示了逻辑内存块大小以及分区的最小、所需和最大RAM的输入位置。
Figure 15 shows where you"ll enter in the logical memory block size, as well as the Min, Desired, and Max RAM for the partition.
9. 连通性、最大通路和最小通路以及其他图和矩阵的概念在本章中都进行了介绍。
Connectivity, maxima and minima, and other graph and matrix concepts are explained here.
10. 正如你可以从图1中所示看到的,ManualTester的格式丰富的脚本编辑窗口最小化界面滚动需求。
As you can see in Figure 1, Manual Tester"s well-formatted script-editing screen minimizes the need for scrolling.
11. 本系统采用E -R图法进行规范化设计使得数据冗余最小,数据一致性好,更新异常问题不易发生。
This system used E-R chart method to design in order to minimum data redundancy and optimize data consistency and reduce updating abnormity.
12. 设置为仅实时的灯光永远不会被烘培。近端光照图作用于质量设置中的相对摄像机最小阴影距离范围内。
Realtime Only lights are never baked. The Near lightmap set is used within the distance from the camera smaller than the Shadow distance quality setting.
13. 硬开关(图26所示)几乎不考虑漏源极电压的最小值。
The hard switching approach (as shown in Fig. 26) doesn"t consider the minimum drain-source voltage.
14. 目前,这个地图以加利福尼亚州的帕洛阿图市为中心,缩放倍数为13级0级是最小的。
Currently the map is centered over Palo Alto, Calif. at zoom level 13.
15. 高层次综合中通过对冲突围着色方式把操作、变量值、数据传输映射到共享资源中,然而寻找图着色所需的最小颜色数目是个NP难题。
Coloring of conflict graphs has been used in high level synthesis to map operators, values and data transfers onto Shared resources, however, finding a minimum sized coloring is NP hard problem.
16. 基于图象中纹理的预知性,应用最小二乘法及必要的约束条件推导出了该种滤波器。
Based on preknowledge of texture in an image, by using least squares defintion and with needed constraint, the filters are derived.
17. 最小化边交叉数是层次图绘制过程中的一个关键步骤,直接影响着层次图的可读性。
Minimizing edge crossing is a key problem in drawing layered digraphs, and it"s directly involved with the readability of the graph.
18. 采用光子与电子(正电子)的最小电磁耦合模型,获得了光子链图传播子重整化的有限量。
In the minimum electromagnetismcoupling model of interaction between photonand electron(antielectron), we obtain the renormalization finite quantity of photon chain propagator.
19. 提出了一种新的动态启发式二叉判定图(BDD)最小化算法。
A new dynamic heuristic binary decision diagram (BDD) minimization algorithm is proposed.
20. 图的最小顶点覆盖问题是图论中的一个NP完全问题。
The minimal vertex - covering problem of graph is a NP-complete problem of graph theory.
21. 最小系统板与电模拟系统的原理图都有。
Minimum system board with the electrical schematic diagram of the simulation system has.
22. 图3是依照本发明实施例的时序图,其图示说明相位频率检测器的DN输出信号中最小脉冲宽度的示例。
FIG. 3 is a timing diagram that illustrates an example of a minimum pulse width in the DN output signal of a phase frequency detector, according to an embodiment of the present invention.
23. 网络流量监测点问题可以抽象为图的最小弱顶点覆盖问题,而求解最小弱顶点覆盖问题是一个NP难题。
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.
24. 图的最小填充问题是熟知的NP-困难问题。
The fill in problem for graphs is a well known NP hard problem.
25. 最终推出了任意无向加权图K点连通最小扩充的模拟退火算法。
Finally, this paper gave simulated annealing algorithm for K-vertex-connected minimal augmentation on arbitrary undirected weighted graph.
26. 给出了图的最小顶点覆盖问题的质粒DNA计算模型及其实现算法。
DNA computing model and algorithm for the minimal covering problems by plasmids were presented.
27. 给出了图的最小顶点覆盖问题的质粒DNA计算模型及其实现算法。
DNA computing model and algorithm for the minimal covering problems by plasmids were presented.
版权声明:问题易所有作品(图文、音视频)均来源网络,版权归原创作者所有,与本站立场无关,如不慎侵犯了你的权益,请联系我们告知,我们将做删除处理!
