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

1. 发明申请

US20120084636A1 METHOD AND SYSTEM FOR WEB INFORMATION EXTRACTION 有权
标题翻译：网络信息抽取方法与系统
公开(公告)号：US20120084636A1
公开(公告)日：2012-04-05
申请号：US12896942
申请日：2010-10-04
申请人： Srinivasan Hanumantha Rao SENGAMEDU , Charu Tiwari , Amit Madaan , Rupesh Rasiklal Mehta , S. R. Jeyashankher , Rajeev Rastogi
发明人： Srinivasan Hanumantha Rao SENGAMEDU , Charu Tiwari , Amit Madaan , Rupesh Rasiklal Mehta , S. R. Jeyashankher , Rajeev Rastogi
IPC分类号： G06F17/00
CPC分类号： G06F17/2282 , G06F17/2247 , G06F17/30864 , G06F17/30911
摘要： An example of a method includes determining features of a first type for a web page of a plurality of web pages. The method also includes electronically determining a plurality of rules for an attribute of the first web page, wherein the plurality of rules are determined based on features of the first type. The method also includes electronically identifying a first rule, from the plurality of rules, which satisfies a first predefined criterion. The first predefined criteria include at least one of a first threshold for a precision parameter, a second threshold for a support parameter, a third threshold for a distance parameter and a fourth threshold for a recall parameter. The method further includes storing the first rule to enable extraction of value of the attribute from a second web page.
摘要翻译：一种方法的示例包括确定多个网页中的网页的第一类型的特征。该方法还包括电子地确定用于第一网页的属性的多个规则，其中基于第一类型的特征来确定多个规则。该方法还包括从满足第一预定准则的多个规则中电子地识别第一规则。第一预定准则包括精度参数的第一阈值，支持参数的第二阈值，距离参数的第三阈值和召回参数的第四阈值中的至少一个。该方法还包括存储第一规则以便能够从第二网页提取属性的值。

2. 发明授权

US09280528B2 Method and system for processing and learning rules for extracting information from incoming web pages 有权
标题翻译：用于从传入网页提取信息的处理和学习规则的方法和系统
公开(公告)号：US09280528B2
公开(公告)日：2016-03-08
申请号：US12896942
申请日：2010-10-04
申请人： Srinivasan Hanumantha Rao Sengamedu , Charu Tiwari , Amit Madaan , Rupesh Rasiklal Mehta , S R Jeyashankher , Rajeev Rastogi
发明人： Srinivasan Hanumantha Rao Sengamedu , Charu Tiwari , Amit Madaan , Rupesh Rasiklal Mehta , S R Jeyashankher , Rajeev Rastogi
IPC分类号： G06F17/00 , G06F17/22 , G06F17/30
CPC分类号： G06F17/2282 , G06F17/2247 , G06F17/30864 , G06F17/30911
摘要： An example of a method includes determining features of a first type for a web page of a plurality of web pages. The method also includes electronically determining a plurality of rules for an attribute of the first web page, wherein the plurality of rules are determined based on features of the first type. The method also includes electronically identifying a first rule, from the plurality of rules, which satisfies a first predefined criterion. The first predefined criteria include at least one of a first threshold for a precision parameter, a second threshold for a support parameter, a third threshold for a distance parameter and a fourth threshold for a recall parameter. The method further includes storing the first rule to enable extraction of value of the attribute from a second web page.
摘要翻译：一种方法的示例包括确定多个网页中的网页的第一类型的特征。该方法还包括电子地确定用于第一网页的属性的多个规则，其中基于第一类型的特征来确定多个规则。该方法还包括从满足第一预定准则的多个规则中电子地识别第一规则。第一预定标准包括精度参数的第一阈值，支持参数的第二阈值，距离参数的第三阈值和用于召回参数的第四阈值中的至少一个。该方法还包括存储第一规则以便能够从第二网页提取属性的值。

3. 发明申请

US20120005207A1 METHOD AND SYSTEM FOR WEB EXTRACTION 审中-公开
标题翻译：网络提取的方法和系统
公开(公告)号：US20120005207A1
公开(公告)日：2012-01-05
申请号：US12828305
申请日：2010-07-01
申请人： Pankaj Gulhane , Srinivasan Hanumantha Rao Sengamedu , Ashwin Tengli , Rajeev Rastogi
发明人： Pankaj Gulhane , Srinivasan Hanumantha Rao Sengamedu , Ashwin Tengli , Rajeev Rastogi
IPC分类号： G06F17/30
CPC分类号： G06F16/9535
摘要： A method includes generating, a plurality of sets of pairs of records from a set of records, for each attribute-position pair in the set of records. Each attribute-position pair being indicative of a position of an attribute in a record. Further, the method includes forming, electronically, a plurality of groups, each group comprising two attribute-position pairs having different attributes. Further, the method also includes determining, electronically for each group, number of pairs of records that are common in the two attribute-position pairs of that group. Furthermore, the method includes extracting results based on a first group of the plurality of groups if the number of pairs of records that are common in the two attribute-position pairs of the first group is greater than a second threshold, is highest among the plurality of groups, and no group having three or more attribute-position pairs with different attributes is possible.
摘要翻译：一种方法包括针对该组记录中的每个属性位置对，从一组记录生成多组记录对。每个属性位置对指示记录中属性的位置。此外，该方法包括以电子方式形成多个组，每个组包括具有不同属性的两个属性位置对。此外，该方法还包括以电子方式确定每组的在该组的两个属性位置对中共有的记录对数。此外，该方法包括：如果第一组的两个属性位置对中共同的记录对数大于第二阈值，则基于多个组中的第一组来提取结果，在多个组中是最高的的组，并且没有具有三个或更多个具有不同属性的属性位置对的组是可能的。

4. 发明申请

US20110225173A1 METHOD AND SYSTEM FOR DETERMINING SIMILARITY SCORE 有权
标题翻译：用于确定相似度的方法和系统
公开(公告)号：US20110225173A1
公开(公告)日：2011-09-15
申请号：US12721577
申请日：2010-03-11
申请人： Pankaj Gulhane , Srinivasan Hanumantha Rao Sengamedu , Ashwin Tengli , Rajeev Rastogi
发明人： Pankaj Gulhane , Srinivasan Hanumantha Rao Sengamedu , Ashwin Tengli , Rajeev Rastogi
IPC分类号： G06F17/30
CPC分类号： G06K9/3266 , G06K9/723 , G06K2209/01
摘要： A method includes generating, electronically, one or more matching patterns for one or more pairs of attribute values. Each pair includes two attribute values. The two attribute values include a first attribute value from a first record and a second attribute value from a second record. The first attribute value and the second attribute value satisfy a first criterion. Further, the method includes identifying, electronically, matching segment between the first attribute value and the second attribute value of a first pair. The method also includes repeating identifying for each pair. Moreover, the method includes computing a similarity score for the first pair using one of the first pair and the matching segment based on the one or more matching patterns and matching segments of the one or more pairs satisfying a second criterion. The method also includes repeating computing for each pair.
摘要翻译：一种方法包括以电子方式生成一对或多对属性值的一个或多个匹配模式。每对包含两个属性值。两个属性值包括来自第一记录的第一属性值和来自第二记录的第二属性值。第一属性值和第二属性值满足第一标准。此外，该方法包括识别电子地匹配第一属性值与第一对的第二属性值之间的片段。该方法还包括每对重复识别。此外，该方法包括基于一个或多个匹配模式和满足第二标准的一个或多个对中的匹配片段，使用第一对和匹配片段中的一个来计算第一对的相似性得分。该方法还包括对每对重复计算。

5. 发明授权

US08620930B2 Method and system for determining similarity score 有权
标题翻译：确定相似度得分的方法和系统
公开(公告)号：US08620930B2
公开(公告)日：2013-12-31
申请号：US12721577
申请日：2010-03-11
申请人： Pankaj Gulhane , Srinivasan Hanumantha Rao Sengamedu , Ashwin Tengli , Rajeev Rastogi
发明人： Pankaj Gulhane , Srinivasan Hanumantha Rao Sengamedu , Ashwin Tengli , Rajeev Rastogi
IPC分类号： G06F7/00
CPC分类号： G06K9/3266 , G06K9/723 , G06K2209/01
摘要： A method includes generating, electronically, one or more matching patterns for one or more pairs of attribute values. Each pair includes two attribute values. The two attribute values include a first attribute value from a first record and a second attribute value from a second record. The first attribute value and the second attribute value satisfy a first criterion. Further, the method includes identifying, electronically, matching segment between the first attribute value and the second attribute value of a first pair. The method also includes repeating identifying for each pair. Moreover, the method includes computing a similarity score for the first pair using one of the first pair and the matching segment based on the one or more matching patterns and matching segments of the one or more pairs satisfying a second criterion. The method also includes repeating computing for each pair.
摘要翻译：一种方法包括以电子方式生成一对或多对属性值的一个或多个匹配模式。每对包含两个属性值。两个属性值包括来自第一记录的第一属性值和来自第二记录的第二属性值。第一属性值和第二属性值满足第一标准。此外，该方法包括识别电子地匹配第一属性值与第一对的第二属性值之间的片段。该方法还包括对每对重复识别。此外，该方法包括基于一个或多个匹配模式和满足第二标准的一个或多个对中的匹配片段，使用第一对和匹配片段中的一个来计算第一对的相似性得分。该方法还包括对每对重复计算。

6. 发明申请

US20090077156A1 Efficient constraint monitoring using adaptive thresholds 审中-公开
标题翻译：使用自适应阈值的有效约束监测
公开(公告)号：US20090077156A1
公开(公告)日：2009-03-19
申请号：US12010942
申请日：2008-01-31
申请人： Srinivas Raghav Kashyap , Rajeev Rastogi , S. R. Jeyashankher , Pushpraj Shukla
发明人： Srinivas Raghav Kashyap , Rajeev Rastogi , S. R. Jeyashankher , Pushpraj Shukla
IPC分类号： G06F15/177 , G06F15/16
CPC分类号： A61B18/1445 , A61B18/1402 , A61B2017/0046 , A61B2017/2945 , A61B2018/00607 , A61B2018/1432
摘要： Methods for tracking anomalous behavior in a network referred to as non-zero slack schemes are provided. The non-zero slack schemes reduce the number of communication messages in the network necessary to monitor emerging large-scale, distributed systems using distributed computation algorithms by generating more optimal local constraints for each remote site in the system.
摘要翻译：提供了用于跟踪称为非零松弛方案的网络中的异常行为的方法。非零松弛方案减少了使用分布式计算算法监视新兴大型分布式系统所需的通信消息数量，为系统中的每个远程站点生成更多的最优局部约束。

7. 发明授权

US08010121B2 Channel allocation for wireless mesh networks 有权
标题翻译：无线网状网络的信道分配
公开(公告)号：US08010121B2
公开(公告)日：2011-08-30
申请号：US11797562
申请日：2007-05-04
申请人： Partha Dutta , Sharad Jaiswal , Rajeev Rastogi
发明人： Partha Dutta , Sharad Jaiswal , Rajeev Rastogi
IPC分类号： H04W4/00
CPC分类号： H04W84/18 , H04W16/28 , H04W72/04
摘要： An example embodiment includes determining a cut of a graph to obtain a bi-partite sub-graph, where the graph represents a plurality of nodes and links between the plurality of nodes in a wireless mesh network. A channel is assigned to the bi-partite graph, and the obtained bi-partite subgraph is removed from the graph. The determining, assigning and removing steps are repeated until the graph has been divided into k bi-partite subgraphs, where k is the number of channels being used for scheduling.
摘要翻译：示例实施例包括确定图形的切割以获得双分子图，其中图表示无线网状网络中的多个节点之间的多个节点和链路。将通道分配给双分图，并从图中除去获得的双分子图。重复确定，分配和删除步骤，直到该图被划分为k个双分子子图，其中k是用于调度的信道数。

8. 发明申请

US20080159316A1 Channel allocation for wireless mesh networks 有权
标题翻译：无线网状网络的信道分配
公开(公告)号：US20080159316A1
公开(公告)日：2008-07-03
申请号：US11797562
申请日：2007-05-04
申请人： Partha Dutta , Sharad Jaiswal , Rajeev Rastogi
发明人： Partha Dutta , Sharad Jaiswal , Rajeev Rastogi
IPC分类号： H04L12/28
CPC分类号： H04W84/18 , H04W16/28 , H04W72/04
摘要： An example embodiment includes determining a cut of a graph to obtain a bi-partite sub-graph, where the graph represents a plurality of nodes and links between the plurality of nodes in a wireless mesh network. A channel is assigned to the bi-partite graph, and the obtained bi-partite subgraph is removed from the graph. The determining, assigning and removing steps are repeated until the graph has been divided into k bipartite subgraphs, where k is the number of channels being used for scheduling.
摘要翻译：示例实施例包括确定图形的切割以获得双分子图，其中图表示无线网状网络中的多个节点之间的多个节点和链路。将通道分配给双分图，并从图中除去获得的双分子图。重复确定，分配和删除步骤，直到图被划分为k个二分图，其中k是用于调度的信道数。

9. 发明申请

US20080059439A1 Query Translation from XPath to SQL in the Presence of Recursive DTDs 审中-公开
标题翻译：在递归DTD的存在下，从XPath到SQL的查询翻译
公开(公告)号：US20080059439A1
公开(公告)日：2008-03-06
申请号：US11468533
申请日：2006-08-30
申请人： Wenfei Fan , Rajeev Rastogi
发明人： Wenfei Fan , Rajeev Rastogi
IPC分类号： G06F17/30
CPC分类号： G06F17/2205 , G06F16/8358 , G06F16/86 , G06F17/2229 , G06F17/2247
摘要： The invention provides a system and method for translating XPATH queries into SQL queries with a simple least fixpoint (LFP) operator, which is already supported by most commercial RDBMS. The method comprises the steps of (a) rewriting an input query into a regular query, which is capable of capturing both DTD recursion and XPATH queries in a uniform framework; and (b) translating the regular query to an SQL query with LFP. The invention further provides optimization techniques for reducing the use of the LFP operator. As a result, the invention is capable of answering a large class of XPATH queries by means of only low-end RDBMS features already available in most RDBMS.
摘要翻译：本发明提供了一种用于将 XPATH 查询转换为 SQL 查询的系统和方法，该查询具有简单的最低修正点（ LFP ）运算符，它已被最商业的 RDBMS 。该方法包括以下步骤：（a）将输入查询重写为常规查询，其能够在统一框架中捕获 DTD 递归和 XPATH 查询; 和（b）使用 LFP 将常规查询转换为 SQL 查询。本发明还提供了用于减少 LFP 运算符的使用的优化技术。因此，本发明能够通过仅在大多数 RDBMS中已经提供的低端 RDBMS 功能来回答大量 XPATH 查询。

10. 发明授权

US07328220B2 Sketch-based multi-query processing over data streams 有权
标题翻译：基于草图的数据流多查询处理
公开(公告)号：US07328220B2
公开(公告)日：2008-02-05
申请号：US11025211
申请日：2004-12-29
申请人： Alin Dobra , Johannes Gehrke , Rajeev Rastogi , Minos Garofalakis
发明人： Alin Dobra , Johannes Gehrke , Rajeev Rastogi , Minos Garofalakis
IPC分类号： G06F17/00
CPC分类号： G06F17/30516 , G06F17/3046 , Y10S707/99936 , Y10S707/99942
摘要： A method of efficiently providing estimated answers to workloads of aggregate, multi-join SQL-like queries over a number of input data-streams. The method only examines each data elements once and uses a limited amount of computer memory. The method uses join graphs and atomic sketches that are essentially pseudo-random summaries formed using random binary variables. The estimated answer is the product of all the atomic sketches for all the vertices in the query join graph. A query workload is processed efficiently by identifying and sharing atomic sketches common to distinct queries, while ensuring that the join graphs remain well formed. The method may automatically minimize either the average query error or the maximum query error over the workload.
摘要翻译：一种有效提供对多个输入数据流的聚合，多连接SQL类查询的工作负载的估计答案的方法。该方法仅检查每个数据元素一次并使用有限数量的计算机存储器。该方法使用连接图和原子素描，它们本质上是使用随机二进制变量形成的伪随机摘要。估计答案是查询连接图中所有顶点的所有原子草图的乘积。通过识别和共享不同查询共同的原子草图，同时确保连接图形式保持良好，可以有效地处理查询工作负载。该方法可以自动最小化平均查询错误或工作负载上的最大查询错误。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式