Направляющее кольцо 95-100-10 (G1-095-100-10)
Направляющие кольца используются в гидравлических или пневматических системах. В основном, имеют косой разрез, тем самым снижают давление на материал во время выдвижения шока, а также облегчают установку на поршень или в буксу. Важной задачей направляющих колец является центрирование поршня / штока гидроцилиндров, а также обеспечение небольших зазоров между штоком и буксой (крышкой), поршнем и гильзой. Использование опорных колец обеспечивает передачу радиальных усилий, поглощая поперечные нагрузки, исключает трение металла с металлом, тем самым кольца уменьшают степень износа поршней и крышек, принимая на себя нагрузку силы трения, а также предотвращают возможность осевых отклонений.
Подобрать аналог Узнать о поступлении
Скидки постоянным клиентам
Самовывоз со склада ежедневно 09:00 — 21:00
Доставка по всей России
Оплата онлайн, наличными и по счёту
С этим товаром покупают
Graph Grammars and Their Application to Computer Science : 5th International Workshop, Williamsburg, VA, USA, November (13-18), 1995. Selected Papers. , Том 5
This book contains a collection of 37 refereed full papers selected from the contributions presented at the 5th International Workshop on Graph Grammars and Their Applications to Computer Science, held in Williamsburg, Virginia, USA, in November 1994.
The book covers the whole spectrum of methods and techniques for the investigation of the structure of graphs and graph transformations. The papers are divided into nine topical sections on rewriting techniques, specification and semantics, software engineering, algorithms and architectures, concurrency, graph languages, pattern and graphics, structure and logic of graphs, and biology.
Computational Complexity Theory
Стр. xiv — Program and publications documenting the interactive activities which are a primary focus of the PCMI. At the summer institute late afternoons are devoted to seminars of common interest to all participants. Many deal with current issues in education; others.
Стр. 314 — Theory and applications of trapdoor functions. In Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, pages 80-91.
Стр. xiii — Preface The IAS/Park City Mathematics Institute (PCMI) was founded in 1991 as part of the «Regional Geometry Institute» initiative of the National Science Foundation. In mid 1993 it found an institutional home at the Institute for Advanced Study (IAS) in Princeton. The PCMI will continue to hold summer programs in both Park City and in Princeton.
Библиографические данные
| Название | Computational Complexity Theory |
| Автор | Steven Rudich, Avi Wigderson |
| Издатель | American Mathematical Soc. |
| ISBN | 0821886924, 9780821886922 |
|   |   |
| Экспорт цитаты | BiBTeX EndNote RefMan |
Combinatorial Algorithms : 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7–9, 2022, Proceedings
This book constitutes the refereed proceedings of the 33rd International Workshop on Combinatorial Algorithms, IWOCA 2022, which took place as a hybrid event in Trier, Germany, during June 7-9, 2022.The 35 papers presented in these proceedings were carefully reviewed and selected from 86 submissions. They deal with diverse topics related to combinatorial algorithms, such as algorithms and data structures; algorithmic and combinatorical aspects of cryptography and information security; algorithmic game theory and complexity of games; approximation algorithms; complexity theory; combinatorics and graph theory; combinatorial generation, enumeration and counting; combinatorial optimization; combinatorics of words; computational biology; computational geometry; decompositions and combinatorial designs; distributed and network algorithms; experimental combinatorics; fine-grained complexity; graph algorithms and modelling with graphs; graph drawing and graph labelling; network theory and temporal graphs; quantum computing and algorithms for quantum computers; online algorithms; parameterized and exact algorithms; probabilistic andrandomized algorithms; and streaming algorithms.