| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| CCS, NLP | 2022-06-09 17:15 |
Osaka | (Primary: On-site, Secondary: Online) |
Visualization of decisions from CNN models trained on OpenStreetMap images labeled based on traffic accident data Kaito Arase, Zhijian Wu, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.)  NLP2022-10 CCS2022-10 |
The authors have recently conducted training of Convolutional Neural Networks (CNNs) on OpenStreetMap images each of whi... [more] | NLP2022-10 CCS2022-10 pp.46-51 |
| CCS, NLP | 2022-06-09 17:40 |
Osaka | (Primary: On-site, Secondary: Online) |
Speeding up an algorithm for searching generalized Moore graphs Taku Hirayama, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) NLP2022-11 CCS2022-11 |
Computer networks in data centers are modeled as undirected regular graphs, and the average shortest path length (ASPL) ... [more] | NLP2022-11 CCS2022-11 pp.52-57 |
| 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 |
| NC, IBISML, IPSJ-BIO, IPSJ-MPS [detail] | 2021-06-28 14:15 |
Online | Online | Modification of Optimization Problem in Randomized NMF and Design of Optimization Method based on HALS Algorithm Takao Masuda, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) NC2021-4 IBISML2021-4 |
Nonnegative matrix factorization (NMF) is the process of decomposing a given nonnegative matrix into two nonnegative fac... [more] | NC2021-4 IBISML2021-4 pp.23-30 |
| NLP, MSS (Joint) |
2021-03-15 13:00 |
Online | Online | Proposal of Novel Distributed Learning Algorithms for Multi-Neural Networks Kazuaki Harada, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) NLP2020-58 |
A method for multiple neural networks (NNs) with the same structure to learn multiple sets of training data collected at... [more] | NLP2020-58 pp.17-22 |
| NLP, MSS (Joint) |
2021-03-15 13:25 |
Online | Online | Graph Structure Optimization Using Genetic Algorithms Hiroki Tajiri, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) NLP2020-59 |
There are many large and complex networks in the real world. These networks are modeled as graphs and analyzed using a v... [more] | NLP2020-59 pp.23-28 |
| MSS, CAS, IPSJ-AL [detail] | 2020-11-25 16:35 |
Online | Online | Generalization of Pseudo-Decentralized Continuous-Time Algorithms for Estimation of Algebraic Connectivity Katsuki Shimada, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) CAS2020-23 MSS2020-15 |
Development of decentralized algorithms for multiple agents in a network to estimate its connectivity is a fundamental a... [more] | CAS2020-23 MSS2020-15 pp.22-27 |
| MSS, CAS, IPSJ-AL [detail] | 2020-11-25 17:00 |
Online | Online | Distributed Algorithms based on Multiplicative Update Rules for Nonnegative Matrix Factorization Yohei Domen, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) CAS2020-24 MSS2020-16 |
Nonnegative matrix factorization (NMF) is a multivariate method that approximates a given nonnegative matrix by the prod... [more] | CAS2020-24 MSS2020-16 pp.28-33 |
| NLP | 2020-05-15 13:00 |
Online | Online | A Genetic Algorithm for Minimizing Average Shortest Path Length of Regular Graphs Reiji Hayashi, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) NLP2020-3 |
For the problem of finding a regular graph with given order and degree that minimizes the average shortest path length, ... [more] | NLP2020-3 pp.11-16 |
| NLP | 2020-05-15 13:25 |
Online | Online | Design of a Distributed Algorithm for Principal Component Analysis based on Power Method and Average Consensus Mutsuki Oura, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) NLP2020-4 |
Principal component analysis is one of the most important methods of multivariate analysis, and has been applied in a wi... [more] | NLP2020-4 pp.17-22 |
| MSS, NLP (Joint) |
2020-03-09 09:50 |
Aichi | (Cancelled but technical report was issued) |
A Distributed Algorithm for Solving Sandberg-Willson Equations Based on Sequential Minimization of Convex Quadratic Functions Masaaki Takeuchi, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) NLP2019-115 |
We propose a new distributed algorithm for multi-agent networks to solve Sandberg-Willson equations, which are well-know... [more] | NLP2019-115 pp.13-18 |
| MSS, NLP (Joint) |
2020-03-09 10:15 |
Aichi | (Cancelled but technical report was issued) |
A projected consensus-based algorithm for minimizing the maximum error of a system of linear equations with nonnegativity constraints Kosuke Kawashima, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) NLP2019-116 |
If a system of linear equations with nonnegativity constraints has a solution then it can be considered as a constrained... [more] | NLP2019-116 pp.19-23 |
| SIS | 2019-12-12 15:45 |
Okayama | Okayama University of Science | [Invited Talk]
Consensus-Based Distributed Algorithms and Applications to Machine Learning Norikazu Takahashi (Okayama Univ.) SIS2019-29 |
Recently, consensus-based distributed optimization methods for multi-agent systems have been vigorously studied in the f... [more] | SIS2019-29 p.35 |
| IT, ISEC, WBS | 2019-03-07 15:30 |
Tokyo | University of Electro-Communications | Analyzing Final Round Key of AES Implemented on Microcomputer using Neural Network Satoshi Kosugi, Sho Joichi, Ken Ikuta, Takuya Kusaka, Yasuyuki Nogami, Norikazu Takahashi (Okayama University) IT2018-86 ISEC2018-92 WBS2018-87 |
A side channel attack is an attack method that enable external key estimation by observing secondary information generat... [more] | IT2018-86 ISEC2018-92 WBS2018-87 pp.71-76 |
| NLP, NC (Joint) |
2019-01-24 15:00 |
Hokkaido | The Centennial Hall, Hokkaido Univ. | A Genetic Algorithm-Based Method for Finding Approximate Solutions to Minimum Steiner Tree Problems Li-Ping Zhang, Norikazu Takahashi (Okayama Univ.), Zong-Xiao Yang (HAUST) NLP2018-121 |
The Euclidean Steiner Tree Problem (ESTP) is a classical combinatorial optimization problem that appears in various fiel... [more] | NLP2018-121 pp.131-136 |
| NLP, NC (Joint) |
2019-01-24 15:20 |
Hokkaido | The Centennial Hall, Hokkaido Univ. | A New Method for Deriving Multiplicative Update Rules for NMF with Error Functions Containing Logarithm Akihiro Koso, Norikazu Takahashi (Okayama Univ.) NLP2018-122 |
Nonnegative Matrix Factorization (NMF) is an operation that decomposes a given nonnegative matrix X into two nonnegative... [more] | NLP2018-122 pp.137-142 |
| CAS, NLP | 2018-10-19 14:45 |
Miyagi | Tohoku Univ. | Convergence of a Pseudo-Decentralized Discrete-Time Algorithm for Computing Algebraic Connectivity
-- Analysis of the Case Where Algebraic Connectivity is Repeated -- Tomohisa Urakami, Norikazu Takahashi (Okayama Univ.) CAS2018-58 NLP2018-93 |
The algebraic connectivity of a network, which is defined as the second smallest eigenvalue of the Laplacian matrix, is ... [more] | CAS2018-58 NLP2018-93 pp.115-120 |
| NLP | 2018-08-08 14:35 |
Kagawa | Saiwai-cho Campus, Kagawa Univ. | Reconstruction of CT images by iterative Least Squares Methods with Nonnegative Constraint Hiromasa Kohno, Yuichi Tanji, Ken'ichi Fujimoto, Hiroyuki Kitajima, Yo Horikawa (Kagawa Univ.), Norikazu Takahashi (Okayama Univ.) NLP2018-57 |
[more] | NLP2018-57 pp.25-29 |
| NLP | 2018-08-09 09:30 |
Kagawa | Saiwai-cho Campus, Kagawa Univ. | Derivation and Experimental Evaluation of a Novel Nonnegative Matrix Factorization Algorithm for Discovering Communities Yoshito Usuzaka, Norikazu Takahashi (Okayama Univ.) NLP2018-64 |
Community discovery is an important technique for a better understanding of the structure of a network. We consider the ... [more] | NLP2018-64 pp.57-62 |
| NLP | 2018-08-09 09:55 |
Kagawa | Saiwai-cho Campus, Kagawa Univ. | A Convergence Condition for the Projected Consensus Algorithm on a Network with a Fixed Topology Kosuke Kawashima, Norikazu Takahashi (Okayama Univ.) NLP2018-65 |
This report studies the problem of making the states of all agents in a network converge to the same point in the inters... [more] | NLP2018-65 pp.63-68 |
[Return to Top Page]