会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • Apparatus and Method for Efficient Identification of Code Similarity
    • US20160127398A1
    • 2016-05-05
    • US14925301
    • 2015-10-28
    • The Johns Hopkins University
    • Jonathan D. Cohen
    • H04L29/06G06F17/30
    • G06F17/3053G06F8/71G06F17/30477G06F17/30864G06F17/30876H04L9/3231H04L63/1416H04L63/145
    • A method for identifying similarity between query samples and stored samples in an efficiently maintained reference library may include receiving a first threshold and a second threshold, receiving a plurality of binary reference samples, and processing each reference sample of the plurality of reference samples. The processing may include operations of assigning each reference sample a respective unique identifier, producing a reference sample fingerprint for each reference sample, and registering each respective unique identifier to reference sample fingerprint pair in a reference library. The registering may include scoring the reference sample fingerprint with each previously stored fingerprint in the reference library to produce a first matching score, if the first matching score meets or exceeds the first threshold for a previously stored fingerprint, determining the reference sample fingerprint to be a duplicate of the previously stored fingerprint and recording only a unique identifier associated with the reference sample fingerprint in the reference library where the unique identifier is marked as a duplicate of the previously stored fingerprint, and otherwise, if the first matching score is less than the first threshold, storing a corresponding reference sample unique identifier to reference sample fingerprint pair in the reference library. The method may further include receiving a binary query sample and processing the binary query sample via operations including producing a query sample fingerprint from the binary query sample, scoring the query sample fingerprint with each previously stored fingerprint in the reference library to produce a second matching score, and for each previously stored fingerprint for which the second matching score meets or exceeds the second threshold, reporting a corresponding reference sample unique identifier associated with the previously stored fingerprint and the second matching score.
    • 3. 发明申请
    • APPARATUS AND METHOD FOR ALIGNING TOKEN SEQUENCES WITH BLOCK PERMUTATIONS
    • 用块标记对准序列的装置和方法
    • US20150220593A1
    • 2015-08-06
    • US14614431
    • 2015-02-05
    • The Johns Hopkins University
    • Jonathan D. Cohen
    • G06F17/30H04L29/06H04L29/08
    • G06F17/30386G06F17/3033G06F21/562G06F21/566
    • A method of determining matching between at least a first sample comprising a sequence of tokens A and a second sample comprising a sequence of tokens B may include, for monotonically decreasing values of n, performing operations including recording a subset SA of n-grams of A in a hash table LA, such that a value of each n-gram determines an index in LA and a location of each respective n-gram in A is recorded as the value in LA, recording a subset SB of n-grams of B in a hash table LB, such that a value of each n-gram determines an index in LB and a location of each respective n-gram in B is recorded as the value in LB, for each location L that is occupied in both LA and LB, examining a region in A centered on LA(L) and a region in B centered on LB(L), and reporting a largest matching region aligning LA(L) with LB(L) that does not include already-matched tokens in A or B and marking the largest matching region as matched.
    • 确定至少包括令牌序列A的第一样本和包含令牌序列B的第二样本之间的匹配的方法可以包括:对于n的单调递减值,执行操作包括记录n克的A的子集SA 在哈希表LA中,使得每个n-gram的值确定LA中的索引,并且将A中的每个相应n-gram的位置记录为LA中的值,记录B的n克的子集SB 散列表LB,使得每个n-gram的值确定LB中的索引,并且将B中的每个相应n元的位置记录为LB中的值,对于在LA和LB中都占用的每个位置L 检查以LA(L)为中心的A区域和以LB(L)为中心的B区域,并报告与A(A)中不包括已经匹配的令牌的L​​B(L)对应的最大匹配区域LA(L) 或B,并将匹配的最大匹配区域标记。
    • 9. 发明授权
    • Apparatus and method for efficient identification of code similarity
    • US09805099B2
    • 2017-10-31
    • US14925301
    • 2015-10-28
    • The Johns Hopkins University
    • Jonathan D. Cohen
    • G06F21/00G06F17/30H04L29/06H04L9/32G06F9/44
    • G06F17/3053G06F8/71G06F17/30477G06F17/30864G06F17/30876H04L9/3231H04L63/1416H04L63/145
    • A method for identifying similarity between query samples and stored samples in an efficiently maintained reference library may include receiving a first threshold and a second threshold, receiving a plurality of binary reference samples, and processing each reference sample of the plurality of reference samples. The processing may include operations of assigning each reference sample a respective unique identifier, producing a reference sample fingerprint for each reference sample, and registering each respective unique identifier to reference sample fingerprint pair in a reference library. The registering may include scoring the reference sample fingerprint with each previously stored fingerprint in the reference library to produce a first matching score, if the first matching score meets or exceeds the first threshold for a previously stored fingerprint, determining the reference sample fingerprint to be a duplicate of the previously stored fingerprint and recording only a unique identifier associated with the reference sample fingerprint in the reference library where the unique identifier is marked as a duplicate of the previously stored fingerprint, and otherwise, if the first matching score is less than the first threshold, storing a corresponding reference sample unique identifier to reference sample fingerprint pair in the reference library. The method may further include receiving a binary query sample and processing the binary query sample via operations including producing a query sample fingerprint from the binary query sample, scoring the query sample fingerprint with each previously stored fingerprint in the reference library to produce a second matching score, and for each previously stored fingerprint for which the second matching score meets or exceeds the second threshold, reporting a corresponding reference sample unique identifier associated with the previously stored fingerprint and the second matching score.
    • 10. 发明申请
    • Apparatus and Method for Efficient Identification of Code Similarity
    • 用于有效识别代码相似性的装置和方法
    • US20160124966A1
    • 2016-05-05
    • US14926274
    • 2015-10-29
    • The Johns Hopkins University
    • Jonathan D. Cohen
    • G06F17/30G06F9/44
    • G06F17/3053G06F8/71G06F17/30477G06F17/30864G06F17/30876H04L9/3231H04L63/1416H04L63/145
    • A method for identifying similarity between query samples and stored samples in an efficiently maintained reference library may include receiving a binary query sample and processing the binary query sample via operations including producing a query sample fingerprint from the binary query sample, scoring the query sample fingerprint with each previously stored fingerprint in the reference library to produce a matching score, and for each previously stored fingerprint for which the matching score meets or exceeds a predetermined threshold, reporting a corresponding reference sample unique identifier associated with the previously stored fingerprint and the matching score. Each previously stored fingerprint in the reference library has been determined, prior to storage, as not being duplicative of another fingerprint in the reference library.
    • 一种用于在有效维护的参考库中识别查询样本和存储样本之间的相似性的方法可以包括接收二进制查询样本并经由以下操作处理二进制查询样本,包括从二进制查询样本生成查询样本指纹,对查询样本指纹进行评分, 每个先前存储的指纹在参考库中以产生匹配分数,并且对于匹配分数满足或超过预定阈值的每个先前存储的指纹,报告与先前存储的指纹和匹配分数相关联的相应参考样本唯一标识符。 参考库中的每个先前存储的指纹已经在存储之前被确定为不与参考库中的另一个指纹重复。