Abstract: A method, system and computer program product, the method comprising: obtaining transition probabilities, each transition probability associated with transition of a home appliance between states; receiving sensor readings indicating behavior of the home appliance; identifying by the processor a transition event occurring in the sensor readings; determining by the processor a source cluster and a destination cluster associated with the transition event; determining by the processor a duration indicator associated with the transition event; determining by the processor a transition probability by looking up in the transition probabilities, a probability associated with the duration indicator, the source cluster and the destination cluster; comparing by the processor the transition probability to a threshold; and responsive to the transition probability exceeding a threshold, providing an indication of abnormal behavior of the home appliance to a user.

Abstract: A connected directed graphical representation of a process model that includes a plurality of process nodes and interconnections between the process nodes of the process model is displayed. A user selection of a subset of the process nodes of the displayed connected directed graphical representation of the process model is received. A process scope definition represented as at least one begin-end node pair is computed. The at least one begin-end node pair is usable to identify all selected nodes and interconnection path links that are reachable in a traversal from a begin node to an end node of each of the at least one begin-end node pair of the received user selection of the subset of the process nodes. The computed process scope definition is stored.

Abstract: A connected directed graphical representation of a process model that includes a plurality of process nodes and interconnections between the process nodes of the process model is displayed. A user selection of a subset of the process nodes of the displayed connected directed graphical representation of the process model is received. A process scope definition represented as at least one begin-end node pair is computed. The at least one begin-end node pair is usable to identify all selected nodes and interconnection path links that are reachable in a traversal from a begin node to an end node of each of the at least one begin-end node pair of the received user selection of the subset of the process nodes. The computed process scope definition is stored.

Abstract: A previously-computed scope definition represented as at least one begin-end node pair is obtained. The at least one begin-end node pair is usable to identify all nodes and interconnection path links that are reachable in a traversal from a begin node to an end node of each of the at least one begin-end node pair of a selection of a connected directed graphical representation of a process model. A change to the process model relative to the previously-computed scope definition is identified. A type of tooling environment used to change the process model is determined. The tooling environment includes one of a fully-integrated tooling environment and a componentized tool chain tooling environment. The previously-computed scope definition is adapted into an updated process scope definition based upon the identified at least one change to the process model relative to the previously-computed scope definition and the determined type of tooling environment.

Abstract: Storing data records within a log data store is provided. The log data store that stores data records within a plurality of successive non-disjoint layers inserted across a plurality of different types of data storage devices associated with a data processing system is generated. A first non-disjoint layer of the plurality of successive non-disjoint layers is inserted within a main memory device. A set of intermediate non-disjoint layers of the plurality of successive non-disjoint layers is inserted within a set of storage-class memory devices. A last non-disjoint layer of the plurality of successive non-disjoint layers is inserted within a hard disk drive. A size of each successive non-disjoint layer in the plurality of successive non-disjoint layers is increased exponentially. The data records are organized into the plurality of successive non-disjoint layers of the log data store inserted across the plurality of different types of data storage devices.

Abstract: Storing data records within a log data store is provided. The log data store that stores data records within a plurality of successive non-disjoint layers inserted across a plurality of different types of data storage devices associated with a data processing system is generated. A first non-disjoint layer of the plurality of successive non-disjoint layers is inserted within a main memory device. A set of intermediate non-disjoint layers of the plurality of successive non-disjoint layers is inserted within a set of storage-class memory devices. A last non-disjoint layer of the plurality of successive non-disjoint layers is inserted within a hard disk drive. A size of each successive non-disjoint layer in the plurality of successive non-disjoint layers is increased exponentially. The data records are organized into the plurality of successive non-disjoint layers of the log data store inserted across the plurality of different types of data storage devices.

Abstract: A previously-computed scope definition represented as at least one begin-end node pair is obtained. The at least one begin-end node pair is usable to identify all nodes and interconnection path links that are reachable in a traversal from a begin node to an end node of each of the at least one begin-end node pair of a selection of a connected directed graphical representation of a process model. A change to the process model relative to the previously-computed scope definition is identified. A type of tooling environment used to change the process model is determined. The tooling environment includes one of a fully-integrated tooling environment and a componentized tool chain tooling environment. The previously-computed scope definition is adapted into an updated process scope definition based upon the identified at least one change to the process model relative to the previously-computed scope definition and the determined type of tooling environment.

Abstract: A connected directed graphical representation of a process model that includes a plurality of process nodes and interconnections between the process nodes of the process model is displayed. A user selection of a subset of the process nodes of the displayed connected directed graphical representation of the process model is received. A process scope definition represented as at least one begin-end node pair is computed. The at least one begin-end node pair is usable to identify all selected nodes and interconnection path links that are reachable in a traversal from a begin node to an end node of each of the at least one begin-end node pair of the received user selection of the subset of the process nodes. The computed process scope definition is stored.

Abstract: A previously-computed scope definition represented as at least one begin-end node pair is obtained. The at least one begin-end node pair is usable to identify all nodes and interconnection path links that are reachable in a traversal from a begin node to an end node of each of the at least one begin-end node pair of a selection of a connected directed graphical representation of a process model. A change to the process model relative to the previously-computed scope definition is identified. A type of tooling environment used to change the process model is determined. The tooling environment includes one of a fully-integrated tooling environment and a componentized tool chain tooling environment. The previously-computed scope definition is adapted into an updated process scope definition based upon the identified at least one change to the process model relative to the previously-computed scope definition and the determined type of tooling environment.

Abstract: A connected directed graphical representation of a process model that includes a plurality of process nodes and interconnections between the process nodes of the process model is displayed. A user selection of a subset of the process nodes of the displayed connected directed graphical representation of the process model is received. A process scope definition represented as at least one begin-end node pair is computed. The at least one begin-end node pair is usable to identify all selected nodes and interconnection path links that are reachable in a traversal from a begin node to an end node of each of the at least one begin-end node pair of the received user selection of the subset of the process nodes. The computed process scope definition is stored.

Abstract: Storing data records within a log data store is provided. The log data store that stores data records within a plurality of successive non-disjoint layers inserted across a plurality of different types of data storage devices associated with a data processing system is generated. A first non-disjoint layer of the plurality of successive non-disjoint layers is inserted within a main memory device. A set of intermediate non-disjoint layers of the plurality of successive non-disjoint layers is inserted within a set of storage-class memory devices. A last non-disjoint layer of the plurality of successive non-disjoint layers is inserted within a hard disk drive. A size of each successive non-disjoint layer in the plurality of successive non-disjoint layers is increased exponentially. The data records are organized into the plurality of successive non-disjoint layers of the log data store inserted across the plurality of different types of data storage devices.

Abstract: Storing data records within a log data store is provided. The log data store that stores data records within a plurality of successive non-disjoint layers inserted across a plurality of different types of data storage devices associated with a data processing system is generated. A first non-disjoint layer of the plurality of successive non-disjoint layers is inserted within a main memory device. A set of intermediate non-disjoint layers of the plurality of successive non-disjoint layers is inserted within a set of storage-class memory devices. A last non-disjoint layer of the plurality of successive non-disjoint layers is inserted within a hard disk drive. A size of each successive non-disjoint layer in the plurality of successive non-disjoint layers is increased exponentially. The data records are organized into the plurality of successive non-disjoint layers of the log data store inserted across the plurality of different types of data storage devices.

Abstract: A method for modeling, validating, and monitoring a service level agreement (SLA) associated with a business process is disclosed herein. Such a method may include providing a library of reusable SLA component types. Functionality may be provided to enable a user to create SLA components from the reusable SLA component types. Functionality may also be provided to enable the user to assemble the SLA components into an SLA model having a hierarchy. In the SLA model, events may be passed between the SLA components to trigger behavior by the SLA components. SLA components at the lowest levels of the hierarchy may be configured to receive events from the business process. The method may further validate the SLA model against the business process to ensure the business process can generate the events required by the SLA components. A corresponding apparatus and computer program product are also disclosed herein.

Abstract: A method for modeling, validating, and monitoring a service level agreement (SLA) associated with a business process is disclosed herein. Such a method may include providing a library of reusable SLA component types. Functionality may be provided to enable a user to create SLA components from the reusable SLA component types. Functionality may also be provided to enable the user to assemble the SLA components into an SLA model having a hierarchy. In the SLA model, events may be passed between the SLA components to trigger behavior by the SLA components. SLA components at the lowest levels of the hierarchy may be configured to receive events from the business process. The method may further validate the SLA model against the business process to ensure the business process can generate the events required by the SLA components. A corresponding apparatus and computer program product are also disclosed herein.

Abstract: In a database system, derived data (often called view data or view tables) depends on other data, often called base data (or base tables). When base data on which derived data depends is updated, including changes, additions, and/or deletions, those updates need to be propagated to derived data. Some types of updates, if repeated, result in an incorrect view data state; these updates are termed non-idempotent. To avoid repeating non-idempotent view data updates, signatures are computed that are repeatable, but yet unique to base data on which the view data is based, the view data being updated, and sequence information for updates to the base data (where applicable) and sequence data for multiple changes to the view being updated. The signatures allow detection of view updates that were committed prior to a failure, but which were not confirmed as having been committed to a process that computes the view updates.

Abstract: Aspects relate to maintaining, with a concurrent plurality of view managers, an aggregate view record that is derived from base data being updated. The aggregate view record is stored in a storage device. In a first example, a given base data update is propagated by one of the view managers reading a value from the aggregate view record and a sequence number, determining an updated value using the base data update, and submitting the updated value for writing, with the sequence number. The sequence number submitted with the writing is compared to a then-current sequence number stored in the storage device, and if there is a mismatch, then the view manager repeats the reading, determining, and submitting until there is no mismatch. A number of variations exist for different types of aggregates, which include counting, averaging, summing, and tracking minima and maxima.

Abstract: Methods, systems and computer program products for inferential business process monitoring. Exemplary embodiments include an inferential business process monitoring method, including deriving an optimal set of key performance indicators from a service level agreement specification, determining metrics to compute the key performance indicators from the service level agreement specification, assigning and configuring monitoring agents to retrieve the metrics to obtain the key performance indicators, deploying the monitoring agents and delivering key performance indicator metrics observed by the monitoring agents.

Abstract: Aspects include mechanisms for design and analysis of flows of information in a database system from updates to base table records, through one or more log segments, to a plurality of view managers that respectively execute operations to update view table records. Mechanisms allow any base table record to be used by any view manager, so long as the view managers are using that base table record to update different view table records. Mechanisms also allow any number of view table records to be updated by any number of view managers, based on respective base table records. Mechanisms prevent the same view record from being used as a basis for updating the same base table record by more than one view manager, thereby preventing a conflict where updated information from one base table record is used more than once for updating a single view table record.

Abstract: An improved system and method for applying once a transaction delivered in a message published asynchronously in a distributed database is provided. In various embodiments, apply once messaging may be achieved for asynchronous publication by having a persistent log stored on a messaging server. A messaging server may receive an update message for a transaction to be published asynchronously in a distributed database, may generate a sequence number for the transaction in a message, and may log the update message with the sequence number in a log file persistently stored on the messaging server. The messaging server may then send an acknowledgement that the update message is published and may asynchronously publish the update message with the sequence number to subscribers. The publication may only succeed if there may not be any message tagged with a sequence number that has been previously published by the messaging server.

Abstract: The invention relates to a system and a method for tracking and executing a job comprising a series of tasks. Each task is executable on a separate computing device. The method comprises: utilizing a workload manager to identify an initial schedule of implementation for the job; utilizing agents to selectively control execution of the tasks; and for each agent, utilizing a publish/subscription interface to isolate communications of the workload manager from each agent and to communicate with other publish/subscription interfaces of other agents to determine when to activate its task. The interface utilizes a broker adapted to communicate with other brokers to disseminate communications amongst the agents.