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

1. 发明授权

US09177343B2 Conservation dependencies 有权
标题翻译：保护依赖
公开(公告)号：US09177343B2
公开(公告)日：2015-11-03
申请号：US12927770
申请日：2010-11-23
申请人： Lukasz Golab , Howard Karloff , Philip Korn , Divesh Srivastava , Barna Saha
发明人： Lukasz Golab , Howard Karloff , Philip Korn , Divesh Srivastava , Barna Saha
IPC分类号： G06N5/02 , G06Q40/02
CPC分类号： G06Q40/025 , G06N5/02
摘要： Given a set of data for which a conservation law is an appropriate characterization, “hold” and/or “fail” tableaux are provided for the underlying conservation law, thereby providing a conservation dependency whereby portions of the data for which the law approximately holds or fails can be discovered and summarized in a semantically meaningful way.
摘要翻译：给定一套保护法是适当表征的数据，为基础守恒定律提供“保持”和/或“失败”表，从而提供保护依赖性，依赖于法律约束的数据部分或可以以语义有意义的方式发现和总结失败。

2. 发明申请

US20120130935A1 Conservation dependencies 有权
标题翻译：保护依赖
公开(公告)号：US20120130935A1
公开(公告)日：2012-05-24
申请号：US12927770
申请日：2010-11-23
申请人： Lukasz Golab , Howard Karloff , Philip Korn , Divesh Srivastava , Barna Saha
发明人： Lukasz Golab , Howard Karloff , Philip Korn , Divesh Srivastava , Barna Saha
IPC分类号： G06N5/02
CPC分类号： G06Q40/025 , G06N5/02
摘要： Given a set of data for which a conservation law is an appropriate characterization, “hold” and/or “fail” tableaux are provided for the underlying conservation law, thereby providing a conservation dependency whereby portions of the data for which the law approximately holds or fails can be discovered and summarized in a semantically meaningful way.
摘要翻译：给定一套保护法是适当表征的数据，为基础守恒定律提供“保持”和/或“失败”表，从而提供保护依赖性，依赖于法律约束的数据部分或可以以语义有意义的方式发现和总结失败。

3. 发明授权

US08645309B2 Processing data using sequential dependencies 有权
标题翻译：使用顺序依赖来处理数据
公开(公告)号：US08645309B2
公开(公告)日：2014-02-04
申请号：US12592586
申请日：2009-11-30
申请人： Lukasz Golab , Howard Karloff , Philip Korn , Divesh Srivastava , Avishek Saha
发明人： Lukasz Golab , Howard Karloff , Philip Korn , Divesh Srivastava , Avishek Saha
IPC分类号： G06F17/00 , G06N7/04 , G06N5/02 , G06N7/00 , G06N7/08 , G06F11/00 , G06F11/30 , G06C25/00 , H03M13/00 , H04L1/00
CPC分类号： G06N7/00 , G06N5/00
摘要： The specification describes data processes for analyzing large data steams for target anomalies. “Sequential dependencies” (SDs) are chosen for ordered data and present a framework for discovering which subsets of the data obey a given sequential dependency. Given an interval G, an SD on attributes X and Y, written as X→G Y, denotes that the distance between the Y-values of any two consecutive records, when sorted on X, are within G. SDs may be extended to Conditional Sequential Dependencies (CSDs), consisting of an underlying SD plus a representation of the subsets of the data that satisfy the SD. The conditional approximate sequential dependencies may be expressed as pattern tableaux, i.e., compact representations of the subsets of the data that satisfy the underlying dependency.
摘要翻译：该规范描述了用于分析目标异常的大型数据流的数据处理。为有序数据选择“顺序依赖”（SDs），并提供一个框架，用于发现数据的哪些子集服从给定的顺序依赖。给定一个间隔G，写入X> GY的属性X和Y上的SD表示当在X上排序时，任何两个连续记录的Y值之间的距离在G之内可以扩展到条件顺序依赖性（CSD）由基础SD加上满足SD的数据子集的表示组成。条件近似顺序依赖性可以表示为模式表，即满足基础依赖性的数据子集的紧凑表示。

4. 发明授权

US08639667B2 Generating conditional functional dependencies 失效
标题翻译：生成条件函数依赖
公开(公告)号：US08639667B2
公开(公告)日：2014-01-28
申请号：US12380858
申请日：2009-03-03
申请人： Lukasz Golab , Howard Karloff , Philip Korn , Divesh Srivastava , Bei Yu
发明人： Lukasz Golab , Howard Karloff , Philip Korn , Divesh Srivastava , Bei Yu
IPC分类号： G06F7/00 , G06F17/00 , G06F17/30
CPC分类号： G06F17/30604
摘要： Techniques are disclosed for generating conditional functional dependency (CFD) pattern tableaux having the desirable properties of support, confidence and parsimony. These techniques include both a greedy algorithm for generating a tableau and, for large data sets, an “on-demand” algorithm that outperforms the basic greedy algorithm in running time by an order of magnitude. In addition, a range tableau, as a generalization of a pattern tableau, can achieve even more parsimony.
摘要翻译：公开了用于产生具有所需性质的支持，置信和简约的条件功能依赖（CFD）模式表的技术。这些技术既包括用于生成表格的贪心算法，又包括用于大数据集的“按需”算法，其在运行时间上超过基本贪心算法一个数量级。另外，作为模式表格的泛化，范围表可以实现更加简单。

5. 发明申请

US20110131170A1 Processing data using sequential dependencies 有权
标题翻译：使用顺序依赖来处理数据
公开(公告)号：US20110131170A1
公开(公告)日：2011-06-02
申请号：US12592586
申请日：2009-11-30
申请人： Lukasz Golab , Howard Karloff , Philip Korn , Divesh Srivastava , Avishek Saha
发明人： Lukasz Golab , Howard Karloff , Philip Korn , Divesh Srivastava , Avishek Saha
IPC分类号： G06N5/02
CPC分类号： G06N7/00 , G06N5/00
摘要： The specification describes data processes for analyzing large data steams for target anomalies. “Sequential dependencies” (SDs) are chosen for ordered data and present a framework for discovering which subsets of the data obey a given sequential dependency. Given an interval G, an SD on attributes X and Y, written as X→G Y, denotes that the distance between the Y-values of any two consecutive records, when sorted on X, are within G. SDs may be extended to Conditional Sequential Dependencies (CSDs), consisting of an underlying SD plus a representation of the subsets of the data that satisfy the SD. The conditional approximate sequential dependencies may be expressed as pattern tableaux, i.e., compact representations of the subsets of the data that satisfy the underlying dependency.
摘要翻译：该规范描述了用于分析目标异常的大型数据流的数据处理。为有序数据选择“顺序依赖”（SDs），并提供一个框架，用于发现数据的哪些子集服从给定的顺序依赖。给定间隔G，写入X→GY的属性X和Y上的SD表示当在X上排序时任何两个连续记录的Y值之间的距离在G内。可以扩展到条件序列依赖关系（CSDs）由基础SD加上满足SD的数据子集的表示组成。条件近似顺序依赖性可以表示为模式表，即满足基础依赖性的数据子集的紧凑表示。

6. 发明申请

US20090287721A1 Generating conditional functional dependencies 失效
标题翻译：生成条件函数依赖
公开(公告)号：US20090287721A1
公开(公告)日：2009-11-19
申请号：US12380858
申请日：2009-03-03
申请人： Lukasz Golab , Howard Karloff , Philip Korn , Divesh Srivastava , Bei Yu
发明人： Lukasz Golab , Howard Karloff , Philip Korn , Divesh Srivastava , Bei Yu
IPC分类号： G06F17/30
CPC分类号： G06F17/30604
摘要： Techniques are disclosed for generating conditional functional dependency (CFD) pattern tableaux having the desirable properties of support, confidence and parsimony. These techniques include both a greedy algorithm for generating a tableau and, for large data sets, an “on-demand” algorithm that outperforms the basic greedy algorithm in running time by an order of magnitude. In addition, a range tableau, as a generalization of a pattern tableau, can achieve even more parsimony.
摘要翻译：公开了用于产生具有所需性质的支持，置信和简约的条件功能依赖（CFD）模式表的技术。这些技术既包括用于生成表格的贪心算法，又包括用于大数据集的“按需”算法，其在运行时间上超过基本贪心算法一个数量级。另外，作为模式表格的泛化，范围表可以实现更加简单。

7. 发明授权

US08856071B2 Minimizing staleness in real-time data warehouses 有权
标题翻译：最小化实时数据仓库的陈旧度
公开(公告)号：US08856071B2
公开(公告)日：2014-10-07
申请号：US12539429
申请日：2009-08-11
申请人： Lukasz Golab , Mohammad Hossein Bateni , Mohammad Hajiaghayi , Howard Karloff
发明人： Lukasz Golab , Mohammad Hossein Bateni , Mohammad Hajiaghayi , Howard Karloff
IPC分类号： G06F17/30
CPC分类号： G06F17/30445
摘要： Data tables in data warehouses are updated to minimize staleness and stretch of the data tables. New data is received from external sources and, in response, update requests are generated. Accumulated update requests may be batched. Data tables may be weighted to affect the order in which update requests are serviced.
摘要翻译：更新数据仓库中的数据表以最小化数据表的陈旧和伸展。从外部来源收到新的数据，作为响应，生成更新请求。累积的更新请求可以批量。数据表可能被加权以影响更新请求被服务的顺序。

8. 发明申请

US20110040727A1 MINIMIZING STALENESS IN REAL-TIME DATA WAREHOUSES 有权
标题翻译：最小化实时数据仓库的稳定性
公开(公告)号：US20110040727A1
公开(公告)日：2011-02-17
申请号：US12539429
申请日：2009-08-11
申请人： Lukasz Golab , Mohammad Hossein Bateni , Mohammad Hajiaghayi , Howard Karloff
发明人： Lukasz Golab , Mohammad Hossein Bateni , Mohammad Hajiaghayi , Howard Karloff
IPC分类号： G06F17/30 , G06F9/46
CPC分类号： G06F17/30445
摘要： Data tables in data warehouses are updated to minimize staleness and stretch of the data tables. New data is received from external sources and, in response, update requests are generated. Accumulated update requests may be batched. Data tables may be weighted to affect the order in which update requests are serviced.
摘要翻译：更新数据仓库中的数据表以最小化数据表的陈旧和伸展。从外部来源收到新的数据，作为响应，生成更新请求。累积的更新请求可以批量。数据表可能被加权以影响更新请求被服务的顺序。

9. 发明申请

US20100008368A1 Method for selecting nodes in a network 失效
标题翻译：选择网络中节点的方法
公开(公告)号：US20100008368A1
公开(公告)日：2010-01-14
申请号：US12217705
申请日：2008-07-08
申请人： Howard Karloff
发明人： Howard Karloff
IPC分类号： G01R31/08
CPC分类号： H04L45/00 , H04L45/128
摘要： Given a set of network nodes B that are sought to be monitored, and a set of potential monitoring nodes, a subset M of the monitoring nodes is chosen that insures monitoring each node b in B with a pair of nodes mi and mj such that no node except b is on both any shortest path from b to mi and on any shortest path from b to mj. Some of the nodes in Mare chosen in a first step by identifying a subset of B having nodes b that are “t-good” nodes, choosing a subset of potential monitoring nodes as First Partner nodes, and choosing a corresponding subset of potential monitoring nodes as Second Partner nodes. Others are chosen in a second step that handles nodes b that are not “t-good,” using a greedy algorithm.
摘要翻译：给定一组寻求被监视的网络节点B和一组潜在的监控节点，选择监视节点的子集M，以确保用B对中的每个节点b与一对节点mi和mj进行监视，使得no 除b之外的节点在从b到mi的任何最短路径以及从b到mj的任何最短路径上。通过识别具有节点b的“t-good”节点的B的子集，选择潜在监控节点的子集作为第一伙伴节点，并选择潜在监控节点的对应子集，在第一步中选择的一些节点作为第二伙伴节点。使用贪婪算法，在第二步中选择其他选项来处理不是“t-good”的节点b。

10. 发明授权

US07958075B1 Compressing rectilinear pictures and minimizing access control lists 有权
标题翻译：压缩直线图像并最小化访问控制列表
公开(公告)号：US07958075B1
公开(公告)日：2011-06-07
申请号：US11824073
申请日：2007-06-28
申请人： David L. Applegate , Gruia Calinescu , David S. Johnson , Howard Karloff , Katrina Ligett , Jia Wang
发明人： David L. Applegate , Gruia Calinescu , David S. Johnson , Howard Karloff , Katrina Ligett , Jia Wang
IPC分类号： G06F17/00 , G06N5/02
CPC分类号： H04L49/3009 , G06N5/025 , G06T9/00
摘要： A geometric model is considered for the problem of minimizing access control lists (ACLs) in network routers. A colored rectilinear pattern is created within an initially white rectangular canvas, and the basic operation is to choose a subrectangle and paint it a single color, overwriting all previous colors in the rectangle. The method operates on rectangular rule lists (RRLs) and access control lists (ACLs) in which all rectangles are strips that extend either the full length or the full height of the canvas. A polynomial-time algorithm optimally constructs such patterns when, as in the ACL application, the only colors are black and white (permit or deny). That algorithm is complemented by a significantly faster approximation algorithm that is guaranteed to be no worse than 3/2 optimal.
摘要翻译：考虑到网络路由器访问控制列表（ACL）最小化问题的几何模型。在最初的白色矩形画布中创建一个彩色的直线图案，基本操作是选择一个子矩形，并绘制一个单一的颜色，覆盖矩形中的所有以前的颜色。该方法适用于矩形规则列表（RRL）和访问控制列表（ACL），其中所有矩形都是延伸画布全长或全高的条带。当在ACL应用程序中，唯一的颜色是黑色和白色（允许或拒绝）时，多项式时间算法最佳地构建这样的模式。该算法由明显更快的逼近算法补充，保证不比3/2最优。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式