Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
NS, SR, RCS, SeMI, RCC (Joint) |
2022-07-13 15:15 |
Ishikawa |
The Kanazawa Theatre + Online (Primary: On-site, Secondary: Online) |
Evaluation of Migratory Unmanned Aerial Vehicle Systemfor Automation Inspection of Infrastructure Hideya So (SIT) SeMI2022-27 |
Many infrastructures such as bridges and communication towers were constructed more than 30 years ago, and their inspect... [more] |
SeMI2022-27 pp.40-45 |
SANE |
2019-10-31 12:00 |
Overseas |
KOREA (Jeju) |
Estimation on Optimal Escape Route of Human at Tidal Flat Based on Sedimentary from Aerial Image Dae-Woon Shin (OST), Chan-Su Yang, Tae-Ho Kim (KIOST) SANE2019-53 |
In this study, we estimated an optimal escape route of humans at tidal flat using Dijkstra's algorithm. Dijkstra's algor... [more] |
SANE2019-53 pp.33-36 |
R |
2018-07-27 14:25 |
Hokkaido |
|
Search process for multi-objective network by applying efficiency of path search in one-objective network Natsumi Takahashi, Shao-Chin Sung (Aoyama Gakuin Univ.), Tomoaki Akiba (Chiba Inst. of Tech.), Hisashi Yamamoto (Tokyo Metropolitan Univ.) R2018-12 |
Many networks have been applied extensively in the real world, for example, scheduling of a production and distribution ... [more] |
R2018-12 pp.7-12 |
CS |
2018-07-12 10:59 |
Okinawa |
Eef Information Plaza (Kumejima Is.) |
Study on Routing Control Method for DoS Attack Jun Kiyama, Takuya shindo, Takefumi Hiraguri (NIT) CS2018-24 |
DoS attack that attack a web service and the internet is a big problem in recent years, because DoS attack takes a resou... [more] |
CS2018-24 pp.67-70 |
R |
2018-05-25 16:20 |
Aichi |
Aichi Institute of Technology, Motoyama Campus |
Search Space Restriction by Spanning Tree in Multi-Objective Network Natsumi Takahashi (Aoyama Gakuin Univ.), Tomoaki Akiba (Chiba Inst. of Tech.), Hisashi Yamamoto (Tokyo Metropolitan Univ.), Shao-Chin Sung (Aoyama Gakuin Univ.) R2018-6 |
Many networks have been applied extensively in the real world, for example, scheduling of a production and distribution ... [more] |
R2018-6 pp.31-36 |
R |
2017-10-20 16:20 |
Kumamoto |
|
Search for Optimal Construction Network with Multi-Objective Functions Natsumi Takahashi (Aoyama Gakuin Univ.), Tomoaki Akiba (Chiba Inst. of Tech.), Hisashi Yamamoto (Tokyo Metropolitan Univ.), Shao-Chin Sung (Aoyama Gakuin Univ.) R2017-49 |
Many networks have been applied extensively in the real world, for example, scheduling of a production and distribution ... [more] |
R2017-49 pp.29-33 |
IE, ITE-ME, ITE-AIT [detail] |
2017-10-05 13:00 |
Nagasaki |
|
Tsunami inundation forecast hazard map creation method which is easily updated using land cover analysis Nakanishi Hajime, Yoshida Hiromi, Iiguni Youji (Osaka Univ.) IE2017-47 |
Information on the hazard is required to be up to date. However, the hazard map can not be updated frequently due to the... [more] |
IE2017-47 pp.1-6 |
NS, IN (Joint) |
2016-03-03 11:00 |
Miyazaki |
Phoenix Seagaia Resort |
Method for Determining Traveling Route in Consideration of Number of Users for Message Ferry Using UAV Tomohiro Kondo, Takuji Tachibana (Univ. of Fukui) NS2015-185 |
In delay tolerant networks (DTN) where Unmanned Aerial Vehicle (UAV) is used as message ferry, users can transmit data t... [more] |
NS2015-185 pp.99-104 |
RCC, ITS, WBS |
2015-12-17 10:30 |
Okinawa |
Okinawa Industry Support Center |
[Poster Presentation]
A study on the task assignment and routing algorithm in distribution warehouse considering interruption requests
-- Itterative application of Genetic Algorithm to deal with interruption requests -- Tsubasa Tamura, Takayoshi Yokota (Tottori Univ) WBS2015-45 ITS2015-17 RCC2015-47 |
In this paper, a new algorithm which combinatorial optimization problem for the optimum routing of the conveyance robot ... [more] |
WBS2015-45 ITS2015-17 RCC2015-47 pp.37-42 |
R |
2015-05-22 14:35 |
Shimane |
Okinoshima-Bunka-Kaikan |
Search process for optimal paths in multi-objective network Natsumi Takahashi, Hisashi Yamamoto (Tokyo Met. Univ.), Tomoaki Akiba (Chiba Inst. of Tech.), Xiao Xiao (Tokyo Met. Univ.), Koji Shingyochi (Jumonji Univ.) R2015-5 |
Many networks have been applied extensively in the real world, for example, scheduling of a production and distribution ... [more] |
R2015-5 pp.25-30 |
ASN |
2015-05-15 10:25 |
Tokyo |
Tokyo Denki University |
High-precision automatic traveling method of an electric wheelchair in indoor area and its evaluation Hirotoshi Shibata, Yuta Noriduki, Chokatsu Yara, Shigenori Ioroi, Hiroshi Tanaka (Kait) ASN2015-11 |
The authors have researched automatic traveling method of an electric wheelchair in indoor area so far. An operation PC ... [more] |
ASN2015-11 pp.59-64 |
VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM (Joint) [detail] |
2014-11-26 15:35 |
Oita |
B-ConPlaza |
Parallelization of Shortest Path Search on Various Platforms and Its Evaluation Shuto Kurebayashi, Shinya Takamaeda, Jun Yao, Yasuhiko Nakashima (NAIST) CPSY2014-74 |
Since graph processing has irregular control flows and memory access patterns, its acceleration by the parallelization i... [more] |
CPSY2014-74 pp.13-18 |
IA |
2014-11-06 10:20 |
Overseas |
Thailand |
IPTV Multicast Routing in SDN/OpenFlow Environments Pornnipa Rattanawadee (Chulalongkorn Univ.), Natchaphon Ruengsakulrach (Georgia Tech), Chaiyachet Saivichit (Chulalongkorn Univ.) IA2014-42 |
This paper proposes an application of SDN/OpenFlow with IPTV multicasting. In order to obtain an efficient IPTV service ... [more] |
IA2014-42 pp.45-50 |
CPSY, DC (Joint) |
2014-07-28 13:15 |
Niigata |
Toki Messe, Niigata |
An FPGA-based Graph Processing Accelerator with PyCoRAM Shinya Takamaeda-Yamazaki, Tadahiro Edamoto, Jun Yao, Yasuhiko Nakashima (NAIST) CPSY2014-10 |
In order to improve the programmablity of FPGA-based accelerators with higher performance, we are developing PyCoRAM tha... [more] |
CPSY2014-10 pp.1-6 |
CPSY, DC (Joint) |
2014-07-28 18:15 |
Niigata |
Toki Messe, Niigata |
Performance Evaluation of Speculative Parallel Processing Utilizing Hardware Transactional Memory on Commercial Multi-core CPU Yutaka Matsuno, Kanemitsu Ootsu, Takeshi Ohkawa, Takashi Yokota (Utsunomiya Univ.) CPSY2014-16 |
Recently, it becomes essential to use parallel computation utilizing thread level parallelism as a method to utilize a s... [more] |
CPSY2014-16 pp.37-42 |
RECONF |
2014-06-12 16:25 |
Miyagi |
Katahira Sakura Hall |
Design of an FPGA-Based Accelerator for Shortest-Path Search over Large-Scale Graphs Yasuhiro Takei, Masanori Hariyama, Michitaka Kameyama (Tohoku Univ.) RECONF2014-15 |
Shortest-path search over large scale graphs plays an important role in various applications. However, shortest path alg... [more] |
RECONF2014-15 pp.79-83 |
COMP |
2012-03-16 14:10 |
Tokyo |
Univ. of Tokyo |
Sublinear Space Algorithm for Shortest Path Problem on Grid Graph Tatsuya Imai, Shunsuke Noguchi, Tetsuro Fuji (Titech) COMP2011-52 |
The shortest path problem is one of the most important problem in computer science and has many practical applications, ... [more] |
COMP2011-52 pp.39-44 |
VLD, CPSY, RECONF, IPSJ-SLDM [detail] |
2012-01-26 15:25 |
Kanagawa |
Hiyoshi Campus, Keio University |
Evaluation of Improvement Techniques for Placement and Routing on MPLD : a New Reconfigurable Device Ken Taomoto, Masato Inagi, Hideyuki Kawabata, Kazuya Tanigawa, Tetsuo Hironaka (Hiroshima City Univ), Masayuki Sato, Takashi Ishiguro (Taiyo Yuden), Toshiaki Kitamura, Masatoshi Nakamura (Hiroshima City Univ) |
(To be available after the conference date) [more] |
|
COMP |
2011-10-21 10:00 |
Miyagi |
Tohoku Univ. |
Memory-Constrained Algorithms for Shortest Path Problem Tetsuo Asano (JAIST), Benjamin Doerr (MPI) COMP2011-28 |
This paper presents a space-efficient algorithm for finding a shortest
path in a grid graph whose size is $\sqrt{n}\tim... [more] |
COMP2011-28 pp.1-5 |
KBSE |
2011-01-25 13:10 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
Data Structure that Makes Extended Dijkstra Method Work. Tomoaki Ogawa (NIT) |
Routes selection is one of the most important problems for a car navigation system.Moreover, when selecting a path, the ... [more] |
|