知搜-全球专利检索

  1. 登录
  2. 注册

搜索结果

17 条记录 (耗时 0.014 秒)

    Network analysis with Steiner trees
    1.
    发明授权
    Network analysis with Steiner trees 有权
    Steiner树的网络分析

    公开(公告)号：US07885269B2

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

    申请号：US12147536

    申请日：2008-06-27

    申请人： Mohsen Bayati ,  Christian H. Borgs ,  Alfredo Braunstein ,  Jennifer T. Chayes ,  Riccardo Zecchina

    发明人： Mohsen Bayati ,  Christian H. Borgs ,  Alfredo Braunstein ,  Jennifer T. Chayes ,  Riccardo Zecchina

    IPC分类号： H04L12/28

    CPC分类号： G06F17/509 ,  G06F2217/10 ,  H04L41/12 ,  H04L45/14

    摘要： Networks may be analyzed using Steiner trees. In an example embodiment, a method includes acts of receiving, accepting, creating, and analyzing. Data specifying a network is received. Steiner tree parameters are accepted. A Steiner tree model is created on the data specifying the network responsive to the Steiner tree parameters. The Steiner tree model includes a local representation having a depth constraint for neighborhood vertices. The data specifying the network is analyzed to ascertain a Steiner tree solution based on the Steiner tree model, which includes the local representation, and using a locally-oriented combinatorial algorithm.

    摘要翻译： 可以使用Steiner树分析网络。 在示例实施例中，一种方法包括接收，接受，创建和分析的动作。 接收到指定网络的数据。 Steiner树参数被接受。 在指定网络的数据上创建Steiner树模型，响应于Steiner树参数。 Steiner树模型包括具有邻近顶点深度约束的局部表示。 分析指定网络的数据，以确定基于包括本地表示的Steiner树模型以及使用面向局部组合算法的Steiner树解决方案。

    Methods and systems of testing software, and methods and systems of modeling user behavior
    2.
    发明授权
    Methods and systems of testing software, and methods and systems of modeling user behavior 有权
    测试软件的方法和系统，以及用户行为建模的方法和系统

    公开(公告)号：US07464372B2

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

    申请号：US11188606

    申请日：2005-07-25

    申请人： Dimitris Achlioptas ,  Christian H. Borgs ,  Jennifer T. Chayes ,  Henry J. Robinson ,  James R. Tierney

    发明人： Dimitris Achlioptas ,  Christian H. Borgs ,  Jennifer T. Chayes ,  Henry J. Robinson ,  James R. Tierney

    IPC分类号： G06F9/44

    CPC分类号： G06F11/3688

    摘要： Methods and systems of testing software and modeling user actions are described. In some embodiments, multiple different algorithms are provided for operating on a software model. The software model describes behavior associated with software that is to be tested. Different sets of algorithms can be selected for operating on the software model to produce a sequence of test actions that are to be used to test the software. The algorithms can be mixed and matched to achieve a desired testing result. In some embodiments, the different algorithms comprise deterministic algorithms, random algorithms, and various types of algorithms therebetween. In one embodiment, the software model comprises a state graph having nodes that represent state, and links between the nodes that represent actions. The different algorithms that are available for selection can have different graph traversal characteristics such that the state graph can be traversed in different manners. For example, algorithms that are more local in their traversals can be teamed with algorithms that are more global in their traversals, thus covering a wider area of the state space with good local coverage in some areas.

    摘要翻译： 描述测试软件和建模用户动作的方法和系统。 在一些实施例中，提供了用于在软件模型上操作的多种不同的算法。 软件模型描述与要测试的软件相关的行为。 可以选择不同的算法集来在软件模型上操作以产生用于测试软件的测试动作序列。 可以混合和匹配算法以实现所需的测试结果。 在一些实施例中，不同的算法包括确定性算法，随机算法以及它们之间的各种类型的算法。 在一个实施例中，软件模型包括具有表示状态的节点和表示动作的节点之间的链接的状态图。 可用于选择的不同算法可以具有不同的图遍历特性，使得可以以不同的方式遍历状态图。 例如，在遍历中更本地化的算法可以与在遍历中更全局化的算法相结合，从而在某些区域覆盖了更广泛的状态空间区域，具有良好的本地覆盖。

    Systems and methods that facilitate maximizing revenue for multi-unit auctions with private budgets
    3.
    发明授权
    Systems and methods that facilitate maximizing revenue for multi-unit auctions with private budgets 失效
    促进利用私人预算最大化多单位拍卖收入的系统和方法

    公开(公告)号：US07636678B2

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

    申请号：US11107523

    申请日：2005-04-15

    申请人： Amin Saberi ,  Christian H. Borgs ,  Jennifer T. Chayes ,  Mohammad Mahdian ,  Nicole S. Immorlica

    发明人： Amin Saberi ,  Christian H. Borgs ,  Jennifer T. Chayes ,  Mohammad Mahdian ,  Nicole S. Immorlica

    IPC分类号： G06Q40/00

    CPC分类号： G06Q30/08 ,  G06Q40/00 ,  G06Q40/04

    摘要： The subject invention relates to systems and methods that provide a truthful incentive-compatible mechanism for budget-constrained bidders in order to facilitate asymptotically maximizing revenue with multi-unit auctions in which individual bidders have private valuation per item (e.g., bids, offer prices, utility . . . ) and overall budgets. The systems and/or methods obtain bidder private bids and budget constraint, and separate this information into groups of bids and budgets. Each group is randomly reordered and utilized to determine a profit maximizing price as a function of the bids and budgets within that group. The groups of bids and budgets and the profit maximizing prices are utilized to allocate the auctioned items to respective bidders such that the allocation is based at least in part on the bids, budgets and prices. The systems and methods can be utilized to improve online auctioning.

    摘要翻译： 本发明涉及为预算约束的投标者提供真实的激励兼容机制的系统和方法，以便通过多单位拍卖促进渐近最大化收入，其中个体投标者对每个物品进行私人估价（例如，出价，报价， 实用程序...）和总体预算。 系统和/或方法获得投标者私人出价和预算约束，并将这些信息分为出价和预算组。 每个组都随机重新排序并用于确定利润最大化价格与该组内的出价和预算的函数。 投标和预算的组合以及利润最大化的价格被用于将拍卖的物品分配给各自的投标人，使得分配至少部分地基于投标，预算和价格。 系统和方法可用于改进在线拍卖。

    Methods and systems of testing software, and methods and systems of modeling user behavior
    5.
    发明授权
    Methods and systems of testing software, and methods and systems of modeling user behavior 失效

    公开(公告)号：US06996805B2

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

    申请号：US09896374

    申请日：2001-06-28

    申请人： Dimitris Achlioptas ,  Christian H. Borgs ,  Jennifer T. Chayes ,  Henry J. Robinson ,  James R. Tierney

    发明人： Dimitris Achlioptas ,  Christian H. Borgs ,  Jennifer T. Chayes ,  Henry J. Robinson ,  James R. Tierney

    IPC分类号： G06F9/44

    CPC分类号： G06F11/3688

    摘要： Methods and systems of testing software and modeling user actions are described. In some embodiments, multiple different algorithms are provided for operating on a software model. The software model describes behavior associated with software that is to be tested. Different sets of algorithms can be selected for operating on the software model to produce a sequence of test actions that are to be used to test the software. The algorithms can be mixed and matched to achieve a desired testing result. In some embodiments, the different algorithms comprise deterministic algorithms, random algorithms, and various types of algorithms therebetween. In one embodiment, the software model comprises a state graph having nodes that represent state, and links between the nodes that represent actions. The different algorithms that are available for selection can have different graph traversal characteristics such that the state graph can be traversed in different manners. For example, algorithms that are more local in their traversals can be teamed with algorithms that are more global in their traversals, thus covering a wider area of the state space with good local coverage in some areas.

    RECOMMENDATION RANKING SYSTEM WITH DISTRUST
    6.
    发明申请
    RECOMMENDATION RANKING SYSTEM WITH DISTRUST 有权
    推荐排序系统

    公开(公告)号：US20110252121A1

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

    申请号：US12755791

    申请日：2010-04-07

    申请人： Christian H. Borgs ,  Jennifer T. Chayes ,  Adam T. Kalai ,  Azarakhsh Malekian ,  Moshe Tennenholtz

    发明人： Christian H. Borgs ,  Jennifer T. Chayes ,  Adam T. Kalai ,  Azarakhsh Malekian ,  Moshe Tennenholtz

    IPC分类号： G06F15/173 ,  G06F17/11

    CPC分类号： G06Q30/02 ,  G06F17/30867 ,  G06F21/6245 ,  G06Q10/10 ,  G06Q30/00

    摘要： A recommendation ranking system that computes trust for entities based on negative expressions of trust. Negative expressions of trust are used to reduce the trust of entities. However, the system may discount entities that in the aggregate are distrusted. The system may be used with a social network to provide accurate, personalized recommendations for members of the social network. The network may be modeled as a voting network, with each member of the social network represented as a node and expressions of trust between members represented as weights on edges between nodes. Values of trust may be computed for nodes in the network and used to generate a recommendation. Opinions expressed on a topic may be weighted by trust in the node expressing the opinion. The system may be applied in other settings that can be modeled as a voting network, including ranking of Internet search results.

    摘要翻译： 一种基于信任负面表达式计算实体信任度的推荐排名系统。 信任的负面表达被用来减少实体的信任。 然而，该系统可能折扣总体上被不信任的实体。 该系统可以与社交网络一起使用，以为社交网络的成员提供准确的个性化建议。 网络可以被建模为投票网络，社交网络的每个成员表示为节点，并且表示为在节点之间的边缘上的权重的成员之间的信任表达。 可以为网络中的节点计算信任值，并用于生成推荐。 对主题表达的意见可能会通过表达意见的节点的信任来加权。 该系统可以应用于可被建模为投票网络的其他设置中，包括因特网搜索结果的排名。

    Recommendation ranking system with distrust
    7.
    发明授权
    Recommendation ranking system with distrust 有权
    推荐排名系统不信任

    公开(公告)号：US09152969B2

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

    申请号：US12755791

    申请日：2010-04-07

    申请人： Christian H. Borgs ,  Jennifer T. Chayes ,  Adam T. Kalai ,  Azarakhsh Malekian ,  Moshe Tennenholtz

    发明人： Christian H. Borgs ,  Jennifer T. Chayes ,  Adam T. Kalai ,  Azarakhsh Malekian ,  Moshe Tennenholtz

    IPC分类号： G06F15/173 ,  H04W24/00 ,  G06F7/04 ,  G06Q30/02 ,  G06F17/30 ,  G06Q10/10 ,  G06Q30/00 ,  G06F21/62

    CPC分类号： G06Q30/02 ,  G06F17/30867 ,  G06F21/6245 ,  G06Q10/10 ,  G06Q30/00

    摘要： A recommendation ranking system that computes trust for entities based on negative expressions of trust. Negative expressions of trust are used to reduce the trust of entities. However, the system may discount entities that in the aggregate are distrusted. The system may be used with a social network to provide accurate, personalized recommendations for members of the social network. The network may be modeled as a voting network, with each member of the social network represented as a node and expressions of trust between members represented as weights on edges between nodes. Values of trust may be computed for nodes in the network and used to generate a recommendation. Opinions expressed on a topic may be weighted by trust in the node expressing the opinion. The system may be applied in other settings that can be modeled as a voting network, including ranking of Internet search results.

    摘要翻译： 一种基于信任负面表达式计算实体信任度的推荐排名系统。 信任的负面表达被用来减少实体的信任。 然而，该系统可能折扣总体上被不信任的实体。 该系统可以与社交网络一起使用，以为社交网络的成员提供准确的个性化建议。 网络可以被建模为投票网络，社交网络的每个成员表示为节点，并且表示为在节点之间的边缘上的权重的成员之间的信任表达。 可以为网络中的节点计算信任值，并用于生成推荐。 对主题表达的意见可能会通过表达意见的节点的信任来加权。 该系统可以应用于可被建模为投票网络的其他设置中，包括因特网搜索结果的排名。

    Detecting overlapping clusters
    9.
    发明授权
    Detecting overlapping clusters 有权
    检测重叠集群

    公开(公告)号：US08949237B2

    公开(公告)日：2015-02-03

    申请号：US13345593

    申请日：2012-01-06

    申请人： Maria Florina Balcan ,  Christian H. Borgs ,  Mark Braverman ,  Jennifer T. Chayes ,  Shanghua Teng

    发明人： Maria Florina Balcan ,  Christian H. Borgs ,  Mark Braverman ,  Jennifer T. Chayes ,  Shanghua Teng

    IPC分类号： G06F7/00 ,  G06F17/30

    CPC分类号： G06F17/30867 ,  G06Q10/10 ,  G06Q50/01

    摘要： A technique for identifying overlapping clusters of items in a data set. The technique may be used in connection with a social network or other on-line environment in which users express approval for other users, such as through votes, tags or other inputs. These expressions of approval may be used to form clusters such that entities assigned to a cluster have a higher metric of approval from other entities within the cluster than from outside the cluster. Such clusters may be arrived at through a computationally efficient approach that involves randomly selecting one or more entities as a seed for a cluster. The cluster may be grown by testing other entities, similar to those already in the cluster, to determine whether they are more preferred by those already in the cluster than those outside the cluster. Once a cluster is grown to a desired size, it may be pruned.

    摘要翻译： 一种用于识别数据集中项目重叠聚类的技术。 该技术可以与社交网络或其他在线环境一起使用，其中用户通过投票，标签或其他输入来表达对其他用户的批准。 这些批准表达式可用于形成集群，使得分配给集群的实体具有比群集内外的其他实体更高的批准度量。 可以通过涉及随机选择一个或多个实体作为集群的种子的计算有效的方法来获得这样的集群。 可以通过测试类似于集群中的那些其他实体来生成集群，以确定它们是否比集群以外的集群更为优先。 一旦群集生长到所需的大小，它可能被修剪。