标号

biāo hào
  • number;label;grade;key;indicia
标号标号
标号 [biāo hào]
  • (1) [grade]

  • (2) 矿砂或矿石的相对值或含量

  • (3) 某些产品用来表示性能的数字(如水泥)

标号[biāo hào]
  1. 基质沥青标号对SBS改性沥青低温性能的影响

    Influence of the Grade of Base Asphalt on Low Temperature Performance of SBS Modified Asphalt

  2. SBS改性沥青的低温性能受到基质沥青标号、油源和改性剂结构、掺量的共同影响。

    The low temperature performance of SBS ( styrene-butadiene-styrene ) modified asphalt is influenced by the grade and source of base asphalt and the structure and content of modifier .

  3. 400号以下的水泥是低标号水泥。

    Cement below No.400 is low-grade cement .

  4. 图的一类全标号B,咪唑啉类;

    A KIND OF TOTAL LABEL OF GRAPHS an imidazoline ( B );

  5. 关于几类DNA标号图和DNA图的结果

    On Results about Several Types of DNA Labeling Graphs and DNA Graphs

  6. 书本图Bm的协调和相继标号

    On harmonious and sequential labelings of books b_m

  7. 最大度是3的2-连通外平面图的(p,1)-全标号

    ( p , 1 ) - Total Labelling of 2-connected Outerplanar Graphs with Maximum Degree 3

  8. 几类圈构造图的(p,1)-全标号

    The ( p , 1 ) - Total Labeling of Few Kinds of Structured Cycle Graphs

  9. 标号矩形被1×K矩形复盖的计数

    Enumeration of Coverings of Labeled Rectangles by 1 × k Rectangles

  10. 石材铺设自动标号及输出加工单的CAD设计

    THE CAD design of stone laying auto numbering and process sheet output

  11. 给这个连接标号为failure。

    Label the connection failure .

  12. 本文给出了对任意的阶数n,舵轮图Hn的强协调标号。

    In this paper the strongly harmonious labelings of Helm graphs with any order are given .

  13. 标号迁移系统(LabelledTransitionSystem,LTS)是形式化一致性测试的重要研究方向。

    Labelled transition system ( LTS ) is an important research aspect of formalization analysis .

  14. 多约束ATM网络路由选择的改进多标号算法

    An Improved Routing Algorithm Subject to Multiple Constraints for ATM Networks

  15. 并发表达式与安全标号Petri网

    Concurrent Expression and Safe Labelled Petri Net

  16. 拒绝测试(refusaltesting)是标号变迁系统LTS测试领域中的一个重要理论。

    Refusal testing is an important one among the theories of testing labeled transition systems .

  17. 在网络G(w)中,各顶点的标号为与该顶点相邻各边的权之和。

    The label of a vertex in G ( w ) is the sum of the weight of its incident edges .

  18. 图G的边的一个标号f是指边集E(G)到自然数的子集的一个一一映射。

    An edge - labelling f of a graph G is a 1-1 map from E ( G ) into the natural numbers .

  19. 在应用方面,由于互联网上的节点可以被唯一标定,唯一标号图分析算法就被成功地用于对Web权威资源的分析工作中。

    As to the applications , since the Web nodes and pages can be labeled using URL , these algorithms are used to analyze the authoritative resources on the Web .

  20. IPv6流标号的分析与研究

    Research on IPv6 Flow Label

  21. NCS颜色空间标号的扩充方法研究

    Research on the extension of NCS color space notations

  22. 图G的对偶带宽是指图G中相邻两点最小标号差的最大值。

    The dual bandwidth of a graph G , denoted by ( G ), is the maximum value of the minimum labelling variance of any two adjacent vertices in G.

  23. 方法VB6.0编制软件,采用图象两值化,扫描标号法等分析方法测定毛细血管数。

    Methods Software was made by VB6.0 version , including the binary fashion image and coding .

  24. 低标号混凝土桩(LC桩)由于其工作原理及经济等因素,应用前景十分广泛。

    The pile of low strength concrete ( LC pile ) has very extensive applied foreground because of its working principle and economic factor .

  25. 在采用位置匹配机制的检索方法中,将音节Lattice解释为具有特定位置标号的若干竞争集的级联,给出了相应的搜索匹配方法,以及匹配路径处于特定位置的后验概率值的计算方法。

    In position based matching method , syllable lattice is explained as a sequence of some competition sets and then position specific posterior probability is calculated for all candidates .

  26. 每条边称为一个命题(statement),都有一个主语(subject)(边的源点)、一个谓词(边的标号)和一个宾语(object)(边的宿点)。

    Each edge , called a statement , has a subject ( where the edge points from ), a predicate ( the edge 's label ), and an object ( where the edge points to ) .

  27. 管网方程Jacobi矩阵的一维压缩存贮与管网图节点标号的优化

    Memory Condensation of the Jacobi Matrix of Pipe Network Equation and Optimization of Node Symbols in the Pipe Network

  28. 本文给出具有2k个奇度点的p阶标号图及具有2k个奇度点的(p,q)标号图的计数公式。

    Abstract In this paper we obtain the counting formulae of labeled graphs of order p and ( p.q ) labeled graphs with 2k points of odd degree .

  29. 整数标号的Brouwer不动点的构造性算法

    A Constructive Proof of Brouwer 's Fixed Point Theorem Based on Integer Labelling

  30. 用调整顶点标号的方法确定了3正则连通图的Cordial性。

    In this paper , we give a method by changing labels to determine the cordiality of the connected 3-regular graphs .