Abstract: Embodiments of the present invention provide a method for detecting a temporal change of name associated with performance data. The method comprises receiving at least one candidate name replacement pair comprising a pair of names. The method further comprises, in a training stage, for each known name replacement pair included in the performance data, determining a window of time covering a most recent appearance of a first name of the known name replacement pair. The window of time is determined based on quantitative features of a time series model comprising performance data for the first name and a second name of the known name replacement pair. The method further comprises, in the training stage, training a machine learning classifier based on quantitative features computed using a portion of the performance data for the first name and the second name, where the portion is within the window of time determined.

Abstract: An approach for visualizing versions of a hierarchically organized object is provided. A visualization is generated to include first and second versions including information from multiple hierarchical levels of trees representing the versions. The visualization is generated so that the second version highlights a value of a dimension for a labeled path of the tree representing the second version. The highlighted value differs from a corresponding value of a dimension for a labeled path of the tree representing the first version based on a vector space constructed to have multiple dimensions for each labeled path of the trees. A similarity measure between the first and second versions is computed by normalizing a first vector associated with the first version, normalizing a second vector associated with the second version, and determining a product of the normalized first vector and the normalized second vector.

Abstract: Embodiments of the present invention provide a system, method and computer program product for generating a succinct approximate representation of a time series. A method comprises determining at least one peak data value and at least one trough data value of an input series comprising a sequence of data values over time. The input series is partitioned into multiple segments comprising at least one rising segment that rises to a peak data value and at least one falling segment that falls to a trough data value. A sequence of segments that rise and fall alternately is generated based on the segments. A sequence of totals representing a succinct approximate representation of the input series is generated. Each total comprises a sum of data values for a corresponding segment of the sequence of segments.

Abstract: Embodiments of the present invention provide a system, method and computer program product for selecting representative models. A method comprises generating a first data model representing a first aggregation level, and generating multiple additional data models. Each additional data model represents a lower aggregation level than the first data model. For each additional data model, a corresponding score is determined. For each lower aggregation level, a corresponding combined score is determined based on two or more highest scoring additional data models representing the lower aggregation level. The method further comprises reporting a second aggregation level and a set of data models. The second aggregation level is a lower aggregation level having the highest combined score over all other lower aggregation levels. The set of data models comprises two, or more, highest scoring additional data models representing the second aggregation level.

Abstract: Embodiments of the present invention provide a system, method and computer program product for extrapolating a time series. A method comprises receiving multiple sequences of data values over time. Each sequence of data values is partitioned into a corresponding plurality of segments comprising at least one rising segment that rises to a peak data value of the sequence of data values and at least one falling segment that falls to a trough data value of the sequence of data values. For each sequence of data values, a corresponding sequence of segments that rise and fall alternately is generated based on a corresponding plurality of segments for the sequence of data values. An aggregated sequence of segments is generated by aggregating each sequence of segments generated. The aggregated sequence of segments represents a typical model for the sequences of data values.

Abstract: Embodiments of the present invention provide a system, method and computer program product for forecasting a time series based on actuals and a plan. A method comprises generating a first and a second sequence of segments that rise and fall alternately based on a first and a second sequence of data values over time, respectively. The first and second sequence of data values represent actual data for an ongoing project and estimated data for a planned project, respectively. The method further comprises aligning at least one segment of the second sequence of segments with at least one segment of the first sequence of segments, and adjusting the estimated data by replacing at least one segment of the second sequence of segments with a scaled version of at least one corresponding aligned segment of the first sequence of segments. The scaled version maintains an estimated total for the planned project.

Abstract: Methods and arrangements for providing a compressed representation of a number sequence. An input number sequence is received, as is a stored number sequence. The input number sequence is compared to the stored number sequence. The comparing includes determining a set of coefficients corresponding to the input number sequence, via solving at least one algebraic equation, the at least one algebraic equation comprising at least one of: an arithmetic equation, and an exponential equation. The comparing further includes applying at least one test to determine whether the set of coefficients identifies at least a portion of the stored number sequence as matching the entire input number sequence.

Abstract: An approach for visualizing versions of a hierarchically organized object is provided. A visualization is generated to include first and second versions including information from multiple hierarchical levels of trees representing the versions. The visualization is generated so that the second version highlights a value of a dimension for a labeled path of the tree representing the second version. The highlighted value differs from a corresponding value of a dimension for a labeled path of the tree representing the first version based on a vector space constructed to have multiple dimensions for each labeled path of the trees. A similarity measure between the first and second versions is computed by normalizing a first vector associated with the first version, normalizing a second vector associated with the second version, and determining a product of the normalized first vector and the normalized second vector.

Abstract: An approach for visualizing versions of a hierarchically organized object is presented. A measure of similarity is computed between each version and a standard version. Versions having identical hierarchies are clustered into sets of versions. Versions within each of the sets of versions are organized according to the computed similarity measures. A visualization is generated as a plot having first and second dimensions. The first dimension represents similarity between a set of versions and the standard version. The second dimension represents similarity between a version and the standard version. In one embodiment, the visualization includes, in a first area, information from multiple hierarchical levels of the standard version and includes, in a second area, information from only the root node level of the other versions. After receiving an approval of a version in the second area, the approved version may replace the standard version in the first area.

Abstract: Embodiments of the invention relate to reducing memory required to store an array of formulas and values corresponding to a formula-array. A set of formula-array representations is provided and arranged in a successive order. Each formula-array representation is evaluated for an associated memory requirement to support use thereof, followed by conversion to a structure of the formula-array representation at a successive level. Selection of the formula-array representation is determined based upon a minimal memory requirement from the formula-array representations in the order.

Abstract: An approach for visualizing versions of a hierarchically organized object is presented. A measure of similarity is computed between each version and a standard version. Versions having identical hierarchies are clustered into sets of versions. Versions within each of the sets of versions are organized according to the computed similarity measures. A visualization is generated as a plot having first and second dimensions. The first dimension represents similarity between a set of versions and the standard version. The second dimension represents similarity between a version and the standard version. In one embodiment, the visualization includes, in a first area, information from multiple hierarchical levels of the standard version and includes, in a second area, information from only the root node level of the other versions. After receiving an approval of a version in the second area, the approved version may replace the standard version in the first area.

Abstract: Methods, systems and computer program products for simplifying complex data stream problems involving feature extraction from noisy data. Exemplary embodiments include a method for processing a data stream, including applying multiple operators to the data stream, wherein an operation by each of the multiple operators includes retrieving the next chunk for each of set of input parameters, performing digital processing operations on a respective next chunk, producing sets of output parameters and adding data to one or more internal data stores, each internal data store acting as a data stream source.

Abstract: Methods, systems and computer program products for simplifying complex data stream problems involving feature extraction from noisy data. Exemplary embodiments include a method for processing a data stream, including applying multiple operators to the data stream, wherein an operation by each of the multiple operators includes retrieving the next chunk for each of set of input parameters, performing digital processing operations on a respective next chunk, producing sets of output parameters and adding data to one or more internal data stores, each internal data store acting as a data stream source.

Abstract: Methods, systems and computer program products for simplifying complex data stream problems involving feature extraction from noisy data. Exemplary embodiments include a method for processing a data stream, including applying multiple operators to the data stream, wherein an operation by each of the multiple operators includes retrieving the next chunk for each of set of input parameters, performing digital processing operations on a respective next chunk, producing sets of output parameters and adding data to one or more internal data stores, each internal data store acting as a data stream source.

Abstract: Methods, systems and computer program products for simplifying complex data stream problems involving feature extraction from noisy data. Exemplary embodiments include a method for processing a data stream, including applying multiple operators to the data stream, wherein an operation by each of the multiple operators includes retrieving the next chunk for each of set of input parameters, performing digital processing operations on a respective next chunk, producing sets of output parameters and adding data to one or more internal data stores, each internal data store acting as a data stream source.

Abstract: A method for organizing an exchange of information between software agents includes for each of the software agents: establishing a semantic information network; receiving a trigger signal; performing a search of the semantic information network; and performing actions related to the trigger signal. A system and a computer program product for implementing the method are provided.

Abstract: A method for organizing an exchange of information between software agents includes for each of the software agents: establishing a semantic information network; receiving a trigger signal; performing a search of the semantic information network; and performing actions related to the trigger signal. A system and a computer program product for implementing the method are provided.

Abstract: A method and apparatus are disclosed for managing tasks in a network of processors. After a period of time has elapsed, during which the processors of the network have been executing tasks allocated to them, the processors exchange views as to which pending tasks have or have not been completed. The processors reach a consensus as to the overall state of completion of the pending tasks. In a preferred embodiment, the processors exchange views and update their views based on the views received from the other processors. A predetermined condition determines that a consensus has been reached. The predetermined condition is preferably two sets of exchanges in which a processor has received messages from the same set of other processors. Alternatively, the condition is an exchange which does not result in any updates to a processor's view.

Abstract: A network node, such as a computer or processing system, is provided, for use within a network, the node including program code for synchronizing a local time maintained at the node with a reference time. Bursts of synchronization messages containing reference time stamps are transmitted over the network, or over a communication link, according to a predetermined protocol. The node receives and time stamps the messages. Thus, times according to a first time scale and a second time scale are obtained. The protocol defines temporal relationships between certain ones of the times. In accordance with the protocol, the node determines a difference between a first time according to one of the time scales and a time related to second and third times according to the other time scale. The node then updates its local time based on the difference.

Abstract: A probabilistic dock synchronization scheme for synchronization of time docks between nodes on a communication network is disclosed, in which a round trip exchange of messages is used to establish that one time according to a first time scale falls between two times according to a second time scale. A time related to the two second time scale times, preferably midway between the two times, is used for synchronizing with the time according to the first time scale. Each time is given in terms of a time value and a plus-or-minus precision range, thereby defining an interval. Enhanced precision is achieved by computing a new precision range for the synchronized time based on an intersection between the intervals of the related time and the time according to the first time scale.