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

1. 发明授权

US09495349B2 System and method for using text analytics to identify a set of related documents from a source document 有权
标题翻译：使用文本分析从源文档中标识一组相关文档的系统和方法
公开(公告)号：US09495349B2
公开(公告)日：2016-11-15
申请号：US11281291
申请日：2005-11-17
申请人： Robert L. Angell , Stephen K. Boyer , James W. Cooper , Richard A. Hennessy , Tapas Kanungo , Jeffrey T. Kreulen , David C. Martin , James J. Rhodes , W. Scott Spangler , Herschel J. R. Weintraub
发明人： Robert L. Angell , Stephen K. Boyer , James W. Cooper , Richard A. Hennessy , Tapas Kanungo , Jeffrey T. Kreulen , David C. Martin , James J. Rhodes , W. Scott Spangler , Herschel J. R. Weintraub
IPC分类号： G06F7/00 , G06F17/27
CPC分类号： G06F17/27
摘要： A system and method for processing a document to generate a set of related documents. A system is provided that includes a textual analytics system that analyzes unstructured data contained in a source document and extracts a set of structured information about the source document; and a compare system that identifies a set of related documents by comparing the set of structured information with metadata indexed from a set of publications.
摘要翻译：一种用于处理文档以生成一组相关文档的系统和方法。提供了一种系统，其包括文本分析系统，其分析源文档中包含的非结构化数据并提取关于源文档的一组结构化信息; 以及比较系统，通过将结构化信息集与从一组出版物索引的元数据进行比较来识别一组相关文档。

2. 发明授权

US08005845B2 System and method for automatically ranking lines of text 有权
标题翻译：自动排列文本行的系统和方法
公开(公告)号：US08005845B2
公开(公告)日：2011-08-23
申请号：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.
摘要翻译：公开了用于对文本排列进行排序的装置和方法。在一个实施例中，确定查询的意图。基于查询的意图，查询的内容以及多条文本行中的每一行的内容来确定文档的多行文本中的每一行的相关性。然后可以根据所确定的多行文本中的每一行的确定的相关性来对多行文本进行排名。

3. 发明申请

US20100153365A1 PHRASE IDENTIFICATION USING BREAK POINTS 审中-公开
标题翻译：使用断点的相位标识
公开(公告)号：US20100153365A1
公开(公告)日：2010-06-17
申请号：US12334725
申请日：2008-12-15
申请人： Hadar Shemtov , Tapas Kanungo , Rajhans Samdani , Donald Metzler
发明人： Hadar Shemtov , Tapas Kanungo , Rajhans Samdani , Donald Metzler
IPC分类号： G06F7/06 , G06F17/30
CPC分类号： G06F17/2775 , G06F16/345
摘要： Disclosed herein are systems and methods for identifying phrases using break points. Break points can be identified using stop words identified in content. Identified phrases can be used to generate a summary of the content.
摘要翻译：本文公开了用于使用断点识别短语的系统和方法。可以使用内容中标识的停止词来识别断点。识别的短语可用于生成内容摘要。

4. 发明授权

US07493293B2 System and method for extracting entities of interest from text using n-gram models 有权
标题翻译：使用n-gram模型从文本中提取感兴趣的实体的系统和方法
公开(公告)号：US07493293B2
公开(公告)日：2009-02-17
申请号：US11421379
申请日：2006-05-31
申请人： Tapas Kanungo , James J. Rhodes
发明人： Tapas Kanungo , James J. Rhodes
IPC分类号： G06F15/18
CPC分类号： G06F17/278
摘要： A document (or multiple documents) is analyzed to identify entities of interest within that document. This is accomplished by constructing n-gram or bi-gram models that correspond to different kinds of text entities, such as chemistry-related words and generic English words. The models can be constructed from training text selected to reflect a particular kind of text entity. The document is tokenized, and the tokens are run against the models to determine, for each token, which kind of text entity is most likely to be associated with that token. The entities of interest in the document can then be annotated accordingly.
摘要翻译：分析文档（或多个文档）以识别该文档中感兴趣的实体。这是通过构建对应于不同类型的文本实体（如化学相关词和通用英文单词）的n-gram或bi-gram模型来实现的。这些模型可以通过选择的训练文本来构建，以反映特定类型的文本实体。文档被标记化，并且令牌针对模型运行，以针对每个令牌确定哪种文本实体最有可能与该令牌相关联。然后可以相应地注释文档中感兴趣的实体。

5. 发明申请

US20080155194A1 SYSTEM AND METHOD FOR IMPROVING THE PERFORMANCE OF OPERATIONS REQUIRING PARITY READS IN A STORAGE ARRAY SYSTEM 失效
标题翻译：用于改善存储阵列系统中要求读取的操作性能的系统和方法
公开(公告)号：US20080155194A1
公开(公告)日：2008-06-26
申请号：US12037480
申请日：2008-02-26
申请人： JEFFREY R. HARTLINE , James Lee Hafner , Tapas Kanungo
发明人： JEFFREY R. HARTLINE , James Lee Hafner , Tapas Kanungo
IPC分类号： G06F12/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.
摘要翻译：用于改进示例性RAID系统中的写入处理的性能的系统通过使用复制奇偶校验驱动器来减少RAID算法中的短写入所需的IO数量。奇偶校验存储在磁盘驱动器的奇偶校验部分。复制奇偶校验驱动器包括所有奇偶校验信息。每个奇偶校验驱动器的奇偶校验信息在磁盘驱动器的复制奇偶校验部分上位于或镜像，以便在读 - 修改 - 写入过程的读取部分期间快速访问。因此，与使用P奇偶校验驱动器的传统磁盘阵列系统中的P寻找相反，系统使用一次寻道访问奇偶校验数据。

6. 发明申请

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.
摘要翻译：该专利申请涉及回答模型比较。当使用第一模型时，一个实现可以确定在查询结果页面上的单个插槽中出现个人答案类别的第一频率。当使用第二模型时，该方法可以确定在查询结果页面上的个别插槽中出现个人答案类别的第二频率。该方法可以校准第二个模型，使得第二个频率接近第一个频率。

7. 发明授权

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.
摘要翻译：集中的随机游走系统从一系列超链接页面（如网页）生成主题页面的样本。集中的随机游走系统利用一个集中的随机游走来产生一个聚焦的样本，这是一个专注于主题的网页的随机抽样。集中的随机游走系统统一地对页面进行一次抽样，其中每次迭代都遵循一个页面的链接和外链的联合的随机链接。然后，系统对这个随机选择的链接进行分类，以确定该页面是否是主题的。随机游走抽样过程可以包括仅在聚焦随机游走的每个步骤选择专题页面的硬焦点方法，或者允许有限散点到偏离主题页面的软焦点方法。

8. 发明申请

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.
摘要翻译：公开了用于对文本排列进行排序的装置和方法。在一个实施例中，确定查询的意图。基于查询的意图，查询的内容以及多条文本行中的每一行的内容来确定文档的多行文本中的每一行的相关性。然后可以根据所确定的多行文本中的每一行的确定的相关性来对多行文本进行排名。

9. 发明授权

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查找成本。

10. 发明申请

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.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式