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

1. 发明申请

US20050044294A1 Method and apparatus for window matching in delta compressors 有权
标题翻译：三角压缩机窗口匹配的方法和装置
公开(公告)号：US20050044294A1
公开(公告)日：2005-02-24
申请号：US10894424
申请日：2004-07-19
申请人： Binh Vo , Kiem-Phong Vo
发明人： Binh Vo , Kiem-Phong Vo
IPC分类号： G06F17/00 , H03M7/30 , G06F11/34 , G06F3/00
CPC分类号： H03M7/30 , Y10S707/99931 , Y10S707/99935 , Y10S707/99936 , Y10S707/99942 , Y10S707/99943 , Y10S707/99945
摘要： The present invention provides efficient target file window matching within the source file for delta compressors.
摘要翻译：本发明在三角洲压缩机的源文件内提供有效的目标文件窗口匹配。

2. 发明申请

US20080040375A1 METHOD AND APPARATUS FOR WINDOWING IN ENTROPY ENCODING 有权
标题翻译： WINDOWING IN ENTROPY编码的方法和装置
公开(公告)号：US20080040375A1
公开(公告)日：2008-02-14
申请号：US11871391
申请日：2007-10-12
申请人： Binh Vo , Kiem-Phong Vo
发明人： Binh Vo , Kiem-Phong Vo
IPC分类号： G06F17/30
CPC分类号： H03M7/30 , Y10S707/99931 , Y10S707/99935 , Y10S707/99936 , Y10S707/99942 , Y10S707/99943 , Y10S707/99945
摘要： The present invention provides efficient window partitioning algorithms for entropy-encoding. The present invention enhances compression performance of entropy encoding based on the approach of modeling a dataset with the frequencies of its n-grams. The present invention may then employ approximation algorithms to compute good partitions in time O(s*log s) and O(s) respectively, for any data segment S with length s.
摘要翻译：本发明提供了用于熵编码的有效的窗口分割算法。本发明基于用其n-gram的频率建模数据集的方法来增强熵编码的压缩性能。然后，本发明可以使用近似算法来计算具有长度s的任何数据段S的时间O（s * log s）和O（s）的良好分区。

3. 发明申请

US20050055367A1 Method and apparatus for windowing in entropy encoding 失效
标题翻译：用于在熵编码中加窗的方法和装置
公开(公告)号：US20050055367A1
公开(公告)日：2005-03-10
申请号：US10894421
申请日：2004-07-19
申请人： Binh Vo , Kiem-Phong Vo
发明人： Binh Vo , Kiem-Phong Vo
IPC分类号： G06F17/00 , H03M7/30
CPC分类号： H03M7/30 , Y10S707/99931 , Y10S707/99935 , Y10S707/99936 , Y10S707/99942 , Y10S707/99943 , Y10S707/99945
摘要： The present invention provides efficient window partitioning algorithms for entropy-encoding. The present invention enhances compression performance of entropy encoding based on the approach of modeling a dataset with the frequencies of its n-grams. The present invention may then employ approximation algorithms to compute good partitions in time O(s*log s) and O(s) respectively, for any data segment S with length s.
摘要翻译：本发明提供了用于熵编码的有效的窗口分割算法。本发明基于用其n-gram的频率建模数据集的方法来增强熵编码的压缩性能。然后，本发明可以使用近似算法来计算具有长度s的任何数据段S的时间O（s * log s）和O（s）的良好分区。

4. 发明授权

US08200680B2 Method and apparatus for windowing in entropy encoding 失效
标题翻译：用于在熵编码中加窗的方法和装置
公开(公告)号：US08200680B2
公开(公告)日：2012-06-12
申请号：US13069366
申请日：2011-03-22
申请人： Binh Dao Vo , Kiem-Phong Vo
发明人： Binh Dao Vo , Kiem-Phong Vo
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： H03M7/30 , Y10S707/99931 , Y10S707/99935 , Y10S707/99936 , Y10S707/99942 , Y10S707/99943 , Y10S707/99945
摘要： The present invention provides efficient window partitioning algorithms for entropy-encoding. The present invention enhances compression performance of entropy encoding based on the approach of modeling a dataset with the frequencies of its n-grams. The present invention may then employ approximation algorithms to compute good partitions in time O(s*log s) and O(s) respectively, for any data segment S with length s.
摘要翻译：本发明提供了用于熵编码的有效的窗口分割算法。本发明基于用其n-gram的频率建模数据集的方法来增强熵编码的压缩性能。然后，本发明可以使用近似算法来计算具有长度s的任何数据段S的时间O（s * log s）和O（s）的良好分区。

5. 发明授权

US07296030B2 Method and apparatus for windowing in entropy encoding 失效
标题翻译：用于在熵编码中加窗的方法和装置
公开(公告)号：US07296030B2
公开(公告)日：2007-11-13
申请号：US10894421
申请日：2004-07-19
申请人： Binh Dao Vo , Kiem-Phong Vo
发明人： Binh Dao Vo , Kiem-Phong Vo
IPC分类号： G06F7/00 , G06F17/00
CPC分类号： H03M7/30 , Y10S707/99931 , Y10S707/99935 , Y10S707/99936 , Y10S707/99942 , Y10S707/99943 , Y10S707/99945
摘要： The present invention provides efficient window partitioning algorithms for entropy-encoding. The present invention enhances compression performance of entropy encoding based on the approach of modeling a dataset with the frequencies of its n-grams. The present invention may then employ approximation algorithms to compute good partitions in time O(s*log s) and O(s) respectively, for any data segment S with length s.
摘要翻译：本发明提供了用于熵编码的有效的窗口分割算法。本发明基于用其n-gram的频率建模数据集的方法来增强熵编码的压缩性能。然后，本发明可以使用近似算法来计算具有长度s的任何数据段S的时间O（s * log s）和O（s）的良好分区。

6. 发明授权

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的系统调用，指定访问转换文件的特定段。预加载库标识对应于指定段的块，检索并反转这些块上的变换，并将数据传递给请求它的应用程序。对于将数据写入某些段的系统调用，数据在被写回磁盘之前被库修改和重新转换。预加载库提供改进的随机访问到变换（例如压缩，加密等）文件。

7. 发明授权

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查找操作的性能以及对一般字母表执行的最长前缀匹配操作。

8. 发明申请

US20060003751A1 Real time replay service for communications network 审中-公开
标题翻译：通信网络的实时重播服务
公开(公告)号：US20060003751A1
公开(公告)日：2006-01-05
申请号：US11213511
申请日：2005-08-26
申请人： Kiem-Phong Vo
发明人： Kiem-Phong Vo
IPC分类号： H04Q7/20
CPC分类号： H04L47/10 , H04L1/1809 , H04L47/26
摘要： The present invention is a method and system for buffering and replaying a segment of a voice or data transmission. A connection is established between two end nodes in the network. At an intermediate node in the network between the end nodes, a predetermined segment of the data is maintained in a memory as a buffer. Upon receiving a request from one of the end nodes to replay the segment, that segment is replayed and transmitted to the requesting node. The request may be made by a user at one of the end nodes, or may be made automatically after detecting corrupt data. Because the buffering module is in the network, it need not be incorporated in premises or mobile equipment. Because the buffering module is remote from the requesting end node, the replayed data does not contain errors introduced in the original data between the buffering module and the requesting end node.
摘要翻译：本发明是用于缓冲和重放语音或数据传输的段的方法和系统。在网络中的两个端点之间建立连接。在终端节点之间的网络中的中间节点处，将数据的预定段作为缓冲器保存在存储器中。在从一个终端节点接收到重播该段的请求时，该段被重放并发送到请求节点。请求可以由用户在一个终端节点进行，或者可以在检测到损坏的数据之后自动进行。由于缓冲模块在网络中，因此不需要将其并入到场所或移动设备中。由于缓冲模块远离请求端节点，重放的数据不包含在缓冲模块和请求端节点之间的原始数据中引入的错误。

9. 发明授权

US6105148A Persistent state checkpoint and restoration systems 失效
标题翻译：持久状态检查点和恢复系统
公开(公告)号：US6105148A
公开(公告)日：2000-08-15
申请号：US981298
申请日：1998-03-03
申请人： Pi-Yu Chung , Yennun Huang , Chandra Kintala , Kiem-Phong Vo , Yi-Min Wang
发明人： Pi-Yu Chung , Yennun Huang , Chandra Kintala , Kiem-Phong Vo , Yi-Min Wang
IPC分类号： G06F11/14
CPC分类号： G06F11/1438
摘要： By checkpointing and restoring a user application process, that includes a volatile state and a persistent state, recovery of an application process from the checkpoint position is possible. Specifically, a volatile state is checkpointed in a checkpoint position. Next, the persistent state is monitored to detect a file operation following a checkpoint position that will modify the persistent state. Then, portions of the persistent state are checkpointed if a modification of the persistent state is about to be performed. Then, a recovery to the checkpoint position can be performed such that modifications to the persistent state since the checkpoint position are undone. This allows for resumption of the user application process from the checkpoint position.
摘要翻译： PCT No.PCT / US95 / 07629 Sec。 371日期1998年3月3日 102（e）1998年3月3日PCT提交1995年6月16日PCT公布。公开号WO97 / 00476 日期1997年1月3日通过检查和恢复包含易失性状态和持久状态的用户应用程序进程，可以从检查点位置恢复应用程序进程。具体来说，检查点位置检查点处于易失状态。接下来，监视持久状态以检测将修改持续状态的检查点位置之后的文件操作。然后，如果要执行持久状态的修改，则检查点的持久状态的部分。然后，可以执行到检查点位置的恢复，使得自检查点位置被撤销之后对持久状态的修改。这允许从检查点位置恢复用户应用程序进程。

10. 发明授权

US5673387A System and method for selecting test units to be re-run in software regression testing 失效
标题翻译：用于选择在软件回归测试中重新运行的测试单元的系统和方法
公开(公告)号：US5673387A
公开(公告)日：1997-09-30
申请号：US698164
申请日：1996-08-12
申请人： Yih-Farn Robin Chen , David Samuel Rosenblum , Kiem-Phong Vo
发明人： Yih-Farn Robin Chen , David Samuel Rosenblum , Kiem-Phong Vo
IPC分类号： G06F11/28 , G06F9/06 , G06F11/36 , G06F9/00 , G06F13/00
CPC分类号： G06F11/3676 , G06F11/3688 , Y10S707/99953 , Y10S707/99954
摘要： A system and method for selective regression testing of a software system that determines which test units of a test suite must be re-run after a modification to the software system. The entities which are covered by each test unit are identified. When the software system is modified the entities which were changed by the modification are identified. The test units which need to be re-run are determined by analyzing the change information and the coverage information to select those test units that cover changed entities.
摘要翻译：用于软件系统的选择性回归测试的系统和方法，其确定在对软件系统进行修改之后必须重新测试测试套件的哪些测试单元。识别由每个测试单元覆盖的实体。当修改软件系统时，识别出修改后的实体。需要重新运行的测试单元通过分析变更信息和覆盖信息来确定，以选择覆盖变更实体的测试单元。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式