Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
RCS, IN, NV (Joint) |
2021-05-28 11:45 |
Online |
Online |
An Evaluation of Tracking Performance of Personalized PageRank Using Random Walk in Dynamic Graphs Tsuyoshi Yamashita, Kunitake Kaneko (Keio Univ.) IN2021-5 |
By combining graphs managed by multiple services, we can create an autonomous distributed graph that enables multiple se... [more] |
IN2021-5 pp.25-30 |
NS |
2021-05-13 14:50 |
Online |
Online |
Evaluation of the effect of vertex replication for random walk in autonomous distributed graphs Yoichi Ozaki, Kunitake Kaneko (Keio Univ.) NS2021-19 |
It is important to obtain a subgraph from a distributed graph by Random Walk while maintaining the rough structure of th... [more] |
NS2021-19 pp.26-31 |
NS |
2021-05-13 15:15 |
Online |
Online |
Graph Reordering while Acquiring Graph Data Managed Distributedly by Random Walk Kohei Tsuchida, Kunitake Kaneko (Keio Univ.) NS2021-20 |
It is known that cache misses occur so many times, which leads to slow down the calculation speed while graph processing... [more] |
NS2021-20 pp.32-37 |
CS, CQ (Joint) |
2021-05-14 10:50 |
Online |
On-line |
A Study of the Effect of Agents' Diversities on the Running Time of the Random Walk-Based Rendezvous Search Fumiya Toyoda, Yusuke Sakumoto (Kwansei Univ.) CQ2021-13 |
A rendezvous search, which aims to efficiently meet multiple searchers existing different nodes on a network, is expecte... [more] |
CQ2021-13 pp.53-58 |
IN |
2021-01-18 10:30 |
Online |
Online |
Local community and weak ties detection using random walk on hypergraph. Ryo Oka (Keio Univ.), Yuuki Takai (RIKEN), Naoki Matsumoto (Keio Univ.), Masahiro Ikeda (RIKEN), Kunitake Kaneko (Keio Univ.) IN2020-41 |
There are many services that use a graph with a content as a vertex and their relationship as a edge. Community detectio... [more] |
IN2020-41 pp.1-6 |
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 |
IA, SITE, IPSJ-IOT [detail] |
2020-03-03 10:30 |
Online |
Online |
A Study on Efficient Blind Search Utilizing the Rendezvous of Random Walk Agents Fumiya Toyoda, Yusuke Sakumoto, Hiroyuki Ohsaki (Kwansei Gakuin Univ) SITE2019-96 IA2019-74 |
A blind search is a search method for a network, without using topology information of an entire network. While a blind... [more] |
SITE2019-96 IA2019-74 pp.99-104 |
AP |
2020-02-21 11:25 |
Shizuoka |
Shizuoka Univ. Hamamatsu Campus |
Random Walk and Wave Propagation Yoshio Karasawa AP2019-190 |
While doing a random walk, we visit some basic probability distributions that appear in radio wave propagation models. R... [more] |
AP2019-190 pp.53-57 |
IA |
2019-11-14 15:30 |
Tokyo |
Kwansei Gakuin University, Tokyo Marunouchi Campus (Sapia Tower) |
[Poster Presentation]
Investigation on the First Meeting Time of Random Walk Agents with Heterogeneous Transition Probability for Optimal Rendezvous Search Fumiya Toyoda, Yusuke Sakumoto (Kwansei Gakuin Univ.) IA2019-31 |
In an unstructured network~(e.g., unstructured P2P network, social
network, and MANET), there is a restriction that eac... [more] |
IA2019-31 pp.43-46 |
IA |
2019-09-06 09:40 |
Hokkaido |
Hokkaido Univ. Humanities and Social Sciences Classroom Bldg, W102 |
Characteristic Analysis of Constrained Random WayPoint Mobility Model on Graph Ryota Sakaguchi, Daiki Matsui, Ryo Nakamura, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2019-16 |
Graph traversal is one of fundamental problems in discrete
mathematics since it has a broad range of applications in di... [more] |
IA2019-16 pp.27-32 |
IA |
2019-09-06 10:05 |
Hokkaido |
Hokkaido Univ. Humanities and Social Sciences Classroom Bldg, W102 |
A Study on Modeling Branching Random Walk on Random Regular Graph Takuro Mayaguchi, Ryota Sakaguchi, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2019-17 |
Several popular problems in information networking and social networking such as search, distribution, and dis- seminati... [more] |
IA2019-17 pp.33-37 |
IA |
2019-09-06 10:30 |
Hokkaido |
Hokkaido Univ. Humanities and Social Sciences Classroom Bldg, W102 |
Analysis of Two Random Walks on the Basis of Graph Spectrum
-- The Effect of Degree Heterogeneity on First Meeting Time on a Graph -- Yusuke Sakumoto, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2019-18 |
The first meeting time is defined as the time required until multiple random walks starting from different nodes in a gr... [more] |
IA2019-18 pp.39-44 |
PN |
2019-04-26 14:35 |
Tokyo |
The University of Electro-Communication, Build E-3, Hall 301 |
[Invited Talk]
On the Impact of Network Topology on Information Search, Delivery, and Diffusiojn Ryo Nakamura, Ryota Sakaguchi, Kazuyuki Yamashita, Daiki Matsui, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) PN2019-4 |
A network topology is the logical structure of a communication network
consisting of a large number of nodes (e.g., h... [more] |
PN2019-4 pp.17-24 |
PRMU, BioX |
2019-03-18 10:00 |
Tokyo |
|
A Study of Comparison of Learning Algorithms for Pedestrian Identification Using 3-Axis Accelerometer of Smartphone Meng Cui, Yuji Watanabe (Nagoya City Univ.) BioX2018-48 PRMU2018-152 |
We have acquired triaxial acceleration from a smartphone device and have identified subjects during walking. In the prev... [more] |
BioX2018-48 PRMU2018-152 pp.113-118 |
MSS, SS |
2019-01-16 14:30 |
Okinawa |
|
Prediction of Position for Mobile Objects based on BLE Signals and Machine Learning Nan Toma, Arata Sashida (Univ. of the Ryukyus), Hideki Kinjo (Okinawa Univ.), Morikazu Nakamura (Univ. of the Ryukyus), Akira Sakima (Kuniken Systems) MSS2018-76 SS2018-47 |
This paper presents indoor positioning systems based on BLE signals and machine learning approaches.
We consider two sy... [more] |
MSS2018-76 SS2018-47 pp.121-125 |
IA |
2018-11-28 14:40 |
Tokyo |
Akihabara Convention Hall, 5th Floor (Conference Room 5B) |
A Study on the Cooperative Search Using Multiple Random Walks in Unstructured Network Yusuke Sakumoto (Tokyo Metropolitan Univ.), Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2018-36 |
To begin the communication between two nodes, the node with the communication request must specify the location of the p... [more] |
IA2018-36 pp.1-8 |
CQ |
2018-08-24 11:30 |
Shiga |
Ritsumeikan Univ. Biwako-Kusatsu Campus (BKC) |
Analysis of Positive Feedback on Social Network Using Random Matrix Theory Yusuke Sakumoto, Masaki Aida (Tokyo Metropolitan Univ.) CQ2018-56 |
The social media facilitates the communication among people, and promotes several group activities in the society. Today... [more] |
CQ2018-56 pp.59-64 |
SANE |
2018-05-14 14:50 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
Identification of Emitters of a Same Product
-- Applying Allan Deviation Analysis to Specific Emitter Identification -- Takashi Iwamoto (Mitsubishi Electric) SANE2018-9 |
Specific Emitter Identification technologies collect growing attention aiming at transmitter-dependent reaction or preve... [more] |
SANE2018-9 pp.47-50 |
MBE, NC (Joint) |
2018-03-14 14:00 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
NC2017-94 |
The leg joint trajectories during walking are not the same in every stride and some fluctuation is observed. However, so... [more] |
NC2017-94 pp.157-162 |
IA |
2018-01-26 12:10 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
On Effective Strategy of Information Exchange among Mobile Nodes without Wide Area Communication Service Yusuke Sakumoto (Tokyo Metropolitan Univ.), Hiroyuki Ohisaki (Kwansei Gakuin Univ.) IA2017-68 |
In order to exchange information among persons without wide area communication service, each person searches everywhere ... [more] |
IA2017-68 pp.17-22 |