Akiko Manada
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Akiko Manada has a total of 45 co-authors. Here are the top co-authors by number of shared publications:
- Hiroyoshi Morita
Graduate School of Information Systems, The University of Electro-Communications, Tokyo, Japan
3 shared publications - Hiroyoshi Morita
Dept. of Computer and Network Engineering, Graduate School of Informatics and Engineering, The University of Electro-Communications
2 shared publications - Kenta Mikawa
Department of Information Systems, Tokyo City University
2 shared publications - Manabu Kobayashi
Center of Data Science, Waseda University
2 shared publications - Tomoyuki Sasaki
Tokyo City University
2 shared publications Adel Ghazel
1 shared publication
Latest Publications
- 1 January 2026
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in Nonlinear Theory and Its Applications, IEICE
- Vol. 17 (3) , 854-874
Latent structure analysis for relational data with attribute information to multiple domains
- 1 January 2026
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in Nonlinear Theory and Its Applications, IEICE
- Vol. 17 (3) , 854-874
Latent structure analysis for relational data with attribute information to multiple domains
- Open Access
- 1 January 2024
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in Nonlinear Theory and Its Applications, IEICE
- Vol. 15 (2) , 335-353
A study on latent structural models for binary relational data with attribute information
This study focuses on relational data obtained through object relations. Traditional analysis of relational data often ignores attribute information. Therefore, Mikawa et al. proposed a method to estimate the latent structure of continuous relational data using a generative model and parameter estimation. However, real-world relational data can be discrete, and therefore, we propose a new model for binary relational data using a generative model based on the Bernoulli distribution and the Monte Carlo Expectation-Maximization (EM) algorithm for parameter estimation. We also clarify the effectiveness of the proposed model through simulation experiments using artificial data and real data.
- 1 January 2024
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in Nonlinear Theory and Its Applications, IEICE
- Vol. 15 (2) , 335-353
Open AccessA study on latent structural models for binary relational data with attribute information
This study focuses on relational data obtained through object relations. Traditional analysis of relational data often ignores attribute information. Therefore, Mikawa et al. proposed a method to estimate the latent structure of continuous relational data using a generative model and parameter estimation. However, real-world relational data can be discrete, and therefore, we propose a new model for binary relational data using a generative model based on the Bernoulli distribution and the Monte Carlo Expectation-Maximization (EM) algorithm for parameter estimation. We also clarify the effectiveness of the proposed model through simulation experiments using artificial data and real data.
- Open Access
- 9 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 25 (7) , 2440
Corrections to “A Grouping Based on Local Girths for the Group Shuffled Belief Propagation Decoding”
In the above letter [1] , the name of the author Ryuichi Tatsukawa was incorrectly provided as Ryuichi Tatasukawa. The author’s name should appear as Ryuichi Tatsukawa.
- 9 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 25 (7) , 2440
Open AccessCorrections to “A Grouping Based on Local Girths for the Group Shuffled Belief Propagation Decoding”
In the above letter [1] , the name of the author Ryuichi Tatsukawa was incorrectly provided as Ryuichi Tatasukawa. The author’s name should appear as Ryuichi Tatsukawa.
- 4 March 2020
- Published by Springer Nature
- p. 255-263
Analysis of Walking Body Using Kinect2 and Application of Integer Code to WBAN
- 4 March 2020
- Published by Springer Nature
- p. 255-263
Analysis of Walking Body Using Kinect2 and Application of Integer Code to WBAN
- Open Access
- 12 January 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 6 (3) , 326-335
Graph Theoretical Analysis on Distributed Line Graphs for Peer-to-Peer Networks
Distributed line graphs were introduced by Zhang and Liu as an overlay for Peer-to-Peer networks. Distributed line graphs have some useful properties as a network topology, such as out-regular and small diameter, where the former implies that each user possesses a constant size of routing table and the latter means that a reasonably small number of hops is necessary to reach a target user. In this paper, we newly introduce distributed line sharp graphs, as an extension of distributed line graphs, so as to further expand the possibility of finding better network topologies and theoretically analyze their properties. The analysis on the distributed line sharp graphs is based on the analysis on distributed line graphs presented by Zhang and Liu. In particular, we further examine the diameter and the in-degree of a vertex, and improve the previous results together with detailed proofs. We also show that the diameter of a certain distributed line sharp graph is equal to the diameter of its corresponding distributed line graph.
- 12 January 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 6 (3) , 326-335
Open AccessGraph Theoretical Analysis on Distributed Line Graphs for Peer-to-Peer Networks
Distributed line graphs were introduced by Zhang and Liu as an overlay for Peer-to-Peer networks. Distributed line graphs have some useful properties as a network topology, such as out-regular and small diameter, where the former implies that each user possesses a constant size of routing table and the latter means that a reasonably small number of hops is necessary to reach a target user. In this paper, we newly introduce distributed line sharp graphs, as an extension of distributed line graphs, so as to further expand the possibility of finding better network topologies and theoretically analyze their properties. The analysis on the distributed line sharp graphs is based on the analysis on distributed line graphs presented by Zhang and Liu. In particular, we further examine the diameter and the in-degree of a vertex, and improve the previous results together with detailed proofs. We also show that the diameter of a certain distributed line sharp graph is equal to the diameter of its corresponding distributed line graph.
- Open Access
Proceedings of Workshop AEW10: Concepts in Information Theory and Communications
The 10th Asia-Europe workshop in "Concepts in Information Theory and Communications" AEW10 was held in Boppard, Germany on June 21-23, 2017. It is based on a longstanding cooperation between Asian and European scientists. The first workshop was held in Eindhoven, the Netherlands in 1989. The idea of the workshop is threefold: 1) to improve the communication between the scientist in the different parts of the world; 2) to exchange knowledge and ideas; and 3) to pay a tribute to a well respected and special scientist.
Open AccessProceedings of Workshop AEW10: Concepts in Information Theory and Communications
The 10th Asia-Europe workshop in "Concepts in Information Theory and Communications" AEW10 was held in Boppard, Germany on June 21-23, 2017. It is based on a longstanding cooperation between Asian and European scientists. The first workshop was held in Eindhoven, the Netherlands in 1989. The idea of the workshop is threefold: 1) to improve the communication between the scientist in the different parts of the world; 2) to exchange knowledge and ideas; and 3) to pay a tribute to a well respected and special scientist.
- 20 September 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 20 (11) , 2133-2136
A Grouping Based on Local Girths for the Group Shuffled Belief Propagation Decoding
Low-density parity-check codes have been known to exhibit good error correcting performance by using with the belief propagation (BP) decoding. The group shuffled BP decoding, which is a modification of the BP decoding, can exhibit a better performance than BP decoding by suitably grouping variable nodes in a Tanner graph. In this letter, we propose a new grouping of variable nodes based on local girths and evaluate its performance.
- 20 September 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 20 (11) , 2133-2136
A Grouping Based on Local Girths for the Group Shuffled Belief Propagation Decoding
Low-density parity-check codes have been known to exhibit good error correcting performance by using with the belief propagation (BP) decoding. The group shuffled BP decoding, which is a modification of the BP decoding, can exhibit a better performance than BP decoding by suitably grouping variable nodes in a Tanner graph. In this letter, we propose a new grouping of variable nodes based on local girths and evaluate its performance.
- Open Access
A Graph Theoretical Analysis of Low-Power Coding Schemes for One-Hop Networks
Coding schemes with extremely low computational complexity are required for particular applications, such as wireless body area networks, in which case both very high data accuracy and very low power-consumption are required features. In this paper, coding schemes arising from incidence matrices of graphs are proposed. An analysis of the resilience of such codes to erasures is given using graph theoretical arguments; decodability of a graph is characterized in terms of the rank of its incidence matrix. Bounds are given on the number of decodable subgraphs of a graph and the number of edges that must be deleted in order to arrive at an undecodable subgraph. Algorithms to construct codes that are optimal with respect to these bounds are presented.
Open AccessA Graph Theoretical Analysis of Low-Power Coding Schemes for One-Hop Networks
Coding schemes with extremely low computational complexity are required for particular applications, such as wireless body area networks, in which case both very high data accuracy and very low power-consumption are required features. In this paper, coding schemes arising from incidence matrices of graphs are proposed. An analysis of the resilience of such codes to erasures is given using graph theoretical arguments; decodability of a graph is characterized in terms of the rank of its incidence matrix. Bounds are given on the number of decodable subgraphs of a graph and the number of edges that must be deleted in order to arrive at an undecodable subgraph. Algorithms to construct codes that are optimal with respect to these bounds are presented.
- 1 January 2013
- Published by European Alliance for Innovation n.o.
An XOR Encoding for Wireless Body Area Networks
- 1 January 2013
- Published by European Alliance for Innovation n.o.
An XOR Encoding for Wireless Body Area Networks