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

1. 发明授权

US07844581B2 Methods and systems for data management using multiple selection criteria 有权
标题翻译：使用多种选择标准进行数据管理的方法和系统
公开(公告)号：US07844581B2
公开(公告)日：2010-11-30
申请号：US11566122
申请日：2006-12-01
申请人： Cezary Dubnicki , Krzysztof Lichota , Erik Kruus , Cristian Ungureanu
发明人： Cezary Dubnicki , Krzysztof Lichota , Erik Kruus , Cristian Ungureanu
IPC分类号： G06F7/00
CPC分类号： G06F17/30159
摘要： Systems and methods for data management and data processing are provided. Embodiments may include systems and methods relating to fast data selection with reasonably high quality results, and may include a faster data selection function and a slower data selection function. Various embodiments may include systems and methods relating to data hashing and/or data redundancy identification and elimination for a data set or a string of data. Embodiments may include a first selection function is used to pre-select boundary points or data blocks/windows from a data set or data stream and a second selection function is used to refine the boundary points or data blocks/windows. The second selection function may be better at determining the best places for boundary points or data blocks/windows in the data set or data stream. In various embodiments, data may be processed by a first faster hash function and slower more discriminating second hash function.
摘要翻译：提供了数据管理和数据处理的系统和方法。实施例可以包括与具有相当高质量结果的快速数据选择相关的系统和方法，并且可以包括更快的数据选择功能和较慢的数据选择功能。各种实施例可以包括与用于数据集或一串数据的数据散列和/或数据冗余识别和消除有关的系统和方法。实施例可以包括第一选择功能用于从数据集或数据流中预先选择边界点或数据块/窗口，并且使用第二选择功能来细化边界点或数据块/窗口。在确定数据集或数据流中的边界点或数据块/窗口的最佳位置时，第二选择功能可能更好。在各种实施例中，可以通过第一更快的散列函数和较慢的更多辨别的第二散列函数来处理数据。

2. 发明申请

US20080133446A1 METHODS AND SYSTEMS FOR DATA MANAGEMENT USING MULTIPLE SELECTION CRITERIA 有权
标题翻译：使用多种选择标准进行数据管理的方法和系统
公开(公告)号：US20080133446A1
公开(公告)日：2008-06-05
申请号：US11566122
申请日：2006-12-01
申请人： Cezary Dubnicki , Krzysztof Lichota , Erik Kruus , Cristian Ungureanu
发明人： Cezary Dubnicki , Krzysztof Lichota , Erik Kruus , Cristian Ungureanu
IPC分类号： G06F17/30
CPC分类号： G06F17/30159
摘要： Systems and methods for data management and data processing are provided. Embodiments may include systems and methods relating to fast data selection with reasonably high quality results, and may include a faster data selection function and a slower data selection function. Various embodiments may include systems and methods relating to data hashing and/or data redundancy identification and elimination for a data set or a string of data. Embodiments may include a first selection function is used to pre-select boundary points or data blocks/windows from a data set or data stream and a second selection function is used to refine the boundary points or data blocks/windows. The second selection function may be better at determining the best places for boundary points or data blocks/windows in the data set or data stream. In various embodiments, data may be processed by a first faster hash function and slower more discriminating second hash function.
摘要翻译：提供了数据管理和数据处理的系统和方法。实施例可以包括与具有相当高质量结果的快速数据选择相关的系统和方法，并且可以包括更快的数据选择功能和较慢的数据选择功能。各种实施例可以包括与用于数据集或一串数据的数据散列和/或数据冗余识别和消除有关的系统和方法。实施例可以包括第一选择功能用于从数据集或数据流中预先选择边界点或数据块/窗口，并且使用第二选择功能来细化边界点或数据块/窗口。在确定数据集或数据流中的边界点或数据块/窗口的最佳位置时，第二选择功能可能更好。在各种实施例中，可以通过第一更快的散列函数和较慢的更多辨别的第二散列函数来处理数据。

3. 发明授权

US08214517B2 Methods and systems for quick and efficient data management and/or processing 有权
标题翻译：快速有效的数据管理和/或处理的方法和系统
公开(公告)号：US08214517B2
公开(公告)日：2012-07-03
申请号：US11566139
申请日：2006-12-01
申请人： Cezary Dubnicki , Erik Kruus , Cristian Ungureanu
发明人： Cezary Dubnicki , Erik Kruus , Cristian Ungureanu
IPC分类号： G06F15/16 , G06F7/00 , G06F17/00
CPC分类号： H04L65/4084 , G06F11/1453 , G06F17/30073 , G06F17/30153 , H04L65/607 , H04L67/325 , H04L69/04
摘要： System(s) and method(s) are provided for data management and data processing. For example, various embodiments may include systems and methods relating to relatively larger groups of data being selected with comparable or better performing selection results (e.g., high data redundancy elimination and/or average chunk size). In various embodiments, the system(s) and method(s) may include, for example a data group, block, or chunk combining technique or/and a data group, block, or chunk splitting technique. Various embodiments may include a first standard or typical data grouping, blocking, or chunking technique and/or data group, block, or chunk combining technique or/and a data group, block, or chunk splitting technique. Exemplary system(s) and method(s) may relate to data hashing and/or data elimination. Embodiments may include a look-ahead buffer and determine whether to emit small chunks or large chunks based on characteristics of underlying data and/or particular application of the invention (e.g., for backup).
摘要翻译：提供系统和方法用于数据管理和数据处理。例如，各种实施例可以包括与具有相当或更好执行的选择结果（例如，高数据冗余消除和/或平均块大小）选择的相对较大的数据组有关的系统和方法。在各种实施例中，系统和方法可以包括例如数据组，块或块组合技术或/或数据组，块或块分割技术。各种实施例可以包括第一标准或典型的数据分组，阻塞或分块技术和/或数据组，块或块组合技术或/或数据组，块或块分割技术。示例性系统和方法可以涉及数据散列和/或数据消除。实施例可以包括先行缓冲器，并且基于底层数据的特性和/或本发明的特定应用（例如，用于备份）来确定是否发射小块或大块。

4. 发明申请

US20080133561A1 METHODS AND SYSTEMS FOR QUICK AND EFFICIENT DATA MANAGEMENT AND/OR PROCESSING 有权
标题翻译：快速有效的数据管理和/或处理的方法和系统
公开(公告)号：US20080133561A1
公开(公告)日：2008-06-05
申请号：US11566139
申请日：2006-12-01
申请人： Cezary Dubnicki , Erik Kruus , Cristian Ungureanu
发明人： Cezary Dubnicki , Erik Kruus , Cristian Ungureanu
IPC分类号： G06F17/30 , G06F17/00 , G06F12/00
CPC分类号： H04L65/4084 , G06F11/1453 , G06F17/30073 , G06F17/30153 , H04L65/607 , H04L67/325 , H04L69/04
摘要： System(s) and method(s) are provided for data management and data processing. For example, various embodiments may include systems and methods relating to relatively larger groups of data being selected with comparable or better performing selection results (e.g., high data redundancy elimination and/or average chunk size). In various embodiments, the system(s) and method(s) may include, for example a data group, block, or chunk combining technique or/and a data group, block, or chunk splitting technique. Various embodiments may include a first standard or typical data grouping, blocking, or chunking technique and/or data group, block, or chunk combining technique or/and a data group, block, or chunk splitting technique. Exemplary system(s) and method(s) may relate to data hashing and/or data elimination. Embodiments may include a look-ahead buffer and determine whether to emit small chunks or large chunks based on characteristics of underlying data and/or particular application of the invention (e.g., for backup).
摘要翻译：提供系统和方法用于数据管理和数据处理。例如，各种实施例可以包括与具有相当或更好执行的选择结果（例如，高数据冗余消除和/或平均块大小）选择的相对较大的数据组有关的系统和方法。在各种实施例中，系统和方法可以包括例如数据组，块或块组合技术或/或数据组，块或块分割技术。各种实施例可以包括第一标准或典型的数据分组，阻塞或分块技术和/或数据组，块或块组合技术或/或数据组，块或块分割技术。示例性系统和方法可以涉及数据散列和/或数据消除。实施例可以包括先行缓冲器，并且基于底层数据的特性和/或本发明的特定应用（例如，用于备份）来确定是否发射小块或大块。

5. 发明授权

US06444724B1 Composite materials and adhesion promoters for dental applications 失效
标题翻译：复合材料和牙科应用的粘合促进剂
公开(公告)号：US06444724B1
公开(公告)日：2002-09-03
申请号：US09467173
申请日：1999-12-20
申请人： Ivan Stangel , Thomas Ellis , Erik Kruus , Edward Sacher , Robin Drew , Jingwei Xu
发明人： Ivan Stangel , Thomas Ellis , Erik Kruus , Edward Sacher , Robin Drew , Jingwei Xu
IPC分类号： A61K604
CPC分类号： C08K3/22 , A61K6/0073 , A61K6/046 , A61K6/083 , C07C321/18 , C07C323/12 , C08K3/08 , C08L43/02 , C08L33/00
摘要： Composite materials particularly suitable in the dental art as a tooth filling material including a polymer matrix, a metal, metal alloy, metal oxide particulate, or combinations thereof, in the presence or absence of colloidal silica, and a coupling agent to adhere the particulate to the polymer matrix. Adhesion can also be facilitated by cleaning and/or coating the particulates prior to incorporation into the polymer matrix. One or two paste systems of the composition with suitable initiators, accelerators, etc. can be formulated.
摘要翻译：在胶体二氧化硅的存在或不存在下，特别适合作为牙齿填充材料的复合材料，包括聚合物基质，金属，金属合金，金属氧化物颗粒或其组合，以及将颗粒粘附到聚合物基质。通过在掺入聚合物基质之前清洁和/或涂覆颗粒也可以促进粘附。可以配制具有合适的引发剂，促进剂等的组合物的一种或两种糊状体系。

6. 发明申请

US20120239372A1 EFFICIENT DISCRETE EVENT SIMULATION USING PRIORITY QUEUE TAGGING 审中-公开
标题翻译：使用优先级别的标题进行有效的离散事件模拟
公开(公告)号：US20120239372A1
公开(公告)日：2012-09-20
申请号：US13324014
申请日：2011-12-13
申请人： Erik KRUUS
发明人： Erik KRUUS
IPC分类号： G06G7/62
CPC分类号： G06F17/5022 , G06F2217/10
摘要： A method is provided for sequential discrete event simulation for a distributed system having a set of nodes. A priority queue is constructed that includes events to be executed by a processor at a given node in the set. A first subset of nodes is identified. Each node in the first subset is associated with a respective subset of events and includes a highest priority event whose priority must be unconditionally re-evaluated during a next time step. A second subset of nodes is identified. Each node in the second subset is associated with a respective other subset of events and includes a highest priority event whose priority must be re-evaluated when a re-evaluation condition depending upon an external state is satisfied. A next one of the plurality of events in the priority queue is selected to be executed by the processor using the first and second subsets of nodes.
摘要翻译：提供了一种用于具有一组节点的分布式系统的顺序离散事件模拟的方法。构建优先级队列，其包括要由集合中的给定节点处理器执行的事件。识别节点的第一个子集。第一子集中的每个节点与事件的相应子集相关联，并且包括最高优先级事件，其优先级必须在下一时间步长期间被无条件地重新评估。识别节点的第二个子集。第二子集中的每个节点与相应的其他事件子集相关联，并且包括当满足取决于外部状态的重新评估条件时必须重新评估其优先级的最高优先级事件。选择优先级队列中的多个事件中的下一个事件由处理器使用第一和第二子节点执行。

7. 发明申请

US20100082636A1 Methods and Apparatus for Content-Defined Node Splitting 审中-公开
标题翻译：内容定义节点拆分的方法和装置
公开(公告)号：US20100082636A1
公开(公告)日：2010-04-01
申请号：US12237904
申请日：2008-09-25
申请人： Erik Kruus , Cristian Ungureanu , Salil Gokhale , Akshat Aranya , Stephen A. Rago
发明人： Erik Kruus , Cristian Ungureanu , Salil Gokhale , Akshat Aranya , Stephen A. Rago
IPC分类号： G06F17/30
CPC分类号： G06F16/13
摘要： A region of a node is searched to find a content-defined split point. A split point of a node is determined based at least in part on hashes of entries in the node and the node is split based on the determined split point. The search region is searched for the first encountered split point and the node is split based on that split point. That split point is based on a predetermined bitmask of the hashes of the entries in the node satisfying a predetermined condition.
摘要翻译：搜索节点的区域以找到内容定义的分割点。至少部分地基于节点中的条目的散列来确定节点的分割点，并且基于所确定的分割点来分割节点。搜索搜索区域的第一个遇到的分割点，并且基于该分割点分割节点。该分割点基于满足预定条件的节点中的条目的散列的预定位掩码。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式