Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: A method, system and computer program product for matching an entry of a list to data. The method includes the steps of: generating source code which matches at least a part of said list with said data; compiling said source code into binary code; and determining a match between said list and said data using said compiled binary code wherein at least one of the steps is carried out using a computer device.

Abstract: An apparatus to facilitate design of a stream processing flow that satisfies an objective, wherein the flow includes at least three processing groups, wherein a first processing group includes a data source and an operator, a second processing group includes a data source and an operator and a third processing group includes a join operator at its input and another operator, wherein data inside each group is organized by channels and each channel is a sequence of data, wherein an operator producing a data channel does not generate new data for the channel until old data of the channel is received by all other operators in the same group, and wherein data that flows from the first and second groups to the third group is done asynchronously and is stored in a queue if not ready for processing by an operator of the third group.

Abstract: A method for service composition whereby a tag query is received and a processing graph is composed in accordance with the tag query. The processing graph is composed by using annotated primal data and services. The processing graph includes at least one of the services. The service included in the processing graph is deployed in an execution environment.

Abstract: In a method for visualizing query results in stream processing systems, a visualization service receives a query from a client to visualize data in a stream processing application. The query is sent from the visualization service to a query-able operator of the stream processing application. At the query-able operator, an operation is performed using history data in the query-able operator to produce a first result that satisfies the query and the first result is sent to the visualization service. At the query-able operator, another operation is performed using new data received by the query-able operator to produce a second result that satisfies the query and the second result is sent to the visualization service. The first and second results are output from the visualization service to the client.

Abstract: A method for service composition whereby a tag query is received and a processing graph is composed in accordance with the tag query. The processing graph is composed by using annotated primal data and services. The processing graph includes at least one of the services. The service included in the processing graph is deployed in an execution environment.

Abstract: A system, method, and computer program product for benchmarking a stream processing system are disclosed. The method comprises generating a plurality of correlated test streams. A semantically related data set is embedded within each of the test streams in the plurality of correlated test streams. The plurality of correlated test streams is provided to at least one stream processing system. A summary is generated for each of the semantically related embedded data sets. A common identifier, which is transparent to the system being tested, is embedded within each stream in the plurality of correlated test streams. The common identifier is extracted from the output data set generated by the stream processing system. At least one of the stored copies of the summaries and the common identifier are compared to an output data set including a set of zero or more correlation results generated by the stream processing system.

Abstract: In a method for visualizing query results in stream processing systems, a visualization service receives a query from a client to visualize data in a stream processing application. The query is sent from the visualization service to a query-able operator of the stream processing application. At the query-able operator, an operation is performed using history data in the query-able operator to produce a first result that satisfies the query and the first result is sent to the visualization service. At the query-able operator, another operation is performed using new data received by the query-able operator to produce a second result that satisfies the query and the second result is sent to the visualization service. The first and second results are output from the visualization service to the client.

Abstract: A method and computer program product for assembling and deploying multi-platform flow based applications. An information processing flow that produces a result is assembled, the information processing flow includes components connected by data links, a component includes software code that describes at least one of an input constraint or an output constraint of the component, and at least two of the components are deployable on different computing platforms. The information processing flow is partitioned into sub-flows, such that for each sub-flow every component in the sub-flow is deployable on the same computing platform. The sub-flows are deployed on their respective computing platforms.

Abstract: A method and system for optimizing a configuration of a set of LPARs and a set of servers that host the LPARs. Configuration data and optimization characteristics are received. By applying the configuration data and optimization characteristics, a best fit of the LPARs into the servers is determined, thereby determining an optimized configuration. The best fit is based on a variant of bin packing or multidimensional bin packing methodology. The optimized configuration is stored. In one embodiment, comparisons of shadow costs are utilized to determine an optimal placement of the LPARs in the servers. LPAR(s) in the set of LPARs are migrated to other server(s) in the set of servers, which results in the LPARs and servers being configured in the optimized configuration.

Abstract: One embodiment of the present method and apparatus for synthesizing a data stream includes retrieving meta data from at least one decision tree, the decision tree comprising a plurality of interconnected nodes, and generating the data stream in accordance with the meta data.

Abstract: An apparatus, including a memory device for storing a program, and a processor in communication with the memory device, the processor operative with the program to facilitate design of a stream processing flow that satisfies an objective, wherein the stream processing flow includes at least three processing groups, wherein a first processing group includes a data source and an operator, a second processing group includes a data source and an operator and a third processing group includes a join operator at its input and another operator, wherein data inside each group is organized by channels and each channel is a sequence of data, wherein an operator producing a data channel does not generate new data for the channel until old data of the channel is received by all other operators in the same group, and wherein data that flows from the first and second groups to the third group is done asynchronously and is stored in a queue if not ready for processing by an operator of the third group, and deploy the stream

Abstract: One embodiment of the present method and apparatus for identifying a conversing pair of users of a two-way speech medium includes receiving a plurality of binary voice activity streams, where the plurality of voice activity streams includes a first voice activity stream associated with a first user, and pairing the first voice activity stream with a second voice activity stream associated with a second user, in accordance with a complementary similarity between the first voice activity stream and the second voice activity stream.

Abstract: 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.

Abstract: 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.

Abstract: A system, method, and computer program product for benchmarking a stream processing system are disclosed. The method comprises generating a plurality of correlated test streams. A semantically related data set is embedded within each of the test streams in the plurality of correlated test streams. The plurality of correlated test streams is provided to at least one stream processing system. A summary is generated for each of the semantically related embedded data sets. A common identifier, which is transparent to the system being tested, is embedded within each stream in the plurality of correlated test streams. The common identifier is extracted from the output data set generated by the stream processing system. At least one of the stored copies of the summaries and the common identifier are compared to an output data set including a set of zero or more correlation results generated by the stream processing system.

Abstract: A number of Web 2.0 sites support collaborative tagging systems, which allow users to tag resources with keywords. The tags enable search and retrieval of resources both for the user and for other users, using interfaces like a conventional search form or a tag cloud. A tag hierarchy-based search and retrieval system is provided that enhances the existing interfaces by improving search recall and allowing the discovery of even poorly annotated resources. The system uses tag co-occurrence information to automatically learn tag hierarchies. The learned hierarchies are used for automatically inferring additional tags to resources. These inferences are used to improve the recall of queries issued from a search form or via a tag cloud. The learned hierarchies can be viewed as an emergent ontology that is built up through the collaborative wisdom of a large number of users.