研究者詳細 - 吉廣　卓哉

論文 - 吉廣　卓哉

分割表示 >> ／全件表示85 件中 1 - 85 件目

都市規模交通シミュレーションのための交通・信号制御モデルの作成支援スクリプト

鈴木潮音, 岡﨑翔大, 八木陵介, 西前太揮, 重野寛, 吉廣卓哉 (担当区分：最終著者,　責任著者 )

情報処理学会論文誌（採録決定） 66 ( 6 ) 2025年06月 [査読有り]

Controlling Detour Vehicle Volume for Stable Congestion Mitigation in Route Guidance Systems

Arisa Kitano, Takuya Yoshihiro (担当区分：最終著者,　責任著者 )

Sensors and Materials 36 ( 10 ) 4483 - 4499 2024年10月 [査読有り]

A Flow-based Centralized Route Guidance System for Traffic Congestion Mitigation

Yusuke Matsui, Takuya Yoshihiro (担当区分：最終著者,　責任著者 )

IEEE Transactions on Intelligent Transportation Systems 25 ( 8 ) 8681 - 8694 2024年03月 [査読有り]

DOI

A Transfer Learning Approach Based on Radar Rainfall for River Water-Level Prediction

Futo Ueda, Hiroto Tanouchi, Nobuyuki Egusa, Takuya Yoshihiro (担当区分：最終著者,　責任著者 )

Water ( MDPI AG ) 16 ( 4 ) 607 2024年02月 [査読有り]

River water-level prediction is crucial for mitigating flood damage caused by torrential rainfall. In this paper, we attempt to predict river water levels using a deep learning model based on radar rainfall data instead of data from upstream hydrological stations. A prediction model incorporating a two-dimensional convolutional neural network (2D-CNN) and long short-term memory (LSTM) is constructed to exploit geographical and temporal features of radar rainfall data, and a transfer learning method using a newly defined flow–distance matrix is presented. The results of our evaluation of the Oyodo River basin in Japan show that the presented transfer learning model using radar rainfall instead of upstream measurements has a good prediction accuracy in the case of torrential rain, with a Nash–Sutcliffe efficiency (NSE) value of 0.86 and a Kling–Gupta efficiency (KGE) of 0.83 for 6-h-ahead forecast for the top-four peak water-level height cases, which is comparable to the conventional model using upstream measurements (NSE = 0.84 and KGE = 0.83). It is also confirmed that the transfer learning model maintains its performance even when the amount of training data for the prediction site is reduced; values of NSE = 0.82 and KGE = 0.82 were achieved when reducing the training torrential-rain-period data from 12 to 3 periods (with 105 periods of data from other rivers for transfer learning). The results demonstrate that radar rainfall data and a few torrential rain measurements at the prediction location potentially enable us to predict river water levels even if hydrological stations have not been installed at the prediction location.

DOI

Monetary valuation of personal health data in the wild

Andy Alorwu, Niels van Berkel, Aku Visuri, Sharadhi Suryanarayana, Takuya Yoshihiro, Simo Hosio

International Journal of Human-Computer Studies 103241 2024年02月 [査読有り]

コミュニティ型クラウドソーシングにおける行動経済学に基づいたタスク実行の動機付け効果

仙頭美卯, 吉廣卓哉 (担当区分：最終著者,　責任著者 )

情報処理学会論文誌 64 ( 7 ) 1153 - 1163 2023年07月 [査読有り]

Predicting Microclimate Based on Difference from Meteorological Observatory

Genki Nishikawa, Takuya Yoshihiro

International Journal of Informatics Society 15 ( 1 ) 33 - 42 2023年06月 [査読有り]

Simulation-Based IoT Stream Data Pricing Incorporating Seller Competition and Buyer Demands

Takuya Yoshihiro, Simo Hosio (担当区分：筆頭著者,　責任著者 )

IEEE Access ( Institute of Electrical and Electronics Engineers (IEEE) ) 11 16213 - 16225 2023年 [査読有り]

DOI

Channel Assignment Based on CSMA-aware Interference Model with Overlapped Channels in Multi-Radio Multi-Channel Wireless Mesh Networks

Tian Yi, Takuya Yoshihiro (担当区分：最終著者 )

IEEE Access 10 96695 - 96709 2022年09月 [査読有り]

DOI

Indoor Localization under Sparse Bluetooth Low Energy Scanner Deployment for Medical and Nursing Care of Elderly People

Takuya Yoshihiro, Takeshi Goya (担当区分：筆頭著者,　責任著者 )

Sensors and Materials ( MYU K.K. ) 34 ( 8 ) 3029 - 3045 2022年06月 [査読有り]

宛先到着遅延を考慮して渋滞を緩和する自動車の経路誘導手法

松井雄資, 吉廣卓哉

情報処理学会論文誌 63 ( 2 ) 665 - 675 2022年02月 [査読有り]

Achieving Hidden-terminal-free Channel Assignment in IEEE802.11-based Multi-radio Multi-channel Wireless Mesh Networks

Tian Yi, Takahiro Noi, Takuya Yoshihiro (担当区分：最終著者 )

IEICE Transactions on Communications E104-B ( 7 ) 2021年07月 [査読有り]

An Incremental Approach for Optimal Feature Selection in Regression: A Case Study of Wagyu Proteome Analysis

Nanami Higashiguchi, Masatsugu Motohiro, Haruka Ikegami, Tamako Matsuhashi, Kazuya Matsumoto, Takuya Yoshihiro (担当区分：最終著者,　責任著者 )

International Journal of Informatics Society 12 ( 3 ) 167 - 175 2021年03月 [査読有り]

Duty-cycle Communication Protocol with Wi-Fi Direct for Wireless Sensor Networks

Shiho Tashiro, Takuya Yoshihiro (担当区分：最終著者 )

Sensors and Materials 33 ( 1 ) 127 - 145 2021年03月 [査読有り]

Localization with Portable APs in Ultra-Narrow-Band-based LPWA Networks

Miya Fukumoto, Takuya yoshihiro (担当区分：最終著者,　責任著者 )

Journal of Information Processing (JIP) 29 ( 2 ) 1 - 8 2021年02月 [査読有り]

Traffic-Demand-Aware Collision-free Channel Assignment for Multi-channel Multi-radio Wireless Mesh Networks

Yi Tian, Takuya Yoshihiro (担当区分：最終著者 )

IEEE Access ( Institute of Electrical and Electronics Engineers (IEEE) ) 8 120712 - 120723 2020年07月 [査読有り]

DOI

農業センサを用いたトルコギキョウの個体損失の確率モデリング

本廣多胤, 花田裕美, 吉廣卓哉 (担当区分：最終著者 )

情報処理学会論文誌 60 ( 2 ) 375 - 384 2020年02月 [査読有り]

Link-speed Aware Scheduling for Slotted-CSMA BasedWireless Mesh Networks

Yasuhiro Mori, Takuya Yoshihiro (担当区分：最終著者 )

International Journal of Informatics Society 10 ( 3 ) 129 - 138 2019年12月 [査読有り]

A Traffic-Demand-Aware Collision-free Channel Allocation for Multi-channel Wireless Mesh Networks

Tian Yi, Takuya Yoshihiro (担当区分：最終著者 )

The 12th International Conference on Mobile Computing and Ubiquitous Networking (ICMU2019) 2019年11月 [査読有り]

Improving Accuracy of Localization with Portable APs in Ultra-Narrow-Band-based LPWA Networks

Miya Fukumoto, Takuya Yoshihiro (担当区分：最終著者 )

The 12th International Conference on Mobile Computing and Ubiquitous Networking (ICMU2019) 2019年11月 [査読有り]

Finding common features among multiple groups in sparse feature selections: A case study with Wagyu data

Nanami Higashiguchi, Masatsugu Motohiro, Haruka Ikegami, Tamako Matsuhashi, Kazuya Matsumoto, Takuya Yoshihiro (担当区分：最終著者 )

International Workshop on Informatics (IWIN2019) 2019年09月 [査読有り]

A Traffic-Demand-Aware Routing and Scheduling for CSMA-based Wireless Mesh Networks

Tian Yi, Takuya Yoshihiro (担当区分：最終著者 )

IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops) MUSICAL'19 658 - 663 2019年03月 [査読有り]

A Scheduling for Slotted-CSMA-based Wireless Mesh Networks to Reduce Delivery Delay

Takahiro Noi, Takuya Yoshihiro (担当区分：最終著者 )

Journal of Information Processing (JIP) 27 ( 2 ) 117 - 124 2019年02月 [査読有り]

A Distance-vector-based Multi-path Routing Scheme for Static-node-assisted Vehicular Networks

Daichi Araki, Takuya Yoshihiro (担当区分：最終著者 )

Sensors 19 ( 12 ) 1 - 21 2019年 [査読有り]

受信ノード主導型MACプロトコルのビーコン削減に基づいた長寿命センサネットワーク

横谷晟人, 吉廣卓哉

情報処理学会論文誌 59 ( 2 ) 473 - 485 2018年02月

バッテリ駆動の小型センサ端末を設置し，無線マルチホップ通信により測定データを集める無線センサネットワークにおいて，従来手法と比較して大幅にネットワーク寿命を延ばすMACおよび経路制御プロトコルを提案する．受信ノード主導型MACプロトコルは，消費電力を抑えセンサノードの寿命を延ばすMACプロトコルとして知られている．本論文では，これを拡張し，データ配送木における葉ノードでビーコン送信を省き，経路制御プロトコルと連携させることにより，さらに消費電力を削減する．葉ノードでビーコン送信を省くことで，トポロジ変化時に葉ノードへ制御メッセージが送信できず，配送木の修復効率が悪化するという問題が起こる．これに対しては，葉ノードとの連絡経路を維持する仕組みを導入し，トポロジ変化時にも効率的に配送木を修復する．また，電力残量が低下したノードを避けるように定期的に配送木を再構築する仕組みにより，ネットワークが機能する時間を延ばす．最新のセンサ端末の性能を考慮したシミュレーション評価により，センサネットワークの寿命が大幅に増大できることを示す．

Providing Reliable Communications over Static-node-assisted Vehicular Networks Using Distance-vector Routing

Takuya Yoshihiro, Daichi Araki, Hiroki Sakaguchi, Naoki Shibata

Mobile Networks and Applications ( Springer New York LLC ) 23 ( 5 ) 1 - 18 2018年02月 [査読有り]

To support various practical applications that are expected to work over vehicular networks, it is important to develop a network infrastructure that provides quality communications on which applications can rely. However, since a vehicular network is essentially a delay tolerant network (DTN) in which connected paths to the destinations do not always exist, providing reliable communications on such a network is a challenging research goal. In this paper, we propose a new table-driven distance-vector routing protocol called RDV (Reliable Distance-Vector routing) for static-node-assisted vehicular networks. RDV provides the guarantee that the expected packet delivery ratio exceeds the preconfigured value by creating the necessary number of packet copies sent on the shortest path. Evaluation results show that RDV provides a stably high packet delivery ratio and outperforms other conventional routing schemes in both packet delivery ratio and overhead of packet copies.

DOI

Building detour paths to avoid local congestion in MANETs

Kiyotaka Kaji, Takuya Yoshihiro

Journal of Information Processing ( Information Processing Society of Japan ) 26 116 - 123 2018年01月 [査読有り]

MANETs (Mobile Ad-hoc NETworks) have been studied for a long time to provide multi-hop wireless communications among temporarily gathered mobile devices. However, due to the nature of wireless communications, the communication performance of a flow is easily degraded by even a single local congestion on the path. A simple solution for this problem is to utilize detour paths that avoid the congested area. However, to provide detour paths that avoid the area whenever a packet faces congestion is in fact a challenging task because the detour paths must avoid relatively large region in which harmful radio waves interfere. In this paper, we propose a routing scheme that proactively computes detour paths to avoid the congested area ahead of packets. Specifically, when a packet meets congestion, we assume that the next-next-hop node along the shortest path to the destination is the center of the congestion, and forward the packet to its destination without visiting the node neighboring the congestion central node. We designed an algorithm that builds the secondary routing tables that works to provide the detour paths on top of the distributed link-state routing scheme.

DOI

Scheduling Beacon Transmission to Improve Delay for Receiver-initiated-MAC Based Wireless Sensor Networks.

Akihiro Fujimoto, Yukari Masui, Takuya Yoshihiro

JIP 26 140 - 147 2018年 [査読有り]

DOI

A Multi-path Extension to RDV Routing Scheme for Static-node-Assisted Vehicular Networks.

Daichi Araki, Takuya Yoshihiro

32nd IEEE International Conference on Advanced Information Networking and Applications, AINA 2018, Krakow, Poland, May 16-18, 2018 ( IEEE Computer Society ) 47 - 54 2018年 [査読有り]

DOI

A new hybrid approach for scalable table-driven routing in MANETs.

Takuya Yoshihiro, Yuji Kitamura, Anup Kumar Paul, Atsuo Tachibana, Teruyuki Hasegawa

2018 IEEE Wireless Communications and Networking Conference, WCNC 2018, Barcelona, Spain, April 15-18, 2018 ( IEEE ) 1 - 6 2018年 [査読有り]

DOI

Visualizing Wireless Sensor Networks for Practical Network Management

URATA Yuki, YOSHIHIRO Takuya, KAWAHASHI Yutaka

International Journal of Informatics Society 9 ( 2 ) 53 - 61 2017年06月 [査読有り]

GPU Acceleration of EDA-based Algorithms to Learn Bayesian Networks

MORI Takashi, YAMANAKA Yuma, FUJIKI Takatoshi, YOSHIHIRO Takuya

International Journal of Informatics Society 9 ( 1 ) 21 - 29 2017年06月 [査読有り]

A distributed scheduling through queue-length exchange in CSMA-based wireless mesh networks

Toshiki Takeda, Takuya Yoshihiro

Journal of Information Processing ( Information Processing Society of Japan ) 25 174 - 181 2017年02月 [査読有り]

Wireless Mesh Networks (WMNs) over CSMA MAC (especially IEEE 802.11) are an attractive solution to widen the coverage area of the Internet in unlicensed frequency bands. Although such CSMA-based WMNs have been deeply investigated for a long time, they still suffer from heavy interference due to hidden terminals. In this paper, we accelerate the performance of CSMA-based WMNs by introducing a distributed scheduling scheme that exchanges the transmission-queue length information in real-time among neighbor nodes. In our scheduling scheme, we exchange the information of transmission queue-lengths among neighbor nodes in real-time, and allow transmitting frames to the node that has the longest queue length among its 2-hop distance. The proposed scheduling scheme can be regarded as a distributed design of so called ‘Max-weight’ scheduling. By combining CSMA with the queue-length based scheduling, we significantly reduce collisions due to hidden terminals and improve the performance with a small overhead of queue-length fields in MAC frames.

DOI

A limiter on dynamic metrics to reduce routing loops in wireless mesh networks

Takuya Yoshihiro, Kenji Kaho, Takahiro Iida

Journal of Information Processing ( Information Processing Society of Japan ) 25 191 - 198 2017年02月 [査読有り]

To improve the communication performance in IEEE802.11-based wireless mesh networks (WMNs), several dynamic metrics have been proposed. However, all of them have a severe risk of generating temporary routing loops which may cause severe congestion and disruption of communications. Although the routing loop is an essential problem that degrades network performance, no essential solution is provided so far for wireless multihop networks. In this paper, we propose a mechanism called Loop-free Metric Range (LMR) to make existing dynamic metrics loop-free by restricting the range of metric values to change. LMR is applicable to a major part of existing metrics including ETX, ETT, MIC, etc. without any message overhead. We first provide theoretical results that shows LMR guarantees loop-freedom if no message loss takes place. We next show that LMR is also practically effective in practical scenarios where message loss may take place
we show through simulation and actual evaluations that LMR works effectively as a limiter on dynamic metrics to reduce routing loops and to improve network performance through similation and real evaluation.

DOI

Beacon Scheduling in Receiver-initiated MAC Protocols for Low-delay and Energy-efficient WSNs

Akihiro Fujimoto, Yukari Masui, Takuya Yoshihiro, Fumitaka Uchio

2017 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC) ( IEEE ) 1 - 6 2017年 [査読有り]

Wireless Sensor Networks (WSNs) should collect sensing data quickly without increasing the energy consumption in order to deal with various applications, particularly delaysensitive applications. This paper proposes a method to schedule beacon transmissions for receiver-initiated MAC protocols, which are promising energy efficient protocols, to improve data collection delay. The key idea of the proposed method is scheduling beacon timings in the sequence of distance from leaf node to the root (i. e., sink) node so that data frames are forwarded to the sink node with small duration staying at each node. Each sensor node selects a time slot to send beacon in distributed manner based on their distances (i. e. hop counts) from the sink node. In addition, each node autonomously adjusts its beacon timing to avoid frame collisions. Computer simulations show that the proposed method can collect data in a shorter time with less energy consumption than conventional beacon scheduling methods for receiver-initiated MAC protocols.

DOI

Collision-free Channel Assignment is Possible in IEEE802.11-based Wireless Mesh Networks

Takuya Yoshihiro, Takahiro Noi

2017 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC) ( IEEE ) 1 - 6 2017年 [査読有り]

IEEE802.11-based Wireless Mesh Networks (WMNs) has been deeply studied as a low-cost wireless mesh networks. However, they still suffer from severe interference due to hidden terminals, which significantly degrades the performance to an impractical level. Several studies tried to use multiple frequency channels to avoid collisions among wireless links. However, static channel assignment requires so many orthogonal channels to achieve collision-freedom, resulting in that we still suffer from severe collisions as long as we use the well-populated IEEE802.11 standards. In this paper, we propose a new static channel assignment scheme CASCA CSMA-aware Static Channel Assignment) that achieves collision-free channel assignment under 3-4 available channels by incorporating a CSMA-aware interference model as well as partially a routing functionality in it. CASCA enables us to realize collision-free WMNs using the license-free IEEE802.11 devices.

DOI

Adaptive Rerouting to Avoid Local Congestion in MANETs

Kiyotaka Kaji, Takuya Yoshihiro

2017 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC) ( IEEE ) 1 - 6 2017年 [査読有り]

MANET (Mobile Ad-hoc NETworks) is useful in many practical scenarios since it provides multi-hop communication without wired infrastructure. However, there is a problem that the communication performance of a flow may be easily degraded by even a single local congestion on the whole path. A solution for the problem is to use a detour path that avoids the local congestion. However, to this end, the detour paths should not use the nodes in the congested area, which is in fact relatively large due to the nature of radio waves. In the current state of the art, we do not have such alternative-path computation algorithms. In this paper, we propose an algorithm and a routing scheme to compute and utilize detour paths adaptively according to the network traffic conditions. Through evaluation, we show that the proposed scheme improve the communication performance by using the detour paths in practical network scenarios.

DOI

Reliable distance-vector routing for static-node-assisted vehicular networks

Takuya Yoshihiro, Daichi Araki, Hiroki Sakaguchi, Naoki Shibata

ACM International Conference Proceeding Series ( Association for Computing Machinery ) 28- 237 - 245 2016年11月 [査読有り]

We propose a new static-node-assisted routing scheme RDV (Reliable Distance Vector routing) for vehicular networks. In RDV, static nodes located at intersections behave as distance-vector routers to assist packet forwarding, i.e., they exchange messages, compute paths, and help packets travel along the computed forwarding paths to their destinations. To support various practical applications over vehicular networks, RDV provides reliable communications such that the average packet delivery ratio exceeds the preconfigured delivery ratio by creating the necessary number of packet copies sent on the shortest path. Evaluation results show that the proposed scheme provides stably high packet delivery ratio, and outperforms other existing routing schemes in both packet delivery ratio and the number of generated packet copies.

DOI

PBIL-RS: Effective Repeated Search in PBIL-based Bayesian Network Learning

YAMANAKA Yuma, FUKUDA Sho, FUJIKI Takatoshi, YOSHIHIRO Takuya

International Journal of Informatics Society 8 ( 1 ) 15 - 23 2016年06月 [査読有り]

A Queue-length Based Distributed Scheduling for CSMA-driven Wireless Mesh Networks

Toshiki Takeda, Takuya Yoshihiro

2016 INTERNATIONAL CONFERENCE ON COMPUTING, NETWORKING AND COMMUNICATIONS (ICNC) ( IEEE ) 1 - 6 2016年 [査読有り]

Although Wireless Mesh Networks using CSMA MAC protocol (CSMA-driven WMNs) have been extensively studied, severe collisions mainly due to hidden terminals prevent us from realizing practical networks. In this paper, we propose a new distributed scheduling scheme for CSMA-driven WMNs that significantly reduce collision caused by hidden terminals. In our scheduling, we propagate queue-length information within two-hop neighborhood via data and Ack frames, and avoid collision by allowing transmission to only the node that has the longest queue length among its two-hop neighbors. Our scheduling scheme is fully distributed and requires low overhead so that it works within the framework of CSMA. Through evaluation, we found that the proposed scheduling mechanism significantly reduces the number of collisions, resulting in significant improvement of communication quality of CSMA-driven WMNs.

DOI

Practical Fast Scheduling and Routing over Slotted CSMA for Wireless Mesh Networks

Takuya Yoshihiro, Taiki Nishimae

2016 IEEE/ACM 24TH INTERNATIONAL SYMPOSIUM ON QUALITY OF SERVICE (IWQOS) ( IEEE ) 1 - 10 2016年 [査読有り]

Although Wireless Mesh Networks (WMNs) over CSMA and TDMA MAC have been extensively studied, CSMA still suffers from heavy interference due to hidden terminals, while TDMA has a practical difficulty in accurate time synchronization. Slotted CSMA, in which we assume that CSMA runs within relatively large time-divided slots, could be one of the solutions since it works on loosely synchronized time slots and simultaneously avoids major collision under a properly designed feasible schedule. However, if we apply a schedule generally used in TDMA, there are several inconveniences: First, we need heavy overhead of centralized computation or negotiation among nodes in distributed scheduling. Second, end-to- end packet delivery delay grows large since TDMA requires a large number of slots to achieve collision-free scheduling. In this paper, we propose a new scheduling algorithm for slotted CSMA called CATBS (CSMA-Aware Time-Boundable Scheduling) that requires a smaller number of slots for feasible scheduling, and runs within a bounded time. Incorporating the scheduling, we design a routing protocol that enables flexible paths recomputation with small communication overhead. We consequently achieve a new fully distributed and robust network architecture of WMNs that provides practically high throughput and low delivery delay, which can be implemented on the off-the- shelf IEEE802.11 interfaces.

DOI

Finding an Area with Close Phenotype Values to Predict Proteins That Control Phenotype

FUJIKI Takatoshi, GAKU Empei, YOSHIHIRO Takuya

International Journal of Informatics Society 7 ( 3 ) 115 - 122 2015年12月 [査読有り]

黒毛和種肥育牛の枝肉形質バイオマーカーの探索III：腎周囲白色脂肪組織プロテオーム解析結果に基づく肥育終了時の枝肉形質を推定するバイオマーカー候補タンパク質の同定

池上春香, 永井宏平, 松橋珠子, 小林直彦, 武本淳史, 吉廣卓哉, 井上悦子, 樋口智香, 守田昂太郎, 内堀翔, 天野朋子, 田口善智, 加藤博己, 入谷明, 松本和也

日本畜産学会報 ( Japanese Society of Animal Science ) 86 ( 2 ) 141 - 152 2015年06月 [査読有り]

黒毛和種肥育牛の枝肉形質を推定するバイオマーカー候補タンパク質の同定を目的に，枝肉形質情報ならびに腎周囲白色脂肪組織のプロテオーム解析情報を搭載した統合情報管理システムを運用し，プロテオーム解析データを持つ去勢牛200頭から，5つの形質（枝肉重量・ロース芯面積・バラの厚さ・皮下脂肪の厚さ・BMSナンバー）に関して上位と下位の2群を選抜して，この2群間で314個のタンパク質スポットの発現量と枝肉成績との関連性を検討した．各形質の上位群（平均値+標準偏差）および下位群（平均値−標準偏差）として抽出した個体間の各スポットのタンパク質発現量を比較した結果，合計でタンパク質45種類（90スポット）の発現量に有意な差が認められた．これらタンパク質の一部について，代謝経路における位置付けを行なうとともに，vimentinのウエスタンブロット解析より発現量を検証したところ，枝肉形質を推定するバイオマーカー候補タンパク質としての可能性が示唆された．

DOI

黒毛和種肥育牛の枝肉形質バイオマーカーの探索 III:腎周囲白色脂肪組織プロテオーム解析結果に基づく肥育終了時の枝肉形質を推定するバイオマーカー候補タンパク質の同定

日本畜産学会報 ( Japanese Society of Animal Science ) 86 ( 2 ) 141 - 152 2015年05月 [査読有り]

DOI

Combining local channel selection with routing metrics in multi-channelwireless mesh networks

Hiromichi Kanaoka, Takuya Yoshihiro

Journal of Information Processing ( Information Processing Society of Japan ) 23 ( 2 ) 221 - 228 2015年 [査読有り]

WMNs (Wireless Mesh Networks) using IEEE 802.11 have been deeply studied to extend the area of coverage of the Internet. A typical approach to implement this kind of WMNs is to use dynamic metrics (e.g., ETX) over link-state routing protocols (e.g., OLSR). Although studies have demonstrated clarified that the approach performs well, there is still room for improve. In this paper, we first point out that the dynamic metrics by nature cannot pursuit rapid change in link quality, which prevents routing protocols to choose the best forwarding paths at every moment. To complement this drawback of the dynamic metric, we propose a local switching mechanism of forwarding channels for multi-radio, multi-channelWMNs, which works in combination with dynamic metrics. Our evaluation showed that the proposed method improves throughput and stability of communications when it works with dynamic metrics.

DOI

A System to Help Creation of Original Recipes by Recommending Additional Materials and Reference Recipes

TANAKA Mana, INOUE Etsuko, YOSHIHIRO Takuya

International Journal of Informatics Society 6 ( 1 ) 2014年06月 [査読有り]

小学校低学年を対象とした基本的な生活習慣の教育を支援する情報システム

橋渡亮太, 吉廣卓哉, 井上悦子, 中川優

情報処理学会論文誌 55 ( 1 ) 34 - 44 2014年01月

本研究では，小学校低学年を対象に自発的に取り組ませることにより，社会生活で必要な基本的な生活習慣の習慣付けを支援する情報システムを構築する．従来，小学校教員は，児童に基本的な生活習慣を定着させるために，毎日の達成目標を設定し，目標の達成状況に合わせてシールを貼る，あるいは達成状況を紙に書いて壁に貼り出すことで他の児童と比較できるようにする，等の方法で，その教育を行ってきた．しかし，この方法は，小学校教員に多大な労力を強いるため，その労力の低減が求められる．本研究では，情報システムを用いることで，教員に労力をかけることなく，児童に自発的に生活習慣への取り組ませる動機付けを行うシステムを設計・構築した．また，構築したシステムを実際に教育現場で運用することで評価実験を行った．その結果，本システムが，児童が意識的に基本的な生活習慣を習慣付けるための動機付けになっていることが確認された．本論文ではこれらの試みについて報告すると同時に，本システムを実運用することで明らかになった課題や考慮すべき点について議論を行う．In this study, we developed a system to support education for lower-grade schoolchildren to make them obtain basic social customs. School teachers traditionally educate these customs by various methods, e.g., by using stamps according to the achievement level of everyday goal, or by displaying a large sheet to compare the achievement level with themselves. However, these method requires considerable labour of school teachers. We designed a system in which schoolchildren are given their own daily goals and input their achievement results everyday to motivate them to do for it by themselves. We conducted an evaluation experiment by operating the system in a primary school education. As a result, we confirmed that the system motivates schoolchildren to achieve their own daily goals. In this paper, we report our attempt for computer support in the field of lower-grade basic education and discuss the problems and the difficulties that are derived through our experiences.

Learning Bayesian Networks Using Probability Vectors

Sho Fukuda, Takuya Yoshihiro

DISTRIBUTED COMPUTING AND ARTIFICIAL INTELLIGENCE, 11TH INTERNATIONAL CONFERENCE ( SPRINGER-VERLAG BERLIN ) 290 503 - 510 2014年 [査読有り]

Bayesian networks are regarded as one of the essential tools to analyze causal relationship between events from data. To learn the structure of good Bayesian networks from data as quickly as possible is one of the important problems that several studies have been tried to achieve. In this paper, we propose a new algorithm to learn Bayesian network structure based on a genetic algorithm that evolves probability vectors. Through performance evaluation, we found that this probability-based approach is effective to learn better Bayesian network structure with less time.

DOI

Combining Local Channel Selection with Routing Metrics in Multi-channel Wireless Mesh Networks

Hiromichi Kanaoka, Takuya Yoshihiro

2014 SEVENTH INTERNATIONAL CONFERENCE ON MOBILE COMPUTING AND UBIQUITOUS NETWORKING (ICMU) ( IEEE ) 70 - 71 2014年 [査読有り]

DOI

Reactive load balancing during failure state in IP fast reroute schemes

Kazuki Imura, Takuya Yoshihiro

Journal of Information Processing ( Information Processing Society of Japan ) 22 ( 3 ) 527 - 535 2014年 [査読有り]

To improve reliability of IP networks against link/node failure, several IP fast reroute schemes have been proposed so far. They proactively compute backup paths and activate them when failure occurs to prevent packets from losing at the failure link/node. However, it is known that network performance considerably degrades in the failure state of IP fast reroute schemes, because congestion hot spots often appear near the failure link/node. In this paper, we propose a reactive load balancing method that can be applied to the major IP fast reroute schemes that covers single failure. Our scheme works when an IP fast reroute scheme is activating its backup paths, and reduces the degradation of network performance due to failure. In our load balancing scheme, with the overhead of a few bit field on packet header, we can largely reduce the performance degradation in the failure state and mostly keep the throughput as it was in the normal state where no failure exists. © 2014 Information Processing Society of Japan.

DOI

A Probability-based Evolutionary Algorithm with Mutations to Learn Bayesian Networks.

Sho Fukuda, Yuuma Yamanaka, Takuya Yoshihiro

IJIMAI 3 ( 1 ) 7 - 13 2014年 [査読有り]

DOI

Adaptive load balancing based on IP fast reroute to avoid congestion hot-spots

Masaki Hara, Takuya Yoshihiro

Journal of Information Processing ( Information Processing Society of Japan ) 22 ( 2 ) 97 - 105 2014年 [査読有り]

Several load balancing techniques for IP routing scheme have appeared in the literature. However, they require optimization process to compute optimal paths to meet traffic demand so that it requires a mechanism to measure traffic demand and to share them among all routes in order to follow dynamics of traffic. It naturally results in communication overhead and losing sensitivity to follow traffic dynamics. In this paper, we investigate a load balancing mechanism from another approach, i.e., based on IP fast reroute mechanisms. The main idea is simply to forward packets into detour paths supplied by IP fast reroute mechanisms only when packets meet congestion. This strategy enables us to use vacant resources adaptively as soon as they are required to avoid and dissolve the congestion. Through traffic simulation we show that IP fast reroute based load balancing mechanisms improve the capacity of networks. © 2014 Information Processing Society of Japan.

DOI

黒毛和種肥育牛の枝肉形質バイオマーカーの探索II : 個体の性差と種雄牛の遺伝的背景が白色脂肪組織のタンパク質発現に及ぼす影響

池上春香, 小林直彦, 松橋珠子, 武本淳史, 吉廣卓哉, 井上悦子, 加藤里恵, 加藤博己, 田口善智, 天野朋子, 森本康一, 中川優, 入谷明, 松本和也

日本畜産學會報 = The Japanese journal of zootechnical science 83 ( 3 ) 281 - 290 2012年08月

黒毛和種肥育牛の枝肉形質バイオマーカーの探索(2)

池上春香, 小林直彦, 松橋珠子, 武本淳史, 吉廣卓哉, 井上悦子, 加藤里恵, 加藤博己, 田口善智, 天野朋子, 森本, 康一, 中川, 優#入谷, 明#松本和也

日本畜産學會報 = The Japanese journal of zootechnical science ( Zootechnical Science Society of Japan ) 83 ( 3 ) 281 - 290 2012年08月

黒毛和種肥育牛の枝肉形質を診断するバイオマーカータンパク質同定を目的に構築した統合情報管理システムに,腎周囲白色脂肪組織のプロテオーム解析情報を搭載し,タンパク質発現に及ぼす性差と血統の影響を調べた。システム内の枝肉形質情報データベースには,黒毛和種肥育牛10,789頭の個体情報,血統情報,および枝肉形質情報が登録されている。このうち252頭を選択して腎周囲白色脂肪組織のプロテオーム解析情報を獲得し,同システム内に登録した。まず,去勢牛と雌牛群間でタンパク質発現量を比較したところ,タンパク質スポット879個のうち56個(6.4%)でその発現量に性差が認められた。次に,種雄牛4頭を一代祖に持つ去勢牛の個体群間でタンパク質発現量を比較した結果,発現量に差が見られたタンパク質スポットの割合は低く,プロテオーム解析情報を検討する場合に種雄牛の遺伝的背景を必ずしも考慮する必要はないと判断された。

One-click Peer-encouragement Mechanisms for Web-based Health Promotion System to Prevent Metabolic Syndrome

YOSHIHIRO Takuya, FUJIWARA Takuya, ENOUE Etsuko, TABE Hiroko, NAKAGAWA Masaru

International Journal of Informatics Society 3 ( 2 ) 47 - 55 2012年06月 [査読有り]

A Routing Metric towards Reliable Communication in Mobile Ad-hoc Networks

FUJI Katsuya, YOSHIHIRO Takuya

International Journal of Informatics Society 4 ( 1 ) 2012年06月 [査読有り]

Predicting three-way interactions of proteins from expression profiles based on correlation coefficient

Etsuko Inoue, Sho Murakami, Takatoshi Fujiki, Takuya Yoshihiro, Atsushi Takemoto, Haruka Ikegami, Kazuya Matsumoto, Masaru Nakagawa

IPSJ Transactions on Bioinformatics 5 34 - 43 2012年 [査読有り]

In this study, we propose a new method to predict three-way interactions among proteins based on correlation coefficient of protein expression profiles. Although three-way interactions have not been studied well, this kind of interactions are important to understand the system of life. Previous studies reported the three-way interactions that based on switching mechanisms, in which a property or an expression level of a protein switches the mechanism of interactions between other two proteins. In this paper, we proposed a new method to predict three-way interactions based on the model in which A and B work together to effect on the expression level of C. We present the algorithm to predict the combinations of three proteins that have the three-way interaction, and evaluate it using our real proteome data.

DOI

Single Node Protection without Bouncing in IP Networks

Takuya Yoshihiro, Masahiro Jibiki

2012 IEEE 13TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE SWITCHING AND ROUTING (HPSR) ( IEEE ) 88 - 95 2012年 [査読有り]

Several approaches for IP fast rerouting have been proposed to augment resiliency of IP networks. For example, NotVia uses IP tunnels to avoid failure component, and FIFR prepares two routing tables to switch packets according to incoming interfaces. In this paper, for two-table approach such as FIFR, we propose to use 2-bit marking on packet header to overcome one of the problems called route bouncing. By preventing route bouncing, more efficient use of network resources are possible. We further show that our method not only prevents route bouncing but also prevents packet loops in case of multiple failure. Note that, although multiple failure occurs with low probability, once it occurs network performance significantly degrades since size of loops is far larger than microloops.

DOI

An efficient algorithm to predict three-way interaction of proteins from expression data based on conditional probability

Takatoshi Fujiki, Etsuko Inoue, Takuya Yoshihiro, Masaru Nakagawa

Frontiers in Artificial Intelligence and Applications ( IOS Press ) 243 1867 - 1876 2012年 [査読有り]

It is important to predict interaction among proteins to understand the system of life. We have proposed a method to predict threeway interactions among proteins from expression data based on conditional probability in our previous study. However, the proposed method has a problem of significant computational time, because it requires computation of a probability distribution as a preprocess of the algorithm. In this study, we propose a method to significantly reduce the computational time by computing the probability distribution with analytical approach, instead of simulation approach used in our previous study. We evaluated the computational time and accuracy of the proposed analytical computation method. © 2012 The authors and IOS Press. All rights reserved.

DOI

黒毛和種肥育牛の枝肉形質バイオマーカーの探索 II：個体の性差と種雄牛の遺伝的背景が白色脂肪組織のタンパク質発現に及ぼす影響

池上春香, 天野朋子, 森本康一, 中川優, 入谷明, 松本和也, 小林直彦, 松橋珠子, 武本淳史, 吉廣卓哉, 井上悦子, 加藤里恵, 加藤博己, 田口善智

日本畜産学会報 ( 公益社団法人日本畜産学会 ) 83 ( 3 ) 281 - 290 2012年

黒毛和種肥育牛の枝肉形質を診断するバイオマーカータンパク質同定を目的に構築した統合情報管理システムに，腎周囲白色脂肪組織のプロテオーム解析情報を搭載し，タンパク質発現に及ぼす性差と血統の影響を調べた．システム内の枝肉形質情報データベースには，黒毛和種肥育牛 10,789 頭の個体情報，血統情報，および枝肉形質情報が登録されている．このうち 252頭を選択して腎周囲白色脂肪組織のプロテオーム解析情報を獲得し，同システム内に登録した．まず，去勢牛と雌牛群間でタンパク質発現量を比較したところ，タンパク質スポット 879個のうち 56個（6.4%）でその発現量に性差が認められた．次に，種雄牛 4頭を一代祖に持つ去勢牛の個体群間でタンパク質発現量を比較した結果，発現量に差が見られたタンパク質スポットの割合は低く，プロテオーム解析情報を検討する場合に種雄牛の遺伝的背景を必ずしも考慮する必要はないと判断された．

生活習慣病予防のための競争意識を利用した歩行継続支援システム

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

情報知識学会誌 ( 情報知識学会 ) 21 ( 1 ) 37 - 53 2011年02月

生活習慣病予防を目的としてSNSの仕組みを導入したシステムによる歩行運動継続支援が試みられている．これらは，システム内のユーザ間交流により仲間意識や競争意識を高め，歩行運動を継続させることが狙いである．しかし既存のシステムではテキストを介した対話による交流がユーザの歩行運動継続を動機付けており，比較的長文のテキスト入力も苦にしない一部の対象者にしか受け入れられない．本研究ではより広い範囲のユーザを動機付けるために，より少ない入力情報を用いて歩行運動継続を動機付けるSNSシステムを設計・実装し，対話を用いない競争機構によりどの程度の動機付けが可能かを評価した．本システムの設計では動機付けのレベルを「自己記録の視覚的確認」「友人との競争」「ライバルとの競争」3段階に分類し，各々に3種類の競争機能を組み込むことで効果的な動機付け機構の実現を試みた.本システムの評価結果より，対話を用いない競争機能によって相応の動機付け効果が期待できることを確認したので報告する．

DOI

Normalization of biological expression data based on selection of a stable element set

Yoshihiko Bouki, Takuya Yoshihiro, Etsuko Inoue, Masaru Nakagawa

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6883 ( 3 ) 153 - 166 2011年 [査読有り]

Normalization of biological expression data is the process to remove several experimental or technical bias from the data in order to perform accurate analysis. Recently computational analysis of expression data is widely applied since very large number of genes or proteins can be examined simultaneously. In this paper we proposed a new normalization method for expression data which is based on selection of a stable element set. Our idea is that using a part of genes or proteins which is relatively stably expressed leads more accurate normalization. We formulate the problem and give the algorithm to solve it in practical time. Through evaluation with artificial and real data, we found that our method outperforms global scaling, and global scaling tend to over-correct the bias. © 2011 Springer-Verlag.

DOI

Adaptive load balancing based on IP fast reroute to avoid congestion hot-spots

Masaki Hara, Takuya Yoshihiro

IEEE International Conference on Communications 2011年 [査読有り]

DOI

Adaptive Load Balancing based on IP Fast Reroute to Avoid Congestion Hot-spots

Masaki Hara, Takuya Yoshihiro

2011 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC) ( IEEE ) 22 ( 2 ) 97 - 105 2011年 [査読有り]

DOI

Predicting combinatorial protein protein interactions from protein expression data based on correlation coefficient

Sho Murakami, Takuya Yoshihiro, Etsuko Inoue, Masaru Nakagawa

Proceedings of the 9th Joint Conference on Knowledge-Based Software Engineering, JCKBSE 2010 35 - 45 2010年

In this paper we present a method to predict combinatorial protein protein interactions from protein expression data using statistics over correlation coefficient. Several studies, i.e., bayesian networks or boolean networks, have been presented in the literature to predict protein protein (or gene gene) interactions among more than three proteins (or genes) from expression data. However, they measure the interaction level which includes not only combinatorial effects but also sole effect between two proteins so that it tend to retrieve groups in which every pair of proteins have much effects on each other. Also, they require large data with lots of samples to predict reliable results since they need sufficient number of positive and negative expression values for each target proteins. Our method presented in this paper is practical in that it retrieve only combinatorial effects that appear only when two target proteins get together, and also in that it require less samples than other methods since we use correlation coefficient.

Prediction of combinatorial protein-protein interaction networks from expression data using statistics on conditional probability

Takatoshi Fujiki, Etsuko Inoue, Takuya Yoshihiro, Masaru Nakagawa

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6278 ( 3 ) 509 - 518 2010年 [査読有り]

In this paper we propose a method to retrieve combinatorial protein-protein interaction to predict the interaction networks from protein expression data based on statistics on conditional probability. Our method retrieves the combinations of three proteins A, B and C which include combinatorial effects among them. The combinatorial effect considered in this paper does not include the "sole effect" between two proteins A-C or B-C, so that we can retrieve the combinatorial effect which appears only when proteins A, B and C get together. We evaluate our method with a real protein expression data set and obtain several combinations of three proteins in which protein-protein interactions are prediced. © 2010 Springer-Verlag.

DOI

Reducing routing loops under dynamic metrics in wireless mesh networks

Takuya Yoshihiro

GLOBECOM - IEEE Global Telecommunications Conference 2010年 [査読有り]

Many dynamic metrics for wireless mesh networks (WMNs) to improve communication quality are proposed so far. However, all of them have possibility to create temporary routing loops which may cause severe congestion and disruption of communications. In order that WMNs are regarded as a reliable infrastructure of the next generation, such routing loops are strongly desired to be eliminated since they bring the possibility of service disruption. In this paper, we propose a mechanism called Loop-free Metric Range (LMR) to make existing dynamic metrics loop-free by restricting the range of metric values to change. LMR is applicable to a major part of existing metrics such as ETX, ETT, MIC, and so on without any message overhead. We show the mechanisms of LMR, theoretical results on the range of loop-free metric values, and simulation results on the effectiveness of LMR. ©2010 IEEE.

DOI

生活習慣病予防教室における効果傾向抽出のためのデータマイニングシステム

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

情報知識学会誌 ( 情報知識学会 ) 19 ( 1 ) 2 - 14 2009年03月

本研究では，生活習慣病予防教室により得られる身体測定や血液検査等のデータか，生活習慣病の予防効果の傾向を把握するための分析支援システムを開発した．近年，全国的に生活習慣病予防教室が実施され，予防への取り組みが活発化するに従い，どのような取り組みをすればどのような参加者に効果があるのか，その詳細を分析することの重要性が高まっている．本システムで，教室を実施することで得られる時系列の測定データから，どのような群の参加者に効果があったのかを組み合わせ的に調べて分析者に提示することで，少ない労力で教室の効果の傾向を把握できるようにした．また，分析者は，提示された群のデータを表形式で表示して分析結果を確認した上，群の切り出し条件を少し変えた場合等の周辺結果を試行錯誤しながら閲覧でき，本システムを分析および現場での取組み改善のための基本的なツールとして使用できる．

DOI

大規模クラスタリング結果のグラフによるインタラクティブな可視化手法

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

電子情報通信学会論文誌. D, 情報・システム = The IEICE transactions on information and systems (Japanese edition) ( 一般社団法人電子情報通信学会 ) 92 ( 3 ) 351 - 360 2009年03月

本研究では,大規模なクラスタリング結果のグラフを用いた可視化手法を提案する.一般にグラフによる要素間の関係の可視化は,データが大規模になるとノード数・リンク数ともに増加するため,グラフが過密になり要素間の関係把握が困難になる.提案手法では画面上の表示ノード数・リンク数を一定範囲に保ちながら,全体の概観から詳細な要素間の関係までの表示粒度を連続的に変更することができ,いわばクラスタリング結果空間を自由に探索することができるようなインタラクティブな閲覧環境を実現している.このような閲覧環境の実現にはユーザの操作にリアルタイムに追従できる高速なグラフ変形が必須であるが,本論文ではこれを実現するデータ構造とアルゴリズムを提案する.また, Javaを用いて試作を行い,本手法の評価を行った.

Loop-free Link Stability Metrics for Proactive Routing in Wireless Ad Hoc Networks

Takuya Yoshihiro

2009 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-8 ( IEEE ) 502 - 506 2009年 [査読有り]

To improve communication quality in wireless ad hoc networks, it is definitely important to select stable links as communication paths. To this end, various mobility metrics are presented in the literature. However, the routing loop problem, which is inevitably involved in link-state proactive routing scheme, has not been discussed well. In this paper, we propose a simple dynamic metrics in respect of link stability, which is loop-free throughout dynamic metric transition. Through a theoretical analysis of loop-freeness, we present our new strategy to achieve loop-freeness with sufficiently low cost for ad hoc networks.

Loop-free link stability metrics for proactive routing in wireless ad hoc networks

Takuya Yoshihiro

IEEE International Conference on Communications 2009年 [査読有り]

DOI

黒毛和種肥育牛の枝肉形質バイオマーカーの探索I : 大規模プロテオーム解析情報と血統・枝肉形質情報の統合情報管理システムの構築

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

日本畜産學會報 = The Japanese journal of zootechnical science ( 公益社団法人日本畜産学会 ) 79 ( 4 ) 467 - 481 2008年11月

我々は，黒毛和種肥育牛の枝肉形質に関連するバイオマーカーの同定を目的とする大規模プロテオーム解析に特化した統合情報管理システムを構築した．この統合情報管理システムを利用することで，血統情報や枝肉形質の情報など43項目におよぶ肥育牛の生物情報とプロテオーム解析で得られる数百から数千個におよぶタンパク質スポットの発現量データを一元的に管理することができ，柔軟な検索機能を有したデータ管理・検索インタフェースを介して，様々な統計解析やデータマイニング解析に必要なデータ群を簡便に抽出することが可能になった．本稿では，本システムの概要を示すとともに，現在までに蓄積されている黒毛和種肥育牛の枝肉形質・血統データ，および腎周囲白色脂肪組織におけるタンパク質発現データを用いてシステムを稼働・実施することで，（1）種雄牛BとCの産子の枝肉重量の比較，（2）二代祖（母の父）が，種雄牛Dの産子の枝肉形質に与える影響の解析，（3）バラの厚さの高い群と低い群の間での十個のタンパク質スポットの発現量の比較（4）エネルギー生産に関わるタンパク質であるF1 ATPsynthase chain Fの発現量と枝肉形質との相関解析などの解析を行い，本システムの有効性を実証した．

Mining combinatorial effects on quantitative traits from protein expression data

Takuya Yoshihiro, Etsuko Inoue, Masaru Nakagawa

Frontiers in Artificial Intelligence and Applications ( IOS Press ) 180 ( 1 ) 359 - 367 2008年 [査読有り]

In this paper we proposed a data mining method to find interesting relation among the small number of proteins and a quantitative trait from protein expression data. It is practically important to find small number of proteins which in combination effects on some characteristics of samples because it motivates further experiments to investigate the function of the proteins. Further, treating quantitative trait rather than categorical data is also practically important since considerable part of characteristics of samples is represented by quantitative values. Our data mining method apply discriminant analysis into protein expression data and quantitative trait data to derive interesting relations among them. © 2008 The authors and IOS Press. All rights reserved.

DOI

A Single Backup-table Rerouting scheme for fast failure protection in OSPF

Takuya Yoshihiro

IEICE Transactions on Communications ( Institute of Electronics, Information and Communication, Engineers, IEICE ) E91-B ( 9 ) 2838 - 2847 2008年 [査読有り]

We propose a practical link protection scheme, called Single Backup-table Rerouting, (SBR) as an extension for Open Shortest Path First (OSPF). SBR protects against any single link failure as soon as the failure occurs if the topology of every area in OSPF is two-link-connected. An efficient algorithm to compute a set of backup tables is provided for networks with symmetric link costs. The foremost feature of SBR is that the backup process is fully distributed, so no message exchange is required and the modification of OSPF is minor. OSPF is extended with the following: only one extra backup routing table, a 2-bit flag at each traffic packet, and a process for handling the backup table. There are no changes to the message format of OSPF. In this paper, we present the practical link protection scheme by fitting SBR into several OSPF specific mechanisms such as OSPF areas, Equal Costs Multipath (ECMP), and virtual links with proofs of their correctness. Furthermore, together with a loop-free routing technique for link-state routing, SBR guarantees the consistency of every route against a single link failure, even during the path recomputation phase, until it converges to the new shortest paths. Copyright © 2008 The Institute of Electronics, Information and Communication Engineers.

DOI

植物の育種・栽培試験のためのデータ分析支援システム

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

情報知識学会誌 ( 情報知識学会 ) 17 ( 1 ) 2 - 14 2007年02月

全国の農業試験場などで実施されている育種・栽培試験のデータの管理および分析支援を実現するデータベースシステムを構築した．育種・栽培試験の現場では，植物を生育する労力だけでなく，データ分析の労力も無視できない．そこで，現場の研究者へのヒアリングや試験事例の文献調査により，育種・栽培試験データをモデル化した．また，このモデルを用いて分析支援システムを構築し，分析作業にかかるデータの可視化作業の効率化を実現した．本システムは，ユーザの利便性を第一に設計し，現場の研究者が普段より使用している表計算ソフトのファイルを用いて容易にデータベースへのデータ登録が行える．また，Webブラウザ上で容易にグラフ表示などの可視化を行えるほか，特定条件のデータのみをダウンロードする機能などにより，現場の分析作業を支援する．本研究では，試験事例である文献を対するモデルの適用性の調査と，実際の育種・栽培試験のデータ分析へのシステムの適用実験により評価を行った．

DOI

インターネットを利用した遠隔健康管理システムの試み

里村宏章, 田中猛彦, 吉廣卓哉, 中川優

情報知識学会誌 ( 情報知識学会 ) 16 ( 2 ) 59 - 62 2006年05月

We have constructed the healthcare supporting systems for aged people, for patients with diabetes, and for pediatric patients and their families. In these systems, the people in need of nursing care actively and regularly send the healthcare data while the medical personnel view them to make use of subsequent medical services or nursing cares. The architecture is almost common to these systems in the sense that there exists a web and database server together with Internet-enable devices. However, since the data in the databases and to be exchanged were entirely difficult, the systems have been designed, implemented and maintained separately. In this paper, we review the features of the systems, and discuss the united, versatile database system for remote healthcare support.

DOI

イネのトランスポゾンディスプレイ解析のためのデータベースシステム

井上悦子, 吉廣卓哉, 川路英哉, 堀端章, 中川優

情報知識学会誌 ( 情報知識学会 ) 16 ( 1 ) 28 - 38 2006年01月

本研究では, トランスポゾンを用いた遺伝子型と表現型との相関解析を支援するデータベースシステムを構築し, イネのトランスポゾンmPingを利用した実験に適用し評価した. 我々は, mPingを利用して大規模なイネの変異体シリーズを作成し, 遺伝子型と表現型との関係を解析することで遺伝子機能の推定を目指している. しかし, 実験結果から変異の発見作業に多大な労力がかかることが, 実験規模を拡大する上でのボトルネックの一つであった. 本システムでは, 実験で得られる全データをデータベースに格納し, 実験結果から変異を発見後, 表現型との相関を解析するまでの効率的なインタフェースを提供する. 本システムをmPingを利用した実験に適用した結果, 波形データの重ね合わせや変異箇所候補の自動検出などの効果で, 作業時間を従来の数分の一程度に短縮できた. 本システムにより, ハイスループットに大規模な実験や解析を行うことが可能となる.

DOI

System Support of Diabetic Self-treatments Using Mobile Phones

Takuya Yoshihiro, Kazuhiro Ikemoto, Kumiko Mori, Sachiko Kagawa, Yasuhisa Yamamoto, Masaru Nakagawa

KNOWLEDGE-BASED SOFTWARE ENGINEERING ( I O S PRESS ) 140 263 - 272 2006年 [査読有り]

We developed a system which helps diabetic people making self-treatments in their home, by exchanging treatment information and advices with their doctors and nurses in the hospital. To cure diabetes, it is essential to make daily treatment such as improving meals, doing exercises, taking insulin, or taking medicines to keep blood glucose level in a proper range. However, since many of diabetic people do not go to see their doctor frequently, say, about once a month, they tend to be lazy about self-treatments during that long period of time. As a result, many people are suffering from diabetes long time. To improve this situation, we developed the system to help self-treatments. In our system, patients report their concrete treatment activities to their doctors using mobile phones. The doctors watch the reports and make proper encouraging advices to the patients. We expect that Such kind of advices call raise patients' motivation for their self-treatments. In designing the system, we tried to have doctors understand the concrete activities of patients' self-treatments through patients' daily reports, so that doctors can make proper and effective advices and encouragements. In this paper, we introduce the new diabetic self-treatment supporting system and report the evaluation results through a short-term test operation with several patients.

Single backup table schemes for shortest-path routing

Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro

Theoretical Computer Science 333 ( 3 ) 347 - 353 2005年03月 [査読有り]

We introduce a new recovery scheme that needs only one extra backup routing table for networks employing shortest-path routing. By precomputing this backup table, the network recovers from any single link failure immediately after the failure occurs. To compute the backup routing table for this scheme, we use an almost linear time algorithm to solve the {r,v}-problem, which is a variation of the best swap problem presented by Nardelli et al. We further show that the same solution can be computed in exactly linear time if the underlying graph is unweighted. © 2004 Elsevier B.V. All rights reserved.

DOI

花園村遠隔看護システムの構築

宮本浩伸, 岡本裕宇, 小脇亮平, 吉廣卓哉, 堀内恵美子, 中川優

情報知識学会誌 ( 情報知識学会 ) 14 ( 2 ) 57 - 60 2004年

We developed a remote aged care system for Hanazono village which is one of the typical underpopulated villages in Japan. In many of such depopulated villages, there is the problem that the number of visiting nurses who provide aged care services is not enough. As a result, visiting nurses can visit aged people not so often (it might be once a week or so), and hence aged people is easy to lose their health. To improve this situation, our system helps visiting nurses get hold of the health condition of aged people by showing the information of their daily health condition which is input everyday by aged people at their own houses. Here, to make a easy input operation even for aged people, we use L-mode terminals at each house and design easy-to-operate Web pages which are accessed by the terminal. We further performed a test operation of our system in Hanazono village and confirmed the effectiveness of our system.

DOI

Avoiding Routing Loops on the Internet

Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro

Theory of Computing Systems 36 ( 6 ) 597 - 609 2003年11月 [査読有り]

Suppose that some particular link in the Internet is currently congested. A natural solution is to try to make packets bypass that link. This can be done by increasing the cost of that link intentionally, say from a1 to a2, since the Internet uses 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 a1 to a2 but through an intermediate value, a3, i.e., from a1 to a 3 and then to a2. We may need several intermediate values. We show that in this case the greedy strategy, namely, raising the cost as much as possible in each step, is optimal.

DOI

Polynomial-Time Computable Backup Tables for Shortest-Path Routing

ITO H. (担当区分：筆頭著者,　責任著者 )

Carleton Scientific Proc. SIROCC 2003 163 - 177 2003年

Avoiding Routing Loops on the Internet

Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro (担当区分：筆頭著者,　責任著者 )

Carleton Scientific Proc. of SIROCCO 2002 197 - 210 2002年

Stateless Autoconfiguration of IPv6 Site-Local Addresses.

Takuya YOSHIHIRO, Masayuki SHIMADA, Yasuo OKABE, Kazuo IWAMA

IASTED Proc. of CCN 2002 299 - 304 2002年

遠隔教育のための柔軟な講義検索手法

片山薫, 香川修見, 神谷泰宏, 對馬英樹, 吉廣卓哉, 上林彌彦

情報処理学会論文誌 ( 一般社団法人情報処理学会 ) 39 ( 10 ) 2837 - 2845 1998年10月

遠隔講義システムにおいて，記録された講義の検索をサポートすることは重要である．それによって学生が講義の必要な部分だけを復習したり，教師が過去の講義をより簡単に再利用したりすることができる．講義はマルチメディア教材を作成する過程であると見ることができるが，一般にマルチメディアデータの検索は困難である．画像認識技術や音声認識技術を利用して信頼性の高い索引を生成することはまだ容易ではない．我々はこれらの直接的なアプローチとは異なり，マルチメディアデータが作成される過程（講義）で同期をとって結び付けられる，より検索しやすいデータ〔スライドに含まれるテキスト，ペンやポインタ，キーボードなどの入力装置からのイベント情報（動作履歴と呼ぶ）など〕を利用する．これまでの講義システムでは，講義のビデオを結び付けられたスライド（教材）やノートの単位でしか検索することができなかった．我々のシステムでは，テキストデータに対する文字列検索や動作履歴の検索，ビデオの早送りや巻き戻しなど，これら多様なデータのそれぞれに検索機能を提供しそれを組み合わせることによってより柔軟な検索機能を実現する．また，講義中の雑談部分を検索したり，教材をスライドより詳細なブロック（教材の意味的な単位）の単位で検索できるようにするためのユーザインタフェースも提供する．Support of searching recorded lectures is important in distance education systems because students review parts of lectures they need and teachers reuse their past lectures easily.We view lecturing as a process of making multimedia teaching materials.It is difficult to search multimedia data in general.Although automatic scene analysis and speech recognition are very popular among researchers,it is still not easy to form reliable index.Our approach is different from these ways of searching multimedia data directly.We use information which are connected to continuous media such as video and audio with synchronous constraints during lectures,that is,texts contained in slides,sequences of events of pens and pointers(called Action History) and so on.In conventional systems search of lectures is supported only in a unit of slides or annotations.Our system provides a flexible search mechanism by combining search functions for various recorded information,for example,string for texts,a search function for action histories,fast forward and rewind of video and so on.User interfaces are also provided to enable users to search lectures for idle talk or search them in a unit of blocks which are semantic units of slided.

　前のページ-次のページ　

<吉廣 卓哉>

論文 - 吉廣 卓哉

<吉廣　卓哉>

論文 - 吉廣　卓哉