IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 20 of 20  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
SIP, IT, RCS 2024-01-18
(Primary: On-site, Secondary: Online)
On the Capacity of Periodic-Finite-Type Shift using Adjacency Matrix
Naoki Annou, Akiko Manada, Riku Yamauchi (NUT), Takahiro Ota (Senshu Univ) IT2023-39 SIP2023-72 RCS2023-214
When saving data to data storage media, we generally impose constraints on data sequences, such as run-length constraint... [more] IT2023-39 SIP2023-72 RCS2023-214
ISEC, IT, WBS 2020-03-11
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) IT2019-119 ISEC2019-115 WBS2019-68
A constrained system is a set of words satisfying some constraints on the appearance of subwords, and the study on syste... [more] IT2019-119 ISEC2019-115 WBS2019-68
WBS, IT, ISEC 2018-03-09
Tokyo Katsusika Campas, Tokyo University of Science Improved Lossless Compression by Substring Enumeration Using Sorting
Takahiro Ota (NPIT), Akiko Manada (UEC) IT2017-135 ISEC2017-123 WBS2017-116
This paper proposes an improved compression by substring enumeration (CSE) with a finite alphabet. For an input string, ... [more] IT2017-135 ISEC2017-123 WBS2017-116
IT 2017-07-14
Chiba Chiba University Improved Lossless Data Compression via Substring Enumeration with a Finite Alphabet
Takahiro Ota (Nagano Prefectural Inst. of Tech.), Hiroyoshi Morita (UEC) IT2017-34
Compression by substring enumeration (CSE) is a lossless universal coding algorithm.Experimental results show that the c... [more] IT2017-34
EE 2017-01-27
Nagasaki Nagasaki University Design Method of ZCS DC-DC 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) EE2016-80
In this paper, an auxiliary circuit design method to suppress unnecessary parasitic oscillation caused by resonance phen... [more] EE2016-80
EE 2016-01-29
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) EE2015-21
In this paper, a suppressing design technique of the unnecessary parasitic ringing caused by resonance phenomena between... [more] EE2015-21
ISEC, IT, WBS 2015-03-02
Fukuoka The University of Kitakyushu A Study of Two-dimensional Antidictionary Coding Using Automata
Takahiro Ota (NPIT), Hiroyoshi Morita (UEC) IT2014-78 ISEC2014-91 WBS2014-70
In one dimension, for an input string, an antidictionary is the set of all the minimal strings which do not appear in th... [more] IT2014-78 ISEC2014-91 WBS2014-70
MBE 2012-01-27
Fukuoka Kyushu University On the Automatic Thresholding for Arrhythmia Detection Using Antidictionary Coding
Takahiro Ota, Kiyokatsu Maruyama, Shinya Otagiri (NPIT), Hiroyoshi Morita (UEC) MBE2011-82
An arrhythmia detection system using antidictionary coding has been proposed, and the system has the advantage of real-t... [more] MBE2011-82
IN 2011-06-17
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) IN2011-39
(Advance abstract in Japanese is available) [more] IN2011-39
IT 2010-07-22
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 Electro-Comm.) IT2010-20
An antidictionary is in particular useful for data compression, and it consists of minimal forbidden words for a given s... [more] IT2010-20
MBE 2010-05-21
Toyama Toyama Univ. On the Arrhythmia Detection Using Antidictionary Codes
Takahiro Ota (NPIT), Keita Tomatsu (Yanagisawa Seiki), Jun Kimura (Koganei), Hiroyoshi Morita (UEC) MBE2010-7
Antidictionary code is a lossless data compression algorithm, and efficient real-time electrocardiogram compression algo... [more] MBE2010-7
IT, ISEC, WBS 2010-03-05
Nagano Nagano-Engineering Campus, Shinshu University Antidictionary Coding Scheme Based on Array Structures
Keita Suzuki, Hirotada Fukae (Univ. of Electro-Comm.), Takahiro Ota (Nagano Prefectural Inst. of Tech.), Hiroyoshi Morita (Univ. of Electro-Comm.) IT2009-124 ISEC2009-132 WBS2009-103
Given a string over a finite alphabet, a set of minimal forbidden words (MFW) that do not appear in the
string i... [more]
IT2009-124 ISEC2009-132 WBS2009-103
PRMU 2009-12-17
Tochigi Fujihara Cultural Center Accelerated Character Recognition Using a Regression-Tree-Molding
Takahiro Ota (Kishugikenkogyo), Toshikazu Wada (Wakayama Univ.) PRMU2009-134
High-speed and accurate character recognition is required for monitoring the condition of Ink Jet Printer (IJP) for indu... [more] PRMU2009-134
MBE 2009-09-14
Niigata Niigata Univ. On the On-line ECG Lossless Data Compression Using Antidictionary for a Finite Alphabet
Takahiro Ota (Nagano Prefectural Inst. of Tech.), Hiroyoshi Morita (UEC) MBE2009-44
An antidictionary is particular useful for data compression, and on-line electrocardiogram (ECG) lossless compression al... [more] MBE2009-44
WBS, IT, ISEC 2009-03-10
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 Electro-Commu.) IT2008-99 ISEC2008-157 WBS2008-112
An antidictionary is the set of all minimal strings, called Minimal Forbidden Words (MFWs), which never appear in an inp... [more] IT2008-99 ISEC2008-157 WBS2008-112
ISEC, IT, WBS 2008-02-29
Tokyo   Sliding Window Variation of Antidictionary Data Compression
Takahiro Ota (PIT-nagano), Hiroyoshi Morita (UEC) IT2007-68 ISEC2007-165 WBS2007-99
An antidictionary is the set of all minimal strings that never appear in an input string, and efficient adaptive data co... [more] IT2007-68 ISEC2007-165 WBS2007-99
CAS, NLP 2007-10-18
Tokyo Musashi Institute of Technology Branch Prediction Based on Antidictionary Tree
Mikihiko Nishiara (Shinshu Univ.), Hiroyoshi Morita (UEC), Takahiro Ota (PIT-Nagano) CAS2007-38 NLP2007-66
It is necessary to predict by high accuracy the results of the branch commands so as not to obstruct the speed-up of mic... [more] CAS2007-38 NLP2007-66
IT 2006-07-27
Chiba Univ. of Tokyo Data Compression Using Antidictionary for Finite-Alphabet Sources
Takahiro Ota (Pit-Nagano), 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] IT2006-31
WBS, IT, ISEC 2006-03-16
Aichi Nagoya Univ. Data Compression Using Source Model Based on Antidictionary Tree
Takahiro Ota (Pit-Nagano), Hiroyoshi Morita (UEC)
Data compression method using source model based on the automaton used antidictionary coding is proposed. However, the a... [more] IT2005-87 ISEC2005-144 WBS2005-101
IT 2005-07-22
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] IT2005-43
 Results 1 - 20 of 20  /   
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)

[Return to Top Page]

[Return to IEICE Web Page]

The Institute of Electronics, Information and Communication Engineers (IEICE), Japan