Misc - YOSHIHIRO Takuya

黒毛和牛の肉質に関連するバイオマーカーの探索

池上春香, 永井宏平, 吉廣卓哉, 園陽平, 小林直彦, 松橋珠子, 大谷健, 中川優, 森本康一, 松本和也

日本畜産学会大会講演要旨   109th   2008

黒毛和牛の枝肉形質を診断するバイオマーカー候補タンパク質の探索:白色脂肪組織の大規模プロテオーム解析

池上春香, 園陽平, 永井宏平, 吉廣卓哉, 井上悦子, 小林直彦, 松橋珠子, 大谷健, 中川優, 森本康一, 松本和也

生化学     2008

ウシの枝肉形質を規定するバイオマーカーの探索-質量分析を用いたタンパク質アイソフォームの解析-

池上春香, 永井宏平, 吉廣卓哉, 井上悦子, 園陽平, 小林直彦, 松橋珠子, 大谷健, 中川優, 森本康一, 森本康一, 松本和也, 松本和也

質量分析総合討論会講演要旨集   56th   2008

飛騨牛由来白色脂肪組織の大規模プロテオーム解析

池上春香, 永井宏平, 吉廣卓哉, 園陽平, 小林直彦, 松橋珠子, 大谷健, 中川優, 森本康一, 松本和也

日本畜産学会大会講演要旨   108th   4   2007.09

ブランド牛（飛騨牛）の品質向上のための肉質データベースシステムの構築

山本 直樹, 井上 悦子, 吉廣 卓哉, 中川 優, 小林 直彦, 永井 宏平, 池上 春香, 松本 和也, 川路 英哉

第69回全国大会講演論文集   2007 ( 1 ) 437 - 438   2007.03

Large-scale Proteomic analysis of white adipose tissue from Hidagyu (black beef cattle)

池上春香, 永井宏平, 吉廣卓哉, 園陽平, 小林直彦, 松橋珠子, 大谷健, 中川優, 森本康一, 森本康一, 松本和也, 松本和也

日本プロテオーム学会大会プログラム・抄録集   2007 (Web)   2007

優良肉質を規定するバイオマーカー候補の探索:飛騨牛をモデルとして

池上春香, 永井宏平, 吉廣卓哉, 園陽平, 小林直彦, 松橋珠子, 大谷健, 中川優, 森本康一, 松本和也

生化学     2007

A New Interactive Graph-based Visualization Method for Large-scale Clustering Analyses

INOUE Etsuko, YOSHIHIRO Takuya, NAKAGAWA Masaru

IPSJ SIG Notes ( Information Processing Society of Japan (IPSJ) )  2006 ( 118 ) 21 - 28   2006.11

　View Summary

This paper presents a new interactive graph-based visualization method for large-scale clustering analyses. Generally in graph-based visualization, the number of nodes and links seriously increases as the size of data becomes large, which results in overcrowded graphs with lots of nodes and links. To avoid the problem, we propose a new method which keeps the number of nodes and links while changing view levels between general view to see highly clustered nodes and the detailed view to see each element of data. The novel feature of our method is that we can explore the whole clustering result with our real-time operations in our viewer. To realize such interactive viewer, we present data structure and algorithms to make real-time changes of graph shape within a short time not to have users feel any stress. We also implement such viewer and make evaluation about user operations.

A new interactive graph-based visualization method for large-scale clustering analysis

井上 悦子, 吉廣 卓哉, 中川 優

Digital libraries ( ディジタル図書館編集委員会 )  ( 31 ) 36 - 43   2006.11

B-7-49 A Distributed Address Auto-configuration Method Which Protects Existing Communications

Kuroki Ayaka, Yoshihiro Takuya

Proceedings of the IEICE General Conference ( The Institute of Electronics, Information and Communication Engineers )  2006 ( 2 ) 145 - 145   2006.03

A Database System to Support Nursing Diabetic People Using Mobile Phones

Ikemoto Kazuhiro, Kawamura Izumi, Morihama Daisuke, Yoshihiro Takuya, Mori Kumiko, Kagawa Sachiko, Yamamoto Yasuhisa, Nakagawa Masaru

IPSJ SIG Notes ( Information Processing Society of Japan (IPSJ) )  2006 ( 9 ) 197 - 202   2006.01

　View Summary

In this paper, we introduce a system to support nursing diabetic people which is developed by Wakayama University and Wakayama Rousai Hospital. In our system, patients send the diabetic self-treatment data such as meal, exercise, taking medicines and insulin, using mobile phones. Then nurses in the hospital check the data and if they found something wrong, they can give some advice to the patients. We designed the system to enable nurses to understand patients' state as well as not to take patients' labor to send data. In this paper, we explain about the system and report our attempts to use the system.

A Database System to Support Nursing Diabetic People Using Mobile Phones

IKEMOTO Kazuhiro, KAWAMURA Izumi, MORIHAMA Daisuke, YOSHIHIRO Takuya, MORI Kumiko, KAGAWA Sachiko, YAMAMOTO Yasuhisa, NAKAGAWA Masaru

IPSJ SIG Notes ( Information Processing Society of Japan (IPSJ) )  2006 ( 9 ) 197 - 202   2006.01

　View Summary

In this paper, we introduce a system to support nursing diabetic people which is developed by Wakayama University and Wakayama Rousai Hospital. In our system, patients send the diabetic self-treatment data such as meal, exercise, taking medicines and insulin, using mobile phones. Then nurses in the hospital check the data and if they found something wrong, they can give some advice to the patients. We designed the system to enable nurses to understand patients' state as well as not to take patients' labor to send data. In this paper, we explain about the system and report our attempts to use the system.

A Flexible Load-balancing Method Using a Secondary Routing Table

YAMAMOTO Toru, YOSHIHIRO Takuya

情報処理学会研究報告インターネットと運用技術（IOT） ( Information Processing Society of Japan (IPSJ) )  2006 ( 6 ) 43 - 48   2006.01

　View Summary

In the current Internet, routers use only one routing table that is computed automatically based on the link costs configured by network administrators. However, this mechanism prevents us from making a well-balanced use of network resources, because packets tend to pass several particular links under the shortest-path based routing environment. In this paper, we expand a link-state type IGP routing protocol with a secondary routing table so that each router have two disjoint paths for every destination. By using those two paths, each router can make a good selection of packet forwarding paths based on the locally measured traffic load information. We implemented our proposed method on ns-2, and report the simulation results.

A Flexible Load-balancing Method Using a Secondary Routing Table

YAMAMOTO Toru, YOSHIHIRO Takuya

IEICE technical report ( The Institute of Electronics, Information and Communication Engineers )  105 ( 530 ) 43 - 48   2006.01

　View Summary

In the current Internet, routers use only one routing table that is computed automatically based on the link costs configured by network administrators. However, this mechanism prevents us from making a well-balanced use of network resources, because packets tend to pass several particular links under the shortest-path based routing environment. In this paper, we expand a link-state type IGP routing protocol with a secondary routing table so that each router have two disjoint paths for every destination. By using those two paths, each router can make a good selection of packet forwarding paths based on the locally measured traffic load information. We implemented our proposed method on ns-2, and report the simulation results.

果樹のストレス耐性比較システムの構築

井上悦子, 吉廣卓哉, 川路英哉, 村上英宗, 根来圭一, 花田裕美, 和中学, 中川優

園芸学会雑誌 別冊   75 ( 1 )   2006

LIMSを用いた生物資源の統合的なプロテオーム解析

永井宏平, 森本康一, 吉広卓哉, 池上春香, 剣持聡久, 上条憲一, 奥野充利, 中川優, 松本和也

日本畜産学会大会講演要旨   105th   2005

D-7-5 Significance decision of gene-expression values for visualizing correlation coefficient based gene interactions

Inoue Etsuko, Yoshihiro Takuya, Nakagawa Masaru

Proceedings of the IEICE General Conference ( The Institute of Electronics, Information and Communication Engineers )  2004 ( 1 ) 74 - 74   2004.03

On Backup-Tables for Shortest-Path Routing

YOSHIHIRO Takuya, ITO Hiro, OKABE Yasuo, IWAMA Kazuo

IEICE technical report. Theoretical foundations of Computing ( The Institute of Electronics, Information and Communication Engineers )  102 ( 522 ) 1 - 7   2002.12

　View Summary

For a shortest-path routing based network, we construct a secondary routing table (backup-table) on each vertex (router) in order to recover any one edge (link) failure without packet loss. In our model, an edge failure is recovered on the vertex which firstly find the edge failure by switching its routing tables momentarily. We prove that there is a set of backup-tables which can recover any one edge failure if the network is represented by a 2-edge-connected symmetric graph. Further, we give a linear-time algorithm for the problem of calculating backup-tables in the case that all edges have the same length.

Avoiding Routing Loops on the Internet

YOSHIHIRO Takuya, ITO Hiro, OKABE Yasuo, IWAMA Kazuo

Carleton Scientific Proc. of SIROCCO 2002 ( 一般社団法人電子情報通信学会 )  102 ( 140 ) 25 - 32   2002.06

　View Summary

Suppose that some particular link in the Internet is currently congested. Then a natural idea is to try to make packets bypass that link. This can be done by increasing the cost of that link intentionally, say from a_1 to a_2, since the Internet uses the shortest-path routing. Unfortunately, however, this often causes temporary loops for packet traveling, called routing loops. In this paper, we show that routing loops can be avoided by increasing the cost of the link not directly from a_1 to a_2 but through an intermediate value, a_3, i.e., from a_1 to a_3 and then to a_2. We may need several (more than one) intermediate values. We show that in such a occasion, the greedy strategy, namely raising the cost as much as possible in each step, is optimal.

Stateless Autoconfiguration of IPv6 Site-Local Addresses.

YOSHIHIRO Takuya, SHIMADA Masayuki, OKABE Yasuo, IWAMA Kazuo

IASTED Proc. of CCN 2002 ( 一般社団法人 システム制御情報学会 )  15 ( 6 ) 294 - 301   2002.06

　View Summary

We propose a new framework for stateless auto-configuration of IPv6 site-local addresses with “zero configuration.” When a router is connected to a link as the first router, it becomes the link leader and generates an address prefix with randomly generated 16-bit subnet ID for the segment. In order to assure the uniqueness of the prefix addresses, we show a protocol, which is an extension of RIPng, for detecting prefixes conflicts. When a conflict is detected, it is notified to its segment leader immediately. The segment leader generates a new prefix and renumber to new one via IPv6 address renumbering scheme. And, exploiting the IPv6 feature that multiple addresses can coexist on an interface, we realize such a routing algorithm that can protect the connections using old addresses for a fixed time.

DOI