Zobrazeno 1 - 10
of 106
pro vyhledávání: '"Naoyuki Kamiyama"'
Autor:
Tomohiro Nakajima, Yutaka Iba, Tsuyoshi Shibata, Ayumu Osamura, Naoyuki Kamiyama, Ryo Nishikawa, Junji Nakazawa, Nobuyoshi Kawaharada
Publikováno v:
The Egyptian Heart Journal, Vol 76, Iss 1, Pp 1-5 (2024)
Abstract Background Perforation by pacemaker leads, although rare, is a complication reported since the introduction of pacemaker therapy. Although historically reported frequencies were as high as 5%, recent reports have cited frequencies ranging fr
Externí odkaz:
https://doaj.org/article/14dd51904ae647bea0b0d95b4c9d3056
Autor:
Nagomi Saito, Daigo Nagahara, Naoyuki Kamiyama, Takefumi Fujito, Masayuki Koyama, Atsushi Mochizuki, Toshiyuki Yano, Satoshi Takahashi
Publikováno v:
Journal of Arrhythmia, Vol 39, Iss 1, Pp 61-70 (2023)
Abstract Background Earlier studies have shown male dominance of an early repolarization (ER) pattern and frequent coexistence with high Sokolow‐Lyon voltage. Although possible involvement of androgen is speculated, the underlying mechanism has not
Externí odkaz:
https://doaj.org/article/59621af74f224c29ad6e3c153988fce0
Autor:
Yugo Fujita, Toshiyuki Yano, Hiromitsu Kanamori, Daigo Nagahara, Atsuko Muranaka, Hidemichi Kouzu, Atsushi Mochizuki, Masayuki Koyama, Nobutaka Nagano, Takefumi Fujito, Ryo Nishikawa, Naoyuki Kamiyama, Marenao Tanaka, Atsushi Kuno, Masaya Tanno, Tetsuji Miura
Publikováno v:
ESC Heart Failure, Vol 9, Iss 5, Pp 3435-3451 (2022)
Abstract Aims The role of necroptosis in dilated cardiomyopathy (DCM) remains unclear. Here, we examined whether phosphorylation of mixed lineage kinase domain‐like protein (MLKL), an indispensable event for execution of necroptosis, is associated
Externí odkaz:
https://doaj.org/article/84e976f97d614e998421ecd31d86fcf6
Autor:
Daigo Nagahara, Naoyuki Kamiyama, Takefumi Fujito, Atsushi Mochizuki, Shinya Shimoshige, Tetsuji Miura
Publikováno v:
Journal of Arrhythmia, Vol 36, Iss 4, Pp 624-631 (2020)
Abstract Background Catheter ablation is an effective treatment for atrial fibrillation (AF), but it carries risk of perioperative thromboembolism even in cases with low CHADS2 scores. Here, we examined whether a combination of clinical variables can
Externí odkaz:
https://doaj.org/article/488efa3143f047efa40a2d1edaa70e26
Autor:
Masataka Shirahashi, Naoyuki Kamiyama
Publikováno v:
Journal of the Operations Research Society of Japan. 66:112-129
Autor:
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-Ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Publikováno v:
ACM Transactions on Algorithms. 19:1-22
We initiate the study of k -edge-connected orientations of undirected graphs through edge flips for k ≥ 2. We prove that in every orientation of an undirected 2k -edge-connected graph, there exists a sequence of edges such that flipping their direc
A parameterized view to the robust recoverable base problem of matroids under structural uncertainty
Publikováno v:
Operations Research Letters. 50(3):370-375
We study a robust recoverable version of the matroid base problem where the uncertainty is imposed on combinatorial structures rather than on weights as studied in the literature. We prove that the problem is NP-hard even when a given matroid is unif
Autor:
Nobutaka Nagano, Atsuko Muranaka, Ryo Nishikawa, Wataru Ohwada, Hidemichi Kouzu, Naoyuki Kamiyama, Takefumi Fujito, Atsushi Mochizuki, Daigo Nagahara, Mitsuhiro Nakanishi, Yukiko Ohkubo, Shin Hisahara, Satoshi Nakao, Nagaaki Katoh, Aki Ishikawa, Akihiro Sakurai, Toshiyuki Yano
Publikováno v:
International Heart Journal. 63:168-175
Publikováno v:
SIAM Journal on Discrete Mathematics. 36(2):1102-1123
Motivated by adjacency in perfect matching polytopes, we study the shortest reconfiguration problem of perfect matchings via alternating cycles. Namely, we want to find a shortest sequence of perfect matchings which transforms one given perfect match
Autor:
Naoyuki Kamiyama
Publikováno v:
Operations Research Letters. 49:790-794
In this paper, we consider the problem of checking the existence of an envy-free matching in a many-to-one matching model with one-sided preferences and matroid constraints. For this problem, we propose a polynomial-time algorithm which is a generali