-
公开(公告)号：US20070067108A1
公开(公告)日：2007-03-22
申请号：US11359285
申请日：2006-02-22
申请人： Jeremy Buhler , Roger Chamberlain , Mark Franklin , Kwame Gyang , Arpith Jacob , Praveen Krishnamurthy , Joseph Lancaster
发明人： Jeremy Buhler , Roger Chamberlain , Mark Franklin , Kwame Gyang , Arpith Jacob , Praveen Krishnamurthy , Joseph Lancaster
IPC分类号： G06F19/00
CPC分类号： G06F19/28 , G06F17/3033 , G06F19/22
摘要： A system and method for performing biological sequence similarity searching is disclosed. This includes a programmable logic device configured to include a pipeline that comprises a matching stage, the matching stage being configured to receive a data stream comprising a plurality of possible matches between a plurality of biological sequence data strings and a plurality of substrings of a query string. The pipeline may further include a ungapped extension prefilter stage located downstream from the matching stage, the prefilter stage being configured to shift through pattern matches between the biological sequence data strings and the plurality of substrings of a query string and provide a score so that only pattern matches that exceed a user defined score will pass downstream from the prefilter stage. The matching stage may include at least one Bloom filter.
摘要翻译： 公开了一种用于进行生物序列相似性搜索的系统和方法。 这包括被配置为包括包括匹配级的流水线的可编程逻辑设备，所述匹配级被配置为接收包括多个生物序列数据串与查询字符串的多个子串之间的多个可能匹配的数据流 。 流水线还可以包括位于匹配阶段下游的无间隙扩展预滤器级，预滤器级被配置为通过生物序列数据串与查询串的多个子串之间的模式匹配移位，并提供分数，使得只有模式 超过用户定义分数的匹配将从预过滤器阶段下游传递。 匹配阶段可以包括至少一个布隆过滤器。
-
公开(公告)号：US08515682B2
公开(公告)日：2013-08-20
申请号：US13046395
申请日：2011-03-11
申请人： Jeremy Daniel Buhler , Roger Dean Chamberlain , Mark Allen Franklin , Kwame Gyang , Arpith Chacko Jacob , Praveen Krishnamurthy , Joseph Marion Lancaster
发明人： Jeremy Daniel Buhler , Roger Dean Chamberlain , Mark Allen Franklin , Kwame Gyang , Arpith Chacko Jacob , Praveen Krishnamurthy , Joseph Marion Lancaster
IPC分类号： G06F7/00
CPC分类号： G06F19/28 , G06F17/3033 , G06F19/22
摘要： A system and method for performing similarity searching is disclosed. This includes a programmable logic device configured to include a pipeline that comprises a matching stage, the matching stage being configured to receive a data stream comprising a plurality of possible matches between a plurality of data strings and a plurality of substrings of a query string. The pipeline may further include an ungapped extension prefilter stage located downstream from the matching stage, the prefilter stage being configured to shift through pattern matches between the data strings and the plurality of substrings of a query string and provide a score so that only pattern matches that exceed a user defined score will pass downstream from the prefilter stage. The matching stage may include at least one Bloom filter.
摘要翻译： 公开了一种用于执行相似性搜索的系统和方法。 这包括被配置为包括包括匹配级的流水线的可编程逻辑装置，所述匹配级被配置为接收包括多个数据串与查询串的多个子串之间的多个可能匹配的数据流。 流水线还可以包括位于匹配阶段下游的无间隙扩展预滤器级，预滤器级被配置为通过数据串与查询串的多个子串之间的模式匹配进行移位，并提供分数，使得只有模式匹配 超过用户定义的分数将从预过滤器阶段下游传递。 匹配阶段可以包括至少一个布隆过滤器。
-
3.发明授权Method and apparatus for performing similarity searching on a data stream with respect to a query string 有权用于对数据流进行相对于查询字符串的相似搜索的方法和装置公开(公告)号：US07917299B2
公开(公告)日：2011-03-29
申请号：US11359285
申请日：2006-02-22
申请人： Jeremy Daniel Buhler , Roger Dean Chamberlain , Mark Allen Franklin , Kwame Gyang , Arpith Chacko Jacob , Praveen Krishnamurthy , Joseph Marion Lancaster
发明人： Jeremy Daniel Buhler , Roger Dean Chamberlain , Mark Allen Franklin , Kwame Gyang , Arpith Chacko Jacob , Praveen Krishnamurthy , Joseph Marion Lancaster
IPC分类号： G06F7/00
CPC分类号： G06F19/28 , G06F17/3033 , G06F19/22
摘要： An apparatus and method for performing similarity searching on a data stream with respect to a query string are disclosed, where the data stream comprises a plurality of data substrings, and where the query string comprises a plurality of query substrings. A programmable logic device is used to filter the data stream to find a plurality of possible matches between the data substrings and a plurality of the query substrings, wherein the data substrings and the query substrings comprise a plurality of characters. From these possible matches, a determination can be made as to a similarity between the query string and at least a portion of the data stream.
摘要翻译： 公开了一种用于相对于查询串对数据流执行相似性搜索的装置和方法，其中数据流包括多个数据子串，并且其中查询串包括多个查询子串。 可编程逻辑设备用于过滤数据流以在数据子串和多个查询子串之间找到多个可能的匹配，其中数据子串和查询子串包括多个字符。 从这些可能的匹配中，可以确定查询串与数据流的至少一部分之间的相似度。
-
公开(公告)号：US20110231446A1
公开(公告)日：2011-09-22
申请号：US13046395
申请日：2011-03-11
申请人： Jeremy Daniel Buhler , Roger Dean Chamberlain , Mark Allen Franklin , Kwame Gyang , Arpith Chacko Jacob , Praveen Krishnamurthy , Joseph Marion Lancaster
发明人： Jeremy Daniel Buhler , Roger Dean Chamberlain , Mark Allen Franklin , Kwame Gyang , Arpith Chacko Jacob , Praveen Krishnamurthy , Joseph Marion Lancaster
IPC分类号： G06F17/30
CPC分类号： G06F19/28 , G06F17/3033 , G06F19/22
摘要： A system and method for performing similarity searching is disclosed. This includes a programmable logic device configured to include a pipeline that comprises a matching stage, the matching stage being configured to receive a data stream comprising a plurality of possible matches between a plurality of data strings and a plurality of substrings of a query string. The pipeline may further include an ungapped extension prefilter stage located downstream from the matching stage, the prefilter stage being configured to shift through pattern matches between the data strings and the plurality of substrings of a query string and provide a score so that only pattern matches that exceed a user defined score will pass downstream from the prefilter stage. The matching stage may include at least one Bloom filter.
摘要翻译： 公开了一种用于执行相似性搜索的系统和方法。 这包括被配置为包括包括匹配级的流水线的可编程逻辑装置，所述匹配级被配置为接收包括多个数据串与查询串的多个子串之间的多个可能匹配的数据流。 流水线还可以包括位于匹配阶段下游的无间隙扩展预滤器级，预滤器级被配置为通过数据串与查询串的多个子串之间的模式匹配进行移位，并提供分数，使得只有模式匹配 超过用户定义的分数将从预过滤器阶段下游传递。 匹配阶段可以包括至少一个布隆过滤器。
-
5.发明申请LONGEST PREFIX MATCHING FOR NETWORK ADDRESS LOOKUPS USING BLOOM FILTERS 审中-公开使用BLOOM FILTERS的网络地址查询的最前期匹配公开(公告)号：US20100098081A1
公开(公告)日：2010-04-22
申请号：US12566150
申请日：2009-09-24
CPC分类号： H04L45/7457 , Y10S707/99936
摘要： Methods and systems for performing parallel membership queries to Bloom filters for Longest Prefix Matching, where address prefix memberships are determined in sets of prefixes sorted by prefix length. Hash tables corresponding to each prefix length are probed from the longest to the shortest match in the vector, terminating when a match is found or all of the lengths are searched. The performance, as determined by the number of dependent memory accesses per lookup, is held constant for longer address lengths or additional unique address prefix lengths in the forwarding table given that memory resources scale linearly with the number of prefixes in the forwarding table. For less than 2 Mb of embedded RAM and a commodity SRAM, the present technique achieves average performance of one hash probe per lookup and a worst case of two hash probes and one array access per lookup.
摘要翻译： 用于对Bloom Filter进行并行成员查询的方法和系统用于最长前缀匹配，其中地址前缀成员资格是以前缀长度排序的前缀集确定的。 对应于每个前缀长度的散列表从向量中的最长到最短匹配进行探测，当找到匹配或搜索所有长度时终止。 假定存储器资源与转发表中的前缀数量成线性关系，则通过每个查找的依赖内存访问次数确定的性能在转发表中的较长地址长度或附加唯一地址前缀长度中保持不变。 对于小于2Mb的嵌入式RAM和商品SRAM，本技术实现每次查找一个散列探针的平均性能，每个查找实现两个散列探针和一个阵列访问的最坏情况。
-
6.发明授权Method and system for performing longest prefix matching for network address lookup using bloom filters 有权使用布隆过滤器执行网络地址查找的最长前缀匹配的方法和系统公开(公告)号：US07602785B2
公开(公告)日：2009-10-13
申请号：US11055767
申请日：2005-02-09
CPC分类号： H04L45/7457 , Y10S707/99936
摘要： The present invention relates to a method and system of performing parallel membership queries to Bloom filters for Longest Prefix Matching, where address prefix memberships are determined in sets of prefixes sorted by prefix length. Hash tables corresponding to each prefix length are probed from the longest to the shortest match in the vector, terminating when a match is found or all of the lengths are searched. The performance, as determined by the number of dependent memory accesses per lookup, is held constant for longer address lengths or additional unique address prefix lengths in the forwarding table given that memory resources scale linearly with the number of prefixes in the forwarding table. For less than 2 Mb of embedded RAM and a commodity SRAM, the present technique achieves average performance of one hash probe per lookup and a worst case of two hash probes and one array access per lookup.
摘要翻译： 本发明涉及对最长前缀匹配的布隆过滤器执行并行成员查询的方法和系统，其中以前缀长度排序的前缀集合确定地址前缀成员资格。 对应于每个前缀长度的散列表从向量中的最长到最短匹配进行探测，当找到匹配或搜索所有长度时终止。 假定存储器资源与转发表中的前缀数量成线性关系，则通过每个查找的依赖内存访问次数确定的性能在转发表中的较长地址长度或附加唯一地址前缀长度中保持不变。 对于小于2Mb的嵌入式RAM和商品SRAM，本技术实现每次查找一个散列探针的平均性能，每个查找实现两个散列探针和一个阵列访问的最坏情况。
-
7.发明授权Method and apparatus for detecting predefined signatures in packet payload using Bloom filters 有权使用布隆过滤器检测分组有效载荷中的预定义签名的方法和装置公开(公告)号：US07444515B2
公开(公告)日：2008-10-28
申请号：US10640513
申请日：2003-08-14
CPC分类号： H04L63/145
摘要： The present invention relates to a method and apparatus based on Bloom filters for detecting predefined signatures (a string of bytes) in a network packet payload. A Bloom filter is a data structure for representing a set of strings in order to support membership queries. Hardware Bloom filters isolate all packets that potentially contain predefined signatures. Another independent process eliminates false positives produced by the Bloom filters. The system is implemented on a FPGA platform, resulting in a set of 10,000 strings being scanned in the network data at the line speed of 2.4 Gbps.
摘要翻译： 本发明涉及一种基于用于检测网络分组有效载荷中的预定义签名（字节串）的布隆过滤器的方法和装置。 布隆过滤器是用于表示一组字符串以支持成员查询的数据结构。 硬件布隆过滤器隔离可能包含预定义签名的所有数据包。 另一个独立的过程消除了布鲁姆滤波器产生的假阳性。 该系统在FPGA平台上实现，从而以2.4Gbps的线路速度在网络数据中扫描一组10,000个字符串。
-
公开(公告)号：US08619978B2
公开(公告)日：2013-12-31
申请号：US11963543
申请日：2007-12-21
IPC分类号： G06F21/00
CPC分类号： H04L63/0815 , G06F21/41 , H04L63/0428
摘要： A method and a system allow accessing several of a user's controlled access accounts by presenting the credentials of only one of the accounts. The method may include (a) storing the credentials for each of the user's accounts; (b) receiving from the user credentials corresponding to any of the user's accounts; (c) presenting the received credentials to access the corresponding account; and (d) upon successful access of the corresponding account, using the stored credentials to access one or more of the user's accounts without requiring the user to present the corresponding credentials. For each of the user's accounts, the credentials are stored encrypted, using a randomly generated key, common to all the encrypted credentials. In addition, the randomly generated key is encrypted using the credentials of each of the accounts. In that manner, plain-text copies of neither the random key nor the credentials of the accounts need to be stored.
摘要翻译： 方法和系统允许通过仅呈现一个帐户的凭证来访问用户的受控访问帐户中的几个。 该方法可以包括（a）存储每个用户帐户的凭证; （b）从用户接收与任何用户帐户相对应的凭证; （c）提交收到的凭证以访问相应的帐户; 以及（d）在成功访问相应帐户之后，使用所存储的凭证访问用户的一个或多个帐户，而不要求用户呈现相应的凭证。 对于每个用户的帐户，凭证都使用随机生成的密钥进行加密存储，对所有加密凭证是通用的。 此外，使用每个帐户的凭据对随机生成的密钥进行加密。 以这种方式，不需要存储随机密钥和帐户的凭据的纯文本副本。
-
9.发明授权Learning or inferring medical concepts from medical transcripts using probabilistic models with words or phrases identification 有权使用具有单词或短语识别的概率模型从医学成绩单学习或推断医学概念公开(公告)号：US07840511B2
公开(公告)日：2010-11-23
申请号：US11850193
申请日：2007-09-05
IPC分类号： G06N5/00
摘要： A medical concept is learned about or inferred from a medical transcript. A probabilistic model is trained from medical transcripts. For example, the problem is treated as a graphical model. Discrimitive or generative learning is used to train the probabilistic model. A mutual information criterion can be employed to identify a discrete set of words or phrases to be used in the probabilistic model. The model is based on the types of medical transcripts, focusing on this source of data to output the most probable state of a patient in the medical field or domain. The learned model may be used to infer a state of a medical concept for a patient.
摘要翻译： 从医学成绩单中了解或推断医学概念。 概率模型由医学成绩单进行培训。 例如，该问题被视为图形模型。 使用歧视或生成学习来训练概率模型。 可以使用互信息标准来识别要在概率模型中使用的一组离散的单词或短语。 该模型基于医疗成绩单的类型，重点是这一数据来源，以输出医疗领域或领域患者的最可能状态。 所学习的模型可以用于推断患者的医学概念的状态。
-
公开(公告)号：US20080155669A1
公开(公告)日：2008-06-26
申请号：US11963543
申请日：2007-12-21
CPC分类号： H04L63/0815 , G06F21/41 , H04L63/0428
摘要： A method and a system allow accessing several of a user's controlled access accounts by presenting the credentials of only one of the accounts. The method may include (a) storing the credentials for each of the user's accounts; (b) receiving from the user credentials corresponding to any of the user's accounts; (c) presenting the received credentials to access the corresponding account; and (d) upon successful access of the corresponding account, using the stored credentials to access one or more of the user's accounts without requiring the user to present the corresponding credentials. For each of the user's accounts, the credentials are stored encrypted, using a randomly generated key, common to all the encrypted credentials. In addition, the randomly generated key is encrypted using the credentials of each of the accounts. In that manner, plain-text copies of neither the random key nor the credentials of the accounts need to be stored.
摘要翻译： 方法和系统允许通过仅呈现一个帐户的凭证来访问用户的受控访问帐户中的几个。 该方法可以包括（a）存储每个用户帐户的凭证; （b）从用户接收与任何用户帐户相对应的凭证; （c）提交收到的凭证以访问相应的帐户; 以及（d）在成功访问相应帐户之后，使用所存储的凭证访问用户的一个或多个帐户，而不要求用户呈现相应的凭证。 对于每个用户的帐户，凭证都使用随机生成的密钥进行加密存储，对所有加密凭证是通用的。 此外，使用每个帐户的凭据对随机生成的密钥进行加密。 以这种方式，不需要存储随机密钥和帐户的凭据的纯文本副本。
-
-
-
-
-
-
-
-
-
搜索结果
16 条记录 (耗时 0.031 秒)
