| 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 # | |
| QIT (2nd) |
2023-12-17 17:30 |
Okinawa | OIST (Primary: On-site, Secondary: Online) |
[Poster Presentation]
Assessing the PLGC Ansatz Performance in Noisy Quantum Settings: A Focus on the Toric Code [Poster presentation] Yaswitha Gujju (Univ. of Tokyo), Rong-Yang Sun, Tomonori Shirakawa, Seiji Yunoki (riken) |
In recent years, topologically ordered states have piqued interest due to their unique properties and potential applica... [more] |
|
| QIT (2nd) |
2023-12-17 17:30 |
Okinawa | OIST (Primary: On-site, Secondary: Online) |
[Poster Presentation]
Solving Not-All-Equal 3SAT using Quantum Random Access Optimization Benedek Hauer, Rudy Raymond, Hiroshi Imai (UTokyo) |
Quadratic unconstrained binary optimization (QUBO) is one of target applications of near-term quantum algorithms with ma... [more] | |
| VLD, DC, RECONF, ICD, IPSJ-SLDM [detail] | 2023-11-17 14:50 |
Kumamoto | Civic Auditorium Sears Home Yume Hall (Primary: On-site, Secondary: Online) |
An Improved Routing Method by SAT for Set-Pair Routing Problem Koki Nagakura, Kunihiro Fujiyoshi (TUAT)  VLD2023-77 ICD2023-85 DC2023-84 RECONF2023-80 |
A set-pair routing problem is a single-layer routing problem in which combinations of these pins to be connected by rout... [more] | VLD2023-77 ICD2023-85 DC2023-84 RECONF2023-80 pp.243-248 |
| EMM, BioX, ISEC, SITE, ICSS, HWS, IPSJ-CSEC, IPSJ-SPT [detail] | 2023-07-25 09:20 |
Hokkaido | Hokkaido Jichiro Kaikan | SAT-based Differential analysis of AEGIS Family Takuro Shiraya (UOH), Kosei Sakamoto (Mitsubishi Electric), Takanori Isobe (UOH) ISEC2023-45 SITE2023-39 BioX2023-48 HWS2023-45 ICSS2023-42 EMM2023-45 |
We evaluate the security of the AEGIS family which is authenticated encryption with an associated data scheme to achieve... [more] | ISEC2023-45 SITE2023-39 BioX2023-48 HWS2023-45 ICSS2023-42 EMM2023-45 pp.202-207 |
| EMM, BioX, ISEC, SITE, ICSS, HWS, IPSJ-CSEC, IPSJ-SPT [detail] | 2023-07-25 09:40 |
Hokkaido | Hokkaido Jichiro Kaikan | SAT-based Search of Related-key Impossible Distinguisher for Piccolo, TWINE, LBlock Shion Utsumi (Univ. of Hyogo), Kosei Sakamoto (MELCO), Takanori Isobe (Univ. of Hyogo) ISEC2023-46 SITE2023-40 BioX2023-49 HWS2023-46 ICSS2023-43 EMM2023-46 |
In this paper, we evaluate security of Piccolo, TWINE, T-TWINE and LBlcok angainst on impossilbe related-key differentia... [more] | ISEC2023-46 SITE2023-40 BioX2023-49 HWS2023-46 ICSS2023-43 EMM2023-46 pp.208-213 |
| EMM, BioX, ISEC, SITE, ICSS, HWS, IPSJ-CSEC, IPSJ-SPT [detail] | 2023-07-25 10:20 |
Hokkaido | Hokkaido Jichiro Kaikan | On the Maximum Differential Characteristic Probabilities for Multi-Branch Structures Kazuma Taka (Hyogo Univ.), Kosei Sakamoto (Mitsubishi Electric), Takanori Isobe (Hyogo Univ.) ISEC2023-48 SITE2023-42 BioX2023-51 HWS2023-48 ICSS2023-45 EMM2023-48 |
The design of multiple-branch-based designs, such as the low-latency pseudo-random function Orthros, holds the potential... [more] | ISEC2023-48 SITE2023-42 BioX2023-51 HWS2023-48 ICSS2023-45 EMM2023-48 pp.221-228 |
| IPSJ-SLDM, RECONF, VLD [detail] | 2023-01-24 14:20 |
Kanagawa | Raiosha, Hiyoshi Campus, Keio University (Primary: On-site, Secondary: Online) |
Leveraging dynamic parameter for solution search acceleration in bio-inspired hardware SAT solver Anh Hoang Ngoc Nguyen (Fujitsu ltd.) VLD2022-71 RECONF2022-94 |
For decision making, various systems need to solve combinatorial optimization problems, which are often encoded as a Sat... [more] | VLD2022-71 RECONF2022-94 pp.68-73 |
| QIT (2nd) |
2022-12-08 14:00 |
Kanagawa | Keio Univ. (Primary: On-site, Secondary: Online) |
[Poster Presentation]
Application of Sequential minimal Optimization Methods to UCCSD ansatz Yuichiro Tashima (Osaka Univ.), Kosuke Ito, Hideaki Hakoshima (Osaka Univ. QIQB), Kosuke Mitarai, Keisuke Fujii (Osaka Univ.) |
Variational quantum eigensolver (VQE) is expected to be applied to quantum chemical calculations. This algorithm uses p... [more] |
|
| VLD, DC, RECONF, ICD, IPSJ-SLDM [detail] | 2022-11-28 13:55 |
Kumamoto | (Primary: On-site, Secondary: Online) |
A Routing Method by SAT for Set-Pair Routing Problem Koki Nagakura, Rintaro Yokoya, Kunihiro Fujiyoshi (Tokyo Univ of A and T) VLD2022-21 ICD2022-38 DC2022-37 RECONF2022-44 |
Set-pair routing problem is a single-layer routing problem in which a one-to-one connection is made between equal number... [more] | VLD2022-21 ICD2022-38 DC2022-37 RECONF2022-44 pp.13-18 |
| VLD, HWS [detail] | 2022-03-08 11:25 |
Online | Online | A Method for Automatic Test Pattern Generation using an SMT Solver for HDL Code Ryoichi Isawa, Nobuyuki Kanaya, Yoshitada Fujiwara, Tatsuta Takehisa, Hayato Ushimaru, Dai Arisue, Daisuke Makita, Satoshi Mimura, Daisuke Inoue (NICT) VLD2021-95 HWS2021-72 |
(To be available after the conference date) [more] | VLD2021-95 HWS2021-72 pp.105-110 |
| RECONF | 2021-06-09 15:00 |
Online | Online | An implementation of a satisfiability problem solver : Amoeba SAT on M-KUBOS board Yan Ying Jie, Masashi Aono, Hideharu Amano (Keio Univ.), Kaori Ohkoda, Shingo Fukuda, Saito Kenta (Amoeba Energy), Seiya Kasai (Hokkaido Univ.) RECONF2021-13 |
(To be available after the conference date) [more] | RECONF2021-13 pp.68-73 |
| MSS, SS | 2021-01-27 15:00 |
Online | Online | Speeding up combinatorial optimization solver CombSQL+ by introducing Pseudo-Boolean constraints Junichiro Kishi, Masahiko Sakai, Naoki Nishida, Kenji Hashimoto (Nagoya univ.) MSS2020-40 SS2020-25 |
The authors have proposed a solver CombSQL+ for combinatorial optimization problems (COPs) described in extended SQL lan... [more] | MSS2020-40 SS2020-25 pp.66-71 |
| QIT (2nd) |
2020-12-10 13:00 |
Online | Online | [Poster Presentation]
Implementing CSP Solver with Annealing Taisei Ozu (Nagoya Univ.) |
Many problems in the world are given by formulation of Constraint Satisfaction Problem (CSP), and typically it is conver... [more] | |
| HWS, VLD [detail] | 2020-03-06 14:30 |
Okinawa | Okinawa Ken Seinen Kaikan (Cancelled but technical report was issued) |
A Test Generation Method for Resistive Open Faults Using Partial MAX-SAT solver Hiroshi Yamazaki, Yuta Ishiyama, Tatsuma Matsuta, Toshinori Hosokawa (Nihon Univ.), Masayoshi Yoshimura (Kyoto Sangyo Univ.), Masayuki Arai (Nihon Univ.), Hiroyuki Yotsuyanagi, Masaki Hashizume (Tokushima Univ.) VLD2019-131 HWS2019-104 |
In VLSI testing, stuck-at fault model and transition fault model have been widely used. However, with advance of semicon... [more] | VLD2019-131 HWS2019-104 pp.215-220 |
| DC | 2020-02-26 14:10 |
Tokyo | A Don’t Care Identification-Filling Co-Optimization Method for Low Power Testing Using Partial Max-SAT Kenichiro Misawa, Toshinori Hosokawa, Hiroshi Yamazaki (Nihon Univ), Masayoshi Yoshimura (Kyouto Sangyo Univ), Masayuki Arai (Nihon Univ) DC2019-92 |
Recently, in at-speed scan testing, excessive capture power dissipation is a serious problem. Low capture power test gen... [more] | DC2019-92 pp.37-42 |
|
| SITE | 2019-12-06 13:50 |
Kanagawa | Deciding Equivalence of The Rule List Policies via SAT solver Takashi Fuchino (Kanagawa Univ.), Takashi Harada (Kochi Univ. of Tech), Ken Tanaka (Kanagawa Univ.), Kenji Mikawa (Niigata Univ.) SITE2019-82 |
Packet classification is to determine the behaviors of packets incoming to network devices. Since it is achieved using l... [more] | SITE2019-82 pp.13-19 |
|
| NLP, CAS | 2019-10-22 09:15 |
Gifu | Gifu Univ. | Constraint Satisfaction Problem Solver by Hysteresis Neural Networks Takumi Genka, Kenya Jin'no (Tokyo City Univ.) CAS2019-24 NLP2019-64 |
Since solving Constraint Satisfaction Problems (CSPs) is very important, therefore, many solving methods are proposed. T... [more] | CAS2019-24 NLP2019-64 pp.7-10 |
| SS | 2019-03-04 16:45 |
Okinawa | SQL queries for generating input constraints of SMT solvers from descriptions of combinatorial optimization problems Genki Sakanashi, Masahiko Sakai, Naoki Nishida, Kenji Hashimoto (Nagoya Univ.) SS2018-66 |
The authors recently proposed an SQL-based language CombSQL+ for specifying combinatorial optimization problems, and sho... [more] | SS2018-66 pp.85-90 |
|
| KBSE | 2018-03-02 15:20 |
Okinawa | A Constraint Optimization Method for Cloud Service Composition Shridhar Choudhary, Kosaku Kimura, Atsuji Sekiguchi (FLL) KBSE2017-51 |
With advent of multiple cloud services with similar functionalities, selecting cloud services for a composite cloud serv... [more] | KBSE2017-51 pp.73-77 |
|
| CAS, MSS, IPSJ-AL [detail] | 2017-11-17 16:30 |
Tokyo | A SAT-based method for generating locating arrays Tatsuya Konishi, Hideharu Kojima, Hiroyuki Nakagawa, Tatsuhiro Tsuchiya (Osaka Univ.) CAS2017-62 MSS2017-46 |
In this paper, we discuss combinatorial interaction testing, which is a well-known software testing strategy.Especially,... [more] | CAS2017-62 MSS2017-46 pp.147-152 |
|
[Return to Top Page]