Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
AI, JSAI-SAI, JSAI-DOCMAS, IPSJ-ICS, JSAI-KBS (Joint) |
2024-03-03 18:30 |
Hokkaido |
(Primary: On-site, Secondary: Online) |
Method for Generating Paths with Arbitrary Termination Probabilities Based on Pre-Executed Random Walk Paths Tsuyoshi Yamashita, Kunitake Kaneko (Keio Univ.) AI2023-48 |
In graph analysis, random walks can be sped up by using indices. A random walk is a sequence of transitions from a sourc... [more] |
AI2023-48 pp.24-29 |
NS, IN (Joint) |
2024-03-01 09:20 |
Okinawa |
Okinawa Convention Center |
Asynchronous UDP Random Walk method with path reuse for geo-distributed graph analysis Shun Takizawa, Tsuyoshi Yamashita, Kunitake Kaneko (Keio Univ.) IN2023-88 |
Random Walk (RW) is widely used in graph analysis. Graph data for analysis has been getting larger and larger in recent ... [more] |
IN2023-88 pp.136-141 |
ITS, WBS, RCC |
2023-12-22 15:15 |
Okinawa |
(Primary: On-site, Secondary: Online) |
Extension of Mobility Environment Evaluation Platform Using Location-Based Big Data and Comparison with Different Areas Takumi Soma, Tetsuya Manabe (Saitama Univ.) WBS2023-62 ITS2023-45 RCC2023-56 |
This paper is extending the mobility environment evaluation platform by using location-based big data, and comparing wit... [more] |
WBS2023-62 ITS2023-45 RCC2023-56 pp.179-184 |
IN, NS (Joint) |
2023-03-03 14:30 |
Okinawa |
Okinawa Convention Centre + Online (Primary: On-site, Secondary: Online) |
Top-k Personalized PageRank Computation without Re-indexing for Graph Updates Tsuyoshi Yamashita, Naoki Matsumoto, Kunitake Kaneko (Keio Univ.) IN2022-117 |
Top-k Personalized PageRank (PPR) is graph analysis method to determine k important nodes with respect to a source node.... [more] |
IN2022-117 pp.305-310 |
WIT, HI-SIGACI |
2022-12-08 13:00 |
Tokyo |
AIST Tokyo Waterfront (TBD) |
Walking support system for the visually impaired
-- Study of collision avoidance support system with bicycles on sidewalks -- Ryuta Sekine, shun-ichi yonemura (SIT) WIT2022-8 |
According to the Metropolitan Police Department statistics, in 2021, 43.6% of all traffic accidents will involve bicycle... [more] |
WIT2022-8 pp.23-28 |
IN, CCS (Joint) |
2022-08-05 09:00 |
Hokkaido |
Hokkaido University(Centennial Hall) (Primary: On-site, Secondary: Online) |
Autonomous Congestion Control Mechanism Using Random Early Detection in Asynchronous Random Walker Processing Shun Takizawa, Kunitake Kaneko (Keio Univ.) IN2022-18 |
In large-scale graph analysis, Random Walk (RW) is useful and has been implemented in both synchronous and asynchronous ... [more] |
IN2022-18 pp.15-20 |
CW (2nd) |
2022-06-24 |
Tokyo |
(Primary: On-site, Secondary: Online) |
Research on Text While Walking and Ethics
-- Text Analysis Approach -- Momoka Hanaoka, Jun Iio (Chuo Univ.) |
In recent years, the risk of accidents caused by texting while walking has increased. Furthermore, it has become a probl... [more] |
|
EMM |
2022-03-07 13:05 |
Online |
(Primary: Online, Secondary: On-site) (Primary: Online, Secondary: On-site) |
[Poster Presentation]
A proposal of assist system for digital illustration drawing Satoshi Higuchi, Michiharu Niimi (KIT) EMM2021-92 |
In order to practice drawing illustrations, it is useful to have a system that provides drawing assistance and evaluatio... [more] |
EMM2021-92 pp.1-6 |
CQ, CBE (Joint) |
2022-01-27 16:55 |
Ishikawa |
Kanazawa(Ishikawa Pref.) (Primary: On-site, Secondary: Online) |
An experimental study to clarify the characteristics of multiple random walks with different transition probabilities Nanami Tsuji, Fumiya Toyoda, Yusuke Sakumoto, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) CQ2021-85 |
Random walks on graphs have been used in various graph algorithms. The first meeting time is defined by the time it take... [more] |
CQ2021-85 pp.50-55 |
NLP, MICT, MBE, NC (Joint) [detail] |
2022-01-23 09:25 |
Online |
Online |
Development of a gait phase detection algorithm for finite state control of functional electrical stimulation during walking Koshi Shibagaki, Suzufumi Arai, Matija Milosevic, Taishin Nomura (Osaka Univ) NC2021-39 |
Individuals with neurological conditions such as stroke often have difficulties to walk independently due to muscle para... [more] |
NC2021-39 p.43 |
IA |
2021-09-08 10:30 |
Online |
Online |
Random Walk on Graphs with Vicinity Avoidance Keita Kitaura, Ryotaro Matsuo, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2021-16 |
A random walk on a graph is a mathematical mobility model that extends a random walk on a line or a plane to a graph. In... [more] |
IA2021-16 pp.7-13 |
IA |
2021-09-08 10:55 |
Online |
Online |
Analysis of Diverse Random Walks with Different Transition Probabilities and Different Moving Frequencies Using Spectral Graph Theory Nanami Tsuji, Fumiya Toyoda, Yusuke Sakumoto, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2021-17 |
The first meeting time is defined by the time it takes for multiple mobile agents starting random walks from different n... [more] |
IA2021-17 pp.14-21 |
SR |
2021-05-21 14:00 |
Online |
Online |
[Technology Exhibit]
Invisible Sensing
-- Walk-through Security Screening System -- Kazumine Ogura, Tatsuya Sumiya, Nagma S Khan, Shingo Yamanouchi, Toshiyuki Nomura, Masayuki Ariyoshi (NEC) SR2021-13 |
Many facilities, e.g., office buildings, schools and railway stations are potential terrorism targets but security scree... [more] |
SR2021-13 pp.86-90 |
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 |
NC, MBE (Joint) |
2021-03-04 15:00 |
Online |
Online |
"Piling up bones":An experimental study on functional standing Tajima Hiroyuki, Sakaguchi Yutaka (UEC) NC2020-59 |
Quiet standing has been regarded as the posture to be stable and have less body sway. In our daily life, however, we usu... [more] |
NC2020-59 pp.95-100 |
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 |
IE, IMQ, MVE, CQ (Joint) [detail] |
2020-03-05 15:45 |
Fukuoka |
Kyushu Institute of Technology (Cancelled but technical report was issued) |
Walking Balance Evaluation Based on Load Sensor of Walking Support Robot Naoto Okada (Nagoya Univ.), Mayu Yokoya, Kazunori Yamada (Panasonic Co., Ltd.), Naoto Yoshida, Yu Enokibori, Kenji Mase (Nagoya Univ.) IMQ2019-51 IE2019-133 MVE2019-72 |
With the increasing of elderly population, it is desired that elderly people can send healthy longevity lifestyle. Worki... [more] |
IMQ2019-51 IE2019-133 MVE2019-72 pp.183-188 |
HCS |
2020-03-05 14:20 |
Online |
Online Meeting |
[Online] The Relationship between Gestures and Words by a Coach who Teaches Advanced Walking Skill Masatoshi Yamada (Tokoha Univ.), Daisuke Sato (SATO SPEED), Sayaka Tohyama (Shizuoka Univ.), Takeshi Matsumura (Tokoha Univ.), Yugo Takeuchi (Shizuoka Univ.) HCS2019-98 |
The purpose of this study is to clarify the relationship between gestures and words by a coach who teaches advanced walk... [more] |
HCS2019-98 pp.77-82 |
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 |
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 |