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

11. 发明授权

US08219539B2 Search queries with shifting intent 有权
标题翻译：搜索具有转换意图的查询
公开(公告)号：US08219539B2
公开(公告)日：2012-07-10
申请号：US12419363
申请日：2009-04-07
申请人： Alan Dale Halverson , Krishnaram Kenthapadi , Nina Mishra , Aleksandrs Slivkins , Umar Ali Syed
发明人： Alan Dale Halverson , Krishnaram Kenthapadi , Nina Mishra , Aleksandrs Slivkins , Umar Ali Syed
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30864
摘要： Techniques and systems are disclosed for returning temporally-aware results from an Internet-based search query. To determine if a query is temporally-based one or more query features are collected and input into a trained classifier, yielding a temporal classification for the query. Further, if a query is classified as temporal, the query results are shifted by determining an alternate set of results for the query, and returning one or more alternate results to one or more users. Based on user interactions with the one or more alternate results, the classifier can be updated, for example, by changing the query to a non-temporal query if the user interactions identify it as such.
摘要翻译：公开了用于从基于因特网的搜索查询返回时间感知结果的技术和系统。为了确定查询是否是基于时间的，一个或多个查询特征被收集并输入到经过训练的分类器中，产生查询的时间分类。此外，如果查询被分类为时间，则通过为查询确定替代的一组结果并将一个或多个替代结果返回给一个或多个用户来移动查询结果。基于与一个或多个替代结果的用户交互，分类器可以被更新，例如，如果用户交互识别它，例如通过将查询改变为非时间查询。

12. 发明申请

US20100257164A1 SEARCH QUERIES WITH SHIFTING INTENT 有权
标题翻译：搜索与移位信息的疑问
公开(公告)号：US20100257164A1
公开(公告)日：2010-10-07
申请号：US12419363
申请日：2009-04-07
申请人： Alan Dale Halverson , Krishnaram Kenthapadi , Nina Mishra , Aleksandrs Slivkins , Umar Ali Syed
发明人： Alan Dale Halverson , Krishnaram Kenthapadi , Nina Mishra , Aleksandrs Slivkins , Umar Ali Syed
IPC分类号： G06F17/30
CPC分类号： G06F17/30864
摘要： Techniques and systems are disclosed for returning temporally-aware results from an Internet-based search query. To determine if a query is temporally-based one or more query features are collected and input into a trained classifier, yielding a temporal classification for the query. Further, if a query is classified as temporal, the query results are shifted by determining an alternate set of results for the query, and returning one or more alternate results to one or more users. Based on user interactions with the one or more alternate results, the classifier can be updated, for example, by changing the query to a non-temporal query if the user interactions identify it as such.
摘要翻译：公开了用于从基于因特网的搜索查询返回时间感知结果的技术和系统。为了确定查询是否是基于时间的，一个或多个查询特征被收集并输入到经过训练的分类器中，产生查询的时间分类。此外，如果查询被分类为时间，则通过为查询确定替代的一组结果并将一个或多个替代结果返回给一个或多个用户来移动查询结果。基于与一个或多个替代结果的用户交互，分类器可以被更新，例如，如果用户交互识别它，例如通过将查询改变为非时间查询。

13. 发明授权

US07225118B2 Global data placement 有权
标题翻译：全球数据放置
公开(公告)号：US07225118B2
公开(公告)日：2007-05-29
申请号：US10284098
申请日：2002-10-31
申请人： Qian Wang , Arif Merchant , Nina Mishra , Mahesh Kallahalla , Ram Swaminathan
发明人： Qian Wang , Arif Merchant , Nina Mishra , Mahesh Kallahalla , Ram Swaminathan
IPC分类号： G06F9/45
CPC分类号： G06Q10/10 , H04L67/1002 , H04L67/1008 , H04L67/1095 , H04L69/329
摘要： A method of global data placement. The method includes assigning one or more workloads to one or more compute servers such that each workload flows to one compute server, assigning the data chunks that the workloads accesses to one or more storage servers, and determining how the workloads access the data.
摘要翻译：全球数据放置方法。该方法包括将一个或多个工作负载分配给一个或多个计算服务器，使得每个工作负载流向一个计算服务器，将工作负载访问的数据块分配给一个或多个存储服务器，以及确定工作负载如何访问数据。

14. 发明授权

US08738387B2 System and method for determining an element value in private datasets 有权
标题翻译：用于确定私有数据集中元素值的系统和方法
公开(公告)号：US08738387B2
公开(公告)日：2014-05-27
申请号：US10976558
申请日：2004-10-29
申请人： Gagan Aggarwal , Nina Mishra , Binyamin Pinkas
发明人： Gagan Aggarwal , Nina Mishra , Binyamin Pinkas
IPC分类号： G06Q10/00
CPC分类号： G06F17/30536 , G06Q10/04
摘要： A system and method is disclosed for determining a value of an element, having a k-th rank. The method discloses: calculating a total number of elements in a first and second dataset; prohibiting parties from accessing each other's dataset; ranking the elements within each dataset; computing a total number of elements in the datasets each having a value less than a test value; computing a total number of elements in the datasets each having a value greater than the test value; and setting the value of the element, having the k-th rank, equal to the test value, if the total number of elements having values less than the test value is ≦ the k-th rank minus one, and the total number of elements having values greater than the test value is ≦ the total number of elements minus the k-th rank. The system discloses means for practicing the method.
摘要翻译：公开了一种用于确定具有第k等级的元素的值的系统和方法。该方法公开：计算第一和第二数据集中的元素的总数; 禁止各方访问对方的数据集; 排列每个数据集中的元素; 计算每个具有小于测试值的值的数据集中的元素的总数; 计算每个具有大于测试值的值的数据集中的元素的总数; 如果具有小于测试值的元素的总数为＆nlE，则将具有第k个等级的元素的值设置为等于测试值; 第k个等级减去1，并且具有大于测试值的值的元素的总数为＆nlE; 元素的总数减去第k个等级。该系统公开了实施该方法的手段。

15. 发明授权

US07818272B1 Method for discovery of clusters of objects in an arbitrary undirected graph using a difference between a fraction of internal connections and maximum fraction of connections by an outside object 有权
$Method for discovery of clusters of objects in an arbitrary undirected graph using a difference between a fraction of internal connections and maximum fraction of connections by an outside object$
标题翻译：使用内部连接的一小部分与外部对象的连接的最大部分之间的差异来发现任意无向图中的对象集群的方法
公开(公告)号：US07818272B1
公开(公告)日：2010-10-19
申请号：US11496807
申请日：2006-07-31
申请人： Nina Mishra , Robert Samuel Schreiber , Robert E. Tarjan
发明人： Nina Mishra , Robert Samuel Schreiber , Robert E. Tarjan
IPC分类号： G06F15/18
CPC分类号： G06N99/005 , G06K9/6224
摘要： A method for discovery of a cluster of objects in an arbitrary undirected graph. A subset of the objects is determined by performing a random walk starting from a first object of the objects and following a plurality of random edges of subsequent objects, the subset comprising the first object and the subsequent objects. An enlarged subset is determined by enlarging the subset to include other objects well-connected to the subset. It is determined whether the enlarged subset is a cluster.
摘要翻译：用于发现任意无向图中的一组对象的方法。通过从对象的第一对象开始并跟随随后对象的多个随机边缘，该子集包括第一对象和后续对象来确定对象的子集。通过放大子集以包括与子集良好连接的其他对象来确定放大的子集。确定放大的子集是否是集群。

16. 发明授权

US07739313B2 Method and system for finding conjunctive clusters 有权
标题翻译：查找联合群集的方法和系统
公开(公告)号：US07739313B2
公开(公告)日：2010-06-15
申请号：US10448899
申请日：2003-05-30
申请人： Nina Mishra , Dana Ron , Ram Swaminathan
发明人： Nina Mishra , Dana Ron , Ram Swaminathan
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06K9/6218
摘要： A method and system for finding a conjunctive cluster is disclosed. The method includes identifying a first group of points, identifying a second group of points, drawing a first sample from the first group of points of a first predetermined size and identifying subsets of the first sample. For each subset of the first sample of a second predetermined size the method includes identifying a subgroup of the second group of points that share an intersection with all of the points in the first sample of points, identifying a sub group of said first group of points that share an intersection with a specified number of the points in the subgroup of the second group of points and outputting a third group of points. It should be appreciated that the product of the magnitude of the subgroup of the second group and the magnitude of the subgroup of the first group is maximized.
摘要翻译：公开了一种用于寻找连接簇的方法和系统。该方法包括识别第一组点，识别第二组点，从第一预定尺寸的第一组点绘制第一样本并识别第一样本的子集。对于第二预定大小的第一样本的每个子集，该方法包括识别与第一点样本中的所有点共享交集的第二组点的子组，识别所述第一组点的子组其与第二组点的子组中的指定数量的点共享交叉点并输出第三组点。应当理解，第二组的子组的大小和第一组的子组的大小的乘积最大化。

17. 发明授权

US07380177B2 Method and system for comparing individual computers to cluster representations of their peers 有权
标题翻译：将各个计算机与对等体的聚类表示进行比较的方法和系统
公开(公告)号：US07380177B2
公开(公告)日：2008-05-27
申请号：US10876814
申请日：2004-06-25
申请人： Todd Mitchell Goin , Randall Bruce Campbell , James Richard Stinger , Thomas Elliott Fawcett , Douglas William Steele , Nina Mishra , Henri Jacques Suermondt
发明人： Todd Mitchell Goin , Randall Bruce Campbell , James Richard Stinger , Thomas Elliott Fawcett , Douglas William Steele , Nina Mishra , Henri Jacques Suermondt
IPC分类号： G06F11/00
CPC分类号： G06F11/3495 , G06F11/0709 , G06F11/0751 , G06F11/3447 , G06F2201/86 , G06F2201/865
摘要： The present invention is a system or method for assisting in the maintenance and servicing of computers. The system, for example, comprises a cluster database containing information relating to one or more computer clusters, the information relating to each cluster comprising one or more cluster descriptions and one or more representations of configuration information values that characterize typical computer members of the cluster, and also a tracker database containing configuration information values gathered from and relating to one or more computers. The system further comprises a computer and cluster comparison routine having access to the cluster and tracker databases that compares one or more of the representations of configuration information values relating to one or more of the clusters to one or more of the corresponding configuration information values gathered from at least one given computer and that then indicates how closely the given computer's configuration conforms with the configuration of typical computer members of the one or more clusters.
摘要翻译：本发明是一种用于协助维护和维修计算机的系统或方法。该系统例如包括包含与一个或多个计算机集群有关的信息的集群数据库，与每个集群有关的信息包括一个或多个集群描述和表征集群的典型计算机成员的配置信息值的一个或多个表示，以及包含从一个或多个计算机收集并与之相关的配置信息值的跟踪器数据库。该系统还包括具有访问集群的计算机和集群比较例程和跟踪器数据库，其将与一个或多个集群相关的配置信息值的一个或多个表示与从一个或多个集群中收集的相应配置信息值中的一个或多个进行比较至少一个给定的计算机，然后指示给定计算机的配置与一个或多个集群的典型计算机构件的配置相符合。

18. 发明申请

US20060095378A1 System and method for determining an element value in private datasets 有权
标题翻译：用于确定私有数据集中元素值的系统和方法
公开(公告)号：US20060095378A1
公开(公告)日：2006-05-04
申请号：US10976558
申请日：2004-10-29
申请人： Gagan Aggarwal , Nina Mishra , Binyamin Pinkas
发明人： Gagan Aggarwal , Nina Mishra , Binyamin Pinkas
IPC分类号： G06Q99/00
CPC分类号： G06F17/30536 , G06Q10/04
摘要： A system and method is disclosed for determining a value of an element, having a k-th rank. The method discloses: calculating a total number of elements in a first and second dataset; prohibiting parties from accessing each other's dataset; ranking the elements within each dataset; computing a total number of elements in the datasets each having a value less than a test value; computing a total number of elements in the datasets each having a value greater than the test value; and setting the value of the element, having the k-th rank, equal to the test value, if the total number of elements having values less than the test value is ≦ the k-th rank minus one, and the total number of elements having values greater than the test value is ≦ the total number of elements minus the k-th rank. The system discloses means for practicing the method.
摘要翻译：公开了一种用于确定具有第k等级的元素的值的系统和方法。该方法公开：计算第一和第二数据集中的元素的总数; 禁止各方访问对方的数据集; 排列每个数据集中的元素; 计算每个具有小于测试值的值的数据集中的元素的总数; 计算每个具有大于测试值的值的数据集中的元素的总数; 并且如果具有小于测试值的值的元素的总数为<=第k个等级减去1，则将具有第k个等级的元素的值设置为等于测试值具有大于测试值的值的元素是<=元素的总数减去第k个等级。该系统公开了实施该方法的手段。

19. 发明申请

US20050289071A1 Method and system for clustering computers into peer groups and comparing individual computers to their peers 有权
标题翻译：将计算机集群到对等组中并将各个计算机与其对等体进行比较的方法和系统
公开(公告)号：US20050289071A1
公开(公告)日：2005-12-29
申请号：US10876865
申请日：2004-06-25
申请人： Todd Goin , Randall Campbell , James Stinger , Thomas Fawcett , Douglas Steele , Nina Mishra , Henri Suermondt
发明人： Todd Goin , Randall Campbell , James Stinger , Thomas Fawcett , Douglas Steele , Nina Mishra , Henri Suermondt
IPC分类号： H04K1/00
CPC分类号： G06F11/008
摘要： A method and system for identifying clusters of similarly-configured computers. The method, for example, comprises gathering system and business configuration information values from a set of computers. Next, at least a portion of the system and business configuration information values gathered from the set of computers is analyzed along with the numbers of computers that are configured in various ways. Then, using the result of the analysis as a guide, logical expressions of configuration information values are selected for use as definitions of one or more clusters of similarly-configured computers, the selection process generally maximizing the number of computers included within each cluster and also generally maximizing the number of configuration information value specifications included within the definition of each cluster. Then, for one or more clusters so defined and selected, one or more statistics or limit values are generated from one or more configuration information values or both gathered from the subset of computers included in the one or more clusters.
摘要翻译：用于识别类似配置的计算机的群集的方法和系统。该方法例如包括从一组计算机收集系统和业务配置信息值。接下来，分析从该组计算机收集的系统和业务配置信息值的至少一部分以及以各种方式配置的计算机的数量。然后，使用分析结果作为指导，选择配置信息值的逻辑表达式用作一个或多个类似配置的计算机的集群的定义，所述选择过程通常最大化包括在每个集群内的计算机的数量，并且还通常最大化每个集群定义中包含的配置信息值规范的数量。然后，对于如此定义和选择的一个或多个集群，从一个或多个配置信息值或从包含在一个或多个集群中的计算机子集收集的二者生成一个或多个统计值或限制值。

20. 发明授权

US08601024B2 Synopsis of a search log that respects user privacy 有权
标题翻译：搜索日志的简要说明，尊重用户隐私
公开(公告)号：US08601024B2
公开(公告)日：2013-12-03
申请号：US12485058
申请日：2009-06-16
申请人： Krishnaram Kenthapadi , Aleksandra Korolova , Nina Mishra , Alexandros Ntoulas
发明人： Krishnaram Kenthapadi , Aleksandra Korolova , Nina Mishra , Alexandros Ntoulas
IPC分类号： G06F17/30
CPC分类号： G06F17/30867
摘要： Described is releasing output data representing a search log, in which the data is suitable for most data mining/analysis applications, but is safe to publish by preserving user privacy. The search log is processed such that a query is only included if a sufficient count of that query is present; noise may be added. User contributions that are considered may be limited to a maximum number of queries. The output may indicate how often (possibly plus noise) that each query appeared. Other output may comprise a query-action graph, a query-inaction graph and/or a query-reformulation graph, with nodes representing queries and nodes representing actions, inactions or reformulations (e.g., clicked URLs, skipped URLs, or selected related queries), and edges between nodes representing action, skip or selection counts (possibly plus noise). The output may correspond to the top results/related queries returned from a search.
摘要翻译：描述了释放表示搜索日志的输出数据，其中数据适用于大多数数据挖掘/分析应用程序，但通过保护用户隐私来安全地发布。处理搜索日志，使得仅当存在该查询的足够计数时才包括查询; 可能会添加噪音。被考虑的用户贡献可能被限制为最大数量的查询。输出可以指示每个查询出现的频率（可能加噪声）。其他输出可以包括查询动作图，查询反应图和/或查询重构图，其中节点表示查询和节点，表示动作，不作为或重新设定（例如，点击的URL，跳过的URL或选择的相关查询），并且节点之间的边缘表示动作，跳过或选择计数（可能加上噪声）。输出可以对应于从搜索返回的最高结果/相关查询。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式