62 results about "Schema graph" patented technology

An intelligent caching data structure and mechanisms for storing visual information via objects and data representing graphics information. The data structure is generally associated with mechanisms that intelligently control how the visual information therein is populated and used. The cache data structure can be traversed for direct rendering, or traversed for pre-processing the visual information into an instruction stream for another entity. Much of the data typically has no external reference to it, thereby enabling more of the information stored in the data structure to be processed to conserve resources. A transaction / batching-like model for updating the data structure enables external modifications to the data structure without interrupting reading from the data structure, and such that changes received are atomically implemented. A method and mechanism are provided to call back to an application program in order to create or re-create portions of the data structure as needed, to conserve resources.

One or more embodiments of the invention provide a continuous sub-graph matching method and a continuous sub-graph matching system for mode graph change, and equipment. The continuous sub-graph matching method comprises the steps of: constructing a data structure based on a network topological graph G and a mode graph P, wherein the data structure is used for storing a local matching result of thenetwork topological graph G and the mode graph P; constructing a maintenance model based on the dynamic change of the mode graph P; updating the data structure based on the dynamic change of the modegraph P by means of the maintenance model, so that the data structure stores a real-time local matching result; constructing a cost model based on a matching sequence of the mode graph P; calculatingthe minimum matching cost of the mode graph P by using the cost model, and acquiring a matching algorithm based on the minimum matching cost; and acquiring a final matching result of the network topological graph G and the mode graph P based on the real-time local matching result and the matching algorithm, so as to complete network threat detection. According to the continuous sub-graph matchingmethod and the continuous sub-graph matching system, abnormal network attack behaviors can be monitored, an impending network attack mode can be predicted, and an attack target of a network hacker can be speculated.

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 discloses a multi-task external memory mode diagram processing method based on I / O scheduling, includes streaming partitioning graph data to obtain graph partition, evenly placing graphpartition in multiple external storage devices, selecting target external storage devices from multiple external storage devices based on I / O scheduling, and taking graph partition in the target external storage device that has not been accessed by graph processing task as designated partition; Judging whether the synchronization field of the designated partition is not mapped into the memory according to the synchronization field of the designated partition, if so, mapping the designated partition from the external storage device into the memory, and updating the synchronization field of thedesignated partition; Otherwise, the graph partition data is accessed directly through the address information mapped to memory by the specified partition. Through I / O scheduling, the invention selects the external storage device with the least number of tasks to access, thereby controlling the sequence of accessing the data of the external storage diagram partition and balancing the I / O pressure.By setting the synchronization field to realize the data sharing of graph partition, the repeated loading of the same graph partition is reduced, so as to reduce the total I / O bandwidth and improve I / O efficiency.

The invention discloses a DDoS attack traffic identification and detection method under an SDN. The method comprises the following steps: S1, collecting flow table information; S2, calculating a traffic characteristic value with DDoS attack characteristics according to the traffic table information, and converting the traffic characteristic value into characteristic vector data; s3, utilizing the characteristic vector data to construct a random forest model, adopting the constructed random forest model to screen the traffic characteristics with little effect of identifying the DDoS attack, and obtaining an optimal characteristic subset; S4, converting the optimal feature subset into a feature vector Fnew, measuring the feature vector Fnew and the Mahalanobis distance of each node in the feature mode graph, if a node having the nearest Mahalanobis distance with the feature vector Fnew exists, determining that the feature mode corresponding to the node is the category of the feature vector Fnew, and if the category is a benign category, determining that the traffic is normal; otherwise, determining that the traffic is the DDoS attack traffic.

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 embodiment of the invention provides an isomorphic pattern recognition method and device, equipment and a medium. The method comprises the steps: receiving a target graph and a mode graph, wherein each of the target graph and the mode graph comprises nodes and edges connected with the nodes; screening the nodes in the target graph based on the labels of the nodes in the target graph and the labels of the nodes in the mode graph, and obtaining a sub-graph of the target graph according to the screened nodes in the target graph; and searching the mode graph in the sub-graph of the target graph to obtain an isomorphic graph of the mode graph. According to the embodiment of the invention, the efficiency of identifying the isomorphic pattern of the mode pattern from the target pattern is improved, and the time complexity and time consumption of identifying the isomorphic pattern of the mode pattern from the target pattern are reduced.

The invention discloses a method for path discovery in a knowledge graph, which comprises the following steps: acquiring the knowledge graph G = (V, E) meeting strong mode constraint, V being a node set comprising a plurality of nodes, E being an edge set comprising a plurality of edges, each node having a node type thereof, and each edge having an edge type thereof; obtaining a mode graph = (,) of the knowledge graph, which is a node type set comprising a plurality of node types and an edge type set comprising a plurality of edge types; determining one or more mode graph paths of the node type of the first node and the node type of the second node in a mode graph; and performing a traversal lookup in the knowledge graph along each of the one or more pattern graph paths to discover one or more paths between the first node and the second node. The invention also relates to other path discovery methods and associated systems, devices and media. According to the scheme, path discovery can be efficiently executed.

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.

The invention discloses a method and system for constructing a multi-mode graph index oriented to weak structural correlation. The method is: 1) read the pattern diagrams in the pattern diagram collection of the target domain and generate a pattern diagram ID for each pattern diagram; 2) build a pattern diagram isomorphism tree: make a pairwise judgment on each pattern diagram, if There is a subgraph isomorphism relationship between the two schema graphs, then add a directed edge from the smaller schema graph to the larger schema graph, and get the schema graph isomorphism tree of the schema graph set; 3) For the schema graph the same Paper mulching performs frequent subgraph mining, finds common pattern graphs and adds them to the pattern graph isomorphism tree; 4) When there is a subpattern graph in the pattern graph isomorphism tree with multiple parent pattern graphs, it is the child pattern graph. The pattern graph retains the only parent pattern graph; 5) Calculate the minimum spanning tree of the isomorphic tree of the pattern graph, and perform depth-first traversal on it to obtain the optimal matching order of the pattern graph set. The present invention can greatly improve the matching efficiency.