Search Results 1-20 of 37

  • 1 / 2
  • Texture Properties and Dysphagia Diet Classification of Non-Ionic Contrast Agent Gels and Barium Sulfate Gels for Videofluoroscopic Swallowing Studies  [in Japanese]

    UEHA Rumi , NITO Takaharu , YAMASOBA Tatsuya , KURODA Asuka , USUKURA Emi , GOTO Takao , SATO Taku , YOKOYAMA Akiko , KANEOKA Asako , OGINO Akiko , INOKUCHI Haruhi

    … In the preparation of test foods for VFSS in accordance with the dysphagic diet code, the gelling agents and contrast agents should be chosen with regards to the purpose of the study. …

    The Japanese Journal of Dysphagia Rehabilitation 22(2), 127-135, 2018

    J-STAGE  Ichushi Web 

  • A Variable-to-Fixed Length Lossless Source Code Attaining Better Performance than Tunstall Code in Several Criterions

    ARIMURA Mitsuharu

    … <p>Tunstall code is known as an optimal variable-to-fixed length (VF) lossless source code under the criterion of average coding rate, which is defined as the codeword length divided by the average phrase length. … In this paper we define the average coding rate of a VF code as the expectation of the pointwise coding rate defined by the codeword length divided by the phrase length. …

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E101.A(1), 249-258, 2018

    J-STAGE 

  • Construction of A Two-Step Universal VV Code Using a Sufficient Statistic Extracted from a VF Code  [in Japanese]

    有村 光晴 , 長岡 浩司

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 116(34), 75-80, 2016-05-19

  • Construction of A Two-Step Universal VV Code Using a Sufficient Statistic Extracted from a VF Code  [in Japanese]

    有村 光晴 , 長岡 浩司

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 116(33), 75-80, 2016-05-19

  • The Availability of Black Soybean Broth Adding Soybean Protein Gels as a Modified Diet for the Dysphagic Persons  [in Japanese]

    YAMAMOTO Ai , MATSUSHIMA Yasuyuki , YOSHIOKA Keiko

    … We investigated textural properties and sensory evaluation and further, underwent the video-fluorographic examination of swallowing (VF). … A VF was undertaken for the dysphagic patients. …

    The Japanese Journal of Dysphagia Rehabilitation 20(2), 61-69, 2016

    J-STAGE  Ichushi Web 

  • Direct- or Fast-Access Decoding Schemes for VF Codes

    YAMAMOTO Hirosuke , KUWAORI Yuka

    … <p>In this paper, we propose two schemes, which enable any VF code to realize direct- or fast-access decoding for any long source sequence. …

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E99.A(12), 2291-2295, 2016

    J-STAGE 

  • Average Coding Rate of a Multi-Shot Tunstall Code with an Arbitrary Parsing Tree Sequence

    ARIMURA Mitsuharu

    … <p>Average coding rate of a multi-shot Tunstall code, which is a variation of variable-to-fixed length (VF) lossless source codes, for stationary memoryless sources is investigated. … A multi-shot VF code parses a given source sequence to variable-length blocks and encodes them to fixed-length codewords. …

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E99.A(12), 2281-2285, 2016

    J-STAGE 

  • An Improvement on the Almost Sure Convergence Coding Theorems of One-shot and Multi-shot Tunstall Codes  [in Japanese]

    有村 光晴

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 115(137), 17-22, 2015-07-13

  • Almost Sure Convergence Coding Theorems of One-Shot and Multi-Shot Tunstall Codes for Stationary Memoryless Sources

    ARIMURA Mitsuharu

    … Coding theorem of one-shot Tunstall code is proved in the case that the leaf count of Tunstall tree increases. … On the other hand, coding theorem is proved for multi-shot Tunstall code with increasing parsing count, under the assumption that the Tunstall tree grows as the parsing proceeds. … In this result, it is clarified that the theorem for the one-shot Tunstall code is not a corollary of the theorem for the multi-shot Tunstall code. …

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E98.A(12), 2393-2406, 2015

    J-STAGE 

  • A Variable-length-to-fixed-length Coding Method Using a Re-Pair Algorithm

    Satoshi Yoshida , Takuya Kida

    … In this study, we address the problem of improving variable-length-to-fixed-length codes (VF codes). … A VF code is an encoding scheme that uses a fixed-length code, which provides easy access to compressed data. … However, conventional VF codes generally have an inferior compression ratio compared with variable-length codes. …

    情報処理学会論文誌データベース(TOD) 6(4), 17-23, 2013-09-27

    IPSJ 

  • On the Existence Condition of a VF Code for an Infinite-Alphabet Source  [in Japanese]

    ARIMURA Mitsuharu , IWATA Ken-ichi

    … In this paper, the performance of a variable-to-fixed length code (VF code) for a general source with countably infinite alphabet is investigated. … It is proved that any VF code cannot attain better coding rate than fixed-to-fixed length codes (FF codes) for infinite alphabet sources. …

    IEICE technical report. Information theory 113(58), 41-46, 2013-05-24

  • A Variable-length-to-fixed-length Coding Method Using a Re-Pair Algorithm

    Yoshida Satoshi , Kida Takuya

    … In this study, we address the problem of improving variable-length-to-fixed-length codes (VF codes). … A VF code is an encoding scheme that uses a fixed-length code, which provides easy access to compressed data. … However, conventional VF codes generally have an inferior compression ratio compared with variable-length codes. …

    IPSJ Online Transactions 6(0), 121-127, 2013

    J-STAGE 

  • A Variable-length-to-fixed-length Coding Method Using a Re-Pair Algorithm

    Yoshida Satoshi , Kida Takuya

    … In this study, we address the problem of improving variable-length-to-fixed-length codes (VF codes). … A VF code is an encoding scheme that uses a fixed-length code, which provides easy access to compressed data. … However, conventional VF codes generally have an inferior compression ratio compared with variable-length codes. …

    Information and Media Technologies 8(4), 971-977, 2013

    J-STAGE 

  • Improving Parse Trees for Efficient Variable-to-Fixed Length Codes

    Yoshida Satoshi , Uemura Takashi , Kida Takuya , Asai Tatsuya , Okamoto Seishi

    … We address the problem of improving variable-length-to-fixed-length codes (VF codes). … A VF code that we deal here with is an encoding scheme that parses an input text into variable length substrings and then assigns a fixed length codeword to each parsed substring. … VF codes have favourable properties for fast decoding and fast compressed pattern matching, but they are worse in compression ratio than the latest compression methods. …

    Journal of information processing 20(1), 238-249, 2012-01-15

    IPSJ  J-STAGE  Cited by (1)

  • Improving Parse Trees for Efficient Variable-to-Fixed Length Codes

    Yoshida Satoshi , Uemura Takashi , Kida Takuya , Asai Tatsuya , Okamoto Seishi

    … We address the problem of improving variable-length-to-fixed-length codes (VF codes). … A VF code that we deal here with is an encoding scheme that parses an input text into variable length substrings and then assigns a fixed length codeword to each parsed substring. … VF codes have favourable properties for fast decoding and fast compressed pattern matching, but they are worse in compression ratio than the latest compression methods. …

    Information and Media Technologies 7(1), 129-140, 2012

    J-STAGE 

  • Improving Parse Trees for Efficient Variable-to-Fixed Length Codes

    Satoshi Yoshida , Takashi Uemura , Takuya Kida , Tatsuya Asai , Seishi Okamoto

    … We address the problem of improving variable-length-to-fixed-length codes (VF codes). … A VF code that we deal here with is an encoding scheme that parses an input text into variable length substrings and then assigns a fixed length codeword to each parsed substring. … VF codes have favourable properties for fast decoding and fast compressed pattern matching, but they are worse in compression ratio than the latest compression methods. …

    情報処理学会論文誌 52(12), 12p, 2011-12-15

    IPSJ 

  • A method of training parse trees for efficient VF coding based on MDL principle  [in Japanese]

    吉田 諭史 , 喜田 拓也

    … 本稿では,VF 符号における辞書データ構造を訓練することで VF 符号の性能を向上させる方法について論じる.ここで議論する VF 符号とは,分節木と呼ばれる木構造を用いて入力テキストを可変長のブロックに分割し,各ブロックに固定長の符号語を割り当てることでテキスト圧縮を達成する情報源符号化方法である.VF 符号の圧縮率は分節木によって決定さ …

    研究報告 情報基礎とアクセス技術(IFAT) 2011-IFAT-103(14), 1-6, 2011-07-26

  • A method of training parse trees for efficient VF coding based on MDL principle  [in Japanese]

    吉田 諭史 , 喜田 拓也

    … 本稿では,VF 符号における辞書データ構造を訓練することで VF 符号の性能を向上させる方法について論じる.ここで議論する VF 符号とは,分節木と呼ばれる木構造を用いて入力テキストを可変長のブロックに分割し,各ブロックに固定長の符号語を割り当てることでテキスト圧縮を達成する情報源符号化方法である.VF 符号の圧縮率は分節木によって決定さ …

    研究報告 データベースシステム(DBS) 2011-DBS-152(14), 1-6, 2011-07-26

  • On the Average Coding Rate of the Tunstall Code for Stationary and Memoryless Sources

    ARIMURA Mitsuharu

    … The coding rate of a one-shot Tunstall code for stationary and memoryless sources is investigated in non-universal situations so that the probability distribution of the source is known to the encoder and the decoder. … When studying the variable-to-fixed length code, the average coding rate has been defined as (i) the codeword length divided by the average block length. …

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 93(11), 1904-1911, 2010-11-01

    J-STAGE  References (16)

  • A Combination of VF Coding with Arithmetic Coding for Efficient Compression  [in Japanese]

    YOSHIDA SATOSHI , KIDA TAKUYA

    … 本稿では,VF 符号に算術符号を組み合わせることで,検索の効率と圧縮率とを保つ方法について議論する.ここで議論する VF 符号とは,分節木と呼ばれる圧縮のための辞書木を用いて元のテキストを可変長のブロックに分割し,各ブロックに固定長の符号語を割り当てることでデータ圧縮を達成する情報源符号化方法である.VF 符号は,近年,パターン照合を高速化することの …

    情報処理学会研究報告. データベース・システム研究会報告 150, J1-J8, 2010-08-04

    References (17)

  • 1 / 2
Page Top