about icon-addNote android4 Answer apple4 icon-appStoreEN icon-appStoreES icon-appStorePT icon-appStoreRU Imported Layers Copy 7 icon-arrow-spined icon-ask icon-attention icon-bubble-blue icon-bubble-red ButtonError ButtonLoader ButtonOk icon-cake icon-camera icon-card-add icon-card-calendar icon-card-remove icon-card-sort chrome-extension-ru chrome-extension-es-mx chrome-extension-pt-br chrome-extension-ru comment comment icon-cop-cut icon-cop-star Cross Dislike icon-editPen icon-entrance icon-errorBig facebook flag flag_vector icon-globe icon-googlePlayEN icon-googlePlayRU icon-greyLoader icon-cake Heart 4EB021E9-B441-4209-A542-9E882D3252DE Created with sketchtool. Info Kebab icon-lamp icon-lampBig icon-learnHat icon-learning-hat Dislike Loup Loup icon-more icon-note icon-notifications icon-pen Pencil icon-play icon-plus-light icon-plus icon-rosie-cut Rune scrollUp Share-icon Shevron-Down Shevron Left Shevron Right sound sound1 sound2 sound3 sound4 sound2 icon-star Swap icon-translate Trash icon-tutor-ellipsis icon-tutor-flip Tutor folder icon icon-tutor-learned icon-twoWayArrow Mezhdunarodny_logotip_VK vk icon-word pen_icon Logo Logo Logo
без примеровНайдено в 1 словаре

Машиностроение и автоматизация производства
  • Словарь содержит термины по различным видам металлообработки, машиностроительным материалам, металловедению, деталям машин. В словарь включена также терминология по станкам с ЧПУ и по ГАП, по металлорежущим станкам, по технологии обработки на станках, резанию металлов и режущим инструментам, автоматизированному оборудованию, робототехнике и другим областям.
  • Словарь предназначен для научно-технических работников, аспирантов и преподавателей машиностроительных вузов, а также для переводчиков технической литературы.
  • 110 тыс. слов и словосочетаний.

spanning

портального типа, портальный

Примеры из текстов

The terms independent set, basis and spanning set are well-known from linear algebra.
Термины «независимое множество», «база» и «порождающее множество» хорошо известны из линейной алгебры.
Aigner, Martin / Combinatorial TheoryАйгнер, Мартин / Комбинаторная теория
Комбинаторная теория
Айгнер, Мартин
© 1979 by Springer-Verlag New York Inc.
© Перевод на русский язык, «Мир», 1982
Combinatorial Theory
Aigner, Martin
© Springer-Verlag Berlin Heidelberg 1997
Its trunk expanded till its girth became so colossal that it seemed as though it would burst the church asunder like a girdle spanning it too closely.
Ствол ее стал до того огромен, что под его напором церковь треснула, как трескается узкий пояс на раздавшейся талии.
Zola, Emile / Abbe Mouret's TransgressionЗоля, Эмиль / Проступок аббата Муре
Проступок аббата Муре
Золя, Эмиль
Abbe Mouret's Transgression
Zola, Emile
© BiblioBazaar, LLC
Thus since the addition of any line to G results in a hamiltonian graph, any two nonadjacent points must be joined by a spanning path.
Таким образом, поскольку добавление к G произвольного ребра приводит к гамильтонову графу, любые две несмежные вершины соединимы простой остовной цепью.
Harary, Frank / Graph TheoryХарари, Фрэнк / Теория графов
Теория графов
Харари, Фрэнк
© Едиториал УРСС. 2003
Graph Theory
Harary, Frank
© 1969 by Addison-Wesley Publishing Company, Inc.
Of the many spanning trees of G that may be possible, we want to find the one for which the sum of the costs of its links is a minimum.
Из большого числа остовов графа нужно найти один, у которого сумма весов ребер наименьшая.
Christofides, Nicos / Graph Theory. An Algorithmic ApproachКристофидес, Никос / Теория графов. Алгоритмический подход
Теория графов. Алгоритмический подход
Кристофидес, Никос
© 1975 by Academic Press Inc. (London)Ltd.
© Перевод на русский язык, «Мир», 1978
Graph Theory. An Algorithmic Approach
Christofides, Nicos
© 1975 by ACADEMIC PRESS INC. (LONDON) LTD.
This section describes how disk spanning works so that you can have a better understanding about why tools may not exist that meet all your needs.
Я всего лишь объясню, как работает объединение дисков; возможно, это поможет вам понять, почему не существует программы, которая решала бы все ваши задачи.
Carrier, Brian / File System Forensic AnalysisКэрриэ, Брайан
рриэ, Брайан
Кэрриэ, Брайа
© 2005 Pearson Education, Inc.
© Перевод на русский язык, ООО «Питер Пресс», 2007
© Издание на русском языке, ООО «Питер Пресс», 2007
File System Forensic Analysis
Carrier, Brian
© 2005 Pearson Education, Inc.
The KCC makes its decisions based on a spanning tree algorithm.
Средство проверки согласованности знаний принимает решение на основе алгоритма растущего дерева.
Boswell, William / Inside Windows Server 2003Бозуэлл, Уилльям / Внутренный мир Windows Server 2003, SP1 и R2
Внутренный мир Windows Server 2003, SP1 и R2
Бозуэлл, Уилльям
© Издательский дом "Вильямс", 2006
© Pearson Education, Inc., 2003
Inside Windows Server 2003
Boswell, William
© 2003 by Pearson Education, Inc.
Some observations are presented concerning the decomposition of complete graphs into spanning subgraphs regular of degree 1 and 2.
В этой главе приводятся некоторые результаты о разложении полных графов на остовные регулярные подграфы степеней 1 и 2.
Harary, Frank / Graph TheoryХарари, Фрэнк / Теория графов
Теория графов
Харари, Фрэнк
© Едиториал УРСС. 2003
Graph Theory
Harary, Frank
© 1969 by Addison-Wesley Publishing Company, Inc.
The stretching of these lateral threads in tubes 34 leads to a simultaneous tightening of all spanning loops 30.
Натягивание этих боковых нитей в трубочках 34 приводит к одновременному затягиванию всех затягивающих петель 31.
And a genuinely nonimperial Russia will still be a great power, spanning Eurasia, the world's largest territorial unit by far.
И подлинно неимперская Россия останется великой державой, соединяющей Евразию, которая по-прежнему является самой крупной территориальной единицей в мире.
Brzezinski, Zbigniew / The Grand Chessboard. American Primacy and Its Geostrategic ImperativesБжезинский, Збигнев / Великая шахматная доска (Господство Америки и его геостратегические императивы)
Великая шахматная доска (Господство Америки и его геостратегические императивы)
Бжезинский, Збигнев
© 1997, Збигнев Бжезинский
© Перевод О. Ю. Уральской, 1998
The Grand Chessboard. American Primacy and Its Geostrategic Imperatives
Brzezinski, Zbigniew
© 1997 by Zbigniew Brzezinski
The ironing boards were six feet apart, and spanning them was a stretcher made of aluminum poles and lichen-fiber canvas.
Между гладильными досками было расстояние в шесть футов, перекрытое носилками с зеленоватым, как лишайник, полотнищем, натянутым на трубки.
Vonnegut, Kurt / The Sirens of TitanВоннегут, Курт / Сирены Титана
Сирены Титана
Воннегут, Курт
© Издательство "Университетское", 1988
The Sirens of Titan
Vonnegut, Kurt
© 1959 by Kurt Vonnegut, Jr
An eulerian trail in a digraph D is a closed spanning walk in which each arc of D occurs exactly once.
Эйлеров контур в орграфе D — это замкнутый остовный маршрут, в котором каждая дуга орграфа D встречается по одному разу.
Harary, Frank / Graph TheoryХарари, Фрэнк / Теория графов
Теория графов
Харари, Фрэнк
© Едиториал УРСС. 2003
Graph Theory
Harary, Frank
© 1969 by Addison-Wesley Publishing Company, Inc.
The tree polynomial of G is defined as the sum of the terms of its spanning trees.
Многочлен деревьев графа G определяется как сумма слов его остовов.
Harary, Frank / Graph TheoryХарари, Фрэнк / Теория графов
Теория графов
Харари, Фрэнк
© Едиториал УРСС. 2003
Graph Theory
Harary, Frank
© 1969 by Addison-Wesley Publishing Company, Inc.
Show that this order is the same as the order in which the calls of dfs ended when the spanning forest was constructed.
Покажите, что в этом случае список вершин будет совпадать со списком вершин, полученных с помощью процедуры dfs, вызываемой при построении остовного леса.
Ахо, Альфред В.,Ульман, Джеффри,Хопкрофт, Джон / СтруктурыAho, Alfred V.,Ullman, Jeffrey,Hopcroft, John / Data Structures and Algorithms
Data Structures and Algorithms
Aho, Alfred V.,Ullman, Jeffrey,Hopcroft, John
© Addison-Wesley Publishing Company, Inc
Структуры
Ахо, Альфред В.,Ульман, Джеффри,Хопкрофт, Джон
© Издательский дом "Вильямс", 2000
© Addison-Wesley Publishing Company, Inc
© 2000
Figure 10.14 shows the initial shortest spanning tree and the final shortest Hamiltonian path of a 24-vertex graph.
На рис. 10.14 для некоторого графа с 24 вершинами показаны начальный кратчайший остов и окончательная кратчайшая гамильтонова цепь.
Christofides, Nicos / Graph Theory. An Algorithmic ApproachКристофидес, Никос / Теория графов. Алгоритмический подход
Теория графов. Алгоритмический подход
Кристофидес, Никос
© 1975 by Academic Press Inc. (London)Ltd.
© Перевод на русский язык, «Мир», 1978
Graph Theory. An Algorithmic Approach
Christofides, Nicos
© 1975 by ACADEMIC PRESS INC. (LONDON) LTD.
Next, the fixing of having sewed threads by one of the methods described above: the tension of spanning loops 30 as the result of rise of the ring 31 by the lift 33 or tension of the rods, to which are attached the tightening loop 30 threads.
Затем производится фиксация- прошивших нитей одним из описанных выше способов: натяжение затягивающих петель 31 в результате подъема кольца 32 подъемником или натяжения тяги, к которой прикреплены затягивающие петли 31 нити.

Добавить в мой словарь

spanning
портального типа; портальный

Переводы пользователей

Пока нет переводов этого текста.
Будьте первым, кто переведёт его!

Словосочетания

minimal spanning tree
минимальное связывающее дерево
minimal spanning tree routing
маршрутизация по методу минимального связывающего дерева
shortest spanning tree
кратчайший остов
spanning angle
угол охвата
spanning arborescence
покрывающее ориентированное дерево
spanning arc
остовная дуга
spanning forest
остовный лес
spanning hypertree
остовое гипердерево
spanning set
остов
spanning simplex
стягивающий симплекс
spanning subgraph
остовный подграф
spanning subnetwork
остовная подсеть
spanning subtree
остовное поддерево
spanning tree
остовное дерево
spanning tree
связующее дерево

Формы слова

span

verb
Basic forms
Pastspanned
Imperativespan
Present Participle (Participle I)spanning
Past Participle (Participle II)spanned
Present Indefinite, Active Voice
I spanwe span
you spanyou span
he/she/it spansthey span
Present Continuous, Active Voice
I am spanningwe are spanning
you are spanningyou are spanning
he/she/it is spanningthey are spanning
Present Perfect, Active Voice
I have spannedwe have spanned
you have spannedyou have spanned
he/she/it has spannedthey have spanned
Present Perfect Continuous, Active Voice
I have been spanningwe have been spanning
you have been spanningyou have been spanning
he/she/it has been spanningthey have been spanning
Past Indefinite, Active Voice
I spannedwe spanned
you spannedyou spanned
he/she/it spannedthey spanned
Past Continuous, Active Voice
I was spanningwe were spanning
you were spanningyou were spanning
he/she/it was spanningthey were spanning
Past Perfect, Active Voice
I had spannedwe had spanned
you had spannedyou had spanned
he/she/it had spannedthey had spanned
Past Perfect Continuous, Active Voice
I had been spanningwe had been spanning
you had been spanningyou had been spanning
he/she/it had been spanningthey had been spanning
Future Indefinite, Active Voice
I shall/will spanwe shall/will span
you will spanyou will span
he/she/it will spanthey will span
Future Continuous, Active Voice
I shall/will be spanningwe shall/will be spanning
you will be spanningyou will be spanning
he/she/it will be spanningthey will be spanning
Future Perfect, Active Voice
I shall/will have spannedwe shall/will have spanned
you will have spannedyou will have spanned
he/she/it will have spannedthey will have spanned
Future Perfect Continuous, Active Voice
I shall/will have been spanningwe shall/will have been spanning
you will have been spanningyou will have been spanning
he/she/it will have been spanningthey will have been spanning
Future in the Past Indefinite, Active Voice
I should/would spanwe should/would span
you would spanyou would span
he/she/it would spanthey would span
Future in the Past Continuous, Active Voice
I should/would be spanningwe should/would be spanning
you would be spanningyou would be spanning
he/she/it would be spanningthey would be spanning
Future in the Past Perfect, Active Voice
I should/would have spannedwe should/would have spanned
you would have spannedyou would have spanned
he/she/it would have spannedthey would have spanned
Future in the Past Perfect Continuous, Active Voice
I should/would have been spanningwe should/would have been spanning
you would have been spanningyou would have been spanning
he/she/it would have been spanningthey would have been spanning
Present Indefinite, Passive Voice
I am spannedwe are spanned
you are spannedyou are spanned
he/she/it is spannedthey are spanned
Present Continuous, Passive Voice
I am being spannedwe are being spanned
you are being spannedyou are being spanned
he/she/it is being spannedthey are being spanned
Present Perfect, Passive Voice
I have been spannedwe have been spanned
you have been spannedyou have been spanned
he/she/it has been spannedthey have been spanned
Past Indefinite, Passive Voice
I was spannedwe were spanned
you were spannedyou were spanned
he/she/it was spannedthey were spanned
Past Continuous, Passive Voice
I was being spannedwe were being spanned
you were being spannedyou were being spanned
he/she/it was being spannedthey were being spanned
Past Perfect, Passive Voice
I had been spannedwe had been spanned
you had been spannedyou had been spanned
he/she/it had been spannedthey had been spanned
Future Indefinite, Passive Voice
I shall/will be spannedwe shall/will be spanned
you will be spannedyou will be spanned
he/she/it will be spannedthey will be spanned
Future Perfect, Passive Voice
I shall/will have been spannedwe shall/will have been spanned
you will have been spannedyou will have been spanned
he/she/it will have been spannedthey will have been spanned