The disclosure relates to predicting a demand based on a time-series prediction. In an embodiment, a method is disclosed which includes generating a predicted metric for a future time period; loading a plurality of rules, a given rule in the plurality of rules mapping an amount of the predicted metric to a demand amount; applying the plurality of rules to the predicted metric to compute a set of demand amounts; aggregating the set of demand amounts; and generating a predicted demand based on the aggregated demand amounts.

The disclosure relates to predicting a demand based on a time-series prediction. In an embodiment, a method is disclosed which includes generating a predicted metric for a future time period; loading a plurality of rules, a given rule in the plurality of rules mapping an amount of the predicted metric to a demand amount; applying the plurality of rules to the predicted metric to compute a set of demand amounts; aggregating the set of demand amounts; and generating a predicted demand based on the aggregated demand amounts.

Information defining a plurality of states, a plurality of transitions, an initial state, and a final state is received from a user. The user may also provide additional information including pre-conditions and post-conditions for one or more transitions. Context information including one or more context variables and context variable values is generated based on the information provided by the user. A first plurality of possible paths between the initial state and the final state is automatically identified, wherein each path traverses at least one state and at least one transition. A second plurality of paths is identified from among the plurality of paths, based on the context information and the pre-conditions defined by the user. A Q-value is determined for each path in the second plurality of paths, using the rewards. A path having a highest Q-value is selected and presented to the user as a BPM. An acceptance or rejection of the proposed BPM is received from the user. Reward values associated with transitions in the selected path are updated, if the user accepts the proposed BPM.

A facility for creating resource graphs based on inherent and derived resource attributes is configured to assist domain experts in the processing and analyses of resource data. The facility obtains input indicating inherent resource attributes and relationships to other the resource attributes. The facility identifies derived resource attributes based on the inherent resource attributes and the relationships to other resource attributes. The facility generates a resource graph based on the derived resource attributes, inherent resource attributes, and the relationships. The facility obtains attributed data from a repository of resource attribute data and evaluates the resource data based on the resource graph and attribute data.

The exemplary embodiments disclose a method, a computer program product, and a computer system for managing environment change. The exemplary embodiments may include determining a plurality of change and risk models for a plurality of computing environments, generating a plurality of association rules based on the plurality of change and risk models, and generating a joint association rule by combining at least two of the plurality of association rules, wherein the joint association rule indicates, from the three dimensions, an association relationship between changes and risk events over at least a part of the time series.

Diffusing a root identity of an entity among association and event covenants in a multi-dimensional computing security system involves generating a first generation of diffusion of identities of entities participating in mediated association and generating a second generation of diffusion of identities of the entities through recombinant mediated association of the entities and at least one other entity. The second generation of diffusion of identities facilitates securely constraining a computing system action associated with one of the entities.

Diffusing a root identity of an entity among association and event covenants in a multi-dimensional computing security system involves generating a first generation of diffusion of identities of entities participating in mediated association and generating a second generation of diffusion of identities of the entities through recombinant mediated association of the entities and at least one other entity. The second generation of diffusion of identities facilitates securely constraining a computing system action associated with one of the entities.

A coordinating apparatus selects discrete systems that simulate behavior of an actual environment and outputs an indicator value related to the actual environment, shares internal states related to the actual environments obtained on a basis of the behavior simulated by the discrete systems selected in the selection process, generates a shared internal state, decides such an action that a post-coordination integrated indicator value obtained by integrating a post-coordination indicator value from the discrete systems when the discrete systems are coordinated is optimized, the action being should be taken and being able to be taken by the discrete systems on a basis of the shared internal state in a case where the discrete systems are coordinated, determines whether or not the discrete systems should be coordinated on a basis of the post-coordination indicator values, and the indicator value from each of the discrete systems, and outputs a determination result.

A coordinating apparatus selects discrete systems that simulate behavior of an actual environment and outputs an indicator value related to the actual environment, shares internal states related to the actual environments obtained on a basis of the behavior simulated by the discrete systems selected in the selection process, generates a shared internal state, decides such an action that a post-coordination integrated indicator value obtained by integrating a post-coordination indicator value from the discrete systems when the discrete systems are coordinated is optimized, the action being should be taken and being able to be taken by the discrete systems on a basis of the shared internal state in a case where the discrete systems are coordinated, determines whether or not the discrete systems should be coordinated on a basis of the post-coordination indicator values, and the indicator value from each of the discrete systems, and outputs a determination result.

A computer-implemented method includes storing hierarchical data in a data structure including first and second levels, a first set of nodes assigned to the first level, and a second set of nodes assigned to the second level. Each of the second set of nodes is associated with one of the first set of nodes. The second level is outward of the first level. The instructions include, for each node of the first set of nodes without an associated node at the second set of nodes, adding a ghost node to the second set of nodes and associating the ghost node with the each node. The instructions include counting the second set of nodes (including ghost nodes) and determining angular positions for the second set of nodes based on the count. The instructions include generating a radial graphical visualization by plotting a radial view based on the angular positions.