Scribd Logo
Upload

Welcome to Scribd!

  • Vmware Capstone Project Algorithms: Karan Toor April 11, 2013

    Uploaded by

    Karan Toor
    12 views2 pages
    The document describes an algorithm to find the maximum value in the sum of two time-series data arrays (TS1 and TS2) by shifting one of the arrays (TS2) within a period range (τ) and calculating the sum and maximum at each shift. It does this by: 1) Defining a Shift function that shifts the values of an array (A) by some increment (Δτ), filling empty spaces with the average. 2) Calling the Shift function to shift TS2 within the period range for each increment. 3) Calculating the sum and maximum of TS1 and the shifted TS2 at each increment. 4) Returning the overall maximum value and corresponding time series sum

    Original Description:

    An algorithm for combining statistics for time series analysis.

    Original Title

    VMwareAlgo1

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes an algorithm to find the maximum value in the sum of two time-series data arrays (TS1 and TS2) by shifting one of the arrays (TS2) within a period range (τ) and calculating the sum and maximum at each shift. It does this by: 1) Defining a Shift function that shifts the values of an array (A) by some increment (Δτ), filling empty spaces with the average. 2) Calling the Shift function to shift TS2 within the period range for each increment. 3) Calculating the sum and maximum of TS1 and the shifted TS2 at each increment. 4) Returning the overall maximum value and corresponding time series sum

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    12 views2 pages

    Vmware Capstone Project Algorithms: Karan Toor April 11, 2013

    Uploaded by

    Karan Toor
    The document describes an algorithm to find the maximum value in the sum of two time-series data arrays (TS1 and TS2) by shifting one of the arrays (TS2) within a period range (τ) and calculating the sum and maximum at each shift. It does this by: 1) Defining a Shift function that shifts the values of an array (A) by some increment (Δτ), filling empty spaces with the average. 2) Calling the Shift function to shift TS2 within the period range for each increment. 3) Calculating the sum and maximum of TS1 and the shifted TS2 at each increment. 4) Returning the overall maximum value and corresponding time series sum

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 2

    VMware Capstone Project Algorithms

    Karan Toor April 11, 2013

    Introduction

    T S 1 and T S 2 are arrays containing comparable time-series data. is how much the period will be shifted, is the increment by which the period will be shifted. So essentially this algorithm nds the maximum of the maximum values in the aggregate arrays, T S 1 + T S 2, where T S 2 is shifted by |n | < n N.

    Algorithm 1 Period Shift 1: function Shitf(A[], ) Array values range from 0 to A.size() 1 2: avg arithmeticM ean(A) 3: if n 0 then 4: for i = A.size() 1 do 5: A[i] A[i ] 6: end for 7: for i = 0 k 1 do 8: A[i] avg 9: end for 10: else 11: for i = A.size() 1 0 do 12: A[i] A[i + ] 13: end for 14: for i = A.size() A.size() 1 do 15: A[i] avg 16: end for 17: end if 18: return A 19: end function 20: procedure Max-Shitf(T S 1[], T S 2[], , ) 21: T S T S1 + T S2 TS is aggregate array. 22: max maxV alue(T S ) 23: n / 24: for i = n n do 25: if maxV alue(T S 1 + T S 2) > max then 26: T S T S1 + T S2 27: max maxV alue(T S ) 28: end if 29: end for 30: return T S 31: end procedure

    You might also like