FAST PATH TRAVERSAL IN A RELATIONAL DATABASE-BASED GRAPH STRUCTURE

    公开(公告)号:US20180365311A1

    公开(公告)日:2018-12-20

    申请号: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.

    PERFORMING AUTOMATIC MAP REDUCE JOB OPTIMIZATION USING A RESOURCE SUPPLY-DEMAND BASED APPROACH

    公开(公告)号:US20170315848A1

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

    申请号:US15140830

    申请日:2016-04-28

    CPC classification number: G06F9/5055 G06F9/5066

    Abstract: Determining optimum values for Map Reduce parameters by identifying parameters that affect performance of a Map Reduce job, determining a relationship between each of the identified parameters and a maximization of resource utilization for a plurality of computing resources configured for executing the Map Reduce job, representing a workflow based upon supply-demand relationships among the plurality of computing resources, modeling an execution cost as a function of the plurality of identified parameters, formulating a non-linear programming problem to minimize the execution cost, reformulating the non-linear programming problem as a linear programming problem, and solving the linear programming problem to determine a combination of parameter values for the plurality of identified parameters that minimizes the execution cost for the Map Reduce job.

    FAST PATH TRAVERSAL IN A RELATIONAL DATABASE-BASED GRAPH STRUCTURE

    公开(公告)号:US20170116315A1

    公开(公告)日:2017-04-27

    申请号:US14919183

    申请日:2015-10-21

    CPC classification number: G06F17/30598 G06F17/30321 G06F17/30339

    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.

    Parallel Technique For Computing Problem Functions In Solving Optimal Power Flow
    45.
    发明申请
    Parallel Technique For Computing Problem Functions In Solving Optimal Power Flow 审中-公开
    用于计算问题函数的并行技术解决最优潮流

    公开(公告)号:US20170003702A1

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

    申请号:US15269057

    申请日:2016-09-19

    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。 该方法还包括输出求解的结果,其中结果包括多个发生器的产生电平的值。 还公开了装置和程序产品。

    SYSTEM AND METHOD TO REDUCE HUMAN ACTIVITY DAMAGE-INDUCED POWER OUTAGE
    46.
    发明申请
    SYSTEM AND METHOD TO REDUCE HUMAN ACTIVITY DAMAGE-INDUCED POWER OUTAGE 审中-公开
    减少人体活动损伤诱发电源的系统和方法

    公开(公告)号:US20150369878A1

    公开(公告)日:2015-12-24

    申请号:US14730234

    申请日:2015-06-04

    Abstract: A method for predicting and managing an occurrence of a power outage resulting from human activity, the method comprising the steps of: obtaining at least one short-term notification of a planned human activity event; generating a corrected human activity notification as a function of the short-term notification and data corresponding to power grid information, geographical information relating to the power grid and customers utilizing the power grid, power grid customer information, and/or historical information corresponding to prior power outages resulting from human activity events; generating an outage probability as a function of the corrected human activity notification and trained predictive modeling data; generating an optimization model as a function of the outage probability; and initiating at least one action for mitigating the occurrence of the power outage resulting from human activity as a function of the optimization model.

    Abstract translation: 一种用于预测和管理由人类活动引起的停电的发生的方法,所述方法包括以下步骤:获得至少一个计划的人类活动事件的短期通知; 生成作为短期通知和对应于电网信息的数据的校正人体活动通知,与电网相关的地理信息和利用电网的客户,电网客户信息和/或与先前相对应的历史信息 人为活动造成的停电; 产生作为校正的人类活动通知和经过训练的预测建模数据的函数的中断概率; 生成优化模型作为中断概率的函数; 以及发起至少一个动作,以减轻作为优化模型的函数的人类活动导致的停电的发生。

    Systems and methods for single cell product path delay analysis
    47.
    发明授权
    Systems and methods for single cell product path delay analysis 有权
    单细胞产品路径延迟分析的系统和方法

    公开(公告)号:US09104834B2

    公开(公告)日:2015-08-11

    申请号:US14514919

    申请日:2014-10-15

    CPC classification number: G06F17/5081 G06F17/5009 G06F17/5031

    Abstract: Methods and systems for qualifying a single cell with product path delay analysis are provided. A method includes designing a product using a model from an initial test site. The method also includes creating performance path tests for one or more paths on the product. The method further includes measuring performance path parameters of the product. The method includes determining that the measured performance path parameters match predicted performance path parameters.

    Abstract translation: 提供了使用产品路径延迟分析来限定单个单元的方法和系统。 一种方法包括使用来自初始测试站点的模型来设计产品。 该方法还包括为产品上的一个或多个路径创建性能路径测试。 该方法还包括测量产品的性能路径参数。 该方法包括确定测量的性能路径参数与预测的性能路径参数匹配。

    SOLVING SATISFIABILITY PROBLEMS THROUGH SEARCH
    48.
    发明申请
    SOLVING SATISFIABILITY PROBLEMS THROUGH SEARCH 有权
    通过搜索解决可靠性问题

    公开(公告)号:US20150186505A1

    公开(公告)日:2015-07-02

    申请号:US14145300

    申请日:2013-12-31

    CPC classification number: G06F17/11 G06F17/5027

    Abstract: One embodiment of a method for solving an input satisfiability instance includes searching a database for a stored satisfiability instance that matches the input satisfiability instance and outputting a solution to the input satisfiability instance. One embodiment of method for converting an input satisfiability instance into a standardized representation includes applying a plurality of syntactical simplification rules to the input satisfiability instance until no conditions of any of the plurality of syntactical simplification rules can be met, thereby producing a simplified instance, uniformly replacing each variable in the simplified instance with a unique, consecutively chosen even number, annotating each literal in the simplified instance to indicate whether the each literal is positive or negative, ordering all literals in the simplified instance, and ordering all clauses in the simplified instance to produce the standardized representation.

    Abstract translation: 用于解决输入可满足性实例的方法的一个实施例包括在数据库中搜索与输入可满足性实例匹配的存储的可满足性实例,并将输出可解决性实例的解决方案输出。 将输入可满足性实例转换成标准化表示的方法的一个实施例包括将多个语法简化规则应用于输入可满足性实例,直到不能满足多个语法简化规则中的任何一个的条件,从而产生均匀的简化实例 在简化的实例中用一个唯一的连续选择的偶数替换每个变量,在简化的实例中注释每个字面值,以指示每个字面值是正还是负,排序简化实例中的所有文字,并排序简化实例中的所有子句 产生标准化代表。

    Systems and methods for single cell product path delay analysis
    49.
    发明授权
    Systems and methods for single cell product path delay analysis 有权
    单细胞产品路径延迟分析的系统和方法

    公开(公告)号:US08904329B2

    公开(公告)日:2014-12-02

    申请号:US13735392

    申请日:2013-01-07

    CPC classification number: G06F17/5081 G06F17/5009 G06F17/5031

    Abstract: Methods and systems for qualifying a single cell with product path delay analysis are provided. A method includes designing a product using a model from an initial test site. The method also includes creating performance path tests for one or more paths on the product. The method further includes measuring performance path parameters of the product. The method includes determining that the measured performance path parameters match predicted performance path parameters.

    Abstract translation: 提供了使用产品路径延迟分析来限定单个单元的方法和系统。 一种方法包括使用来自初始测试站点的模型来设计产品。 该方法还包括为产品上的一个或多个路径创建性能路径测试。 该方法还包括测量产品的性能路径参数。 该方法包括确定测量的性能路径参数与预测的性能路径参数匹配。

    SYSTEMS AND METHODS FOR SINGLE CELL PRODUCT PATH DELAY ANALYSIS
    50.
    发明申请
    SYSTEMS AND METHODS FOR SINGLE CELL PRODUCT PATH DELAY ANALYSIS 有权
    单细胞产品路径延迟分析的系统和方法

    公开(公告)号:US20140195995A1

    公开(公告)日:2014-07-10

    申请号:US13735392

    申请日:2013-01-07

    CPC classification number: G06F17/5081 G06F17/5009 G06F17/5031

    Abstract: Methods and systems for qualifying a single cell with product path delay analysis are provided. A method includes designing a product using a model from an initial test site. The method also includes creating performance path tests for one or more paths on the product. The method further includes measuring performance path parameters of the product. The method includes determining that the measured performance path parameters match predicted performance path parameters.

    Abstract translation: 提供了使用产品路径延迟分析来限定单个单元的方法和系统。 一种方法包括使用来自初始测试站点的模型来设计产品。 该方法还包括为产品上的一个或多个路径创建性能路径测试。 该方法还包括测量产品的性能路径参数。 该方法包括确定测量的性能路径参数与预测的性能路径参数匹配。

Patent Agency Ranking