Abstract: An unknown annotator and its annotation type system are compared against a reference annotation type system. The comparison is done by providing a plurality of documents, and annotating each document using the reference set of document annotators, producing instances of reference annotation types, to generate a pre-annotated reference document set, and using the subject annotator and its subject annotation type system to generate a pre-annotated evaluation document set. Documents in the pre-annotated evaluation document set are compared to documents in the pre-annotated reference document set, and matches in location, within the compared documents, of instances of the subject annotation types and the reference annotation types are identified. Based on the matching data, reference document annotation types are selected that sufficiently correlate with the subject annotation type system.

Abstract: A method for processing requests from a client to a server, the method comprising: receiving a service request from the client at a service manager implemented on the server; negotiating the type of workflow engine to use between the server and the client; negotiating the type of notification to use between the server and the client; receiving a further service request from the client at the service manager, the further service request using the negotiated type of workflow engine and the negotiated type of notification; creating a surrogate client executing on the server, the surrogate client interfacing the client with a service provider application executing on the server; providing a reference to the surrogate client to the client; the surrogate client receiving requests from the client and forwarding a surrogate request to the service provider application, the surrogate request including a predicted request based on multiple requests from the client; and the surrogate client receiving a notification from

Abstract: A document corpus is annotated by given annotators and aggregates of the given annotators to generate a corpus of pre-annotated documents with given annotations. The same document corpus is annotated by a subject annotator to have subject annotations. The subject annotations are decomposed into superpositions of the given annotations. The decomposed subject annotations are mapped to a most representative superposition of the given annotations. The subject annotator may be mapped to the aggregate of given annotators corresponding to the most representative superposition.

Abstract: A system and method for provisioning software on a plurality of computational nodes in a distributed computing environment. A plurality of support processing requirements associated with a software product is accepted. The plurality of requirements is expanded into multiple sets of installation requirements. At least one set of installation requirements in the multiple sets of installation requirements are minimized to produce at least one minimized set of installation requirements. A determination is made as to whether any pair of requirements in the minimized set of installation requirements includes a pair of conflicting requirements. A determination of whether the software product allows each requirement in the pair of conflicting requirements to be located on separate nodes is also made. At least one multi-node installation topology is determined for the software product.

Abstract: A system and method for generating throttling parameters for an information management (IT) system based on historical event log data. The system comprises: an identification system that examines the historical event log data and identifies throttling candidates, wherein each throttling candidate comprises an event type for redundant events that reoccur over at least one measured time period; and an analysis system that statistically analyzes event data associated with each throttling candidate and generates a set of throttling parameters for each throttling candidate based on the event data.

Abstract: Improved problem diagnosis techniques for use in accordance with computing systems, e.g., distributed computing systems, are disclosed. In one aspect of the invention, a technique for diagnosing a problem associated with a computing system comprises the following steps/operations. One or more probes are executed in accordance with at least a portion of a previously selected probe schedule. When a result of one or more of the probes of the previously selected probe schedule indicates, at least, a potential problem associated with the computing system, one or more probes which optimize at least one criterion are selected in real-time. The one or more selected probes are executed so as to diagnose the potential problem.

Abstract: A system and program product for generating throttling parameters for an information management (IT) system based on historical event log data. An embodiment of the system comprises: an identification system that examines the historical event log data and identifies throttling candidates, wherein each throttling candidate comprises an event type for redundant events that reoccur over at least one measured time period; and an analysis system that statistically analyzes event data associated with each throttling candidate and generates a set of throttling parameters for each throttling candidate based on the event data.

Abstract: A rule set to convert an event into a standardized format can be established based on cooperation among peer processing nodes. A processing node that receives the event takes the initial responsibility to convert the event. The responsible processing node initially attempts to convert the event using locally available rules. If the initial attempt fails, the responsible processing node will communicate the event to peer processing nodes and request them to provide conversion rules. Upon receipt of the rules provided by the peer processing nodes, the responsible processing node combines the received rules with the locally available rules to generate a rule set to convert the event. The responsible processing node may also transfer the event to another processing node for the other processing node to take the responsibility to convert the event.

Abstract: The present invention is a method and apparatus for safe ontology reasoning. In one embodiment, a method for building safe sub-ontology that includes one or more elements of a given ontology includes designating at least one the elements as a sensitive element, where a sensitive element is an element not to be revealed. The method then designates a safe sub-ontology such that the safe sub-ontology does not include any elements that, alone or in combination, allow inference of a sensitive element, in accordance with one or more given inference rules. In another embodiment, a method for building a potential sub-ontology includes designating at least one of the elements as a sensitive element and including a maximal number of the elements in the potential sub-ontology, wherein the maximal number includes the greatest number of elements that can be revealed, cumulatively, without allowing inference of a sensitive element, in accordance with one or more given inference rules.

Abstract: Techniques for parsing rule creation are provided. A technique for constructing one or more message parsing rules may comprise the following steps. First, message data representing past messages, for example, associated with a network, an application and/or a system being analyzed, is obtained. For example, this may involve reading the past or historical message data from messages logs or having a system point to the message data in existing data storage. Parsing rules are then generated by a process from one or more existing rule templates and/or based on user selection and classification of at least a portion of a message. For example, the user may choose a message part and demonstratively classify the part, for example, as a positive or negative example. The generated rules may then be stored for access by a rule-based parsing system such as a message adaptation system.

Abstract: In the context of screens, windows and like media, arrangements for automatically detecting when a recipient has entered or left a public setting so that privacy configuration changes can be automatically invoked. Also broadly contemplated herein is an arrangement for selectively displaying messages on the recipient's screen but deferring the messages from being visible on a remote hardware device or software display which is publicly visible. Furthermore, there is broadly contemplated herein a secure arrangement for revealing and responding to deferred messages. More generally, there is broadly contemplated herein a new approach to the provision of application notifications and to alarm control during a desktop screen sharing mode, based on the automatic detection of a screen sharing state and on notifying registered applications of the screen sharing in a unified, consistent manner.

Abstract: A system, method and computer program product for virtual communities that enables the establishment of rules created by members of the society in accordance with the existing rule creation restrictions and, that provides a mechanism for validating and accepting of the rules established inside the society. The system, method and computer program product further provides a mechanism that enables the establishment of rules created by members of the virtual society themselves, that allows for the self-evolution of the virtual societies.

Abstract: Embodiments of the present invention address deficiencies of the art in respect to server provisioning in a heterogeneous computing environment and provide a method, system and computer program product for secure and verified distributed orchestration and provisioning. In one embodiment of the invention, a server provisioning method can be provided. The server provisioning method can include establishing grouping criteria, grouping different target computing nodes into different groups of target computing nodes according to the established grouping criteria, server provisioning a root node in each of the different groups of target computing nodes, and relying upon the root node in each of the different groups to peer-to-peer server provision remaining nodes in each of the different groups.

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

Abstract: In general, the present invention provides a method, system and program product for approximating/estimating computer resource consumption of a computer system. Specifically, under the present invention, a more efficient or reduced computer work gradient matrix (hereinafter “matrix”) is first built. This occurs by creating load measurements for a set of computer resource metrics of the computer system to analyze dependencies between different computer resource metrics. Then, a correlation matrix between the set of computer resource metrics is created based on the dependencies. The set of computer system resource metrics in the correlation matrix is thereafter clustered into a set of clusters, and a reduced matrix is built based thereon. Once the reduced matrix is built, it can be restored to a “full” matrix using linear transformation or the like.

Abstract: Techniques for parsing rule creation are provided. A technique for constructing one or more message parsing rules may comprise the following steps. First, message data representing past messages, for example, associated with a network, an application and/or a system being analyzed, is obtained. For example, this may involve reading the past or historical message data from messages logs or having a system point to the message data in existing data storage. Parsing rules are then generated by a process from one or more existing rule templates and/or based on user selection and classification of at least a portion of a message. For example, the user may choose a message part and demonstratively classify the part, for example, as a positive or negative example. The generated rules may then be stored for access by a rule-based parsing system such as a message adaptation system.

Abstract: A system, method, and computer program product for provisioning software on at least one node in a plurality of computational nodes in a distributed information processing system are disclosed. The method includes accepting a plurality of requirements associated with a software product. The plurality of requirements is expanded into multiple sets of installation requirements. At least one set of installation requirements in the multiple sets of installation requirements is minimized to produce at least one minimized set of installation requirements. At least one installation topology is determined using Rough Set Theory for the software product based on the at least one minimized set of installation requirements. The at least one installation topology is compared to a set of capabilities included on at least one computational node to determine a respective set of missing resources for the at least one computational node.

Abstract: Under the present invention, it is determined whether sufficient resources exist for deploying a platform dependent application on its specific “native” platform in a grid environment. If not, a platform dependent portion of the application is identified, and the application is split into the platform dependent portion and a platform independent portion. Thereafter, the platform dependent portion is deployed on its corresponding native platform, while the platform independent portion is deployed on another platform in the grid environment based on available resources. Interconnections between the two portions can then be automatically generated. This can include, for example, creating remote method invocation facade interfaces, creating remote method invocation-enabled facade classes, and building a remote method invocation server for the first platform.

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

Abstract: The present invention is a method and apparatus for safe ontology reasoning. In one embodiment, a method for building safe sub-ontology that includes one or more elements of a given ontology includes designating at least one the elements as a sensitive element, where a sensitive element is an element not to be revealed. The method then designates a safe sub-ontology such that the safe sub-ontology does not include any elements that, alone or in combination, allow inference of a sensitive element, in accordance with one or more given inference rules. In another embodiment, a method for building a potential sub-ontology includes designating at least one of the elements as a sensitive element and including a maximal number of the elements in the potential sub-ontology, wherein the maximal number includes the greatest number of elements that can be revealed, cumulatively, without allowing inference of a sensitive element, in accordance with one or more given inference rules.