COLLECTIVE NAVIGATION FOR VIRTUAL REALITY DEVICES

    公开(公告)号:US20180061125A1

    公开(公告)日:2018-03-01

    申请号:US15247801

    申请日:2016-08-25

    CPC classification number: G06T19/003 G06F3/011 G06T7/75

    Abstract: A computer-executed method is disclosed for collective navigation of distributed virtual reality (VR) devices. The method obtains a source vertex and a destination vertex for a VR device. The source vertex and the destination vertex include vertices of a graph model of a navigable space having a plurality of vertices. The vertices represent a point within the navigable space and the plurality of edges represent a path segment between two corresponding vertices. A subset of possible vertices, selected from the plurality of vertices, is determined for a navigable path. A vertex traffic potential is determined for each vertex of the subset of possible vertices. The navigable path, including one or more consecutive path segments selected to minimize both segment path lengths and vertex traffic potentials, is determined from the source vertex to the destination vertex.

    Scheduling graph computing on heterogeneous processing resources based on energy efficiency

    公开(公告)号:US10656970B2

    公开(公告)日:2020-05-19

    申请号:US15279315

    申请日:2016-09-28

    Abstract: An apparatus and method are provided for scheduling graph computing on heterogeneous platforms based on energy efficiency. A scheduling engine receives an edge set that represents a portion of a graph comprising vertices with at least one edge connecting two or more of the vertices. The scheduling engine obtains an operating characteristic for each processing resource of a plurality of heterogeneous processing resources. The scheduling engine computes, based on the operating characteristics and an energy parameter, a set of processing speed values for the edge set, each speed value corresponding to a combination of the edge set and a different processing resource of the plurality of heterogeneous processing resources. The scheduling engine identifies an optimal processing speed value from the set of computed speed values for the edge set.

    Collective navigation for virtual reality devices

    公开(公告)号:US10410416B2

    公开(公告)日:2019-09-10

    申请号:US15247801

    申请日:2016-08-25

    Abstract: A computer-executed method is disclosed for collective navigation of distributed virtual reality (VR) devices. The method obtains a source vertex and a destination vertex for a VR device. The source vertex and the destination vertex include vertices of a graph model of a navigable space having a plurality of vertices. The vertices represent a point within the navigable space and the plurality of edges represent a path segment between two corresponding vertices. A subset of possible vertices, selected from the plurality of vertices, is determined for a navigable path. A vertex traffic potential is determined for each vertex of the subset of possible vertices. The navigable path, including one or more consecutive path segments selected to minimize both segment path lengths and vertex traffic potentials, is determined from the source vertex to the destination vertex.

    Predictive table pre-joins in large scale data management system using graph community detection

    公开(公告)号:US10528563B2

    公开(公告)日:2020-01-07

    申请号:US15470813

    申请日:2017-03-27

    Abstract: A computer-implemented method for identifying pre-join operations, when accessing a database of relational tables, based on a usage history and/or a priority needs, comprises creating a graph of weighted edges and nodes, the nodes represent relational tables and edges represent join operations to be performed on the tables, partitioning the graph into a plurality of graph communities based on graph community densities, with a density indicating a number of edges touching a particular node, with the number of edges being greater than a predetermined edge number threshold, with each edge further including an edge weight indicative of a frequency of referencing within a predetermined recent duration of time and/or indicative of urgency of quick access to the corresponding join result within a predetermined recent duration of time, and generating pre-join results based on the partitioned graph communities and graph community densities.

    INTERACTIVE SYSTEM FOR VISUALIZING AND MAINTAINING LARGE NETWORKS

    公开(公告)号:US20200044939A1

    公开(公告)日:2020-02-06

    申请号:US16052216

    申请日:2018-08-01

    Inventor: Yinglong Xia

    Abstract: A network graph analysis tool identifies clusters of nodes in a network graph based on edges connecting the nodes. It then distributes the clusters of nodes in a two-dimensional plane to generate a two-dimensional representation of a network. For each cluster, the tool distributes the nodes in the cluster in the two-dimensional plane to calculate respective coordinates of the nodes in the cluster. The result is a two-dimensional mapped network graph of the cluster. The tool then generates a density map of the network based on the calculated coordinates of the nodes in the mapped network graph, and in response to a selection of a sub-area of the density map, provides, for display, selected nodes and edges in the mapped network graph having coordinates corresponding to the selected sub-area of the density map. The selected nodes and edges may be magnified in response to a software visualization lens.

    PREDICTIVE TABLE PRE-JOINS IN LARGE SCALE DATA MANAGEMENT SYSTEM USING GRAPH COMMUNITY DETECTION

    公开(公告)号:US20180173763A1

    公开(公告)日:2018-06-21

    申请号:US15470813

    申请日:2017-03-27

    Abstract: A computer-implemented method for identifying pre-join operations, when accessing a database of relational tables, based on a usage history and/or a priority needs, comprises creating a graph of weighted edges and nodes, the nodes represent relational tables and edges represent join operations to be performed on the tables, partitioning the graph into a plurality of graph communities based on graph community densities, with a density indicating a number of edges touching a particular node, with the number of edges being greater than a predetermined edge number threshold, with each edge further including an edge weight indicative of a frequency of referencing within a predetermined recent duration of time and/or indicative of urgency of quick access to the corresponding join result within a predetermined recent duration of time, and generating pre-join results based on the partitioned graph communities and graph community densities.

Patent Agency Ranking