Search Results 1-20 of 49

  • 1 / 3
  • Proposal and Evaluation of Malware Detection Method for a Compressed Packet to Improve IoT Security  [in Japanese]

    WAKABA Yoichi

    … This paper proposes a new malware detection method for a LZ compressed packet in NIDS. … In this method, NIDS first inspects a compressed packet roughly, and selects a packet that is possibility of malware, that is like screening test. …

    THE BULLETIN OF NATIONAL INSTITUTE of TECHNOLOGY, KISARAZU COLLEGE 53(0), 41-45, 2020

    J-STAGE 

  • Manipulatable Compressed String Indexing Technology for Pattern Matching  [in Japanese]

    DENZUMI Shuhei , ARIMURA Hiroki , SADAKANE Kunihiko

    大規模な文字列データの操作は,文字列処理の分野で最も重要な課題の一つである.本稿では,文字列集合をコンパクトに圧縮し様々な操作を可能とする系列二分決定グラフ(系列BDD,SeqBDD)を紹介し,関連するパターン照合技術について紹介する.この系列BDDは,文字列データに拡張したZDDの一種であるが,同時に,従来から自然言語処理や文字列処理分野で研究されてきたトライや,有限オートマトン,接尾辞グラフな …

    The Journal of the Institute of Electronics, Information, and Communication Engineers 97(12), 1080-1085, 2014-12

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

    Yoshida Satoshi , Kida Takuya

    … A VF code is an encoding scheme that uses a fixed-length code, which provides easy access to compressed data. …

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

    J-STAGE 

  • On the Sparse Signal Recovery with Parallel Orthogonal Matching Pursuit

    PARK Shin-Woong , PARK Jeonghong , JUNG Bang Chul

    … In this letter, <i>parallel orthogonal matching pursuit (POMP)</i> … is proposed to supplement orthogonal matching pursuit (OMP) which has been widely used as a greedy algorithm for sparse signal recovery. …

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E96.A(12), 2728-2730, 2013

    J-STAGE 

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

    Yoshida Satoshi , Kida Takuya

    … A VF code is an encoding scheme that uses a fixed-length code, which provides easy access to compressed data. …

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

    J-STAGE 

  • Pattern matching on compressed text using smaller space  [in Japanese]

    AIHARA Takao , SHINOHARA Ayumi , NARISAWA Kazuyuki

    … In this paper, we propose a randomized algorithm for pattern matching on strings represented by straight-line programs (SLPs). … Using the equivalence checking algorithm presented by Schmidt-Schauss and Schnitger, we realize FirstMismatch (a function which returns the first position at which a nonterminal of text and a nonterminal of pattern have different symbols, when comparison is started at a given position) in a way that is different from Miyazaki's. …

    IEICE technical report. Theoretical foundations of Computing 112(272), 17-24, 2012-10-24

    References (10)

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

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

    … 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. … 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)

  • Indexed Swap Matching for Short Patterns

    ZHAO Hua , LU Songfeng

    … be a pattern of length <i>m</i>, both strings over a fixed finite alphabet. … The <i>Pattern Matching with Swaps</i> … if adjacent pattern characters can be swapped. … In the <i>Approximate Pattern Matching problem with Swaps</i>, one seeks for every text location with a swapped match of <i>P</i>, the number of swaps necessary to obtain a match at the location. …

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 95(1), 362-366, 2012-01-01

    J-STAGE  References (16)

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

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

    … 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

    … 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. … 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 

  • Faster Subsequence and Don't-Care Pattern Matching on Compressed Texts

    Yamamoto Takanori , Bannai Hideo , Inenaga Shunsuke , Takeda Masayuki

    … Subsequence pattern matching problems on compressed text were first considered by Cegielski et al. … (Window Subsequence Problems for Compressed Texts, Proc. … This improves the previous best known algorithm of Tiskin (Towards approximate matching in compressed strings: Local subsequence recognition, Proc. …

    Lecture Notes in Computer Science (6661/2011), 309-322, 2011-06

    IR 

  • A String Pattern Matching Algorithm for Non-Linear Collage Systems  [in Japanese]

    YAMAMOTO Junichi , INENAGA Shunsuke , BANNAI Hideo , TAKEDA Masayuki

    … In this paper, we propose a non-linear collage system where each vertex label is represented in compressed form. … We propose an O(n+m^2+|E|m+r)-time O(n+m^2+|E|m)-space algorithm that solves the pattern matching problem on a non-linear collage system, where n is the number of variables, m is the length of the pattern, |E| is the number of edges in the graph, and r is the number of occurrences of the pattern. …

    IEICE technical report 111(25), 1-7, 2011-05-04

    References (13)

  • Variable Length Don't-Care Pattern Matching Problems on Compressed Texts

    YAMAMOTO TAKANORI , BANNAI HIDEO , INENAGA SHUNSUKE [他] , Masayuki Takeda

    … Subsequence pattern matching problems on compressed text were first considered by Cegielski et al. … (Window Subsequence Problems for Compressed Texts, Proc. … This improves the previous best known algorithm of Tiskin (Faster subsequence recognition in compressed strings, J. …

    情報処理学会研究報告 2010年度(6), 1-8, 2011-04

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

    YOSHIDA SATOSHI , KIDA TAKUYA

    … It is reevaluated recently since it can accelerate pattern matching on the text. … Although we can obtain higher compression ratios when we make the parse tree large enough, pattern matching speed will decline since we take much more time to preprocess such large tree for compressed pattern matching. …

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

    References (17)

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

    吉田 諭史 , 喜田 拓也

    … It is reevaluated recently since it can accelerate pattern matching on the text. … Although we can obtain higher compression ratios when we make the parse tree large enough, pattern matching speed will decline since we take much more time to preprocess such large tree for compressed pattern matching. …

    研究報告情報基礎とアクセス技術(IFAT) 2010-IFAT-99(10), 1-8, 2010-07-28

  • An Efficient Compressed Pattern Matching Algorithm on Codes Represented by Parse Tree and Shared String  [in Japanese]

    KIDA Takuya

    本論文では,VF符号で圧縮されたテキスト上でのパターン照合アルゴリズムについて論じる.ここで扱うVF符号とは,テキストを分節木によって可変長の部分文字列に分割し,固定長の符号語を割り当てる形式の符号化手法である.圧縮照合問題の形式的枠組みであるCollage systemを用いれば,VF符号上でKMP型の汎用的なアルゴリズムを組織的に導出でき,O(m^2+D)時間・領域の前処理の後, O(n+R) …

    The IEICE transactions on information and systems 93(6), 733-741, 2010-06-01

    IR  References (9)

  • Transposition Invariant Fully Compressed Pattern Matching Algorithm  [in Japanese]

    MATSUBARA Wataru , SHINOHARA Ayumi

    … Transposition invariant pattern matching is the problem of matching given text and pattern to find the occurrence in the case where the pattern may be transformed by applying renaming bijection. … This paper studies an problem on compressed string in terms of straight line programs (SLPs). …

    IEICE technical report 110(12), 39-45, 2010-04-15

    References (12)

  • Context-Sensitive Grammar Transform : Compression and Pattern Matching

    MARUYAMA Shirou , TANAKA Youhei , SAKAMOTO Hiroshi , TAKEDA Masayuki

    … A framework of context-sensitive grammar transform for speeding-up compressed pattern matching (CPM) is proposed. … A greedy compression algorithm with the transform model is presented as well as a Knuth-Morris-Pratt (KMP)-type compressed pattern matching algorithm. …

    IEICE Transactions on Information and Systems 93(2), 219-226, 2010-02-01

    J-STAGE  References (20) Cited by (1)

  • Compressed Pattern Matching on VF Codes  [in Japanese]

    KIDA Takuya

    … We discuss the problem of pattern matching on a VF coded text. … We derive a KMP-type pattern matching algorithm from the collage system, which is a general framework to capture the essence of compressed pattern matching. …

    IEICE technical report 109(108), 1-8, 2009-06-22

    References (15) Cited by (2)

  • An Automatic Unpacking Method for Computer Virus Effective in the Virus Filter Based on Paul Graham's Bayesian Theorem

    ZHANG Dengfeng , NAKAYA Naoshi , KOUI Yuuji , YOSHIDA Hitoaki

    … Updates to virus information using the normal pattern matching method are increasingly unable to keep up with the speed at which viruses occur, since it takes time to extract the characteristic patterns for each virus. … However, recent computer viruses are almost always compressed and obfuscated. … Therefore, this paper proposes a method that unpacks compressed computer viruses automatically independent of the compression format. …

    IEICE Transactions on Communications 92(4), 1119-1127, 2009-04-01

    IR  J-STAGE  References (16)

  • 1 / 3
Page Top