Committee 
Date Time 
Place 
Paper Title / Authors 
Abstract 
Paper # 
ISEC, IT, WBS 
20200311 11:20 
Hyogo 
University of Hyogo (Cancelled but technical report was issued) 
On the Existence of Bonds for Constrained Systems Akiko Manada (SIT), Takahiro Ota (NPIT), Hiroyoshi Morita (UEC) IT2019119 ISEC2019115 WBS201968 
A constrained system is a set of words satisfying some constraints on the appearance of subwords, and the study on syste... [more] 
IT2019119 ISEC2019115 WBS201968 pp.195199 
WBS, IT, ISEC 
20180309 14:20 
Tokyo 
Katsusika Campas, Tokyo University of Science 
Improved Lossless Compression by Substring Enumeration Using Sorting Takahiro Ota (NPIT), Akiko Manada (UEC) IT2017135 ISEC2017123 WBS2017116 
This paper proposes an improved compression by substring enumeration (CSE) with a finite alphabet. For an input string, ... [more] 
IT2017135 ISEC2017123 WBS2017116 pp.191196 
IT 
20170714 14:45 
Chiba 
Chiba University 
Improved Lossless Data Compression via Substring Enumeration with a Finite Alphabet Takahiro Ota (Nagano Prefectural Inst. of Tech.), Hiroyoshi Morita (UEC) IT201734 
Compression by substring enumeration (CSE) is a lossless universal coding algorithm.Experimental results show that the c... [more] 
IT201734 pp.103108 
EE 
20170127 11:05 
Nagasaki 
Nagasaki University 
Design Method of ZCS DCDC Converter in Consideration of the Parasitic Capacitance of Switch and its Loss Reduction Effect Takahiro Ota, Jun Imaoka, Masahito Shoyama (Kyushu Univ.), Hiroyuki Onishi, Shingo Nagaoka, Sadaharu Morishita (OMRON) EE201680 
In this paper, an auxiliary circuit design method to suppress unnecessary parasitic oscillation caused by resonance phen... [more] 
EE201680 pp.169174 
EE 
20160129 11:10 
Fukuoka 
KURUME HOTEL ESPRIT 
Suppression of Unnecessary Ringing Caused by Coss of Switching Element and its Effect on Loss Reduction in High Frequency ZCS Converter Takahiro Ota, Jun Imaoka, Masahito Shoyama (Kyushu Univ), Hiroyuki Onishi, Shingo Nagaoka, Sadaharu Morishita (OMRON) EE201521 
In this paper, a suppressing design technique of the unnecessary parasitic ringing caused by resonance phenomena between... [more] 
EE201521 pp.7378 
ISEC, IT, WBS 
20150302 15:10 
Fukuoka 
The University of Kitakyushu 
A Study of Twodimensional Antidictionary Coding Using Automata Takahiro Ota (NPIT), Hiroyoshi Morita (UEC) IT201478 ISEC201491 WBS201470 
In one dimension, for an input string, an antidictionary is the set of all the minimal strings which do not appear in th... [more] 
IT201478 ISEC201491 WBS201470 pp.103109 
MBE 
20120127 12:00 
Fukuoka 
Kyushu University 
On the Automatic Thresholding for Arrhythmia Detection Using Antidictionary Coding Takahiro Ota, Kiyokatsu Maruyama, Shinya Otagiri (NPIT), Hiroyoshi Morita (UEC) MBE201182 
An arrhythmia detection system using antidictionary coding has been proposed, and the system has the advantage of realt... [more] 
MBE201182 pp.2126 
IN 
20110617 09:15 
Aichi 
Aichi Pref. Univ. 
Demonstration of live migration between distributed data centers Kazuya Kushiyama, Tadahiro Hata, Takahiro Ota, Tomoyuki Hakata, Masahiro Uraga, Akihide Hiura (NTT West) IN201139 
(Advance abstract in Japanese is available) [more] 
IN201139 pp.6166 
IT 
20100722 15:35 
Tokyo 
Kogakuin University 
An Almost Sure Convergence Proof of the Average Length of Minimal Forbidden Words on a Stationary Ergodic Source Takahiro Ota (NPIT), Hiroyoshi Morita (Univ. of ElectroComm.) IT201020 
An antidictionary is in particular useful for data compression, and it consists of minimal forbidden words for a given s... [more] 
IT201020 pp.5156 
MBE 
20100521 15:45 
Toyama 
Toyama Univ. 
On the Arrhythmia Detection Using Antidictionary Codes Takahiro Ota (NPIT), Keita Tomatsu (Yanagisawa Seiki), Jun Kimura (Koganei), Hiroyoshi Morita (UEC) MBE20107 
Antidictionary code is a lossless data compression algorithm, and efficient realtime electrocardiogram compression algo... [more] 
MBE20107 pp.3540 
IT, ISEC, WBS 
20100305 14:15 
Nagano 
NaganoEngineering Campus, Shinshu University 
Antidictionary Coding Scheme Based on Array Structures Keita Suzuki, Hirotada Fukae (Univ. of ElectroComm.), Takahiro Ota (Nagano Prefectural Inst. of Tech.), Hiroyoshi Morita (Univ. of ElectroComm.) IT2009124 ISEC2009132 WBS2009103 
Given a string over a ﬁnite alphabet, a set of minimal forbidden words (MFW) that do not appear in the
string i... [more] 
IT2009124 ISEC2009132 WBS2009103 pp.343348 
PRMU 
20091217 10:00 
Tochigi 
Fujihara Cultural Center 
Accelerated Character Recognition Using a RegressionTreeMolding Takahiro Ota (Kishugikenkogyo), Toshikazu Wada (Wakayama Univ.) PRMU2009134 
Highspeed and accurate character recognition is required for monitoring the condition of Ink Jet Printer (IJP) for indu... [more] 
PRMU2009134 pp.16 
MBE 
20090914 13:00 
Niigata 
Niigata Univ. 
On the Online ECG Lossless Data Compression Using Antidictionary for a Finite Alphabet Takahiro Ota (Nagano Prefectural Inst. of Tech.), Hiroyoshi Morita (UEC) MBE200944 
An antidictionary is particular useful for data compression, and online electrocardiogram (ECG) lossless compression al... [more] 
MBE200944 pp.3540 
WBS, IT, ISEC 
20090310 10:15 
Hokkaido 
Hakodate Mirai Univ. 
Adaptive Antidictionary Data Compression Using a Set of Restricted Length of Minimal Forbidden Words Takahiro Ota (Nagano Prefectural Inst. of Tech.), Hiroyoshi Morita (Univ. of ElectroCommu.) IT200899 ISEC2008157 WBS2008112 
An antidictionary is the set of all minimal strings, called Minimal Forbidden Words (MFWs), which never appear in an inp... [more] 
IT200899 ISEC2008157 WBS2008112 pp.363370 
ISEC, IT, WBS 
20080229 13:25 
Tokyo 

Sliding Window Variation of Antidictionary Data Compression Takahiro Ota (PITnagano), Hiroyoshi Morita (UEC) IT200768 ISEC2007165 WBS200799 
An antidictionary is the set of all minimal strings that never appear in an input string, and efficient adaptive data co... [more] 
IT200768 ISEC2007165 WBS200799 pp.127132 
CAS, NLP 
20071018 10:30 
Tokyo 
Musashi Institute of Technology 
Branch Prediction Based on Antidictionary Tree Mikihiko Nishiara (Shinshu Univ.), Hiroyoshi Morita (UEC), Takahiro Ota (PITNagano) CAS200738 NLP200766 
It is necessary to predict by high accuracy the results of the branch commands so as not to obstruct the speedup of mic... [more] 
CAS200738 NLP200766 pp.2124 
IT 
20060727 15:00 
Chiba 
Univ. of Tokyo 
Data Compression Using Antidictionary for FiniteAlphabet Sources Takahiro Ota (PitNagano), Hiroyoshi Morita (UEC) 
An antidictionary is a set of words of minimal length that never appear in this string. And it is known that the antid... [more] 
IT200631 pp.3742 
WBS, IT, ISEC 
20060316 09:20 
Aichi 
Nagoya Univ. 
Data Compression Using Source Model Based on Antidictionary Tree Takahiro Ota (PitNagano), Hiroyoshi Morita (UEC) 
Data compression method using source model based on the automaton used antidictionary coding is proposed. However, the a... [more] 
IT200587 ISEC2005144 WBS2005101 pp.135140 
IT 
20050722 10:50 
Osaka 
Osaka Prefecture Univ. 
Construction Antidictionary of a Binary String Using Suffix Tree Takahiro Ota (PIT Nagano), Hiroyoshi Morita (UEC) 
An antidictionary is a set of shortest words that never appear in a binary string. To construct the antidictionary for a... [more] 
IT200543 pp.914 