Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
CQ, CBE (Joint) |
2022-01-28 11:45 |
Ishikawa |
Kanazawa(Ishikawa Pref.) (Primary: On-site, Secondary: Online) |
A Study on Parameter Tuning of a Rendezvous Search Utilizing Random Walks Fumiya Toyoda, Yusuke Sakumoto, Hiroyuki Ohsaki (Kwansei Gakuin Univ) CQ2021-92 |
Many studies proposed a rendezvous search that multiple searchers existing on different nodes on a network try to find o... [more] |
CQ2021-92 pp.88-93 |
CQ |
2020-09-03 11:45 |
Osaka |
Osaka University Nakanoshima Center (Primary: On-site, Secondary: Online) |
Study on the Effectivity of Rendezvous Search Using Random Walk in Large-Scale Unknown Networks Fumiya Toyoda, Yusuke Sakumoto, Hiroyuki Ohsaki (Kwansei Univ.) CQ2020-37 |
Many studies proposed a rendezvous search method that multiple searchers starting from different nodes on a network try ... [more] |
CQ2020-37 pp.15-20 |
NLP, NC (Joint) |
2020-01-24 12:30 |
Okinawa |
Miyakojima Marine Terminal |
Characterization of the turbulent scalar mixing in a plane jet using complex network theory Wataru Kobayashi, Hiroshi Gotoda (TUS), Yuya Ohmichi, Shingo Matsuyama (JAXA) NLP2019-91 |
We numerically study the dynamics of a turbulent scalar mixing in a plane jet from the viewpoints of symbolic dynamics, ... [more] |
NLP2019-91 pp.37-40 |
EMCJ, MICT (Joint) |
2018-03-16 14:15 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
Study on Conductor Pattern Design of a EMI Filter using Topology Optimization Katsuya Nomura (TCRDL), Hiroki Bo, Shintaro Yamasaki, Kentaro Yaji (Osaka Univ.), Atsuhiro Takahashi, Takashi Kojima (TCRDL), Kikuo Fujita (Osaka Univ.) EMCJ2017-112 |
Topology optiization, which is a method to calculate the optimal structure, was applied for a conductor pattern optimiza... [more] |
EMCJ2017-112 pp.43-48 |
MSS, NLP (Joint) |
2018-03-14 10:45 |
Osaka |
|
Consensus Speed of Multi-agent Systems Modeled by Scale-free Graph Akinori Sakaguchi, Toshimitsu Ushio (Osaka Univ.) NLP2017-109 |
In a pinning consensus problem of multi-agent systems, a consensus speed of a static pinning control is generally bounde... [more] |
NLP2017-109 pp.43-46 |
NS, IN (Joint) |
2018-03-01 09:40 |
Miyazaki |
Phoenix Seagaia Resort |
A Flow Allocation Algorithm for TE in Scale-Free Networks Manabu Kato (NIT, Ariake College), Kenji Kawahara (Kyutech) IN2017-95 |
We develop a flow allocation algorithm for TE in scale-free networks by considering its structure. And we then evaluate ... [more] |
IN2017-95 pp.33-38 |
IA, IN (Joint) |
2017-12-14 17:10 |
Hiroshima |
Hiroshima City Univ. |
IN2017-56 |
In Twitter, functions like ``Like,'' ``Retweet'' and ``Reply'' allow viewers to feedback their reactions to the contribu... [more] |
IN2017-56 pp.61-66 |
IA, SITE, IPSJ-IOT [detail] |
2017-03-03 17:05 |
Okinawa |
Culture Resort Festone (Okinawa) |
On the Effect of Scale-Free Structure of Network Topology on Performance of Content-Centric Networking Shinpei Wada, Ryo Nakamura, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) SITE2016-73 IA2016-103 |
In this paper, we investigate the effect of scale-free structure of a network topology on performance of CCN (Content-Ce... [more] |
SITE2016-73 IA2016-103 pp.85-89 |
IN, NV (Joint) |
2016-07-15 09:30 |
Hokkaido |
Matsumaecho Sougo Center |
Dynamic Routing Method Using Available Bandwidth and Degree
-- Evaluation in TCP -- Yuuki Udagawa, Osamu Mizuno (Kogakuin Univ.) IN2016-23 |
Open Shortest Path First (OSPF) is a popular routing protocol for the internet. OSPF tends to concentrate traffic to hig... [more] |
IN2016-23 pp.1-6 |
NLP |
2015-01-26 14:20 |
Oita |
Compal Hall |
Chaos in Scale-Free Networks of Coupled Oscillators Takuya Kitamura, Seiichiro Moro (Univ. Fukui) NLP2014-121 |
In recent years, various oscillation and synchronization phenomena have been investigated for coupled oscillators. In st... [more] |
NLP2014-121 pp.47-52 |
ICM, CQ, NS, NV (Joint) |
2014-11-14 09:50 |
Kochi |
Kochi-City-Culture-Plaza CUL-PORT |
Understanding the Impact of Scale-Free Structure on End-to-End TCP Performance Using Fluid-Based Analysis Yusuke Sakumoto (Tokyo Metropolitan Univ.), Hiroyuki Ohsaki (Kwansei Gakuin Univ.) CQ2014-81 |
The scale-free structure is one of the most well-known properties of the Internet as a complex network. Many researcher... [more] |
CQ2014-81 pp.59-64 |
IBISML |
2014-03-06 13:50 |
Nara |
Nara Women's University |
Finding scale-free networks of Gaussian graphical models by sampling Shota Shikita, Osamu Maruyama (Kyushu Univ.) IBISML2013-69 |
The problem of learning the structure of a Gaussian graphical model is to infer the graph representing the relationship ... [more] |
IBISML2013-69 pp.15-22 |
IN, IA (Joint) |
2013-12-19 11:10 |
Hiroshima |
Hiroshima City Univ. |
A New Load-Balancing Scheme by Using Betweenness Centrality Applied to Scale-Free Networks Soma Hayashi, Yutaro Nagata, Koichi Asatani (Kogakuin Univ.) IN2013-100 |
The Internet is a scale-free network, where node degree distribution follows a power law. In a scale-free network, OSPF ... [more] |
IN2013-100 pp.7-12 |
NLP |
2013-10-29 11:15 |
Kagawa |
Sanport Hall Takamatsu |
[Invited Talk]
Self-organization of a network based on traffic dynamics Takaaki Aoki (Kagawa Univ.) NLP2013-97 |
We investigated the co-evolving dynamics of a network and its state. We have also considered a reaction-diffusion system... [more] |
NLP2013-97 pp.143-146 |
NS, IN (Joint) |
2013-03-08 11:30 |
Okinawa |
Okinawa Zanpamisaki Royal Hotel |
Visualization of Overlay Network using Autonomous System Relationships Hiroko Nakamura Miyamura (JAEA), Hsiang-Yun Hu, Masahiro Yoshida (Univ. of Tokyo), Satoshi Ohzahata (Univ. of Electro-Comm.), Akihiro Nakao, Shigeo Takahashi (Univ. of Tokyo) NS2012-264 |
This report presents a method for visualizing scale-free networks. Scale-free networks are said to be difficult to analy... [more] |
NS2012-264 pp.577-582 |
IN |
2013-01-24 15:20 |
Kagoshima |
Kagoshima-Ken-Sangyo-Kaikan |
Building a Diffusion Model across Multiple Communities Seiya Kawaguchi, Marat Zhanikeev, Hitoshi Watanabe (Tokyo Univ. of Science) IN2012-140 |
In conventional social network diffusion models, all people are members of the same social networks. However,in real net... [more] |
IN2012-140 pp.11-14 |
MoNA, AN, USN (Joint) |
2013-01-25 15:50 |
Miyagi |
ICHINOBO (Sendai-city) |
Performance Evaluation of Relay Peer Selection in P2P multicast considering Physical Network Centrality and Peer Distribution Based on Estimation of Physical Network Characteristics Tatsuya Onishi, Hiroaki Morino (Shibaura Inst. Tech.) MoMuC2012-67 |
(To be available after the conference date) [more] |
MoMuC2012-67 pp.125-130 |
COMP |
2012-12-10 09:30 |
Fukuoka |
Kyushu University |
Analysis of Alternative Rumor Spreading on Scale-Free Networks
-- For Simple Two Type Degree Networks -- Hiroki Yamaguchi, Osamu Watanabe (Tokyo Tech) COMP2012-43 |
In order to analyze
the effect of very rapid rumor spreading on a large scale network,
we propose in this paper
to in... [more] |
COMP2012-43 pp.1-5 |
VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM (Joint) [detail] |
2012-11-28 09:00 |
Fukuoka |
Centennial Hall Kyushu University School of Medicine |
A Basic Study of FPGA Routing Architecture Based on Scale Free Network Satoshi Hayama, Motoki Amagasaki, Masahiro Iida, Morihiro Kuga, Toshinori Sueyoshi (Kumamoto Univ.) RECONF2012-50 |
FPGA(Fiele Programmable Gate Array) has many routing resources in order to provide the flexibility.
These routing resou... [more] |
RECONF2012-50 pp.17-22 |
NS, IN (Joint) |
2012-03-09 11:20 |
Miyazaki |
Miyazaki Seagia |
Visualizing Scale Free Networks for the Analysis of P2P Network Traffic Data Kai Sasaki, Hsiang-Yun Hu, Masahiro Yoshida (Tokyo Univ.), Hiroko Nakamura Miyamura (JAEA), Satoshi Ohzahata (UEC Univ.), Akihiro Nakao, Shigeo Takahashi (Tokyo Univ.) NS2011-223 |
This report presents a method for visualizing scale-free networks including P2P networks as an typical example. Visualiz... [more] |
NS2011-223 pp.249-254 |