Zobrazeno 1 - 10
of 25
pro vyhledávání: '"number of blocks"'
Publikováno v:
Applied Mathematics and Nonlinear Sciences, Vol 9, Iss 1 (2024)
To explore the influence of interlocking depth and block number on the compressive performance of interlocking block masonry, seven kinds of interlocking depth and three kinds of block number are selected, and ABAQUS software is used to carry out num
Externí odkaz:
https://doaj.org/article/bdf372e94fd04e628eb66c519e50d33c
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 3, Iss 1, Pp 50-55 (2015)
Given a collection of $d$-dimensional rectangular solids called blocks, no two of which sharing interior points, construct a block graph by adding a vertex for each block and an edge if the faces of the two corresponding blocks intersect nontrivially
Externí odkaz:
https://doaj.org/article/3a87e6b08ad943f6976c6bed8ee877e9
Autor:
Ковальчук, Людмила Василівна
Метою цього дослiдження є розгляд рiзних стратегiй атаки на блокчейн Тезос та отримання для них числових оцiнок. Оцiнки рiзних стратегiй ат
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2635::42c280800e4f73cdd21963d5f0884e42
https://ela.kpi.ua/handle/123456789/52074
https://ela.kpi.ua/handle/123456789/52074
We study block statistics in subcritical graph classes; these are statistics that can be defined as the sum of a certain weight function over all blocks. Examples include the number of edges, the number of blocks, and the logarithm of the number of s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::04b5f8e76678b85bdcfc0bf52fb6c5f9
http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-439360
http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-439360
Autor:
Angela Borda, Septimiu Voidazan, Andreea Fișus, Adela Nechifor Boilă, Ancuța Elena Zahan, Ramona Cătană, Ionela Pașcanu
Publikováno v:
Acta Medica Marisiensis, Vol 62, Iss 1, Pp 41-46 (2016)
Background: Papillary thyroid microcarcinoma (PTMC) defines a group of papillary thyroid carcinomas, incidentally discovered, measuring 1 cm or less. The aim of our study was to evaluate the incidence and the pathological characteristics of PTMCs in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::14fecbcd6f3cf2f7916aa439b6f3f316
https://doi.org/10.1515/amma-2015-0108
https://doi.org/10.1515/amma-2015-0108
Autor:
B. V. K. Reddy, Arunn Narasimhan
Publikováno v:
International Journal of Heat and Mass Transfer. 54:636-644
Thermal management of heat generating electronics using the Bi-Disperse Porous Medium (BDPM) approach is investigated. The BDPM channel comprises heat generating micro-porous square blocks separated by macro-pore gaps. Laminar forced convection cooli
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ab328f9658bc9c000381e5764b4ac85e
https://doi.org/10.1016/j.ijheatmasstransfer.2010.08.022
https://doi.org/10.1016/j.ijheatmasstransfer.2010.08.022
Publikováno v:
Heat and Mass Transfer. 46:333-343
Steady state natural convection of a fluid with Pr ≈ 1 within a square enclosure containing uniformly distributed, conducting square solid blocks is investigated. The side walls are subjected to differential heating, while the top and bottom ones a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::20745a3940e84721d5d211b62c77e642
https://doi.org/10.1007/s00231-009-0567-9
https://doi.org/10.1007/s00231-009-0567-9
Publikováno v:
体育学研究. 54(2):381-398
The aim of this study was to enhance the game performance of player S, the setter for the Ts University men's volleyball team, who was having problems with respect to "using combination attacks purposefully to limit the number of blocks by the opposi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=jairo_______::fe4e5e292fdee60aa4a25d4ac6258e67
https://tsukuba.repo.nii.ac.jp/records/37047
https://tsukuba.repo.nii.ac.jp/records/37047
Autor:
Thomas Andreae
Publikováno v:
Discrete Mathematics. 297:144-151
It is shown that two hypomorphic infinite graphs always have the same number of blocks. This settles a problem of Nash–Williams (C.St.J.A. Nash–Williams, Reconstruction of infinite graphs, Discrete Mathematics 95 (1991) 221–229).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::13aaab2f49301e65744927d50450cadd
https://doi.org/10.1016/j.disc.2005.02.015
https://doi.org/10.1016/j.disc.2005.02.015
Autor:
Sergey Pupyrev, Martin Fink
Publikováno v:
Mathematical Foundations of Computer Science 2013 ISBN: 9783642403125
MFCS
Lect. Notes Comput. Sci.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
MFCS
Lect. Notes Comput. Sci.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
A problem that arises in drawings of transportation networks is to minimize the number of crossings between different transportation lines. While this can be done efficiently under specific constraints, not all solutions are visually equivalent. We s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a3626a7b8a44239e69d7a0d04c38bdee
https://doi.org/10.1007/978-3-642-40313-2_36
https://doi.org/10.1007/978-3-642-40313-2_36