利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

20 条记录 (耗时 0.031 秒)

    Dominant edge identification for efficient partition and distribution
    4.
    发明授权
    Dominant edge identification for efficient partition and distribution 失效
    优势边缘识别有效的分配和分配

    公开(公告)号：US06817016B1

    公开(公告)日：2004-11-09

    申请号：US09676424

    申请日：2000-09-29

    申请人： Mark N. Wegman ,  Vadakkedathu T. Rajan ,  Tova Roth ,  Douglas N. Kimelman ,  Karin Hogstedt

    发明人： Mark N. Wegman ,  Vadakkedathu T. Rajan ,  Tova Roth ,  Douglas N. Kimelman ,  Karin Hogstedt

    IPC分类号： G06F15163

    CPC分类号： H04L29/06 ,  H04L67/10 ,  H04L69/329

    摘要： A task management system, method and computer program product for determining optimal placement of task components on multiple machines for task execution, particularly for placing program components on multiple computers for distributed processing. First, a communication graph is generated representative of the computer program with each program unit (e.g., an object) represented as a node in the graph. Nodes are connected to other nodes by edges representative of communication between connected nodes. A weight is applied to each edge, the weight being a measure of the level of communication between the connected edges. Terminal nodes representative of the multiple computers are attached to the communication graph. Then, dominant edges are identified within the communication graph. For any non-terminal node, a connected edge is dominant if it is at least as heavy (its weight is greater than or equal to) as the sum of the remaining non-terminal edges and the heaviest of the remaining terminal edges. The min cut for the communication graph need not include any dominant edges and so, dominant edges are removed from consideration for the final min cut solution. Finally, program components which may be a single program unit or an aggregate of units are placed on computers according to the communication graph min cut solution.

    摘要翻译： 一种任务管理系统，方法和计算机程序产品，用于确定多个机器上的任务组件的最佳布置，用于任务执行，特别是用于将程序组件放置在多个计算机上用于分布式处理。 首先，生成表示计算机程序的通信图，其中每个程序单元（例如，对象）表示为图中的节点。 节点通过表示连接节点之间的通信的边缘连接到其他节点。 对每个边缘施加重量，该重量是连接边缘之间的连通水平的度量。 代表多台计算机的终端节点附加到通信图。 然后，在通信图中识别出优势边。 对于任何非终端节点，如果连续边缘至少与剩余的非终端边缘和最重的其余终端边缘的总和一样重（其重量大于或等于），则连接边是主要的。 通信图的最小切割不需要包括任何主要边缘，因此，最终最小切割解决方案的主要边缘被删除。 最后，根据通信图最小切割解决方案，将可能是单个程序单元或单元集合的程序组件放置在计算机上。

    Minimizing interaction costs among components of computer programs
    5.
    发明授权
    Minimizing interaction costs among components of computer programs 有权
    最小化计算机程序组件之间的交互成本

    公开(公告)号：US08108841B2

    公开(公告)日：2012-01-31

    申请号：US12037080

    申请日：2008-02-25

    申请人： Douglas Neil Kimelman ,  Vadakkedathu T. Rajan ,  Tova Roth ,  Vugranam C. Sreedhar ,  Mark N. Wegman

    发明人： Douglas Neil Kimelman ,  Vadakkedathu T. Rajan ,  Tova Roth ,  Vugranam C. Sreedhar ,  Mark N. Wegman

    IPC分类号： G06F9/44

    CPC分类号： G06F11/3409 ,  G06F11/3447 ,  G06F11/3466 ,  G06F2201/865

    摘要： A method for minimizing total cost of interaction among components of a computer program, each of the components being characterized by at least one implementation property includes steps of: a) carrying out at least a partial run of the program; b) monitoring the at least partial run of the program to measure an amount of interaction between each pair of components; c) determining a cost of interaction between each pair of interacting components; d) determining a choice of implementation properties which minimizes total cost of the at least partial run; and e) assigning that choice of implementation properties to the components for a subsequent at least partial run of the program.

    摘要翻译： 一种用于使计算机程序的组件之间的交互的总成本最小化的方法，每个组件的特征在于至少一个实现属性包括以下步骤：a）执行程序的至少部分运行; b）监视程序的至少部分运行以测量每对组件之间的相互作用量; c）确定每对相互作用的部件之间的交互成本; d）确定最小化至少部分跑步的总成本的实施属性的选择; 以及e）将所述实现属性的选择分配给所述组件以用于所述程序的后续至少部分运行。

    MINIMIZING INTERACTION COSTS AMONG COMPONENTS OF COMPUTER PROGRAMS
    6.
    发明申请
    MINIMIZING INTERACTION COSTS AMONG COMPONENTS OF COMPUTER PROGRAMS 有权
    最小化计算机程序组件的交互成本

    公开(公告)号：US20080163163A1

    公开(公告)日：2008-07-03

    申请号：US12037080

    申请日：2008-02-25

    申请人： Douglas N. Kimelman ,  Vadakkedathu T. Rajan ,  Tova Roth ,  Vugranam C. Sreedhar ,  Mark N. Wegman

    发明人： Douglas N. Kimelman ,  Vadakkedathu T. Rajan ,  Tova Roth ,  Vugranam C. Sreedhar ,  Mark N. Wegman

    IPC分类号： G06F9/44

    CPC分类号： G06F11/3409 ,  G06F11/3447 ,  G06F11/3466 ,  G06F2201/865

    摘要： A method for minimizing total cost of interaction among components of a computer program, each of the components being characterized by at least one implementation property includes steps of: a) carrying out at least a partial run of the program; b) monitoring the at least partial run of the program to measure an amount of interaction between each pair of components; c) determining a cost of interaction between each pair of interacting components; d) determining a choice of implementation properties which minimizes total cost of the at least partial run; and e) assigning that choice of implementation properties to the components for a subsequent at least partial run of the program.

    摘要翻译： 一种用于使计算机程序的组件之间的交互的总成本最小化的方法，每个组件的特征在于至少一个实现属性包括以下步骤：a）执行程序的至少部分运行; b）监视程序的至少部分运行以测量每对组件之间的相互作用量; c）确定每对相互作用的部件之间的交互成本; d）确定最小化至少部分跑步的总成本的实现属性的选择; 以及e）将所述实现属性的选择分配给所述组件以用于所述程序的后续至少部分运行。

    SYSTEM AND METHOD FOR DETECTING LEADERSHIP
    7.
    发明申请
    SYSTEM AND METHOD FOR DETECTING LEADERSHIP 审中-公开
    用于检测领导的系统和方法

    公开(公告)号：US20120244500A1

    公开(公告)日：2012-09-27

    申请号：US13070116

    申请日：2011-03-23

    申请人： Maria-Cristina V. Marinescu ,  Vadakkedathu T. Rajan ,  Mark N. Wegman

    发明人： Maria-Cristina V. Marinescu ,  Vadakkedathu T. Rajan ,  Mark N. Wegman

    IPC分类号： G09B19/18

    CPC分类号： G06Q10/06398

    摘要： A system, method and computer program product for detecting leadership in a socio-technical environment based on the chronologic distribution of artifacts. The system and method captures and makes use of chronologic information as a predictor of causality in the dissemination of artifacts. A measure of leadership is based in part on the amount of relevant artifacts generated as a result, and temporal causality is used to detect this. The system method and computer program product further determines the patterns of behavior that govern a socio-technical context. By defining a set of patterns and comparing them with the interactions observed within a socio-technical network issues are discoverable.

    摘要翻译： 一种系统，方法和计算机程序产品，用于根据文物的时间分布来检测社会技术环境中的领导。 系统和方法捕获并利用时间序列信息作为文物传播中因果关系的预测因子。 领导力的度量部分取决于生成的相关工件的数量，并且使用时间因果关系来检测这一点。 系统方法和计算机程序产品进一步确定了管理社会技术背景的行为模式。 通过定义一组模式并将其与社会技术网络中观察到的交互进行比较，可以发现问题。

    Detecting spam email using multiple spam classifiers
    8.
    发明授权
    Detecting spam email using multiple spam classifiers 失效
    使用多个垃圾邮件分类器检测垃圾邮件

    公开(公告)号：US07882192B2

    公开(公告)日：2011-02-01

    申请号：US12541843

    申请日：2009-08-14

    申请人： Vadakkedathu T. Rajan ,  Mark N. Wegman ,  Richard B. Segal ,  Jason L. Crawford ,  Jeffrey O. Kephart ,  Shlomo Hershkop

    发明人： Vadakkedathu T. Rajan ,  Mark N. Wegman ,  Richard B. Segal ,  Jason L. Crawford ,  Jeffrey O. Kephart ,  Shlomo Hershkop

    IPC分类号： G06F15/16

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

    摘要： A method for detecting undesirable emails combines input from two or more spam classifiers to provide improved classification effectiveness and robustness. 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.

    摘要翻译： 用于检测不期望的电子邮件的方法组合来自两个或更多个垃圾邮件分类器的输入，以提供改进的分类有效性和鲁棒性。 该方法包括通过将其应用于给定的输入电子邮件来从多个组成垃圾邮件分类器中的每一个获得分数。 所述方法还包括从组合的垃圾邮件分类器获得组合的垃圾邮件分数，所述组合垃圾邮件分类器将所述多个组成垃圾邮件分类器分数作为输入，所述组合垃圾邮件分类器根据指定的假阳性与假阴性权衡自动计算。 如果组合的垃圾邮件评分指示输入的电子邮件是不期望的，该方法还包括将给定的输入电子邮件识别为不期望的电子邮件。

    DETECTING SPAM EMAIL USING MULTIPLE SPAM CLASSIFIERS
    10.
    发明申请
    DETECTING SPAM EMAIL USING MULTIPLE SPAM CLASSIFIERS 失效
    使用多个垃圾邮件分类器检测垃圾邮件

    公开(公告)号：US20090307771A1

    公开(公告)日：2009-12-10

    申请号：US12541843

    申请日：2009-08-14

    申请人： Vadakkedathu T. Rajan ,  Mark N. Wegman ,  Richard B. Segal ,  Jason L. Crawford ,  Jeffrey O. Kephart ,  Shlomo Hershkop

    发明人： Vadakkedathu T. Rajan ,  Mark N. Wegman ,  Richard B. Segal ,  Jason L. Crawford ,  Jeffrey O. Kephart ,  Shlomo Hershkop

    IPC分类号： G06F15/16 ,  G06F21/00

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

    摘要： A method for detecting undesirable emails combines input from two or more spam classifiers to provide improved classification effectiveness and robustness. 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.

    摘要翻译： 用于检测不期望的电子邮件的方法组合来自两个或更多个垃圾邮件分类器的输入，以提供改进的分类有效性和鲁棒性。 该方法包括通过将其应用于给定的输入电子邮件来从多个组成垃圾邮件分类器中的每一个获得分数。 所述方法还包括从组合的垃圾邮件分类器获得组合的垃圾邮件分数，所述组合垃圾邮件分类器将所述多个组成垃圾邮件分类器分数作为输入，所述组合垃圾邮件分类器根据指定的假阳性与假阴性权衡自动计算。 如果组合的垃圾邮件评分指示输入的电子邮件是不期望的，该方法还包括将给定的输入电子邮件识别为不期望的电子邮件。