nonadjacent
英音[ ˌnɒnəˈdʒeɪsənt ] 美音[ nɑːnəˈdʒeɪsənt ]

不相邻的

常用释义

词性释义

不毗连的
例句
  • 全部
  • 不相邻的
1·Nonadjacent Nesting of Levels from the same Hierarchy
来自相同层次结构的级别的不相邻嵌套
2·When using an OLAP-based package, a report with nonadjacent levels from the same hierarchy produces the following error.
使用基于OLAP的包时,来自相同层次结构的级别的不相邻嵌套的报告将生成以下错误消息。
3·When using OLAP based packages, reports with nonadjacent levels from the same hierarchy will produce the following error.
在使用基于OLAP的程序包时,具有来自同一等级结构的不相邻等级的报表会产生以下错误。
4·Results. In 31 patients 35 VBs were classified as adjacent-level fractures, and in 14 patients 14 VBs were classified as nonadjacent-level fractures.
结果:31例患者35个骨折椎体为邻近节段骨折组,14个骨折椎体为非邻近节段骨折组。
5·The following case study illustrates the migration of a report in which the report author utilizes levels from the same hierarchy in a nonadjacent format.
下面的案例研究展示了如何迁移这样一个报告:报告作者在报告中以不相邻格式利用来自相同层次结构的级别。
6·The following case study will step a user through the transition of a report in which the report Author utilizes levels from the same hierarchy in a nonadjacent format.
以下案例研究将让一个用户逐渐转换一个报表,其中报表创建者以不相邻的格式利用来自同一等级结构的级别。
7·Degree sum conditions of ID-factor-critical graphs are studied. A lower bound for the degree sum of any two nonadjacent vertices such that G is ID-factor-critical is obtained, and the bound is sharp.
本文研究ID-因子临界图的度和条件,得到使得图G是ID-因子临界图的任意两个不相邻的顶点的度和的下界,同时说明这些结果是最好可能的。
1·Degree sum conditions of ID-factor-critical graphs are studied. A lower bound for the degree sum of any two nonadjacent vertices such that G is ID-factor-critical is obtained, and the bound is sharp.
本文研究ID-因子临界图的度和条件,得到使得图G是ID-因子临界图的任意两个不相邻的顶点的度和的下界,同时说明这些结果是最好可能的。
更新时间:2025-05-02 19:58