公开(公告)号：US10142198B2

公开(公告)日：2018-11-27

申请号：US15144627

申请日：2016-05-02

Applicant: Autodesk, Inc.

Inventor： Jian Zhao ,  Michael Glueck ,  Azam Khan

IPC: G06F13/00 ,  H04L12/26 ,  H04L12/24

Abstract: A network analysis engine is configured to generate a network timeline that represents time-varying connectivity between nodes of the network over a time interval. The network timeline includes a sequence of network snapshots that illustrate links between nodes at specific, sequential sub-intervals of time. The network analysis engine is configured to organize the network timeline in order to reveal certain characteristics of the nodes in the network and the network as a whole. Based on these characteristics, the network can be optimized to improve overall network operation.

公开(公告)号：US20170257291A1

公开(公告)日：2017-09-07

申请号：US15144627

申请日：2016-05-02

Applicant: Autodesk, Inc.

Inventor： Jian Zhao ,  Michael Glueck ,  Azam Khan

IPC: H04L12/26

CPC classification number: H04L43/045 ,  H04L41/12 ,  H04L41/22 ,  H04L43/06

Abstract: A network analysis engine is configured to generate a network timeline that represents time-varying connectivity between nodes of the network over a time interval. The network timeline includes a sequence of network snapshots that illustrate links between nodes at specific, sequential sub-intervals of time. The network analysis engine is configured to organize the network timeline in order to reveal certain characteristics of the nodes in the network and the network as a whole. Based on these characteristics, the network can be optimized to improve overall network operation.

公开(公告)号：US11663235B2

公开(公告)日：2023-05-30

申请号：US15441219

申请日：2017-02-23

Applicant: AUTODESK, INC.

Inventor： Jian Zhao ,  Michael Glueck ,  Azam Khan ,  Simon Breslav

IPC: G06F16/26 ,  G06T11/20 ,  G06F40/169 ,  G06F16/35 ,  G06F40/106

CPC classification number: G06F16/26 ,  G06F16/358 ,  G06F40/106 ,  G06F40/169 ,  G06T11/206

Abstract: In various embodiments, a visualization engine generates graphs that facilitate sense making operations on data sets. A graph includes nodes that are associated with a data set and edges that represent relationships between the nodes. In operation, the visualization engine computes pairwise similarities between the nodes. Subsequently, the visualization engine computes a layout for the graph based on the pairwise similarities and user-specified constraints. Finally, the visualization engine renders a graph for display based on the layout, the nodes, and the edges. Advantageously, by interactively specifying constraints and then inspecting the topology of the automatically generated graph, the user may efficiently explore salient aspects of the data set.