公开(公告)号：US20050091364A1

公开(公告)日：2005-04-28

申请号：US10674962

申请日：2003-09-30

申请人： David Bantz ,  David Chess ,  Christos Georgiou ,  Jeffrey Kephart ,  Clifford Pickover

发明人： David Bantz ,  David Chess ,  Christos Georgiou ,  Jeffrey Kephart ,  Clifford Pickover

IPC分类号： G06Q50/00 ,  G06F15/173 ,  G06Q30/00 ,  H04L12/00 ,  H04L12/56 ,  H04L29/08 ,  H04M3/00

CPC分类号： H04L67/1008 ,  H04L67/1002 ,  H04L67/1029

摘要： A system and method for providing real-time, dynamic switching between first and second service providers each capable of providing a service for users over a communications network. The method includes steps of: establishing switching criterion for deciding when to switch service provision between the first service provider and second service provider; maintaining state information associated with a user's use of the service provided by a first service provider; switching between the first and second service provided over the communications network based on satisfaction of the switching criterion; and, migrating any state information maintained up to the time of switching to the second service. Preferably, the dynamic switching occurs in a manner substantially transparent to the user.

摘要翻译： 一种用于在第一和第二服务提供商之间提供实时动态切换的系统和方法，每个服务提供商能够通过通信网络为用户提供服务。 该方法包括以下步骤：建立用于决定何时切换第一服务提供商和第二服务提供商之间的服务提供的切换标准; 维护与用户对由第一服务提供商提供的服务的使用相关联的状态信息; 基于切换标准的满足，在通信网络上提供的第一和第二服务之间切换; 并且将维护的任何状态信息迁移到切换到第二服务的时间。 优选地，动态切换以对用户基本透明的方式发生。

公开(公告)号：US20070016824A1

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

申请号：US11486927

申请日：2006-07-14

申请人： John Bivens ,  David Chess ,  Donna Dillenberger ,  Steven Froehlich ,  James Hanson ,  Mark Hulber ,  Jeffrey Kephart ,  Giovanni Pacifici ,  Michael Spreitzer ,  Asser Tantawi ,  Mathew Thoennes ,  Ian Whalley ,  Peter Yocom

发明人： John Bivens ,  David Chess ,  Donna Dillenberger ,  Steven Froehlich ,  James Hanson ,  Mark Hulber ,  Jeffrey Kephart ,  Giovanni Pacifici ,  Michael Spreitzer ,  Asser Tantawi ,  Mathew Thoennes ,  Ian Whalley ,  Peter Yocom

IPC分类号： G06F11/00

CPC分类号： G06Q10/06

摘要： Techniques for globally managing systems are provided. One or more measurable effects of at least one hypothetical action to achieve a management goal are determined at a first system manager. The one or more measurable effects are sent from the first system manager to a second system manager. At the second system manager, one or more procedural actions to achieve the management goal are determined in response to the one or more received measurable effects. The one or more procedural actions are executed to achieve the management goal.

摘要翻译： 提供了全球管理系统的技术。 在第一个系统管理员处确定至少一个假设动作以实现管理目标的一个或多个可测量的影响。 一个或多个可测量的效果从第一系统管理器发送到第二系统管理器。 在第二系统管理器中，响应于一个或多个接收到的可测量效果来确定用于实现管理目标的一个或多个程序动作。 执行一个或多个程序操作以实现管理目标。

公开(公告)号：US20050010388A1

公开(公告)日：2005-01-13

申请号：US10698880

申请日：2003-10-31

申请人： Saurabh Bagchi ,  Rajarshi Das ,  Yixin Diao ,  Marc Kaplan ,  Jeffrey Kephart

发明人： Saurabh Bagchi ,  Rajarshi Das ,  Yixin Diao ,  Marc Kaplan ,  Jeffrey Kephart

IPC分类号： G06F9/45 ,  G06F17/00

CPC分类号： G06F11/3447 ,  G06F11/3409 ,  G06F11/3452 ,  G06F2201/81 ,  G06F2201/86

摘要： An improved method and system for performing dynamic online multi-parameter optimization for autonomic computing systems are provided. With the method and system of the present invention, a simplex, i.e. a set of points in the parameter space that has been directly sampled, is maintained. The system's performance with regard to a particular utility value is measured for the particular setting of configuration parameters associated with each point in the simplex. A new sample point is determined using the geometric transformations of the simplex. The method and system provide mechanisms for limiting the size of the simplex that is generated through these geometric transformations so that the present invention may be implemented in noisy environments in which the same configuration settings may lead to different results with regard to the utility value. In addition, mechanisms are provided for resampling a current best point in the simplex to determine if the environment has changed. If a sufficiently different utility value is obtained from a previously sampled utility value for the point in the simplex, then rather than contracting, the simplex is expanded. If the difference between utility values is not sufficient enough, then contraction of the simplex is performed. In addition, in order to allow for both real and integer valued parameters in the simplex, a mechanism is provided by which invalid valued parameters that are generated by geometric transformations being performed on the simplex are mapped to a nearest valid value. Similarly, parameter values that violate constraints are mapped to values that satisfy constraints taking care that the dimensionality of the simplex is not reduced.

摘要翻译： 提供了一种用于自动计算系统执行动态在线多参数优化的改进方法和系统。 利用本发明的方法和系统，维持单纯形，即直接采样的参数空间中的一组点。 关于特定效用值的系统的性能是针对与单工中的每个点相关联的配置参数的特定设置进行测量的。 使用单纯形的几何变换确定新的采样点。 该方法和系统提供了用于限制通过这些几何变换产生的单工的尺寸的机制，使得本发明可以在噪声环境中实现，其中相同的配置设置可能导致关于效用值的不同结果。 此外，还提供了用于对单纯形中当前最佳点进行重新采样以确定环境是否已更改的机制。 如果从单纯形中的点的先前采样的效用值获得足够不同的效用值，则不是收缩，所以单纯形被扩展。 如果效用值之间的差异不足够，则单纯形的收缩被执行。 此外，为了允许单纯形中的实数和整数值参数，提供了一种机制，通过这种机制，通过在单纯形上执行的几何变换生成的无效值参数被映射到最接近的有效值。 类似地，违反约束的参数值被映射到满足约束的值，注意单纯形的维度不会减小。

公开(公告)号：US09052895B2

公开(公告)日：2015-06-09

申请号：US13082144

申请日：2011-04-07

申请人： Mor Harchol-Balter ,  Anshul Gandhi ,  Rajarshi Das ,  Jeffrey Kephart

发明人： Mor Harchol-Balter ,  Anshul Gandhi ,  Rajarshi Das ,  Jeffrey Kephart

IPC分类号： G06F1/26 ,  G06F1/32 ,  G06F3/00 ,  G06F9/48 ,  G06F9/50

CPC分类号： G06F1/3203 ,  G06F1/32 ,  G06F1/3206 ,  G06F1/3228 ,  G06F1/324 ,  G06F1/329 ,  G06F1/3296 ,  G06F9/4881 ,  G06F9/4893 ,  G06F9/5094 ,  Y02D10/00 ,  Y02D10/126 ,  Y02D10/17 ,  Y02D10/20 ,  Y02D10/22 ,  Y02D10/24

摘要： Systems, apparatuses, methods, and software that implement power budget allocation optimization algorithms in multi-processor systems, such as server farms. The algorithms are derived from a queuing theoretic model that minimizes the mean response time of the system to the jobs in the workload while accounting for a variety of factors. These factors include, but are not necessarily limited to, the type of power (frequency) scaling mechanism(s) available within the processors in the system, the power-to-frequency relationship(s) of the processors for the scaling mechanism(s) available, whether or not the system is an open or closed loop system, the arrival rate of jobs incoming into the system, the number of jobs within the system, and the type of workload being processed.

摘要翻译： 在多处理器系统（如服务器场）中实施功率预算分配优化算法的系统，设备，方法和软件。 这些算法是从排队理论模型中得出的，该模型最大限度地减少了系统对工作负载中的作业的平均响应时间，同时考虑了各种因素。 这些因素包括但不一定限于系统内处理器内可用的功率（频率）缩放机制的类型，用于缩放机制的处理器的功率与频率关系（s） ），无论系统是开放还是闭环系统，系统中进入作业的到达率，系统中的作业数以及正在处理的工作负载的类型。

公开(公告)号：US20060026570A1

公开(公告)日：2006-02-02

申请号：US10909760

申请日：2004-08-02

申请人： Hoi Chan ,  Trieu Chieu ,  Jeffrey Kephart

发明人： Hoi Chan ,  Trieu Chieu ,  Jeffrey Kephart

IPC分类号： G06F9/44

CPC分类号： G06F8/316 ,  G06F2209/542

摘要： The present invention is directed to systems and methods that treat the monitoring of a software application as a separate and independent concern from the software application itself. The present invention utilizes aspect oriented programming to intercept, analyze, decompose the application states of a software application and then to link appropriate non-invasive constructs into the software application code to provide application state information to an autonomic manager through a plurality of sensors. The autonomic manager analyzes the application state information for compliance pre-defined parameters, and takes appropriate corrective action including modifying the software application states using a plurality of effectors. The sensors and effectors are linked as non-invasive constructs to the software application, and in aspect oriented programming constitute aspects. In order to prevent any adverse or undesirable effects to the software application as a result of the application state analysis and selected action, a safety mechanism is included in communication with the effectors.

公开(公告)号：US20120084580A1

公开(公告)日：2012-04-05

申请号：US13082144

申请日：2011-04-07

申请人： Mor Harchol-Balter ,  Anshul Gandhi ,  Rajarshi Das ,  Jeffrey Kephart

发明人： Mor Harchol-Balter ,  Anshul Gandhi ,  Rajarshi Das ,  Jeffrey Kephart

IPC分类号： G06F1/32

CPC分类号： G06F1/3203 ,  G06F1/32 ,  G06F1/3206 ,  G06F1/3228 ,  G06F1/324 ,  G06F1/329 ,  G06F1/3296 ,  G06F9/4881 ,  G06F9/4893 ,  G06F9/5094 ,  Y02D10/00 ,  Y02D10/126 ,  Y02D10/17 ,  Y02D10/20 ,  Y02D10/22 ,  Y02D10/24

摘要： Systems, apparatuses, methods, and software that implement power budget allocation optimization algorithms in multi-processor systems, such as server farms. The algorithms are derived from a queuing theoretic model that minimizes the mean response time of the system to the jobs in the workload while accounting for a variety of factors. These factors include, but are not necessarily limited to, the type of power (frequency) scaling mechanism(s) available within the processors in the system, the power-to-frequency relationship(s) of the processors for the scaling mechanism(s) available, whether or not the system is an open or closed loop system, the arrival rate of jobs incoming into the system, the number of jobs within the system, and the type of workload being processed.

摘要翻译： 在多处理器系统（如服务器场）中实施功率预算分配优化算法的系统，设备，方法和软件。 这些算法是从排队理论模型中得出的，该模型最大限度地减少了系统对工作负载中的作业的平均响应时间，同时考虑了各种因素。 这些因素包括但不一定限于系统内处理器内可用的功率（频率）缩放机制的类型，用于缩放机制的处理器的功率与频率关系（s） ），无论系统是开放还是闭环系统，系统中进入作业的到达率，系统中的作业数以及正在处理的工作负载的类型。

公开(公告)号：US20060149820A1

公开(公告)日：2006-07-06

申请号：US11028969

申请日：2005-01-04

申请人： Vadakkedathu Rajan ,  Mark Wegman ,  Richard Segal ,  Jason Crawford ,  Joel Ossher ,  Jeffrey Kephart

发明人： Vadakkedathu Rajan ,  Mark Wegman ,  Richard Segal ,  Jason Crawford ,  Joel Ossher ,  Jeffrey Kephart

IPC分类号： G06F15/16

CPC分类号： G06Q10/107 ,  H04L51/12

摘要： A method for detecting undesirable e-mails is disclosed. The method includes collecting a plurality of undesirable e-mails, arranging the plurality of undesirable e-mails into a plurality of groups and generating, for each group, at least one token, thereby producing a plurality of tokens for the plurality of undesirable e-mails. The method further includes receiving a first e-mail and generating at least one token for the first e-mail. The method further includes causing a comparison of the at least one token for the first e-mail with at least one of the plurality of tokens for the plurality of undesirable e-mails and identifying the first e-mail as an undesirable e-mail if the at least one token for the first e-mail matches any of the plurality of tokens for the plurality of undesirable e-mails.

摘要翻译： 公开了一种用于检测不期望的电子邮件的方法。 该方法包括收集多个不期望的电子邮件，将多个不期望的电子邮件排列成多个组，并为每个组生成至少一个令牌，从而为多个不期望的电子邮件产生多个令牌， 邮件 该方法还包括接收第一电子邮件并为第一电子邮件生成至少一个令牌。 该方法还包括：将用于第一电子邮件的至少一个令牌与用于多个不期望的电子邮件的多个令牌中的至少一个进行比较，并将第一电子邮件识别为不期望的电子邮件，如果 所述用于所述第一电子邮件的所述至少一个令牌与所述多个不期望的电子邮件的所述多个令牌中的任一个相匹配。

公开(公告)号：US20060149821A1

公开(公告)日：2006-07-06

申请号：US11029069

申请日：2005-01-04

申请人： Vadakkedathu Rajan ,  Mark Wegman ,  Richard Segal ,  Jason Crawford ,  Jeffrey Kephart ,  Shlomo Hershkop

发明人： Vadakkedathu Rajan ,  Mark Wegman ,  Richard Segal ,  Jason Crawford ,  Jeffrey Kephart ,  Shlomo Hershkop

IPC分类号： G06F15/16

CPC分类号： H04L51/12 ,  G06Q10/107

摘要： A method for detecting undesirable emails is disclosed. The method combines input from two or more spam classifiers to provide improved classification effectiveness and robustness. The method's effectiveness is improved over that of any one constituent classifier in the sense that the detection rate is increased and/or the false positive rate is decreased. The method's robustness is improved in the sense that, if spammers temporarily elude any one constituent classifier, the other constituent classifiers will still be likely to catch the spam. The method includes obtaining a score from each of a plurality of constituent spam classifiers by applying them to a given input email. The method further includes obtaining a combined spam score from a combined spam classifier that takes as input the plurality of constituent spam classifier scores, the combined spam classifier being computed automatically in accordance with a specified false-positive vs. false-negative tradeoff. The method further includes identifying the given input email as an undesirable email if the combined spam score indicates that the input e-mail is undesirable.

摘要翻译： 公开了一种用于检测不期望的电子邮件的方法。 该方法结合了两个或更多个垃圾邮件分类器的输入，以提供改进的分类有效性和鲁棒性。 在检测率提高和/或假阳性率降低的意义上，该方法的有效性比任何一个构成分类器的有效性得到改善。 该方法的鲁棒性得到改善，因为如果垃圾邮件发送者暂时排除任何一个构成分类器，则其他组成分类器仍然可能会捕获垃圾邮件。 该方法包括通过将其应用于给定的输入电子邮件来从多个组成垃圾邮件分类器中的每一个获得分数。 所述方法还包括从组合的垃圾邮件分类器获得组合的垃圾邮件分数，所述组合垃圾邮件分类器将所述多个组成垃圾邮件分类器分数作为输入，所述组合的垃圾邮件分类器根据指定的假阳性与假阴性权衡自动计算。 如果组合的垃圾邮件评分指示输入的电子邮件是不期望的，该方法还包括将给定的输入电子邮件识别为不期望的电子邮件。

公开(公告)号：US20050172291A1

公开(公告)日：2005-08-04

申请号：US10768563

申请日：2004-01-30

申请人： Rajarshi Das ,  Jeffrey Kephart ,  Gerald Tesauro ,  William Walsh

发明人： Rajarshi Das ,  Jeffrey Kephart ,  Gerald Tesauro ,  William Walsh

IPC分类号： G06F9/46 ,  G06F9/50

CPC分类号： G06F9/5027 ,  G06F9/5083

摘要： In one embodiment, the present invention is a method for allocation of finite computational resources amongst multiple entities, wherein the method is structured to optimize the business value of an enterprise providing computational services. One embodiment of the inventive method involves establishing, for each entity, a service level utility indicative of how much business value is obtained for a given level of computational system performance. The service-level utility for each entity is transformed into a corresponding resource-level utility indicative of how much business value may be obtained for a given set or amount of resources allocated to the entity. The resource-level utilities for each entity are aggregated, and new resource allocations are determined and executed based upon the resource-level utility information. The invention is thereby capable of making rapid allocation decisions, according to time-varying need or value of the resources by each of the entities.

摘要翻译： 在一个实施例中，本发明是一种用于在多个实体之间分配有限计算资源的方法，其中该方法被构造为优化提供计算服务的企业的商业价值。 本发明方法的一个实施例涉及为每个实体建立一个服务级别实用程序，其指示针对给定级别的计算系统性能获得多少商业价值。 每个实体的服务级别实用程序被转换成相应的资源级实用程序，指示可以为给定的集合或分配给该实体的资源量获得多少商业价值。 聚合每个实体的资源级实用程序，并根据资源级实用程序信息确定和执行新的资源分配。 因此，本发明能够根据每个实体的时间变化需要或资源价值进行快速分配决定。