PROCESS CONTROL TOOL FOR PROCESSING BIG AND WIDE DATA

    公开(公告)号:WO2020124041A1

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

    申请号:PCT/US2019/066386

    申请日:2019-12-13

    Abstract: A process control tool for processing wide data from automated manufacturing operations. The tool including a feature selector, an analysis server, and a visualization engine. The feature selector receives process input data from at least one manufacturing process application, wherein the process input data includes a plurality of observations and associated variables, converts the received process input data to a stacked format having one row for each variable in each observation, converts identified categorical variables into numerical variables and identified time-series data into fixed numbers of intervals, computes statistics that measure the strengths of relationships between predictor values and an outcome variable, orders, filters, and pivots the predictor values. The analysis server performs at least one operation to identify interactions between predictor values, e.g. using maximum Likelihood computations or predefined searches, in the filtered predictor values. The visualization engine displays the interactions for use in managing the manufacturing operations.

    MESSAGE MATCHING
    2.
    发明申请
    MESSAGE MATCHING 审中-公开

    公开(公告)号:WO2015030939A3

    公开(公告)日:2015-03-05

    申请号:PCT/US2014/046199

    申请日:2014-07-10

    Abstract: Processing a message is disclosed. For each field group applicable to a message from one or more unique field groups of one or more fields identified using one or more content matchers, a compiled message corresponding to the field group applicable to the message is generated. It is determined whether one or more of the compiled messages matches one or more of the one or more content matchers.

    PREDICTIVE SYSTEM FOR DEPLOYING ENTERPRISE APPLICATIONS
    3.
    发明申请
    PREDICTIVE SYSTEM FOR DEPLOYING ENTERPRISE APPLICATIONS 审中-公开
    企业应用预测系统

    公开(公告)号:WO2014144992A1

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

    申请号:PCT/US2014/029626

    申请日:2014-03-14

    CPC classification number: G06N5/04 G06F8/60 G06Q10/04 G06Q10/06

    Abstract: Predictive systems for deploying enterprise applications include memory structures that output predictions to a user. The predictive system may include an HTM structure that comprises a tree-shaped hierarchy of memory nodes, wherein each memory node has a learning and memory function, and is hierarchical in space and time that allows them to efficiently model the structure of the world. The memory nodes learn causes, predicts with probability values, and form beliefs based on the input data, where the learning algorithm stores likely sequence of patterns in the nodes. By combining memory of likely sequences with current input data, the nodes may predict the next event. The predictive system may employ an HHMM structure comprising states, wherein each state is itself an HHMM. The states of the HHMM generate sequences of observation symbols for making predictions.

    Abstract translation: 用于部署企业应用程序的预测系统包括向用户输出预测的内存结构。 预测系统可以包括包括存储器节点的树形层级的HTM结构,其中每个存储器节点具有学习和存储功能,并且在空间和时间上是分级的,其允许它们有效地建模世界的结构。 记忆节点学习原因,以概率值预测,并根据输入数据形成信念,其中学习算法存储节点中可能的模式序列。 通过将可能序列的存储器与当前输入数据组合,节点可以预测下一个事件。 预测系统可以采用包括状态的HHMM结构,其中每个状态本身是HHMM。 HHMM的状态产生用于进行预测的观测符号序列。

    FAST MATCHING FOR CONTENT-BASED ADDRESSSING
    4.
    发明申请
    FAST MATCHING FOR CONTENT-BASED ADDRESSSING 审中-公开
    用于基于内容的寻址的快速匹配

    公开(公告)号:WO2012074759A2

    公开(公告)日:2012-06-07

    申请号:PCT/US2011/061065

    申请日:2011-11-16

    Inventor: LESHCHINER, Dan

    CPC classification number: G06F17/30442 H04L45/306 H04L67/327

    Abstract: Disclosed are systems and methods for efficient matching for content-based addressing wherein the systems and methods may: accept, at a receiver machine, a query; generate, at the receiver machine, a tree structure ordered by one or more fields of the query; analyze, at the receiver machine, a message from the sender machine; search, by the receiver machine, the tree structure using content from one or more fields of the message; determine, by the receiver machine, if the content values of the message match a content value of the query stored in the tree structure; and accept, by the receiver machine, the message if the content value of the message matches one or more content values of the query.

    Abstract translation: 公开了用于基于内容寻址的有效匹配的系统和方法,其中系统和方法可以:在接收机处接收查询; 在接收机上生成由查询的一个或多个字段排序的树结构; 在接收机处分析来自发信机的消息; 由接收机机器搜索使用来自消息的一个或多个字段的内容的树结构; 由接收机确定消息的内容值是否与存储在树结构中的查询的内容值相匹配; 并且如果所述消息的内容值与所述查询的一个或多个内容值匹配,则由所述接收机设备接受所述消息。

    INFERENTIAL STATE MACHINES
    5.
    发明申请
    INFERENTIAL STATE MACHINES 审中-公开
    美国国家机器

    公开(公告)号:WO2007008814A3

    公开(公告)日:2009-05-07

    申请号:PCT/US2006026755

    申请日:2006-07-11

    CPC classification number: G06F8/31

    Abstract: An extended state machine that makes use of an inference engine as the infrastructure for adding inferential capabilities to the state machine's execution. The result is a state machine that may operate on partial or disordered information, inferring intermediate states that have yet to be formally traversed. In addition, controls such as state timeouts and transition priorities allow for finer control of the state machine's execution, particularly in unexpected circumstances.

    Abstract translation: 扩展状态机利用推理机作为基础设施,为状态机的执行添加推理能力。 结果是可以对部分或无序信息进行操作的状态机,推断尚未正式遍历的中间状态。 此外,诸如状态超时和转换优先级的控制允许更好地控制状态机的执行,特别是在意外情况下。

    INFERENTIAL STATE MACHINES
    7.
    发明申请
    INFERENTIAL STATE MACHINES 审中-公开
    美国国家机器

    公开(公告)号:WO2007008814A2

    公开(公告)日:2007-01-18

    申请号:PCT/US2006/026755

    申请日:2006-07-11

    CPC classification number: G06F8/31

    Abstract: An extended state machine that makes use of an inference engine as the infrastructure for adding inferential capabilities to the state machine's execution. The result is a state machine that may operate on partial or disordered information, inferring intermediate states that have yet to be formally traversed. In addition, controls such as state timeouts and transition priorities allow for finer control of the state machine's execution, particularly in unexpected circumstances.

    Abstract translation: 扩展状态机利用推理机作为基础设施,为状态机的执行添加推理能力。 结果是可以对部分或无序信息进行操作的状态机,推断尚未正式遍历的中间状态。 此外,诸如状态超时和转换优先级的控制允许更好地控制状态机的执行,特别是在意外情况下。

    USING A B-TREE TO STORE GRAPH INFORMATION IN A DATABASE
    8.
    发明申请
    USING A B-TREE TO STORE GRAPH INFORMATION IN A DATABASE 审中-公开
    使用B树在数据库中存储图形信息

    公开(公告)号:WO2017196444A1

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

    申请号:PCT/US2017/021451

    申请日:2017-03-08

    Abstract: Techniques to store graph information in a database are disclosed. In various embodiments, each node in a graph may be modeled as a micro b-tree. Node identity, attribute, edge, and edge attribute data may be stored in one or more pages modeled on page formats typically used to store index data for a relational database index. Data associated with a plurality of nodes and edges, each of said edges representing a relationship between two or more of said nodes, may be received. For each node, one or more pages of data may be created, each corresponding to a prescribed page size associated with a storage device in which said one or more pages are to be stored, and each page having a data structure that includes a variable-sized set of fixed length data slots and a variable-sized variable length data region

    Abstract translation: 公开了将图形信息存储在数据库中的技术。 在各种实施例中,图中的每个节点可以被建模为微型b-树。 节点身份,属性,边缘和边缘属性数据可以被存储在一个或多个页面中,该页面建模为典型地用于存储关系数据库索引的索引数据的页面格式。 可以接收与多个节点和边缘相关联的数据,每个所述边缘表示两个或更多个所述节点之间的关系。 对于每个节点,可以创建一个或多个数据页面,每个数据页面对应于与其中将存储所述一个或多个页面的存储设备相关联的规定页面大小,并且每个页面具有数据结构,该数据结构包括可变长度页面, 中等规模的固定长度数据区和可变长度数据区

    MESSAGE MATCHING
    9.
    发明申请
    MESSAGE MATCHING 审中-公开
    信息匹配

    公开(公告)号:WO2015030939A2

    公开(公告)日:2015-03-05

    申请号:PCT/US2014046199

    申请日:2014-07-10

    CPC classification number: H04W4/08

    Abstract: Processing a message is disclosed. For each field group applicable to a message from one or more unique field groups of one or more fields identified using one or more content matchers, a compiled message corresponding to the field group applicable to the message is generated. It is determined whether one or more of the compiled messages matches one or more of the one or more content matchers.

    Abstract translation: 处理消息被披露。 对于适用于来自使用一个或多个内容匹配器识别的一个或多个字段的一个或多个唯一字段组的消息的每个字段组,生成对应于适用于该消息的字段组的编译消息。 确定一个或多个编译的消息是否匹配一个或多个内容匹配器中的一个或多个。

    DATA REPLICATION PROTOCOL WITH EFFICIENT UPDATE OF REPLICA MACHINES
    10.
    发明申请
    DATA REPLICATION PROTOCOL WITH EFFICIENT UPDATE OF REPLICA MACHINES 审中-公开
    数据复制协议与有效更新复制机

    公开(公告)号:WO2014074639A2

    公开(公告)日:2014-05-15

    申请号:PCT/US2013068805

    申请日:2013-11-06

    CPC classification number: G06F17/30575

    Abstract: Steady state data distribution is provided between a client application, a leader machine, and a plurality of replica machines. The distribution comprises the leader machine receiving an operation request from the client application, the leader machine sending the prepare message to each of the plurality of replica machines, the replica machines recording in their logs information on the operation, the replica machines sending acknowledgement messages to the leader machine, and the leader machine sending commit command messages to the replica machines. A new quorum of the replica machines is created by using log information. Replica machines that become part of the new quorum are updated in an efficient manner.

    Abstract translation: 在客户端应用程序,领导者机器和多个副本机器之间提供稳定状态数据分布。 该分配包括领导者机器接收来自客户端应用程序的操作请求,领导者机器将准备消息发送给多个复制机中的每一个,复制机在他们的日志中记录操作的信息,复制机发送确认消息给 领导者机器和领导者机器向复制机发送提交命令消息。 通过使用日志信息创建新的法定复制机器。 成为新法定人数一部分的副本机器将以高效方式进行更新。

Patent Agency Ranking