45 results about "Graph patterns" patented technology

A method for modeling a web service operation, includes: defining an input message pattern that describes input requirements of a web service operation, wherein the input message pattern includes a set of variables representing data elements that must be contained in a message input to the web service operation, and a graph pattern that semantically describes the data elements that must be contained in the message input to the web service operation; and defining an output message pattern that describes an output message of the web service operation, wherein the output message pattern includes a set of variables and exemplars that represent data elements contained in the output message, and a graph pattern that semantically describes the data elements contained in the output message.

A method for constructing a processing request so that an information processing application satisfying the processing request can be assembled, includes: inputting a processing request, wherein the processing request includes a goal that is represented by a graph pattern that semantically describes a desired processing outcome; and assembling a processing graph that includes at least one component that satisfies the desired processing outcome, wherein the processing graph is assembled by associating the graph pattern that semantically describes the desired processing outcome with a graph pattern that semantically describes an applicability condition of the at least one component or a graph pattern that semantically describes an inclusion effect of the at least one component.

A semantic publish-subscribe system, including: a plurality of subscribers; a plurality of publishers; and a server that receives and stores subscriptions that are described in web ontology language (OWL) graph patterns from the plurality of subscribers and that receives events that are described in semantic graphs formed by OWL assertions from the plurality of publishers, wherein when the server receives an event from a publisher, the server expands the OWL assertions of the event using a reasoner to produce an expanded event, the server matches the expanded event to a subscription, and then, the server notifies a subscriber whose interest matches the event.

Detecting missing entities in a graph schema is provided. Unlabeled and unstructured data of a particular domain are divided into a plurality of Voronoi cells using a clustering algorithm that is initiated with cluster centroids proportional to a number of entity types corresponding to the particular domain existing in the graph schema. One additional cluster more than the number of entity types corresponding to the particular domain existing in the graph schema is initialized using a cluster initializing formula of the clustering algorithm. It is determined whether the one additional cluster is populated. In response to determining that the one additional cluster is populated, an entity type is determined to be missing from the number of entity types existing in the graph schema. The missing entity type is added to the graph schema.

A method for modeling components of a stream processing application, includes: defining an input message pattern of a processing element, wherein the input message pattern includes variables representing data objects that must be included in a message input to the processing element, and a graph pattern that semantically describes the data objects that must be included in the message input to the processing element; and defining an output message pattern of the processing element, wherein the output message pattern includes variables and new data objects, the variables and new data objects representing data objects that must be included in a message output from the processing element, and a graph pattern that semantically describes the data objects in the message output from the processing element.

A cybersecurity server receives an executable file to be classified. A call graph of the executable file is generated. Functions of the executable file are represented as vertices in the call graph, and a vertex value is generated for each vertex. The vertex values are arranged in traversal order of the call graph to generate a call graph pattern. A digest of the call graph pattern is calculated and compared to one or more malicious digests.

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.