| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| NLP | 2024-05-10 10:30 |
Kagawa | Kagawa Prefecture Social Welfare Center | Federated Learning Algorithms based on Decentralized Spanning Tree Generation and Step-by-Step Consensus Yuki Mori, Tatsuya Kayatani, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.)  NLP2024-11 |
A large amount of high-quality data is necessary to improve the learning accuracy of neural networks. However, there are... [more] | NLP2024-11 pp.52-57 |
| NLP, CAS | 2023-10-07 13:20 |
Gifu | Work plaza Gifu | Proposal and evaluation of a distributed lasso algorithm based on alternating direction multiplier method Naoki Toda, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) CAS2023-55 NLP2023-54 |
Lasso is widely known as a sparse estimation method for regression coefficients in linear regression models, and the Alt... [more] | CAS2023-55 NLP2023-54 pp.111-116 |
| NLP, MSS | 2023-03-17 14:30 |
Nagasaki | (Primary: On-site, Secondary: Online) |
Global Convergence Analysis of Distributed HALS Algorithm for Nonnegative Matrix Factorization Keiju Hayashi, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) MSS2022-104 NLP2022-149 |
As a fast computational method for Nonnegative Matrix Factorization (NMF), the Hierarchical Alternating Least Squares ... [more] |
MSS2022-104 NLP2022-149 pp.198-203 |
| RCC, ITS, WBS | 2022-12-14 14:45 |
Shiga | Ritsumeikan Univ. BKC (Primary: On-site, Secondary: Online) |
Characterization of consensus value in consensus control driven by value exchange Daiki Sugiyama (Nagoya Univ.), Shun-ichi Azuma (Kyoto Univ.), Ryo Ariizumi, Toru Asai (Nagoya Univ.) WBS2022-50 ITS2022-26 RCC2022-50 |
This paper deals with consensus control in multi-agent systems driven by value exchange. In this system, agents own toke... [more] | WBS2022-50 ITS2022-26 RCC2022-50 pp.89-92 |
| IT, ISEC, RCC, WBS | 2022-03-10 14:40 |
Online | Online | Optimum Clustering Method for Data Driven Consensus Problem considering Network Centrality Shoya Ogawa, Koji Ishii (Kagawa Univ) IT2021-109 ISEC2021-74 WBS2021-77 RCC2021-84 |
In consensus problems in complex networks, the convergence performance deeply depends on the weighting factors. IKishida... [more] | IT2021-109 ISEC2021-74 WBS2021-77 RCC2021-84 pp.155-160 |
| RCS, SR, NS, SeMI, RCC (Joint) |
2021-07-14 10:55 |
Online | Online | Relaxation of Network Restriction for Deep Learning Based Consensus Problem with Eigenvector Centrality Shoya Ogawa, Koji Ishii (Kagawa Univ.) RCC2021-23 |
he convergence performance of consensus problems depends on the applied weighting factors into individual edges. Unfortu... [more] | RCC2021-23 pp.7-12 |
| NC, IBISML, IPSJ-BIO, IPSJ-MPS [detail] | 2021-06-28 13:50 |
Online | Online | Simplification of Average Consensus Algorithm in Distributed HALS Algorithm for NMF Keiju Hayashi, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) NC2021-3 IBISML2021-3 |
Nonnegative Matrix Factorization (NMF) is the process of approximating a given nonnegative matrix by the product of two ... [more] | NC2021-3 IBISML2021-3 pp.15-22 |
| ITS, WBS, RCC | 2020-12-14 10:45 |
Online | Online | A Study on Relaxation of Network Restriction in Deep-Unfolding aided Consensus Shoya Ogawa, Ishii Koji (Kagawa Univ.) WBS2020-11 ITS2020-7 RCC2020-14 |
In the consensus problem with a complex network, the convergence performance deeply depends on the given parameters, i.e... [more] | WBS2020-11 ITS2020-7 RCC2020-14 pp.19-24 |
| MSS, NLP (Joint) |
2018-03-14 10:45 |
Osaka | Consensus Speed of Multi-agent Systems Modeled by Scale-free Graph Akinori Sakaguchi, Toshimitsu Ushio (Osaka Univ.) NLP2017-109 |
In a pinning consensus problem of multi-agent systems, a consensus speed of a static pinning control is generally bounde... [more] | NLP2017-109 pp.43-46 |
|
| ITS, WBS, RCC | 2017-12-15 11:45 |
Okinawa | Tiruru/Okinawa Jichikaikan | Predictive Pinning Control for Consensus of Multi-Agent Systems Koichi Kobayashi (Hokkaido Univ.) WBS2017-72 ITS2017-49 RCC2017-88 |
In this paper, based on the policy of model predictive control (MPC), a new method of predictive pinning control is prop... [more] | WBS2017-72 ITS2017-49 RCC2017-88 pp.209-213 |
| SWIM | 2017-05-19 16:45 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Proposal of Business Evaluation Method for Value Chain Creation through Cross-sectoral Collaboration Satoru Hori, Yoshiyasu Takahashi, Kaori Nakagawa, Ryota Mibe (Hitachi) SWIM2017-6 |
As society has become more complex, social problems that can not be solved by a single company, such as increase of medi... [more] | SWIM2017-6 pp.29-33 |
| NLP | 2016-09-15 10:25 |
Hyogo | Konan Univ. | A New Decentralized Discrete-Time Algorithm for Estimating Algebraic Connectivity of Multiagent Networks Kento Endo, Norikazu Takahashi (Okayama Univ.) NLP2016-55 |
The algebraic connectivity, which is defined as the second smallest eigenvalue of the Laplacian matrix, is an index repr... [more] | NLP2016-55 pp.57-62 |
| NLP, CCS | 2015-06-12 09:00 |
Tokyo | Waseda Univerisity | Proposal of a Truly Distributed Algorithm for Estimating Algebraic Connectivity of Multi-Agent Network Kazuma Yamane, Norikazu Takahashi (Okayama Univ.) NLP2015-54 CCS2015-16 |
The algebraic connectivity, which is defined by the second smallest eigenvalue of the Laplacian matrix, is an index repr... [more] | NLP2015-54 CCS2015-16 pp.91-96 |
| CAS, MSS, IPSJ-AL [detail] | 2014-11-20 16:30 |
Okinawa | Nobumoto Ohama Memorial Hall (Ishigaki island) | Analysis of Average Consensus Dynamics for Faster Convergence Kenji Nomura, Naoki Hayashi, Shigemasa Takai (Osaka Univ.) CAS2014-97 MSS2014-61 |
In this paper, we consider convergence speed of consensus problems in multi-agent systems．The convergence speed of conse... [more] | CAS2014-97 MSS2014-61 pp.81-84 |
| CAS | 2011-01-26 10:30 |
Kumamoto | Kumamoto University | Undirected Graphs Maximizing the Second Smallest Eigenvalue of the Graph Laplacian
-- Case where the Average Degree is Less than or Equal to 2 -- Kohnosuke Ogiwara, Norikazu Takahashi (Kyushu Univ.) CAS2010-98 |
We consider the problem of finding undirected graphs maximizing the second smallest eigenvalue of the graph Laplacian.... [more] |
CAS2010-98 pp.75-79 |
| COMP | 2007-03-05 15:55 |
Tokyo | The University of Electro-Communications | A Consensus Algorithm Tolerating Adversarial Crash and Probabilistic Omission Taisuke Izumi, Koichi Wada (Nagoya Inst. of Tech.) |
The (uniform) consensus, which is one of fundamental and important problems for designing fault-tolerant distributed sy... [more] |
COMP2006-58 pp.59-66 |
[Return to Top Page]