Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
CAS, CS |
2024-03-14 16:20 |
Okinawa |
|
An Approximate Solution Using K-Shortest Path and Reinforcement Learning for a Load Balancing Problem in Communication Networks Himeno Takahashi, Norihiko Shinomiya (Soka Univ.) CAS2023-123 CS2023-116 |
In recent years, the amount of data traffic in information and communication networks has been increasing and the risk o... [more] |
CAS2023-123 CS2023-116 pp.70-73 |
NLP, MSS |
2024-03-14 11:15 |
Misc. |
Kikai-Shinko-Kaikan Bldg. |
Parallelization of a Search Algorithm for Regular Graphs with Minimum Average Shortest Path Length Taku Hirayama, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) MSS2023-89 NLP2023-141 |
Computer networks in data centers are modeled as regular graphs, and the average shortest path length (ASPL) of such a g... [more] |
MSS2023-89 NLP2023-141 pp.87-92 |
SIP, SP, EA, IPSJ-SLP [detail] |
2024-02-29 16:20 |
Okinawa |
(Primary: On-site, Secondary: Online) |
EA2023-77 SIP2023-124 SP2023-59 |
In this paper, we consider a dynamic sensor placement problem where sensors can move within a network over time. Sensor ... [more] |
EA2023-77 SIP2023-124 SP2023-59 pp.97-102 |
VLD, HWS, ICD |
2024-03-01 15:30 |
Okinawa |
(Primary: On-site, Secondary: Online) |
A Pipelined NTT Transformer and its Extension Scheme Designed for the Digital Signature Scheme Crystals-Dilithium Pengfei Sun, Makoto Ikeda (Tokyo Univ.) VLD2023-130 HWS2023-90 ICD2023-119 |
As quantum computing advances, it threatens the security of current encryption algorithms, making Post-Quantum Cryptogra... [more] |
VLD2023-130 HWS2023-90 ICD2023-119 pp.161-166 |
ICTSSL, CAS |
2024-01-26 11:50 |
Kanagawa |
(Primary: On-site, Secondary: Online) |
On extension of distance coloring of graphs and the number of colors Hiroshi Tamura (Chuo Univ.), Kazuyuki Miyakita, Kazuyuki Miyakita (Niigata Univ.) CAS2023-102 ICTSSL2023-55 |
The relation of channel assignment problems in wireless communications and coloring problems of graph theory is well-kno... [more] |
CAS2023-102 ICTSSL2023-55 pp.97-100 |
ICTSSL, CAS |
2024-01-26 16:35 |
Kanagawa |
(Primary: On-site, Secondary: Online) |
An approximate solution using Cutting Plane Method for a communication link load balancing problem Taizo Takeuchi, Himeno Takahashi, Norihiko Shinomiya (Soka Univ) CAS2023-110 ICTSSL2023-63 |
Addressing Congestion Risks Arising from Increased Data Traffic in Information and Communication Networks. In previous r... [more] |
CAS2023-110 ICTSSL2023-63 pp.127-130 |
IN, IA (Joint) |
2023-12-21 12:30 |
Hiroshima |
Satellite Campus Hiroshima |
[Short Paper]
A Study on the Importance of Spectral Representation of Subgraphs with Different Sampling Strategies Koki Kato, Ryo Nakamura (Fukuoka Univ.) IA2023-43 |
Spectral graph theory has been actively studied to analyze topological property of networks using eigenvalues and eigenv... [more] |
IA2023-43 pp.1-4 |
MSS, CAS, IPSJ-AL [detail] |
2023-11-17 09:45 |
Okinawa |
|
Analyzing the impact of shrink rates on equity in peer-to-peer energy transactions Eiichi Kusatake, Norihiko Shinomiya (Soka Univ.) CAS2023-74 MSS2023-44 |
In recent times, numerous nations have been actively endorsing distributed energy systems to promote the use of clean en... [more] |
CAS2023-74 MSS2023-44 pp.75-79 |
VLD, DC, RECONF, ICD, IPSJ-SLDM [detail] |
2023-11-16 15:55 |
Kumamoto |
Civic Auditorium Sears Home Yume Hall (Primary: On-site, Secondary: Online) |
Calculation of Isomorphic/Similar Topology using Graph Theory Yuto Moriguchi, Nobukazu Takai (KIT) VLD2023-55 ICD2023-63 DC2023-62 RECONF2023-58 |
In an automatic integrated circuit design, huge number of circuits are generated and simulated, so the efficiency of cir... [more] |
VLD2023-55 ICD2023-63 DC2023-62 RECONF2023-58 pp.131-135 |
SS, DC |
2023-10-12 10:00 |
Nagano |
(Primary: On-site, Secondary: Online) |
A game-theoretic approach to indistinguishability of winning objectives as user privacy Rindo Nakanishi (Nagoya Univ.), Yoshiaki Takata (KUT), Hiroyuki Seki (Nagoya Univ.) SS2023-27 DC2023-33 |
We propose a new game-theoretic framework for studying the privacy protection of a user
who interactively uses a softwa... [more] |
SS2023-27 DC2023-33 pp.32-37 |
NLP, CAS |
2023-10-07 13:40 |
Gifu |
Work plaza Gifu |
Expantion of Graph Fourier Transform Based on Degree of Freedom at Circuit Ports Ayumu Suzuki, Takashi Hisakado, Mahfuzul Islam (Kyoto Univ.) CAS2023-56 NLP2023-55 |
In this paper, we define the boundary condition of graph.
Recently, graph signal processing is attracting attention.
H... [more] |
CAS2023-56 NLP2023-55 pp.117-120 |
LQE, OPE, CPM, EMD, R |
2023-08-25 11:00 |
Miyagi |
Tohoku university (Primary: On-site, Secondary: Online) |
[Invited Talk]
Functional Micro-Optical Elements Based on Dielectric Metasurface Kentaro Iwami (TUAT) R2023-31 EMD2023-26 CPM2023-36 OPE2023-75 LQE2023-22 |
Metasurfaces based on dielectric nanostructures have attracted much attention because of their potential applications in... [more] |
R2023-31 EMD2023-26 CPM2023-36 OPE2023-75 LQE2023-22 pp.71-76 |
ICTSSL |
2023-07-28 10:25 |
Kumamoto |
(Primary: On-site, Secondary: Online) |
On extension of distance coloring of graphs Hiroshi Tamura (Chuo Univ.), Keisuke Nakano (Niigata Univ.) ICTSSL2023-20 |
The relation of channel assignment problems in wireless communications and coloring problems of graph theory is well-kno... [more] |
ICTSSL2023-20 pp.37-40 |
CQ |
2023-07-12 14:00 |
Hokkaido |
(Primary: On-site, Secondary: Online) |
Study on the Effectiveness of Matrix Approximation without Rank Constraint Eriko Segawa, Yusuke Sakumto (Kwansei Gakuin Univ.) CQ2023-10 |
The proper selection of graph spectrum is crucial for constructing efficient graph algorithms. We have discussed a matri... [more] |
CQ2023-10 pp.12-17 |
CQ |
2023-07-12 14:25 |
Hokkaido |
(Primary: On-site, Secondary: Online) |
Statistical Evaluation of WSD-based Network Metrics for Brain Connectome Analysis Mikihiro Yasuda, Taiki Sasagawa, Yusuke Sakumoto (Kwansei Gakuin Univ.) CQ2023-11 |
We have proposed network metrics based on the weighted spectral distribution (WSD) to analyze the connectome observed at... [more] |
CQ2023-11 pp.18-23 |
MSS, CAS, SIP, VLD |
2023-07-07 11:20 |
Hokkaido |
(Primary: On-site, Secondary: Online) |
Enhancing Glycan Recognition Pattern Learning with Tree-Structured Data Mining Kento Totsuka, Norihiko Shinomiya, Kiyoko Kinoshita, Masae Hosoda (Soka Univ.) CAS2023-20 VLD2023-20 SIP2023-36 MSS2023-20 |
In recent times, the rapid proliferation of semi-structured data has been primarily fueled by the emergence of the World... [more] |
CAS2023-20 VLD2023-20 SIP2023-36 MSS2023-20 pp.97-101 |
IA, ICSS |
2023-06-21 09:55 |
Saga |
Saga Univ. (Primary: On-site, Secondary: Online) |
A Proposal for Access Control Method based on File Relation Inference from Users Behavior Yuki Kodaka (SOKENDAI), Hirokazu Hasegawa, Hiroki Takakura (NII) IA2023-8 ICSS2023-8 |
File access control is an effective method for protecting information from unauthorized access both within and outside a... [more] |
IA2023-8 ICSS2023-8 pp.40-47 |
TL |
2023-06-10 13:30 |
Online |
(Primary: Online, Secondary: On-site) |
Two Cognitive Processes - Quantitive and Relational Meanings and Modes of Thought Hiroshi Sano (TUFS) TL2023-5 |
In the previous article (TL2022-40), the author focused on the two cognitive processes of recognizing things and explain... [more] |
TL2023-5 pp.17-22 |
ICTSSL |
2023-05-19 11:15 |
Niigata |
(Primary: On-site, Secondary: Online) |
On the probability of coloring with the maximum number of colors in graphs Hiroshi Tamura (Chuo Univ.), Keisuke Nakano (Niigata Univ.) ICTSSL2023-12 |
The relation of channel assignment problems in wireless communications and coloring problems of graph theory is well-kno... [more] |
ICTSSL2023-12 pp.62-65 |
IMQ, IE, MVE, CQ (Joint) [detail] |
2023-03-15 11:00 |
Okinawa |
Okinawaken Seinenkaikan (Naha-shi) (Primary: On-site, Secondary: Online) |
Evaluating the Efficiency of Anomaly Detection Methods for Temporal Networks Using the Graph Spectrum Masataka Nagao, Eriko Segawa, Yusuke Sakumoto (Kwansei Gakuin Univ.) CQ2022-83 |
LAD (Laplacian Anomaly Detection) is a method for detecting anomalies in dynamic networks using the eigenvalues (the gra... [more] |
CQ2022-83 pp.19-24 |