| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| RCC, ISEC, IT, WBS | 2024-03-14 17:00 |
Osaka | Osaka Univ. (Suita Campus) | Reconstruction of Boyer quantum algorithm and its application to hash puzzles Chris Idota, Yuichi Kaji (Nagoya Univ.)  IT2023-132 ISEC2023-131 WBS2023-120 RCC2023-114 |
This study investigates the computational complexity of solving hash puzzles using quantum algorithms. A hash puzzle is ... [more] | IT2023-132 ISEC2023-131 WBS2023-120 RCC2023-114 pp.358-365 |
| QIT (2nd) |
2023-12-17 17:30 |
Okinawa | OIST (Primary: On-site, Secondary: Online) |
[Poster Presentation]
Improvement of Quantum Read-only Memory and its Application to Resource Evaluation for Factoring Small Integers on NISQ Devices Kiyonari Katsura, Noboru Kunihiro (Tsukuba Univ.) |
The discovery of Shor's algorithm for integer factorization has revealed the potential vulnerability of current cryptogr... [more] | |
| EMT, IEE-EMT | 2023-11-10 11:10 |
Yamaguchi | Kaikyo Messe Shimonoseki | A Single-Layer Dual-Band Reflectarray with Orthogonal Polarization Multi-Beam and Single-Beam Ranges Kosei Inoue, Hiroyuki Deguchi, Mikio Tsuji (Doshisha Univ.) EMT2023-74 |
In this paper, as a construction method for a single-layer reflectarray that shares widely separated frequency bandsand ... [more] | EMT2023-74 pp.64-69 |
| MIKA (3rd) |
2023-10-11 14:30 |
Okinawa | Okinawa Jichikaikan (Primary: On-site, Secondary: Online) |
[Poster Presentation]
Performance Evaluation of Swarm Intelligences Using Evaluation Space Construction Method for Flower Search Daigo Hasegawa, Takuya Shindo, Takefumi Hiraguri, Nobuhiko Itoh (NIT) |
Bumblebees have been introduced to pollinate tomatoes in greenhouse cultivation to save labor. However, bee ac- tivity d... [more] | |
| NS | 2023-10-04 13:50 |
Hokkaido | Hokkaidou University + Online (Primary: On-site, Secondary: Online) |
A Proposal of Evaluation Space Construction Method for Flower Search by Drones with Swarm Intelligences Daigo Hasegawa, Takuya Shindo, Takefumi Hiraguri, Nobuhiko Itoh (NIT) NS2023-73 |
Bumblebees have been introduced to pollinate tomatoes in greenhouse cultivation to save labor. However, bee activity dec... [more] | NS2023-73 p.27 |
| R | 2023-03-10 15:50 |
Hiroshima | (Primary: On-site, Secondary: Online) |
Search Space Reduction using Neighborhood in Genetic Algorithm Natsumi Takahashi, Tetsushi Yuge (NDA), Tomoaki Akiba (CIT) R2022-54 |
In this study, we consider two-objective network design problem with all-terminal reliability and construction costs. Th... [more] | R2022-54 pp.37-40 |
| PRMU, IBISML, IPSJ-CVIM [detail] | 2023-03-03 17:10 |
Hokkaido | Future University Hakodate (Primary: On-site, Secondary: Online) |
Forest Construction of Gaussian and Discrete Variables based on WBIC Ashraful Islam, Joe Suzuki (Osaka Univ.) PRMU2022-126 IBISML2022-133 |
Mutual information is a metric that determines the association between two random variables by measuring the amount of i... [more] | PRMU2022-126 IBISML2022-133 pp.371-377 |
| NS, ICM, CQ, NV (Joint) |
2022-11-24 10:20 |
Fukuoka | Humanities and Social Sciences Center, Fukuoka Univ. + Online (Primary: On-site, Secondary: Online) |
Social Surplus Maximization Using Incentive Mechanism for Cross-Silo Federated Learning with Differential Privacy Shota Miyagoshi, Takuji Tachibana (Univ. Fukui) NS2022-101 |
In cross-silo federated learning, where multiple organizations participate, the prediction accuracy of the global model ... [more] | NS2022-101 pp.7-12 |
| SIP | 2022-08-25 16:30 |
Okinawa | Nobumoto Ohama Memorial Hall (Ishigaki Island) (Primary: On-site, Secondary: Online) |
[Invited Talk]
Approximate Message Passing for Efficient Grant-Free Access Takanori Hara (Tokyo Univ. of Science) SIP2022-59 |
To accommodate a large number of users efficiently, grant-free non-orthogonal multiple access has gained much attention.... [more] | SIP2022-59 pp.50-55 |
| COMP, IPSJ-AL | 2022-05-19 14:55 |
Online | Online | A Self-Stabilizing Algorithm to Construct Node Disjoint Paths between Two Senders and Targets on a Biconnected Graph Takuma Kitaoka, Yonghwan Kim, Yoshiaki Katayama (NITech) COMP2022-4 |
A path is a sequence of consecutive nodes in the graph, and two paths are disjoint if the nodes included in the two path... [more] | COMP2022-4 pp.25-32 |
| IT, ISEC, RCC, WBS | 2022-03-10 14:40 |
Online | Online | Crypto Analysis for Ring-LWE Problem on Subfield in Cyclotomic Field Satoshi Uesugi, Shinya Okumura, Atsuko Miyaji (OU) IT2021-106 ISEC2021-71 WBS2021-74 RCC2021-81 |
Since the proposal of the quantum computer, steady progress has been made toward its practical use. It has been reported... [more] | IT2021-106 ISEC2021-71 WBS2021-74 RCC2021-81 pp.138-144 |
| QIT (2nd) |
2021-11-30 10:30 |
Online | Online | Quantum computational approach for topological data analysis
-- Quantum algorithm for persistent Betti numbers -- Ryu Hayakawa (Kyoto Univ.) |
Topological data analysis (TDA) based on persistent homology is an emergent field of data analysis. The critical step of... [more] | |
| RISING (3rd) |
2021-11-17 09:00 |
Tokyo | (Primary: On-site, Secondary: Online) |
Proposal of Incentive Mechanism for Cross-Silo Federated Learning with Differential Privacy Shota Miyagoshi, Takuji Tachibana (Univ. Fukui) |
In cross-silo federated learning, where multiple companies/organizations participate, the prediction accuracy of the glo... [more] | |
| COMP, IPSJ-AL | 2021-05-08 11:30 |
Online | Online | Experimental analysis of a classical algorithm spoofing linear cross-entropy benchmarking Kensuke Suzuki, Akinori Kawachi (Mie Univ.) COMP2021-7 |
Quantum computers are expected to be exponentially faster than classical computers in a specific computational task (qua... [more] | COMP2021-7 pp.46-53 |
| SITE, ISEC, HWS, EMM, BioX, IPSJ-CSEC, IPSJ-SPT, ICSS [detail] | 2020-07-20 15:45 |
Online | Online | Quantum Attacks on the Sum of Even-Mansour Pseudorandom Function Kazuo Shinagawa, Tetsu Iwata (Nagoya Univ.) ISEC2020-21 SITE2020-18 BioX2020-24 HWS2020-14 ICSS2020-8 EMM2020-18 |
At CRYPTO~2019, a method to construct a pseudorandom function from public random permutations was presented. In this pap... [more] | ISEC2020-21 SITE2020-18 BioX2020-24 HWS2020-14 ICSS2020-8 EMM2020-18 pp.47-51 |
| NS | 2020-05-14 16:00 |
Online | Online | Virtual CCN Construction with Multi-Objective Optimization Problem to Realize Efficient Content Delivery in Limited Network Resources Takumi Morioka, Yasuhiro Urayama (NIT, Kochi College) NS2020-11 |
In the communication network, a lot of kinds of digital contents, such as video on demand and digital book, have been de... [more] | NS2020-11 pp.13-17 |
| SP, EA, SIP | 2020-03-02 13:00 |
Okinawa | Okinawa Industry Support Center (Cancelled but technical report was issued) |
[Poster Presentation]
Restoration of clipped signal using oversampling based on differentiable and convex loss function Natsuki Ueno, Shoichi Koyama, Hiroshi Saruwatari (Univ. Tokyo) EA2019-126 SIP2019-128 SP2019-75 |
A signal reconstruction method of clipped time-continuous signal using oversampling is proposed. The signal reconstructi... [more] | EA2019-126 SIP2019-128 SP2019-75 pp.147-152 |
| ITE-HI, IE, ITS, ITE-MMS, ITE-ME, ITE-AIT [detail] | 2020-02-27 13:30 |
Hokkaido | Hokkaido Univ. (Cancelled but technical report was issued) |
A Note on Estimation of rock compressive strength index from drilling data based on online learning Kentaro Yamamoto, Ren Togo, Takahiro Ogawa, Miki Haseyama (Hokkaido Univ.) |
It is necessary to evaluate the ground condition of the rock mass for safe and efficient tunnel construction. Currently,... [more] | |
| IT | 2019-11-26 14:25 |
Kagoshima | Kirishima Kokusai Hotel | [Invited Talk]
Zigzag Decodable Fountain Codes Takayuki Nozaki (Yamaguchi Univ.) IT2019-32 |
Fountain codes are erasure correcting codes which realize reliable communication in the multicasting. Zigzag decodable c... [more] | IT2019-32 pp.1-6 |
| COMP | 2019-09-02 11:25 |
Okayama | Tsushima Campus, Okayama University | Speeding-up of Construction Algorithms for the Graph Coloring Problem Kazuho Kanahara, Kengo Katayama (OUS), Etsuji Tomita (UEC), Takeshi Okano, Takahumi Miyake, Noritaka Nishihara (OUS) COMP2019-11 |
DSATUR and RLF are well known as typical solution construction algorithms for the graph coloring problem, GCP, where GCP... [more] | COMP2019-11 pp.7-14 |
[Return to Top Page]