会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • Determining Individual Performance Dynamics Using Federated Interaction Graph Analytics
    • 使用联合交互图分析确定个人绩效动态
    • US20170004434A1
    • 2017-01-05
    • US14755709
    • 2015-06-30
    • International Business Machines Corporation
    • Kuntal DeyAmit Anil NanavatiMangala Gowri Nanda
    • G06Q10/06G06F17/30
    • G06Q10/06398G06F16/2455
    • Methods, systems, and computer program products for determining performance dynamics are provided herein. A method includes generating a graph encompassing multiple dimensions representing types of interactions among multiple individuals within an organization, wherein each node of the graph corresponds to one of the multiple individuals, and each edge of the graph connects pairs of the nodes and corresponds to one of the dimensions; performing computations based on analysis of the graph to capture correlations of performance characteristics between the multiple individuals; calculating a performance rating of one of the multiple individuals based on (i) each correlation between the multiple individuals that include the given individual and (ii) a comparison of performance data of the given individual to performance data of each of the multiple individuals embodied in the correlations that include the given individual; and determining recommended work items for the given individual and/or the organization based on said calculating.
    • 本文提供了用于确定性能动态的方法,系统和计算机程序产品。 一种方法包括生成包含表示组织内的多个个体之间的交互类型的多个维度的图,其中图形的每个节点对应于多个个体中的一个,并且图形的每个边缘连接节点对,并对应于 尺寸; 基于图的分析执行计算,以捕获多个人之间的性能特征的相关性; 基于(i)包括给定个体的多个个体之间的每个相关性,以及(ii)将给定个体的绩效数据与所体现的多个个体中的每个个体的绩效数据进行比较,来计算多个个体之一的绩效评级 包括给定个体的相关性; 并根据所述计算确定给定个人和/或组织的推荐工作项目。
    • 2. 发明授权
    • Calculating workload closure in networks
    • 计算网络中的工作量闭包
    • US09300544B2
    • 2016-03-29
    • US14193454
    • 2014-02-28
    • International Business Machines Corporation
    • Seema NagarAmit Anil NanavatiRaghavendra Singh
    • H04L12/24
    • H04L41/142H04L41/12
    • Methods and arrangements for identifying and characterizing subgraphs of a network. In a network comprising a plurality of nodes and edges, there is identified a subgraph including a plurality of nodes. Communication workload closure of the subgraph is calculated via: identifying and counting all length-2 paths in the network that include at least one of the nodes of the subgraph, each length-2 path including three nodes and two edges interconnecting the three nodes; for each of the length-2 paths, determining whether all three nodes belong to the subgraph; thereupon identifying and counting a subset of the length-2 paths wherein, for each path in the subset, all three nodes of the path belong to the subgraph; and dividing the number of paths in the subset by the total number of length-2 paths that include at least one of the nodes of the subgraph. Other variants and embodiments are broadly contemplated herein.
    • 识别和表征网络子图的方法和安排。 在包括多个节点和边缘的网络中,识别包括多个节点的子图。 通过以下方式计算子图的通信工作量关闭:识别和计数网络中包含子图的至少一个节点的所有长度为2的路径,每个长度为2的路径包括连接三个节点的三个节点和两个边缘; 对于每个长度为2的路径,确定所有三个节点是否属于子图; 因此识别和计数长度2路径的子集,其中对于子集中的每个路径,路径的所有三个节点属于子图; 并且将子集中的路径数除以包括子图的至少一个节点的长度为2的路径的总数。 本文中广泛考虑了其他变型和实施例。