Committee 
Date Time 
Place 
Paper Title / Authors 
Abstract 
Paper # 
IBISML 
20220915 15:30 
Kanagawa 
Keio Univ. (Yagami Campus) (Primary: Onsite, Secondary: Online) 
An Genenalized LiNGAM when confunder is present
 A formulation of ICA and the minimum shortest problem  Joe Suzuki, Tianle Yang (Osaka U.) IBISML202239 
In this study, we investigated a generalization of LiNGAM that allows the presence of confounding. Existing LiNGAMs assu... [more] 
IBISML202239 pp.4754 
CAS, SIP, VLD, MSS 
20220617 13:00 
Aomori 
Hachinohe Institute of Technology (Primary: Onsite, Secondary: Online) 
A revised shortest pathbased routing in WSN model Yoshihiro Kaneko (Gifu Univ.), Mayu Okumura (Meitec) CAS202212 VLD202212 SIP202243 MSS202212 
In this report, we deal with a shortest pathbased routing, termed as an SProuting, for a longer lifetime on a wireless... [more] 
CAS202212 VLD202212 SIP202243 MSS202212 pp.6166 
CCS, NLP 
20220609 17:40 
Osaka 
(Primary: Onsite, Secondary: Online) 
Speeding up an algorithm for searching generalized Moore graphs Taku Hirayama, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) NLP202211 CCS202211 
Computer networks in data centers are modeled as undirected regular graphs, and the average shortest path length (ASPL) ... [more] 
NLP202211 CCS202211 pp.5257 
NS 
20220415 11:10 
Tokyo 
kikai shinkou kaikan + online (Primary: Onsite, Secondary: Online) 
Service Chaining Based on Capacitated Shortest Path Tour Problem
 Solution Based on Deep Reinforcement Learning and Graph Neural Network  Takanori Hara, Masahiro Sasabe (NAIST) NS20222 
The service chaining problem is one of the resource allocation problems in network functions virtualization (NFV) networ... [more] 
NS20222 pp.712 
MSS, CAS, IPSJAL [detail] 
20211118 10:55 
Online 
Online 
Shortest cycles on a WRSN model provided by a WSN routing Yoshihiro Kaneko, Keisuke Murase (Gifu Univ.) CAS202141 MSS202121 
For a wireless sensor network WSN and its related models, we have so far considered routings, sink trajectories and so o... [more] 
CAS202141 MSS202121 pp.2427 
IN, NS, CS, NV (Joint) 
20210909 12:40 
Online 
Online 
Service Chaining Based on Capacitated Shortest Path Tour Problem
 Solution Based on Lagrangian Relaxation and Shortest Path Tour Algorithm  Takanori Hara, Masahiro Sasabe (NAIST) NS202160 
Network functions virtualization (NFV) can speedily and flexibly deploy network services by replacing traditional networ... [more] 
NS202160 pp.1823 
CS 
20201106 10:00 
Online 
Online + Central Community Center, Nonoichi Community Center (Primary: Online, Secondary: Onsite) 
ACObased shortest hop routing algorithm Guan Xin, Hidenori Nakazato (Waseda Univ) CS202056 
ACO (Ant Colony Optimization) routing algorithm is an effective routing algorithm. However, this algorithm has some shor... [more] 
CS202056 pp.4853 
IA 
20201001 16:25 
Online 
Online 
[Poster Presentation]
A Study on Topology Estimation from Observed Network Flows Keita Kitaura, Ryotaro Matsuo (Kwansei Gakuin Univ.), Ryo Nakamura (Fukuoka Univ.), Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA202011 
Acquisition and estimation of topologies of largescale evolving networks
such as communication networks and social net... [more] 
IA202011 p.31 
NLP 
20200515 13:00 
Online 
Online 
A Genetic Algorithm for Minimizing Average Shortest Path Length of Regular Graphs Reiji Hayashi, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) NLP20203 
For the problem of finding a regular graph with given order and degree that minimizes the average shortest path length, ... [more] 
NLP20203 pp.1116 
NS, IN (Joint) 
20200305 11:00 
Okinawa 
Royal Hotel Okinawa ZanpaMisaki (Cancelled but technical report was issued) 
Sequential Calculation of Dynamic User Equilibrium for Network Controlled Autonomous Driving Ryo Onoda, Goki Yamamoto, Hiroki Kubokawa, Masaki Murakami, Naoaki Yamanaka, Satoru Okamoto (Keio Univ.) NS2019194 
Traffic congestion is a major problem in the automotive society. Because of the spread of autonomous driving vehicles an... [more] 
NS2019194 pp.101106 
IE, IMQ, MVE, CQ (Joint) [detail] 
20200306 09:45 
Fukuoka 
Kyushu Institute of Technology (Cancelled but technical report was issued) 
Posebased Shot Detection in a Badminton Doubles Competition Video Satoru Yamagishi, Yoshiteru Yamamoto, Keisuke Doman, Yoshito Mekada (Chukyo Univ.) IMQ201954 IE2019136 MVE201975 
The movement in formation of players is a key factor to score a point in badminton doubles competition.
It is, however,... [more] 
IMQ201954 IE2019136 MVE201975 pp.199203 
COMP 
20191213 17:00 
Gunma 
Ikaho Seminar House, Gunma University 
COMP201942 
Motivated by adjacency in perfect matching polytopes, we study the shortest reconfiguration problem of perfect matchings... [more] 
COMP201942 pp.93100 
CAS, MSS, IPSJAL [detail] 
20191128 13:50 
Fukuoka 

The expected distance sum of random shortestpath intrees over Hamilton path trajectory on grid graph Yoshihiro Kaneko (Gifu Univ.) CAS201950 MSS201929 
The paper deals with shortest pathbased intrees on a grid graph. There root moves among all vertices. As such root mob... [more] 
CAS201950 MSS201929 pp.3338 
ICSS, IA 
20180626 09:50 
Ehime 
Ehime University 
Proposal of SparseModeling based Approach for Betweenness Centrality Estimation Ryotaro Matsuo, Ryo Nakamura, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA201810 ICSS201810 
In recent years, a statistical approach for estimating unobserved model parameters from a small number of observations u... [more] 
IA201810 ICSS201810 pp.6166 
NLP, CCS 
20180610 11:20 
Kyoto 
Kyoto Terrsa 
Some Efficient Methods for Searching Generalized Moore Graphs Yoshiki Satotani, Norikazu Takahashi (Okayama Univ.) NLP201843 CCS201816 
Computer networks used for high performance computing are often modeled by undirected regular graphs, and the average sh... [more] 
NLP201843 CCS201816 pp.8590 
MBE, NC, NLP (Joint) 
20180126 13:25 
Fukuoka 
Kyushu Institute of Technology 
Methods for Constructing Simple Undirected Regular Graphs Based on Generalized de Bruijn Graphs Ryoya Ishii, Norikazu Takahashi (Okayama Univ.) NLP201790 
The Generalized de Bruijn Graphs (GDBG) are a class of directed regular graphs. Since the average shortest path length o... [more] 
NLP201790 pp.2328 
CNR, IN, MoNA (Joint) [detail] 
20171116 10:50 
Fukuoka 

Coverage Expansion of Vehicular Millimeter Wave Communication with Multihop Relaying Akihito Taya, Takayuki Nishio, Masahiro Morikura, Koji Yamamoto (Kyoto Univ.) MoNA201717 
A small road side unit (RSU) coverage of millimeter wave (mmWave) communications for autonomous vehicles is an open issu... [more] 
MoNA201717 pp.1318 
NS, IN (Joint) 
20170303 15:30 
Okinawa 
OKINAWA ZANPAMISAKI ROYAL HOTEL 
Selection Algorithm of Links to Aggregate Traffic for Network Greening with considering Transmission Performance Atsushi Yorichika, Kenji Kawahara (KIT) IN2016162 
As the Internet grows explosively and network components such as routers and switches increase, they consume electric po... [more] 
IN2016162 pp.389394 
NS, IN (Joint) 
20170303 13:20 
Okinawa 
OKINAWA ZANPAMISAKI ROYAL HOTEL 
On Path Selection Considering Length and Reliability for Automatic Evacuation Guiding Based on Interactions between Evacuees and Their Mobile Nodes Takanori Hara, Masahiro Sasabe, Shoji Kasahara (NAIST) NS2016247 
When disasters occur, evacuees have to evacuate to safe place quickly. To tackle this problem, there has been proposed a... [more] 
NS2016247 pp.517522 
COMP, ISEC 
20161221 15:30 
Hiroshima 
Hiroshima University 
Theoretical Model of Interconnection Networks Consisting of Hosts and Switches Ryota Yasudo (Keio Univ.), Michihiro Koibuchi (NII), Hideharu Amano (Keio Univ.), Koji Nakano (Hiroshima Univ.) ISEC201679 COMP201640 
Designing interconnection networks with low average shortest path length (ASPL) is an important object for researchers o... [more] 
ISEC201679 COMP201640 pp.5158 