| Conference Date |
Thu, Jul 21, 2022 12:55 - 16:30
Fri, Jul 22, 2022 10:25 - 15:30 |
| Topics |
Freshman session, General |
| Conference Place |
Okayama Campus, Okayama University of Science |
| Address |
1-1, Ridaicho, Kita-ku, Okayama-shi, 7000-0005, Japan. |
| Transportation Guide |
From Okayama St. Main Gate: Take Okaden Bus #47 'TO OKAYAMA UNIVERSITY OF SCIENCE’ from Bus Stop #22 located at JR Okayama Station West Exit. Average travel time: 20 minutes.
https://www.ous.ac.jp/en/access/ |
Contact
Person |
Dr. Jun Asatani (Okayama University of Science) |
| Sponsors |
This conference is co-sponsored by IEEE IT Society Japan Chapter.
|
| Registration Fee |
This workshop will be held as the IEICE workshop in fully electronic publishing. Registration fee will be necessary except the speakers and participants other than the participants to workshop(s) in non-electronic publishing. See the registration fee page. We request the registration fee or presentation fee to participants who will attend the workshop(s) on IT. |
Thu, Jul 21 PM IT1 Freshman session (Hall)
Chair: Ryutaro Matsumoto (Tokyo Inst. of Tech.)
12:55 - 13:45 |
| (1) |
12:55-13:20 |
Lattice Decoding Based on Exhaustive Search over Scaling Factor |
Jiajie Xue, Kurkoski, Brian Michael (JAIST) |
| (2) |
13:20-13:45 |
Improving of Controlled Phase Shift gate based on FTM gate |
Yuki Arai, Noboru Watanabe (TUS) |
| |
13:45-14:05 |
Break ( 20 min. ) |
Thu, Jul 21 PM IT2 General (Hall)
Chair: Shigeaki Kuzuoka (Wakayama Univ.)
14:05 - 15:20 |
| (3) |
14:05-14:30 |
New algorithms for computing the correct decoding probability exponent for lossy source coding |
Yutaka Jitsumatsu (Tokyo Tech.), Yasutada Oohama (UEC) |
| (4) |
14:30-14:55 |
Relationship between Intrinsic Randomness Problem with Normalized KL Divergence and Fixed-Length Source Coding |
Ryo Nomura (Waseda Univ.) |
| (5) |
14:55-15:20 |
A Data Compression Method Where The Codeword Is a Computer Program Generating The Data |
Mitsuharu Arimura (Shonan Inst. Tech.) |
| |
15:20-15:40 |
Break ( 20 min. ) |
Thu, Jul 21 PM IT3 Invited session (Hall)
Chair: Tetsuya Kojima (National Inst. of Tech., Tokyo College)
15:40 - 16:30 |
| (6) |
15:40-16:30 |
[Invited Talk]
Open Problems on Information Theory |
Jun Muramatsu (NTT) |
Fri, Jul 22 AM IT4 Freshman session, General (Hall)
Chair: Mitsuharu Arimura (Shonan Inst. of Tech.)
10:25 - 11:15 |
| (7) |
10:25-10:50 |
Consideration of an authentication using protocol CVMA parameters |
Akane Miyoshi, Kazuma Ikesaka, Yuta Kodera, Takuya Kusaka, Yasuyuki Nogami (Okayama Univ) |
| (8) |
10:50-11:15 |
A study on deep learning-based cyber attack detection |
Ruei-Fong Hong, Qiangfu Zhao (UoA), Shih-Cheng Horng (CYUT) |
| |
11:15-11:35 |
Break ( 20 min. ) |
Fri, Jul 22 AM IT5 Freshman session (Hall)
Chair: Jun Suzuki (UEC)
11:35 - 12:25 |
| (9) |
11:35-12:00 |
Quantum-Inspired Teleportation Based on Adaptive Dynamics |
Mako Kono, Satoshi Iriyama (TUS) |
| (10) |
12:00-12:25 |
Note on Time series analysis of stock price divergence using Schrodinger equation |
Soichiro Morita, Satoshi Iriyama (TUS) |
| |
12:25-13:50 |
Lunch Break ( 85 min. ) |
Fri, Jul 22 PM IT6 Freshman session (Hall)
Chair: Jun'ichi Takeuchi (Kyushu Univ.)
13:50 - 15:30 |
| (11) |
13:50-14:15 |
An Efficient Algorithm for Optimal Decision on Piecewise Linear Regression Model by Bayes Decision Theory |
Noboru Namegaya, Koshi Shimada, Toshiyasu Matsushima (Waseda Univ.) |
| (12) |
14:15-14:40 |
A Study on Multilevel Coefficient Linear Regression Model and an Optimal Prediction for Multilevel Data by Bayes Decision Theory |
Kohei Horinouchi, Naoki Ichijo, Taisuke Ishiwatari, Toshiyasu Matsushima (Waseda Univ.) |
| (13) |
14:40-15:05 |
Meta-Tree Set Construction for Approximate Bayes Optimal Prediction on Decision Tree Model |
Keito Tajima, Naoki Ichijo, Koshi Shimada, Toshiyasu Matsushima (Waseda Univ.) |
| (14) |
15:05-15:30 |
Bayes Optimal Approximation Algorithm by Boosting-like Construction of Meta-Tree Sets in Classification on Decision Tree Model |
Ryota Maniwa, Naoki Ichijo, Koshi Shimada, Toshiyasu Matsushima (Waseda Univ.) |
:it-
c
(to IT Secretaries)