2022/06/26 更新

写真a

ハシモト カズオ
橋本 和夫
所属
附属機関・学校 リサーチイノベーションセンター
職名
教授(任期付)

学歴

  •  
    -
    2001年

    東北大学   情報科学研究科   情報基礎科学  

  •  
    -
    2001年

    東北大学  

  •  
    -
    1986年

    ブラウン大学   計算機学科   人工知能  

  •  
    -
    1986年

    Brown University   Computer Science   Artificial Intelligence  

  •  
    -
    1979年

    東北大学   工学研究科   電子工学専攻  

  •  
    -
    1979年

    東北大学  

  •  
    -
    1977年

    東北大学   工学部   電子工学科  

  •  
    -
    1977年

    東北大学  

▼全件表示

学位

  • 東北大学   工学修士

  • ブラウン大学   計算機科学修士

  • 東北大学   情報科学博士

経歴

  • 1979年
    -
    2001年

    KDDI/KDDI 研究所 研究員 取締役(1998-2001), KDDI米国研究所所長(2001-2005)

  • 1979年
    -
    2001年

    KDD Research and Development Laboratories Research Engineer Executive Director, KDDI R&D Labs (1998-2001), President and CEO, KDDI Labs USA Inc. (2001-2005)

  • 1984年
    -
    1985年

    ブラウン大学 修士学生

  • 1984年
    -
    1985年

    Brown University graduate student for master's degree

  •  
     
     

    東北大学 大学院情報科学研究科 応用情報科学専攻 先端情報共有技術論講座(寄附講座)   教授

所属学協会

  •  
     
     

    電子情報通信学会

  •  
     
     

    人工知能学会

  •  
     
     

    情報処理学会

  •  
     
     

    the Association for the Advancement of Artificial Intelligence

  •  
     
     

    the Institute of Electrical and Electronics Engineers

  •  
     
     

    電子情報通信学会

  •  
     
     

    The Japanese Society of Artificial Intelligence

  •  
     
     

    Information Processing Society of Japan

  •  
     
     

    the Association for the Advancement of Artificial Intelligence

  •  
     
     

    the Institute of Electrical and Electronics Engineers

▼全件表示

 

研究分野

  • データベース

  • ヒューマンインタフェース、インタラクション

  • 知能情報学

  • 情報学基礎論

Misc

  • MS2: A New Real-Time Multi-Source Mobile-Streaming Architecture

    Tarik Taleb, Kazuo Hashimoto

    IEEE TRANSACTIONS ON BROADCASTING   57 ( 3 ) 662 - 673  2011年09月

     概要を見る

    Video streaming to mobile users is gaining a tremendous momentum within the communities of both industrial and academic researchers. While the networking technologies continue to evolve, video streaming applications are still prone to constrained bandwidth and also to highly varying network dynamics. This paper addresses these issues and attempts to provide a unique solution by proposing a new multi-source streaming strategy specifically tailored for next generation mobile networks for delivering multimedia services to mobile users. The proposed strategy is dubbed MS2, Multi-Source Mobile Streaming, which comprises a set of mechanisms that aim at ensuring seamless, continuous, and smooth playback of video for roaming users, guaranteeing an efficient and fair utilization of network resources while meeting the playback and buffer constraints of the clients, preventing redundant transmissions and minimizing packet reordering. Through various computer simulations, the performance of MS2 is then validated. The simulation results are encouraging and exhibit the effectiveness of the adopted MS2 architecture.

    DOI CiNii

  • MS2: A New Real-Time Multi-Source Mobile-Streaming Architecture

    Tarik Taleb, Kazuo Hashimoto

    IEEE TRANSACTIONS ON BROADCASTING   57 ( 3 ) 662 - 673  2011年09月

     概要を見る

    Video streaming to mobile users is gaining a tremendous momentum within the communities of both industrial and academic researchers. While the networking technologies continue to evolve, video streaming applications are still prone to constrained bandwidth and also to highly varying network dynamics. This paper addresses these issues and attempts to provide a unique solution by proposing a new multi-source streaming strategy specifically tailored for next generation mobile networks for delivering multimedia services to mobile users. The proposed strategy is dubbed MS2, Multi-Source Mobile Streaming, which comprises a set of mechanisms that aim at ensuring seamless, continuous, and smooth playback of video for roaming users, guaranteeing an efficient and fair utilization of network resources while meeting the playback and buffer constraints of the clients, preventing redundant transmissions and minimizing packet reordering. Through various computer simulations, the performance of MS2 is then validated. The simulation results are encouraging and exhibit the effectiveness of the adopted MS2 architecture.

    DOI CiNii

  • 半導体歩留り解析のための回帰木に基づく仮説検証手法の提案

    津田英隆, 白井英大, 寺邊正大, 橋本和夫, 篠原 歩

    電気学会論文誌D   131 ( 10 ) 1232 - 1239  2011年

    DOI CiNii

  • Kurihara Green ICT Project -- Towards Symbiosis between Human's Life and Nature

    Norio Shiratori, Kazuo Hashimoto, Debasish Chakraborty, Hideyuki Takahashi, Takuo Suganuma, Naoki Nakamura, Atushi Takeda

    Journal of Internet Technology   ( 12 ) 1 - 11  2011年

  • Socio-familiar Personalized Service の提案とその応用 ― 次世代ユビキタスサービスを実現するネットワークソフトウェアへ向けて―

    橋本和夫, 北形元, 高橋秀幸, 武田敦志, チャクラボルティデバシシュ, 白鳥則郎

    電子通信学会論文誌B   J94-B ( 4 ) 492 - 502  2011年

  • インターネットコンテンツの配信・管理技術(1.情報爆発時代における通信の果たす役割とその未来像,<特集>情報爆発時代に向けた新たな通信技術-限界打破への挑戦-)

    橋本和夫, 松本一則, 滝嶋康弘

    電子情報通信学会誌   Vol.94 ( No.5 ) 492 - 502  2011年

  • On Mental State Detection and Tagging in Nursing Records

    Antonia Scheidel, Kazuto Hachiya, Ahmad Zufri, Kazuo Hashimoto

    Proc. of ICNC-FSKD2011    2011年

  • 半導体歩留り解析のための回帰木に基づく仮説検証手法の提案

    津田英隆, 白井英大, 寺邊正大, 橋本和夫, 篠原 歩

    電気学会論文誌D   131 ( 10 ) 1232 - 1239  2011年

    DOI CiNii

  • Kurihara Green ICT Project -- Towards Symbiosis between Human's Life and Nature

    Norio Shiratori, Kazuo Hashimoto, Debasish Chakraborty, Hideyuki Takahashi, Takuo Suganuma, Naoki Nakamura, Atushi Takeda

    Journal of Internet Technology   ( 12 ) 1 - 11  2011年

  • Socio-familiar Personalized Service の提案とその応用 ― 次世代ユビキタスサービスを実現するネットワークソフトウェアへ向けて―

    橋本和夫, 北形元, 高橋秀幸, 武田敦志, チャクラボルティデバシシュ, 白鳥則郎

    電子通信学会論文誌B   J94-B ( 4 ) 492 - 502  2011年

  • インターネットコンテンツの配信・管理技術(1.情報爆発時代における通信の果たす役割とその未来像,<特集>情報爆発時代に向けた新たな通信技術-限界打破への挑戦-)

    橋本和夫, 松本一則, 滝嶋康弘

    電子情報通信学会誌   Vol.94 ( No.5 ) 492 - 502  2011年

  • On Mental State Detection and Tagging in Nursing Records

    Antonia Scheidel, Kazuto Hachiya, Ahmad Zufri, Kazuo Hashimoto

    Proc. of ICNC-FSKD2011    2011年

  • Condensed Vector Machines: Learning Fast Machine for Large Data

    Dung Duc Nguyen, Kazunori Matsumoto, Yasuhiro Takishima, Kazuo Hashimoto

    IEEE TRANSACTIONS ON NEURAL NETWORKS   21 ( 12 ) 1903 - 1914  2010年12月

     概要を見る

    Scalability is one of the main challenges for kernel-based methods and support vector machines (SVMs). The quadratic demand in memory for storing kernel matrices makes it impossible for training on million-size data. Sophisticated decomposition algorithms have been proposed to efficiently train SVMs using only important examples, which ideally are the final support vectors (SVs). However, the ability of the decomposition method is limited to large-scale applications where the number of SVs is still too large for a computer's capacity. From another perspective, the large number of SVs slows down SVMs in the testing phase, making it impractical for many applications. In this paper, we introduce the integration of a vector combination scheme to simplify the SVM solution into an incremental working set selection for SVM training. The main objective of the integration is to maintain a minimal number of final SVs, bringing a minimum resource demand and faster training time. Consequently, the learning machines are more compact and run faster thanks to the small number of vectors included in their solution. Experimental results on large benchmark datasets shows that the proposed condensed SVMs achieve both training and testing efficiency while maintaining a generalization ability equivalent to that of normal SVMs.

    DOI

  • Condensed Vector Machines: Learning Fast Machine for Large Data

    Dung Duc Nguyen, Kazunori Matsumoto, Yasuhiro Takishima, Kazuo Hashimoto

    IEEE TRANSACTIONS ON NEURAL NETWORKS   21 ( 12 ) 1903 - 1914  2010年12月

     概要を見る

    Scalability is one of the main challenges for kernel-based methods and support vector machines (SVMs). The quadratic demand in memory for storing kernel matrices makes it impossible for training on million-size data. Sophisticated decomposition algorithms have been proposed to efficiently train SVMs using only important examples, which ideally are the final support vectors (SVs). However, the ability of the decomposition method is limited to large-scale applications where the number of SVs is still too large for a computer's capacity. From another perspective, the large number of SVs slows down SVMs in the testing phase, making it impractical for many applications. In this paper, we introduce the integration of a vector combination scheme to simplify the SVM solution into an incremental working set selection for SVM training. The main objective of the integration is to maintain a minimal number of final SVs, bringing a minimum resource demand and faster training time. Consequently, the learning machines are more compact and run faster thanks to the small number of vectors included in their solution. Experimental results on large benchmark datasets shows that the proposed condensed SVMs achieve both training and testing efficiency while maintaining a generalization ability equivalent to that of normal SVMs.

    DOI

  • A Fair Load Sharing Scheme for Multi-source Multimedia Overlay Application Layer Multicast

    Jun Makishi, Debasish Chakraborty, Toshiaki Osada, Gen Kitagata, Atushi Takeda, Kazuo Hashimoto, Noiro Shiratori

    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPLEX, INTELLIGENT AND SOFTWARE INTENSIVE SYSTEMS (CISIS 2010)     337 - 344  2010年

     概要を見る

    IP multicasting is an efficient and scalable way to deliver high quality audio and video streams for group communication. However, widespread deployment of IP multicast is unlikely in near future and it requires substantial infrastructure modifications. For rapid deployment of multicast application, Application Layer Multicast (ALM) is an alternate choice to circumvent this situation, as it supports group communication independent of network layer support. Previous studies on ALM mainly focused on achieving high throughput for bandwidth intensive applications and unfairness of communication quality is still a serious issue in multi-source communication. In this paper, we present an autonomous distributed scheme to construct an ALM tree to improve fairness and overall communication quality among the participants in a multi-source multimedia communication. Extensive simulation and experimental results show that our proposed scheme increases the incoming bitrate of the lowest recipient among all the nodes, as well as improving fairness for all receivers.

    DOI

  • Hash-Based Distributed Public Key Infrastructure for Ubiquitous Environments

    Atushi Takeda, Seiya Nakayama, Gen Kitagata, Debasish Chakraborty, Kazuo Hashimoto, Norio Shiratori

    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPLEX, INTELLIGENT AND SOFTWARE INTENSIVE SYSTEMS (CISIS 2010)     376 - 383  2010年

     概要を見る

    In ubiquitous environments, there are a huge number of computer nodes which provide a lot of information services via the Internet. Therefore, a secure communication system is required for ubiquitous environments. In this paper, we propose a new architecture of distributed public key infrastructure, named as Hash-based Distributed Public Key Infrastructure (HDPKI). A HDPKI system achieves a scalable management of public key certificates by using Distributed Hash Table. Additionally, it is easy to use a HDPKI system, because we can register our public key certificates automatically. In this paper, we show scalability of HDPKI through computer simulation. According to these results, the total amount of required messages for certificate management in a HDPKI system is O(log n) where n is the number of nodes.

    DOI

  • Visitor Access Control Scheme utilizing Social Relationship in the RealWorld

    Gen Kitagata, Debasish Chakraborty, Satoshi Ogawa, Atushi Takeda, Kazuo Hashimoto, Norio Shiratori

    Proc. of IFIPTM 2010     95 - 107  2010年

  • "A Flexible and Secure Access Control Scheme Using Social Behavior in Real World

    Debasish Chakraborty, Satoshi Ogawa, Gen Kitagata, Atushi Takeda, Kazuo Hashimoto, Norio Shirator

    Journal of Mobile Multimedia   6 ( 2 ) 145 - 157  2010年

  • A proposal of privacy management architecture

    Yoshinori Osawa, Satoru Imamura, Atushi Takeda, Gen Kitagata, Norio Shiratori, Kazuo Hashimoto

    Proceedings - 2010 10th Annual International Symposium on Applications and the Internet, SAINT 2010     161 - 164  2010年

     概要を見る

    Recent use of web services has spread over a wide variety of application areas. Users are requested to disclose private information for the use of web services. Such a disclosure is facing the risk of leaking private information. Privacy leakage is becoming one of the serious social problems. For the better use of web services, it is necessary to provide a reliable scheme for privacy management. There are many cases of private information leakage which are caused by user's misuse or unintended disclosure. In order to prevent users from unnecessarily leaking of private information, the users will be asked to clearly define information disclosure criteria. This paper discusses a privacy management architecture to prevent users from unnecessary leaking of private information. We demonstrate a prototype implementation how the proposed architecture effectively works in the initial setting of web services. © 2010 IEEE.

    DOI

  • An overlay authentication network for active utilization of private information

    Akihiro Nakarai, Akira Sakatoku, Atsushi Takeda, Gen Kitagata, Debasish Chakraborty, Kazuo Hashimoto, Norio Shiratori

    Proceedings - 2010 10th Annual International Symposium on Applications and the Internet, SAINT 2010     185 - 188  2010年

     概要を見る

    In this paper, we propose an overlay authentication network for active utilization of private information. The proposed network realizes safe registration and usage of users' private information. In addition, the proposed network realizes the distributed management and utilization of users' private information. These features enable services which utilize users' private information. In this paper, we present implementation of the prototype system based on the proposed network, and confirm the effectiveness of the proposed network. © 2010 IEEE.

    DOI

  • Partially Overlapped Channel Assignment on Wireless Mesh Network Backbone

    Pedro B, F. Duarte, Zubair Md. Fadlullah, Kazuo Hashimoto, Nei Kato

    Proc. of GLOBECOM 2010    2010年

    DOI

  • A Fair Load Sharing Scheme for Multi-source Multimedia Overlay Application Layer Multicast

    Jun Makishi, Debasish Chakraborty, Toshiaki Osada, Gen Kitagata, Atushi Takeda, Kazuo Hashimoto, Noiro Shiratori

    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPLEX, INTELLIGENT AND SOFTWARE INTENSIVE SYSTEMS (CISIS 2010)     337 - 344  2010年

     概要を見る

    IP multicasting is an efficient and scalable way to deliver high quality audio and video streams for group communication. However, widespread deployment of IP multicast is unlikely in near future and it requires substantial infrastructure modifications. For rapid deployment of multicast application, Application Layer Multicast (ALM) is an alternate choice to circumvent this situation, as it supports group communication independent of network layer support. Previous studies on ALM mainly focused on achieving high throughput for bandwidth intensive applications and unfairness of communication quality is still a serious issue in multi-source communication. In this paper, we present an autonomous distributed scheme to construct an ALM tree to improve fairness and overall communication quality among the participants in a multi-source multimedia communication. Extensive simulation and experimental results show that our proposed scheme increases the incoming bitrate of the lowest recipient among all the nodes, as well as improving fairness for all receivers.

    DOI

  • Hash-Based Distributed Public Key Infrastructure for Ubiquitous Environments

    Atushi Takeda, Seiya Nakayama, Gen Kitagata, Debasish Chakraborty, Kazuo Hashimoto, Norio Shiratori

    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPLEX, INTELLIGENT AND SOFTWARE INTENSIVE SYSTEMS (CISIS 2010)     376 - 383  2010年

     概要を見る

    In ubiquitous environments, there are a huge number of computer nodes which provide a lot of information services via the Internet. Therefore, a secure communication system is required for ubiquitous environments. In this paper, we propose a new architecture of distributed public key infrastructure, named as Hash-based Distributed Public Key Infrastructure (HDPKI). A HDPKI system achieves a scalable management of public key certificates by using Distributed Hash Table. Additionally, it is easy to use a HDPKI system, because we can register our public key certificates automatically. In this paper, we show scalability of HDPKI through computer simulation. According to these results, the total amount of required messages for certificate management in a HDPKI system is O(log n) where n is the number of nodes.

    DOI

  • Visitor Access Control Scheme utilizing Social Relationship in the RealWorld

    Gen Kitagata, Debasish Chakraborty, Satoshi Ogawa, Atushi Takeda, Kazuo Hashimoto, Norio Shiratori

    Proc. of IFIPTM 2010     95 - 107  2010年

  • "A Flexible and Secure Access Control Scheme Using Social Behavior in Real World

    Debasish Chakraborty, Satoshi Ogawa, Gen Kitagata, Atushi Takeda, Kazuo Hashimoto, Norio Shirator

    Journal of Mobile Multimedia   6 ( 2 ) 145 - 157  2010年

  • A proposal of privacy management architecture

    Yoshinori Osawa, Satoru Imamura, Atushi Takeda, Gen Kitagata, Norio Shiratori, Kazuo Hashimoto

    Proceedings - 2010 10th Annual International Symposium on Applications and the Internet, SAINT 2010     161 - 164  2010年

     概要を見る

    Recent use of web services has spread over a wide variety of application areas. Users are requested to disclose private information for the use of web services. Such a disclosure is facing the risk of leaking private information. Privacy leakage is becoming one of the serious social problems. For the better use of web services, it is necessary to provide a reliable scheme for privacy management. There are many cases of private information leakage which are caused by user's misuse or unintended disclosure. In order to prevent users from unnecessarily leaking of private information, the users will be asked to clearly define information disclosure criteria. This paper discusses a privacy management architecture to prevent users from unnecessary leaking of private information. We demonstrate a prototype implementation how the proposed architecture effectively works in the initial setting of web services. © 2010 IEEE.

    DOI

  • An overlay authentication network for active utilization of private information

    Akihiro Nakarai, Akira Sakatoku, Atsushi Takeda, Gen Kitagata, Debasish Chakraborty, Kazuo Hashimoto, Norio Shiratori

    Proceedings - 2010 10th Annual International Symposium on Applications and the Internet, SAINT 2010     185 - 188  2010年

     概要を見る

    In this paper, we propose an overlay authentication network for active utilization of private information. The proposed network realizes safe registration and usage of users' private information. In addition, the proposed network realizes the distributed management and utilization of users' private information. These features enable services which utilize users' private information. In this paper, we present implementation of the prototype system based on the proposed network, and confirm the effectiveness of the proposed network. © 2010 IEEE.

    DOI

  • Partially Overlapped Channel Assignment on Wireless Mesh Network Backbone

    Pedro B, F. Duarte, Zubair Md. Fadlullah, Kazuo Hashimoto, Nei Kato

    Proc. of GLOBECOM 2010    2010年

    DOI

  • Service Independent Access Control Architecture for User Generated Content (UGC) and Its Implementation

    Akira Yamada, Ayuniu Kubota, Yutaka Miyake, Kazuo Hashimoto

    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS   E92D ( 10 ) 1961 - 1970  2009年10月

     概要を見る

    Using Web-based content management systems such as Blog, an end user can easily publish User Generated Content (UGC). Although publishing of UGCs is easy, controlling access to them is a difficult problem for end users. Currently. most of Blog sites offer no access control mechanism, and even when it is available to users, it is not sufficient to control users who do not have an account at the site, not to mention that it cannot control accesses to content hosted by other UGC sites. In this paper, we propose new access control architecture for UGC in which third party entities can offer access control mechanism to users independently of UGC hosting sites. With this architecture, a user can control accesses to his content that might be spread over many different UGC sites, regardless of whether those sites have access control mechanism or not. The key idea to separate access control mechanism from UGC sites is to apply cryptographic access control and we implemented the idea in such a way that it requires no modification to UGC sites and Web browsers. Our prototype implementation shows that the proposed access control architecture can be easily deployed in the current Web-based communication environment and it works quite well With Popular Blog sites.

    DOI CiNii

  • Service Independent Access Control Architecture for User Generated Content (UGC) and Its Implementation

    Akira Yamada, Ayuniu Kubota, Yutaka Miyake, Kazuo Hashimoto

    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS   E92D ( 10 ) 1961 - 1970  2009年10月

     概要を見る

    Using Web-based content management systems such as Blog, an end user can easily publish User Generated Content (UGC). Although publishing of UGCs is easy, controlling access to them is a difficult problem for end users. Currently. most of Blog sites offer no access control mechanism, and even when it is available to users, it is not sufficient to control users who do not have an account at the site, not to mention that it cannot control accesses to content hosted by other UGC sites. In this paper, we propose new access control architecture for UGC in which third party entities can offer access control mechanism to users independently of UGC hosting sites. With this architecture, a user can control accesses to his content that might be spread over many different UGC sites, regardless of whether those sites have access control mechanism or not. The key idea to separate access control mechanism from UGC sites is to apply cryptographic access control and we implemented the idea in such a way that it requires no modification to UGC sites and Web browsers. Our prototype implementation shows that the proposed access control architecture can be easily deployed in the current Web-based communication environment and it works quite well With Popular Blog sites.

    DOI CiNii

  • Efficient algorithms to compute compressed longest common substrings and compressed palindromes

    Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, Kazuo Hashimoto

    THEORETICAL COMPUTER SCIENCE   410 ( 8-10 ) 900 - 913  2009年03月

     概要を見る

    This paper studies two problems on compressed strings described in terms of straight line programs (SLPs). One is to compute the length of the longest common substring of two given SLP-compressed strings, and the other is to compute all palindromes of a given SLP-compressed string. In order to solve these problems efficiently (in polynomial time w.r.t. the compressed size) decompression is never feasible, since the decompressed size can be exponentially large. We develop combinatorial algorithms that solve these problems in O(n(4) log n) time with O(n(3)) space, and in O(n(4)) time with O(n(2)) space, respectively, where n is the size of the input SLP-compressed strings. (C) 2008 Elsevier B.V. All rights reserved.

    DOI

  • Efficient algorithms to compute compressed longest common substrings and compressed palindromes

    Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, Kazuo Hashimoto

    THEORETICAL COMPUTER SCIENCE   410 ( 8-10 ) 900 - 913  2009年03月

     概要を見る

    This paper studies two problems on compressed strings described in terms of straight line programs (SLPs). One is to compute the length of the longest common substring of two given SLP-compressed strings, and the other is to compute all palindromes of a given SLP-compressed string. In order to solve these problems efficiently (in polynomial time w.r.t. the compressed size) decompression is never feasible, since the decompressed size can be exponentially large. We develop combinatorial algorithms that solve these problems in O(n(4) log n) time with O(n(3)) space, and in O(n(4)) time with O(n(2)) space, respectively, where n is the size of the input SLP-compressed strings. (C) 2008 Elsevier B.V. All rights reserved.

    DOI

  • 半導体歩留り解析へのデータマイニング適用手法の提案

    津田 英隆, 白井 英大, 寺邊 正大, 橋本 和夫, 篠原 歩

    電気学会論文誌D, 129(12)     1201 - 1211  2009年

    DOI

  • Proposal and performance evaluation of Hash-based authentication for P2P network

    Atushi Takeda, Debasish Chakraborty, Gen Kitagata, Kazuo Hashimoto, Norio Shiratori

    Journal of Information Processing   17   59 - 71  2009年

     概要を見る

    Recently, P2P networks have been evolving rapidly. Efficient authentication of P2P network nodes remains a difficult task. As described herein, we propose an authentication method called Hash-based Distributed Authentication Method (HDAM), which realizes a decentralized efficient mutual authentication mechanism for each pair of nodes in a P2P network. It performs distributed management of public keys using Web of Trust and a Distributed Hash Table. The scheme markedly reduces both the memory size requirement and the overhead of communication data sent by the nodes. Simulation results show that HDAM can reduce the required memory size by up to 95%. Furthermore, the results show that HDAM is more scalable than the conventional method: the communication overhead of HDAM is O(log p).

    DOI CiNii

  • A Flexible and Secure Access Control Scheme using Social Behavior in the Real World

    Debasish Chakraborty, Satoshi Ogawa, Gen Kitagata, Atushi Takeda, Kazuo Hashimoto, Norio Shiratori

    Proc. of CISIS 2009     375 - 381  2009年

    DOI

  • Construction of Overlay Application Layer Multicast Tree for Efficient Multisource Multimedia Communication

    Debasish Chakraborty, Jun Makishi, Toshiaki Osada, Gen Kitagata, Atushi Takeda, Kazuo Hashimoto, Norio Shiratori

    Proc. of ICICIS2009    2009年

  • Anomaly Detection for DNS Servers Using Frequent Host Selection

    Akira Yamada, Yutaka Miyake, Masahiro Terabe, Kazuo Hashimoto, Nei Kato

    Proc. of AINA ’09    2009年

    DOI

  • A Group-Based Key Management Protocol for Mobile Ad Hoc Networks

    Qing Chen, Xiaodong Lin, Sherman Shen, Kazuo Hashimoto, Nei Kato

    Proc. of IEEE Globecom ’09    2009年

    DOI

  • An Efficient Load-balancing Technique for Overlay Application Layer Multicast

    Jun Makishi, Debasish. Chakraborty, Toshiaki Osada, Gen Kitagata, Atsushi Takeda, Kazuo Hashimoto, Norio Shiratori

    Proc. of CODEC ’09    2009年

  • 半導体歩留り解析へのデータマイニング適用手法の提案

    津田 英隆, 白井 英大, 寺邊 正大, 橋本 和夫, 篠原 歩

    電気学会論文誌D, 129(12)     1201 - 1211  2009年

    DOI

  • Proposal and performance evaluation of Hash-based authentication for P2P network

    Atushi Takeda, Debasish Chakraborty, Gen Kitagata, Kazuo Hashimoto, Norio Shiratori

    Journal of Information Processing   17   59 - 71  2009年

     概要を見る

    Recently, P2P networks have been evolving rapidly. Efficient authentication of P2P network nodes remains a difficult task. As described herein, we propose an authentication method called Hash-based Distributed Authentication Method (HDAM), which realizes a decentralized efficient mutual authentication mechanism for each pair of nodes in a P2P network. It performs distributed management of public keys using Web of Trust and a Distributed Hash Table. The scheme markedly reduces both the memory size requirement and the overhead of communication data sent by the nodes. Simulation results show that HDAM can reduce the required memory size by up to 95%. Furthermore, the results show that HDAM is more scalable than the conventional method: the communication overhead of HDAM is O(log p).

    DOI CiNii

  • A Flexible and Secure Access Control Scheme using Social Behavior in the Real World

    Debasish Chakraborty, Satoshi Ogawa, Gen Kitagata, Atushi Takeda, Kazuo Hashimoto, Norio Shiratori

    Proc. of CISIS 2009     375 - 381  2009年

    DOI

  • Construction of Overlay Application Layer Multicast Tree for Efficient Multisource Multimedia Communication

    Debasish Chakraborty, Jun Makishi, Toshiaki Osada, Gen Kitagata, Atushi Takeda, Kazuo Hashimoto, Norio Shiratori

    Proc. of ICICIS2009    2009年

  • Anomaly Detection for DNS Servers Using Frequent Host Selection

    Akira Yamada, Yutaka Miyake, Masahiro Terabe, Kazuo Hashimoto, Nei Kato

    Proc. of AINA ’09    2009年

    DOI

  • A group-based key management protocol for mobile ad hoc networks

    Qing Chen, Xiaodong Lin, Sherman Shen, Kazuo Hashimoto, Nei Kato

    GLOBECOM - IEEE Global Telecommunications Conference    2009年

     概要を見る

    Due to the dynamic topology and non infrastructure, network participants cooperate with their neighbors to route packets. The lack of centralized services allows mobile ad hoc networks to be easily and swiftly deployed, but make it difficult to check others' identities on the other hand. Cryptographic tools have been introduced to secure group communications, such as Private and Public Key Infrastructure. The autonomous and distributed nature of mobile ad hoc network demands a decentralized authentication service, where Public Key Infrastructure is considered a better solution. Public Key Infrastructure can ensure both confidentiality and authenticity, but it is impractical to provide an online trusted third party as Certificate Authority (CA) for mobile ad hoc network. In this paper, we proposed a new key management protocol which utilizes certificate graphs and distributed Certificate Authorities. Certificate graph maintained by each user represents the trust among his neighbors, then the maximum clique of certificate graph is selected to be CAs. Based on the assumption that initial certificate graph building is secure [11], good users have more friends while bad ones have less, thus a reliable group can be constructed. The most trustful subset of these good users - the maximum clique - is elected as the governor of this group, which takes the responsibility of certificate authentication.

    DOI

  • An Efficient Load-balancing Technique for Overlay Application Layer Multicast

    Jun Makishi, Debasish. Chakraborty, Toshiaki Osada, Gen Kitagata, Atsushi Takeda, Kazuo Hashimoto, Norio Shiratori

    Proc. of CODEC ’09    2009年

  • A Cross-Layer Approach for an Efficient Delivery of TCP/RTP-Based Multimedia Applications in Heterogeneous Wireless Networks

    Tarik Taleb, Kenichi Kashibuchi, Alessandro Leonardi, Sergio Palazzo, Kazuo Hashimoto, Nei Kato, Yoshiaki Nemoto

    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY   57 ( 6 ) 3801 - 3814  2008年11月

     概要を見る

    Recent trends in the telecommunication industry have been moving toward the development of ubiquitous information systems, where the provision of a plethora of advanced multimedia services should be possible, regardless of time and space limitations. An efficient and seamless delivery of multimedia services over various types of wireless networks is still a challenging task. The underlying difficulty consists of the disparity in the bandwidth availability over each network type. Indeed, the fundamental challenge upon a handoff phenomenon in a heterogeneous wireless network consists of an efficient probing of the bandwidth availability of the new network, followed by a prompt adjustment of the data delivery rate. This paper presents a cross-layer approach that involves five layers, namely, physical, data link, application, network, and transport layers. The three former layers are used to anticipate the handoff occurrence and to locate the new point of attachment to the network. Based on their feedback, the transport layer is used then to probe the resources of the new network using low-priority dummy packets. Being the most widely used protocol for multimedia delivery, this paper addresses multimedia applications based on the Transmission Control Protocol (TCP) and the Real-time Transport Protocol (RTP). The design of the whole cross-layer architecture is discussed, and enhancements to the two protocols are proposed. The performance of the enhanced TCP and the RTP are evaluated and compared against existing schemes through extensive simulations. The obtained results are encouraging and promising for the delivery of multimedia services in heterogeneous wireless networks.

    DOI CiNii

  • A Cross-Layer Approach for an Efficient Delivery of TCP/RTP-Based Multimedia Applications in Heterogeneous Wireless Networks

    Tarik Taleb, Kenichi Kashibuchi, Alessandro Leonardi, Sergio Palazzo, Kazuo Hashimoto, Nei Kato, Yoshiaki Nemoto

    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY   57 ( 6 ) 3801 - 3814  2008年11月

     概要を見る

    Recent trends in the telecommunication industry have been moving toward the development of ubiquitous information systems, where the provision of a plethora of advanced multimedia services should be possible, regardless of time and space limitations. An efficient and seamless delivery of multimedia services over various types of wireless networks is still a challenging task. The underlying difficulty consists of the disparity in the bandwidth availability over each network type. Indeed, the fundamental challenge upon a handoff phenomenon in a heterogeneous wireless network consists of an efficient probing of the bandwidth availability of the new network, followed by a prompt adjustment of the data delivery rate. This paper presents a cross-layer approach that involves five layers, namely, physical, data link, application, network, and transport layers. The three former layers are used to anticipate the handoff occurrence and to locate the new point of attachment to the network. Based on their feedback, the transport layer is used then to probe the resources of the new network using low-priority dummy packets. Being the most widely used protocol for multimedia delivery, this paper addresses multimedia applications based on the Transmission Control Protocol (TCP) and the Real-time Transport Protocol (RTP). The design of the whole cross-layer architecture is discussed, and enhancements to the two protocols are proposed. The performance of the enhanced TCP and the RTP are evaluated and compared against existing schemes through extensive simulations. The obtained results are encouraging and promising for the delivery of multimedia services in heterogeneous wireless networks.

    DOI CiNii

  • SSL/TLS で暗号化されたWeb 通信に対する侵入検知システム

    山田 明, 三宅 優, 寺邊 正大, 橋本和夫

    情報処理学会論文誌   49 ( 3 ) 1144 - 1154  2008年

  • A New Scalable Distributed Authentication for P2P Network and its Performance Evaluation

    Atushi Takeda, Debasish Chakraborty, Gen Kitagata, Kazuo Hashimoto, Norio Shiratori

    WSEAS Transactions on COMPUTERS   7   1628 - 1637  2008年

  • Context-aware Remote Healthcare Support System based on Overlay Network

    Debasish Chakraborty, Hideyuki Takahashi, Takuo Suganuma, Atushi Takeda, Gen Kitagata, Kazuo Hashimoto, Norio Shiratori

    WSEAS Transactions on COMPUTERS   7   1505 - 1514  2008年

  • A Novel Web Usage Mining Method - Mining and Clustering of DAG Access Patterns Considering Page Browsing Time

    Koichiro Mihara, Masahiro Terabe, Kazuo Hashimoto

    Proc. of WEBIST'08     313 - 320  2008年

  • 大規模SVM学習のための2段式逐次ワーキングセット選択手法

    グェン・ズン・デュック, 松本一則, 橋本和夫, 滝嶋康弘, 寺邊正大

    日本データベース学会論文誌   7 ( 1 ) 61 - 66  2008年

  • Learning Higher Accurate Decision Tree from Concept Drifting Data Streams

    Satoru Nishimura, Masahiro Terabe, Kazuo Hashimoto, Koichiro Mihara

    Proc. of IEA-AIE'08 LNCS     179 - 188  2008年

    DOI

  • Two-stage incremental working set selection for fast support vector training on large datasets

    DucDung Nguyen, Kazunori Matsumoto, Yasuhiro Takishima, Kazuo Hashimoto, Masahiro Terabe

    RIVF 2008 - 2008 IEEE International Conference on Research, Innovation and Vision for the Future in Computing and Communication Technologies     221 - 226  2008年

     概要を見る

    We propose iSVM - an incremental algorithm that achieves high speed in training support vector machines (SVMs) on large datasets. In the common decomposition framework, iSVM starts with a minimum working set (WS), and then iteratively selects one training example to update the WS in each optimization loop. iSVM employs a two-stage strategy in processing the training data. In the first stage, the most prominent vector among randomly sampled data is added to the WS. This stage results in an approximate SVM solution. The second stage uses temporal solutions to scan through the whole training data once again to find the remaining support vectors (SVs). We show that iSVM is especially efficient for training SVMs on applications where data size is much larger than number of SVs. On the KDD-CUP 1999 network intrusion detection dataset with nearly five millions training examples, iSVM takes less than one hour to train an SVM with 94% testing accuracy, compared to seven hours with LibSVM - one of the state-of-the-art SVM implementations. We also provide analysis and experimental comparisons between iSVM and the related algorithms. ©2008 IEEE.

    DOI

  • Design of Physical Activity Recommendation System

    Ashkan Sami, Ryoichi Nagatomi, Masahiro Terabe, Kazuo Hashimoto

    Proc. of IADIS European Conference on Data Mining 2008    2008年

  • A New Scalable Distributed Authentication for P2P Network and its Performance Evaluation

    Atushi Takeda, Debasish Chakraborty, Gen Kitagata, Kazuo Hashimoto, Norio Shiratori

    Proc. of 12th WSEAS International Conference on COMPUTERS     536 - 541  2008年

  • An Adaptive Context Aware Communication System for Ubiquitous Environment based on Overlay Network

    Debasish Chakraborty, Hideyuki Takahashi, Takuo Suganuma, Atushi Takeda, Gen Kitagata, Kazuo Hashimoto, Norio Shiratori

    Proc. of the 12th WSEAS International Conference on COMPUTERS     832 - 837  2008年

  • On Supporting Handoff Management for Multi-Source Video Streaming in Mobile Communication Systems

    Tarik Taleb, Tomoyuki Nakamura, Kazuo Hashimoto

    Proc. of IEEE    2008年

    DOI

  • Decision Tree Induction from Numeric Data Stream

    Satoru Nishimura, Masahiro Terabe, Kazuo Hashimoto

    AI 2008: ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS   5360   311 - 317  2008年

     概要を見る

    Hoeffding Tree Algorithm is known as a method to induce decision trees from a data stream. Treatment of numeric attribute on Hoeffding Tree Algorithm has been discussed for stationary input. It has riot yet investigated, however, for non-stationary input where the effect of concept drift is apparent. This paper identifies three major approaches to handle numeric values, Exhaustive Method, Gaussian Approximation, and Discretizaion Method, and through experiment shows the best suited modeling of numeric attributes for Hoeffding Tree Algorithm. This paper also experimentaly compares tire performance of two known methods for concept drift detection, Hoeffding Bound Based Method and Accuracy Based Method.

    DOI

  • Multi-class Support Vector Machine Simplification

    DucDung Nguyen, Kazunori Matsumoto, Kazuo Hashimoto, Yasuhiro Takishima, Daichi Takatori, Masahiro Terabe

    Proc. of PRICAI 2008: Trends in Artificial Intelligence, LNCS     799 - 808  2008年

    DOI

  • SSL/TLS で暗号化されたWeb 通信に対する侵入検知システム

    山田 明, 三宅 優, 寺邊 正大, 橋本和夫

    情報処理学会論文誌   49 ( 3 ) 1144 - 1154  2008年

  • A New Scalable Distributed Authentication for P2P Network and its Performance Evaluation

    Atushi Takeda, Debasish Chakraborty, Gen Kitagata, Kazuo Hashimoto, Norio Shiratori

    WSEAS Transactions on COMPUTERS   7   1628 - 1637  2008年

  • Context-aware Remote Healthcare Support System based on Overlay Network

    Debasish Chakraborty, Hideyuki Takahashi, Takuo Suganuma, Atushi Takeda, Gen Kitagata, Kazuo Hashimoto, Norio Shiratori

    WSEAS Transactions on COMPUTERS   7   1505 - 1514  2008年

  • A Novel Web Usage Mining Method - Mining and Clustering of DAG Access Patterns Considering Page Browsing Time

    Koichiro Mihara, Masahiro Terabe, Kazuo Hashimoto

    Proc. of WEBIST'08     313 - 320  2008年

  • 大規模SVM学習のための2段式逐次ワーキングセット選択手法

    グェン・ズン・デュック, 松本一則, 橋本和夫, 滝嶋康弘, 寺邊正大

    日本データベース学会論文誌   7 ( 1 ) 61 - 66  2008年

  • Learning Higher Accurate Decision Tree from Concept Drifting Data Streams

    Satoru Nishimura, Masahiro Terabe, Kazuo Hashimoto, Koichiro Mihara

    Proc. of IEA-AIE'08 LNCS     179 - 188  2008年

    DOI

  • Two-stage incremental working set selection for fast support vector training on large datasets

    DucDung Nguyen, Kazunori Matsumoto, Yasuhiro Takishima, Kazuo Hashimoto, Masahiro Terabe

    RIVF 2008 - 2008 IEEE International Conference on Research, Innovation and Vision for the Future in Computing and Communication Technologies     221 - 226  2008年

     概要を見る

    We propose iSVM - an incremental algorithm that achieves high speed in training support vector machines (SVMs) on large datasets. In the common decomposition framework, iSVM starts with a minimum working set (WS), and then iteratively selects one training example to update the WS in each optimization loop. iSVM employs a two-stage strategy in processing the training data. In the first stage, the most prominent vector among randomly sampled data is added to the WS. This stage results in an approximate SVM solution. The second stage uses temporal solutions to scan through the whole training data once again to find the remaining support vectors (SVs). We show that iSVM is especially efficient for training SVMs on applications where data size is much larger than number of SVs. On the KDD-CUP 1999 network intrusion detection dataset with nearly five millions training examples, iSVM takes less than one hour to train an SVM with 94% testing accuracy, compared to seven hours with LibSVM - one of the state-of-the-art SVM implementations. We also provide analysis and experimental comparisons between iSVM and the related algorithms. ©2008 IEEE.

    DOI

  • Design of Physical Activity Recommendation System

    Ashkan Sami, Ryoichi Nagatomi, Masahiro Terabe, Kazuo Hashimoto

    Proc. of IADIS European Conference on Data Mining 2008    2008年

  • A New Scalable Distributed Authentication for P2P Network and its Performance Evaluation

    Atushi Takeda, Debasish Chakraborty, Gen Kitagata, Kazuo Hashimoto, Norio Shiratori

    Proc. of 12th WSEAS International Conference on COMPUTERS     536 - 541  2008年

  • An Adaptive Context Aware Communication System for Ubiquitous Environment based on Overlay Network

    Debasish Chakraborty, Hideyuki Takahashi, Takuo Suganuma, Atushi Takeda, Gen Kitagata, Kazuo Hashimoto, Norio Shiratori

    Proc. of the 12th WSEAS International Conference on COMPUTERS     832 - 837  2008年

  • On Supporting Handoff Management for Multi-Source Video Streaming in Mobile Communication Systems

    Tarik Taleb, Tomoyuki Nakamura, Kazuo Hashimoto

    Proc. of IEEE    2008年

    DOI

  • Decision Tree Induction from Numeric Data Stream

    Satoru Nishimura, Masahiro Terabe, Kazuo Hashimoto

    AI 2008: ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS   5360   311 - 317  2008年

     概要を見る

    Hoeffding Tree Algorithm is known as a method to induce decision trees from a data stream. Treatment of numeric attribute on Hoeffding Tree Algorithm has been discussed for stationary input. It has riot yet investigated, however, for non-stationary input where the effect of concept drift is apparent. This paper identifies three major approaches to handle numeric values, Exhaustive Method, Gaussian Approximation, and Discretizaion Method, and through experiment shows the best suited modeling of numeric attributes for Hoeffding Tree Algorithm. This paper also experimentaly compares tire performance of two known methods for concept drift detection, Hoeffding Bound Based Method and Accuracy Based Method.

    DOI

  • Multi-class Support Vector Machine Simplification

    DucDung Nguyen, Kazunori Matsumoto, Kazuo Hashimoto, Yasuhiro Takishima, Daichi Takatori, Masahiro Terabe

    Proc. of PRICAI 2008: Trends in Artificial Intelligence, LNCS     799 - 808  2008年

    DOI

  • A stable routing protocol to support ITS services in VANET networks

    Tarik Taleb, Ehssan Sakhaee, Abbas Jamalipour, Kazuo Hashimoto, Nei Kato, Yoshiaki Nemoto

    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY   56 ( 6 ) 3337 - 3347  2007年11月

     概要を見る

    There are numerous research challenges that need to be addressed until a wide deployment of vehicular ad hoc networks (VANETs) becomes possible. One of the critical issues consists of the design of scalable routing algorithms that are robust to frequent path disruptions caused by vehicles' mobility. This paper argues the use of information on vehicles' movement information (e.g., position, direction, speed, and digital mapping of roads) to predict a possible link-breakage event prior to its occurrence. Vehicles are grouped according to their velocity vectors. This kind of grouping ensures that vehicles, belonging to the same group, are more likely to establish stable single and multihop paths as they are moving together. Setting up routes that involve only vehicles from the same group guarantees a high level of stable communication in VANETs. The scheme presented in this paper also reduces the overall traffic in highly mobile VANET networks. The frequency of flood requests is reduced by elongating the link duration of the selected paths. To prevent broadcast storms that may be intrigued during path discovery operation, another scheme is also introduced. The basic concept behind the proposed scheme is to broadcast only specific and well-defined packets, referred to as "best packets" in this paper. The performance of the scheme is evaluated through computer simulations. Simulation results indicate the benefits of the proposed routing strategy in terms of increasing link duration, reducing the number of link-breakage events and increasing the end-to-end throughput.

    DOI CiNii

  • A stable routing protocol to support ITS services in VANET networks

    Tarik Taleb, Ehssan Sakhaee, Abbas Jamalipour, Kazuo Hashimoto, Nei Kato, Yoshiaki Nemoto

    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY   56 ( 6 ) 3337 - 3347  2007年11月

     概要を見る

    There are numerous research challenges that need to be addressed until a wide deployment of vehicular ad hoc networks (VANETs) becomes possible. One of the critical issues consists of the design of scalable routing algorithms that are robust to frequent path disruptions caused by vehicles' mobility. This paper argues the use of information on vehicles' movement information (e.g., position, direction, speed, and digital mapping of roads) to predict a possible link-breakage event prior to its occurrence. Vehicles are grouped according to their velocity vectors. This kind of grouping ensures that vehicles, belonging to the same group, are more likely to establish stable single and multihop paths as they are moving together. Setting up routes that involve only vehicles from the same group guarantees a high level of stable communication in VANETs. The scheme presented in this paper also reduces the overall traffic in highly mobile VANET networks. The frequency of flood requests is reduced by elongating the link duration of the selected paths. To prevent broadcast storms that may be intrigued during path discovery operation, another scheme is also introduced. The basic concept behind the proposed scheme is to broadcast only specific and well-defined packets, referred to as "best packets" in this paper. The performance of the scheme is evaluated through computer simulations. Simulation results indicate the benefits of the proposed routing strategy in terms of increasing link duration, reducing the number of link-breakage events and increasing the end-to-end throughput.

    DOI CiNii

  • Toward efficient service-level QoS provisioning in large-scale 802.11-based networks

    Tarik Taleb, Abdelhamid Nafaa, Liam Murphy, Kazuo Hashimoto, Nei Kato, Yoshiaki Nemoto

    IEEE Network   21 ( 5 ) 42 - 48  2007年09月

     概要を見る

    Along with recent advances in mobile networking and portable computing technologies, there is a trend in the telecommunications industry toward the development of efficient ubiquitous systems that can provide a set of bandwidth-intensive and real-time services to multiple users while supporting their full mobility. Largescale deployment of 802.11-based technologies will play an integral part in the construction of such ubiquitous wireless mobile systems. A challenging task in the development of such networks is efficient provisioning of QoS-enabled services for mobile users. In this context, we propose a scheme that constantly monitors the overall network performance to perform admission control and traffic conditioning at the 802.11-based access points and mobile terminals. The focus is on servicelevel fairness, where different flows from the same traffic class can still receive the same QoS level even if they have different bit rates. Furthermore, given the mobility of users, the success of any resource allocation and admission control model depends on the continuity of QoS guarantees across different WLANs. This article proposes a dynamic service level agreement negotiation protocol that allows mobile terminals to perform handoffs between different WLANs while maintaining the agreed level of service. End users also can change their service levels in response to changes in network conditions. © 2007 IEEE.

    DOI CiNii

  • Dynamic QoS Negotiation for Next-Generation Wireless Communications Systems

    J.C. Fernandez, T. Taleb, N. Ansari, K. Hashimoto, N. Kato, Y. Nemoto

    Proc. IEEE WCNC'07    2007年

    DOI

  • Improving ELB in Multi-Hop Satellite Constellations with Short ISL Delays

    T. Takahashi, T. Taleb, K. Hashimoto, Y. Nemoto, N. Kato

    Proc. 25th AIAA Int. Commun. Satellite Systems Conf.    2007年

  • Combating against attacks on encrypted protocols

    Zubair Md Fadlullah, Tarik Taleb, Nirwan Ansari, Kazuo Hashimoto, Yutake Miyake, Yoshiaki Nemoto, Nei Kato

    IEEE International Conference on Communications     1211 - 1216  2007年

     概要を見る

    Attacks against encrypted protocols are becoming increasingly popular. They pose a serious challenge to the conventional Intrusion Detection Systems (IDSs) which heavily rely on inspecting the network packet fields and are consequently unable to monitor encrypted sessions. IDSs can be broadly categorized into two types: signature-based and anomaly-based IDSs. The signature-based IDSs rely on previous attack signatures but are often ineffective against new attacks. On the other hand, anomaly-based detection systems depend on detecting the change in the protocol behavior caused by an attack. The latter can be employed to detect novel attacks, and therefore are often preferred over their signature-based counterpart. In this paper, we envision an anomaly-based IDS which can detect attacks against popular encrypted protocols, such as SSH and SSL. The proposed system creates a normal behavior profile and uses nonparametric Cusum algorithm to detect deviation from the normal profile. Upon detecting an anomaly, the proposed mechanism generates an alert, sets a delay to the protocol response, and traces back the attacker. The effectiveness of the proposed detection scheme is verified via simulations. © 2007 IEEE.

    DOI

  • An Application-Driven Mobility Management Scheme for Hierarchical Mobile IPv6 Networks

    T. Taleb, Y. Ikeda, K. Hashimoto, N. Kato, Y. Nemoto

    Proc. IEEE ICC'07    2007年

    DOI

  • A Dynamic Service Level Negotiation Mechanism for QoS Provisioning in NGEO Satellite Networks

    T. Taleb, K. Hashimoto, N. Kato, Y. Nemoto

    Proc. IEEE ICC'07    2007年

    DOI

  • On how to Mitigate the Packet Reordering Issue in the Explicit Load Balancing Scheme

    T. Taleb, D. Mashimo, K. Hashimoto, N. Kato, Y. Nemoto

    Proc. IEEE Global Information Infrastructure Symposium (GIIS)    2007年

    DOI

  • Tracing back attacks against encrypted protocols

    Tarik Taleb, Zubair Md. Fadlullah, Kazuo Hashimoto, Yoshiaki Nemoto, Nei Kato

    IWCMC 2007: Proceedings of the 2007 International Wireless Communications and Mobile Computing Conference     121 - 126  2007年

     概要を見る

    Attacks against encrypted protocols have become increasingly popular and sophisticated. Such attacks are often undetectable by the traditional Intrusion Detection Systems (IDSs). Additionally, the encrypted attack-traffic makes tracing the source of the attack substantially more difficult. In this paper, we address these issues and devise a mechanism to trace back attackers against encrypted protocols. In our efforts to combat attacks against cryptographic protocols, we have integrated a traceback mechanism at the monitoring stubs (MSs), which were introduced in one of our previous works. While we previously focused on strategically placing monitoring stubs to detect attacks against encrypted protocols, in this work we aim at equipping MSs with a traceback feature. In our approach, when a given MS detects an attack, it starts tracing back to the root of the attack. The traceback mechanism relies on monitoring the extracted features at different MSs, i.e., in different points of the target network. At each MS, the monitored features over time provide a pattern which is compared or correlated with the monitored patterns at the neighboring MSs. A high correlation value in the patterns observed by two adjacent MSs indicates that the attack traffic propagated through the network elements covered by these MSs. Based on these correlation values and a prior knowledge of the network topology, the system can then construct a path back to the attacking hosts. The effectiveness of the proposed traceback scheme is verified by simulations. Copyright 2007 ACM.

    DOI

  • Towards Efficient Service-level QoS Provisioning in Large-scale 802.11-based Networks

    T. Taleb, A. Nafaa, L. Murphy, K. Hashimoto, N. Kato, Y. Nemoto

    IEEE Network Magazine   21 ( 5 ) 42 - 48  2007年

    DOI CiNii

  • Tri-Testing: A novel Semi-Supervised Learning Method based on Ensemble Learning and Active Learning

    S. Kubo, M. Terabe, K. Hashimoto, R. Ono

    Proc. of the Sixth Mexican International Conference on Artificial Intelligence (MICAI'07)    2007年

  • A Graph-Based Web Usage Mining Considering Page Browsing Time

    K. Mihara, M. Terabe, K. Hashimoto

    Proc. of the Second International Conference on Knowledge, Information and Creativity Support Systems (KICSS'07)     199 - 206  2007年

  • Multi-path Scheduling Algorithm for Real-Time Video Applications in Next-Generation Wireless Networks

    J.C. Fernandez, T. Taleb, K. Hashimoto, Y. Nemoto, N. Kato

    Proc. 4th Int'l Conf. Innovations in Information Technology (IIT'07)    2007年

  • Route Optimization for Large Scale Network Mobility Assisted by BGP

    F. Mimoune, F.N. Abdesselam, T. Taleb, K. Hashimoto

    Proc. IEEE Globecom'07    2007年

    DOI

  • A fair and lifetime-maximum routing algorithm for wireless sensor networks

    D.V. Giang, T. Taleb, K. Hashimoto, N. Kato, Y. Nemoto

    Proc. IEEE Globecom'07    2007年

    DOI

  • A Bandwidth Aggregation-aware QoS Negotiation Mechanism for Next-Generation Wireless Networks

    T. Taleb, J.C. Fernandez, K. Hashimoto, N. Kato, Y. Nemoto

    Proc. IEEE Globecom'07    2007年

    DOI

  • Dynamic QoS negotiation for next-generation wireless communications systems

    Juan Carlos Fernandez, Tarik Taleb, Nirwan Ansari, Kazuo Hashimoto, Yoshiaki Nemoto, Nei Kato

    IEEE Wireless Communications and Networking Conference, WCNC     3229 - 3233  2007年

     概要を見る

    Users in next generation wireless networks are expected to be highly dynamic while maintaining connectivity through different devices with different processing and communication capabilities. In wireless environments, bandwidth is scarce and channel conditions are time-varying. To guarantee Quality of Service (QoS) to users roaming between heterogeneous wireless networks, a dynamic QoS negotiation mechanism, which allows users to dynamically negotiate their service-levels with the network, is required. Several protocols for dynamic service level negotiation have been proposed, each focusing on a particular mode. This paper presents an overview of these protocols and discusses their limitations. To alleviate these shortcomings, a dynamic QoS negotiation scheme to allow users to change their service levels in response to changes in both network conditions and their own resource requirements is proposed. In the proposed scheme, upon an intra-domain handoff of a mobile node, the visited access point consults the previously used access point to confirm the legitimacy of the service negotiation request issued by the mobile node. The performance of the proposed scheme has been investigated and compared with other dynamic negotiation approaches. It was demonstrated that the proposed scheme outperforms the state-of-the-art method, in terms of the signaling overhead and data storage, at the expense of a slight increase in the overall negotiation delay. © 2007 IEEE.

    DOI

  • Improving ELB in Multi-Hop Satellite Constellations with Short ISL Delays

    T. Takahashi, T. Taleb, K. Hashimoto, Y. Nemoto, N. Kato

    Proc. 25th AIAA Int. Commun. Satellite Systems Conf.    2007年

  • Combating against attacks on encrypted protocols

    Zubair Md Fadlullah, Tarik Taleb, Nirwan Ansari, Kazuo Hashimoto, Yutake Miyake, Yoshiaki Nemoto, Nei Kato

    IEEE International Conference on Communications     1211 - 1216  2007年

     概要を見る

    Attacks against encrypted protocols are becoming increasingly popular. They pose a serious challenge to the conventional Intrusion Detection Systems (IDSs) which heavily rely on inspecting the network packet fields and are consequently unable to monitor encrypted sessions. IDSs can be broadly categorized into two types: signature-based and anomaly-based IDSs. The signature-based IDSs rely on previous attack signatures but are often ineffective against new attacks. On the other hand, anomaly-based detection systems depend on detecting the change in the protocol behavior caused by an attack. The latter can be employed to detect novel attacks, and therefore are often preferred over their signature-based counterpart. In this paper, we envision an anomaly-based IDS which can detect attacks against popular encrypted protocols, such as SSH and SSL. The proposed system creates a normal behavior profile and uses nonparametric Cusum algorithm to detect deviation from the normal profile. Upon detecting an anomaly, the proposed mechanism generates an alert, sets a delay to the protocol response, and traces back the attacker. The effectiveness of the proposed detection scheme is verified via simulations. © 2007 IEEE.

    DOI

  • An Application-Driven Mobility Management Scheme for Hierarchical Mobile IPv6 Networks

    T. Taleb, Y. Ikeda, K. Hashimoto, N. Kato, Y. Nemoto

    Proc. IEEE ICC'07    2007年

    DOI

  • A Dynamic Service Level Negotiation Mechanism for QoS Provisioning in NGEO Satellite Networks

    T. Taleb, K. Hashimoto, N. Kato, Y. Nemoto

    Proc. IEEE ICC'07    2007年

    DOI

  • On how to Mitigate the Packet Reordering Issue in the Explicit Load Balancing Scheme

    T. Taleb, D. Mashimo, K. Hashimoto, N. Kato, Y. Nemoto

    Proc. IEEE Global Information Infrastructure Symposium (GIIS)    2007年

    DOI

  • Tracing Back Attacks Against Encrypted Protocols

    T. Taleb, Z.Md. Fadlullah, K. Hashimoto, N. Kato, Y. Nemoto

    Proc. Int'l Wirless Commun. & Mobile Computing Conf. (IWCMC'07)    2007年

    DOI

  • Tri-Testing: A novel Semi-Supervised Learning Method based on Ensemble Learning and Active Learning

    S. Kubo, M. Terabe, K. Hashimoto, R. Ono

    Proc. of the Sixth Mexican International Conference on Artificial Intelligence (MICAI'07)    2007年

  • A Graph-Based Web Usage Mining Considering Page Browsing Time

    K. Mihara, M. Terabe, K. Hashimoto

    Proc. of the Second International Conference on Knowledge, Information and Creativity Support Systems (KICSS'07)     199 - 206  2007年

  • Multi-path Scheduling Algorithm for Real-Time Video Applications in Next-Generation Wireless Networks

    J.C. Fernandez, T. Taleb, K. Hashimoto, Y. Nemoto, N. Kato

    Proc. 4th Int'l Conf. Innovations in Information Technology (IIT'07)    2007年

  • Route Optimization for Large Scale Network Mobility Assisted by BGP

    F. Mimoune, F.N. Abdesselam, T. Taleb, K. Hashimoto

    Proc. IEEE Globecom'07    2007年

    DOI

  • A fair and lifetime-maximum routing algorithm for wireless sensor networks

    Do Van Giang, Tarik Taleb, Kazuo Hashimoto, Nei Kato, Yoshiaki Nemoto

    GLOBECOM - IEEE Global Telecommunications Conference     581 - 585  2007年

     概要を見る

    In multi-hop sensor networks, information obtained by the monitoring nodes need to be routed to the sinks. If we assume that the transmitter power level can be adjusted to use the minimum energy required to reach the intended next hop receiver, the energy consumption rate per unit information transmission depends on the choice of the next hop node. In a power-aware routing approach, most proposed algorithms aim at minimizing the total energy consumption or maximizing network lifetime. In this paper, we propose a new routing algorithm with two goals: minimizing the total energy consumption and ensuring fairness of energy consumption between nodes. We formulate this as a nonlinear programming problem and use a sub-gradient algorithm to solve the problem. We also evaluate the proposed algorithm via simulations at the end of this paper. © 2007 IEEE.

    DOI

  • A bandwidth aggregation-aware QoS negotiation mechanism for next-generation wireless networks

    Tarik Taleb, Juan Carlos Fernandez, Kazuo Hashimoto, Yoshiaki Nemoto, Nei Kato

    GLOBECOM - IEEE Global Telecommunications Conference     1912 - 1916  2007年

     概要を見る

    The transmission of high quality video requires high bandwidth. Ensuring constantly high bandwidth in wireless environments is a challenging task given constraints in the current wireless network resources. Current mobile computers are equipped with multiples wireless interfaces that can be used to improve the video quality by aggregating the bandwidth of these interfaces. Such Bandwidth Aggregation (BAG) approach involves multiple paths in communication and gives rise to a number of issues related to the management of the Service Level Agreement (SLA) and packet reordering. To guarantee an efficient and fair management of SLA, this paper presents a bandwidth aggregation-aware QoS negotiation mechanism that enables users to dynamically negotiate their desired service levels and to reach them through the use of bandwidth aggregation. This operation is performed while ensuring a fair use of the network resources among all competing users. To cope with packet reordering, a new scheduling strategy is presented. The performance evaluation of the proposed bandwidth aggregation-aware QoS negotiation scheme and the proposed scheduling algorithm are conducted via simulations and the results are discussed. © 2007 IEEE.

    DOI

  • A Multi-Level Security Based Autonomic Parameter Selection Approach for an Effective and Early Detection of Internet Worms

    K. Simkhada, T. Taleb, Y. Waizumi, A. Jamalipour, K. Hashimoto, N. Kato, Y. Nemoto

    Proc. IEEE Globecom'06    2006年

    DOI

  • ELB: An Explicit Load Balancing Routing Protocol for Multi-Hop NGEO Satellite Constellations

    T. Taleb, D. Mashimo, A. Jamalipour, K. Hashimoto, Y. Nemoto, N. Kato

    Proc. IEEE Globecom'06    2006年

    DOI

  • Design Guidelines for a Global and Self-Managed LEO Satellites-Based Sensor Network

    T. Taleb, A. Jamalipour, F.N. Abdesselam, K. Hashimoto, N. Kato, Y. Nemoto

    Proc. IEEE Globecom'06    2006年

    DOI

  • A Multi-Level Security Based Autonomic Parameter Selection Approach for an Effective and Early Detection of Internet Worms

    K. Simkhada, T. Taleb, Y. Waizumi, A. Jamalipour, K. Hashimoto, N. Kato, Y. Nemoto

    Proc. IEEE Globecom'06    2006年

    DOI

  • ELB: An Explicit Load Balancing Routing Protocol for Multi-Hop NGEO Satellite Constellations

    T. Taleb, D. Mashimo, A. Jamalipour, K. Hashimoto, Y. Nemoto, N. Kato

    Proc. IEEE Globecom'06    2006年

    DOI

  • Design Guidelines for a Global and Self-Managed LEO Satellites-Based Sensor Network

    T. Taleb, A. Jamalipour, F.N. Abdesselam, K. Hashimoto, N. Kato, Y. Nemoto

    Proc. IEEE Globecom'06    2006年

    DOI

  • Video data transmission protocol "SVFTP" using multiple TCP connections and its application

    S Sakazawa, Y Takishima, Y Kitatsuji, Y Nakajima, M Wada, K Hashimoto

    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS   E88D ( 5 ) 976 - 983  2005年05月

     概要を見る

    This paper presents a novel data transmission protocol "SVFTP," which enables high-speed and error-free video data transmission over IP networks. A video transmission system based on SVFTP is also presented. While conventional protocols are designed for file transmission, SVFTP focuses on video data as a continuous media. In order to fit a flexible video transmission system, SVFTP achieves higher throughput on the long distance link as well as transmission interruption/resumption and progressive download and play back. In addition, a rate shaping mechanism for SVFTP is introduced in order to control greediness and burst traffic of multiple-TCP sessions. Laboratory and field transmission experiments show that SVFTP achieves high performance and functionality.

    DOI CiNii

  • Video data transmission protocol "SVFTP" using multiple TCP connections and its application

    S Sakazawa, Y Takishima, Y Kitatsuji, Y Nakajima, M Wada, K Hashimoto

    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS   E88D ( 5 ) 976 - 983  2005年05月

     概要を見る

    This paper presents a novel data transmission protocol "SVFTP," which enables high-speed and error-free video data transmission over IP networks. A video transmission system based on SVFTP is also presented. While conventional protocols are designed for file transmission, SVFTP focuses on video data as a continuous media. In order to fit a flexible video transmission system, SVFTP achieves higher throughput on the long distance link as well as transmission interruption/resumption and progressive download and play back. In addition, a rate shaping mechanism for SVFTP is introduced in order to control greediness and burst traffic of multiple-TCP sessions. Laboratory and field transmission experiments show that SVFTP achieves high performance and functionality.

    DOI CiNii

  • AI application of the Internet - Backgrounds and issues

    K Yoshida, K Hashimoto

    2003 SYMPOSIUM ON APPLICATIONS AND THE INTERNET WORKSHOPS, PROCEEDINGS     273 - 275  2003年

     概要を見る

    The wide spread of the internet and its evolution as a new social infiastructure increase the importance of applications which best use internet potential. The intelligent functions which can be realized with resent computer technology are indispensable to best benefit from the internet. In this' pap. er we, overview the current situation together with the issues which we have to solve to realize the new infrastructure of networked society.

    DOI

  • Deterioration detection system using local stationary binomial models for telecommunication services

    K Matsumoto, K Hashimoto

    ELECTRONICS AND COMMUNICATIONS IN JAPAN PART II-ELECTRONICS   86 ( 6 ) 73 - 82  2003年

     概要を見る

    This report concerns a system for monitoring the quality of connections in the gateway switches that interconnect telecommunication networks. Although the time series to be monitored is clearly nonstationary, movements that are almost periodic can be seen if a seven-day interval is set as the period. Therefore, this system introduces a new technique, which is called "partition model optimization," for using the Akaike information criterion (AIC) to determine appropriate groups of local stationary models from a quasi-periodic time series. Also, to perform quality management in real time, a high-speed decision technique called the sequential probability ratio test (S) is introduced. The effectiveness of the partition model optimization technique was systematically investigated in advance by using actual traffic data. Not only was decision parameter maintenance unnecessary, but deterioration could also be detected more accurately than with the conventional system. (C) 2003 Wiley Periodicals, Inc. Electron Comm Jpn Pt 2, 86(6): 73-82, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjb.10157.

    DOI

  • AI application of the Internet - Backgrounds and issues

    K. Yoshida, K. Hashimoto

    Proceedings - 2003 Symposium on Applications and the Internet Workshops, SAINT 2003     273 - 275  2003年

     概要を見る

    The wide spread of the Internet and its evolution as a new social infrastructure increase the importance of applications which best use its potential. The intelligent functions which can be realized with computer technology are indispensable to best benefit from the Internet. We overview the current situation together with issues which we have to solve to realize the new infrastructure of networked society.

    DOI

  • Deterioration detection system using local stationary binomial models for telecommunication services

    K Matsumoto, K Hashimoto

    ELECTRONICS AND COMMUNICATIONS IN JAPAN PART II-ELECTRONICS   86 ( 6 ) 73 - 82  2003年

     概要を見る

    This report concerns a system for monitoring the quality of connections in the gateway switches that interconnect telecommunication networks. Although the time series to be monitored is clearly nonstationary, movements that are almost periodic can be seen if a seven-day interval is set as the period. Therefore, this system introduces a new technique, which is called "partition model optimization," for using the Akaike information criterion (AIC) to determine appropriate groups of local stationary models from a quasi-periodic time series. Also, to perform quality management in real time, a high-speed decision technique called the sequential probability ratio test (S) is introduced. The effectiveness of the partition model optimization technique was systematically investigated in advance by using actual traffic data. Not only was decision parameter maintenance unnecessary, but deterioration could also be detected more accurately than with the conventional system. (C) 2003 Wiley Periodicals, Inc. Electron Comm Jpn Pt 2, 86(6): 73-82, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjb.10157.

    DOI

  • A New Diagnostic Method Using Probabilistic Temporal Fault Models

    Kazuo Hashimoto, Kazunori Matsumoto, Norio Shiratori

    IEICE Trans. On Information & Systems   E85-D ( 3 ) 444 - 454  2002年

  • 協調フィルタリングにおける評価値予測アルゴリズムを応用した検索式拡張方式

    帆足啓一郎, 松本一則, 井ノ上直己, 橋本和夫

    報処理学会論文誌   43 ( 4 )  2002年

  • Feasibility Evaluation of a Bibliographical Information Dissemination System

    Keiichiro Hoashi, Naomi Inoue, Kazuo Hashimoto, Atsushi Ito, Takeo Tatsumi, Joji Maeno, Noriaki Kusumoto, Yasunari Harada

    ITHET 2002; International Conference on Information Technology Based Higher Education and Training    2002年

  • A New Diagnostic Method Using Probabilistic Temporal Fault Models

    Kazuo Hashimoto, Kazunori Matsumoto, Norio Shiratori

    IEICE Trans. On Information & Systems   E85-D ( 3 ) 444 - 454  2002年

  • 協調フィルタリングにおける評価値予測アルゴリズムを応用した検索式拡張方式

    帆足啓一郎, 松本一則, 井ノ上直己, 橋本和夫

    報処理学会論文誌   43 ( 4 )  2002年

  • Feasibility Evaluation of a Bibliographical Information Dissemination System

    Keiichiro Hoashi, Naomi Inoue, Kazuo Hashimoto, Atsushi Ito, Takeo Tatsumi, Joji Maeno, Noriaki Kusumoto, Yasunari Harada

    ITHET 2002; International Conference on Information Technology Based Higher Education and Training    2002年

  • A method for supporting document selection in cross-language information retrieval and its evaluation

    M Suzuki, N Inoue, K Hashimoto

    COMPUTERS AND THE HUMANITIES   35 ( 4 ) 421 - 438  2001年11月

     概要を見る

    It is important to give useful clues for selecting desired content from a number of retrieval results obtained (usually) from a vague search request. Compared with monolingual retrieval, such a support framework is inevitable and much more significant for filtering given translingual retrieval results. This paper describes an attempt to provide appropriate translation of major keywords in each document in a cross-language information retrieval (CLIR) result, as a browsing support for users. Our idea of determining appropriate translation of major keywords is based on word co-occurrence distribution in the translation target language, considering the actual situation of WWW content where it is difficult to obtain aligned parallel (multilingual) corpora. The proposed method provides higher quality of keyword translation to yield a more effective support in identifying the target documents in the retrieval result. We report the advantage of this browsing support technique through evaluation experiments including comparison with conditions of referring to a translated document summary, and discuss related issues to be examined towards more effective cross-language information extraction.

  • A method for supporting document selection in cross-language information retrieval and its evaluation

    M Suzuki, N Inoue, K Hashimoto

    COMPUTERS AND THE HUMANITIES   35 ( 4 ) 421 - 438  2001年11月

     概要を見る

    It is important to give useful clues for selecting desired content from a number of retrieval results obtained (usually) from a vague search request. Compared with monolingual retrieval, such a support framework is inevitable and much more significant for filtering given translingual retrieval results. This paper describes an attempt to provide appropriate translation of major keywords in each document in a cross-language information retrieval (CLIR) result, as a browsing support for users. Our idea of determining appropriate translation of major keywords is based on word co-occurrence distribution in the translation target language, considering the actual situation of WWW content where it is difficult to obtain aligned parallel (multilingual) corpora. The proposed method provides higher quality of keyword translation to yield a more effective support in identifying the target documents in the retrieval result. We report the advantage of this browsing support technique through evaluation experiments including comparison with conditions of referring to a translated document summary, and discuss related issues to be examined towards more effective cross-language information extraction.

  • 所定常な2項分布モデルを組み合わせた通信トラヒック監視システム

    松本一則, 橋本和夫

    電子情報通信学会論文誌   J84-D1 ( 6 ) 800 - 808  2001年

  • 非適合プロファイルを利用した文書フィルタリング手法

    帆足啓一郎, 松本一則, 井ノ上直己, 橋本和夫

    情報処理学会論文誌   42 ( 3 ) 507 - 517  2001年

  • SDI Application in Education and Research Support: Restrictive Information Sharing of Bibliographical Resources

    Keiichiro Hoashi, Kazuo Hashimoto, Atsushi Ito, Takeo Tatsumi, Noriaki Kusumoto, Yasunari Harada

    Proceedings of ITHET01; International Conference on Information Technology Based Higher Education and Training     484 - 489  2001年

  • Study on caching, mirroring, and pre-fetch methods for educational internet

    M. Suzuki, H. Yokoyama, T. Mizuike, S. Muramatsu, K. Matsumoto, K. Hashimoto

    Proceedings - 2001 Symposium on Applications and the Internet Workshops, SAINT 2001     45 - 50  2001年

     概要を見る

    When the Internet is used for school education, students in a classroom access the WWW under the supervision of their teacher. In this situation, many request packets for WWW objects may flood the Internet, triggered by the instructions of the teacher, and may cause heavy congestion in access lines or servers. To avoid traffic congestion, caching and mirroring techniques will be required. In this paper, we study caching and mirroring with pre-fetch methods suitable for the educational use of the Internet.

    DOI

  • 文書自動分類手法を用いた有害情報フィルタリングソフトの開発

    井ノ上直己, 帆足啓一郎, 橋本和夫

    電子情報通信学会論文誌   J84-DII ( 6 ) 1158 - 1166  2001年

  • A Probabilistic Method for Network Fault Diagnosis

    Kazuo Hashimoto, Kazunori Matsumoto

    Proceedings of the SSGRR 2001, Int. Conf. On Advances in Infrastructure for Electronic Business, Science and Education on the Internet    2001年

  • 誤認識訂正のための繰返し音声検出手法

    井ノ上直己, 今井裕志, 橋本和夫, 米山正秀

    電子情報通信学会論文誌   J84-DII ( 9 ) 1950 - 1959  2001年

  • Query Expansion Based on Predictive Algorithms for Collaborative Filtering

    Keiichiro Hoashi, Kazunori Matsumoto, Naomi Inoue, Kazuo Hashimoto

    SIGIR 2001: Proceedings of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval     414 - 415  2001年

  • 所定常な2項分布モデルを組み合わせた通信トラヒック監視システム

    松本一則, 橋本和夫

    電子情報通信学会論文誌   J84-D1 ( 6 ) 800 - 808  2001年

  • 非適合プロファイルを利用した文書フィルタリング手法

    帆足啓一郎, 松本一則, 井ノ上直己, 橋本和夫

    情報処理学会論文誌   42 ( 3 ) 507 - 517  2001年

  • SDI Application in Education and Research Support: Restrictive Information Sharing of Bibliographical Resources

    Keiichiro Hoashi, Kazuo Hashimoto, Atsushi Ito, Takeo Tatsumi, Noriaki Kusumoto, Yasunari Harada

    Proceedings of ITHET01; International Conference on Information Technology Based Higher Education and Training     484 - 489  2001年

  • Study on caching, mirroring, and pre-fetch methods for educational internet

    M. Suzuki, H. Yokoyama, T. Mizuike, S. Muramatsu, K. Matsumoto, K. Hashimoto

    Proceedings - 2001 Symposium on Applications and the Internet Workshops, SAINT 2001     45 - 50  2001年

     概要を見る

    When the Internet is used for school education, students in a classroom access the WWW under the supervision of their teacher. In this situation, many request packets for WWW objects may flood the Internet, triggered by the instructions of the teacher, and may cause heavy congestion in access lines or servers. To avoid traffic congestion, caching and mirroring techniques will be required. In this paper, we study caching and mirroring with pre-fetch methods suitable for the educational use of the Internet.

    DOI

  • 文書自動分類手法を用いた有害情報フィルタリングソフトの開発

    井ノ上直己, 帆足啓一郎, 橋本和夫

    電子情報通信学会論文誌   J84-DII ( 6 ) 1158 - 1166  2001年

  • A Probabilistic Method for Network Fault Diagnosis

    Kazuo Hashimoto, Kazunori Matsumoto

    Proceedings of the SSGRR 2001, Int. Conf. On Advances in Infrastructure for Electronic Business, Science and Education on the Internet    2001年

  • 誤認識訂正のための繰返し音声検出手法

    井ノ上直己, 今井裕志, 橋本和夫, 米山正秀

    電子情報通信学会論文誌   J84-DII ( 9 ) 1950 - 1959  2001年

  • Query Expansion Based on Predictive Algorithms for Collaborative Filtering

    Keiichiro Hoashi, Kazunori Matsumoto, Naomi Inoue, Kazuo Hashimoto

    SIGIR 2001: Proceedings of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval     414 - 415  2001年

  • 確率的時間論理に基づくフォールトモデルを用いた診断方法

    橋本和夫, 松本一則, 白鳥則郎

    電子情報通信学会論文誌   83-D1 ( 1 ) 215 - 224  2000年

  • Document filtering method using non-relevant information profile

    Keiichiro Hoashi, Kazunori Matsumoto, Naomi Inoue, Kazuo Hashimoto

    SIGIR 2000: Proceedings of the 23rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval     176 - 183  2000年

  • Probabilistic Modeling of Alarm Observation Delay in Network Diagnosis

    Kazuo Hashimoto, Kazunori Matsumoto, Norio Shiratori

    PRICAI 2000, Topics in Artificial Intelligence, 6th Pacific Rim International Conference on Artificial Intelligence     734 - 744  2000年

  • 確率的時間論理に基づくフォールトモデルを用いた診断方法

    橋本和夫, 松本一則, 白鳥則郎

    電子情報通信学会論文誌   83-D1 ( 1 ) 215 - 224  2000年

  • Document filtering method using non-relevant information profile

    Keiichiro Hoashi, Kazunori Matsumoto, Naomi Inoue, Kazuo Hashimoto

    SIGIR 2000: Proceedings of the 23rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval     176 - 183  2000年

  • Probabilistic Modeling of Alarm Observation Delay in Network Diagnosis

    Kazuo Hashimoto, Kazunori Matsumoto, Norio Shiratori

    PRICAI 2000, Topics in Artificial Intelligence, 6th Pacific Rim International Conference on Artificial Intelligence     734 - 744  2000年

▼全件表示

共同研究・競争的資金等の研究課題

  • 情報共有のための基礎研究

    その他の研究制度

    研究期間:

    2006年
    -
    2011年
     

  • スマートなWebアプリケーション

    高度通信・放送研究開発に係る研究開発委託

    研究期間:

    2006年
    -
    2011年
     

  • プライバシーを考慮する情報共有方式

    高度通信・放送研究開発に係る研究開発委託

    研究期間:

    2006年
    -
    2011年
     

  • Basic research for information sharing

    The Other Research Programs

    研究期間:

    2006年
    -
    2011年
     

  • Smart Web Applications

    0023 (Japanese Only)

    研究期間:

    2006年
    -
    2011年
     

  • privacy preserving information sharing

    0023 (Japanese Only)

    研究期間:

    2006年
    -
    2011年
     

▼全件表示

講演・口頭発表等

  • Experiencing Tohoku Earthquake ’11 -Social damages and the fragility of information infrastructure

    IEEE P2P’11  

    発表年月: 2011年

  • Experiencing Tohoku Earthquake ’11 -Social damages and the fragility of information infrastructure

    IEEE P2P’11  

    発表年月: 2011年