BACKGROUND OF THE INVENTION  
         [0001]    1. Field of the Invention  
           [0002]    A method and device for machinery diagnostics and prognostics.  
           [0003]    2. Prior Art  
           [0004]    The machine-health-monitoring problem is widespread, very costly to the nation, and starting to be recognized. In 1996, the National Science Foundation (NSF) convened a workshop on the subject, inviting 37 experts from academia, government, and industry to participate. With respect to the current state of the art, it was suggested by at least some of the attendees that the current design of manufacturing and monitoring processes does not necessarily exploit the state-of-the-art in digital signal processing. In fact, it can be argued that little machine health monitoring research has actually been done within the signal processing community that specifically addresses the needs and nature of these types of problems.  
           [0005]    Participants in the aforesaid NSF meeting also reported that for many critical applications, machinery condition assessment has the potential to save billions of dollars while dramatically increasing safety and reliability. Examples include power generation turbines and critical equipment in nuclear reactors or on large oilrigs, where unscheduled failure can result in lost revenue approaching a million dollars per day. Failure during operations of aircraft machines or power train components in helicopters often results in loss of life along with the equipment. For example, it was reported that between 1985 and 1992, the U.S. Navy lost 67 airframes and 84 lives due to material-related failure in helicopters. Failure during operations of critical machinery on a Navy capital ship during wartime could endanger the security of the nation. Methods for machinery condition assessment which provide warning in time to cease operations or schedule maintenance offer immense value in such applications, and methods and devices for monitoring the condition of such machines is already routinely used or eagerly sought.  
           [0006]    The maintenance of turbine machines alone costs the Navy hundreds of millions of dollars per year. The cost and security risk of unscheduled failure is high, so prophylactic maintenance is routinely practiced. At great expense, in both dollars and downtime, critical components are routinely replaced long before their mean time to failure in order to reduce the risk of failure during operations. Unfortunately, it is suspected that the majority of failures are due to problems introduced by faulty maintenance; that is, the routine maintenance itself is the dominant cause of failure. For both cost reduction and for improved reliability, the Navy would prefer to adopt an “if it ain&#39;t broke, don&#39;t fix it” philosophy. But this can only be done without endangering Navy operations with reliable machinery condition assessment and early detection of precursors to equipment failure. Much the same conditions and logic prevail in the Air Force, as well as among other organizations operating high-value equipment.  
           [0007]    Current technologies for machine health monitoring are usually based on the concept of individual variables exceeding or approaching upper and lower limits. Existing machine health monitoring systems typically monitor machine variables and notify an operator or maintenance personnel when a particular variable exceeds or is approaching a limit. The method and device of the present invention also employs this limit method, but only as a minor ancillary function. The principal and unique function of the device and method of the present invention is not just to monitor individual machine variables (e.g., pressure, temperature) relationship to fixed limits, but instead to monitor all of their relationships to each other and to recognize developing abnormal relationships far in advance of any individual variable approaching a fixed limit.  
         SUMMARY OF THE INVENTION  
         [0008]    It is a first object of the invention to provide a device and method for obtaining an accurate assessment of the normality of measurable machine variables and thus predict future machine operability.  
           [0009]    It is a further object of the invention to provide a method, which may be used in a computer environment, to diagnose a problem affecting machine operability.  
           [0010]    It is another object of the invention to provide a computer readable medium bearing instructions that cause a computer to provide an accurate assessment of machine variable relationships and thus to predict future machine operability.  
           [0011]    It is yet another object of the invention to provide means for accomplishing the above objectives in “real-time,” so that the predictions can be made while the machine is operating based on the measured values of the current operating variables being produced by the machine.  
           [0012]    The above objectives are met by automatically developing a set of accurate multivariate transfer function models (TFMs) of machine variables and their relationships over time that are deemed most important by the user, machine expert, or machine operator. A TFM is simply a statistical model or function that converts “inputs” to “outputs”, as illustrated in FIG. 1. Comparison of TFM predictions of “normal” machine variable values and relationships to actual observed machine variable and relationships is then accomplished by abnormality detection algorithms in accordance with the present invention. The combination of TFMs and abnormality detection algorithms are so powerful, the device and method of the present invention detects small abnormalities (on the order of 0.01% of normal operating values) with high probability while keeping false alarm rates low. The benefits are both reduced wasted maintenance resources due to false alarms and time-based actions and reduced catastrophic failures due to missed subtle indicators.  
           [0013]    The present invention discloses, in one aspect, a computer readable medium whose contents include a set of instructions that cause a computer system to perform an accurate machine health prediction upon receipt of raw system variables data from the machine, the computer readable medium comprising: (a) a data filtering component comprising a filtering algorithm operable for eliminating “spikes” in the raw system variables data while leaving legitimate “ups and downs” in the data intact, thereby improving the predictive performance of transfer function models (TFMs); (b) a TFM estimator component comprising a multivariate non-linear transfer function estimation algorithm that uses historical or real-time calibration data comprised of values of machine operating variables from one or more normally operating machines to define “normal” and to construct statistical multivariate non-linear TFMs of “normal” machine variables; (c) a TFM modelbase comprising (i) a plurality of TFMs; and (ii) the operational condition variable values employed to develop the TFMs; (d) a Predictor component that finds the best TFMs in the TFM modelbase for the monitored machine variables and the current set of real-time machine operational conditions and uses those to predict one-step-ahead values for the monitored machine variables; (e) a Comparator component that compares what an operating machine is producing in the way of monitored variable values to what the appropriate TFMs predict for the same variables, producing the algebraic differences, called residuals; and (f) a prognosticator component that receives the residuals for each monitored machine variable from the Comparator component and conducts statistical tests on the residuals to categorize each machine variable as normal or abnormal. The Prognosticator uses the results of the tests on each machine variable to calculate an overall probability of machine abnormality (PMA), the value of which is predictive of machine failure.  
           [0014]    In another aspect, the present invention provides a method for predicting machine failure comprising the steps of: (a) presenting a machine having an operability that is dependent on the values of a set of machine variables; (b) presenting a computer means comprising the computer readable medium described above; (c) measuring the set of machine variables, the set of measured machine variables comprising input to said computer means; and (d) observing the value of the PMA, the value of the PMA being predictive of machine failure. The features of the invention believed to be novel are set forth with particularity in the appended claims. However the invention itself, both as to organization and method of operation, together with further objects and advantages thereof may be best understood by reference to the following description taken in conjunction with the accompanying drawings in which: 
       
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0015]    [0015]FIG. 1 is a diagrammatic representation of a Transfer Function Model.  
         [0016]    [0016]FIG. 2 is a diagrammatic representation illustrating the operation of the machinemonitoring device of the present invention. 
     
    
     DESCRIPTION OF THE PREFERRED EMBODIMENTS  
       [0017]    Artisans skilled in art will appreciate the value of illustrating the present invention by means of an example. Consider early detection of “abnormalities” (prognostics) and classification of those abnormalities (diagnostics) based on historical Digital Electronic Engine Controller data from many normally operating F-16 fighter aircraft F100-PW-229 gas turbine (jet) engines (GTEs) to learn what is “normal” and to automatically construct statistical multivariate non-linear transfer function models (TFMs) of normal GTE variable values and relationships over the entire range of normal GTE operation.  
         [0018]    Pre-Processing Filters  
         [0019]    The present invention can be thought of as a machine health monitoring system (MHMS). FIG. 2 illustrates the process of automatically developing TFMs for machine health monitoring (MHM). The TFM estimation process automatically takes raw data for machine variables of interest (generally those believed to be the most important to the particular machine&#39;s health by experts, operators or maintenance), filters the data to eliminate anomalous data “spikes” that are typically present in machine data produced by analog or digital sensors, estimates appropriate TFMs for each variable of interest relating that variable to all other variables of interest, and places the TFMs so developed into the Transfer Function Modelbase (TFMB). If historical, recorded data is used to develop the TFMs, this process is not real-time. If the MHMS is provided data feeds from an operating machine or machines, then the TFM estimation process occurs in real-time as the machine is operating.  
         [0020]    Most machine operating data contains instances of “spikes” for almost all monitored machine variables, where a “spike” is defined to be a large deviation of a machine variable (e.g., temperature) from some pre-spike value that lasts only one sampling interval (e.g., 0.25 sec) before returning to its pre-spike value. Inclusion of these spikes when estimating TFMs makes them less accurate than would otherwise have been the case. For GTE data, the present inventor has found that in a data set of 2000 sample points (at 0.25 second sampling interval) for a given GTE variable, there are often 8-10 such spikes. The data-filtering algorithm of the MHMS eliminates spikes while leaving legitimate “ups and downs” in the data intact, improving the predictive performance of TFMs by approximately 5% on average.  
       TFM Estimator  
       [0021]    The approach employed in the MHMS uses either historical data or real-time collected data from one or more normally operating machines (GTE&#39;s for example) to learn what&#39;s “normal” and to construct statistical multivariate non-linear TFMs of “normal” output variable behavior. Note that the term “normal”, as used herein, has nothing to do with the normal probability distribution. Accordingly, the term “Gaussian” is used for the probability distribution to avoid confusion. In general, TFMs that make highly accurate predictions of machine (GTE) variables have been developed for the MHMS. TFMs are automatically developed from either GTE historical or real-time operating data for all GTE variables of interest using generalized least squares estimation. In general, a TFM is developed for every GTE variable of interest and for a variable number of sample points n i . The automated TFM estimation algorithms select the sample size for each TFM based on the statistical variability of the output variable being modeled. Low variability regions of performance leads to larger sample size for TFM development, while higher variability leads to smaller sample sizes for TFM development. In general, one would expect TFMs to be better (in terms of predictive performance) when developed based on larger sample sizes. On the other hand, as TFM development is based on a wider and wider range of operational conditions represented by larger and larger sample sizes, it becomes increasingly difficult for a single TFM to model the wider and wider range of behavior. Thus there is an optimal sample size for TFM development that is a balance between these two considerations. In practice, the balance changes, depending on the statistical variability of the variable being modeled. The current MHMS TFM Estimator is based on a fast generalized least squares (GLS) estimation algorithm (Christensen, R. (1996).  Plane Answers to Complex Questions: The Theory of Linear Models.  Springer-Verlag) that provides optimal estimates of the parameters of the TFMs and is an improvement over the Marquardt non-linear least squares estimation algorithm (Marquardt, D. W. (1963). “An Algorithm for Least Squares Estimation of Nonlinear Parameters.”  Journal of the Society for Industrial and Applied Mathematics,  11: 2, 431-441) recommended by Box, Jenkins, and Reinsell. The present inventor&#39;s research and the more recent literature indicated that GLS can improve upon Marquardt algorithm performance. The GLS algorithm employed in the MHMS estimates TFMs  20  times faster and produce TFM fits to the data that are twice as good as can be obtained with the usual Marquardt algorithm.  
         [0022]    However, the present inventor has found that the automatic application GLS TFM Estimator code (i.e., with no human intervention) tended to produce TFMs that are overfit; that is, they give extremely tight fits to the data used to develop them, but yield comparatively poor predictive accuracy when used with new data. Investigation found that this occurred because the GLS estimation code tended to select all possible input variables to develop a TFM for a given output variable. In order to improve the robustness and predictive accuracy of TFMs developed with the automatic GLS estimation algorithm, a method was devised for automatically restricting the input variables for TFM estimation to those with the greatest impact on the output variable being estimated.  
         [0023]    The general non-linear transfer function model is of the form (Kantz, H. and T. Schreiber (1997).  Nonlinear Time Series Analysis.  Cambridge University Press):  
           Y   t   =f (Y t-1   ,Y   t-2 , . . . Y t-b     d     , X   1,t   X   1,t-1   ,X   1,y-2   , . . . X   1,t-b     1     , X   2,t   ,X   2,t-1   ,X   2,t-2   , . . . X   2,t-b     2   ,  (1)  
         X m,t   ,X   m,t-1   ,X   m,t-2   , . . . X   m,t-b     m     , a   t   ,a   t-1   ,a   t-2   , . . . a   t-b     s   )  
         [0024]    where Y t  is the GTE variable being modeled for time period t, Y t-j  are the past values of Yin time period (t-j), bd&#39;s the maximum number of past values of Y, X i,t-j , i=1,2, . . . , m, are the values of independent variables at time period t used to predict Yt, X i,t-j , i=1,2, . . . , m, are the past values of X i  in time period (t-j), b i , i=1,2, . . . ,m, are the maximum number of past values of X i , a t  is a “random shock” at time period t, a t-j  are the past values of a at time period (t-j), and b s  is the maximum number of past values of a in the TFM. The problem of automating the decision about the best structure of each TFM before estimating its parameters had to be solved. In terms of Eq. (1), this problem is reduced to deciding which of the possible X i,t  variables, and how many past values of them, to include, and how many past values of Y and a to include in the TFM structure. Kendall&#39;s tau statistic (Conover, W. J. (1998).  Practical Non - Parametric Statistics.  3 rd  ed. John Wiley) was employed to automate these decisions. This statistic is easy to compute and interpret and has a high asymptotic relative efficiency of 91% when compared to a more computationally difficult test using Spearman&#39;s r statistic (Stuart, A. (1954). “Asymptotic Relative Efficiency of Tests and the Derivatives of Their Power Functions.”  Skandanavisk Aktaurietidskrift,  163-169). Kendall&#39;s tau is a statistic such that −1≦τ≦1.  
         [0025]    When comparing a potential input variable time series with an output variable time series, we compare each point and count the number of discordances N d  and concordances N c , where a concordance is where both series move in the same (positive or negative) direction compared to their previous value, and a discordance is where they move in opposite directions. If one or both variables do not move (remain constant) then there is neither a concordance nor discordance. Tau is computed for each variable pair by τ 
       τ   =         N   c     -     N   d           n        (     n   -   1     )       /     2   ..                               
 
         [0026]    where n is the total number of pairs being evaluated. A tau value of 1 would mean perfect concordance between the variables, a−1 perfect discordance, whereas a tau of zero would mean no relationship between them whatsoever. The stronger relationships (discordant or concordant) are included in the MHMS TFMs while the weaker relationships. After much experimentation, all input variables where |τ|≦0.15 were excluded from the TFMs. Using this rule has resulted in much more robust TFMs in the sense of their predictive accuracy over a wide range of data.  
         [0027]    TFM Modelbase  
         [0028]    The TFMs that are automatically developed from either GTE historical or real-time operating data representing normal behavior t are placed in a computerized repository called a transfer function modelbase (TFMB). The TFMB also contains a multidimensional search space that contains the operational conditions (e.g., for GTE&#39;s throttle setting, Mach, ambient temperature, ambient pressure) associated with every sampled data point in the historical or real-time “normal” or “training” data set used to develop the TFMs in the TFMB. The TFMB also associates every sampled data point with its resultant TFM.  
         [0029]    Predictor  
         [0030]    After a set of variables are “picked off” or sampled from an operating GTE in real-time, the best existing TFM in the TFMB for the current set of operational conditions is selected to be used for prediction. This is accomplished by first finding the single multi-dimensional point of the perhaps tens of thousands of multi-dimensional points that most closely matches the real-time “picked-off” point (set of operational conditions), and then by identifying the single TFM associated with the matched point. That TFM will be the best for predicting future values of the GTE variable of interest. This is a classic “nearest-neighbor problem,” a very common but difficult problem that often occurs in image compression and pattern matching applications.  
         [0031]    To quickly find the TFM that was developed on GTE operating conditions nearest to those we want to make predictions for, a nearest neighbor algorithm, developed by Sunil Arya and David Mount (Arya, S., D. M. Mount, et al.(1998). “An Optimal Algorithm for Approximate Nearest Neighbor Searching.”  Journal of the ACM,  45, 891-923), of the University of Maryland&#39;s Institute of Advanced Computer Studies, was implemented. This algorithm preprocesses the search space/points into what is referred to in the nearest neighbor literature as a k-d tree structure. This structure allows very fast search to find the nearest TFMB point and associated TFM to each real-time set of GTE operational conditions. The Predictor function of the MHMS, in accordance with the present invention, then uses the selected TFMs (one for each GTE variable of interest) to predict the one-step-ahead future values of the GTE variables of interest.  
         [0032]    Comparator  
         [0033]    Once accurate TFMs of “normal” GTE performance have been developed, placed in the TFMB, selected in real-time, and used to predict the next-step-ahead values of the GTE variables of interest, the MHMS&#39;s Comparator function simply compares the predicted values for the ith GTE variable Ŷ u  at time t with the actual variable value at time t, Y it . The Comparator function then calculates the residuals for each variable i at time period t: â it =Ŷ it −Y it . By the GLS estimation theory, these residuals should be Guassian random variables with a mean of zero.  
         [0034]    Prognosticator  
         [0035]    Once the residuals are computed for each GTE variable of interest, they are passed to the Prognosticator component of the MHMS where a statistical test is applied to decide whether the residuals are attributable to an “abnormal” GTE variable or to normal statistical variability. Our invention employs a statistical test that provides good visibility and control over false alarm rate a and failed alarm rate β.  
         [0036]    The test employed for “GTE variable normality” is based on the non-parametric binomial test. In statistical terms, the test can be stated as follows:  
         [0037]    H 0 : The GTE variable in question is “normal” (“null hypothesis”).  
         [0038]    H a : The GTE Variable in question is “abnormal” (“alternate hypothesis”).  
         [0039]    Restating these hypotheses in terms of TFM residuals (â it , &#39;s) for a specific variable, Y i :  
         [0040]    H 0 : Number of á u  &#39;s that fall +/−kσ beyond the mean residual value is normal.  
         [0041]    H a : Number of â u  &#39;s that fall +/−kσ beyond the mean residual value is abnormal.  
         [0042]    A binomial test is based on dividing a statistical sample into two mutually exclusive classes (hence the term binomial). In this case, the classes are defined by &lt;+/−kσ from the mean and &gt;+/−kσ from the mean. To operationalize the test, the hypotheses is restated once again:  
         [0043]    H 0 : p=p 0  where p 0  is the expected proportion of â u  &#39;s that are +/−kσ beyond the mean residual value.  
         [0044]    H a : p=P a &gt;p 0    
         [0045]    Thus, our hypotheses about GTE variable normality/abnormality have translated into hypotheses about the proportion of residuals that fall +/−kσ beyond the residual mean value, which in turn leads to the question of how to choose k. It should be noted that the relationship between k andpo depends on the probability distribution of the residuals. With GLS TFM estimation, the residuals are Gaussian distributed.  
         [0046]    From a theoretical standpoint, k could be any value. Larger k&#39;s, for example, k&#39;s ≧2, are equivalent to testing for outliers, or an excessive number of values a great distance from the mean. However, it seems likely that GTE or other complex machine abnormality might not initially be reflected in the generation of such outliers. Therefore, a small value of k would have the opportunity of detecting small abnormalities that might go undetected with a large value of k. Note that small values of k mean large values for p 0  and vice versa. A good result has been achieved with a k of 0.125, which corresponds to a p 0  of ˜0.9.  
         [0047]    The test statistic for the “GTE variable normality” hypothesis test is based on  
         p   ^     =     w   n                           
 
         [0048]    where w is the number is the number of residual values that fall more than +/−kσ beyond the mean residual value and n is the total number of residuals. For large samples, the test statistic for the binomial test is  
       z   =         p   ^     -     p   0               p   0          (     1   -     p   0       )       n                               
 
         [0049]    and “large” sample is further defined as np 0 (1−p 0 )≧9. The rejection region for the test is z&gt;z α  where a is the significance of the test and the probability of rejecting H 0  when it is in fact true probability of false alarm), and z α  is the area under the standard Gaussian distribution curve associated with a, which can be obtained from any statistics reference. It should be noted that a does not depend on k, so the choice of k does not affect the false alarm rate of the test.  
         [0050]    By selecting a, the probability of false alarm for the test is determined. Obviously, if this were the only consideration we could make a arbitrarily small. However, the probability of failed alarm (generally designated β) is inversely related to a for a given sample size n and given sensitivity parameter p a . Consequently, for a given n and p a , as a approaches 0, β approaches 1 and vice versa. Thus the only way to achieve both small a and small β simultaneously is to increase n and/or increase p a . Using a procedure outlined by Wackerly, Mendenhall, and Scheaffer, the following formula relating n, α, β and p a  is derived:  
             n   =           z   α   2            p   0          (     1   -     p   0       )         +     2        z   α          z   β              p   0            p   a          (     1   -     p   0       )            (     1   -     p   a       )           +       z   β   2            p   a          (     1   -     p   a       )               (       p   a     -     p   0       )     2               (   1   )                               
 
         [0051]    where z β  is the area under the standard Gaussian distribution curve associated with β, (p a −p 0 ) is the minimum difference between p andpowe wish to be able to detect (this is why p a  is the sensitivity parameter), and all other elements of the formula are as previously defined. For example, if α=β=0.005,p 0 =0.9 and p a =0.96, the above formula yields n=453. This formula shows that if multiple TFMs and an entire GTE flight&#39;s worth of data are used for the test (i.e., 15,000&lt;n&lt;30,000), great sensitivity to abnormalities can be achieved while keeping probability of false alarm and probability of failed alarm simultaneously low.  
         [0052]    The Prognosticator function of the invention computes the results of the statistical test for each GTE variable of interest repeatedly over time as the number of sampled variable values (n) grows over time. The Prognosticator combines the results of each of these tests to calculate an overall probability of abnormality for the GTE as a whole. This probability calculation is updated continuously as the results of the repeated statistical tests come in. The formula yielding this probability was derived through the application of Bayesian statistics using Bayes&#39;s theorem (Pearl, J. 1988 . Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference.  Morgan Kaufman).  
               P        (         N   ~     |       Y   ~     1       ,       Y   ~     2     ,   …              ,       Y   ~     m     ,     Y     m   +   1       ,     Y     m   +   2       ,   …              ,     Y   n       )       =         P        (     N   ~     )            P        (         Y   ~     1     ,       Y   ~     2     ,   …              ,       Y   ~     m     ,     Y     m   +   1       ,     Y     m   +   2       ,   …              ,       Y   n     |     N   ~         )           P        (         Y   ~     1     ,       Y   ~     2     ,   …              ,       Y   ~     m     ,     Y     m   +   1       ,     Y     m   +   2       ,   …              ,     Y   n       )                 (   2   )                               
 
         [0053]    where Ñ is the event that the monitored GTE is abnormal, {tilde over (Y+EE 4   i  is the event that ith GTE variable is classified as abnormal by the statistical test, Y i  is the event that the ith GTE variable is classifed as normal by the statistical test, )} 
         [0054]    P(Ñ, {tilde over (Y)} 1 ,{tilde over (Y)} 2 , . . . , {tilde over (Y)} m ,{tilde over (Y)} m+1 ,{tilde over (Y)} m+2 , . . . , Y n ) is the probability that a monitored GTE is normal given that the Prognosticator classified m of the n monitored GTE variables as abnormal and classified n-m as normal, P(Ñ) is the a priori probability that the GTE is abnormal, P({tilde over (Y)} 1 ,{tilde over (Y)} 2 , . . . , {tilde over (Y)} m Y m+1 , Y m+2 , . . . ,Y n |Ñ) is the probability that m of the n monitored GTE variables are classified as normal and n-m are classified as abnormal by the statistical test when the GTE is in fact abnormal, and P({tilde over (Y)} 1 , {tilde over (Y)} 2 , . . . , {tilde over (Y)} m , Y m+1 , Y m+2 , . . . , Y n ) is the unconditional probability that the Prognosticator will classify m of the n monitored GTE variables as normal and m-n as abnormal. It should be noted that relation (2) above is simply Bayes&#39; Rule for this problem. The challenge was deriving the components of the Bayes&#39; Rule equation. Thus,  
           P ( Ñ )=γ  (3)  
         [0055]    where γ is the a priori probability that a given GTE is abnormal. In addition, it can be shown that:  
               P        (         Y   ~     1     ,       Y   ~     2     ,   …              ,       Y   ~     m     ,     Y     m   +   1       ,     Y     m   +   2       ,   …              ,       Y   n     |     N   ~         )       =       ∏     i   =   1     m            [         α   i          δ   i       +       (     1   -     β   i       )          (     1   -     δ   i       )         ]     ×       ∏     i   =     m   +   1       n          [         (     1   -     α   i       )          δ   i       +       β   i     (     1   -     δ   i       ]                       (   4   )                               
 
         [0056]    where α i  is the probability of our statistical test categorizing the ith GTE variable as abnormal when it is in fact normal, β i  is the probability of our statistical test categorizing the ith GTE variable as normal when in fact it is abnormal, and δ i  is the a priori probability that the ith GTE variable will be normal when the GTE is abnormal. Finally, it can be shown that the denominator of relation (2) is given by:  
                     P        (         Y   ~     1     ,       Y   ~     2     ,   …              ,       Y   ~     m     ,     Y     m   +   1       ,     Y     m   +   2       ,   …              ,     Y   n       )       =                (     1   -   γ     )            ∏     i   =   1     m            α   i            ∏     i   =     m   +   1       n          (     1   -     α   i       )             +                          γ          ∏     i   =   1     m            [         α   i          δ   i       +       (     1   -     β   i       )          (     1   -     δ   i       )         ]     ×                                ∏     i   =     m   +   1       n          [         (     1   -     α   i       )          δ   i       +       β   i          (     1   -     δ   i       )         ]                     (   5   )                               
 
         [0057]    Therefore, substituting relations (3)-(5) into relation (2) yields:  
               P        (         N   ~     |       Y   ~     1       ,       Y   ~     2     ,   …              ,       Y   ~     m     ,     Y     m   +   1       ,     Y     m   +   2       ,   …              ,     Y   n       )       =       γ          ∏     i   =   1     m            [         α   i          δ   i       +       (     1   -     β   i       )          (     1   -     δ   i       )         ]     ×       ∏     i   =     m   +   1       n          [         (     1   -     α   i       )          δ   i       +       β   i          (     1   -     δ   i       )         ]                         (     1   -   γ     )            ∏     i   =   1     m            α   i            ∏     i   =     m   +   1       n          (     1   -     α   i       )             +     γ          ∏     i   =   1     m            [         α   i          δ   i       +       (     1   -     β   i       )          (     1   -     δ   i       )         ]     ×                       ∏     i   =     m   +   1       n          [         (     1   -     α   i       )          δ   i       +       β   i          (     1   -     δ   i       )         ]                       (   6   )                               
 
         [0058]    Thus, relation (6) provides dynamic probability of GTE abnormality based on the continuing results of the statistical test results on all of the GTE variables of interest, taking into account α, β, γ and δ for each variable.  
         [0059]    While particular embodiments of the present invention have been illustrated and described, it would be obvious to those skilled in the art that various other changes and modifications can be made without departing from the spirit and scope of the invention. It is therefore intended to cover in the appended claims all such changes and modifications that are within the scope of this invention.
Machinery diagnostics and prognostics is an emerging engineering field that seeks to accurately determine the operational health of a machine without waiting for the machine to fail, performing maintenance that may not yet be required or, in the worst case, performing unnecessary maintenance that inadvertently causes other problems and hastens machine health deterioration. Accurate prediction of machine health (operability) enables operators to base machine maintenance on the machine's actual condition, in contrast to the common practice of time-based maintenance (e.g., perform maintenance every 100 hours). The "just-in-time" methodology of the machine health monitoring system (MHMS) of the present invention translates into significant cost savings by providing early warning of impending failures and thus reducing unanticipated catastrophic machine failures through preventative maintenance techniques (but no more or no less than is required) while simultaneously keeping false alarm rates low. The MHMS couples proprietary analysis, modeling and pattern recognition techniques to provide accurate machine health predictions. The MHMS's combination of technologies provides accurate, easy-to-understand, early indication of potential problems, enabling efficient and timely repair. In addition, MHMS technology can continuously "learn" from its own machine health monitoring experience, so that system accuracy and false alarm rate improve over time.