65 results about "Schema graph" patented technology

An automated method for cyberattack detection and prevention in an endpoint. The technique monitors and protects the endpoint by recording inter-process events, creating an inter-process activity graph based on the recorded inter-process events, matching the inter-process activity (as represented in the activity graph) against known malicious or suspicious behavior (as embodied in a set of one or more pattern graphs), and performing a post-detection operation in response to a match between an inter-process activity and a known malicious or suspicious behavior pattern. Preferably, matching involves matching a subgraph in the activity graph with a known malicious or suspicious behavior pattern as represented in the pattern graph. During this processing, preferably both direct and indirect inter-process activities at the endpoint (or across a set of endpoints) are compared to the known behavior patterns. The approach herein provides for systematic modeling of inter-process behaviors for characterizing malicious or suspicious patterns among processes.

The invention relates to a method for compiling a source code to a program code, the method comprising: providing (101) a pattern graph based on the source code, the pattern graph corresponding to an intermediate representation of the source code according to a set of rules in a first programming language, wherein the set of rules comprises a specific replacement rule directing a pattern graph to be replaced by a corresponding replacement graph assigned to the pattern graph, replacing (103) the pattern graph by the replacement graph assigned to the pattern graph, and generating (105) the program code based on the replacement graph.

The present invention relates to the field of information retrieval. The present invention aims to solve the problem that the existing knowledge map retrieval is not convenient enough, and proposes a knowledge map retrieval method based on a Bayesian classifier, by establishing the corresponding relationship between query sentences and query structure graphs , convert the query sentence into the corresponding semantic label sequence, and then calculate the probability that the query sentence is mapped to each type of corresponding query structure graph through the Bayesian classification model, select the query structure graph with the highest probability value as the query pattern graph, and perform Knowledge graph retrieval. It builds a bridge between flexible natural language query and knowledge graph semantic retrieval, making information retrieval more convenient for ordinary users, and is suitable for film and television retrieval or other knowledge graph retrieval.

The invention discloses a ship-based segmented logistics mode mining and visualization method and system, and the method comprises the steps of collecting the ship segment original logistics data, andgenerating a ship segment logistics transportation original data table; preprocessing the original ship segment logistics transportation data table to generate a ship segment logistics feature vectorof each ship segment; carrying out the hierarchical clustering analysis on the multiple ship segment logistics feature vectors to generate a clustering tree diagram, and generating the multiple shipsegment categories and ship segment sets corresponding to the multiple ship segment categories according to the clustering tree diagram; and performing statistical analysis and normalization processing on the set and logistics transportation original data tables to generate a logistics mode feature statistical table, and drawing a ship segment logistics mode graph of a plurality of ship segment types according to the feature statistical table. According to the method, problems existing in an existing ship section logistics mode can be obtained, and the discovered problems are analyzed or solved in a targeted mode by combining the characteristics of specific ship sections corresponding to each logistics mode.

Various embodiments virtualize data across heterogeneous formats. In one embodiment, a plurality of heterogeneous data sources is received as input. A local schema graph including a set of attribute nodes and a set of type nodes is generated for each of the plurality of heterogeneous data sources. A global schema graph is generated based on each local schema graph that has been generated. The global schema graph comprises each of the local schema graphs and at least one edge between at least one of two or more attributes nodes and two or more type nodes from different local schema graphs. The edge indicates a relationship between the data sources represented by the different local schema graphs comprising the two or more attributes nodes based on a computed similarity between at least one value associated with each of the two or more attributes nodes.

The invention discloses a method for establishing a distributed graph routing protocol of a wireless sensor network under an asymmetric link, which belongs to the technical field of computer networks. This method designs a distributed graph routing calculation method for wireless sensor networks without a central management server; defines the format of graph routing interaction messages; designs asymmetric link state downlink (DOWN-LINK), uplink ( UP-LINK), peer to peer (peer to peer, P2P) three modes diagram routing establishment, interaction, update process. The invention aims to solve the routing asymmetry problem when wireless sensor networks establish routes in an asymmetric link environment. At the same time, in the absence of a central management server, the distributed routing calculation method is used to solve the hardware bottleneck of centralized graph routing. question. The distributed graph routing protocol proposed by the invention can effectively reduce the management and control overhead of traditional graph routing, enhance the robustness of the network, and optimize the routing performance of the wireless sensor network as a whole.