专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US07191168B1 Fast prefix matching of bounded strings 失效
标题翻译：有限字符串的快速前缀匹配
公开(公告)号：US07191168B1
公开(公告)日：2007-03-13
申请号：US10254378
申请日：2002-09-25
申请人： Adam Louis Buchsbaum , Glenn Stephen Fowler , Balachander Krishnamurthy , Kiem-Phong Vo , Jia Wang
发明人： Adam Louis Buchsbaum , Glenn Stephen Fowler , Balachander Krishnamurthy , Kiem-Phong Vo , Jia Wang
IPC分类号： G06F17/30
CPC分类号： H04L45/00 , H04L45/7457 , Y10S707/99932
摘要： The present invention increases the efficiency of performing longest prefix matching operations by selecting a radix-encoded trie structure optimized with respect to memory cost. The structure is optimized by determining memory costs for retrie structures indexed on different numbers of high-order characters, and then selecting the structure corresponding to the lowest memory cost. The optimization improves performance in IP look-up operations as well as longest-prefix matching operations performed on general alphabets.
摘要翻译：本发明通过选择针对存储器成本优化的基数编码的特里结构来提高执行最长前缀匹配操作的效率。通过确定在不同数量的高阶字符上索引的检索结构的内存成本，然后选择与最低内存成本相对应的结构来优化结构。该优化提高了IP查找操作的性能以及对一般字母表执行的最长前缀匹配操作。

2. 发明授权

US07627691B1 Method for fast network-aware clustering 失效
标题翻译：快速网络感知聚类方法
公开(公告)号：US07627691B1
公开(公告)日：2009-12-01
申请号：US11732279
申请日：2007-04-03
申请人： Adam Louis Buchsbaum , Glenn Stephen Fowler , Balachander Krishnamurthy , Jia Wang
发明人： Adam Louis Buchsbaum , Glenn Stephen Fowler , Balachander Krishnamurthy , Jia Wang
IPC分类号： G06F15/173
CPC分类号： H04L29/12009 , H04L45/7457 , H04L61/00 , H04L67/28 , H04L67/2852 , Y10S707/99945 , Y10S707/99948
摘要： A method for clustering together network IP addresses is disclosed. A number of IP addresses are received and processed to determine which IP addresses share a longest prefix matching. The longest prefix matching process is performed according to radix encoded trie which facilitates on-line clustering of the IP addresses. Client and/or server IP addresses may be clustered in accordance with the teachings herein.
摘要翻译：公开了一种将网络IP地址聚集在一起的方法。接收并处理多个IP地址以确定哪个IP地址共享最长的前缀匹配。最长的前缀匹配过程根据基数编码的特里进行，这有助于IP地址的在线聚类。可以根据本文的教导将客户端和/或服务器IP地址聚类。

3. 发明授权

US07219160B1 Method for fast network-aware clustering 失效
标题翻译：快速网络感知聚类方法
公开(公告)号：US07219160B1
公开(公告)日：2007-05-15
申请号：US09705675
申请日：2000-11-03
申请人： Adam Louis Buchsbaum , Glenn Stephen Fowler , Balachander Krishnamurthy , Jia Wang
发明人： Adam Louis Buchsbaum , Glenn Stephen Fowler , Balachander Krishnamurthy , Jia Wang
IPC分类号： G06F15/173
CPC分类号： H04L29/12009 , H04L45/7457 , H04L61/00 , H04L67/28 , H04L67/2852 , Y10S707/99945 , Y10S707/99948
摘要： A method for clustering together network IP addresses is disclosed. A number of IP addresses are received and processed to determine which IP addresses share a longest prefix matching. The longest prefix matching process is performed according to radix encoded trie which facilitates on-line clustering of the IP addresses. Client and/or server IP addresses may be clustered in accordance with the teachings herein.
摘要翻译：公开了一种将网络IP地址聚集在一起的方法。接收并处理多个IP地址以确定哪个IP地址共享最长的前缀匹配。最长的前缀匹配过程根据基数编码的特里进行，这有助于IP地址的在线聚类。可以根据本文的教导将客户端和/或服务器IP地址聚类。

4. 发明授权

US08065348B1 Data storage technique 有权
标题翻译：数据存储技术
公开(公告)号：US08065348B1
公开(公告)日：2011-11-22
申请号：US12380268
申请日：2009-02-25
申请人： Adam Louis Buchsbaum , Kiem-Phong Vo
发明人： Adam Louis Buchsbaum , Kiem-Phong Vo
IPC分类号： G06F17/30
CPC分类号： G06F17/30076 , G06F3/0643 , G06F9/542 , G06F2209/542
摘要： A preload library partitions certain files into segments and transforms the data of the files on a segment by segment basis, each independently of the other. The transformed segments are then stored as part of a transformed file, with each segment corresponding to a bag containing a chunk (of transformed data) and a gap which permits the chunks to grow when data of the segment is modified during a write operation. The bags are followed by a chunk map which contains metadata defining the compressed version of each segment. The preload library intercepts system calls from applications to the OC specifying access to specific segments of a transformed file. The preload library identifies the chunks corresponding to the specified segments, retrieves and reverses the transform on those chunks and passes the data to the application requesting it. For a system call to write data to certain segments, the data is modified and re-transformed by the library before being written back to disk. A preload library provides improved random access into transformed (e.g. compressed, encrypted, etc.) files.
摘要翻译：预加载库将某些文件分割成段，并逐段转换文件的数据，每个文件分别独立于另一个。变换的段然后被存储为变换文件的一部分，每个段对应于包含块（变换数据）的行李，以及允许块在写入操作期间数据被修改时允许块增长的间隙。行李后面是一个块图，其中包含定义每个段的压缩版本的元数据。预加载库拦截从应用程序到OC的系统调用，指定访问转换文件的特定段。预加载库标识对应于指定段的块，检索并反转这些块上的变换，并将数据传递给请求它的应用程序。对于将数据写入某些段的系统调用，数据在被写回磁盘之前被库修改和重新转换。预加载库提供改进的随机访问到变换（例如压缩，加密等）文件。

5. 发明授权

US07536418B2 Preload library for transparent file transformation 有权
标题翻译：预加载库进行透明文件转换
公开(公告)号：US07536418B2
公开(公告)日：2009-05-19
申请号：US10754994
申请日：2004-01-10
申请人： Adam Louis Buchsbaum , Kiem-Phong Vo
发明人： Adam Louis Buchsbaum , Kiem-Phong Vo
IPC分类号： G06F17/30
CPC分类号： G06F17/30076 , G06F3/0643 , G06F9/542 , G06F2209/542
摘要： A preload library partitions certain files into segments and transforms the data of the files on a segment by segment basis, each independently of the other. The transformed segments are then stored as part of a transformed file, with each segment corresponding to a bag containing a chunk (of transformed data) and a gap which permits the chunks to grow when data of the segment is modified during a write operation. The bags are followed by a chunk map which contains metadata defining the compressed version of each segment. The preload library intercepts system calls from applications to the OC specifying access to specific segments of a transformed file. The preload library identifies the chunks corresponding to the specified segments, retrieves and reverses the transform on those chunks and passes the data to the application requesting it. For a system call to write data to certain segments, the data is modified and re-transformed by the library before being written back to disk. A preload library provides improved random access into transformed (e.g. compressed, encrypted, etc.) files.
摘要翻译：预加载库将某些文件分割成段，并逐段转换文件的数据，每个文件分别独立于另一个。变换的段然后被存储为变换文件的一部分，每个段对应于包含块（变换数据）的行李，以及允许块在写入操作期间数据被修改时允许块增长的间隙。行李后面是一个块图，其中包含定义每个段的压缩版本的元数据。预加载库拦截从应用程序到OC的系统调用，指定访问转换文件的特定段。预加载库标识对应于指定段的块，检索并反转这些块上的变换，并将数据传递给请求它的应用程序。对于将数据写入某些段的系统调用，数据在被写回磁盘之前被库修改和重新转换。预加载库提供改进的随机访问到变换（例如压缩，加密等）文件。

6. 发明申请

US20060015535A1 Preload library for transparent file transformation 有权
公开(公告)号：US20060015535A1
公开(公告)日：2006-01-19
申请号：US10754994
申请日：2004-01-10
申请人： Adam Louis Buchsbaum , Kiem-Phong Vo
发明人： Adam Louis Buchsbaum , Kiem-Phong Vo
IPC分类号： G06F17/30
CPC分类号： G06F17/30076 , G06F3/0643 , G06F9/542 , G06F2209/542
摘要： A preload library partitions certain files into segments and transforms the data of the files on a segment by segment basis, each independently of the other. The transformed segments are then stored as part of a transformed file, with each segment corresponding to a bag containing a chunk (of transformed data) and a gap which permits the chunks to grow when data of the segment is modified during a write operation. The bags are followed by a chunk map which contains metadata defining the compressed version of each segment. The preload library intercepts system calls from applications to the OC specifying access to specific segments of a transformed file. The preload library identifies the chunks corresponding to the specified segments, retrieves and reverses the transform on those chunks and passes the data to the application requesting it. For a system call to write data to certain segments, the data is modified and re-transformed by the library before being written back to disk. A preload library provides improved random access into transformed (e.g. compressed, encrypted, etc.) files.

7. 发明授权

US07051074B1 Graph algorithm for common neighborhood analysis 失效
标题翻译：常用邻域分析的图算法
公开(公告)号：US07051074B1
公开(公告)日：2006-05-23
申请号：US09643580
申请日：2000-08-22
申请人： Adam Louis Buchsbaum , Raffaele Giancarlo , Jeffery Rex Westbrook
发明人： Adam Louis Buchsbaum , Raffaele Giancarlo , Jeffery Rex Westbrook
IPC分类号： H06F15/16
CPC分类号： H04L67/22 , G06Q30/0241 , H04L67/02 , H04L67/28 , H04L67/2847 , Y10S707/99936 , Y10S707/99945 , Y10S707/99948
摘要： A system and method of determining a common neighborhood of users sharing a common activity from a plurality of users is provided. The system and method may be used to predict, for a user in the common neighborhood of users, a potential activity from the activities of at least one other user in the common neighborhood of users.
摘要翻译：提供了一种确定来自多个用户共享共同活动的用户的公共邻居的系统和方法。系统和方法可以用于针对用户的公共区域中的用户预测来自用户的共同邻域中的至少一个其他用户的活动的潜在活动。

8. 发明授权

US06266634B1 Method and apparatus for generating deterministic approximate weighted finite-state automata 有权
标题翻译：用于产生确定性近似加权有限状态自动机的方法和装置
公开(公告)号：US06266634B1
公开(公告)日：2001-07-24
申请号：US09533549
申请日：2000-03-23
申请人： Adam Louis Buchsbaum , Raffaele Giancarlo , Jeffery Rex Westbrook
发明人： Adam Louis Buchsbaum , Raffaele Giancarlo , Jeffery Rex Westbrook
IPC分类号： G10L1514
CPC分类号： G10L15/08 , G10L15/19
摘要： An approximate weighted finite-state automaton can be constructed in place of a weighted finite-state automaton so long as the approximate weighted finite-state automaton maintains a sufficient portion of the original best strings in the weighted finite-state automaton and sufficiently few spurious strings are introduced into the approximate weighted finite-state automaton compared to the weighted finite-state automaton. An approximate weighted finite-state automaton can be created from a non-deterministic weighted finite-state automaton during determinization by discarding the requirement that old states be used in place of new states only when an old state is identical to a new state. Instead, in an approximate weighted finite-state automaton, old states will be used in place of new states when each of the remainders of the new state is sufficiently close to the corresponding remainder of the old state. An error tolerance parameter &tgr; defines whether the remainders of the new state are sufficiently close to the corresponding remainders of the old state. If the remainders of the new state are sufficiently close to the remainders of the old state, a new transition is created from a current state to the old state rather than the new state. Such approximate weighted finite-state automata allow the size of the resulting deterministic finite-state automata to be reduced and can prevent the expansion that would otherwise occur in some deterministic finite-state automata.
摘要翻译：可以构造近似加权有限状态自动机来代替加权有限状态自动机，只要近似加权有限状态自动机在加权有限状态自动机中维持原始最佳字符串的足够部分，并且足够少的虚拟字符串与加权有限状态自动机相比，被引入近似加权有限状态自动机。在确定期间，可以通过丢弃仅在旧状态与新状态相同的旧状态来代替新状态的要求时，可以通过非确定性加权有限状态自动机来创建近似加权有限状态自动机。相反，在近似加权有限状态自动机中，当新状态的每个剩余部分足够接近旧状态的相应剩余部分时，将使用旧状态代替新状态。误差容差参数＆tgr 定义新状态的剩余部分是否足够接近旧状态的相应剩余部分。如果新的国家的剩余部分与旧国家的剩余国家相当接近，那么从现在的国家到旧的国家而不是新的国家就形成了新的转型。这种近似加权有限状态自动机允许所得到的确定性有限状态自动机的大小减小，并且可以防止否则将在某些确定性有限状态自动机中发生的扩展。

9. 发明授权

US6073098A Method and apparatus for generating deterministic approximate weighted finite-state automata 失效
标题翻译：用于产生确定性近似加权有限状态自动机的方法和装置
公开(公告)号：US6073098A
公开(公告)日：2000-06-06
申请号：US975648
申请日：1997-11-21
申请人： Adam Louis Buchsbaum , Raffaele Giancarlo , Jeffery Rex Westbrook
发明人： Adam Louis Buchsbaum , Raffaele Giancarlo , Jeffery Rex Westbrook
IPC分类号： G10L15/08 , G10L15/18
CPC分类号： G10L15/08 , G10L15/19
摘要： An approximate weighted finite-state automaton can be constructed in place of a weighted finite-state automaton so long as the approximate weighted finite-state automaton maintains a sufficient portion of the original best strings in the weighted finite-state automaton and sufficiently few spurious strings are introduced into the approximate weighted finite-state automaton compared to the weighted finite-state automaton. An approximate weighted finite-state automaton can be created from a non-deterministic weighted finite-state automaton during determinization by discarding the requirement that old states be used in place of new states only when an old state is identical to a new state. Instead, in an approximate weighted finite-state automaton, old states will be used in place of new states when each of the remainders of the new state is sufficiently close to the corresponding remainder of the old state. An error tolerance parameter .tau. defines whether the remainders of the new state are sufficiently close to the corresponding remainders of the old state. If the remainders of the new state are sufficiently close to the remainders of the old state, a new transition is created from a current state to the old state rather than the new state. Such approximate weighted finite-state automata allow the size of the resulting deterministic finite-state automata to be reduced and can prevent the expansion that would otherwise occur in some deterministic finite-state automata.
摘要翻译：可以构造近似加权有限状态自动机来代替加权有限状态自动机，只要近似加权有限状态自动机在加权有限状态自动机中维持原始最佳字符串的足够部分，并且足够少的虚拟字符串与加权有限状态自动机相比，被引入近似加权有限状态自动机。在确定期间，可以通过丢弃仅在旧状态与新状态相同的旧状态来代替新状态的要求时，可以通过非确定性加权有限状态自动机来创建近似加权有限状态自动机。相反，在近似加权有限状态自动机中，当新状态的每个剩余部分足够接近旧状态的相应剩余部分时，将使用旧状态代替新状态。容差参数tau定义新状态的剩余部分是否足够接近旧状态的相应剩余部分。如果新的国家的剩余部分与旧国家的剩余国家相当接近，那么从现在的国家到旧的国家而不是新的国家就形成了新的转型。这种近似加权有限状态自动机允许所得到的确定性有限状态自动机的大小减小，并且可以防止否则将在某些确定性有限状态自动机中发生的扩展。

10. 发明授权

US07269628B1 Graph algorithm for common neighborhood analysis 失效
标题翻译：常用邻域分析的图算法
公开(公告)号：US07269628B1
公开(公告)日：2007-09-11
申请号：US10744467
申请日：2003-12-23
申请人： Adam Louis Buchsbaum , Raffaele Giancarlo , Jeffery Rex Westbrook
发明人： Adam Louis Buchsbaum , Raffaele Giancarlo , Jeffery Rex Westbrook
IPC分类号： H06F15/16
CPC分类号： H04L67/22 , G06Q30/0241 , H04L67/02 , H04L67/28 , H04L67/2847 , Y10S707/99936 , Y10S707/99945 , Y10S707/99948
摘要： A system and method of determining a common neighborhood of users sharing a common activity from a plurality of users is provided. The system and method may be used to predict, for a user in the common neighborhood of users, a potential activity from the activities of at least one other user in the common neighborhood of users.
摘要翻译：提供了一种确定来自多个用户共享共同活动的用户的公共邻居的系统和方法。系统和方法可以用于针对用户的公共区域中的用户预测来自用户公共区域中的至少一个其他用户的活动的潜在活动。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式