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

1. 发明申请

US20080033971A1 Analyzing the Ability to Find Textual Content 有权
标题翻译：分析查找文本内容的能力
公开(公告)号：US20080033971A1
公开(公告)日：2008-02-07
申请号：US11461464
申请日：2006-08-01
申请人： David Carmel , Adam Darlow , Shai Fine , Dan Pelleg , Elad Yom-Tov
发明人： David Carmel , Adam Darlow , Shai Fine , Dan Pelleg , Elad Yom-Tov
IPC分类号： G06F7/00
CPC分类号： G06F17/30675
摘要： A method and system for analyzing a document set (202, 420) are provided. The method includes determining a set of terms (312) from the terms of the document set that minimizes a distance measurement (405) from the given set of documents (420). The method includes using a greedy algorithm to build the set of terms incrementally, at each stage finding a single word that is closest to the document set (202, 420). The set of terms is evaluated to assess the ability to find the document set (202, 420). The set of terms are compared with expected terms to evaluate the ability to find the document set (202, 420). A measure of the ability to find a document set (202, 420) is provided by computing a distance measure (403) between a document set and an entire collection.
摘要翻译：提供了一种用于分析文档集（202,420）的方法和系统。该方法包括从文档集合的术语中确定一组术语（312），该文档集合的术语使距离给定文档集合（420）最小化距离测量（405）。该方法包括使用贪心算法逐渐建立术语集合，在每个阶段找到最靠近文档集（202,420）的单个单词。评估一组术语以评估查找文档集（202,420）的能力。将这组术语与预期术语进行比较，以评估查找文档集（202,420）的能力。通过计算文档集和整个集合之间的距离度量（403）来提供查找文档集（202,420）的能力的度量。

2. 发明授权

US07792830B2 Analyzing the ability to find textual content 有权
标题翻译：分析查找文字内容的能力
公开(公告)号：US07792830B2
公开(公告)日：2010-09-07
申请号：US11461464
申请日：2006-08-01
申请人： David Carmel , Adam Darlow , Shai Fine , Dan Pelleg , Elad Yom-Tov
发明人： David Carmel , Adam Darlow , Shai Fine , Dan Pelleg , Elad Yom-Tov
IPC分类号： G06F7/00 , G06F17/30 , G06F15/18 , G06F17/00 , G06N5/02
CPC分类号： G06F17/30675
摘要： A method and system for analyzing a document set (202, 420) are provided. The method includes determining a set of terms (312) from the terms of the document set that minimizes a distance measurement (405) from the given set of documents (420). The method includes using a greedy algorithm to build the set of terms incrementally, at each stage finding a single word that is closest to the document set (202, 420). The set of terms is evaluated to assess the ability to find the document set (202, 420). The set of terms are compared with expected terms to evaluate the ability to find the document set (202, 420). A measure of the ability to find a document set (202, 420) is provided by computing a distance measure (403) between a document set and an entire collection.
摘要翻译：提供了一种用于分析文档集（202,420）的方法和系统。该方法包括从文档集合的术语中确定一组术语（312），该文档集合的术语使距离给定文档集合（420）最小化距离测量（405）。该方法包括使用贪心算法逐渐建立术语集合，在每个阶段找到最靠近文档集（202,420）的单个单词。评估一组术语以评估查找文档集（202,420）的能力。将这组术语与预期术语进行比较，以评估查找文档集（202,420）的能力。通过计算文档集和整个集合之间的距离度量（403）来提供查找文档集（202,420）的能力的度量。

3. 发明授权

US07406462B2 Prediction of query difficulty for a generic search engine 失效
标题翻译：通用搜索引擎查询难度的预测
公开(公告)号：US07406462B2
公开(公告)日：2008-07-29
申请号：US10968692
申请日：2004-10-19
申请人： David Carmel , Lawrence Adam Darlow , Shai Fine , Elad Yom-Tov
发明人： David Carmel , Lawrence Adam Darlow , Shai Fine , Elad Yom-Tov
IPC分类号： G06F17/30
CPC分类号： G06F17/30864 , Y10S707/957 , Y10S707/99932 , Y10S707/99933
摘要： A query difficulty prediction unit includes a query difficulty predictor to determine the extent of overlap between query documents received from a search engine operating on an input query and sub-query documents received from the search engine operating on sub-queries of the input query. The unit generates a query difficulty prediction from the extent of overlap.
摘要翻译：查询难度预测单元包括查询难度预测器，用于确定从在输入查询上操作的搜索引擎接收的查询文档与从输入查询的子查询操作的搜索引擎接收到的子查询文档之间的重叠程度。该单元从重叠的程度产生查询难度预测。

4. 发明授权

US07984039B2 Merging of results in distributed information retrieval 有权
标题翻译：结果在分布式信息检索中合并
公开(公告)号：US07984039B2
公开(公告)日：2011-07-19
申请号：US11183086
申请日：2005-07-14
申请人： David Carmel , Adam Darlow , Shai Fine , Elad Yom-Tov
发明人： David Carmel , Adam Darlow , Shai Fine , Elad Yom-Tov
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30864
摘要： A method and system are provided of merging results in distributed information retrieval. A search manager is in communication with a plurality of components, wherein a component is a search engine working on a document collection and returning results in the form of a list of documents to a search query. The search manager submits a query to the plurality of components, receives results from each component in the form of a list of documents; estimates the success of a component in handling the query to generate a merit score for a component per query; applies the merit score to the results for the component; and merges results from the plurality of components by ranking in order of the applied merit score.
摘要翻译：提供了一种在分布式信息检索中合并结果的方法和系统。搜索管理器与多个组件进行通信，其中组件是对文档收集工作的搜索引擎，并以搜索查询的文档列表的形式返回结果。搜索管理器向多个组件提交查询，以文档列表的形式从每个组件接收结果; 估计组件处理查询的成功，以生成每个查询的组件的优点得分; 将优点分数应用于组件的结果; 并且通过按照所应用的优点得分的顺序来排列来自多个组分的结果。

5. 发明申请

US20070016574A1 Merging of results in distributed information retrieval 有权
标题翻译：结果在分布式信息检索中合并
公开(公告)号：US20070016574A1
公开(公告)日：2007-01-18
申请号：US11183086
申请日：2005-07-14
申请人： David Carmel , Adam Darlow , Shai Fine , Elad Yom-Tov
发明人： David Carmel , Adam Darlow , Shai Fine , Elad Yom-Tov
IPC分类号： G06F17/30
CPC分类号： G06F17/30864
摘要： A method and system are provided of merging results in distributed information retrieval. A search manager (104) is in communication with a plurality of components, wherein a component is a search engine (106-108) working on a document collection and returning results in the form of a list of documents to a search query. The search manager (104) submits a query (202) to the plurality of components, receives results (213) from each component in the form of a list of documents; estimates (208) the success of a component in handling the query to generate a merit score (210) for a component per query; applies (220) the merit score (210) to the results for the component; and merges (222) results from the plurality of components by ranking in order of the applied merit score.
摘要翻译：提供了一种在分布式信息检索中合并结果的方法和系统。搜索管理器（104）与多个组件通信，其中组件是在文档收集上工作的搜索引擎（106-108），并以搜索查询的文档列表的形式返回结果。搜索管理器（104）向多个组件提交查询（202），以文档列表的形式从每个组件接收结果（213）; 估计（208）组件在处理查询中的成功以生成每个查询的组件的优点得分（210）; 将优点得分（210）（220）应用于组件的结果; 并通过按照应用的优点得分的顺序来合并来自多个成分的结果（222）。

6. 发明申请

US20070016545A1 Detection of missing content in a searchable repository 审中-公开
标题翻译：检测可搜索存储库中缺少的内容
公开(公告)号：US20070016545A1
公开(公告)日：2007-01-18
申请号：US11181324
申请日：2005-07-14
申请人： Andrei Broder , David Carmel , Adam Darlow , Shai Fine , Elad Yom-Tov
发明人： Andrei Broder , David Carmel , Adam Darlow , Shai Fine , Elad Yom-Tov
IPC分类号： G06F17/30
CPC分类号： G06F16/28
摘要： A method and system for the detection of missing content in a searchable repository is provided. A system includes: a missing content query identifier (401) for identifying queries to a search engine (102) for which no or little relevant content is returned; a missing content detector (110) which clusters missing content queries by topic; and an output provider for providing details of a missing content topic.
摘要翻译：提供了一种用于检测可搜索存储库中缺少内容的方法和系统。一种系统包括：缺少的内容查询标识符（401），用于识别对没有返回或没有相关内容的搜索引擎（102）的查询; 一个丢失的内容检测器（110），其通过主题聚集丢失的内容查询; 以及用于提供缺少的内容主题的细节的输出提供者。

7. 发明申请

US20060085399A1 Prediction of query difficulty for a generic search engine 失效
标题翻译：通用搜索引擎查询难度的预测
公开(公告)号：US20060085399A1
公开(公告)日：2006-04-20
申请号：US10968692
申请日：2004-10-19
申请人： David Carmel , Lawrence Darlow , Shai Fine , Elad Yom-Tov
发明人： David Carmel , Lawrence Darlow , Shai Fine , Elad Yom-Tov
IPC分类号： G06F17/30
CPC分类号： G06F17/30864 , Y10S707/957 , Y10S707/99932 , Y10S707/99933
摘要： A query difficulty prediction unit includes a query difficulty predictor to determine the extent of overlap between query documents received from a search engine operating on an input query and sub-query documents received from the search engine operating on sub-queries of the input query. The unit generates a query difficulty prediction from the extent of overlap.
摘要翻译：查询难度预测单元包括查询难度预测器，用于确定从在输入查询上操作的搜索引擎接收的查询文档与从输入查询的子查询操作的搜索引擎接收到的子查询文档之间的重叠程度。该单元从重叠的程度产生查询难度预测。

8. 发明申请

US20110295649A1 AUTOMATIC CHURN PREDICTION 审中-公开
标题翻译：自动预测
公开(公告)号：US20110295649A1
公开(公告)日：2011-12-01
申请号：US12790850
申请日：2010-05-31
申请人： Shai Fine , Elad Yom-Tov , Yossi Richter
发明人： Shai Fine , Elad Yom-Tov , Yossi Richter
IPC分类号： G06Q10/00 , G06F15/18 , G06N5/02 , G06Q50/00
CPC分类号： G06Q30/0202 , G06Q30/0201
摘要： Churn prediction is performed by monitoring quality of service levels provided to customers. A time in which the customer is due to either churn or renew his agreement with the service provider may be monitored or computed. Machine learning methods may be utilized to determine a probability of churn based on historic data. Based upon the determination an output to retention personnel may be provided and an improved offer may be made to customers that are deemed in risk of churning.
摘要翻译：通过监控提供给客户的服务水平来进行流失预测。可能会监控或计算客户应该与服务提供商协商或更新协议的时间。可以利用机器学习方法来确定基于历史数据的流失概率。根据确定，可以提供保留人员的产出，并且可以对被认为有搅拌风险的客户进行改进的报价。

9. 发明申请

US20080255813A1 Probabilistic regression suites for functional verification 有权
标题翻译：概率回归套件进行功能验证
公开(公告)号：US20080255813A1
公开(公告)日：2008-10-16
申请号：US12121962
申请日：2008-05-16
申请人： Shai Fine , Shmuel Ur , Avi Ziv , Simon Rushton
发明人： Shai Fine , Shmuel Ur , Avi Ziv , Simon Rushton
IPC分类号： G06F7/60
CPC分类号： G06F17/504
摘要： Methods, apparatus and systems are provided that enable the generation of random regression suites for verification of a hardware or software design to be formulated as optimization problems. Solution of the optimization problems using probabilistic methods provides information on which set of test specifications should be used, and how many tests should be generated from each specification. In one mode of operation regression suites are constructed that use the minimal number of tests required to achieve a specific coverage goal. In another mode of operation regression suites are constructed so as to maximize task coverage when a fixed number of tests are run or within a fixed cost.
摘要翻译：提供了方法，装置和系统，其能够生成随机回归套件以验证将被制定为优化问题的硬件或软件设计。使用概率方法的优化问题的解决方案提供了应使用哪组测试规范的信息，以及每个规范应该生成多少个测试。在一种操作模式中，构建了使用最少数量的测试来实现特定覆盖目标的回归套件。在另一种操作模式下，构建回归套件，以便在运行固定数量的测试或固定成本时最大化任务覆盖。

10. 发明授权

US07203882B2 Clustering-based approach for coverage-directed test generation 失效
标题翻译：面向覆盖的测试生成的基于聚类的方法
公开(公告)号：US07203882B2
公开(公告)日：2007-04-10
申请号：US10930327
申请日：2004-08-31
申请人： Shai Fine , Avi Ziv
发明人： Shai Fine , Avi Ziv
IPC分类号： G01R31/28
CPC分类号： G01R31/31813 , G01R31/318371
摘要： A coverage-directed test generation technique for functional design verification relies on events that are clustered according to similarities in the way that the events are stimulated in a simulation environment, not necessarily related to the semantics of the events. The set of directives generated by a coverage-directed test generation engine for each event is analyzed and evaluated for similarities with sets of directives for other events. Identified similarities in the sets of directives provide the basis for defining event clusters. Once clusters have been defined, a common set of directives for the coverage-directed test generation engine is generated that attempts to cover all events in a given cluster.
摘要翻译：用于功能设计验证的面向覆盖的测试生成技术依赖于根据事件在仿真环境中被刺激的方式的相似性聚类的事件，这些事件不一定与事件的语义相关。针对每个事件由覆盖面向测试生成引擎生成的指令集进行分析，并针对其他事件的指令集进行相似性评估。在指令集中确定的相似性为定义事件集群提供了基础。一旦定义了集群，就会生成针对覆盖范围的测试生成引擎的一组常用的指令，试图覆盖给定集群中的所有事件。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式