Zobrazeno 1 - 10
of 126 409
pro vyhledávání: '"Yokoi A"'
Autor:
Haruna Yokoi, Masae Furukawa, Jingshu Wang, Yu Aoki, Resmi Raju, Yoriko Ikuyo, Mitsuyoshi Yamada, Yosuke Shikama, Kenji Matsushita
Publikováno v:
Nutrients, Vol 16, Iss 17, p 3041 (2024)
Upon review, we have identified an error in the human TNF-α primer sequence reported in Table 1 of our paper titled “Erythritol can inhibit the expression of senescence molecules in mouse gingival tissues and human gingival fibroblasts” [...]
Externí odkaz:
https://doaj.org/article/9301bc1251184ba794a85c2bb45c2494
Autor:
WONG, KENNETH
Publikováno v:
Digital Engineering 247; Sep2024, Vol. 30 Issue 7, p18-22, 3p
Autor:
Kawabata, Takuya, Shimura, Kosuke, Ishii, Yuto, Koike, Minatsu, Yoshida, Kentaro, Yonehara, Shu, Yokoi, Kohei, Subedi, Alaska, Behnia, Kamran, Machida, Yo
When an ideal insulator is cooled, four regimes of thermal conductivity are expected to emerge one after another. Two of these, the Ziman and the Poiseuille, are hydrodynamic regimes in which collision among phonons are mostly Normal. It has been dif
Externí odkaz:
http://arxiv.org/abs/2407.16196
We investigate weighted settings of popular matching problems with matroid constraints. The concept of popularity was originally defined for matchings in bipartite graphs, where vertices have preferences over the incident edges. There are two standar
Externí odkaz:
http://arxiv.org/abs/2407.09798
In this paper, we consider the tractability of the matroid intersection problem under the minimum rank oracle. In this model, we are given an oracle that takes as its input a set of elements, and returns as its output the minimum of the ranks of the
Externí odkaz:
http://arxiv.org/abs/2407.03229
We investigate the tractability of a simple fusion of two fundamental structures on graphs, a spanning tree and a perfect matching. Specifically, we consider the following problem: given an edge-weighted graph, find a minimum-weight spanning tree amo
Externí odkaz:
http://arxiv.org/abs/2407.02958
Autor:
Yokoi, Soma, Sato, Issei
Sum-product networks (SPNs) are probabilistic models characterized by exact and fast evaluation of fundamental probabilistic operations. Its superior computational tractability has led to applications in many fields, such as machine learning with tim
Externí odkaz:
http://arxiv.org/abs/2406.12353
Autor:
Phan, Quoc Toan, Yokoi, Naoto, Makbun, Noppadon, Joshi, Shantanu, Subramanian, K. A., Ngo, Quoc Phu, Dow, Rory A.
Drepanosticta hansruedii nom. nov. Replacement name for Drepanosticta wildermuthi Phan, 2021 Etymology. The species epithet hansruedii, a noun in apposition, selected in dedication to Hansruedi Wildermuth, in appreciation of his support of the first
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bb2ac3039291945bb3a484334f0d4747
Autor:
Phan, Quoc Toan, Yokoi, Naoto, Makbun, Noppadon, Joshi, Shantanu, Subramanian, K. A., Ngo, Quoc Phu, Dow, Rory A.
Drepanosticta wildermuthi sp. nov. Phan (Figures 9���12) Holotype. 1 ♂, Doi Cao, Bao Loc District, Lam Dong Province (11.64306 N, 107.6889 E, altitude 746 m), 15.iv.2017, Quoc Toan Phan leg. Paratypes. 1 ♀, same data as holotype; 4
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fe775b81f631bcd211fca77044b9f8bf