45 results about "Graph patterns" patented technology

A system and method for creating and editing graph schema data structures in a collaborative, real time graphical editing environment is disclosed. The system and method further operates to integrate external sources of data as components of the graph schema. The system and method outputs definition files for the graph schema data structure and mapping files that enable the population of a graph database.

The invention provides a combined anti-counterfeit label which comprises a two-dimensional code, a blank area and a dot matrix graph, wherein the two-dimensional code, the blank area and the dot matrix graph are arranged on the same plane. A method for generating the combined anti-counterfeit label comprises the steps of obtaining a two-dimensional code pattern converted from plaintext information and ciphertext information via a two-dimensional code generator, generating a dot matrix graph pattern with the area not greater than that of the blank area via a dot matrix graph generator, and superimposing the dot matrix graph pattern on the blank area in the two-dimensional code pattern, wherein the dot matrix graph is to be implanted into the blank area of the two-dimensional code pattern. A device for generating the combined anti-counterfeit label comprises the two-dimensional code generator, a dot matrix graph ID (identification) database, the dot matrix graph pattern generator and a merging device. The label is formed by combining the two-dimensional code and the dot matrix graph; even if the label is imitated by a counterfeiter, information bound with the anti-counterfeit label cannot be acquired, and the anti-counterfeit label has high-grade anti-counterfeiting performance.

A method and system for constructing behavior queries in temporal graphs using discriminative sub-trace mining. The method includes generating system data logs to provide temporal graphs, wherein the temporal graphs include a first temporal graph corresponding to a target behavior and a second temporal graph corresponding to a set of background behaviors, generating temporal graph patterns for each of the first and second temporal graphs to determine whether a pattern exists between a first temporal graph pattern and a second temporal graph pattern, wherein the pattern between the temporal graph patterns is a non-repetitive graph pattern, pruning the pattern between the first and second temporal graph patterns to provide a discriminative temporal graph, and generating behavior queries based on the discriminative temporal graph.

The invention provides a SPARQL semantic data query optimization method based on connection cost. According to the method, the RDF mode information to simplify SPARQL basic graph pattern is used, then a B tree structure is used for rapidly estimating SPARQL connection diagram nose sizes and edge weight values, the connection cost is used for estimating and finding the optimal logical query plan by combining a dynamic planning method, and therefore the query efficiency for improving RDF semantic data is improved.

The invention provides a combined-type anti-counterfeiting mark based on a same ID. The combined-type anti-counterfeiting mark is composed of a quick response code and a raster graph. The quick response code and the raster graph all comprise the same ID number extracted from an ID number database during a generating process. The method for generating the combined-type anti-counterfeiting mark comprises the steps that by using a quick response code generator, the ID number, parameter information of the quick response code, plaintext information and preset ciphertext information memory area are converted into the quick response code, wherein the ID number, the parameter information of the quick response code and the plaintext information are extracted from the ID number database; by using a raster graph generator, the raster graph is generated by the ID number which is same as the quick response code. The device for generating the combined-type anti-counterfeiting mark comprises the quick response code generator and the raster graph pattern generator. The quick response code and the raster graph comprise the same ID number, and therefore the quick response code and the raster graph have relevancy, due to the fact that quick response code can only be recognized and read through dedicated equipment, the raster graph cannot be recognized once again after being copied and scanned, and therefore the high level anti-counterfeiting performance is achieved.

The invention discloses a network traffic identification method, device and equipment and a computer storage medium, and the method comprises the following steps: collecting and labeling network traffic in different graph modes; preprocessing the acquired network traffic, and extracting feature information of each network session; generating a data flow diagram based on the feature information; training a graph neural network by utilizing the data of the data flow graph to generate a network flow identification model; converting unknown flow into data of a data flow graph and inputting the data into the network flow identification model, wherein the network flow identification model matches the data flow graph of the unknown flow with a graph mode learned by the network flow identificationmodel; and when the matching degree is greater than a preset threshold, judging a graph mode corresponding to the unknown flow, thereby determining a network application corresponding to the unknownflow. According to the invention, the problem of low accuracy of network traffic identification is solved, and the graph pattern of the network traffic and the corresponding network application are judged by using the graph neural network.

The invention relates to a stage lamp optical system with a mutually-switched pattern and light beam effect. The stage lamp optical system comprises a light source component, a pattern component and a zoom lens component which are positioned in the same main optical axis direction and can emit spot light, and also comprises an optical integrator component which can be switched into the main optical axis, wherein the pattern component comprises a light beam pattern component and a graph pattern component which can switch mutually and enter the main optical axis; the light source component can move forward and backward relative to the pattern component along the main optical axis; when the light source component is moved forward to the first position relative to the pattern component, only the light beam pattern component is switched into the main optical axis; the light rays of the light source component are emitted through the light beam pattern component and the zoom lens component; when the light source component is moved backward to the second position relative to the pattern component, the optical integrator component and the graph pattern component enter the main optical shaft at the same time, and the light rays are emitted through the optical integrator component, the graph pattern component and the zoom lens component. The stage lamp optical system with the mutually switched patterns and light beams has the advantages of low optical loss, high utilization rate and the like.

The invention belongs to the field of design for manufacturability of semiconductor photoetching technologies, and particularly relates to a graph pattern decomposition method adopting a triple patterning photoetching technology. The method comprises steps of firstly, establishing a conflict graph through a rectangle expansion method, then randomly producing a three-colored initial solution, fixing one color in each turn of optimization, performing two-colored optimization on a conflict sub-graph of the rest two colors through a double patterning pattern distribution method, repeating the iterative optimization process until the current optimum solution is not undated for multiple times, and finally, repeatedly calling the above steps and selecting an optimal three-colored result as an output result. According to method, the existing double patterning pattern distribution method is adopted, an optimal strategy obtained through multiple computation is adopted, and a globally optimal solution is searched, so that the purpose of distributing a graph pattern through the triple patterning photoetching technology is realized.

The invention is aimed at providing a positioning processing technique capable of preventing a position mark transferred to a substrate with a transferred object from being hindered in a technique of transferring a transferred object carried by carrier body. A first positioning mark (AM1) formed on a substrate side in advance comprises multiple graph patterns (AP11 to AP14) configured mutually separately and a positioning mark transferring area (TR) is formed and surrounded by the multiple graph patterns (AP11 to AP14). On the rubber blanket of a carrier pattern, a second positioning mark (AM21) formed by pattern forming material is shot as well as the first positioning mark (AM1). The substrate and the rubber blanket are positioned based on the position detecting result of the second positioning mark (AM21) and the first positioning mark (AM1). Then, the second positioning mark (AM21) is positioned at the positioning mark transferring area (TR) and is positioned at a separating position of the graph patterns (AP11 to AP14) and the transferred second positioning mark (AM21) so as to be transferred to the substrate.

The invention discloses a graph pattern matching method based on multi-source-point parallel exploration. The graph pattern matching method can be used for graph pattern fuzzy query starting from a determined point in a graph database. According to the invention, the to-be-queried mode graph is decomposed according to the hierarchical structure, graph traversal query is carried out by taking the graph layer as a unit, the exploration depth can be remarkably reduced, and the parallel exploration performance is improved. Concepts of a center mode set and an edge mode set are provided and used for controlling the exploration process, an exploration task is converted from a sub-graph as the center to a point as the center, and an algorithm can be achieved on a universal distributed graph computing platform. According to the matching result refining method for merging the exploration results of the multiple source points, repeated exploration is carried out by specifying the multiple auxiliary source points, constraint on the matching results is enhanced by utilizing layer differences brought by different visual angles, and the matching precision is improved.

The invention discloses a graph pattern reverse real-time matching method based on event driving. The method comprises the steps of defining a graph pattern, establishing a reverse matching frameworkand adopting a reverse matching method, wherein the graph mode is used for describing a spatial connection relationship between vertexes and edges in the graph and attribute constraints of the spatialconnection relationship in a reverse sequence, and comprises a matching step chain table and a matching context, and reverse real-time matching of the graph mode is realized according to a reverse matching architecture, so that the problem of event-driven sub-graph matching in a real-time scene is solved. According to the method, fixed vertex sub-graph matching can be completed at the second level, effective balance of performance and accuracy is achieved, concurrent matching of a large number of graph modes is supported, the method can be used for enhancing an existing graph calculation engine, and real-time graph matching, query analysis and other scenes in the fields of finance, e-commerce, logistics, public security and the like are supported.

A monitoring work support system for an iron and steel plant supports visual confirmation of a data waveform throughout the entire length of a material to be rolled and determines the monitoring workof an operator having an abnormality. The data storage unit stores actual data of full-length data constituted by measured values of predetermined data items at each point in the longitudinal direction of the material to be rolled. The exception graph pattern registration unit registers at least one piece of exception full-length data for the data item. The similarity determination unit determinesthat the waveform is similar when the square root ratio of the mean value of the square of the deviation between D1_dev[i] and D2_dev[i] is smaller than a threshold value. D1_dev [i] is the deviationbetween the value D1[i] of each point i (i=1,..., N) of the actual data and the average value avi1 of the actual data, and D2_dev[i] is the deviation between the value D2[i] of each point [i] of theabnormal full-length data and the average value avi2 of the abnormal full-length data. The message output unit outputs a pre-registered warning message when the similarity determination unit determines that the waveform is similar.

Methods, devices, and systems for automatically determining how an application program may be partitioned and offloaded for execution by a general purpose applications processor and an auxiliary processor (e.g., a DSP, GPU, etc.) within a mobile device. The mobile device may determine the portions of the application code that are best suited for execution on the auxiliary processor based on pattern-matching of directed acyclic graphs (DAGS). In particular, the mobile device may identify one or more patterns in the code, particularly in a data flow graph of the code, comparing each identified code pattern to predefined graph patterns known to have a certain benefit when executed on the auxiliary processor (e.g., a DSP). The mobile device may determine the costs and/or benefits of executing the potions of code on the auxiliary processor, and may offload portions that have low costs and/or high benefits related to the auxiliary processor.

The invention discloses a survival prediction method and system based on multi-granularity graph mode mining, and the method comprises the steps: receiving the medical history data of insured persons,and carrying out the statistical construction of the statistical features of the insured persons; for each insured person, constructing a heterogeneous information network according to the medical history data of the insured person; mining a medical mode from the heterogeneous information network by adopting a multi-granularity graph mode mining algorithm to serve as a mode feature; evaluating partial regression coefficients of the statistical characteristics and the mode characteristics through a Cox survival prediction model, and calculating the risk of each characteristic based on proportional risk hypothesis to serve as an enhanced characteristic; combining the statistical characteristics, the mode characteristics and the enhanced characteristics as a complete characteristic set, andperforming survival prediction by adding a random forest scoring function for evaluating the deletion data prediction condition.