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

1. 发明申请

US20120143794A1 ANSWER MODEL COMPARISON 有权
标题翻译：解答模型比较
公开(公告)号：US20120143794A1
公开(公告)日：2012-06-07
申请号：US12959402
申请日：2010-12-03
申请人： Tapas Kanungo , Kuansan Wang , Ran Gilad-Bachrach , Kieran McDonald , Kumaresh Pattabiraman , Christopher Meyers , Ashok Ponnuswami , Luke Simon
发明人： Tapas Kanungo , Kuansan Wang , Ran Gilad-Bachrach , Kieran McDonald , Kumaresh Pattabiraman , Christopher Meyers , Ashok Ponnuswami , Luke Simon
IPC分类号： G06F15/18
CPC分类号： G06F17/30554
摘要： This patent application pertains to answer model comparison. One implementation can determine a first frequency at which an individual answer category appears in an individual slot on a query results page when utilizing a first model. The method can ascertain a second frequency at which the individual answer category appears in the individual slot on the query results page when utilizing a second model. The method can calibrate the second model so that the second frequency approaches the first frequency.
摘要翻译：该专利申请涉及回答模型比较。当使用第一模型时，一个实现可以确定在查询结果页面上的单个插槽中出现个人答案类别的第一频率。当使用第二模型时，该方法可以确定在查询结果页面上的个别插槽中出现个人答案类别的第二频率。该方法可以校准第二个模型，使得第二个频率接近第一个频率。

2. 发明授权

US08554700B2 Answer model comparison 有权
标题翻译：答案模式比较
公开(公告)号：US08554700B2
公开(公告)日：2013-10-08
申请号：US12959402
申请日：2010-12-03
申请人： Tapas Kanungo , Kuansan Wang , Ran Gilad-Bachrach , Kieran McDonald , Kumaresh Pattabiraman , Christopher Meyers , Ashok Ponnuswami , Luke Simon
发明人： Tapas Kanungo , Kuansan Wang , Ran Gilad-Bachrach , Kieran McDonald , Kumaresh Pattabiraman , Christopher Meyers , Ashok Ponnuswami , Luke Simon
IPC分类号： G06F15/18
CPC分类号： G06F17/30554
摘要： This patent application pertains to answer model comparison. One implementation can determine a first frequency at which an individual answer category appears in an individual slot on a query results page when utilizing a first model. The method can ascertain a second frequency at which the individual answer category appears in the individual slot on the query results page when utilizing a second model. The method can calibrate the second model so that the second frequency approaches the first frequency.
摘要翻译：该专利申请涉及回答模型比较。当使用第一模型时，一个实现可以确定在查询结果页面上的单个插槽中出现个人答案类别的第一频率。当使用第二模型时，该方法可以确定在查询结果页面上的个别插槽中出现个人答案类别的第二频率。该方法可以校准第二个模型，使得第二个频率接近第一个频率。

3. 发明授权

US08370337B2 Ranking search results using click-based data 有权
标题翻译：使用点击数据排名搜索结果
公开(公告)号：US08370337B2
公开(公告)日：2013-02-05
申请号：US12762929
申请日：2010-04-19
申请人： Tapas Kanungo , Kumaresh Pattabiraman , Nitin Agrawal , Kieran Richard McDonald , Christopher Avery Meyers , Nipoon Malhotra
发明人： Tapas Kanungo , Kumaresh Pattabiraman , Nitin Agrawal , Kieran Richard McDonald , Christopher Avery Meyers , Nipoon Malhotra
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06N99/005 , G06F17/30882
摘要： Methods and computer-storage media having computer-executable instructions embodied thereon that facilitate generating a machine-learned model for ranking search results using click-based data are provided. Data is referenced from user queries, which may include search results generated by general search engines and vertical search engines. A training set is generated from the search results and click-based judgments are associated with the search results in the training set. Based on click-based judgments, identifiable features are determined from the search results in a training set. Based on determining identifiable features in a training set, a rule set is generated for ranking subsequent search results.
摘要翻译：提供了具有其上包含计算机可执行指令的方法和计算机存储介质，其利用基于点击的数据便于生成用于对搜索结果进行排名的机器学习模型。数据来自用户查询，可能包括由一般搜索引擎和垂直搜索引擎生成的搜索结果。从搜索结果生成训练集，并且基于点击的判断与训练集中的搜索结果相关联。基于点击判断，可以从训练集中的搜索结果确定可识别的特征。基于确定训练集中的可识别特征，生成用于对后续搜索结果进行排序的规则集。

4. 发明申请

US20140067816A1 SURFACING ENTITY ATTRIBUTES WITH SEARCH RESULTS 审中-公开
标题翻译：具有搜索结果的表面实体属性
公开(公告)号：US20140067816A1
公开(公告)日：2014-03-06
申请号：US13597596
申请日：2012-08-29
申请人： Tapas Kanungo , Ashok Ponnuswami
发明人： Tapas Kanungo , Ashok Ponnuswami
IPC分类号： G06F17/30
CPC分类号： G06F17/274 , G06F16/3325 , G06F16/3329 , G06F16/3334 , G06F16/3344 , G06F16/3349
摘要： In an effort to enhance computer user engagement with a search results page, systems and methods are presented which are configured to identify an entity as being the subject matter of a user's search query. If the entity is a known entity, i.e., entity information is stored in an entity store for the identified entity, a subset of entity attributes are identified and a representative entity attribute question is obtained for each of the attributes in the subset of entity attributes. The representative entity attribute questions are identified according to the probability that they are formed linguistically correct. The representative entity attribute questions are included in a search results page that is generated in response to the user's search query.
摘要翻译：为了增强与搜索结果页面的计算机用户参与度，提出了被配置为将实体标识为用户的搜索查询的主题的系统和方法。如果实体是已知实体，即实体信息存储在被识别实体的实体存储器中，则识别实体属性的子集，并且为实体属性子集中的每个属性获得代表性实体属性问题。代表性实体属性问题是根据语言正确的概率来确定的。代表实体属性问题包括在响应于用户的搜索查询而生成的搜索结果页面中。

5. 发明授权

US07640488B2 System, method, and service for using a focused random walk to produce samples on a topic from a collection of hyper-linked pages 失效
标题翻译：系统，方法和服务，用于使用集中的随机游走从超链接页面集合中的主题生成样本
公开(公告)号：US07640488B2
公开(公告)日：2009-12-29
申请号：US11004412
申请日：2004-12-04
申请人： Ziv Bar-Yossef , Tapas Kanungo , Robert Krauthgamer
发明人： Ziv Bar-Yossef , Tapas Kanungo , Robert Krauthgamer
IPC分类号： G06F17/00 , G06F17/20
CPC分类号： G06F17/30864
摘要： A focused random walk system produces samples of on-topic pages from a collection of hyper-linked pages such as Web pages. The focused random walk system utilizes a focused random walk to produce a focused sample, which is a random sample of Web pages focused on a topic. The focused random walk system uniformly samples pages iteratively, where each iteration follows a random link from a union of the in-links and out-links of a page. The system then classifies this randomly selected link to determine whether the page is on-topic. The random walk sampling process could comprise a hard-focus method that selects only on-topic pages at each step of the focused random walk, or a soft-focus method that allows limited divergence to off-topic pages.
摘要翻译：集中的随机游走系统从一系列超链接页面（如网页）生成主题页面的样本。集中的随机游走系统利用一个集中的随机游走来产生一个聚焦的样本，这是一个专注于主题的网页的随机抽样。集中的随机游走系统统一地对页面进行一次抽样，其中每次迭代都遵循一个页面的链接和外链的联合的随机链接。然后，系统对这个随机选择的链接进行分类，以确定该页面是否是主题的。随机游走抽样过程可以包括仅在聚焦随机游走的每个步骤选择专题页面的硬焦点方法，或者允许有限散点到偏离主题页面的软焦点方法。

6. 发明申请

US20090292683A1 SYSTEM AND METHOD FOR AUTOMATICALLY RANKING LINES OF TEXT 有权
标题翻译：用于自动排列文本行的系统和方法
公开(公告)号：US20090292683A1
公开(公告)日：2009-11-26
申请号：US12124086
申请日：2008-05-20
申请人： Tapas Kanungo , Donald Metzler
发明人： Tapas Kanungo , Donald Metzler
IPC分类号： G06F17/30
CPC分类号： G06F17/30675
摘要： Disclosed are apparatus and methods for ranking lines of text. In one embodiment, an intent of a query is ascertained. A relevance of each one of a plurality of lines of text of a document is determined based upon the intent of the query, content of the query, and content of each of the plurality of lines of text. The plurality of lines of text may then be ranked according to the determined relevance of each of the plurality of lines of text.
摘要翻译：公开了用于对文本排列进行排序的装置和方法。在一个实施例中，确定查询的意图。基于查询的意图，查询的内容以及多条文本行中的每一行的内容来确定文档的多行文本中的每一行的相关性。然后可以根据所确定的多行文本中的每一行的确定的相关性来对多行文本进行排名。

7. 发明授权

US07519629B2 System and method for tolerating multiple storage device failures in a storage system with constrained parity in-degree 失效
标题翻译：在具有约束奇偶校验的存储系统中容忍多个存储设备故障的系统和方法
公开(公告)号：US07519629B2
公开(公告)日：2009-04-14
申请号：US10956466
申请日：2004-09-30
申请人： James Lee Hafner , Jeffrey R. Hartline , Tapas Kanungo
发明人： James Lee Hafner , Jeffrey R. Hartline , Tapas Kanungo
IPC分类号： G06F17/00
CPC分类号： G06F11/1076 , Y10S707/99953
摘要： A fault-tolerant system for storage arrays has constraints on the number of data from which each redundancy value is computed. The fault-tolerant system has embodiments that are supported on small array sizes to arbitrarily large array sizes, and can tolerate a large number T of failures. Certain embodiments can tolerate many instances of more than T failures. The fault-tolerant system has efficient XOR-based encoding, recovery, and updating algorithms and has simple redundancy formulas. The fault-tolerant system has improved IO seek costs for certain multiple-element sequential host updates.
摘要翻译：用于存储阵列的容错系统对从其计算每个冗余值的数据数量具有约束。容错系统具有支持小阵列大小到任意大的阵列大小的实施例，并且可以容忍大量T的故障。某些实施例可以容忍多于T个故障的许多实例。容错系统具有高效的基于XOR的编码，恢复和更新算法，并具有简单的冗余公式。容错系统已经提高了某些多元素顺序主机更新的IO查找成本。

8. 发明申请

US20060075290A1 System and method for improving the performance of operations requiring parity reads in a storage array system 有权
公开(公告)号：US20060075290A1
公开(公告)日：2006-04-06
申请号：US10949126
申请日：2004-09-24
申请人： Jeffrey Hartline , James Hafner , Tapas Kanungo
发明人： Jeffrey Hartline , James Hafner , Tapas Kanungo
IPC分类号： G06F11/00
CPC分类号： G06F11/1076 , G06F2211/1054
摘要： A system for improving a performance of a write process in an exemplary RAID system reduces a number of IOs required for a short write in a RAID algorithm by using a replicated-parity drive. Parity is stored on the parity portion of the disk drives. A replicated-parity drive comprises all the parity information. Parity information for each parity drive is co-located or mirrored on the replicated-parity portion of the disk drives for fast access during a read portion of the read-modify-write process. Consequently, the system accesses parity data with one seek, as opposed to P seeks in a conventional disk array system utilizing P parity drives.

9. 发明申请

US20060074995A1 System and method for tolerating multiple storage device failures in a storage system with constrained parity in-degree 失效
公开(公告)号：US20060074995A1
公开(公告)日：2006-04-06
申请号：US10956466
申请日：2004-09-30
申请人： James Hafner , Jeffrey Hartline , Tapas Kanungo
发明人： James Hafner , Jeffrey Hartline , Tapas Kanungo
IPC分类号： G06F17/30
CPC分类号： G06F11/1076 , Y10S707/99953
摘要： A fault-tolerant system for storage arrays has constraints on the number of data from which each redundancy value is computed. The fault-tolerant system has embodiments that are supported on small array sizes to arbitrarily large array sizes, and can tolerate a large number T of failures. Certain embodiments can tolerate many instances of more than T failures. The fault-tolerant system has efficient XOR-based encoding, recovery, and updating algorithms and has simple redundancy formulas. The fault-tolerant system has improved IO seek costs for certain multiple-element sequential host updates.

10. 发明申请

US20060074954A1 System and method for enabling efficient recovery of data in a storage array 失效
标题翻译：用于有效恢复存储阵列中的数据的系统和方法
公开(公告)号：US20060074954A1
公开(公告)日：2006-04-06
申请号：US10956468
申请日：2004-09-30
申请人： Jeffrey Hartline , Tapas Kanungo , James Hafner
发明人： Jeffrey Hartline , Tapas Kanungo , James Hafner
IPC分类号： G06F17/30
CPC分类号： G06F11/1076 , G06F2211/1059 , Y10S707/99953
摘要： A recovery enabling system for storage arrays is a high distance generalization of RAID-5 with optimal update complexity and near optimal storage efficiency. The recovery enabling system utilizes presets, data cells with known values that initialize the reconstruction process. The presets allow resolution of parity equations to reconstruct data when failures occur. In one embodiment, additional copies of the layout of the recovery enabling system are packed onto the same disks to minimize the effect of presets on storage efficiency without destroying the clean geometric construction of the recovery enabling system. The recovery enabling system has efficient XOR-based encoding, recovery, and updating algorithms for arbitrarily large distances, making the recovery enabling system an ideal candidate when storage-efficient reliable codes are required.
摘要翻译：存储阵列的恢复启用系统是RAID-5的高距离泛化，具有最佳的更新复杂性和接近最佳的存储效率。恢复启用系统利用预设，具有初始化重建过程的已知值的数据单元。当故障发生时，预设允许解决奇偶校验方程来重建数据。在一个实施例中，恢复启用系统的布局的附加副本被打包在相同的盘上，以最小化预设对存储效率的影响，而不破坏恢复使能系统的干净的几何结构。恢复使能系统具有高效的基于XOR的编码，恢复和更新算法，用于任意大距离，使得恢复使能系统成为需要存储高效可靠代码的理想候选。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式