90 results about "Process graph" patented technology

A computer software system is provided, namely An Object Process Graph Relational Database Interface (OPGRDI) system. The OPGRDI defines and updates relational database tables based on an OPG and stores and retrieves data in the tables as an OPG-defined application is run. The OPGRDI also defines and updates OPG persistent data object elements based on relational database table schemas. The OPGRDI functions can be enabled by users who want to store and retrieve application information in a relational database system, such as Oracle, Sybase, SQL Server, etc. The OPGRDI alters relational database tables as a user changes the structure of OPG-defined application.

A software system is provided including an Object Process Graph for defining applications and a Dynamic Graph Interpreter that interprets Object Process Graphs. An Object Process Graph defines all of an application's manipulations and processing steps and all of the application's data. An Object Process Graph is dynamic, making it possible to change any aspect of an application's data entry, processing or information display at any time. When an Object Process Graph is interpreted, it functions to accept data, process the data and produce information output. Modifications made to an Object Process Graph while it is being interpreted take affect immediately and can be saved. Object Process Graphs and Dynamic Graph Interpreters can be deployed on single user workstation computers or on distributed processing environments where central servers store Object Process Graphs and run Dynamic Graph Interpreters, and workstation computers access the servers via the intranet or local intranets.

Embodiments are described for a method for processing graph data by executing a Markov Clustering algorithm (MCL) to find clusters of vertices of the graph data, organizing the graph data by column by calculating a probability percentage for each column of a similarity matrix of the graph data to produce column data, generating a probability matrix of states of the column data, performing an expansion of the probability matrix by computing a power of the matrix using a Map-Reduce model executed in a processor-based computing device; and organizing the probability matrix into a set of sub-matrices to find the least amount of data needed for the Map-Reduce model given that two lines of data in the matrix are required to compute a single value for the power of the matrix. One of at least two strategies may be used to computing the power of the matrix (matrix square, M²) based on simplicity of execution or improved memory usage.

The invention relates to systems, processes and apparatuses for determining a rig-state of a drilling rig during a wellbore drilling operation and detecting and mitigating drilling dysfunctions. These systems, processes and apparatuses provide a computer with a memory and a processor, a plurality of sensors associated with a wellbore drilling operation for acquiring time series data wherein the data are formatted for sample and bandwidth regularization and time-corrected to provide substantially time-synchronized data, a processing graph of data-stream networked mathematical operators that applies continuous analytics to the data at least as rapidly as the data are acquired to determine dynamic conditions of a plurality of rig conditions associated with the wellbore drilling operation and determining a rig-state from the plurality of rig conditions.

The invention relates to a laser etching method of a three-dimensional curved surface, is applied to the fields of aerospace, electronic and optical devices, and solves the problem that ideal texturegraphs cannot be acquired as a conventional three-dimensional curved surface laser processing method can only be utilized to process parts with to-be-processed surface texture characteristics and processed graphs have angle change. The laser etching method comprises the following steps that: (1) a two-dimensional graph is mapped to a corresponding position of a three-dimensional curved surface model; (2) the graph is cut according to a processing region of a scanning galvanometer and laser focus depth, and central point normal vector coordinates of cut regions are calculated; (3) processing tracks of the scanning galvanometer in the cut regions are confirmed; and (4) the central point normal vector coordinates acquired in the step (2) are adopted as target point positions of five-shaft motion of a machine tool, the processing tracks of the scanning galvanometer acquired in the step (3) are adopted as processing graphs of the cut regions, scanning processing is carried out, and laser etching processing of curved surface parts is achieved.

Activities within a workflow are either data management activities (DMAs) or non-DMAs. A workflow is typically carried out by a system by executing one activity after the other. This can, however, be very time consuming. A method and system are provided for optimizing a group of activities (GOA) comprising a DMA, whereby the GOA is comprised in the workflow to improve the overall performance. The method determines the DMAs, and for each DMA, a data level statement (DLS). The GOA is determined and a process graph model (PGM) is determined from the GOA so that the DLS is comprised in the PGM and the semantics of the PGM are identical to those of the GOA. The PGM is optimized for which an optimized GOA is determined. The semantics of the optimized GOA are identical to those of the GOA. In the workflow, the GOA is replaced by the optimized GOA.

Methods and systems for reporting anomalous events include building a process graph that models states of process-level events in a network. A topology graph is built that models source and destination relationships between connection events in the network. A set of alerts is clustered based on the process graph and the topology graph. Clustered alerts that exceed a threshold level of trustworthiness are reported.

The invention relates to the field of semiconductor, in particular to a wafer-supporting platform. The wafer-supporting platform can be used when wafer edges can only contact the wafer-supporting platform according to process requirements during rotary processing in the semiconductor industry to ensure that the central graphic area of a wafer does not contact the wafer-supporting platform, thereby preventing damages to a processed graph caused by the problems of the wafer-supporting platform. The wafer-supporting platform is provided with an annular platform, vacuum sucking discs, a groove, vacuum channels and a body, wherein the top of the body is provided with the annular platform; the annular platform is provided with the groove which is convenient for an I-shaped mechanical hand to enter to fetch and deliver the wafer; the vacuum sucking discs are distributed on the upper surface of the annular platform; and the inside of the body is provided with the vacuum channels communicated with the vacuum sucking discs. The wafer-supporting platform only carries out vacuum adsorption on annular belts on wafer edges and does not contact the graphic areas of the wafers, thereby obtaining high reliability and stable wafer adsorption without causing excursion, wafer drop, and the like.

The embodiments of the invention disclose a method and a device for processing graph data, and relates to the technical field of data mining for increasing graphic calculation efficiency. The method comprises: obtaining edge data in the graph data and a computational algorithm for conducting graphic calculation on the graph data; based on the computational algorithm, determining a partitioning algorithm for partitioning the edge data in the graph data, the partitioning algorithm referring to an algorithm which partitions the edge data in the graph data in accordance with nodes which constitute the edge data, the nodes constituting the edge data referring to source nodes and/or destination nodes that constitute the edge data; partitioning the edge data in the graph data into N initial edge data blocks in accordance with the partitioning algorithm and memory capacity of local memory, each initial edge data block of the N initial edge data blocks having a data capacity less than the memory capacity, wherein N is equal to or greater than 1 and is an integer; arranging the edge data of each initial edge data block of the N initial edge data blocks in accordance with the nodes the constitute the edge data, and obtaining N target edge data blocks.

A system and method for verifying a composition of interacting services in a distributed system includes generating a concurrent process graph (CPG) for processes in a system and symbolically encoding the CPG of each process to perform a reachability analysis. Symbolic summaries are generated for concurrently running processes based on the reachability analysis. Modular verification is conducted by utilizing the symbolic summaries of the processes to verify a system of interrelated processes.

The invention advances a method for automatically obtain engineering parameter values of sampling points from a graph by computer, obtaining the engineering parameter values of sampling points in the graph by conversion and calculation for a reference frame. And the method comprises the steps of: leading an to-be-processed graph or curve into a computer graph container, and obtaining the origin position of a user reference frame where the graph exists; according to the in-window position relation of all sampling points in the graph in the user reference frame, one by one determining their relative positions in the window; obtaining the relation between all the sampling points in a system reference frame, and calculating a distance between every two adjacent sampling points and using this as reference frame transform unit quantities of the system and user reference frames; moving a cursor to generate a cursor following value and using the unit quantities to obtain corresponding engineering parameter values to all sampling points.

The invention relates to a graph on-line splicing method and system for laser processing of a large format, and solves the problem that the splicing accuracy of an existing on-line splicing method cannot meet the processing requirement. The graph on-line splicing method comprises the following steps of 1) dividing a to-be-processed graph into N sub graphs, and acquiring the coordinate of the center point of each sub graph and the smallest rectangular region containing each sub graph; 2: turning on an indication power supply, enabling light beam emitted by the indication power supply to reach an X to-be-processed area, and scanning the boundary of the X to-be-processed area; 3) observing the X to-be-processed areas by a coaxial measuring unit, acquiring the images of the X to-be-processed areas, and obtaining the actual bounding box of the X to-be-processed areas by the control unit according to the acquired image; 4) comparing a theory bounding box with an actual bounding box; 5) adjusting the positions of X sub graphs in the control unit; and 6) completing the graph scanning of the X processing areas; and 7) repeating the step 2 to the step 6.

The invention relates to a system and a method for rotating a display picture. The system comprises a graphical device interface, a control unit and an input unit, wherein the graphical device interface comprises a plurality of graphical functions which are used for processing graph objects, and the graph objects are displayed on a display panel through physical coordinates; the control unit is used for executing an application program, and the application program converts the physical coordinates into logical coordinates according to rotation instructions so as to rotate the graph objects; the input unit is used for inputting the rotation instructions, and the input unit is accessed to the control unit which is accessed to the graphical device interface. The invention causes a user to freely rotate the displayed graph objects on the display panel according to the demands, and is convenient and fast.