| 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 # | |
| SRW | 2023-06-12 14:00 |
Tokyo | Kikai-Shinko-Kaikan Bldg. (Primary: On-site, Secondary: Online) |
[Invited Lecture]
Low Complexity Multi-Targets Super-Resolution Azimuth-Ranging of FMCW Radar Kento Ogawa (Keio Univ. (Current: JSOL)), Osamu Tokumasu, Jin Mitsugi (Keio Univ.)  SRW2023-7 |
This paper proposes a low-complexity multi-targets super-resolution AZ-EL ranging of FMCW radar. The complexity reductio... [more] | SRW2023-7 pp.33-38 |
| SIS | 2023-03-03 10:50 |
Chiba | Chiba Institute of Technology (Primary: On-site, Secondary: Online) |
SIS2022-51 |
The sound environment is protected by noise level regulations based on the law, and the number of noise complaints conti... [more] | SIS2022-51 pp.58-63 |
| RCS, SR, SRW (Joint) |
2023-03-01 13:25 |
Tokyo | Tokyo Institute of Technology, and Online (Primary: On-site, Secondary: Online) |
Interference Coordination in A Cellular Distributed MU-MIMO System
-- Intra-cell Interference Coordination -- Ryo Takahashi, Hidenori Matsuo, Fumiyuki Adachi (Tohoku Univ.) RCS2022-256 |
Cellular distributed multiuser MIMO (MU-MIMO) is a cellular system in which a wide communication service area is divided... [more] | RCS2022-256 pp.54-59 |
| SAT, RCS (Joint) |
2022-08-25 11:40 |
Hokkaido | (Primary: On-site, Secondary: Online) |
A Study on Computational Complexity Reduction of Pre/Postcoding in User-Cluster-Centric CF-mMIMO Ryo Takahashi, Hidenori Matsuo, Sijie Xia, Qiang Chen, Fumiyuki Adachi (Tohoku Univ.) RCS2022-101 |
Cell-Free massive MIMO (CF-mMIMO), which cooperatively utilizes a large number of antennas deployed over a wide communic... [more] | RCS2022-101 pp.24-29 |
| AP, RCS (Joint) |
2021-11-10 14:55 |
Nagasaki | NBC-Bekkan (Nagasaki) (Primary: On-site, Secondary: Online) |
Computational Complexity Reduction of High Accuracy Fingerprint Method by using Last Received Data on Time Series and correcting Receiving Performance deference Takahiro Tsujino, Teruya Fujii (Tokyo Tech) RCS2021-151 |
As a location detection method without using GPS, there is a fingerprint method. It measures the received radio wave pow... [more] | RCS2021-151 pp.40-45 |
| WBS, IT, ISEC | 2021-03-04 11:45 |
Online | Online | Streaming Data Compression and Decompression by One-Way Quantum Finite-State Automata, Leading to Quantum Finite-State Deep and Shallow Information (Preliminary Report) Tomoyuki Yamakami (U of Fukui) IT2020-117 ISEC2020-47 WBS2020-36 |
The logical depth of a piece of data has served as a complexity measure to describe the amount of “useful” and "non-ran... [more] |
IT2020-117 ISEC2020-47 WBS2020-36 pp.31-36 |
| SIS | 2021-03-04 10:40 |
Online | Online | Effect of Environmental Sound from Outside of Building to Inside by Using Fractal Dimension Yoshiaki Makabe (Kanagawa Institute of Technology), Kenji Muto, Hideo Shibayama (Shibaura Institute of Technology), Tomoaki Kimura (Kanagawa Institute of Technology) SIS2020-40 |
We are conducting the study of evaluating method for environmental sound using complexity of time series wave of amplitu... [more] | SIS2020-40 pp.27-32 |
| SIS | 2021-03-04 15:00 |
Online | Online | [Tutorial Lecture]
The Analysis of a Sound Wave Complexity for Keeping Sound Environment Yoshiaki Makabe (Kanagawa Institute of Technology), Kenji Muto, Hideo Shibayama (Shibaura Institute of Technology), Tomoaki Kimura (Kanagawa Institute of Technology) SIS2020-49 |
We are conducting the study of evaluating method for environmental sound using complexity of time series wave of amplitu... [more] | SIS2020-49 pp.77-82 |
| QIT (2nd) |
2018-11-26 09:50 |
Tokyo | The University of Tokyo | Non-Uniform State Complexity of Quantum Finite Automata and Quantum Polynomial-Time Logarithmic-Space Computation with Quantum Advice
-- (Preliminary Report) -- Tomoyuki Yamakami (U of Fukui) |
The state complexity of a finite(-state) automaton intuitively measures the size of the description of the automaton. Sa... [more] | |
| COMP | 2018-10-26 15:00 |
Kyoto | Kyoto University | Upper and lower bounds on the OBDD-width of a special integer multiplication Tong Qin (Tokyo Tech) COMP2018-27 |
We consider a Boolean function ${rm SMul}_{n-1}^n$ that computes the middle bit of the multiplication of two natural num... [more] | COMP2018-27 pp.45-54 |
| ET | 2018-03-03 15:25 |
Kochi | Kochi University of Technology (Eikokuji Campus) | Yuta Nakamura, Hidetake Uwano (NIT,Nara) ET2017-116 |
Source code understanding is highly time consuming task. Software developers are required to implement "readable code" a... [more] | ET2017-116 pp.159-164 |
| IBISML | 2017-11-10 13:00 |
Tokyo | Univ. of Tokyo | IBISML2017-85 |
We consider binary classification problems using local features of objects. One of motivating applications is time-serie... [more] | IBISML2017-85 pp.361-368 |
| SIS | 2016-12-08 16:40 |
Hiroshima | Hiroshima City Univ. | The Fractal dimension of the environmental sound wave measured around airport. Yoshiaki Makabe, Tomoaki Kimura (Kanagawa Institute of Technology), Kenji Muto (Shibaura Institute of Technology) SIS2016-40 |
We evaluate the environmental sound by its pressure level and frequency analysis. In fact, we don’t have good feeling wh... [more] | SIS2016-40 pp.65-70 |
| COMP | 2015-09-01 10:30 |
Nagano | Impossibility of Classically Simulating One-Clean-Qubit Computation Keisuke Fujii (Kyoto Univ.), Hirotada Kobayashi (NII), Tomoyuki Morimae (Gunma Univ.), Harumichi Nishimura (Nagoya Univ.), Shuhei Tamate (NII), Seiichiro Tani (NTT) COMP2015-17 |
Deterministic quantum computation with one quantum bit (DQC1) is a restricted model of quantum computing where the input... [more] | COMP2015-17 pp.5-12 |
|
| HIP | 2015-03-02 15:50 |
Hokkaido | Effects of the Presence of the Audience on the Violinist's Heart-Rate Variability and Complexity Haruka Shoda, Mamiko Sakata (Doshisha Univ.), Aaron Williamon (RCM) HIP2014-85 |
Shoda and Adachi (2015) reported that the presence of the audience enhances the pianist's performance when he/she perfor... [more] | HIP2014-85 pp.29-34 |
|
| COMP, IPSJ-AL | 2014-06-14 10:30 |
Ehime | Matsuyama, Ehime | On Characterizations of Randomized Computation Using Plain Kolmogorov Complexity Shuichi Hirahara, Akitoshi Kawamura (Univ. of Tokyo) COMP2014-12 |
Allender, Friedman, and Gasarch recently proved an upper bound of PSPACE for the class $DTTR_K$ of decidable language... [more] |
COMP2014-12 pp.77-83 |
| MI | 2014-01-27 13:30 |
Okinawa | Bunka Tenbusu Kan | Evaluation of chest X-ray images using fractal dimension including contrast sensitivity function of human eyes Shun Endo, Yongbum Lee, Du-Yih Tsai (Niigata Univ.), Takeshi Hara (Gifu Univ.) MI2013-119 |
Objective evaluation, e.g. using MTF or NPS, of X-ray imaging system may not correctly correspond to subject evaluation,... [more] | MI2013-119 pp.331-334 |
| COMP | 2013-12-20 14:50 |
Okinawa | Okinawa Industry Support Center | Sensitivity, Block Sensitivity, and Certificate Complexity of Unate Functions and Read-Once Functions Hiroki Morizumi (Shimane Univ.) COMP2013-46 |
Sensitivity, block sensitivity, and certificate complexity are complexity measures for Boolean functions. In this note, ... [more] | COMP2013-46 pp.53-55 |
| IT | 2013-05-24 14:45 |
Fukui | Hotel Matuya Sensen at Awara-onsen, Fukui Pref. | String complexity based on reduplicative parsing and its application to randomness testing Shigeru Maya, Hirosuke Yamamoto (Univ. of Tokyo) IT2013-8 |
A randomness test based on LZ-compelxity was included in the NIST statistical test suite. However, it was removed becaus... [more] | IT2013-8 pp.35-40 |
| IT | 2013-01-21 14:45 |
Tokyo | Univ. of Electro-Communications | Complexity as E2E Network Performance Estimator Marat Zhanikeev (Tokyo Univ. of Science) IT2012-55 |
This paper focuses on active probing of end-to-end (E2E) network performance, specifically, available and/or bottleneck ... [more] | IT2012-55 pp.37-40 |
[Return to Top Page]