Patent application number | Description | Published |
20080235691 | SYSTEM AND METHOD OF STREAM PROCESSING WORKFLOW COMPOSITION USING AUTOMATIC PLANNING - An automatic planning system is provided for stream processing workflow composition. End users provide requests to the automatic planning system. The requests are goal-based problems to be solved by the automatic planning system, which then generates plan graphs to form stream processing applications. A scheduler deploys and schedules the stream processing applications for execution within an operating environment. The operating environment then returns the results to the end users. | 09-25-2008 |
20080235692 | APPARATUS AND DATA STRUCTURE FOR AUTOMATIC WORKFLOW COMPOSITION - A stream processing system provides a description language for stream processing workflow composition. A domain definition data structure in the description language defines all stream processing components available to the stream processing system. Responsive to receiving a stream processing request, a planner translates the stream processing request into a problem definition. The problem definition defines stream properties that must be satisfied by property values associated with one or more output streams. The planner generates a workflow that satisfies the problem definition given the domain definition data structure. | 09-25-2008 |
20080238923 | METHOD AND SYSTEM FOR AUTOMATICALLY ASSEMBLING STREAM PROCESSING GRAPHS IN STREAM PROCESSING SYSTEMS - A method for assembling stream processing graphs in a stream processing system, includes: performing, in an offline manner, translating a plurality of processing element and data source descriptions into a planning language and performing reasoning on the plurality of processing element and data source descriptions during the translation; and performing, in an online manner, receiving a processing request that specifies a desired processing outcome; translating the processing request into a planning goal; and assembling a plurality of stream processing graphs, each of the processing graphs including a plurality of the translated and reasoned processing elements or data sources that satisfy the desired processing outcome. | 10-02-2008 |
20080243449 | METHOD FOR DECLARATIVE SEMANTIC EXPRESSION OF USER INTENT TO ENABLE GOAL-DRIVEN INFORMATION PROCESSING - 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. | 10-02-2008 |
20080243450 | METHOD FOR MODELING COMPONENTS OF AN INFORMATION PROCESSING APPLICATION USING SEMANTIC GRAPH TRANSFORMATIONS - A method for modeling a component of an information processing application, includes: defining an applicability condition of a component, wherein the applicability conditions includes variables representing objects that must be included in a pre-inclusion state and a graph pattern that semantically describes the objects that must be included in the pre-inclusion state, wherein the pre-inclusion state is a state against which the applicability of the component for inclusion in a processing graph is evaluated; and defining an inclusion effect of the component, wherein the inclusion effect includes variables representing objects that must be included in a post-inclusion state and a graph pattern that semantically describes the objects that must be in the post-inclusion state, wherein the post-inclusion state is a state resulting from inclusion of the component in the processing graph. | 10-02-2008 |
20080243451 | METHOD FOR SEMANTIC MODELING OF STREAM PROCESSING COMPONENTS TO ENABLE AUTOMATIC APPLICATION COMPOSITION - 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. | 10-02-2008 |
20080244236 | METHOD AND SYSTEM FOR COMPOSING STREAM PROCESSING APPLICATIONS ACCORDING TO A SEMANTIC DESCRIPTION OF A PROCESSING GOAL - A method for assembling a stream processing application, includes: inputting a plurality of data source descriptions, wherein each of the data source descriptions includes a graph pattern that semantically describes an output of a data source; inputting a plurality of component descriptions, wherein each of the component descriptions includes a graph pattern that semantically describes an input of a component and a graph pattern that semantically describes an output of the component; inputting a stream processing request, wherein the stream processing request includes a goal that is represented by a graph pattern that semantically describes a desired stream processing outcome; assembling a stream processing graph, wherein the stream processing graph includes at least one data source or at least one component that satisfies the desired processing outcome; and outputting the stream processing graph. | 10-02-2008 |
20080244540 | METHOD AND SYSTEM FOR ASSEMBLING INFORMATION PROCESSING APPLICATIONS BASED ON DECLARATIVE SEMANTIC SPECIFICATIONS - A method for assembling an information processing application, includes: inputting a plurality of component descriptions, wherein each of the component descriptions includes a graph pattern that semantically describes an applicability condition of a component and a graph pattern that semantically describes an inclusion effect of the component; 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; assembling a processing graph, wherein the processing graph includes at least one component that satisfies the desired processing outcome; and outputting the processing graph. | 10-02-2008 |
20080250390 | METHOD FOR DECLARATIVE SEMANTIC EXPRESSION OF USER INTENT TO ENABLE GOAL-DRIVEN STREAM PROCESSING - A method for constructing a stream processing requests so that a stream processing application satisfying the stream processing request can be assembled, includes: inputting a stream processing request, wherein the stream processing request includes a goal that is represented by a graph pattern that semantically describes a desired stream processing outcome; and assembling a stream processing graph, wherein the stream processing graph is assembled to include at least one processing element that satisfies the desired processing outcome by associating the graph pattern that semantically describes the desired processing outcome with a graph pattern that semantically describes an input of the at least one processing element and a graph pattern that semantically describes an output of the at least one processing element, or to include at least one data source by associating the graph pattern that semantically describes the desired processing outcome with a graph pattern that semantically describes an output of the at least one data source. | 10-09-2008 |
20080256549 | System and Method of Planning for Cooperative Information Processing - A cooperative data stream processing system is provided that utilizes a plurality of independent, autonomous and possibly heterogeneous sites in a cooperative arrangement to execute jobs derived from user-define inquires over dynamic, continuous streams of data. A method is provided for cooperative planning for the execution of the jobs across the distributed plurality of sites. An identification of the resources available for sharing from each one of the plurality of sites is communicated to one or more planners disposed on the distributed sites. These planners use the resource information to generate planning domains in which the jobs can be processed. Upon receipt of an inquiry at one of the sites, the inquiry is communicated to one of the planners that uses the planning domain to create at least one distributed plan for the inquiry. Processing of the inquiry is conducted in accordance with the distributed plan. Planning can take advantage of the structure of virtual organizations including cooperative and federated virtual organizations. The distributed plans can make use of the resources within a single virtual organization or across multiple organizations. | 10-16-2008 |
20080288595 | METHOD AND SYSTEM FOR MESSAGE-ORIENTED SEMANTIC WEB SERVICE COMPOSITION BASED ON ARTIFICIAL INTELLIGENCE PLANNING - 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. | 11-20-2008 |
20090100407 | METHOD AND SYSTEM FOR SIMPLIFIED ASSEMBLY OF INFORMATION PROCESSING APPLICATIONS - A method for automatic composition of an information processing flow based on a user-specified processing goal, includes: selecting tags from a first plurality of tags, wherein the selected tags specify a processing goal; composing a processing graph in accordance with the processing goal; and displaying a second plurality of tags, wherein the second plurality of tags includes tags that are only relevant to the selected tags. | 04-16-2009 |
20090177910 | METHOD OF RECOVERING FROM SOFTWARE FAILURES USING REPLANNING - A method for recovering from software failures, includes: receiving failure information that identifies a failing component of a first processing graph; modifying a planning domain that includes a plurality of component descriptions according to the failure information; and composing a second processing graph by using the modified planning domain so that the second processing graph does not include the failing component. | 07-09-2009 |
20090177955 | METHOD AND SYSTEM FOR MODELING USER REQUESTS, APPLICATIONS AND COMPONENTS USED IN DYNAMIC APPLICATION ASSEMBLY - A method for determining if a first component can be connected to a second component for inclusion in a processing graph, includes: accessing a first component description, the first component description describing an output object of the first component with a set of tags; accessing a second component description, the second component description describing an input condition of the second component with a set of tags; determining that the first component can be connected to the second component if the set of tags describing the output object includes all tags describing the input condition; and including the first and second connected components in a processing graph if they are connected to each other. | 07-09-2009 |
20090249370 | METHOD AND APPARATUS FOR DYNAMIC WEB SERVICE COMPOSITION AND INVOCATION - A method for service invocation, including: receiving a first request for a service to be invoked, wherein the first request includes a semantic description of the service; creating a processing graph for the first request from planning domain descriptions of a plurality of services; deploying the processing graph in an execution environment as a composite service; invoking the composite service; and returning a response provided by the invoked composite service. | 10-01-2009 |
20090265718 | METHOD AND SYSTEM FOR DYNAMIC SOFTWARE RECONFIGURATION TRIGGERED BY COMPONENT- OR SYSTEM- INITIATED EVENTS - A method for handling events in compositional applications represented as processing graphs, including: receiving an event notification; modifying a planning domain according to the event notification; generating a new processing graph for a previously deployed processing graph by using the modified planning domain; determining if the new processing graph is different than the previously deployed processing graph; and if the processing graphs are different: reconfiguring the previously deployed processing graph to match the new processing graph; or deploying the new processing graph and replacing the previously deployed processing graph with the newly deployed processing graph. | 10-22-2009 |
20090276753 | METHOD AND APPARATUS FOR SIMPLIFIED ASSEMBLY OF PARAMETRIC INFORMATION PROCESSING APPLICATIONS - A method for assembling parametric information processing applications, includes: receiving a composition request; composing a processing graph for the request, wherein the processing graph represents an application that includes at least one component; identifying a deployment parameter of the component and requesting a value of the parameter; receiving the parameter value; applying the parameter value to the application; and deploying the application with the parameter value in an execution environment. | 11-05-2009 |
20090282415 | Method and Apparatus for Negotiation Management in Data Processing Systems - Techniques are disclosed for optimizing schedules used in implementing plans for performing tasks in data processing systems. For example, an automated method of negotiating for resources in a data processing system, wherein the data processing system comprises multiple sites, comprises a negotiation management component of a computer system at a given one of the sites performing the following steps. One or more tasks from at least one source of one or more plans are obtained. Each plan is annotated with one or more needed resources and one or more potential resource providers at one or more sites in the data processing system. An optimized resource negotiation schedule based on the one or more obtained tasks is computed. The schedule comprises an order in which resources are negotiated. In accordance with the optimized resource negotiation schedule, a request for each needed resource is sent to the one or more potential resource providers such that a negotiation process is performed between the negotiation management component and at least one of the potential resource providers. | 11-12-2009 |
20090282487 | Method of Managing and Mitigating Security Risks Through Planning - An exemplary method is provided for managing and mitigating security risks through planning. A first security-related information of a requested product is received. A second security-related information of resources that are available for producing the requested product is received. A multi-stage process with security risks managed by the first security-related information and the second security-related information is performed to produce the requested product. | 11-12-2009 |
20100095267 | DESCRIBING FORMAL END-USER REQUIREMENTS IN INFORMATION PROCESSING SYSTEMS USING A FACETED, TAG-BASED MODEL - A method, including: providing a computer menu from which a processing goal can be created, wherein the menu includes a plurality of facets, and wherein each facet includes at least one tag; receiving a processing goal, wherein the processing goal includes a plurality of tags selected from the menu; executing at least one application that includes a plurality of components arranged in a processing graph to produce information that satisfies the processing goal; and outputting the information. | 04-15-2010 |
20100095269 | FACETED, TAG-BASED APPROACH FOR THE DESIGN AND COMPOSITION OF COMPONENTS AND APPLICATIONS IN COMPONENT-BASED SYSTEMS - A method, including: receiving a software requirement; and constructing a workflow template that can satisfy the software requirement, wherein the workflow template comprises a plurality of processing stages, wherein each processing stage includes at least one component class and each component class includes at least one component, and wherein an output of each processing stage is described by a processing goal pattern that is described by a set of tags and facets. | 04-15-2010 |
20100242120 | Mitigating and managing privacy risks using planning - System and methods are provided for managing and mitigating privacy risks in a system having a network of processing elements. According to one method, there is receive a request for at least one output product from the system. The request includes a set of privacy parameters. At least one set of workflow generating strategies are created that results in the output product having a privacy risk value below a predefined threshold. At least one of the workflow generating strategies is deployed for automatically producing the at least one output product. | 09-23-2010 |
20110004863 | METHOD AND SYSTEM FOR AUTOMATICALLY ASSEMBLING PROCESSING GRAPHS IN INFORMATION PROCESSING SYSTEMS - A method for assembling processing graphs in an information processing system, includes: performing, in an offline manner, translating a plurality of component descriptions into a planning language and performing reasoning on the plurality of component descriptions during the translation; and performing, in an online manner, receiving a processing request that specifies a desired processing outcome; translating the processing request into a planning goal; and assembling a plurality of processing graphs, each of the processing graphs including a plurality of the translated and reasoned components that satisfy the desired processing outcome. | 01-06-2011 |
20110185339 | AUTOMATING THE CREATION OF AN APPLICATION PROVISIONING MODEL - An application provisioning model is automatically created. The model is created from a high-level application and specifies dependencies of the application. It is used to provision the application on one or more nodes or other actions. | 07-28-2011 |
20110185346 | AUTOMATED BUILDING AND RETARGETING OF ARCHITECTURE-DEPENDENT ASSETS - Architecture-dependent assets are automatically built and retargeted. An asset originally built for one architecture is downloaded and automatically retargeted on another architecture. This automatically retargeting may be performed on demand, at runtime. | 07-28-2011 |
20110191273 | Evaluating ontologies - A method for providing an evaluation/verification of the correctness of an ontology is described. The method includes loading a first ontology associated with a first rule set. an extended ontology and an extended rule set are generated based at least in part on the first ontology and the first rule set. The extended rule set is applied to the extended ontology. The method also includes determining (e.g., by a data processor) a correctness of the extended ontology. Results are generated which include the correctness. Apparatus and computer readable media are also described. | 08-04-2011 |
20120233590 | Sharing of Flows in a Stream Processing System - Techniques for generating code for a flow are provided. The techniques include receiving a flow for an application to be deployed, wherein the flow comprises one or more sub-flows, identifying sub-flows of the flow that match existing sub-flows that are already running in separate flows by querying a run-time flow information repository, generating code for the flow, wherein the code comprises newly generated code for each of the sub-flows that do not match existing sub-flows that are already running in separate flows, and wherein the code also comprises one or more connectors to matching sub-flows that are already running in separate flows in lieu of generating new code for the sub-flows that match existing sub-flows that are already running in separate flows, and deploying the generated code for the flow and updating the run-time flow information repository with information pertaining to the flow. | 09-13-2012 |
20140067750 | Cross-Platform Compiler for Data Transforms - Techniques for automatically partitioning a multi-platform data transform flow graph to one or more target output platforms are provided. The techniques include performing type inference on a transform graph, wherein the transform graph comprises one or more data transforms, automatically partitioning the transform graph to one or more target output platforms based on one or more policies, performing an optimization of the partitioned transform graph, and generating code, from the partitioned transform graph, for each set of the one or more data transforms based on the one or more target output platforms. | 03-06-2014 |
20140081896 | Creating Stream Processing Flows from Sets of Rules - Techniques for creating a distributed application flow from a set of rules are provided. The techniques include creating a control-flow graph for each rule, creating one or more dependency links between two or more rules, partitioning a resulting graph, wherein the resulting graph comprises one or more control-flow graphs and one or more dependency links, into one or more operators by determining an optimal set of one or more cuts through the resulting graph such that a cost function is minimized, and generating stream processing flow code from the partitioned graph. | 03-20-2014 |