詳細

守屋　宣 （モリヤ　セン）

  • 情報学部 情報学科　准教授
Last Updated :2024/04/23

コミュニケーション情報 byコメンテータガイド

  • コメント

    中規模以上のコンピュータシステムで故障発生時のためのバックアップ・復旧手法や、コンピュータ処理の衝突を回避するための排他制御を故障発生時にもスムーズに行う手法を研究しています。

研究者情報

学位

  • 博士（工学）（奈良先端科学技術大学院大学）
  • 修士（工学）（奈良先端科学技術大学院大学）

ホームページURL

J-Global ID

研究キーワード

  • 符号理論   耐故障性   分散システム   アルゴリズム   

現在の研究分野（キーワード）

    中規模以上のコンピュータシステムで故障発生時のためのバックアップ・復旧手法や、コンピュータ処理の衝突を回避するための排他制御を故障発生時にもスムーズに行う手法を研究しています。

研究分野

  • 情報通信 / 情報学基礎論

経歴

  • 2022年04月 - 現在  近畿大学情報学部 情報学科准教授
  • 2021年01月 - 現在  近畿大学情報学研究所
  • 2002年04月 - 2022年03月  近畿大学理工学部 情報学科
  • 2000年04月 - 2002年03月  NTTコミュニケーション科学基礎研究所

学歴

  •         - 2000年   奈良先端科学技術大学院大学   情報科学研究科
  •         - 1995年   大阪大学   理学部   数学科

所属学協会

  • 情報処理学会   電子情報通信学会   

研究活動情報

論文

  • MORIYA Sen; SASANO Hiroshi
    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E106.A 3 375 - 381 2023年03月 [査読有り]
     
    In this study, we consider techniques for searching high-rate convolutional code (CC) encoders using dual code encoders. A low-rate (R = 1/n) CC is a dual code to a high-rate (R = (n - 1)/n) CC. According to our past studies, if a CC encoder has a high performance, a dual code encoder to the CC also tends to have a good performance. However, it is not guaranteed to have the highest performance. We consider a method to obtain a high-rate CC encoder with a high performance using good dual code encoders, namely, high-performance low-rate CC encoders. We also present some CC encoders obtained by searches using our method.
  • 東 瞭斗; 守屋 宣
    電子情報通信学会論文誌D J103-D 1 1 - 12 2020年01月 [査読有り]
  • Sen Moriya; Kana Kikuchi; Hiroshi Sasano
    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E100A 12 2607 - 2614 2017年12月 [査読有り]
     
    In this study, we consider techniques to search for highrate punctured convolutional code (PCC) encoders by rearranging row vectors of identical-encoder generator matrices. One well-known method to obtain a good PCC encoder is to perform an exhaustive search of all candidates. However, this approach is time-intensive. An exhaustive search with a rate RG = 1/2 original encoder requires a relatively short time, whereas that with an RG = 1/3 or lower original encoder takes significantly longer. The encoders with lower-rate original encoders are expected to create better PCC encoders. Thus, this paper proposes a method that uses exhaustive search results with rate RG = 1/2 original encoders, and rearranges row vectors of identical-encoder generator matrices to create PCCs with a lower rate original code. Further, we provide PCC encoders obtained by searches that utilize our method.
  • Sen Moriya; Kana Kikuchi; Hiroshi Sasano
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES E99A 12 2162 - 2169 2016年12月 [査読有り]
     
    In this study, we consider techniques to search for highrate punctured convolutional code (PCC) encoders using dual code encoders. A low-rate R = 1/n convolutional code (CC) has a dual code that is identical to a PCC with rate R = (n - 1)/n. This implies that a rate R = 1/n convolutional code encoder can assist in searches for high-rate PCC encoders. On the other hand, we can derive a rate R = 1/n CC encoder from good PCC encoders with rate R = (n = 1)/n using dual code encoders. This paper proposes a method to obtain improved high-rate PCC encoders, using exhaustive search results of PCC encoders with rate R = 1/3 original encoders, and dual code encoders. We also show some PCC encoders obtained by searches that utilized our method.
  • Hiroshi Sasano; Kana Kikuchi; Sen Moriya
    PROCEEDINGS OF 2016 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA 2016) 498 - 501 2016年 [査読有り]
     
    There exists an identical high rate ordinary convolutional code with a punctured convolutional code. We show a method for obtaining good rate R = (n - 1) / n punctured convolutional codes through the identical codes with the best punctured convolutional codes of rate (n - 1) / n obtained by exhaustive searches for rate 1/2 original codes and puncturing matrices, and the method can find out punctured convolutional codes superior to the best code obtained by exhaustive searches for rate 1/3 original codes and puncturing matrices. For generating matrices of identical codes, we construct new identical codes with punctured convolutional codes by combining row vectors of each individual matrix. We present good punctured convolutional codes with rate R = (n - 1) / n,n = 6, ... , 13 by computer searches through those identical codes.
  • Sen Moriya; Kana Kikuchi; Hiroshi Sasano
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES E98A 7 1579 - 1583 2015年07月 [査読有り]
     
    This paper considers a method for constructing good highrate punctured convolutional codes through dual codes. A low-rate R = 1/n convolutional code has a dual code identical to a punctured convolutional code with rate R = (n - 1)/n. This implies that a low-rate R = 1/n convolutional code encoder can help the search of punctured convolutional code encoders. This paper provides the procedures that obtain all the useful dual code encoders to a given CC with rate R = 1/n easily, and the best PCC encoder with rate R = (n - 1)/n among the encoders we derive from all the obtained dual code encoders. This paper also shows an example of the PCC the procedures obtain from some CC.
  • Kana Kikuchi; Sen Moriya; Hiroshi Sasano
    2014 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA) 100 - 104 2014年 [査読有り]
     
    Punctured convolutional codes are error-correcting codes that can be used to achieve reliable data transfer in digital communication systems. This paper considers a method to search good high-rate punctured convolutional code encoders using dual codes, which are often utilized to evaluate block codes. A low-rate R = 1/n convolutional code has a dual code identical to a punctured convolutional code with rate R = (n - 1)/n. This implies that a low-rate R = 1/n convolutional code can help the search of punctured convolutional code encoders. In simple terms, this means that the strategy involves searching all of many candidate dual code encoders. This paper shows it is not difficult to list all the useful dual code encoders from a given convolutional code with rate R = 1/n, and we give some examples of the best punctured convolutional code encoder with rate R = (n 1)/n obtained through dual code.
  • Sen Moriya; Hiroshi Sasano
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES E96A 12 2374 - 2381 2013年12月 [査読有り]
     
    We consider two methods for constructing high rate punctured convolutional codes. First, we present the best high rate R = (n-1)/n punctured convolutional codes, for n = 5, 6, ..., 16, which are obtained by exhaustive searches. To obtain the best code, we use a regular convolutional code whose weight spectrum is equivalent to that of each punctured convolutional code. We search these equivalent codes for the best one. Next, we present a method that searches for good punctured convolutional codes by partial searches. This method searches the codes that are derived from rate 1/2 original codes obtained in the first method. By this method, we obtain some good punctured convolutional codes relatively faster than the case in which we search for the best codes.
  • 双対符号を用いた高符号化率パンクチャド畳込み符号の構成
    菊地加奈; 笹野 博; 守屋 宣
    電子情報通信学会論文誌(A) J96-A 10 726 - 730 2013年10月 [査読有り]
  • 高符号化率パンクチャド畳込み符号の一構成法
    笹野 博; 守屋 宣
    電子情報通信学会論文誌(A) J96-A 7 502 - 505 2013年07月 [査読有り]
  • Hiroshi Sasano; Sen Moriya
    2012 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA 2012) 662 - 666 2012年 [査読有り]
     
    We consider two methods that construct high rate punctured convolutional codes. First, we present best high rate R = (n - 1)/n punctured convolutional codes, for n = 5, 6, ... , 16, which are found by exhaustive searches. To obtain the best code, we use a regular convolutional code whose weight spectrum is equivalent to that of each punctured convolutional code. We search these regular equivalent codes for the best one. Next, we present a method that searches for good punctured convolutional codes by partial searches. This method searches the codes that are derived from R = 1/2 original codes obtained in the first method. By this method, we obtain some good punctured convolutional codes that have superior performance compared with that of the best codes.
  • Sen Moriya; Tadashi Araragi
    Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi) 88 12 43 - 57 2005年12月 [査読有り]
     
    This paper considers an Internet agent system in which a tremendous number of agents operate, frequently appearing and disappearing, and discusses the fault-tolerant algorithm. Application of the snapshot algorithm to the agent system is considered. The snapshot algorithm is used to view the whole situation (snapshot) of the distributed system. The snapshot algorithm of Chandy and Lamport [2] is considered as a representative snapshot algorithm, in terms of the high efficiency and the simplicity of the procedure. It is not practical, however, to apply their snapshot algorithm to the distributed agent system in which a tremendous number of agents operate. From such a viewpoint, this paper extends the idea of Chandy and Lamport's algorithm and proposes a subsnapshot algorithm, in which the snapshot is taken among the agents who are in the causal relation, through message exchange and agent creation. Then, an efficient rollback algorithm is proposed, which is based on the snapshots taken by the subsnapshot algorithm. In the general rollback algorithm utilizing the snapshot, all agents must roll back. In contrast, in the rollback algorithm proposed in this paper, it suffices that only some agents should roll back. © 2005 Wiley Periodicals, Inc.
  • 守屋 宣; 櫟 粛之
    電子情報通信学会論文誌(D) J86-D 5 301 - 317 一般社団法人電子情報通信学会 2003年05月 [査読有り]
     
    本論文では,莫大な数のエージェント動作し,それらのエージェントが頻繁に生成,消滅するようなインターネットエージェントシステムの耐故障アルゴリズムを考察する.本論文では,エージェントシステムへスナップショットアルゴリズムを適用することを考える.スナップショットアルゴリズムとは,分散システム全体の状況(スナップショット)を求めるアルゴリズムである.特に,Chandyらのスナップショットアルゴリズム[2]は,効率の良さ,手続きの単純さから代表的なスナップショットアルゴリズムになっている.しかし,Chandyらのスナップショットアルゴリズムを莫大な数のエージェントが動作する分散エージェントシステムへ適用することは実用的ではない.そこで,本論文では,Chandyらのアルゴリズムのアイデアを拡張し,メッセージ交換やエージェント生成などを通じて因果関係をもつエージェント間でスナップショットをとるサブスナップショットアルゴリズムを提案する.更に,サブスナップショットアルゴリズムによってとられたスナップショットを利用した効率的なロールバックアルゴリズムを提案する.スナップショットを利用した一般的なロールバックアルゴリズムでは一部のエージェントのみがロールバックすればよい.
  • Dynamic Snapshot Algorithm and Partial Rollback Algorithm for Internet Agents
    Sen Moriya; Tadashi Araragi
    15th International Symposium on Distributed Computing 2001年10月 [査読有り]
  • S Moriya; K Suda; M Inoue; T Masuzawa; H Fujiwara
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS E83D 8 1611 - 1621 2000年08月 [査読有り]
     
    We consider a wait-free linearizable implementation of shared objects on a distributed message-passing system. We assume that the system provides each process with a local cluck that runs: at the same speed as global time and that all message delays are in the range [d - u, d] where d and u. (0 < u less than or equal to d) are constants known to every process. We present four wait-free linearizable implementations of read/write registers on reliable and unreliable broadcast models. We also present two wait-free linearizable implementations of general objects on a reliable broadcast model. The efficacy of an implementation is measured by the worst-case response time for each operation of the implemented object. Response times of our wait-free implementations of read/write registers on a reliable broadcast model is better than a previously known implementation in which wait-freedom is not taken into account.
  • 守屋 宣; 井上美智子; 増澤利光; 藤原秀雄
    電子情報通信学会論文誌(D) J83-D 1 99 - 109 一般社団法人電子情報通信学会 2000年01月 [査読有り]
     
    共有メモリマルチプロセッサシステム, 特に, システム内のすべてのプロセッサが大域パルスを共有するフェーズ内システムにおける故障耐性をもつ時計合せプロトコルを考察する.フェーズ内システムでは, 正常なプロセッサはパルス発生時に同期して動作を行う.フェーズ内システムにおいて, パルス発生時にプロセッサが動作しないような故障を居眠り故障と呼ぶ.居眠り故障の起こるフェーズ内システムにおいて, 同期時間と呼ばれるある特定パルス以上正常に動作し続けているすべてのプロセッサ同士の局所時計の時刻を一致させるプロトコルを無待機時計合せプロトコルと呼ぶ.これまで, フェーズ内システムにおける無待機時計合せプロトコルとして, 同期時間4n~2-3n-1のプロトコルが提案されていた(n:プロセッサ数).本論文では, 同期時間12nの無待機時計合せプロトコルを提案する.また, 無待機時計合せプロトコルの同期時間の下界がn-1であることを証明し, 本論文で提案するプロトコルが同期時間に関してオーダ的に最適であることを示す.
  • Wait-Free Linearizable Distributed Shared Memory
    S. Moriya; K. Suda; M. Inoue; T. Masuzawa; H. Fujiwara
    Proc. of the 11th IASTED International Conference on Parallel and Distributed Computing and Systems 335 - 342 1999年11月 [査読有り]
  • Self-Stabilizing Wait-Free Clock Synchronization with Bounded Space
    Sen Moriya; Michiko Inoue; Toshimitsu Masuzawa; Hideo Fujiwara
    Proc. of the 2nd International Conference on Principles of Distributed Systems 129 - 143 1998年12月 [査読有り]
  • M Inoue; S Moriya; T Masuzawa; H Fujiwara
    DISTRIBUTED ALGORITHMS, PROCEEDINGS 1320 290 - 304 1997年 [査読有り]
     
    We consider wait-free clock synchronization protocols on an in-phase shared-memory multi-processor system. A wait-free clock synchronization protocol guarantees that, for a fixed k, local clocks of processors which have been working consecutively for at least k pulses are synchronized. Such k is called synchronization time. The best previous result with regard to the synchronization time is O(n(2)), where n is the number of processors, In this paper, we present a wait-free synchronization protocol with synchronization time O(n), and also show that this synchronization time is asymptotically optimal.

MISC

産業財産権

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

  • 耐故障分散アルゴリズムに関する研究

委員歴

  • 2011年05月 - 現在   電子情報通信学会   ソサイエティ論文誌編集委員会査読委員
  • 2019年10月 - 2021年05月   電子情報通信学会   和文論文誌Ａ編集委員会和文論文誌編集委員
  • 2017年05月 - 2021年05月   電子情報通信学会   英文論文誌Ａ編集委員会英文論文誌編集委員
  • 2015年05月 - 2021年05月   電子情報通信学会   情報理論研究専門委員会専門委員
  • 2017年06月 - 2020年05月   情報処理学会   論文誌シニア査読委員
  • 2011年06月 - 2017年05月   情報処理学会   論文誌査読委員
  • 2009年05月 - 2011年05月   電子情報通信学会   互選代議員
  • 2007年06月 - 2011年05月   情報処理学会   論文誌JIP,ジャーナル編集委員
  • 2008年04月 - 2010年03月   電子情報通信学会関西支部   会計幹事

その他のリンク

researchmap


Copyright © MEDIA FUSION Co.,Ltd. All rights reserved.