Abstract: A method of scheduling a print job may include determining a first set of deployments that includes one or more deployments. Each deployment in the first set may include an indication of a logical device in a cloud environment and an indication of a production center. The method may include for one or more deployments in the first set of deployments, determining a total compliance value associated with the deployment, identifying a subset of deployments based on, at least in part, the associated total compliance values, generating a new set of deployments based on, at least in part, the identified subset of deployments, and in response to the first set of deployments being an improvement over the new set of deployments, incrementing a count variable, and repeating the determining a total compliance value, identifying, and generating operations until the count variable equals an exit condition value.

Abstract: A method, a system, and a computer program product for translating a document are disclosed. A document in a source language is received and text snippets are extracted from the same. The text snippets are sent to a first set of remote workers for translation and a second set of remote workers for validation. The words in the validated text snippets are assigned a probability score. The words with the highest probability score are combined to generate the translated document.

Abstract: A method, a system and a computer program product for handling requests in a network are disclosed. A load pattern at a first service component is extracted. A capacity and pending requests at the first service component are calculated based on the load pattern. Thereafter, an insertion delay is calculated based on the capacity, pending requests, and a time period required to increase the capacity by applying various alternative adaptation techniques. The insertion delay is then distributed among a plurality of upstream service components.

Abstract: Methods and systems of performing data mining may include receiving a plurality of web log records and a plurality of call log records; associating one or more web log records with a call log record, wherein the associated user for each of the associated one or more web log records and the call log record are the same; identifying one or more patterns among the web log records for the plurality of call log records, wherein each pattern comprises one or more web accesses, a time stamp at which each of the one or more web accesses is performed and the call topic for the call log record; identifying one or more web log records associated with a new call, and predicting a call topic for the new call based on at least one pattern and the one or more web log records.

Abstract: Methods and systems for identifying a trustable workflow based on a comprehensive trust model. One or more trustable links between two or more abstract services among a number of combinations of concrete services can be searched and the trustable link combined to realize an abstract workflow so as to construct a candidate trustable workflow space. The K trustable workflows can be determined by randomly selecting the trustable link with respect to each pair of connected abstract services and combining the selected trustable links. The trustable link in the workflow can be selected to be replaced with another candidate trustable link to provide a higher selection probability to the trustable link in a critical path.

Abstract: A method for computing the energy rating for cloud-based software services is disclosed. For each of the service, following steps are performed. The method includes identifying configuration parameters impacting the energy consumption. The method further includes determining a value for each configuration parameter. Further, the method includes determining a relative energy rating using a pre-determined equation, based on the values of the configuration parameter. Finally, the method includes assigning a discrete value based on the range of the relative energy rating.

Abstract: Embodiments relate to systems and methods for self-adaptive episode mining under time threshold using delay estimation and temporal division. An episode mining engine can analyze a set of episodes captured from a set of network resources to detect all sequences of user-specified frequency within a supplied runtime budget or time threshold. The engine can achieve desired levels of completeness in the results by mining the input log file in multiple stages or steps, each having successively longer lengths of event sequences. After completion of each stage, the engine calculates a remaining amount of runtime budget, and updates the amount of time to be allocated for each of the remaining stages up to a generated maximum stage (or sequence length). The engine thus corrects the estimated remaining time in the runtime budget (or threshold) after each stage, and continues to the next stage until the runtime budget is consumed.

Abstract: The present disclosure relates to dynamically allocating multitier applications based upon performance and reliability of resources. A controller analyzes resources and applications hosted by the resources, and collects operational data relating to the applications and resources. The controller is configured to determine an allocation scheme for allocating or reallocating the applications upon failure of a resource and/or upon rollout or distribution of a new application. The controller generates configuration data that describes steps for implementing the allocation scheme. The resources are monitored, in some embodiments, by monitoring devices. The monitoring devices collect and report the operational information and generate alarms if resources fail.

Abstract: A method of scheduling a print job may include determining a first set of deployments that includes one or more deployments. Each deployment in the first set may include an indication of a logical device in a cloud environment and an indication of a production center. The method may include for one or more deployments in the first set of deployments, determining a total compliance value associated with the deployment, identifying a subset of deployments based on, at least in part, the associated total compliance values, generating a new set of deployments based on, at least in part, the identified subset of deployments, and in response to the first set of deployments being an improvement over the new set of deployments, incrementing a count variable, and repeating the determining a total compliance value, identifying, and generating operations until the count variable equals an exit condition value.

Abstract: The present disclosure relates to dynamically allocating multitier applications based upon performance and reliability of resources. A controller analyzes resources and applications hosted by the resources, and collects operational data relating to the applications and resources. The controller is configured to determine an allocation scheme for allocating or reallocating the applications upon failure of a resource and/or upon rollout or distribution of a new application. The controller generates configuration data that describes steps for implementing the allocation scheme. The resources are monitored, in some embodiments, by monitoring devices. The monitoring devices collect and report the operational information and generate alarms if resources fail.

Abstract: A service workflow including ordered services is received, and a heuristic utility value is calculated for each service. A best node having a smallest heuristic utility value for a service is selected, and a best node identifier is placed in a node list. If the best node includes a parallel sub-workflow, potential next nodes are identified by generating potential next nodes from a data center that can perform a service associated with the best node with a minimum run-time value. Otherwise, potential next nodes are generated based on a data center associated with the service. A heuristic utility value is determined for each potential next node, and a new best node is selected based on the heuristic utility values. The identifying, determining, and selecting operations are repeated until the best node contains only the last ordered service. Data centers for each ordered service are identified based on the best node.

Abstract: Methods and systems for scalable extraction of episode rules using incremental episode tree construction in a multi-application event space comprise compiling events from multiple, different domain logs into in a universal log file, rolling domain-dependent and domain-independent windows through the universal log file to identify distinct event-pattern episodes, adding episodes to an episode tree data structure, pruning less frequent episodes from the episode tree, analyzing the episode tree to identify frequent episode rules, and applying the frequent episode rules to future interactions with users.

Abstract: Methods and systems for partitioning data for processing in a plurality of data centers are disclosed. For each of a plurality of data centers, a time period required for the data center to process an amount of information may be estimated. The plurality of data centers may be ordered based on the time period for each data center. Data may be received from one or more sources. A data center having a smallest time period from the ordered plurality of data centers may be selected to be added to a set of data centers. An overall execution time for the set of data centers to process the data may be determined. The selecting and determining operations may be repeated until the overall execution time satisfies one or more threshold criteria. The data may be transmitted to the set of data centers.

Abstract: An embodiment generally relates to systems and methods for improving system performance by reducing fragility of computing systems. A processing module can identify separate ensemble files each comprising interpretations, by separate entities of a workflow, of a phrase in a file. The processing module can compare the interpretations to determine if the interpretations are the same or essentially the same. If the interpretations are neither the same nor essentially the same, a subsequent entity in the workflow can create a new file that replaces an associated interpretation of the phrase with a common interpretation. The subsequent entity can proceed with an intended operation.

Abstract: A service workflow including ordered services is received, and a heuristic utility value is calculated for each service. A best node having a smallest heuristic utility value for a service is selected, and a best node identifier is placed in a node list. If the best node includes a parallel sub-workflow, potential next nodes are identified by generating potential next nodes from a data center that can perform a service associated with the best node with a minimum run-time value. Otherwise, potential next nodes are generated based on a data center associated with the service. A heuristic utility value is determined for each potential next node, and a new best node is selected based on the heuristic utility values. The identifying, determining, and selecting operations are repeated until the best node contains only the last ordered service. Data centers for each ordered service are identified based on the best node.

Abstract: The present disclosure relates to dynamically allocating multitier applications based upon performance and reliability of resources. A controller analyzes resources and applications hosted by the resources, and collects operational data relating to the applications and resources. The controller is configured to determine an allocation scheme for allocating or reallocating the applications upon failure of a resource and/or upon rollout or distribution of a new application. The controller generates configuration data that describes steps for implementing the allocation scheme. The resources are monitored, in some embodiments, by monitoring devices. The monitoring devices collect and report the operational information and generate alarms if resources fail.

Abstract: A method and apparatus for providing a resource allocation policy in a network are disclosed. For example, the method constructs a queuing model for each application. The method defines a utility function for each application and for each transaction type of each application, and defines an overall utility in a system. The method performs an optimization to identify an optimal configuration that maximizes the overall utility for a given workload, and determines one or more adaptation policies for configuring the system in accordance with the optimal configuration.