专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20150256450A1 Generating a Shape Graph for a Routing Table 审中-公开
标题翻译：为路由表生成形状图
公开(公告)号：US20150256450A1
公开(公告)日：2015-09-10
申请号：US14427866
申请日：2012-09-28
申请人： Siyu YANG , Zhiyong SHEN , Peng XIE , Yong TANG , Ping LUO , Junqing XIE , Linpeng TANG , Mihalis YANNAKAKIS , Robert E TARJAN , David LEE , Hewlett-Packard Development Company, L. P.
发明人： Siyu Yang , Zhi-Yong Shen , Peng Xie , Tang Yong , Ping Luo , Jun-Qing Xie , Linpeng Tang , Mihalis Yannakakis , Robert Tarjan , David Lee
IPC分类号： H04L12/753 , H04L12/24 , H04L12/44
CPC分类号： H04L45/48 , H04L12/44 , H04L41/0886 , H04L45/14 , H04L45/54
摘要： A system and method for generating shape graphs for a routing table are described herein. The method includes splitting a binary trie representing a routing table of a router into a number of layers, wherein each layer includes a number of nodes. The method also includes, for each layer, determining a number of groups of isomorphic nodes and merging the isomorphic nodes within each group to generate a shape graph.
摘要翻译：本文描述了用于生成路由表的形状图的系统和方法。该方法包括将表示路由器的路由表的二进制代码分割成多个层，其中每个层包括多个节点。该方法还包括对于每个层，确定多个同构节点的数量组并且合并每个组内的同构节点以生成形状图。

2. 发明申请

US20110295626A1 INFLUENCE ASSESSMENT IN SOCIAL NETWORKS 审中-公开
标题翻译：社会网络中的影响评估
公开(公告)号：US20110295626A1
公开(公告)日：2011-12-01
申请号：US12790075
申请日：2010-05-28
申请人： Wei Chen , Yajun Wang , Siyu Yang , Chi Wang
发明人： Wei Chen , Yajun Wang , Siyu Yang , Chi Wang
IPC分类号： G06N5/02 , G06Q99/00 , G06Q10/00
CPC分类号： G06Q30/02 , G06Q10/063
摘要： Social networks have become platforms to disseminate and market information and ideas. A social network, users, and interactions of users may be modeled by graphs, which may be analyzed to determine influential users. In one example, nodes within a graph may be concurrently grouped into node groupings. Influence values corresponding to node counts within node groupings may be assigned to nodes within node groupings. Influential nodes may be determined based upon the assigned influence values. In another example, degrees of nodes (e.g., an edge count of a node) may be used to determine influential nodes within the graph. Upon selecting a node, degrees of neighboring nodes of the selecting node may be discounted because the node was selected. In another example, trees corresponding to a current node and (e.g., maximum) influential paths from other nodes to the current node may be constructed and evaluated to determine a group of nodes.
摘要翻译：社交网络已成为传播和销售信息和思想的平台。用户的社交网络，用户和交互可以通过图形来建模，这可以被分析以确定有影响力的用户。在一个示例中，图中的节点可以被同时分组到节点分组中。对应于节点组内节点计数的影响值可以分配给节点组内的节点。可以基于所分配的影响值来确定影响节点。在另一示例中，可以使用节点的度数（例如，节点的边缘计数）来确定图中的有影响的节点。在选择节点之后，选择节点的相邻节点的度数可以被折扣，因为节点被选择。在另一示例中，可以构造并评估与当前节点相对应的树和（例如，最大）从其他节点到当前节点的影响路径以确定一组节点。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式