Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
CPSY, DC, IPSJ-ARC [detail] |
2023-06-05 14:40 |
Ehime |
Nigitatsu-Kaikan (Primary: On-site, Secondary: Online) |
CPSY2023-3 DC2023-3 |
[more] |
CPSY2023-3 DC2023-3 pp.8-13 |
NC, MBE (Joint) |
2023-03-13 16:30 |
Tokyo |
The Univ. of Electro-Communications (Primary: On-site, Secondary: Online) |
Emotion estimation by EEG using multidimensional directed coherence and machine learning Haruka Torii, Takamasa Shimada (Tokyo Denki Univ.), Osamu Sakata (Tokyo Univ. of Science), Tadanori Fukami (Yamagata Univ.) MBE2022-60 |
In this study, we investigated a method of emotion estimation using EEG. Four kinds of emotions were induced by presenti... [more] |
MBE2022-60 pp.9-12 |
NLP, MSS (Joint) |
2021-03-16 09:40 |
Online |
Online |
Pinning consensus control of a group of quadrotors modeled by a directed acyclic graph Akinori Sakaguchi, Toshimitsu Ushio (Osaka Univ.) MSS2020-50 |
In this study, we consider a pinning consensus control problem with a given altitude for a group of heterogeneous quadro... [more] |
MSS2020-50 pp.33-36 |
RCC |
2021-01-22 13:55 |
Online |
Online |
Distributed Mini-Batch Stochastic Subgradient Algorithm over Directed Networks Daichi Ishikawa, Naoki Hayashi, Shigemasa Takai (Osaka Univ.) RCC2020-35 |
We consider a constrained optimization problem of minimizing the sum of the local convex objective function values of ag... [more] |
RCC2020-35 pp.4-8 |
MSS, CAS, IPSJ-AL [detail] |
2020-11-25 16:10 |
Online |
Online |
Distributed convex optimization with inequality constraints over directed graphs based on row stochasticity Hiroaki Sakuma, Naoki Hayashi, Shigemasa Takai (Osaka Univ.) CAS2020-22 MSS2020-14 |
Distributed optimization is a method in which agents exchange information on the network to obtain the optimal solution ... [more] |
CAS2020-22 MSS2020-14 pp.16-21 |
NS |
2018-10-18 12:05 |
Kyoto |
Kyoto Kyoiku Bunka Center |
Evaluation of efficiency and stability of VNF placements by extracting a core-peripheral structure Yuki Tsukui, Shin'ichi Arakawa, Masayuki Murata (Osaka Univ) NS2018-110 |
Network function virtualization (NFV) has begun to be introduced with the purpose of increasing the flexibility of prov... [more] |
NS2018-110 pp.31-36 |
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 |
NS |
2018-01-19 13:20 |
Okinawa |
Ishigakishi-Shoko-Kaikan |
[Encouragement Talk]
Study on Initial Phase of Model of Flaming Phenomena in On-Line Social Networks Caused by Degenerated Oscillation Modes Takahiro Kubo (Tokyo Metropolitan Univ.), Chisa Takano (Hiroshima Ciity Univ.), Masaki Aida (Tokyo Metropolitan Univ.) NS2017-157 |
The explosive user dynamics in on-line social networks including flaming phenomena can have a serious impact not only on... [more] |
NS2017-157 pp.75-80 |
CS, NS, IN, NV (Joint) |
2017-09-08 09:50 |
Miyagi |
Research Institute of Electrical Communication, Tohoku Univ. |
New Model of Flaming Phenomena in On-Line Social Networks Caused by Degenerated Oscillation Modes Takahiro Kubo (Tokyo Metropolitan Univ.), Chisa Takano (Hiroshima Ciity Univ.), Masaki Aida (Tokyo Metropolitan Univ.) NS2017-80 |
The explosive dynamics in on-line social networks represented by flaming phenomena can have a serious impact not only on... [more] |
NS2017-80 pp.55-60 |
IT |
2014-07-17 14:00 |
Hyogo |
Kobe University |
Maximum Multicast Throughput by Network Coding on Undirected Hypernetworks Hokuto Takahashi, Ryutaroh Matsumoto, Tomohiko Uyematsu (Tokyo Inst. of Tech.) IT2014-18 |
It is known that the problem of the maximum multicast rate by network coding on an undirected network can be formulated ... [more] |
IT2014-18 pp.37-42 |
NC, IPSJ-BIO, IBISML, IPSJ-MPS [detail] |
2014-06-27 10:35 |
Okinawa |
Okinawa Institute of Science and Technology |
Spike Data Analysis by Weighted Directed Graph Modeling Sho Higuchi (Waseda Univ.), Hideitsu Hino (Univ. of Tsukuba), Masami Tatsuno (Univ. of Lethbridge), Noboru Murata (Waseda Univ.) NC2014-8 IBISML2014-8 |
With recent developments in multielectrode recording technology, neural spike data can be obtained from a brain.
It is... [more] |
NC2014-8 IBISML2014-8 pp.193-200 |
SP |
2012-03-08 13:30 |
Saitama |
Riken Brain Science Institute |
Acoustic Analysis of Infant Directed Speech Using the Multi-Timescale Phoneme Acquisition Model Kouki Miyazawa (Waseda Univ./RIKEN), Hideaki Kikuchi (Waseda Univ.), Reiko Mazuka (RIKEN) SP2011-158 |
We propose the phoneme acquisition model that simulates human auditory system that perceives the temporal variations of ... [more] |
SP2011-158 pp.19-24 |
NC, IPSJ-BIO [detail] |
2011-06-24 16:30 |
Okinawa |
50th Anniversary Memorial Hall, University of the Ryukyus |
Solving POMDPs using Restricted Boltzmann Machines with Echo State Networks Makoto Otsuka, Junichiro Yoshimoto, Stefan Elfwing, Kenji Doya (OIST) NC2011-19 |
A partially observable Markov decision process (POMDP) can be solved in a model-based way using explicit knowledge of th... [more] |
NC2011-19 pp.143-148 |
RCS, MoNA, SR (Joint) |
2011-03-02 10:00 |
Kanagawa |
YRP |
Decision Directed Channel Tracking for MIMO-Constant Envelope Modulation Ehab Mahmoud Mohamed (Kyushu Univ/South Valley Univ. Egypt), Osamu Muta, Hiroshi Furukawa (Kyushu Univ) RCS2010-259 |
The authors have proposed Multi-Input Multi-Output (MIMO)-Constant Envelope Modulation, MIMO-CEM, as power and complexit... [more] |
RCS2010-259 pp.67-72 |
IA |
2010-08-06 15:45 |
Tokyo |
IIJ Kanda Jinbocho Bldg. |
An implemetation of a rapid graph drawing toolset for large scale network topologies Hiroaki Hazeyama (NAIST), Hiroyuki Fujiwara (SCW) IA2010-26 |
Generally, it is difficult to draw a graph of large scale network such as the Internet according to the change of the ne... [more] |
IA2010-26 pp.55-60 |
SR, AN, USN (Joint) |
2009-10-23 13:40 |
Miyagi |
Tohoku Univ. |
[Invited Talk]
Effects of hierarchical structure of complex networks on the measurement of PageRank in the World Wide Web Naoki Masuda (The Univ. of Tokyo/JST), Yoji Kawamura (JAMSTEC), Hiroshi Kori (Ochanomizu Univ/JST) SR2009-66 AN2009-36 USN2009-39 |
Many complex networks found in natural and engineering systems are directed in the meaning that each link has direction.... [more] |
SR2009-66 AN2009-36 USN2009-39 pp.103-104(SR), pp.95-96(AN), pp.77-78(USN) |
MSS |
2009-08-06 15:20 |
Tokyo |
JAIST Tokyo Campus |
Polynomial-time Algorithm for Controllability Test of Boolean Networks Koichi Kobayashi (JAIST), Jun-ichi Imura (Tokyo Inst. of Tech.), Kunihiko Hiraishi (JAIST) CST2009-14 |
This paper proposes a polynomial-time algorithm to determine if a Boolean network with control nodes and controlled node... [more] |
CST2009-14 pp.13-18 |
RCS |
2008-06-27 14:25 |
Mie |
Mie University |
Iterative Decision-Directed Phase Noise Compensation in Millimeter-wave OFDM Transmission Satoshi Suyama, Jungo Izumi, Hiroshi Suzuki, Kazuhiko Fukawa (Tokyo Inst. Tech.) RCS2008-25 |
In millimeter-wave OFDM transmission, this report proposes an OFDM receiver employing decision-directed phase noise comp... [more] |
RCS2008-25 pp.55-60 |
MSS, CAS |
2005-11-10 14:35 |
Yamaguchi |
Yamaguchi University |
Relationship calculation on weighted directed graph and its validity examination in ranking system
-- Application on Semantic Web -- Shigeki Hino (NTT) |
Graph algorithms are increasingly used in the back-end of internet services. However most of them are optimized for some... [more] |
CAS2005-55 CST2005-24 pp.35-40 |