×

Providing user controlled ability to determine data level of detail in a graph

  • US 9,208,591 B2
  • Filed: 04/18/2013
  • Issued: 12/08/2015
  • Est. Priority Date: 04/18/2013
  • Status: Expired due to Fees
0
Associated Cases
0
Associated Defendants
0
Product Citations
0
Petitions
1
Forward Citation
1
Assignment
First Claim
Patent Images

1. A computer implemented method for constructing a graph which pertains to measured values of a specified metric, the method comprising:

  • selectively storing successive measured values of the specified metric received as input sensor measurement data in a storage device by a processor unit of a data processing system, wherein each stored value comprises a data point;

    routing successive data points from the storage device by the processor unit using network and display elements, comprising a data transfer and display performance mechanism of the data processing system to a location associated with the graph, wherein a first number of data points are included in a specified graph time period;

    computing multiple time intervals, by the processor unit, using a value that represents a particular data level of detail specified by a user to divide the specified graph time period into the multiple time intervals equal to the value specified, wherein each time interval includes a second number of data points, and wherein the second number of data points is less than the first number of data points;

    selecting an algorithm from a set of algorithms, by the processor unit, to use in computing a most representative value responsive to receiving a rule or criteria associated with a particular algorithm from the user, and wherein each rule or criteria specifies conditions for selecting a corresponding algorithm, and wherein the conditions include information comprising alerts, thresholds or predetermined properties provided by the user, and wherein input measurement data, used for constructing the graph, having an upper threshold that defines an instance of an alert trigger, wherein a server is provided with the set of algorithms, and selects one of the algorithms for use in determining the most representative value for a time interval, wherein the set of algorithms is a group of algorithms comprising a MAX—

    choose a maximum value from within this time interval, a MIN—

    choose a minimum value from within this time interval, an AVG—

    choose an average value from within this time interval, a MEAN—

    choose a mean value from within this time interval, a MEAN-n—

    choose the mean value from within this time interval removing n outliers from a calculation, a RANDOM—

    choose a random value from within this time interval, and a CUSTOM—

    choose a value from within this time interval to be the most representative value for that interval, by selecting one of;

    an average of all data point values of the time interval that exceed a specified maximum value;

    an earliest data point value of the time interval;

    a latest data point value of the time interval; and

    a value of the data point received at a middle of the time interval;

    selectively processing the second number of data points of a respective time interval, in accordance with prespecified criteria received from the user, and at least one selected algorithm, by the processor unit to compute the most representative value for that time interval; and

    constructing one or more of the graph by the processor unit using;

    the most representative value of each respective time interval.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×