会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明公开
    • Method and apparatus for compression and decompression of data
    • EP0878915A3
    • 1998-12-30
    • EP98201928.3
    • 1991-02-26
    • FUJITSU LIMITED
    • Yoshida, ShigeruNakano, YasuhikoOkada, YoshiyukiChiba, Hirotaka
    • H03M7/30
    • G06T9/005H03M7/3088
    • A coding is carried out by designating the reference number of a partial sequence having the maximum length coincidence from the coded partial sequences registered in a dictionary with regard to a received character sequence, designating a new reference number to a partial sequence which is obtained by adding one character to a reference number obtained as a code word, and registering the new reference number designated partial sequence in the dictionary. A decoding is carried out by searching partial sequences registered in the dictionary using a code word represented by the reference number of the partial sequence, designating a new reference number to a partial sequence which is obtained by adding the beginning character of the currently restored partial sequence to the previously processed code word, and registering the new reference number designated partial sequence in the dictionary. According to the invention, the following steps are provided :
      constituting a reference dictionary from a plurality of reference dictionary units comprising the groups of difference beginning characters; coding successive different partial sequences of the received character sequence by constituting a code word by an indication representing a reference dictionary unit and an indication representing a register position of a partial sequence having the maximum length coincidence from the partial sequences registered in a reference dictionary; deriving transition probability between the beginning character of a partial sequence and the last character of a preceding partial sequence between the group of characters, and calculating transition probability between reference dictionaries; and if the transition probability of a partial sequence with regard to the preceding partial sequence is more than a predetermined value, representing a code word, as a variable length code word, by an indication having the length shorter than that of a code word assigned to a partial sequence having less transition probability.
    • 6. 发明公开
    • Method and apparatus for compression and decompression of data
    • 用于压缩和解压缩数据的方法和设备
    • EP0878915A2
    • 1998-11-18
    • EP98201928.3
    • 1991-02-26
    • FUJITSU LIMITED
    • Yoshida, ShigeruNakano, YasuhikoOkada, YoshiyukiChiba, Hirotaka
    • H03M7/30
    • G06T9/005H03M7/3088
    • A coding is carried out by designating the reference number of a partial sequence having the maximum length coincidence from the coded partial sequences registered in a dictionary with regard to a received character sequence, designating a new reference number to a partial sequence which is obtained by adding one character to a reference number obtained as a code word, and registering the new reference number designated partial sequence in the dictionary. A decoding is carried out by searching partial sequences registered in the dictionary using a code word represented by the reference number of the partial sequence, designating a new reference number to a partial sequence which is obtained by adding the beginning character of the currently restored partial sequence to the previously processed code word, and registering the new reference number designated partial sequence in the dictionary. According to the invention, the following steps are provided :

      constituting a reference dictionary from a plurality of reference dictionary units comprising the groups of difference beginning characters;
      coding successive different partial sequences of the received character sequence by constituting a code word by an indication representing a reference dictionary unit and an indication representing a register position of a partial sequence having the maximum length coincidence from the partial sequences registered in a reference dictionary;
      deriving transition probability between the beginning character of a partial sequence and the last character of a preceding partial sequence between the group of characters, and calculating transition probability between reference dictionaries; and
      if the transition probability of a partial sequence with regard to the preceding partial sequence is more than a predetermined value, representing a code word, as a variable length code word, by an indication having the length shorter than that of a code word assigned to a partial sequence having less transition probability.
    • 通过从关于所接收的字符序列的字典中登记的编码部分序列中指定具有最大长度一致性的部分序列的参考编号进行编码,将新的参考编号指定为通过添加 一个字符作为码字获得的参考号码,并且将新的参考号码指定的部分序列登记在词典中。 通过使用由部分序列的参考数字表示的代码字搜索登记在字典中的部分序列,对通过将当前恢复的部分序列的开始字符相加而获得的部分序列指定新的参考数字来执行解码 到先前处理的码字,并且将新的参考号码指定的部分序列登记在词典中。 根据本发明,提供以下步骤:从包括差异开始字符组的多个参考字典单元构成参考字典; 通过由表示参考字典单元的指示和表示具有与参考字典中登记的部分序列具有最大长度一致性的部分序列的寄存器位置的指示构成码字,对所接收的字符序列的连续不同部分序列进行编码; 导出部分序列的开始字符与该组字符之间的前一部分序列的最后字符之间的转换概率,并且计算参考字典之间的转换概率; 并且如果与前一部分序列有关的部分序列的转移概率大于预定值,则通过具有比分配给该代码字的长度更短的长度的指示来表示代码字作为可变长度代码字 具有较少转换概率的部分序列。
    • 9. 发明公开
    • Dictionary searching system
    • Wörterbuch - Suchsystem。
    • EP0470798A2
    • 1992-02-12
    • EP91307188.2
    • 1991-08-05
    • FUJITSU LIMITED
    • Yoshida, ShigeruNakano, YasuhikoOkada, YoshiyukiChiba, Hirotaka
    • G06F15/40G06F15/401H03M7/30
    • G06F17/2735H03M7/3088
    • A dictionary searching system retrieves a character string which is described by input reference number and characters from a plurality of mutually different character strings which are registered in a ditionary in correspondence with reference numbers assigned to the character strings. The dictionary searching system includes a dictionary (110) which is made up of an index part (111) for storing in correspondence with the reference numbers a reference number which is assigned to one of character strings which are obtained by adding a character to the character string which is assigned the input reference number and the character which is added to the one of the character strings and a list part (112) for storing in correspondence with the reference numbers a reference number which is assigned to one of character strings having a last character which differs from that of the character string which is assigned the input reference number and the character which is added to the one of the character strings, a reading part (121) for initially reading information from the index part by specifying the input reference number and thereafter reading information from the list part by specifying the reference number which is read from the dictionary, a detecting part (122) for detecting each character which matches the input characters out of characters read from the dictionary and for outputting a result of this detection as a retrieval result, and a deciding part (123) for deciding whether or not a reference number is included in an output of the dictionary and for outputting a result of this detection as a retrieval result, where the reading part, the detecting part and the deciding part operate independently of each other.
    • 字典搜索系统从与分配给字符串的附图标记相对应地登记在复习中的多个相互不同的字符串中检索由输入参考号和字符描述的字符串。 字典搜索系统包括字典(110),其由索引部分(111)构成,用于与参考号对应地存储分配给字符串中的一个的参考号,该字符串是通过将字符添加到字符 字符串,其分配了输入参考号和添加到字符串中的一个字符的字符,以及用于与参考编号相对应地存储的列表部分(112),该参考号被分配给具有最后一个字符串的字符串之一 字符,其不同于分配了输入参考号的字符串和添加到字符串中的一个字符的字符串;读取部分,用于通过指定输入的参考号码初始地从索引部分读取信息; 然后通过指定从字典读取的参考号码从列表部分读取信息,用于d的检测部分(122) 从字典读取的字符中读出符合输入字符的每个字符,并输出该检测结果作为检索结果;以及判定部(123),用于判定参考号是否包含在 字典,并且用于输出该检测结果作为检索结果,其中读取部分,检测部分和判定部分彼此独立地操作。