公开(公告)号：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.

摘要翻译： 提供了方法，装置和系统，其能够生成随机回归套件以验证将被制定为优化问题的硬件或软件设计。 使用概率方法的优化问题的解决方案提供了应使用哪组测试规范的信息，以及每个规范应该生成多少个测试。 在一种操作模式中，构建了使用最少数量的测试来实现特定覆盖目标的回归套件。 在另一种操作模式下，构建回归套件，以便在运行固定数量的测试或固定成本时最大化任务覆盖。

公开(公告)号：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.

摘要翻译： 查询难度预测单元包括查询难度预测器，用于确定从在输入查询上操作的搜索引擎接收的查询文档与从输入查询的子查询操作的搜索引擎接收到的子查询文档之间的重叠程度。 该单元从重叠的程度产生查询难度预测。

公开(公告)号：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.

摘要翻译： 用于功能设计验证的面向覆盖的测试生成技术依赖于根据事件在仿真环境中被刺激的方式的相似性聚类的事件，这些事件不一定与事件的语义相关。 针对每个事件由覆盖面向测试生成引擎生成的指令集进行分析，并针对其他事件的指令集进行相似性评估。 在指令集中确定的相似性为定义事件集群提供了基础。 一旦定义了集群，就会生成针对覆盖范围的测试生成引擎的一组常用的指令，试图覆盖给定集群中的所有事件。

公开(公告)号：US20070011631A1

公开(公告)日：2007-01-11

申请号：US11177127

申请日：2005-07-07

申请人： Shai Fine ,  Ari Freund ,  Itai Jaeger ,  Yehuda Naveh ,  Avi Ziv

发明人： Shai Fine ,  Ari Freund ,  Itai Jaeger ,  Yehuda Naveh ,  Avi Ziv

IPC分类号： G06F17/50

CPC分类号： G01R31/318357

摘要： Test generation is improved by learning the relationship between an initial state vector for a stimuli generator and generation success. A stimuli generator for a design-under-verification is provided with information about the success probabilities of potential assignments to an initial state bit vector. Selection of initial states according to the success probabilities ensures a higher success rate than would be achieved without this knowledge. The approach for obtaining an initial state bit vector employs a CSP solver. A learning system is directed to model the behavior of possible initial state assignments. The learning system develops the structure and parameters of a Bayesian network that describes the relation between the initial state and generation success.

摘要翻译： 通过学习刺激发生器的初始状态向量与生成成功之间的关系来提高测试生成。 提供了一种用于未验证设计的刺激发生器，其中提供了关于初始状态位向量的潜在分配的成功概率的信息。 根据成功概率选择初始状态确保比没有这种知识将获得的成功率更高的成功率。 用于获得初始状态位向量的方法采用CSP求解器。 学习系统旨在模拟可能的初始状态分配的行为。 学习系统开发了贝叶斯网络的结构和参数，描述了初始状态与发电成功之间的关系。

公开(公告)号：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.

摘要翻译： 提供了一种在分布式信息检索中合并结果的方法和系统。 搜索管理器与多个组件进行通信，其中组件是对文档收集工作的搜索引擎，并以搜索查询的文档列表的形式返回结果。 搜索管理器向多个组件提交查询，以文档列表的形式从每个组件接收结果; 估计组件处理查询的成功，以生成每个查询的组件的优点得分; 将优点分数应用于组件的结果; 并且通过按照所应用的优点得分的顺序来排列来自多个组分的结果。

公开(公告)号：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）的能力的度量。

公开(公告)号：US07181376B2

公开(公告)日：2007-02-20

申请号：US10453150

申请日：2003-06-03

申请人： Shai Fine ,  Moshe Levinger ,  Avi Ziv

发明人： Shai Fine ,  Moshe Levinger ,  Avi Ziv

IPC分类号： G06F17/10

CPC分类号： G06F11/261 ,  G05B23/0256 ,  G06F17/5022

摘要： A Bayesian network correlating coverage data and input data to a test verification system for coverage directed test generation (CDG) of a device under test. In one embodiment, the Bayesian network is part of a CDG engine which also includes a data analyzer which analyzes coverage data from a current test run of a test verification system and from previous test runs to determine which coverage events from a coverage model have occurred therein, at what frequency and which ones have not yet occurred, a coverage model listing coverage events which define the goal of the test verification system and a task manager coupled to the data analyzer and the Bayesian network which refers to the coverage model and queries the Bayesian network to produce input data to achieve desired coverage events.

摘要翻译： 贝叶斯网络将覆盖数据和输入数据与测试验证系统相关联，用于被测设备的覆盖定向测试生成（CDG）。 在一个实施例中，贝叶斯网络是CDG引擎的一部分，其还包括数据分析器，其分析来自测试验证系统的当前测试运行的覆盖数据，并且从先前的测试运行中分析来自覆盖模型的哪些覆盖事件在哪里发生 在什么频率和哪些频率还没有发生的情况下，列出定义测试验证系统的目标的覆盖事件的覆盖模型以及耦合到数据分析器和贝叶斯网络的任务管理器，其参考覆盖模型并查询贝叶斯 网络产生输入数据来实现所需的覆盖事件。

公开(公告)号：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）。

公开(公告)号：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.

摘要翻译： 通过监控提供给客户的服务水平来进行流失预测。 可能会监控或计算客户应该与服务提供商协商或更新协议的时间。 可以利用机器学习方法来确定基于历史数据的流失概率。 根据确定，可以提供保留人员的产出，并且可以对被认为有搅拌风险的客户进行改进的报价。

公开(公告)号：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）的能力的度量。