LENGTH OF THE LONGEST COMMON SUBSEQUENCE ALGORITHM OPTIMIZATION
    63.
    发明申请
    LENGTH OF THE LONGEST COMMON SUBSEQUENCE ALGORITHM OPTIMIZATION 审中-公开
    最长常规随机算法优化的长度

    公开(公告)号:US20160364457A1

    公开(公告)日:2016-12-15

    申请号:US15178235

    申请日:2016-06-09

    发明人: Antonín Kríz

    IPC分类号: G06F17/30

    CPC分类号: G06F16/90348

    摘要: Systems and methods perform various optimizations of an LLCS algorithm for use in determining if a set of input sequences are similar to a query sequence. The optimizations include filtering out sequence from the set of input sequences where the estimated similarity of the sequence with the query sequence is below a threshold value. The remaining sequences can then be provided to an LLCS algorithm where the output of the LLCS algorithm is used in a similarity function to determine an actual similarity of an input sequence with a query sequence.

    摘要翻译: 系统和方法执行LLCS算法的各种优化,以用于确定一组输入序列是否类似于查询序列。 优化包括从输入序列集合滤除序列,其中序列与查询序列的估计相似度低于阈值。 然后可以将剩余的序列提供给LLCS算法,其中在相似性函数中使用LLCS算法的输出来确定输入序列与查询序列的实际相似性。

    SORTING AN ARRAY CONSISTING OF A LARGE NUMBER OF ELEMENTS
    65.
    发明申请
    SORTING AN ARRAY CONSISTING OF A LARGE NUMBER OF ELEMENTS 审中-公开
    分配包含大量元素的阵列

    公开(公告)号:US20160171030A1

    公开(公告)日:2016-06-16

    申请号:US14965190

    申请日:2015-12-10

    发明人: HIROSHI INOUE

    IPC分类号: G06F17/30

    摘要: Sorting an array consisting of large number of elements. The present invention provides an apparatus for executing a multiway merging process which generates one output sequence from N input sequences on an array consisting of a large number of elements. The apparatus includes: an input sequence production unit configured to produce an input sequence by pairing a key from an element for use in a comparison during sorting with an index identifying the element for each element or sorted array of elements; an execution unit configured to execute the multiway merging process on N input sequences without rearranging the elements based on which input sequences have been produced; and a generation unit configured to rearrange the elements constituting the input sequences according to an output sequence that has been generated by the multiway merging process in the execution unit so as to generate a sorted array of elements.

    摘要翻译: 排序由大量元素组成的数组。 本发明提供一种用于执行多路合并处理的装置,其从由大量元素组成的阵列上的N个输入序列生成一个输出序列。 该设备包括:输入序列生成单元,被配置为通过将来自用于比较的元素中的密钥与用于识别元素的元素或元素的排序的元素的索引相配合来产生输入序列; 执行单元,被配置为在N个输入序列上执行多路合并处理,而不根据已经产生了哪些输入序列重新排列元素; 以及生成单元,被配置为根据由执行单元中的多路合并处理生成的输出序列重新构成输入序列的元素,以生成排序的元素数组。

    DOCUMENTATION PARSER
    66.
    发明申请
    DOCUMENTATION PARSER 审中-公开
    文件分配器

    公开(公告)号:US20150248500A1

    公开(公告)日:2015-09-03

    申请号:US14428126

    申请日:2013-08-16

    IPC分类号: G06F17/30

    摘要: A documentation parser 20 identifies text in documentation (1) on computer processes and performs analysis (21-25) on the structure and content of the documentation to determine automatically how to invoke services. The system then compiles a process using the invoked services and runs tests (30) using the process to determine whether it functions as intended. This reduces the degree of human intervention (41) required to generate the complete program (50, 51).

    摘要翻译: 文档解析器20识别关于计算机进程的文档(1)中的文本,并对文档的结构和内容进行分析(21-25),以自动确定如何调用服务。 然后,系统使用调用的服务编译进程,并使用进程运行测试(30),以确定其是否按预期方式运行。 这减少了生成完整程序所需的人力干预程度(41)(50,51)。

    Search table for unary k-th order exp-golomb decoder
    69.
    发明申请
    Search table for unary k-th order exp-golomb decoder 审中-公开
    一元k阶exp-golomb解码器的搜索表

    公开(公告)号:US20080162432A1

    公开(公告)日:2008-07-03

    申请号:US11648118

    申请日:2006-12-29

    申请人: Wen-Shan Wang

    发明人: Wen-Shan Wang

    IPC分类号: G06F17/30

    摘要: According to some embodiments, bin data may be input and, based on a portion of the bin data, an entry in a search table may be determined. An indication of whether the search is complete may then be read from the search table along with at least one of: (i) a base symbol value or (ii) information about a next node. If the search is not complete, the process may continue to determine entries in the search table based on the information about the next node and additional portions of the bin data. When the search is complete, a decoded symbol may be calculated based on the last base symbol value and a remaining portion of the bin data associated with an extra bin length read from the search table.

    摘要翻译: 根据一些实施例,可以输入bin数据,并且基于bin数据的一部分,可以确定搜索表中的条目。 然后可以从搜索表中读取搜索完成的指示以及以下中的至少一个:(i)基本符号值或(ii)关于下一个节点的信息。 如果搜索不完整,则该过程可以基于关于下一个节点的信息和该bin数据的附加部分来继续确定搜索表中的条目。 当搜索完成时,可以基于最后的基本符号值和与从搜索表读取的额外的箱长相关联的仓库数据的剩余部分来计算解码的符号。

    Searching method of block sorting lossless compressed data, and encoding method suitable for searching data in block sorting lossless compressed data
    70.
    发明申请
    Searching method of block sorting lossless compressed data, and encoding method suitable for searching data in block sorting lossless compressed data 审中-公开
    块分类无损压缩数据的搜索方法,以及适用于块分类无损压缩数据中搜索数据的编码方法

    公开(公告)号:US20010051941A1

    公开(公告)日:2001-12-13

    申请号:US09875161

    申请日:2001-06-07

    发明人: Motonobu Tonomura

    IPC分类号: G06F017/30

    CPC分类号: H03M7/30 G06F16/90348

    摘要: The present invention provides a high speed searching method by searching by decoding only necessary data compressed and encoded by the block sorting lossless compression method, without decoding all of the encoded data. The pairs of current sorting position number and previous sorting position number will be determined for the BW transformed rows and rows sorted with the lexicographic order in the data compressed by the block sorting lossless compression method. The data will be decoded based on the pairs while matching data with the searching character string. Only data required for the search will be decoded. The pairs of current sorting position number and previous sorting position number in the block sorting lossless compression method will be directly encoded.

    摘要翻译: 本发明提供一种高速搜索方法,通过仅解码通过块排序无损压缩方法压缩和编码的必要数据,而不解码所有编码数据。 对于通过块排序无损压缩方法压缩的数据中的字典顺序排列的BW变换行和行,将确定当前排序位置编号和先前排序位置编号对。 在将数据与搜索字符串匹配的同时,数据将基于对进行解码。 仅搜索所需的数据将被解码。 当前排序位置编号和先前排序位置编号在块排序无损压缩方法中将被直接编码。