著者

Yoshizato Tetsuichi Dumitriu Bogdan Hosokawa Kohei Makishima Hideki Yoshida Kenichi Townsley Danielle Sato-Otsubo Aiko Sato Yusuke Liu Delong Suzuki Hiromichi Wu Colin O Shiraishi Yuichi Clemente Michael J Kataoka Keisuke Shiozawa Yusuke Okuno Yusuke Chiba Kenichi Tanaka Hiroko Nagata Yasunobu Katagiri Takamasa Kon Ayana Sanada Masashi Scheinberg Phillip Miyano Satoru Maciejewski Jaroslaw P Nakao Shinji Young Neal S Ogawa Seishi

出版者

Massachusetts Medical Society

雑誌

The New England journal of medicine (ISSN:00284793)

巻号頁・発行日

vol.373, no.1, pp.35-47, 2015-07-02

被引用文献数

456

---

再生不良性貧血における遺伝子変異の解明 -白血病発症にいたる過程を初めて解明-. 京都大学プレスリリース. 2015-07-09.

著者

Hira Asuka Yabe Hiromasa Yoshida Kenichi Okuno Yusuke Shiraishi Yuichi Chiba Kenichi Tanaka Hiroko Miyano Satoru Nakamura Jun Kojima Seiji Ogawa Seishi Matsuo Keitaro Takata Minoru Yabe Miharu

出版者

American Society of Hematology

雑誌

Blood (ISSN:00064971)

巻号頁・発行日

2013-09-13

被引用文献数

146

---

「アルデヒド分解酵素遺伝子」ALDH2が解き明かす難病の謎. 京都大学プレスリリース. 2013-09-13

著者

SHOMURA Yusuke WATANABE Yoshinori YOSHIDA Kenichi

出版者

Institute of Electronics, Information and Communication Engineers

雑誌

IEICE transactions on communications (ISSN:09168516)

巻号頁・発行日

vol.E91.B, no.6, pp.1896-1905, 2008

被引用文献数

12 11

---

Abnormal traffic that causes various problems on the Internet, such as P2P flows, DDoS attacks, and Internet worms, is increasing; therefore, the importance of methods that identify and control abnormal traffic is also increasing. Though the application of frequent-itemset-mining techniques is a promising way to analyze Internet traffic, the huge amount of data on the Internet prevents such techniques from being effective. To overcome this problem, we have developed a simple frequent-itemset-mining method that uses only a small amount of memory but is effective even with the large volumes of data associated with broadband Internet traffic. Using our method also involves analyzing the number of distinct elements in the itemsets found, which helps identify abnormal traffic. We used a cache-based implementation of our method to analyze actual data on the Internet and demonstrated that such an implementation can be used to provide on-line analysis of data while using only a small amount of memory.

著者

SUZUKI Kazuya JIBIKI Masahiro YOSHIDA Kenichi

出版者

電子情報通信学会

雑誌

IEICE transactions on communications (ISSN:09168516)

巻号頁・発行日

vol.E93.B, no.5, pp.1085-1094, 2010-05

被引用文献数

2

---

The availability of IP networks has increased its importance due to the evolving use of real-time and mission-critical applications on IP networks. Methods for preparing alternate routing tables that can be used for fast restoration from link failures have been investigated. In such methods, each node has to compute a number of alternate routing tables in advance since they have to prepare for each potential failure. The resulting huge number of alternate routing tables has prevented these methods from being deployed. In this paper, we propose a method for reducing the number of alternate routing tables for link failure. It analyzes three types of shortest path trees on the basis of link-state information. We show that the number of alternate routing tables can be reduced to 1/100, on average, from that with the conventional method, and that they are small enough to be stored in the memory of IP routers.