<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Rajshekhar</style></author><author><style face="normal" font="default" size="100%">Gupta, Ankur</style></author><author><style face="normal" font="default" size="100%">Samanta, A. N.</style></author><author><style face="normal" font="default" size="100%">Kulkarni, B. D.</style></author><author><style face="normal" font="default" size="100%">Jayaraman, Valadi K.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Ghosh, A.</style></author><author><style face="normal" font="default" size="100%">De, R. K.</style></author><author><style face="normal" font="default" size="100%">Pal, S. K.</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Fault diagnosis using dynamic time warping</style></title><secondary-title><style face="normal" font="default" size="100%">Pattern Recognition and Machine Intelligence, Proceedings</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">LECTURE NOTES IN COMPUTER SCIENCE</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year><pub-dates><date><style  face="normal" font="default" size="100%">DEC</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Indian Stat Inst, Machine Intelligence Univ; ISI Ctr Soft Comp Res; Int Assoc Pattern Recognit; Int Ctr Pure &amp; Appl Math; Web Intelligence Consortium; Yahoo India Res &amp; Dev; Philips Res Asia</style></publisher><pub-location><style face="normal" font="default" size="100%">Heidelberger Platz 3, D-14197 Berlin, Germany</style></pub-location><volume><style face="normal" font="default" size="100%">4815</style></volume><pages><style face="normal" font="default" size="100%">57-66</style></pages><isbn><style face="normal" font="default" size="100%">978-3-540-77045-9</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Owing to the superiority of Dynamic Time Warping as a similarity measure of time series, it can become an effective tool for fault diagnosis in chemical process plants. However, direct application of Dynamic Time Warping can be computationally inefficient, given the complexity involved. In this work we have tackled this problem by employing a warping window constraint and a Lower Bounding measure. A novel methodology for online fault diagnosis with Dynamic Time Warping has been suggested and its performance has been investigated using two simulated case studies.&lt;/p&gt;</style></abstract><notes><style face="normal" font="default" size="100%">2nd International Conference on Pattern Recognition and Machine Intelligence, Calcutta, INDIA, DEC 18-22, 2007</style></notes></record></records></xml>