var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fiurteaga.github.io%2FmyConferences.bib&jsonp=1&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fiurteaga.github.io%2FmyConferences.bib&jsonp=1\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fiurteaga.github.io%2FmyConferences.bib&jsonp=1\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
    2. \n
  2. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
    3. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2023\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Multi-armed bandits for resource efficient, online optimization of language model pre-training: the use case of dynamic masking.\n \n \n \n \n\n\n \n Urteaga, I.; Draïdia, M.; Lancewicki, T.; and Khadivi, S.\n\n\n \n\n\n\n In Findings of the Association for Computational Linguistics: ACL 2023, pages 10609–10627, Toronto, Canada, July 2023. Association for Computational Linguistics\n \n\n\n\n
\n\n\n\n \n \n \"Multi-armedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@InProceedings{Urteaga2023,\n  author    = {I{\\~n}igo Urteaga and Moulay-Za\\"idane Dra\\"idia and Tomer Lancewicki and Shahram Khadivi},\n  booktitle = {Findings of the Association for Computational Linguistics: ACL 2023},\n  title     = {{Multi-armed bandits for resource efficient, online optimization of language model pre-training: the use case of dynamic masking}},\n  year      = {2023},\n  address   = {Toronto, Canada},\n  month     = jul,\n  pages     = {10609--10627},\n  publisher = {Association for Computational Linguistics},\n  abstract  = {We design and evaluate a Bayesian optimization framework for resource efficient pre-training of Transformer-based language models (TLMs). TLM pre-training requires high computational resources and introduces many unresolved design choices, such as selecting its pre-training hyperparameters.We propose a multi-armed bandit framework for the sequential selection of pre-training hyperparameters, aimed at optimizing language model performance, in a resource efficient manner. We design a Thompson sampling algorithm, with a surrogate Gaussian process reward model of the Masked Language Model (MLM) pre-training objective, for its sequential minimization. Instead of MLM pre-training with fixed masking probabilities, the proposed Gaussian process-based Thompson sampling (GP-TS) accelerates pre-training by sequentially selecting masking hyperparameters that improve performance.We empirically demonstrate how GP-TS pre-trains language models efficiently, i.e., it achieves lower MLM loss in fewer epochs, across a variety of settings. In addition, GP-TS pre-trained TLMs attain competitive downstream performance, while avoiding expensive hyperparameter grid search. GP-TS provides an interactive framework for efficient and optimized TLM pre-training that, by circumventing costly hyperparameter selection, enables substantial computational savings.},\n  doi       = {10.18653/v1/2023.findings-acl.675},\n  url       = {https://aclanthology.org/2023.findings-acl.675},\n}\n\n
\n
\n\n\n
\n We design and evaluate a Bayesian optimization framework for resource efficient pre-training of Transformer-based language models (TLMs). TLM pre-training requires high computational resources and introduces many unresolved design choices, such as selecting its pre-training hyperparameters.We propose a multi-armed bandit framework for the sequential selection of pre-training hyperparameters, aimed at optimizing language model performance, in a resource efficient manner. We design a Thompson sampling algorithm, with a surrogate Gaussian process reward model of the Masked Language Model (MLM) pre-training objective, for its sequential minimization. Instead of MLM pre-training with fixed masking probabilities, the proposed Gaussian process-based Thompson sampling (GP-TS) accelerates pre-training by sequentially selecting masking hyperparameters that improve performance.We empirically demonstrate how GP-TS pre-trains language models efficiently, i.e., it achieves lower MLM loss in fewer epochs, across a variety of settings. In addition, GP-TS pre-trained TLMs attain competitive downstream performance, while avoiding expensive hyperparameter grid search. GP-TS provides an interactive framework for efficient and optimized TLM pre-training that, by circumventing costly hyperparameter selection, enables substantial computational savings.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2021\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A Generative Modeling Approach to Calibrated Predictions: A Use Case on Menstrual Cycle Length Prediction.\n \n \n \n \n\n\n \n Urteaga, I.; Li, K.; Wiggins, C.; and Elhadad, N.\n\n\n \n\n\n\n In Jung, K.; Yeung, S.; Sendak, M.; Sjoding, M.; and Ranganath, R., editor(s), Proceedings of the 6th Machine Learning for Healthcare Conference, volume 149, of Proceedings of Machine Learning Research, pages 535–566, 06–07 Aug 2021. PMLR\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@InProceedings{ip-Urteaga2021,\n  author    = {I{\\~{n}}igo Urteaga and Kathy Li and Chris Wiggins and No{\\'{e}}mie Elhadad},\n  booktitle = {Proceedings of the 6th Machine Learning for Healthcare Conference},\n  title     = {{A Generative Modeling Approach to Calibrated Predictions: A Use Case on Menstrual Cycle Length Prediction}},\n  year      = {2021},\n  editor    = {Jung, Ken and Yeung, Serena and Sendak, Mark and Sjoding, Michael and Ranganath, Rajesh},\n  month     = {06--07 Aug},\n  pages     = {535--566},\n  publisher = {PMLR},\n  series    = {Proceedings of Machine Learning Research},\n  volume    = {149},\n  abstract  = {We present an end-to-end statistical framework for personalized, accurate, and minimally invasive modeling of female reproductive hormonal patterns. Reconstructing and forecasting the evolution of hormonal dynamics is a challenging task, but a critical one to improve general understanding of the menstrual cycle and personalized detection of potential health issues. Our goal is to infer and forecast individual hormone daily levels over time, while accommodating pragmatic and minimally invasive measurement settings. To that end, our approach combines the power of probabilistic generative models (i.e., multi-task Gaussian processes) with the flexibility of neural networks (i.e., a dilated convolutional architecture) to learn complex temporal mappings. To attain accurate hormone level reconstruction with as little data as possible, we propose a sampling mechanism for optimal reconstruction accuracy with limited sampling budget. Our results show the validity of our proposed hormonal dynamic modeling framework, as it provides accurate predictive performance across different realistic sampling budgets and outperforms baselines methods.},\n  file      = {urteaga19a.pdf:http\\://proceedings.mlr.press/v106/urteaga19a/urteaga19a.pdf:PDF},\n  url       = {https://proceedings.mlr.press/v149/urteaga21a},\n}\n\n
\n
\n\n\n
\n We present an end-to-end statistical framework for personalized, accurate, and minimally invasive modeling of female reproductive hormonal patterns. Reconstructing and forecasting the evolution of hormonal dynamics is a challenging task, but a critical one to improve general understanding of the menstrual cycle and personalized detection of potential health issues. Our goal is to infer and forecast individual hormone daily levels over time, while accommodating pragmatic and minimally invasive measurement settings. To that end, our approach combines the power of probabilistic generative models (i.e., multi-task Gaussian processes) with the flexibility of neural networks (i.e., a dilated convolutional architecture) to learn complex temporal mappings. To attain accurate hormone level reconstruction with as little data as possible, we propose a sampling mechanism for optimal reconstruction accuracy with limited sampling budget. Our results show the validity of our proposed hormonal dynamic modeling framework, as it provides accurate predictive performance across different realistic sampling budgets and outperforms baselines methods.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2019\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Multi-Task Gaussian Processes and Dilated Convolutional Networks for Reconstruction of Reproductive Hormonal Dynamics.\n \n \n \n \n\n\n \n Urteaga, I.; Bertin, T.; Hardy, T. M.; Albers, D. J.; and Elhadad, N.\n\n\n \n\n\n\n In Proceedings of the 4th Machine Learning for Healthcare, volume 106, of Proceedings of Machine Learning Research, pages 66–90, 09–10 Aug 2019. PMLR\n \n\n\n\n
\n\n\n\n \n \n \"Multi-TaskPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@InProceedings{ip-Urteaga2019,\n  author    = {I{\\~{n}}igo Urteaga and Tristan Bertin and Theresa M. Hardy and David J. Albers and No{\\'{e}}mie Elhadad},\n  title     = {{Multi-Task Gaussian Processes and Dilated Convolutional Networks for Reconstruction of Reproductive Hormonal Dynamics}},\n  booktitle = {Proceedings of the 4th Machine Learning for Healthcare},\n  year      = {2019},\n  volume    = {106},\n  series    = {Proceedings of Machine Learning Research},\n  pages     = {66--90},\n  month     = {09--10 Aug},\n  publisher = {PMLR},\n  abstract  = {We present an end-to-end statistical framework for personalized, accurate, and minimally invasive modeling of female reproductive hormonal patterns. Reconstructing and forecasting the evolution of hormonal dynamics is a challenging task, but a critical one to improve general understanding of the menstrual cycle and personalized detection of potential health issues. Our goal is to infer and forecast individual hormone daily levels over time, while accommodating pragmatic and minimally invasive measurement settings. To that end, our approach combines the power of probabilistic generative models (i.e., multi-task Gaussian processes) with the flexibility of neural networks (i.e., a dilated convolutional architecture) to learn complex temporal mappings. To attain accurate hormone level reconstruction with as little data as possible, we propose a sampling mechanism for optimal reconstruction accuracy with limited sampling budget. Our results show the validity of our proposed hormonal dynamic modeling framework, as it provides accurate predictive performance across different realistic sampling budgets and outperforms baselines methods.},\n  file      = {urteaga19a.pdf:http\\://proceedings.mlr.press/v106/urteaga19a/urteaga19a.pdf:PDF},\n  url       = {http://proceedings.mlr.press/v106/urteaga19a.html},\n}\n\n
\n
\n\n\n
\n We present an end-to-end statistical framework for personalized, accurate, and minimally invasive modeling of female reproductive hormonal patterns. Reconstructing and forecasting the evolution of hormonal dynamics is a challenging task, but a critical one to improve general understanding of the menstrual cycle and personalized detection of potential health issues. Our goal is to infer and forecast individual hormone daily levels over time, while accommodating pragmatic and minimally invasive measurement settings. To that end, our approach combines the power of probabilistic generative models (i.e., multi-task Gaussian processes) with the flexibility of neural networks (i.e., a dilated convolutional architecture) to learn complex temporal mappings. To attain accurate hormone level reconstruction with as little data as possible, we propose a sampling mechanism for optimal reconstruction accuracy with limited sampling budget. Our results show the validity of our proposed hormonal dynamic modeling framework, as it provides accurate predictive performance across different realistic sampling budgets and outperforms baselines methods.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2018\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Phenotyping Endometriosis through Mixed Membership Models of Self-Tracking Data.\n \n \n \n \n\n\n \n Urteaga, I.; McKillop, M.; Lipsky-Gorman, S.; and Elhadad, N.\n\n\n \n\n\n\n In 2018 Machine Learning for Healthcare (MLHC), 2018. \n \n\n\n\n
\n\n\n\n \n \n \"PhenotypingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@InProceedings{ip-Urteaga2018,\n  author    = {I{\\~n}igo Urteaga and Mollie McKillop and Sharon Lipsky-Gorman and No{\\'e}mie Elhadad},\n  title     = {{Phenotyping Endometriosis through Mixed Membership Models of Self-Tracking Data}},\n  booktitle = {2018 Machine Learning for Healthcare (MLHC)},\n  year      = {2018},\n  owner     = {iurteaga},\n  timestamp = {2017-04-07},\n  url       = {https://www.mlforhc.org/s/27.pdf},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Variational inference for the multi-armed contextual bandit.\n \n \n \n \n\n\n \n Urteaga, I.; and Wiggins, C.\n\n\n \n\n\n\n In Proceedings of the Twenty-First International Conference on Artificial Intelligence and Statistics, volume 84, of Proceedings of Machine Learning Research, pages 698–706, 09–11 Apr 2018. PMLR\n \n\n\n\n
\n\n\n\n \n \n \"VariationalPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@InProceedings{j-Urteaga2018a,\n  author    = {I{\\~n}igo Urteaga and Chris Wiggins},\n  title     = {{Variational inference for the multi-armed contextual bandit}},\n  booktitle = {Proceedings of the Twenty-First International Conference on Artificial Intelligence and Statistics},\n  year      = {2018},\n  volume    = {84},\n  series    = {Proceedings of Machine Learning Research},\n  pages     = {698--706},\n  month     = {09--11 Apr},\n  publisher = {PMLR},\n  abstract  = {In many biomedical, science, and engineering problems, one must sequentially decide which action to take next so as to maximize rewards. One general class of algorithms for optimizing interactions with the world, while simultaneously learning how the world operates, is the multi-armed bandit setting and, in particular, the contextual bandit case. In this setting, for each executed action, one observes rewards that are dependent on a given ’context’, available at each interaction with the world. The Thompson sampling algorithm has recently been shown to enjoy provable optimality properties for this set of problems, and to perform well in real-world settings. It facilitates  generative and interpretable modeling of the problem at hand. Nevertheless, the design and complexity of the model limit its application, since one must both sample from the distributions modeled and calculate their expected rewards. We here show how these limitations can be overcome using variational inference to approximate complex models, applying to the reinforcement learning case advances developed for the inference case in the machine learning community over the past two decades. We consider contextual multi-armed bandit applications where the true reward distribution is unknown and complex, which we approximate with a mixture model whose parameters are inferred via variational inference. We show how the proposed variational Thompson sampling approach is accurate in approximating the true distribution, and attains reduced regrets even with complex reward distributions. The proposed algorithm is valuable for practical scenarios where restrictive modeling assumptions are undesirable.},\n  file      = {urteaga18a.pdf:http\\://proceedings.mlr.press/v84/urteaga18a/urteaga18a.pdf:PDF},\n  url       = {http://proceedings.mlr.press/v84/urteaga18a.html},\n}\n\n
\n
\n\n\n
\n In many biomedical, science, and engineering problems, one must sequentially decide which action to take next so as to maximize rewards. One general class of algorithms for optimizing interactions with the world, while simultaneously learning how the world operates, is the multi-armed bandit setting and, in particular, the contextual bandit case. In this setting, for each executed action, one observes rewards that are dependent on a given ’context’, available at each interaction with the world. The Thompson sampling algorithm has recently been shown to enjoy provable optimality properties for this set of problems, and to perform well in real-world settings. It facilitates generative and interpretable modeling of the problem at hand. Nevertheless, the design and complexity of the model limit its application, since one must both sample from the distributions modeled and calculate their expected rewards. We here show how these limitations can be overcome using variational inference to approximate complex models, applying to the reinforcement learning case advances developed for the inference case in the machine learning community over the past two decades. We consider contextual multi-armed bandit applications where the true reward distribution is unknown and complex, which we approximate with a mixture model whose parameters are inferred via variational inference. We show how the proposed variational Thompson sampling approach is accurate in approximating the true distribution, and attains reduced regrets even with complex reward distributions. The proposed algorithm is valuable for practical scenarios where restrictive modeling assumptions are undesirable.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2017\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Multiple Particle Filtering for Inference in the presence of state correlation of unknown mixing parameters.\n \n \n \n\n\n \n Urteaga, I.; and Djurić, P. M\n\n\n \n\n\n\n In 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pages 3849–3853, 2017. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@InProceedings{ip-Urteaga2017,\n  author    = {I{\\~n}igo Urteaga and Petar M Djuri\\'{c}},\n  title     = {{Multiple Particle Filtering for Inference in the presence of state correlation of unknown mixing parameters}},\n  booktitle = {2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)},\n  year      = {2017},\n  pages     = {3849--3853},\n  owner     = {iurteaga},\n  timestamp = {2017-04-07},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2016\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Sequential Monte Carlo methods under model uncertainty.\n \n \n \n\n\n \n Urteaga, I.; Bugallo, M. F.; and Djurić, P. M\n\n\n \n\n\n\n In 2016 IEEE Statistical Signal Processing Workshop (SSP), pages 1-5, June 2016. \n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@InProceedings{ip-Urteaga2016,\n  author    = {I{\\~n}igo Urteaga and M\\'{o}nica F. Bugallo and Petar M Djuri\\'{c}},\n  title     = {{Sequential Monte Carlo methods under model uncertainty}},\n  booktitle = {2016 IEEE Statistical Signal Processing Workshop (SSP)},\n  year      = {2016},\n  pages     = {1-5},\n  month     = {June},\n  abstract  = {We propose a Sequential Monte Carlo (SMC) method for filtering and prediction of time-varying signals under model uncertainty. Instead of resorting to model selection, we fuse the information from the considered models within the proposed SMC method. We achieve our goal by dynamically adjusting the resampling step according to the posterior predictive power of each model, which is updated sequentially as we observe more data. The method allows the models with better predictive powers to explore the state space with more resources than models lacking predictive power. This is done autonomously and dynamically within the SMC method. We show the validity of the presented method by evaluating it on an illustrative application.},\n  doi       = {10.1109/SSP.2016.7551747},\n  keywords  = {Monte Carlo methods;filtering theory;prediction theory;signal sampling;state-space methods;SMC method;information fusion;model uncertainty;resampling step;sequential Monte Carlo method;state-space method;time-varying signal filtering;time-varying signal prediction;Atmospheric measurements;Computational modeling;Mathematical model;Monte Carlo methods;Particle measurements;Predictive models;Uncertainty;Sequential Monte Carlo;dynamic model averaging;information fusion;particle filtering;resampling},\n  owner     = {iurteaga},\n  timestamp = {2016-04-29},\n}\n\n
\n
\n\n\n
\n We propose a Sequential Monte Carlo (SMC) method for filtering and prediction of time-varying signals under model uncertainty. Instead of resorting to model selection, we fuse the information from the considered models within the proposed SMC method. We achieve our goal by dynamically adjusting the resampling step according to the posterior predictive power of each model, which is updated sequentially as we observe more data. The method allows the models with better predictive powers to explore the state space with more resources than models lacking predictive power. This is done autonomously and dynamically within the SMC method. We show the validity of the presented method by evaluating it on an illustrative application.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Sequential Monte Carlo sampling for correlated latent long-memory time-series.\n \n \n \n\n\n \n Urteaga, I.; Bugallo, M. F.; and Djurić, P. M\n\n\n \n\n\n\n In 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pages 6580-6584, March 2016. \n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@InProceedings{ip-Urteaga2016a,\n  author    = {I{\\~n}igo Urteaga and M\\'{o}nica F. Bugallo and Petar M Djuri\\'{c}},\n  title     = {{Sequential Monte Carlo sampling for correlated latent long-memory time-series}},\n  booktitle = {2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)},\n  year      = {2016},\n  pages     = {6580-6584},\n  month     = {March},\n  abstract  = {In this paper, we consider state-space models where the latent processes represent correlated mixtures of fractional Gaussian processes embedded in white Gaussian noises. The observed data are nonlinear functions of the latent states. The fractional Gaussian processes have interesting properties including long-memory, self-similarity and scale-invariance, and thus, are of interest for building models in finance and econometrics. We propose sequential Monte Carlo (SMC) methods for inference of the latent processes where each method is based on different assumptions about the parameters of the state-space model. The methods are extensively evaluated via simulations of the popular stochastic volatility model.},\n  doi       = {10.1109/ICASSP.2016.7472945},\n  keywords  = {Gaussian noise;Monte Carlo methods;particle filtering (numerical methods);sequential estimation;state-space methods;stochastic processes;time series;correlated latent long-memory time-series;correlated mixtures;fractional Gaussian processes;nonlinear functions;sequential Monte Carlo sampling;state-space models;stochastic volatility model;white Gaussian noises;Biological system modeling;Econometrics;Gaussian noise;Gaussian processes;Monte Carlo methods;State-space methods;Sequential Monte Carlo;operator fractional Gaussian process;particle filtering;state-space models;time-series},\n  owner     = {iurteaga},\n  timestamp = {2016-04-14},\n}\n\n
\n
\n\n\n
\n In this paper, we consider state-space models where the latent processes represent correlated mixtures of fractional Gaussian processes embedded in white Gaussian noises. The observed data are nonlinear functions of the latent states. The fractional Gaussian processes have interesting properties including long-memory, self-similarity and scale-invariance, and thus, are of interest for building models in finance and econometrics. We propose sequential Monte Carlo (SMC) methods for inference of the latent processes where each method is based on different assumptions about the parameters of the state-space model. The methods are extensively evaluated via simulations of the popular stochastic volatility model.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2015\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n DTN Routing Optimised by Human Routines: The HURRy Protocol.\n \n \n \n\n\n \n Pérez-Sánchez, S.; María Cabero, J.; and Urteaga, I.\n\n\n \n\n\n\n In Wired/Wireless Internet Communications, volume 9071, of Lecture Notes in Computer Science, pages 299-312. Springer International Publishing, 2015.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@InCollection{ic-Perez-Sanchez2015,\n  Title                    = {{DTN Routing Optimised by Human Routines: The HURRy Protocol}},\n  Author                   = {Susana P{\\'e}rez-S{\\'a}nchez and Jos{\\'e} Mar{\\'i}a Cabero and I{\\~n}igo Urteaga},\n  Booktitle                = {Wired/Wireless Internet Communications},\n  Publisher                = {Springer International Publishing},\n  Year                     = {2015},\n  Pages                    = {299-312},\n  Series                   = {Lecture Notes in Computer Science},\n  Volume                   = {9071},\n\n  Abstract                 = {This paper proposes the HURRy (HUman Routines used for Routing) protocol, which infers and benefits from the social behaviour of nodes in disruptive networking environments. HURRy incorporates the contact duration to the information retrieved from historical encounters among neighbours, so that smarter routing decisions can be made. The specification of HURRy is based on the outcomes of a thorough experiment, which highlighted the importance of distinguishing between short and long contacts and deriving mathematical relations in order to optimally prioritize the available routes to a destination. HURRy introduces a novel and more meaningful rating system to evaluate the quality of each contact and overcome the limitations of other routing approaches in social environments.},\n  Doi                      = {10.1007/978-3-319-22572-2_22},\n  ISBN                     = {978-3-319-22571-5},\n  Keywords                 = {Challenged networks; DTN; Probabilistic routing; Social behaviour},\n  Language                 = {English},\n  Owner                    = {iurteaga},\n  Timestamp                = {2015-11-10}\n}\n\n
\n
\n\n\n
\n This paper proposes the HURRy (HUman Routines used for Routing) protocol, which infers and benefits from the social behaviour of nodes in disruptive networking environments. HURRy incorporates the contact duration to the information retrieved from historical encounters among neighbours, so that smarter routing decisions can be made. The specification of HURRy is based on the outcomes of a thorough experiment, which highlighted the importance of distinguishing between short and long contacts and deriving mathematical relations in order to optimally prioritize the available routes to a destination. HURRy introduces a novel and more meaningful rating system to evaluate the quality of each contact and overcome the limitations of other routing approaches in social environments.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Sequential Monte Carlo sampling for systems with fractional Gaussian processes.\n \n \n \n\n\n \n Urteaga, I.; Bugallo, M. F.; and Djurić, P. M\n\n\n \n\n\n\n In 2015 Proceedings of the 23th European Signal Processing Conference (EUSIPCO), pages 1246–1250, 2015. \n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@InProceedings{ip-Urteaga2015a,\n  author    = {I{\\~n}igo Urteaga and M\\'{o}nica F. Bugallo and Petar M Djuri\\'{c}},\n  title     = {{Sequential Monte Carlo sampling for systems with fractional Gaussian processes}},\n  booktitle = {2015 Proceedings of the 23th European Signal Processing Conference (EUSIPCO)},\n  year      = {2015},\n  pages     = {1246--1250},\n  doi       = {http://dx.doi.org/10.1109/EUSIPCO.2015.7362583},\n  owner     = {iurteaga},\n  timestamp = {2015-06-26},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Filtering of nonlinear time-series coupled by fractional Gaussian processes.\n \n \n \n\n\n \n Urteaga, I.; Bugallo, M. F.; and Djurić, P. M\n\n\n \n\n\n\n In 2015 IEEE 6th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP), pages 489–492, 2015. \n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@InProceedings{ip-Urteaga2015b,\n  author    = {I{\\~n}igo Urteaga and M\\'{o}nica F. Bugallo and Petar M Djuri\\'{c}},\n  title     = {{Filtering of nonlinear time-series coupled by fractional Gaussian processes}},\n  booktitle = {2015 IEEE 6th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP)},\n  year      = {2015},\n  pages     = {489--492},\n  abstract  = {In this paper we consider a set of time\\-/series that are coupled by latent fractional Gaussian processes. Specifically, we address time\\-/series that combine idiosyncratic short\\-/term and shared long\\-/term features. The long\\-/memory is modeled by fractional Gaussian processes, whereas the short\\-/memory properties are captured by linear models of past data. The observations are nonlinear functions of the hidden states and therefore we resort to a sequential Monte Carlo sampling technique for inference of the latent states. The proposed solution is evaluated via simulations of an illustrative practical scenario.},\n  doi       = {http://dx.doi.org/10.1109/CAMSAP.2015.7383843},\n  owner     = {iurteaga},\n  timestamp = {2015-11-10},\n}\n\n
\n
\n\n\n
\n In this paper we consider a set of time­/series that are coupled by latent fractional Gaussian processes. Specifically, we address time­/series that combine idiosyncratic short­/term and shared long­/term features. The long­/memory is modeled by fractional Gaussian processes, whereas the short­/memory properties are captured by linear models of past data. The observations are nonlinear functions of the hidden states and therefore we resort to a sequential Monte Carlo sampling technique for inference of the latent states. The proposed solution is evaluated via simulations of an illustrative practical scenario.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Particle filtering of ARMA processes of unknown order and parameters.\n \n \n \n\n\n \n Urteaga, I.; and Djurić, P. M\n\n\n \n\n\n\n In 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pages 4105-4109, April 2015. \n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@InProceedings{ip-Urteaga2015,\n  Title                    = {{Particle filtering of {ARMA} processes of unknown order and parameters}},\n  Author                   = {I{\\~n}igo Urteaga and Petar M Djuri\\'{c}},\n  Booktitle                = {2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)},\n  Year                     = {2015},\n  Month                    = {April},\n  Pages                    = {4105-4109},\n\n  Abstract                 = {This paper considers inference on the widely used state-space models described by hidden ARMA state processes of unknown order observed via non-linear functions of the states. We propose a particle filtering method for sequentially inferring the unknown ARMA time-series by Rao-Blackwellization of all the static unknowns. Our method does not rely either on any assumption on the model order or on the static ARMA and state innovation parameters. Consequently, when the ARMA model order is unknown, it can be used without a follow-up model selection procedure. Extensive simulation results validate the proposed method across different ARMA models.},\n  Doi                      = {10.1109/ICASSP.2015.7178743},\n  Keywords                 = {particle filtering (numerical methods);time series;ARMA time-series;Rao-Blackwellization;hidden ARMA state processes;innovation parameters;nonlinear functions;particle filtering method;state-space models;Computational modeling;Covariance matrices;Estimation;Mathematical model;Noise;State-space methods;Technological innovation;ARMA models;Rao-Blackwellization;State-space models;particle filtering;time-series},\n  Owner                    = {iurteaga},\n  Timestamp                = {2015-10-15}\n}\n\n
\n
\n\n\n
\n This paper considers inference on the widely used state-space models described by hidden ARMA state processes of unknown order observed via non-linear functions of the states. We propose a particle filtering method for sequentially inferring the unknown ARMA time-series by Rao-Blackwellization of all the static unknowns. Our method does not rely either on any assumption on the model order or on the static ARMA and state innovation parameters. Consequently, when the ARMA model order is unknown, it can be used without a follow-up model selection procedure. Extensive simulation results validate the proposed method across different ARMA models.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2014\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Estimation of ARMA state processes by particle filtering.\n \n \n \n\n\n \n Urteaga, I.; and Djurić, P. M\n\n\n \n\n\n\n In 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pages 8033-8037, May 2014. \n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@InProceedings{ip-Urteaga2014,\n  Title                    = {{Estimation of ARMA state processes by particle filtering}},\n  Author                   = {I{\\~n}igo Urteaga and Petar M Djuri\\'{c}},\n  Booktitle                = {2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)},\n  Year                     = {2014},\n  Month                    = {May},\n  Pages                    = {8033-8037},\n\n  Abstract                 = {There are many practical signal processing settings where a state-space model consists of a state described by an ARMA process that is observed via non-linear functions of the state. In this paper, we propose a particle filtering method for sequentially estimating the ARMA process in the presence of unknown parameters. In the considered problem, we have static and dynamic unknowns, and we show how to handle the static parameters so that the estimation of the state process does not degrade with time. We propose a new particle filter that approximates the posterior of all the unknowns by a Gaussian distribution, in combination with a Monte Carlo approach to the Rao-Blackwellization of the static parameters. We demonstrate the performance of the proposed method by extensive computer simulations.},\n  Doi                      = {10.1109/ICASSP.2014.6855165},\n  Keywords                 = {Gaussian distribution;Monte Carlo methods;autoregressive moving average processes;parameter estimation;particle filtering (numerical methods);ARMA state process estimation;Gaussian distribution;Monte Carlo approach;Rao-Blackwellization approach;dynamic unknown parameter;extensive computer simulations;nonlinear functions;particle filtering method;signal processing;state-space model;static unknown parameter;Approximation methods;Autoregressive processes;Biological system modeling;Estimation;Mathematical model;Monte Carlo methods;State-space methods;ARMA processes;Rao-Blackwellization;particle filtering;state-space estimation},\n  Owner                    = {iurteaga},\n  Timestamp                = {2014-10-01}\n}\n\n
\n
\n\n\n
\n There are many practical signal processing settings where a state-space model consists of a state described by an ARMA process that is observed via non-linear functions of the state. In this paper, we propose a particle filtering method for sequentially estimating the ARMA process in the presence of unknown parameters. In the considered problem, we have static and dynamic unknowns, and we show how to handle the static parameters so that the estimation of the state process does not degrade with time. We propose a new particle filter that approximates the posterior of all the unknowns by a Gaussian distribution, in combination with a Monte Carlo approach to the Rao-Blackwellization of the static parameters. We demonstrate the performance of the proposed method by extensive computer simulations.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2013\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Replication and optimization of hedge fund risk factor exposures.\n \n \n \n\n\n \n Johnston, D. E.; Urteaga, I.; and Djurić, P. M.\n\n\n \n\n\n\n In 2013 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pages 8712-8716, May 2013. \n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@InProceedings{ip-Johnston2013,\n  Title                    = {{Replication and optimization of hedge fund risk factor exposures}},\n  Author                   = {Douglas E. Johnston and I{\\~n}igo Urteaga and Petar M. Djuri\\'{c}},\n  Booktitle                = {2013 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)},\n  Year                     = {2013},\n  Month                    = {May},\n  Pages                    = {8712-8716},\n\n  Abstract                 = {In this paper, we propose a novel approach for decomposing hedge fund returns onto observable risk factors. We utilize a vector stochastic-volatility model to extract the time-varying exposure of low frequency hedge fund returns on high frequency market data. We implement the estimation by using particle filtering and the concept of Rao-Blackwellization. With the latter, we remove all the static parameters of the model and thereby reduce the dimension of the parameter space for particle generation. Thus, we are able to obtain accurate estimates of the posterior distributions of the model states. For our model, this reduction is significant because the number of static parameters is large. We use the proposed model to analyze hedge fund performance and to optimally replicate hedge fund strategies economically. We demonstrate the validity and effectiveness of the method by computer simulations.},\n  Doi                      = {http://dx.doi.org/10.1109/ICASSP.2013.6639367},\n  ISSN                     = {1520-6149},\n  Keywords                 = {investment;optimisation;particle filtering (numerical methods);risk management;stochastic processes;Rao-Blackwellization;computer simulations;hedge fund performance;hedge fund returns decomposition;hedge fund risk factor exposures optimization;hedge fund risk factor exposures replication;hedge fund strategies;high frequency market data;low frequency hedge fund returns;model states;observable risk factors;parameter space;particle filtering;particle generation;posterior distributions;static parameters;time-varying exposure;vector stochastic-volatility model;Bayes methods;Computational modeling;Mathematical model;Portfolios;Stochastic processes;Stock markets;Vectors;CAPM;VaR;beta;hedge fund;particle filtering;risk-management;stochastic volatility},\n  Owner                    = {iurteaga},\n  Timestamp                = {2014-02-10}\n}\n\n
\n
\n\n\n
\n In this paper, we propose a novel approach for decomposing hedge fund returns onto observable risk factors. We utilize a vector stochastic-volatility model to extract the time-varying exposure of low frequency hedge fund returns on high frequency market data. We implement the estimation by using particle filtering and the concept of Rao-Blackwellization. With the latter, we remove all the static parameters of the model and thereby reduce the dimension of the parameter space for particle generation. Thus, we are able to obtain accurate estimates of the posterior distributions of the model states. For our model, this reduction is significant because the number of static parameters is large. We use the proposed model to analyze hedge fund performance and to optimally replicate hedge fund strategies economically. We demonstrate the validity and effectiveness of the method by computer simulations.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2011\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n AWARE: Activity AWARE network clustering for wireless sensor networks.\n \n \n \n\n\n \n Urteaga, I.; Yu, N.; Hubbell, N.; and Han, Q.\n\n\n \n\n\n\n In IEEE Local Computer Networks, pages 589-596, 2011. \n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@InProceedings{ip-Urteaga2011,\n  Title                    = {{AWARE: Activity AWARE network clustering for wireless sensor networks}},\n  Author                   = {I{\\~n}igo Urteaga and Na Yu and Nicholas Hubbell and Qi Han},\n  Booktitle                = {IEEE Local Computer Networks},\n  Year                     = {2011},\n  Pages                    = {589-596},\n\n  Bibsource                = {DBLP, http://dblp.uni-trier.de},\n  Doi                      = {http://dx.doi.org/10.1109/LCN.2011.6115521},\n  Owner                    = {iurteaga},\n  Timestamp                = {2014-02-11}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2010\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n On the design of a scalable multimedia streaming system based on receiver-driven flow and congestion awareness.\n \n \n \n \n\n\n \n Urteaga, I.; Unanue, I.; Ser, J. D.; Sánchez, P. J.; and Rodriguez, A.\n\n\n \n\n\n\n In 2010 International Conference on Signal Processing and Multimedia Applications (SIGMAP), pages 39-45, July 2010. \n \n\n\n\n
\n\n\n\n \n \n \"OnHttp://ieeexplore.ieee.org/xpl/login.jsp?tp\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@InProceedings{ip-Urteaga2010,\n  Title                    = {{On the design of a scalable multimedia streaming system based on receiver-driven flow and congestion awareness}},\n  Author                   = {I{\\~n}igo Urteaga and Iraide Unanue and Javier Del Ser and Pedro J. S{\\'a}nchez and Aitor Rodriguez},\n  Booktitle                = {2010 International Conference on Signal Processing and Multimedia Applications (SIGMAP)},\n  Year                     = {2010},\n  Month                    = {July},\n  Pages                    = {39-45},\n\n  Abstract                 = {In this position paper we present the design of an end-to-end scalable content streaming system that optimizes the quality of experience of the end-user by allowing each client to retrieve a customized multimedia stream, based on both network and client states. By taking advantage of multimedia scalability, our proposed receiverdriven architecture performs a multilayered streaming, where each client is responsible for controlling the number of multimedia layers it demands from the server. Furthermore, the streaming system proposed herein implements both congestion and flow control mechanisms, which are also delegated to the receiver. In order to properly address both network and client states and restrictions, a set of specific metrics (Buffer State, Interarrival Jitter and Loss Event Rate) are utilized, which have been specifically designed to match the miscellaneous characteristics of heterogeneous networks and end devices. Built upon such metrics, we present a decision algorithm that jointly performs congestion and flow control, while maximizing inter-session fairness and end-user quality of experience. The proposed architecture combines different standard protocols while guaranteeing independence between components of the streaming system.},\n  Day                      = {28},\n  Keywords                 = {Measurement;Multimedia communication;Protocols;Real time systems;Servers;Static VAr compensators;Streaming media;Congestion control;Flow control;Scalable multimedia content;Streaming},\n  Location                 = {Athens, Greece},\n  Owner                    = {iurteaga},\n  Timestamp                = {2014-02-11},\n  Url                      = {http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=5742565&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D5742565}\n}\n\n
\n
\n\n\n
\n In this position paper we present the design of an end-to-end scalable content streaming system that optimizes the quality of experience of the end-user by allowing each client to retrieve a customized multimedia stream, based on both network and client states. By taking advantage of multimedia scalability, our proposed receiverdriven architecture performs a multilayered streaming, where each client is responsible for controlling the number of multimedia layers it demands from the server. Furthermore, the streaming system proposed herein implements both congestion and flow control mechanisms, which are also delegated to the receiver. In order to properly address both network and client states and restrictions, a set of specific metrics (Buffer State, Interarrival Jitter and Loss Event Rate) are utilized, which have been specifically designed to match the miscellaneous characteristics of heterogeneous networks and end devices. Built upon such metrics, we present a decision algorithm that jointly performs congestion and flow control, while maximizing inter-session fairness and end-user quality of experience. The proposed architecture combines different standard protocols while guaranteeing independence between components of the streaming system.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2009\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n REDFLAG a Run-timE, Distributed, Flexible, Lightweight, And Generic fault detection service for data-driven wireless sensor applications.\n \n \n \n\n\n \n Urteaga, I.; Barnhart, K.; and Han, Q.\n\n\n \n\n\n\n In IEEE International Conference on Pervasive Computing and Communications, 2009, pages 1-9, March 2009. \n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@InProceedings{ip-Urteaga2009,\n  Title                    = {{REDFLAG a Run-timE, Distributed, Flexible, Lightweight, And Generic fault detection service for data-driven wireless sensor applications}},\n  Author                   = {I{\\~n}igo Urteaga and Kevin Barnhart and Qi Han},\n  Booktitle                = {IEEE International Conference on Pervasive Computing and Communications, 2009},\n  Year                     = {2009},\n  Month                    = {March},\n  Pages                    = {1-9},\n\n  Abstract                 = {Increased interest in Wireless Sensor Networks (WSNs) by scientists and engineers is forcing WSN research to focus on application requirements. Data is available as never before in many fields of study; practitioners are now burdened with the challenge of doing data-rich research rather than being data-starved. In-situ sensors can be prone to errors, links between nodes are often unreliable, and nodes may become unresponsive in harsh environments, leaving to researchers the onerous task of deciphering often anomalous data. Presented here is the REDFLAG fault detection service for WSN applications, a Run-timE, Distributed, Flexible, detector of faults, that is also Lightweight And Generic. REDFLAG addresses the two most worrisome issues in data-driven wireless sensor applications: abnormal data and missing data. REDFLAG exposes faults as they occur by using distributed algorithms in order to conserve energy. Simulation results show that REDFLAG is lightweight both in terms of footprint and required power resources while ensuring satisfactory detection and diagnosis accuracy. Because REDFLAG is unrestrictive, it is generically available to a myriad of applications and scenarios.},\n  Doi                      = {http://dx.doi.org/10.1109/PERCOM.2009.4912766},\n  Keywords                 = {distributed algorithms;fault diagnosis;wireless sensor networks;REDFLAG;abnormal data;data-driven wireless sensor applications;distributed algorithms;generic fault detection service;in-situ sensors;missing data;wireless sensor networks;Application software;Calibration;Data engineering;Distributed algorithms;Fault detection;Network topology;Runtime;Sensor phenomena and characterization;Signal processing;Wireless sensor networks},\n  Owner                    = {iurteaga},\n  Timestamp                = {2014-02-11}\n}\n\n
\n
\n\n\n
\n Increased interest in Wireless Sensor Networks (WSNs) by scientists and engineers is forcing WSN research to focus on application requirements. Data is available as never before in many fields of study; practitioners are now burdened with the challenge of doing data-rich research rather than being data-starved. In-situ sensors can be prone to errors, links between nodes are often unreliable, and nodes may become unresponsive in harsh environments, leaving to researchers the onerous task of deciphering often anomalous data. Presented here is the REDFLAG fault detection service for WSN applications, a Run-timE, Distributed, Flexible, detector of faults, that is also Lightweight And Generic. REDFLAG addresses the two most worrisome issues in data-driven wireless sensor applications: abnormal data and missing data. REDFLAG exposes faults as they occur by using distributed algorithms in order to conserve energy. Simulation results show that REDFLAG is lightweight both in terms of footprint and required power resources while ensuring satisfactory detection and diagnosis accuracy. Because REDFLAG is unrestrictive, it is generically available to a myriad of applications and scenarios.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);