公开(公告)号：US20080229126A1

公开(公告)日：2008-09-18

申请号：US12129292

申请日：2008-05-29

申请人： Robert Krauthgamer ,  Nimrod Megiddo

发明人： Robert Krauthgamer ,  Nimrod Megiddo

IPC分类号： G06F1/00

CPC分类号： G06F1/3203 ,  G06F1/324 ,  G06F1/3287 ,  G06F1/329 ,  G06F1/3296 ,  G06F9/5044 ,  G06F9/5094 ,  Y02D10/126 ,  Y02D10/171 ,  Y02D10/172 ,  Y02D10/22 ,  Y02D10/24

摘要： Methods are provided for maximizing the throughput of a computer system in the presence of one or more power constraints. Throughput is maximized by repeatedly or continuously or periodically optimizing task scheduling and assignment for each of a plurality of components of a computer system. The components include a plurality of central processing units (CPUs) each operating at a corresponding operating frequency. The components also include a plurality of disk drives. The corresponding operating frequencies of one or more CPUs of the plurality of CPUs are adjusted to maximize computer system throughput under one or more power constraints. Optimizing task scheduling and assignment, as well as adjusting the corresponding operating frequencies of one or more CPUs, are performed by solving a mathematical optimization problem using a first methodology over a first time interval and a second methodology over a second time interval longer than the first time interval. The first methodology comprises a short term heuristic solver for adapting to computer system changes that occur on a short time scale, and the second methodology comprises a long term solver having greater accuracy and greater computational complexity than the first methodology.

摘要翻译： 提供了用于在存在一个或多个功率约束的情况下最大化计算机系统的吞吐量的方法。 通过对计算机系统的多个组件中的每个组件重复地或连续地或周期性地优化任务调度和分配来最大化吞吐量。 这些部件包括多个以对应的工作频率工作的中央处理单元（CPU）。 组件还包括多个磁盘驱动器。 调整多个CPU中的一个或多个CPU的相应工作频率以在一个或多个功率限制下最大化计算机系统吞吐量。 优化任务调度和分配以及调整一个或多个CPU的对应的工作频率是通过在第一时间间隔内使用第一方法求解数学优化问题并且在比第一时间间隔长的第二时间间隔上解决第二方法 时间间隔。 第一种方法包括用于适应在短时间尺度上发生的计算机系统变化的短期启发式求解器，并且第二种方法包括具有比第一种方法更高的精度和更大的计算复杂度的长期求解器。

公开(公告)号：US20080109811A1

公开(公告)日：2008-05-08

申请号：US11557587

申请日：2006-11-08

申请人： Robert Krauthgamer ,  Nimrod Megiddo

发明人： Robert Krauthgamer ,  Nimrod Megiddo

IPC分类号： G06F9/50 ,  G06F1/32

CPC分类号： G06F1/3203 ,  G06F1/324 ,  G06F1/3287 ,  G06F1/329 ,  G06F1/3296 ,  G06F9/5044 ,  G06F9/5094 ,  Y02D10/126 ,  Y02D10/171 ,  Y02D10/172 ,  Y02D10/22 ,  Y02D10/24

摘要： Methods are provided for maximizing the throughput of a computer system in the presence of one or more power constraints. Throughput is maximized by repeatedly or continuously optimizing task scheduling and assignment for each of a plurality of components of a computer system. The components include a plurality of central processing units (CPUs) each operating at a corresponding operating frequency. The components also include a plurality of disk drives. The corresponding operating frequencies of one or more CPUs of the plurality of CPUs are adjusted to maximize computer system throughput under one or more power constraints. Optimizing task scheduling and assignment, as well as adjusting the corresponding operating frequencies of one or more CPUs, are performed by solving a mathematical optimization problem using a first methodology over a first time interval and a second methodology over a second time interval longer than the first time interval. The first methodology comprises a short term heuristic solver for adapting to computer system changes that occur on a short time scale, and the second methodology comprises a long term solver having greater accuracy and greater computational complexity than the first methodology.

摘要翻译： 提供了用于在存在一个或多个功率约束的情况下最大化计算机系统的吞吐量的方法。 通过对计算机系统的多个部件中的每一个的重复地或连续地优化任务调度和分配来最大化吞吐量。 这些部件包括多个以对应的工作频率工作的中央处理单元（CPU）。 组件还包括多个磁盘驱动器。 调整多个CPU中的一个或多个CPU的相应工作频率以在一个或多个功率限制下最大化计算机系统吞吐量。 优化任务调度和分配以及调整一个或多个CPU的对应的工作频率是通过在第一时间间隔内使用第一方法求解数学优化问题并且在比第一时间间隔长的第二时间间隔上解决第二方法 时间间隔。 第一种方法包括用于适应在短时间尺度上发生的计算机系统变化的短期启发式求解器，并且第二种方法包括具有比第一种方法更高的精度和更大的计算复杂度的长期求解器。

公开(公告)号：US07587621B2

公开(公告)日：2009-09-08

申请号：US11557587

申请日：2006-11-08

申请人： Robert Krauthgamer ,  Nimrod Megiddo

发明人： Robert Krauthgamer ,  Nimrod Megiddo

IPC分类号： G06F1/00

CPC分类号： G06F1/3203 ,  G06F1/324 ,  G06F1/3287 ,  G06F1/329 ,  G06F1/3296 ,  G06F9/5044 ,  G06F9/5094 ,  Y02D10/126 ,  Y02D10/171 ,  Y02D10/172 ,  Y02D10/22 ,  Y02D10/24

摘要： Methods are provided for maximizing the throughput of a computer system in the presence of one or more power constraints. Throughput is maximized by repeatedly or continuously optimizing task scheduling and assignment for each of a plurality of components of a computer system. The components include a plurality of central processing units (CPUs) each operating at a corresponding operating frequency. The components also include a plurality of disk drives. The corresponding operating frequencies of one or more CPUs of the plurality of CPUs are adjusted to maximize computer system throughput under one or more power constraints. Optimizing task scheduling and assignment, as well as adjusting the corresponding operating frequencies of one or more CPUs, are performed by solving a mathematical optimization problem using a first methodology over a first time interval and a second methodology over a second time interval longer than the first time interval. The first methodology comprises a short term heuristic solver for adapting to computer system changes that occur on a short time scale, and the second methodology comprises a long term solver having greater accuracy and greater computational complexity than the first methodology.

摘要翻译： 提供了用于在存在一个或多个功率约束的情况下最大化计算机系统的吞吐量的方法。 通过对计算机系统的多个部件中的每一个的重复地或连续地优化任务调度和分配来最大化吞吐量。 这些部件包括多个以对应的工作频率工作的中央处理单元（CPU）。 组件还包括多个磁盘驱动器。 调整多个CPU中的一个或多个CPU的相应工作频率以在一个或多个功率限制下最大化计算机系统吞吐量。 优化任务调度和分配以及调整一个或多个CPU的对应的工作频率是通过在第一时间间隔内使用第一方法求解数学优化问题并且在比第一时间间隔长的第二时间间隔上解决第二方法 时间间隔。 第一种方法包括用于适应在短时间尺度上发生的计算机系统变化的短期启发式求解器，并且第二种方法包括具有比第一种方法更高的精度和更大的计算复杂度的长期求解器。

公开(公告)号：US08046605B2

公开(公告)日：2011-10-25

申请号：US12129292

申请日：2008-05-29

申请人： Robert Krauthgamer ,  Nimrod Megiddo

发明人： Robert Krauthgamer ,  Nimrod Megiddo

IPC分类号： G06F1/00 ,  G06F1/26

CPC分类号： G06F1/3203 ,  G06F1/324 ,  G06F1/3287 ,  G06F1/329 ,  G06F1/3296 ,  G06F9/5044 ,  G06F9/5094 ,  Y02D10/126 ,  Y02D10/171 ,  Y02D10/172 ,  Y02D10/22 ,  Y02D10/24

摘要： Methods are provided for maximizing the throughput of a computer system in the presence of one or more power constraints. Throughput is maximized by repeatedly or continuously or periodically optimizing task scheduling and assignment for each of a plurality of components of a computer system. The components include a plurality of central processing units (CPUs) each operating at a corresponding operating frequency. The components also include a plurality of disk drives. The corresponding operating frequencies of one or more CPUs of the plurality of CPUs are adjusted to maximize computer system throughput under one or more power constraints. Optimizing task scheduling and assignment, as well as adjusting the corresponding operating frequencies of one or more CPUs, are performed by solving a mathematical optimization problem using a first methodology over a first time interval and a second methodology over a second time interval longer than the first time interval. The first methodology comprises a short term heuristic solver for adapting to computer system changes that occur on a short time scale, and the second methodology comprises a long term solver having greater accuracy and greater computational complexity than the first methodology.

摘要翻译： 提供了用于在存在一个或多个功率约束的情况下最大化计算机系统的吞吐量的方法。 通过对计算机系统的多个组件中的每个组件重复地或连续地或周期性地优化任务调度和分配来最大化吞吐量。 这些部件包括多个以对应的工作频率工作的中央处理单元（CPU）。 组件还包括多个磁盘驱动器。 调整多个CPU中的一个或多个CPU的相应工作频率以在一个或多个功率限制下最大化计算机系统吞吐量。 优化任务调度和分配以及调整一个或多个CPU的对应的工作频率是通过在第一时间间隔内使用第一方法求解数学优化问题并且在比第一时间间隔长的第二时间间隔上解决第二方法 时间间隔。 第一种方法包括用于适应在短时间尺度上发生的计算机系统变化的短期启发式求解器，并且第二种方法包括具有比第一种方法更高的精度和更大的计算复杂度的长期求解器。

公开(公告)号：US08489443B2

公开(公告)日：2013-07-16

申请号：US12051783

申请日：2008-03-19

申请人： Nimrod Megiddo

发明人： Nimrod Megiddo

IPC分类号： G06Q10/00

CPC分类号： G06Q10/10

摘要： A method and apparatus for selecting a subset of proposals from a set of proposals submitted via a web site, including defining proposal attributes for the selecting, formulating selection requirements for the subset, establishing metrics for comparing proposals according to the proposal attributes and the selection requirements, evaluating each of the set of proposals according the established metrics, distributing the results of evaluating each of the set of proposals to the submitter of each proposal, formulating an optimization problem for determining the subset of proposals, determining the subset of proposals by solving the optimization problem, and accepting feedback about the determining including changing the optimization problem based on the feedback.

摘要翻译： 一种用于从通过网站提交的一组提案中选择提案子集的方法和装置，包括定义用于选择的提案属性，为该子集制定选择要求，根据提案属性和选择要求建立用于比较提案的度量 根据既定的指标评估每组提案，将每一个提案的评估结果分配给每个提案的提交者，制定用于确定提案子集的优化问题，通过解决方案来确定提案的子集 优化问题，并接受关于确定的反馈，包括基于反馈来改变优化问题。

公开(公告)号：US08467512B2

公开(公告)日：2013-06-18

申请号：US12512347

申请日：2009-07-30

申请人： Arnon Amir ,  Nimrod Megiddo

发明人： Arnon Amir ,  Nimrod Megiddo

IPC分类号： H04M1/56

CPC分类号： H04M15/06

摘要： A service that handles incoming telephone calls without bothering the telephone subscriber is disclosed. The service permits a call to go through to a subscriber if the service determines that the call is not unwanted and the caller has been unauthenticated. The authentication is based on challenging the caller to prove its identity rather than relying on caller ID displays. Prospective callers pre-register with the service providing caller account information. When a caller is issued a challenge, the caller may prove its authenticity by supplying the challenge back to the service along with its registered information.

摘要翻译： 公开了一种处理传入电话而不打扰电话用户的服务。 如果服务确定呼叫不是不需要的，并且呼叫者未经身份验证，则该服务允许呼叫转到订户。 认证是基于挑战来电者来证明其身份，而不是依靠来电显示。 预期来电者预先注册提供来电者帐户信息的服务。 当呼叫者发出挑战时，呼叫者可以通过向服务提供质询及其注册信息来证明其真实性。

公开(公告)号：US07539295B1

公开(公告)日：2009-05-26

申请号：US12195904

申请日：2008-08-21

申请人： Arnon Amir ,  Nimrod Megiddo

发明人： Arnon Amir ,  Nimrod Megiddo

IPC分类号： H04M3/00

CPC分类号： H04M3/5183 ,  H04L51/34 ,  H04M2201/42 ,  H04M2203/357 ,  H04M2203/551

摘要： A method for creating and maintaining threads of communications comprises accepting an electronic-communication call from a caller, determining if the caller is a new or previous caller by determining if a prior-caller user identification is contained within a call-receiving system, responsive to determining that the caller is a new caller assigning a new-caller user identification to the new caller and assigning a unique thread identification for communications related to a new issue, and responsive to determining that the caller is a known previous caller verifying a known-caller user identification and determining whether the known previous caller is calling about a new issue. Responsive to determining that the known previous caller is calling about a new issue, the method further includes assigning a unique thread identification to the new issue. Responsive to determining that the known previous caller is calling about an existing issue, the method further includes obtaining a list of previous thread identifications.

摘要翻译： 用于创建和维护通信线程的方法包括接受来自呼叫者的电子通信呼叫，通过确定呼叫接收系统中是否包含先前呼叫者用户标识来确定呼叫者是新呼叫者还是先前呼叫者，响应于 确定呼叫者是新呼叫者，向新呼叫者分配新的呼叫者用户标识，并为与新问题相关的通信分配唯一的线程标识，并且响应于确定呼叫者是已知的以前的呼叫者来验证已知呼叫者 用户识别并确定已知的先前呼叫者是否在呼叫新的问题。 响应于确定已知的先前呼叫者正在调用新的问题，该方法还包括向新问题分配唯一的线程标识。 响应于确定已知的先前呼叫者正在调用现有问题，该方法还包括获得先前线程标识的列表。

公开(公告)号：US20090106244A1

公开(公告)日：2009-04-23

申请号：US12200981

申请日：2008-08-29

申请人： Debabrata Dash ,  Guy M. Lohman ,  Nimrod Megiddo ,  Jun Rao

发明人： Debabrata Dash ,  Guy M. Lohman ,  Nimrod Megiddo ,  Jun Rao

IPC分类号： G06F17/30

CPC分类号： G06F16/2465 ,  Y10S707/99931 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99935 ,  Y10S707/99937 ,  Y10S707/99938 ,  Y10S707/99942 ,  Y10S707/99943 ,  Y10S707/99944

摘要： Exemplary embodiments of the present invention relate to enhanced faceted search support for OLAP queries over unstructured text as well as structured dimensions by the dynamic and automatic discovery of dimensions that are determined to be most “interesting” to a user based upon the data. Within the exemplary embodiments “interestingness” is defined as how surprising a summary along some dimensions is from a user's expectation. Further, multi-attribute facets are determined and a user is optionally permitted to specify the distribution of values that she expects, and/or the distance metric by which actual and expected distributions are to be compared.

摘要翻译： 本发明的示例性实施例涉及通过基于数据被确定为对用户最“有趣”的维度的动态和自动发现的针对非结构化文本的OLAP查询的增强的分面搜索支持以及结构化维度。 在示例性实施例中，“兴趣”被定义为从用户的期望来看，某些维度上的摘要令人惊讶。 此外，确定多属性小平面，并且可选地允许用户指定她期望的值的分布，和/或要比较实际和预期分布的距离度量。

公开(公告)号：US07512629B2

公开(公告)日：2009-03-31

申请号：US11457418

申请日：2006-07-13

申请人： Peter Jay Haas ,  Marcel Kutsch ,  Volker Gerhard Markl ,  Nimrod Megiddo

发明人： Peter Jay Haas ,  Marcel Kutsch ,  Volker Gerhard Markl ,  Nimrod Megiddo

IPC分类号： G06F7/00

CPC分类号： G06F17/30469 ,  Y10S707/99942 ,  Y10S707/99943

摘要： The present invention provides a method of selectivity estimation in which preprocessing steps improve the feasibility and efficiency of the estimation. The preprocessing steps are partitioning (to make iterative scaling estimation terminate in a reasonable time for even large sets of predicates), forced partitioning (to enable partitioning in case there are no “natural” partitions, by finding the subsets of predicates to create partitions that least impact the overall solution); inconsistency resolution (in order to ensure that there always is a correct and feasible solution), and implied zero elimination (to ensure convergence of the iterative scaling computation under all circumstances). All of these preprocessing steps make a maximum entropy method of selectivity estimation produce a correct cardinality model, for any kind of query with conjuncts of predicates. In addition, the preprocessing steps can also be used in conjunction with prior art methods for building a cardinality model.

摘要翻译： 本发明提供了一种选择性估计方法，其中预处理步骤提高了估计的可行性和效率。 预处理步骤是分区（使迭代缩放估计在甚至大量谓词的合理时间内终止），强制分区（在没有“自然”分区的情况下启用分区），通过查找谓词子集来创建分区 对整体解决方案影响最小）; 不一致性解决（为了确保总是有正确可行的解决方案），并暗示零消除（以确保在任何情况下迭代缩放计算的收敛）。 所有这些预处理步骤使得选择性估计的最大熵方法产生正确的基数模型，用于具有谓词结合的任何类型的查询。 此外，预处理步骤还可以与用于构建基数模型的现有技术方法结合使用。

公开(公告)号：US07480621B1

公开(公告)日：2009-01-20

申请号：US09533325

申请日：2000-03-22

申请人： Nimrod Megiddo

发明人： Nimrod Megiddo

IPC分类号： G06Q10/00 ,  G06F17/50

CPC分类号： G06Q10/10 ,  G06Q10/103

摘要： A system, method and program product for commerce management, especially for managing contingency agreements or contracts. An agreement is entered into the system, logging conditions for the agreement and identifying potential responses to satisfy each condition. A location may also be identified for each identified potential response, e.g. a HTML link to an internet web site. Milestones are set to determine when to check whether conditions have been satisfied. As each milestone is encountered information is retrieved from the locations or provided manually. The retrieved information is checked to determine whether the agreement is determinate, i.e., all of the conditions have been satisfied or, the agreement has failed because one condition will not be satisfied. If more conditions remain unsatisfied and are identified with subsequent milestones, the most recent milestone is recorded. The contracting parties are notified regarding status of the agreement and of passing any milestone. Notification and reminders may be by electronic mail (e-mail) or by more traditional mail.

摘要翻译： 一种用于商业管理的系统，方法和程序产品，特别是用于管理应急协议或合同。 在系统中签订协议，记录协议的条件，并确定满足每个条件的潜在响应。 还可以为每个识别的潜在响应识别位置，例如， 一个到互联网网站的HTML链接。 设定里程碑以确定何时检查条件是否得到满足。 当遇到每个里程碑时，信息从位置检索或手动提供。 检查检索到的信息以确定协议是否确定，即所有条件已经被满足，或者协议失败，因为一个条件将不被满足。 如果更多的条件仍然不满足，并且随后的里程碑被识别，则记录最新的里程碑。 通知缔约方的协议状态和通过任何里程碑。 通知和提醒可能是通过电子邮件（电子邮件）或更传统的邮件。