RUNTIME OF CUBLAS MATRIX MULTIPLICATION ON GPU
    2.
    发明申请
    RUNTIME OF CUBLAS MATRIX MULTIPLICATION ON GPU 有权
    GPU上的CUBLAS矩阵多项式运行

    公开(公告)号:US20170046307A1

    公开(公告)日:2017-02-16

    申请号:US14823889

    申请日:2015-08-11

    CPC classification number: G06F17/16 G06T1/20 G06T2200/28

    Abstract: Methods for improving matrix multiplication runtimes are provided. A method includes determining, by a GPU, optimal partitions for matrix-by-matrix multiplication of two factor matrices having sizes known a priori. The determining step includes performing offline a plurality of matrix-by-matrix multiplication executions, each for a respective different combination of two-way partitions across a plurality of partition sizes. The determining step further includes determining offline a respective performance number for each of the executions based on runtime. The determining step also includes recursively repeating offline said performing and determining steps until the respective performance number ceases to improve for best-performing combinations of the two-way partitions and saving the best performing combinations of the two-way partitions as the optimal partitions. The method further includes performing online, by the GPU, the matrix-by-matrix multiplication of the two factor matrices using calls for a given one of the best performing combinations of the two-way partitions.

    Abstract translation: 提供了改进矩阵乘法运行时的方法。 一种方法包括由GPU确定具有先验已知的尺寸的两个因子矩阵的逐矩阵乘法的最佳分区。 所述确定步骤包括执行多个矩阵逐矩阵乘法执行,所述多个逐行矩阵乘法执行各自针对跨多个分区大小的双向分区的相应不同组合。 所述确定步骤还包括基于运行时确定每个所述执行的脱机相应的性能编号。 确定步骤还包括递归地重复离线所述执行和确定步骤,直到相应的性能编号不再改进以用于双向分区的最佳执行组合并且将双向分区的最佳执行组合保存为最佳分区。 该方法还包括使用对双向分区的最佳执行组合中的给定的一个的调用,由GPU在线执行两个因子矩阵的逐矩阵乘法。

    INTERACTIVE ENERGY DEVICE FOR ENVIRONMENTAL STEWARDSHIP
    3.
    发明申请
    INTERACTIVE ENERGY DEVICE FOR ENVIRONMENTAL STEWARDSHIP 有权
    用于环境管理的交互式能源设备

    公开(公告)号:US20140277603A1

    公开(公告)日:2014-09-18

    申请号:US13971251

    申请日:2013-08-20

    CPC classification number: G05B15/02 G05B2219/2642

    Abstract: A method, system and apparatus for operating an energy-using device are disclosed. Current data related to operation of the energy-using device is received at a remote device. An operating specification for the energy-using device is received at the remote device from a database. A recommended setting of the energy-using device is determined from the current data and the operating specification. The remote device communicates the recommended setting to the energy-using device. A control unit at the energy-using device receives the recommended setting and implements the recommended setting at the energy-using device.

    Abstract translation: 公开了一种用于操作能量使用装置的方法,系统和装置。 在远程设备处接收与能量使用设备的操作有关的当前数据。 在远程设备处从数据库接收能量使用设备的操作规范。 根据当前数据和操作规范确定能量使用设备的推荐设置。 远程设备将推荐的设置传送给能量使用设备。 能源使用设备的控制单元接收推荐设置,并在能源使用设备上实现推荐设置。

    Fast path traversal in a relational database-based graph structure

    公开(公告)号:US11113313B2

    公开(公告)日:2021-09-07

    申请号:US16038498

    申请日:2018-07-18

    Abstract: A first plurality of relational tables is obtained from a relational database. Each table of the first plurality of relational tables stores connectivity information for a graph that comprises a plurality of nodes and a plurality of edges connecting the nodes, and each of the nodes is assigned an initial identifier. The nodes are clustered into a plurality of clusters. Each cluster contains a subset of the nodes, and all nodes in each subset are close to each other according to a metric. Each node is assigned a new identifier. The new identifier comprises a concatenation of an identifier associated with the cluster to which the node belongs and an identifier associated with the node. A second plurality of relational tables is constructed and stores connectivity information for the graph. The node is identified in the second plurality of relational tables by the new identifier.

    Fast path traversal in a relational database-based graph structure

    公开(公告)号:US10061841B2

    公开(公告)日:2018-08-28

    申请号:US14919183

    申请日:2015-10-21

    CPC classification number: G06F16/285 G06F16/2228 G06F16/2282

    Abstract: A first plurality of relational tables is obtained from a relational database. Each table of the first plurality of relational tables stores connectivity information for a graph that comprises a plurality of nodes and a plurality of edges connecting the nodes, and each of the nodes is assigned an initial identifier. The nodes are clustered into a plurality of clusters. Each cluster contains a subset of the nodes, and all nodes in each subset are close to each other according to a metric. Each node is assigned a new identifier. The new identifier comprises a concatenation of an identifier associated with the cluster to which the node belongs and an identifier associated with the node. A second plurality of relational tables is constructed and stores connectivity information for the graph. The node is identified in the second plurality of relational tables by the new identifier.

    Optimized asset maintenance and replacement schedule

    公开(公告)号:US09959514B2

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

    申请号:US14551522

    申请日:2014-11-24

    CPC classification number: G06Q10/06312 G01M99/008 G06Q10/20 Y02P90/86

    Abstract: There are provided a system, a method and a computer program product for generating an optimal preventive maintenance/replacement schedule for a set of assets. The method includes receiving data regarding an asset, said data including a failure rate function of said asset, a cost of preventative maintenance (PM) of said asset, a cost of an asset failure, and a cost of replacing an asset. An optimal number K of preventative maintenance time intervals tk and an indication of a possible replacement is computed and stored for each asset by minimizing a mean cost-rate value function with respect to an electrical age of the asset. A first PM schedule is formed without consideration of labor and budget resource constraints. The method further generates a second maintenance schedule for a system of assets by minimizing a deviation from the optimal PM time intervals subject to the labor and budget resource constraints.

    NETWORK OF TENSOR TIME SERIES
    9.
    发明申请

    公开(公告)号:US20220284277A1

    公开(公告)日:2022-09-08

    申请号:US17184880

    申请日:2021-02-25

    Abstract: One or more machine learning models for a network of tensor time series can be provided. Co-evolving time series having multiple modes can be received. A tensor graph convolutional network can be trained, using the co-evolving time series and adjacency matrices associated with the multiple modes in the co-evolving time series, to generate node embeddings associated with a snapshot of the co-evolving time series at time t. A tensor recurrent neural network can be trained to generate temporal dynamics associated with the co-evolving time series based on the generated node embeddings. A neural network model can be trained to forecast a prediction for the co-evolving time series based on the generated node embeddings and the generated temporal dynamics. The tensor graph convolutional network, the tensor recurrent neural network and the neural network model can be trained jointly.

Patent Agency Ranking