会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明申请
    • COMPUTER PRODUCT, INFORMATION RETRIEVAL METHOD, AND INFORMATION RETRIEVAL APPARATUS
    • 计算机产品,信息检索方法和信息检索设备
    • US20100131476A1
    • 2010-05-27
    • US12623025
    • 2009-11-20
    • Masahiro KataokaMasahiro KurishimaTakashi TsubokuraRyouta Komatsu
    • Masahiro KataokaMasahiro KurishimaTakashi TsubokuraRyouta Komatsu
    • G06F17/30
    • G06F17/30979
    • A computer-readable recording medium stores therein an information retrieval program that causes a computer to execute a retrieval process in which files to be retrieved are narrowed down by using a bit string for each character in the files to find characters making up a retrieval keyword to retrieve a keyword identical to or related to the retrieval keyword in the files to be retrieved. The bit strings indicate the presence of the characters in the files. The information retrieval program causes the computer to execute extracting, from among the bit strings, a bit string of an arbitrary character; and compressing the extracted bit string, by using a special Huffman tree having leaves of plural types of symbol strings covering patterns represented by a predetermined number of bits and a special symbol string having a number of bits greater than the predetermined number of bits.
    • 一种计算机可读记录介质,其中存储有使计算机执行检索处理的信息检索程序,其中通过使用文件中的每个字符的位串来缩小要检索的文件,以查找构成检索关键字的字符 检索与要检索的文件中的检索关键字相同或相关的关键字。 位串表示文件中存在字符。 信息检索程序使计算机执行从位串中提取任意字符的位串; 并且通过使用具有覆盖由预定位数表示的图案的多种类型的符号串的叶的特殊霍夫曼树和具有大于预定比特数的比特数的特殊符号串来压缩提取的比特串。
    • 5. 发明授权
    • Communication server, mobile communication terminal, communication method, and computer product
    • 通信服务器,移动通信终端,通信方式和计算机产品
    • US09008621B2
    • 2015-04-14
    • US12335322
    • 2008-12-15
    • Masahiro KataokaKen HayashidaMasahiko ShimadaTakashi Tsubokura
    • Masahiro KataokaKen HayashidaMasahiko ShimadaTakashi Tsubokura
    • H04M1/66G06F15/16H04M1/68H04M3/16G06F21/10H04W12/02
    • G06F21/10H04W12/02
    • A method of controlling decompression, wherein the method includes: transmitting, by a first computer that already has stored therein compressed data that are compressed based on compression parameters, identification information for identifying the first computer to a second computer that stores therein the compression parameters; and encrypting, by the second computer, the compression parameters using the identification information received from the first computer. The compression parameters include at least a frequency of appearance and an allocated sign for each piece of character data. The method also includes: transmitting, by the second computer, the encrypted compression parameters to the first computer; decrypting, by the first computer, the encrypted compression parameters received from the second computer using the identification information; and decompressing, by the first computer, the compressed data based on the decrypted compression parameters.
    • 一种控制解压缩的方法,其特征在于,所述方法包括:通过已经存储了压缩数据的第一计算机根据压缩参数压缩的识别信息,用于将第一计算机识别为存储有压缩参数的第二计算机; 以及使用从第一计算机接收的识别信息,由第二计算机加密压缩参数。 压缩参数至少包括出现频率和每个字符数据的分配符号。 该方法还包括:由第二计算机将加密的压缩参数发送到第一计算机; 由第一计算机使用识别信息解密从第二计算机接收的加密压缩参数; 并且由第一计算机基于解密的压缩参数解压缩压缩数据。
    • 6. 发明授权
    • Computer product, information retrieving apparatus, and information retrieval method
    • 计算机产品,信息检索装置和信息检索方法
    • US08595196B2
    • 2013-11-26
    • US12622902
    • 2009-11-20
    • Masahiro KataokaKen MurataHideo KasaiTakashi Tsubokura
    • Masahiro KataokaKen MurataHideo KasaiTakashi Tsubokura
    • G06F17/00G06F17/30G06F7/00
    • G06F17/30911
    • A recording medium stores therein an information retrieval program that causes a computer to execute generating a Huffman tree based on an XML tag written in an XML file and an appearance frequency of character data exclusive of the XML tag; compressing the XML file using the Huffman tree; receiving a retrieval condition that includes a retrieval keyword and type information concerning the retrieval keyword; setting a decompression start flag for a compression code that is for an XML start tag related to the type information, the decompression start flag instructing commencement of decompression of a compression code string subsequent to the XML start tag; detecting, in the compressed XML file, the compression code for which the decompression start flag has been set; and decompressing, when the compression code for which the decompression start flag has been set is detected, the compression code string, using the Huffman tree.
    • 记录媒体存储信息检索程序,该程序使计算机执行基于XML文件中写入的XML标签和排除XML标签的字符数据的出现频率来生成霍夫曼树; 使用霍夫曼树压缩XML文件; 接收包括检索关键字的检索条件和关于检索关键字的类型信息; 设置用于与类型信息相关的XML开始标签的压缩代码的解压开始标志,所述解压开始标志指示开始解压缩XML开始标签之后的压缩代码串; 在压缩XML文件中检测已经设置了解压开始标志的压缩码; 并且当检测到已经设置了解压开始标志的压缩码时,解压缩压缩码串,使用霍夫曼树。
    • 7. 发明申请
    • INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING METHOD, AND COMPUTER PRODUCT
    • 信息处理设备,信息处理方法和计算机产品
    • US20100085222A1
    • 2010-04-08
    • US12543243
    • 2009-08-18
    • Masahiro KataokaHideto HigashiTakashi Tsubokura
    • Masahiro KataokaHideto HigashiTakashi Tsubokura
    • H03M7/40
    • H03M7/40
    • A computer-readable recording medium stores therein an information processing program that causes a computer to execute storing an aggregate of layers of nodes respectively having a pointer to an upper node, pointers to a leaf and/or a lower node and branches to lower nodes; obtaining a totaling result of appearance frequencies of character codes described in a file; classifying the character codes by layer, based on appearance probabilities thereof and the totaling result; calculating, based on a quantity of character codes in an ith layer and for the ith layer, a quantity of pointers pointing to leaves, and based on the quantity calculated and for the ith layer, further calculating a number of times nodes are used and a quantity of pointers pointing to lower nodes; generating, based on calculation results, a Huffman tree; and converting the Huffman tree into a node-less Huffman tree and storing the node-less Huffman tree.
    • 计算机可读记录介质存储信息处理程序,使计算机执行存储分别具有指向上位节点的指针,指向叶子和/或下层节点的指针的节点的聚合层,并分支到下层节点; 获得文件中描述的字符代码的出现频率的总计结果; 根据其出现概率和总计结果逐层分类字符编码; 基于第i层和第i层中的字符代码的数量来计算指向叶的指针的数量,并且基于所计算的数量,并且对于第i层,进一步计算使用节点的次数和 指向下节点的指针数量; 根据计算结果生成霍夫曼树; 并将霍夫曼(Huffman)树转换成无节点霍夫曼(Huffman)树,并存储无节点霍夫曼(Huffman)树。
    • 10. 发明授权
    • Apparatus for searching and managing compressed files
    • 用于搜索和管理压缩文件的设备
    • US08037035B2
    • 2011-10-11
    • US12361316
    • 2009-01-28
    • Masahiro KataokaTatsuhiro SatoTakashi Tsubokura
    • Masahiro KataokaTatsuhiro SatoTakashi Tsubokura
    • G06F7/00G06F17/00G06F17/30
    • G06F17/30138G06F12/0866G06F12/122G06F17/30106G06F17/30132G06F17/3053
    • A computer-readable, non-transitory medium stores a program that manages compressed file groups on a plurality of slave servers. The file groups include compressed files that are to be searched and have character strings. Each of the compressed file groups is expanded, using a Huffman tree that was used for compressing the compressed file group. A common compression parameter is generated based on appearance frequency, by summing, for each character, the appearance frequency in each of the compressed file groups. The expanded files are recompressed using the common Huffman tree such that sums of the access frequencies of the compressed files that are origins of the recompressed files are substantially equivalent among various slave servers. New archives including the re-compressed files are transmitted to the respective slave servers.
    • 计算机可读的非暂时介质存储管理多个从属服务器上的压缩文件组的程序。 文件组包括要搜索并具有字符串的压缩文件。 使用用于压缩压缩文件组的霍夫曼树来扩展每个压缩文件组。 基于出现频率,通过对每个字符求和每个压缩文件组中的出现频率,生成公共压缩参数。 使用公共霍夫曼树对扩展的文件进行再压缩,使得作为重新压缩文件的来源的压缩文件的访问频率的总和在各种从属服务器之间基本相同。 包括重新压缩文件的新档案被传送到相应的从属服务器。