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 |
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 |
CAS, MSS, IPSJ-AL [detail] |
2019-11-29 09:45 |
Fukuoka |
|
Exact Algorithm for Sorting Rules in Firewall Ryosuke Fumiiwa, Toshinori Yamada (Saitama Univ.) CAS2019-55 MSS2019-34 |
Given a firewall policy(a sequence of packet rules), the sorting problem of rules in a firewall is to sort the rules in ... [more] |
CAS2019-55 MSS2019-34 pp.73-78 |
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 |
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 |
ISEC, WBS, IT |
2017-03-10 13:45 |
Tokyo |
TOKAI University |
Index Coding with Information-Theoretic Secrecy for Unintended Message Mami Takei, Hiroki Koga (Univ. Tsukuba) IT2016-130 ISEC2016-120 WBS2016-106 |
In this paper we consider the index coding problem, where multiple receivers decode respective intended messages from th... [more] |
IT2016-130 ISEC2016-120 WBS2016-106 pp.203-208 |
COMP |
2015-12-01 10:30 |
Osaka |
|
A Fast Method for Solving Constrained Shortest Path Problems on Directed Acyclic Graphs Fumito Takeuchi (Hokkaido Univ.), Masaaki Nishino (NTT), Norihito Yasuda (Hokkaido Univ.), Takuya Akiba (NII), Shin-ichi Minato (Hokkaido Univ.), Masaaki Nagata (NTT) COMP2015-31 |
This paper deals with shortest path problems on directed acyclic graphs (DAGs), under logical constraints posed between... [more] |
COMP2015-31 pp.9-16 |
IA |
2014-11-06 16:50 |
Overseas |
Thailand |
Graphical User Interface Tool for JAVA Code Generator Using Depth First Search Technique on Directed Graph Piyavach Khunsongkiet, Eakkarat Boonchieng (Chiang Mai Univ.) IA2014-57 |
The Graphical user interface tool for Java code generator using depth first search (DFS) technique on directed graph is ... [more] |
IA2014-57 pp.121-126 |
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 |
COMP, IPSJ-AL |
2013-05-17 15:05 |
Hokkaido |
Otaru University of Commerce |
Efficient Enumeration of Directed Binary Perfect Phylogenies using Dynamic Programming Kazuki Morito (SEIBU CONSTRUCTION), Toshiki Saitoh, Kazuaki Yamaguchi, Sumio Masuda (Kobe Univ.) COMP2013-12 |
We consider an enumeration of directed binary perfect phylogenies from incomplete data. Recently, Kiyomi et al. proposed... [more] |
COMP2013-12 pp.63-70 |
COMP, IPSJ-AL |
2011-09-06 11:15 |
Hokkaido |
Hakodate City Central Library |
On A DAG Constructing Self-stabilizing Protocol for GeoCast in MANET Koichi Ito, Yoshiaki Katayama, Koichi Wada, Naohisa Takahashi (Nitech) COMP2011-23 |
Geocasting is a mechanism to deliver messages of interest to all hosts within a given geographical region. GeoTORA is on... [more] |
COMP2011-23 pp.23-30 |
MSS, CAS, VLD, SIP |
2011-06-30 11:30 |
Okinawa |
Okinawa-Ken-Seinen-Kaikan |
A Relocation Planning Method for Railway Cars in Final Assembly Shop Yoichi Nagao, Shinichi Nakano, Akifumi Hoshino, Yasushi Kaneta (KHI), Toshiyuki Kita, Masakazu Okamoto (Kawasaki Technology) CAS2011-8 VLD2011-15 SIP2011-37 MSS2011-8 |
The authors have examined a method that makes a movement plan for relocation of the railway cars in preparation for the ... [more] |
CAS2011-8 VLD2011-15 SIP2011-37 MSS2011-8 pp.43-48 |
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) |
COMP |
2009-09-14 11:15 |
Tottori |
Tottori University of Environmental Studies |
Recognition of a Spanning Tree of DAGs by Tree Automata Akio Fujiyoshi (Ibaraki Univ.) COMP2009-26 |
In this article, we define that a DAG is accepted by a tree automaton if the DAG has a spanning tree accepted by the tre... [more] |
COMP2009-26 pp.9-12 |
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 |
IT |
2009-05-29 14:15 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
Constructing prefix-free codes for finite-state noiseless channels Takuya Koyama, Ken-ichi Iwata (Univ. of Fukui) IT2009-1 |
We consider a problem to build good prefix-free codes for stationary memoryless sources over finite-state noiseless chan... [more] |
IT2009-1 pp.1-6 |