OPTIMIZED ASSET MAINTENANCE AND REPLACEMENT SCHEDULE
    31.
    发明申请
    OPTIMIZED ASSET MAINTENANCE AND REPLACEMENT SCHEDULE 有权
    优化资产维护和更换时间表

    公开(公告)号:US20160148137A1

    公开(公告)日:2016-05-26

    申请号:US14796704

    申请日:2015-07-10

    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.

    Abstract translation: 提供了用于为一组资产生成最佳预防性维护/更换时间表的系统,方法和计算机程序产品。 该方法包括接收关于资产的数据,所述数据包括所述资产的故障率功能,所述资产的预防性维护成本(PM),资产失败的成本以及替换资产的成本。 通过最小化相对于资产的电气年龄的平均成本率值函数来计算并存储每个资产的预防性维护时间间隔t k的最佳数量K和可能的替换的指示。 在不考虑劳动力和预算资源限制的情况下,组建了第一个PM计划。 该方法通过最小化与受劳动力和预算资源限制的最佳PM时间间隔的偏差来进一步产生资产系统的第二维护计划。

    PARALLEL TECHNIQUE FOR COMPUTING PROBLEM FUNCTIONS IN SOLVING OPTIMAL POWER FLOW
    33.
    发明申请
    PARALLEL TECHNIQUE FOR COMPUTING PROBLEM FUNCTIONS IN SOLVING OPTIMAL POWER FLOW 有权
    用于计算问题功能的并行技术解决最佳功率流

    公开(公告)号:US20150177762A1

    公开(公告)日:2015-06-25

    申请号:US14134351

    申请日:2013-12-19

    CPC classification number: G05F1/66 G05B2219/35215 G06F7/60 G06Q50/06

    Abstract: An exemplary method includes solving on a computing system an optimal power flow formulation for a plurality of generators in a power system. The solving includes computing using multi-threaded parallelism a plurality of constraints for the formulation, computing using multi-threaded parallelism a plurality of Jacobian functions of the constraints,and computing using multi-threaded parallelism a Hessian of Lagrangian functions. The method further includes outputting results of the solving, wherein the results comprise values of generation levels for the plurality of generators. Apparatus and program products are also disclosed.

    Abstract translation: 一种示例性方法包括在计算系统上求解用于电力系统中的多个发电机的最优功率流公式。 解决方案包括使用多线程并行化来计算多个约束,用于制定,使用多线程并行化计算约束的多个雅可比函数,以及使用多线程并行度计算拉格朗日函数的Hessian。 该方法还包括输出求解的结果,其中结果包括多个发生器的产生电平的值。 还公开了装置和程序产品。

    Abstract Meaning Representation Parsing with Graph Translation

    公开(公告)号:US20220171923A1

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

    申请号:US17109008

    申请日:2020-12-01

    Abstract: A computer-implemented method for generating an abstract meaning representation (“AMR”) of a sentence, comprising receiving, by a computing device, an input sentence and parsing the input sentence into one or more syntactic and/or semantic graphs. An input graph including a node set and an edge set is formed from the one or more syntactic and/or semantic graphs. Node representations are generated by natural language processing. The input graph is provided to a first neural network to provide an output graph having learned node representations aligned with the node representations in the input graph. The method further includes predicting via a second neural network, node label and predicting, via a third neural network, edge labels in the output graph. The AMR is generated based on the predicted node labels and predicted edge labels. A system and a non-transitory computer readable storage medium are also disclosed.

Patent Agency Ranking