La introducción de la incertidumbre en modelos epidemiológicos es un área de incipiente actividad en la actualidad. En la mayor parte de los enfoques adoptados se asume un comportamiento gaussiano en la formulación de dichos modelos a través de la perturbación de los parámetros vía el proceso de Wiener o movimiento browiniano u otro proceso discretizado equivalente.
En esta conferencia se expone un método alternativo de introducir la incertidumbre en modelos de tipo epidemiológico que permite considerar patrones no necesariamente normales o gaussianos. Con el enfoque adoptado se determinará en contextos epidemiológicos que tienen un gran número de aplicaciones, la primera función de densidad de probabilidad del proceso estocástico solución. Esto permite la determinación exacta de la respuesta media y su variabilidad, así como la construcción de predicciones probabilísticas con intervalos de confianza sin necesidad de recurrir a aproximaciones asintóticas, a veces de difícil legitimación. El enfoque adoptado también permite determinar la distribución probabilística de parámetros que tienen gran importancia para los epidemiólogos, incluyendo la distribución del tiempo hasta que un cierto número de infectados permanecen en la población, lo cual, por ejemplo, permite tener información probabilística para declarar el estado de epidemia o pandemia de una determinada enfermedad. Finalmente, se expondrá algunos de los retos computacionales inmediatos a los que se enfrenta la técnica expuesta.
Common Fixed Theorems Using Random Implicit Iterative Schemesinventy
This document summarizes research on common fixed point theorems using random implicit iterative schemes. It defines random Mann, Ishikawa, and SP iterative schemes. It also defines modified implicit random iterative schemes associated with families of random asymptotically nonexpansive operators. The paper proves the convergence of two random implicit iterative schemes to a random common fixed point. This generalizes previous results and provides new convergence theorems for random operators in Banach spaces.
This document provides an overview of some common continuous and discrete probability distributions, including their probability density/mass functions, cumulative distribution functions, expected values, variances, and moment generating functions. It covers standard and rescaled versions of distributions like the uniform, normal, exponential, gamma, binomial, Poisson, geometric, negative binomial, and hypergeometric distributions. Formulas are provided for transforming between standard and rescaled versions.
This document discusses regression with frailty in survival analysis using the Cox proportional hazards model. It introduces survival analysis concepts like the hazard function and survival function. It then describes how to incorporate frailty, a random effect, into the Cox model to account for clustering in survival times. The Newton-Raphson method is used to estimate model parameters by maximizing the penalized partial likelihood. A simulation study applies this approach to data on infections in kidney patients.
On problem-of-parameters-identification-of-dynamic-objectCemal Ardil
This document discusses methods for identifying parameters of dynamic objects described by systems of ordinary differential equations. Specifically, it addresses problems with multiple initial boundary conditions that are not shared across points.
The paper proposes a new "conditions shift" method to transfer the initial boundary conditions in a way that eliminates differential links and multipoint conditions. This reduces the parameter identification problem to solving either an algebraic system or a quadratic programming problem.
Two cases are considered: case A where the number of conditions equals the number of conditionally free parameters, resulting in a single parameter vector solution. Case B where additional conditions on the parameters are needed in the form of equalities or inequalities, resulting in an optimization problem to select optimal parameter values.
Existance Theory for First Order Nonlinear Random Dfferential Equartioninventionjournals
In this paper, the existence of a solution of nonlinear random differential equation of first order is proved under Caratheodory condition by using suitable fixed point theorem. 2000 Mathematics Subject Classification: 34F05, 47H10, 47H4
The document provides information about Lagrangian interpolation, including:
1. It introduces Lagrangian interpolation as a method to find the value of a function at a discrete point using a polynomial that passes through known data points.
2. It gives the formula for the Lagrangian interpolating polynomial and provides an example of using it to find the velocity of a rocket at a certain time.
3. It discusses using higher order polynomials for interpolation, providing another example that calculates velocity using quadratic and cubic polynomials.
We use stochastic methods to present mathematically correct representation of the wave function. Informal construction was developed by R. Feynman. This approach were introduced first by H. Doss Sur une Resolution Stochastique de l'Equation de Schrödinger à Coefficients Analytiques. Communications in Mathematical Physics
October 1980, Volume 73, Issue 3, pp 247–264.
Primary intention is to discuss formal stochastic representation of the Schrodinger equation solution with its applications to the theory of demolition quantum measurements.
I will appreciate your comments.
Common Fixed Theorems Using Random Implicit Iterative Schemesinventy
This document summarizes research on common fixed point theorems using random implicit iterative schemes. It defines random Mann, Ishikawa, and SP iterative schemes. It also defines modified implicit random iterative schemes associated with families of random asymptotically nonexpansive operators. The paper proves the convergence of two random implicit iterative schemes to a random common fixed point. This generalizes previous results and provides new convergence theorems for random operators in Banach spaces.
This document provides an overview of some common continuous and discrete probability distributions, including their probability density/mass functions, cumulative distribution functions, expected values, variances, and moment generating functions. It covers standard and rescaled versions of distributions like the uniform, normal, exponential, gamma, binomial, Poisson, geometric, negative binomial, and hypergeometric distributions. Formulas are provided for transforming between standard and rescaled versions.
This document discusses regression with frailty in survival analysis using the Cox proportional hazards model. It introduces survival analysis concepts like the hazard function and survival function. It then describes how to incorporate frailty, a random effect, into the Cox model to account for clustering in survival times. The Newton-Raphson method is used to estimate model parameters by maximizing the penalized partial likelihood. A simulation study applies this approach to data on infections in kidney patients.
On problem-of-parameters-identification-of-dynamic-objectCemal Ardil
This document discusses methods for identifying parameters of dynamic objects described by systems of ordinary differential equations. Specifically, it addresses problems with multiple initial boundary conditions that are not shared across points.
The paper proposes a new "conditions shift" method to transfer the initial boundary conditions in a way that eliminates differential links and multipoint conditions. This reduces the parameter identification problem to solving either an algebraic system or a quadratic programming problem.
Two cases are considered: case A where the number of conditions equals the number of conditionally free parameters, resulting in a single parameter vector solution. Case B where additional conditions on the parameters are needed in the form of equalities or inequalities, resulting in an optimization problem to select optimal parameter values.
Existance Theory for First Order Nonlinear Random Dfferential Equartioninventionjournals
In this paper, the existence of a solution of nonlinear random differential equation of first order is proved under Caratheodory condition by using suitable fixed point theorem. 2000 Mathematics Subject Classification: 34F05, 47H10, 47H4
The document provides information about Lagrangian interpolation, including:
1. It introduces Lagrangian interpolation as a method to find the value of a function at a discrete point using a polynomial that passes through known data points.
2. It gives the formula for the Lagrangian interpolating polynomial and provides an example of using it to find the velocity of a rocket at a certain time.
3. It discusses using higher order polynomials for interpolation, providing another example that calculates velocity using quadratic and cubic polynomials.
We use stochastic methods to present mathematically correct representation of the wave function. Informal construction was developed by R. Feynman. This approach were introduced first by H. Doss Sur une Resolution Stochastique de l'Equation de Schrödinger à Coefficients Analytiques. Communications in Mathematical Physics
October 1980, Volume 73, Issue 3, pp 247–264.
Primary intention is to discuss formal stochastic representation of the Schrodinger equation solution with its applications to the theory of demolition quantum measurements.
I will appreciate your comments.
BlUP and BLUE- REML of linear mixed modelKyusonLim
This document discusses linear mixed models and the estimation methods BLUP and BLUE. It provides an introduction to random and fixed effects, as well as the mixed model equations used to derive BLUP and BLUE simultaneously. BLUP provides the best linear unbiased predictions of random effects, while BLUE gives the best linear unbiased estimates of fixed effects. The document also provides an example using the orthodontic growth data set to demonstrate fitting a linear mixed model and estimate variance components with REML.
Regularization and variable selection via elastic netKyusonLim
The document summarizes the Elastic Net regularization method for variable selection in datasets with more predictors than observations (p > n). It describes how the Elastic Net overcomes limitations of LASSO and Ridge Regression by performing automatic variable selection, continuous shrinkage, and selecting groups of correlated predictors. The Naive Elastic Net formulation is presented, along with how it relates to LASSO and Ridge penalties. Computational details of the Elastic Net, including the LARS-EN algorithm and simulations, are discussed.
Fixed Point Theorm In Probabilistic Analysisiosrjce
Probabilistic operator theory is the branch of probabilistic analysis which is concerned with the study of
operator-valued random variables and their properties. The development of a theory of random operators is of
interest in its own right as a probabilistic generalization of (deterministic) operator theory and just as operator
theory is of fundamental importance in the study of operator equations, the development of probabilistic operator
theory is required for the study of various classes of random equations
2013.06.17 Time Series Analysis Workshop ..Applications in Physiology, Climat...NUI Galway
Professor Dimitris Kugiumtzis, Aristotle University of Thessaloniki, Greece, presented this workshop on linear stochastic processes as part of the Summer School on Modern Statistical Analysis and Computational Methods hosted by the Social Sciences Computing Hub at the Whitaker Institute, NUI Galway on 17th-19th June 2013.
The document provides information about numerical methods topics including:
1) Lagrange's interpolation formula for finding a polynomial that passes through given data points, either equally or unequally spaced. The formula uses divided differences to find the coefficients.
2) Newton's divided difference interpolation formula for unequal intervals that also uses divided differences.
3) The nature of divided differences - for a polynomial of degree n, the nth divided difference is constant.
4) Examples of evaluating divided differences and constructing divided difference tables are given.
This document provides an overview of statistical inference concepts including:
1. Best unbiased estimators, which have minimum mean squared error for a given parameter. The best unbiased estimator, if it exists, must be a function of a sufficient statistic.
2. Sufficiency and the Rao-Blackwell theorem, which states that conditioning an estimator on a sufficient statistic produces a uniformly better estimator.
3. The Cramér-Rao lower bound, which provides a lower bound on the variance of unbiased estimators. Examples are given to illustrate key concepts like when the bound may not hold.
4. Examples are worked through to find minimum variance unbiased estimators, maximum likelihood estimators, and confidence intervals for various distributions
The document discusses Bayesian networks and causal discovery methods. It provides definitions and examples of key concepts in Bayesian networks including directed acyclic graphs (DAGs), Markov blankets, and the Markov condition. It also describes different approaches to learning Bayesian network structures, including constraint-based methods such as the PC algorithm and score-based methods like greedy hill climbing. Causal discovery from data aims to infer causal relationships between variables using techniques like conditional independence tests on Bayesian networks.
This document discusses various methods for polynomial interpolation of data points, including Newton's divided difference interpolating polynomials and Lagrange interpolation polynomials. It provides formulas and examples for linear, quadratic, and general polynomial interpolation using Newton's method. It also covers an example of using multiple linear regression with log-transformed data to develop a model relating fluid flow through a pipe to the pipe's diameter and slope.
This MATLAB code provides an example of plotting a truncated Fourier series representation of a square wave signal. It computes the Fourier series in both complex exponential form (yce) and trigonometric form (yt) up to the Nth term, where N is an odd integer. It plots the original square wave, the truncated Fourier series approximations yce and yt, and their amplitude and phase spectra. The code demonstrates how to calculate and visualize truncated Fourier series representations of a periodic signal.
Multiple Imputation of Missing Blood Pressure Covariates in Survival Analysis examines how to handle missing blood pressure (BP) measurements in survival analysis. BP was not measured for about 12.5% of participants. Those with missing BP had higher mortality rates, potentially distorting the influence of BP on survival. The study uses multiple imputation to generate plausible BP values for participants with missing data and pools results from multiple imputed datasets to account for uncertainty in imputed values.
The document discusses techniques for parameter selection and sensitivity analysis when estimating parameters from observational data. It introduces local sensitivity analysis based on derivatives to determine how sensitive model outputs are to individual parameters. Global sensitivity analysis techniques like ANOVA (analysis of variance) are also discussed, which quantify how parameter uncertainties contribute to uncertainty in model outputs. The ANOVA approach uses a Sobol decomposition to represent models as sums of parameter main effects and interactions, allowing variance-based sensitivity indices to be defined that quantify the influence of individual parameters and groups of parameters.
The document discusses statistical representation of random inputs in continuum models. It provides examples of representing random fields using the Karhunen-Loeve expansion, which expresses a random field as the sum of orthogonal deterministic basis functions and random variables. Common choices for the covariance function in the expansion include the radial basis function and limiting cases of fully correlated and uncorrelated fields. The covariance function can be approximated from samples of the random field to enable representation in applications.
This document discusses Bayesian reliability analysis of systems when component lifetimes follow a geometric distribution. It provides the probability mass function of the geometric distribution and defines the prior and posterior distributions of the distribution parameter θ. It then derives the Bayesian reliability estimators for k-out-of-n, series, parallel and cold standby systems. Simulation studies are presented to analyze the Bayes risk of the estimators for different values of the model parameters.
A 3hrs intro lecture to Approximate Bayesian Computation (ABC), given as part of a PhD course at Lund University, February 2016. For sample codes see http://www.maths.lu.se/kurshemsida/phd-course-fms020f-nams002-statistical-inference-for-partially-observed-stochastic-processes/
Talk on the design on non-negative unbiased estimators, useful to perform exact inference for intractable target distributions.
Corresponds to the article http://arxiv.org/abs/1309.6473
1) The document discusses solving partial differential equations using variable separation. It presents the one-dimensional wave equation and solves it using variable separation.
2) It derives three cases for the solution based on whether k is positive, negative, or zero. It then presents the general solution as a summation involving sines and cosines.
3) It applies the general solution to two example problems of a vibrating string, finding the displacement as a function of position and time by satisfying the boundary conditions.
The first report of Machine Learning Seminar organized by Computational Linguistics Laboratory at Kazan Federal University. See http://cll.niimm.ksu.ru/cms/lang/en_US/main/seminars/mlseminar
Estimation of the score vector and observed information matrix in intractable...Pierre Jacob
This document discusses methods for estimating the score vector and observed information matrix for intractable models. It begins with an overview of using derivatives in sampling algorithms. It then discusses iterated filtering, a method for estimating derivatives in hidden Markov models when the likelihood is not available in closed form. Iterated filtering introduces a perturbed model and relates the posterior mean to the score and posterior variance to the observed information matrix. The document outlines proofs that show this relationship as the prior concentration increases.
Welcome to International Journal of Engineering Research and Development (IJERD)IJERD Editor
call for paper 2012, hard copy of journal, research paper publishing, where to publish research paper,
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
El diseño, construcción y desarrollo de robots sociales que convivan con los humanos facilitándoles sus condiciones de vida es uno de los retos tecnológicos más importantes de la actualidad. En esta presentación describiremos el camino seguido en esta línea desde RoboLab a través de un framework de desarrollo para robótica basado en componentes llamado RoboComp, de fuentes abiertas y creado durante los últimos 10 años en colaboración con varias universidades del país. Se presentarán brevemente los diferentes tipos de robots sociales que construidos en RoboLab, su uso y evolución con el tiempo. Todos ellos se han desarrollado sobre RoboComp que proporciona un conjunto de herramientas para asistir en el ciclo de vida de los componentes software. Entre éstas, se cuenta con un generador de código que usa varios lenguajes específicos de dominio para definir la conectividad y parte de la funcionalidad de los componentes. Finalmente, se describirá el estado actual de la nueva arquitectura cognitiva CORTEX, desarrollada sobre RoboComp y que, en colaboración con varios grupos de robótica, está siendo implementada y probada en varios proyectos y nuevos robots.
Para hacer realidad la energía de fusión como una fuente energética limpia, inagotable, segura y económica, las bases de datos de los dispositivos actuales (tokamaks y stellarators) deben analizarse en su totalidad (actualmente el 90% de los datos permanece sin procesar). Estos análisis completos permitirán una óptima planificación de la operación de ITER, cuyos resultados, a su vez, serán básicos en el diseño de DEMO.
Para efectuar el análisis masivo de datos, la alternativa que se propone es el uso rutinario de técnicas de aprendizaje automático. A partir de la utilización de estas técnicas se han
podido resolver problemas reales y de gran importancia en la operación de los dispositivos experimentales de fusión actuales. El núcleo central de la conferencia versará en la presentación de problemas prácticos y la solución aportada a cada uno de ellos.
BlUP and BLUE- REML of linear mixed modelKyusonLim
This document discusses linear mixed models and the estimation methods BLUP and BLUE. It provides an introduction to random and fixed effects, as well as the mixed model equations used to derive BLUP and BLUE simultaneously. BLUP provides the best linear unbiased predictions of random effects, while BLUE gives the best linear unbiased estimates of fixed effects. The document also provides an example using the orthodontic growth data set to demonstrate fitting a linear mixed model and estimate variance components with REML.
Regularization and variable selection via elastic netKyusonLim
The document summarizes the Elastic Net regularization method for variable selection in datasets with more predictors than observations (p > n). It describes how the Elastic Net overcomes limitations of LASSO and Ridge Regression by performing automatic variable selection, continuous shrinkage, and selecting groups of correlated predictors. The Naive Elastic Net formulation is presented, along with how it relates to LASSO and Ridge penalties. Computational details of the Elastic Net, including the LARS-EN algorithm and simulations, are discussed.
Fixed Point Theorm In Probabilistic Analysisiosrjce
Probabilistic operator theory is the branch of probabilistic analysis which is concerned with the study of
operator-valued random variables and their properties. The development of a theory of random operators is of
interest in its own right as a probabilistic generalization of (deterministic) operator theory and just as operator
theory is of fundamental importance in the study of operator equations, the development of probabilistic operator
theory is required for the study of various classes of random equations
2013.06.17 Time Series Analysis Workshop ..Applications in Physiology, Climat...NUI Galway
Professor Dimitris Kugiumtzis, Aristotle University of Thessaloniki, Greece, presented this workshop on linear stochastic processes as part of the Summer School on Modern Statistical Analysis and Computational Methods hosted by the Social Sciences Computing Hub at the Whitaker Institute, NUI Galway on 17th-19th June 2013.
The document provides information about numerical methods topics including:
1) Lagrange's interpolation formula for finding a polynomial that passes through given data points, either equally or unequally spaced. The formula uses divided differences to find the coefficients.
2) Newton's divided difference interpolation formula for unequal intervals that also uses divided differences.
3) The nature of divided differences - for a polynomial of degree n, the nth divided difference is constant.
4) Examples of evaluating divided differences and constructing divided difference tables are given.
This document provides an overview of statistical inference concepts including:
1. Best unbiased estimators, which have minimum mean squared error for a given parameter. The best unbiased estimator, if it exists, must be a function of a sufficient statistic.
2. Sufficiency and the Rao-Blackwell theorem, which states that conditioning an estimator on a sufficient statistic produces a uniformly better estimator.
3. The Cramér-Rao lower bound, which provides a lower bound on the variance of unbiased estimators. Examples are given to illustrate key concepts like when the bound may not hold.
4. Examples are worked through to find minimum variance unbiased estimators, maximum likelihood estimators, and confidence intervals for various distributions
The document discusses Bayesian networks and causal discovery methods. It provides definitions and examples of key concepts in Bayesian networks including directed acyclic graphs (DAGs), Markov blankets, and the Markov condition. It also describes different approaches to learning Bayesian network structures, including constraint-based methods such as the PC algorithm and score-based methods like greedy hill climbing. Causal discovery from data aims to infer causal relationships between variables using techniques like conditional independence tests on Bayesian networks.
This document discusses various methods for polynomial interpolation of data points, including Newton's divided difference interpolating polynomials and Lagrange interpolation polynomials. It provides formulas and examples for linear, quadratic, and general polynomial interpolation using Newton's method. It also covers an example of using multiple linear regression with log-transformed data to develop a model relating fluid flow through a pipe to the pipe's diameter and slope.
This MATLAB code provides an example of plotting a truncated Fourier series representation of a square wave signal. It computes the Fourier series in both complex exponential form (yce) and trigonometric form (yt) up to the Nth term, where N is an odd integer. It plots the original square wave, the truncated Fourier series approximations yce and yt, and their amplitude and phase spectra. The code demonstrates how to calculate and visualize truncated Fourier series representations of a periodic signal.
Multiple Imputation of Missing Blood Pressure Covariates in Survival Analysis examines how to handle missing blood pressure (BP) measurements in survival analysis. BP was not measured for about 12.5% of participants. Those with missing BP had higher mortality rates, potentially distorting the influence of BP on survival. The study uses multiple imputation to generate plausible BP values for participants with missing data and pools results from multiple imputed datasets to account for uncertainty in imputed values.
The document discusses techniques for parameter selection and sensitivity analysis when estimating parameters from observational data. It introduces local sensitivity analysis based on derivatives to determine how sensitive model outputs are to individual parameters. Global sensitivity analysis techniques like ANOVA (analysis of variance) are also discussed, which quantify how parameter uncertainties contribute to uncertainty in model outputs. The ANOVA approach uses a Sobol decomposition to represent models as sums of parameter main effects and interactions, allowing variance-based sensitivity indices to be defined that quantify the influence of individual parameters and groups of parameters.
The document discusses statistical representation of random inputs in continuum models. It provides examples of representing random fields using the Karhunen-Loeve expansion, which expresses a random field as the sum of orthogonal deterministic basis functions and random variables. Common choices for the covariance function in the expansion include the radial basis function and limiting cases of fully correlated and uncorrelated fields. The covariance function can be approximated from samples of the random field to enable representation in applications.
This document discusses Bayesian reliability analysis of systems when component lifetimes follow a geometric distribution. It provides the probability mass function of the geometric distribution and defines the prior and posterior distributions of the distribution parameter θ. It then derives the Bayesian reliability estimators for k-out-of-n, series, parallel and cold standby systems. Simulation studies are presented to analyze the Bayes risk of the estimators for different values of the model parameters.
A 3hrs intro lecture to Approximate Bayesian Computation (ABC), given as part of a PhD course at Lund University, February 2016. For sample codes see http://www.maths.lu.se/kurshemsida/phd-course-fms020f-nams002-statistical-inference-for-partially-observed-stochastic-processes/
Talk on the design on non-negative unbiased estimators, useful to perform exact inference for intractable target distributions.
Corresponds to the article http://arxiv.org/abs/1309.6473
1) The document discusses solving partial differential equations using variable separation. It presents the one-dimensional wave equation and solves it using variable separation.
2) It derives three cases for the solution based on whether k is positive, negative, or zero. It then presents the general solution as a summation involving sines and cosines.
3) It applies the general solution to two example problems of a vibrating string, finding the displacement as a function of position and time by satisfying the boundary conditions.
The first report of Machine Learning Seminar organized by Computational Linguistics Laboratory at Kazan Federal University. See http://cll.niimm.ksu.ru/cms/lang/en_US/main/seminars/mlseminar
Estimation of the score vector and observed information matrix in intractable...Pierre Jacob
This document discusses methods for estimating the score vector and observed information matrix for intractable models. It begins with an overview of using derivatives in sampling algorithms. It then discusses iterated filtering, a method for estimating derivatives in hidden Markov models when the likelihood is not available in closed form. Iterated filtering introduces a perturbed model and relates the posterior mean to the score and posterior variance to the observed information matrix. The document outlines proofs that show this relationship as the prior concentration increases.
Welcome to International Journal of Engineering Research and Development (IJERD)IJERD Editor
call for paper 2012, hard copy of journal, research paper publishing, where to publish research paper,
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
El diseño, construcción y desarrollo de robots sociales que convivan con los humanos facilitándoles sus condiciones de vida es uno de los retos tecnológicos más importantes de la actualidad. En esta presentación describiremos el camino seguido en esta línea desde RoboLab a través de un framework de desarrollo para robótica basado en componentes llamado RoboComp, de fuentes abiertas y creado durante los últimos 10 años en colaboración con varias universidades del país. Se presentarán brevemente los diferentes tipos de robots sociales que construidos en RoboLab, su uso y evolución con el tiempo. Todos ellos se han desarrollado sobre RoboComp que proporciona un conjunto de herramientas para asistir en el ciclo de vida de los componentes software. Entre éstas, se cuenta con un generador de código que usa varios lenguajes específicos de dominio para definir la conectividad y parte de la funcionalidad de los componentes. Finalmente, se describirá el estado actual de la nueva arquitectura cognitiva CORTEX, desarrollada sobre RoboComp y que, en colaboración con varios grupos de robótica, está siendo implementada y probada en varios proyectos y nuevos robots.
Para hacer realidad la energía de fusión como una fuente energética limpia, inagotable, segura y económica, las bases de datos de los dispositivos actuales (tokamaks y stellarators) deben analizarse en su totalidad (actualmente el 90% de los datos permanece sin procesar). Estos análisis completos permitirán una óptima planificación de la operación de ITER, cuyos resultados, a su vez, serán básicos en el diseño de DEMO.
Para efectuar el análisis masivo de datos, la alternativa que se propone es el uso rutinario de técnicas de aprendizaje automático. A partir de la utilización de estas técnicas se han
podido resolver problemas reales y de gran importancia en la operación de los dispositivos experimentales de fusión actuales. El núcleo central de la conferencia versará en la presentación de problemas prácticos y la solución aportada a cada uno de ellos.
El documento describe el uso de la generación procedimental de contenidos y la programación genética para crear terrenos para videojuegos de manera automática. Explica cómo la programación genética permite evolucionar árboles de funciones para modelar terrenos que satisfagan objetivos estéticos como la accesibilidad y la presencia de características como acantilados y montañas. También presenta GTPa, un enfoque automático para la generación de terrenos sin necesidad de interacción humana mediante la medición de propiedades del
Creative collections from chocko chozaChocko Choza
The document provides a list of creative chocolate and cake collections and decorations for various occasions, including Mickey Mouse-themed items, chocolate bouquets, cupcake shots, cake combos, personalized photo cakes, red velvet cake, chocolate plates, heart-shaped cake, chocolate lollipops, and more sweet treats and decorations for holidays like Valentine's Day.
Unix es un sistema operativo portable, multitarea y multiusuario desarrollado en 1969 por empleados de Bell Labs. Se encarga de repartir el tiempo de CPU entre aplicaciones y usuarios de forma segura a través de nombres de usuario y contraseñas. Controla los recursos y periféricos de una computadora para que puedan usarlos múltiples usuarios simultáneamente.
Este documento presenta información sobre la comunicación, incluyendo frases de Brian Tracy y Tony Robbins sobre la importancia de la comunicación y mejorarla. Define la comunicación como el intercambio de información entre dos o más participantes para transmitir significados a través de un sistema compartido. Explica que la comunicación implica la emisión de señales con la intención de dar a conocer un mensaje y que para que sea exitosa, el receptor debe poder decodificar y entender el mensaje. También identifica los elementos clave de un acto comunicativo como el emisor, receptor,
Anit No Need Foe Price Of Tha DEVIL.Pt.1.html.docMCDub
The document appears to be a musical album containing 6 songs and their lyrics. It was created by Murad Camarad Wysinger and other artists listed and copyrighted under Dubsac Entertainment. The album explores themes of spirituality, morality, and avoiding negativity. The lyrics are written in an unconventional style using rearranged words and slang.
This document summarizes a presentation on money market fund taxation. It discusses various tax issues including investor taxation across different jurisdictions, fund taxation, and investment taxation. Specific topics covered include the EU financial transaction tax, automatic exchange of information programs like FATCA and CRS, and the OECD's base erosion and profit shifting project. The presentation notes the complex tax compliance burden facing money market funds and the need for funds to minimize taxation at the portfolio level.
Desirée Cuadrado Lapena is a Spanish national with strong English, Spanish, French, and basic Italian language skills. She has over 10 years of experience in customer service, sales, teaching, radio broadcasting, and administrative roles. Her experience also includes running her own small business. She is educated with a degree in Spanish Language and Literature and an Associate's degree in Business Administration. She is now seeking new opportunities in social media and online services.
Este documento presenta las actividades propuestas en el proyecto "AlebrijeS de Primaria" del Programa Nacional de Lectura. El proyecto ofrece actividades basadas en los libros de la Biblioteca Escolar 2008-2009 para fomentar la lectura, escritura y diálogo en el aula. Cada sección del documento describe las diferentes actividades sugeridas para trabajar con cada libro y apoyar el desarrollo de competencias de lectura, escritura y valores. El objetivo final es que los estudiantes se conviertan en lectores y
Seminar Talk: Multilevel Hybrid Split Step Implicit Tau-Leap for Stochastic R...Chiheb Ben Hammouda
The document describes a multilevel hybrid split-step implicit tau-leap method for simulating stochastic reaction networks. It begins with background on modeling biochemical reaction networks stochastically. It then discusses challenges with existing simulation methods like the chemical master equation and stochastic simulation algorithm. The document introduces the split-step implicit tau-leap method as an improvement over explicit tau-leap for stiff systems. It proposes a multilevel Monte Carlo estimator using this method to efficiently estimate expectations of observables with near-optimal computational work.
1. The document discusses stochastic approximations for mortality projection models like the Lee-Carter (LC) and Cairns-Blake-Dowd (CBD) models.
2. It presents comonotonic approximations that provide conservative estimates of survival probabilities and numbers of survivors in a portfolio, avoiding complex simulations.
3. Numerical results show the conservative comonotonic approximations are close to the true values, providing useful tools for practitioners.
1) The document discusses using the residue theorem to evaluate a complex contour integral to calculate the Laplace transform of the output of an ideal sampler. This provides a closed-form solution that is less painful than the infinite series form.
2) An ideal sampler can be modeled as a carrier signal modulated by the input signal. The output of the sampler is then sent to a zero-order hold.
3) By choosing an appropriate contour, the complex contour integral can be evaluated using the residue theorem. This gives the Laplace transform of the sampler output in terms of the residues of the integrand's poles.
My talk in the MCQMC Conference 2016, Stanford University. The talk is about Multilevel Hybrid Split Step Implicit Tau-Leap
for Stochastic Reaction Networks.
Hybrid Atlas Models of Financial Equity Markettomoyukiichiba
The document describes a hybrid Atlas model of financial equity markets. The model represents the log-capitalization of companies as following a stochastic process, with the drift and diffusion terms depending on the company's ranking. The log-capitalizations are assumed to follow this process, with constraints on the parameters to ensure stability. The average log-capitalization is shown to follow a Brownian motion process under this model.
1. The document presents a new approach to proving comparison theorems for stochastic differential equations (SDEs) using differentiation of solutions with respect to initial data.
2. It proves that if the drift term of one SDE is always greater than or equal to the other, and their initial values satisfy the same relation, then the solutions will also satisfy this relation for all time.
3. Two methods are provided: the first uses explicit solutions, the second avoids this by showing the difference process cannot reach zero in finite time based on its behavior.
The document summarizes parameter estimation methods: 1) The method of moments estimates parameters by equating sample and population moments. 2) The maximum likelihood method estimates parameters by maximizing the likelihood function. 3) Mean-squared error compares estimators based on their variance and bias, preferring those with the smallest error.
This document discusses compactness estimates for nonlinear partial differential equations (PDEs), specifically Hamilton-Jacobi equations. It provides background on Kolmogorov entropy measures of compactness and covers recent results estimating the Kolmogorov entropy of solutions to scalar conservation laws and Hamilton-Jacobi equations, showing it is on the order of 1/ε. The document outlines applications of these estimates and open questions regarding extending the estimates to non-convex fluxes and non-uniformly convex Hamiltonians.
Complete l fuzzy metric spaces and common fixed point theoremsAlexander Decker
This document presents definitions and theorems related to complete L-fuzzy metric spaces and common fixed point theorems. It begins with introducing concepts such as L-fuzzy sets, L-fuzzy metric spaces, and triangular norms. It then defines Cauchy sequences and completeness in L-fuzzy metric spaces. The main result is Theorem 2.2, which establishes conditions under which four self-mappings of a complete L-fuzzy metric space have a unique common fixed point. These conditions include the mappings having compatible pairs, one mapping having a closed range, and the mappings satisfying a contractive-type inequality condition. The proof of the theorem constructs appropriate sequences to show convergence.
Data fusion is the process of combining data from different sources to enhance the utility of the combined product. In remote sensing, input data sources are typically massive, noisy, and have different spatial supports and sampling characteristics. We take an inferential approach to this data fusion problem: we seek to infer a true but not directly observed spatial (or spatio-temporal) field from heterogeneous inputs. We use a statistical model to make these inferences, but like all models it is at least somewhat uncertain. In this talk, we will discuss our experiences with the impacts of these uncertainties and some potential ways addressing them.
2014 spring crunch seminar (SDE/levy/fractional/spectral method)Zheng Mengdi
This document summarizes numerical methods for simulating stochastic partial differential equations (SPDEs) with tempered alpha-stable (TαS) processes. It discusses two main methods:
1) The compound Poisson (CP) approximation method, which simulates large jumps as a CP process and replaces small jumps with their expected drift term.
2) The series representation method, which represents the TαS process as an infinite series involving i.i.d. random variables.
It also provides algorithms for implementing these two methods and applies them to simulate specific examples like reaction-diffusion equations with TαS noise. Numerical results demonstrate that both methods can accurately capture the statistics of the underlying TαS
NONLINEAR DIFFERENCE EQUATIONS WITH SMALL PARAMETERS OF MULTIPLE SCALESTahia ZERIZER
In this article we study a general model of nonlinear difference equations including small parameters of multiple scales. For two kinds of perturbations, we describe algorithmic methods giving asymptotic solutions to boundary value problems.
The problem of existence and uniqueness of the solution is also addressed.
A short remark on Feller’s square root condition.Ilya Gikhman
This document presents a proof of Feller's square root condition for the Cox-Ingersoll-Ross model of short interest rates.
The CIR model describes the dynamics of the short rate r(t) as a scalar SDE with parameters k, θ, and σ.
The theorem states that if the Feller condition 2kθ > σ^2 is satisfied, then there exists a unique positive solution r(t) on each finite time interval t ∈ [0, ∞).
The proof uses Ito's formula and Gronwall's inequality to show that as ε approaches 0, the probability that the solution falls below ε approaches 0 as well.
Stochastic reaction networks (SRNs) are a particular class of continuous-time Markov chains used to model a wide range of phenomena, including biological/chemical reactions, epidemics, risk theory, queuing, and supply chain/social/multi-agents networks. In this context, we explore the efficient estimation of statistical quantities, particularly rare event probabilities, and propose two alternative importance sampling (IS) approaches [1,2] to improve the Monte Carlo (MC) estimator efficiency. The key challenge in the IS framework is to choose an appropriate change of probability measure to achieve substantial variance reduction, which often requires insights into the underlying problem. Therefore, we propose an automated approach to obtain a highly efficient path-dependent measure change based on an original connection between finding optimal IS parameters and solving a variance minimization problem via a stochastic optimal control formulation. We pursue two alternative approaches to mitigate the curse of dimensionality when solving the resulting dynamic programming problem. In the first approach [1], we propose a learning-based method to approximate the value function using a neural network, where the parameters are determined via a stochastic optimization algorithm. As an alternative, we present in [2] a dimension reduction method, based on mapping the problem to a significantly lower dimensional space via the Markovian projection (MP) idea. The output of this model reduction technique is a low dimensional SRN (potentially one dimension) that preserves the marginal distribution of the original high-dimensional SRN system. The dynamics of the projected process are obtained via a discrete $L^2$ regression. By solving a resulting projected Hamilton-Jacobi-Bellman (HJB) equation for the reduced-dimensional SRN, we get projected IS parameters, which are then mapped back to the original full-dimensional SRN system, and result in an efficient IS-MC estimator of the full-dimensional SRN. Our analysis and numerical experiments verify that both proposed IS (learning based and MP-HJB-IS) approaches substantially reduce the MC estimator’s variance, resulting in a lower computational complexity in the rare event regime than standard MC estimators. [1] Ben Hammouda, C., Ben Rached, N., and Tempone, R., and Wiechert, S. Learning-based importance sampling via stochastic optimal control for stochastic reaction net-works. Statistics and Computing 33, no. 3 (2023): 58. [2] Ben Hammouda, C., Ben Rached, N., and Tempone, R., and Wiechert, S. (2023). Automated Importance Sampling via Optimal Control for Stochastic Reaction Networks: A Markovian Projection-based Approach. To appear soon.
Ordinary Least Squares (OLS) is commonly used to estimate relationships between variables using observational data in economics. OLS finds the line of best fit by minimizing the sum of squared residuals to estimate parameters. The OLS estimator is a random variable that depends on the sample data. Asymptotically, as the sample size increases, the OLS estimator becomes consistent and its variance decreases. OLS provides the best linear unbiased estimates under the assumptions of the linear regression model.
This document presents two theorems that solve new types of nonlinear discrete inequalities involving the maximum of an unknown function over a past time interval. These inequalities are discrete generalizations of Bihari's inequality and can be used to study qualitative properties of solutions to nonlinear difference equations with maxima. Theorem 1 provides an upper bound for the solution in terms of inverse functions, while Theorem 2 uses a simpler integral function but a more complicated upper bound. The inequalities are applied to obtain bounds on solutions to difference equations with maxima.
Asymptotic Behavior of Solutions of Nonlinear Neutral Delay Forced Impulsive ...IOSR Journals
Sufficient conditions are obtained for every solution of first order nonlinear neutral delay forced
impulsive differential equations with positive and negative coefficients tends to a constant as t ∞.
Mathematics Subject Classification [MSC 2010]:34A37
The paper reports on an iteration algorithm to compute asymptotic solutions at any order for a wide class of nonlinear
singularly perturbed difference equations.
PaperNo14-Habibi-IJMA-n-Tuples and ChaoticityMezban Habibi
This document presents theorems and definitions related to n-tuples of operators on a Frechet space and conditions for chaoticity. It begins with definitions of key concepts such as the orbit of a vector under an n-tuple of operators and what it means for an n-tuple to be hypercyclic or for a vector to be periodic. The main results section presents two theorems, the first characterizing when an n-tuple satisfies the hypercyclicity criterion and the second proving conditions under which an n-tuple of weighted backward shifts is chaotic. The second theorem shows the equivalence of an n-tuple being chaotic, hypercyclic with a non-trivial periodic point, having a non-trivial periodic point, and a
Similar to Métodos computacionales para el estudio de modelos epidemiológicos con incertidumbre - Juan Carlos Cortés (20)
"El álgebra lineal es una herramienta fundamental en muchos campos de la ciencia y la tecnología. Es particularmente importante en la física, la ingeniería, la informática y la estadística. La capacidad de manipular eficientemente grandes cantidades de datos y matrices complejas es esencial en estas áreas para la resolución de problemas y la toma de decisiones.
A priori, puede dar la sensación de que estamos muy lejos del uso del álgebra lineal en nuestro día a día. Sin embargo, algunas técnicas como la descomposición en valores singulares y la regresión lineal para entrenar modelos y hacer predicciones precisas están detrás de la inteligencia artificial y el aprendizaje automático. ¿Te suena ChatGPT? Puede no parecerlo, pero el álgebra lineal también está detrás en algunos de sus procesos. Por este motivo, debemos seguir trabajando en este campo, ya que su importancia seguirá creciendo a medida que se generen y analicen grandes cantidades de datos en el mundo actual.
"
La pandemia de COVID-19 ha supuesto una proliferación de mapas y contramapas. Por ello, organizaciones de la sociedad civil y movimientos sociales han generado sus propias interpretaciones y representaciones de los datos sobre la crisis. Estos también han contribuido a visibilizar aspectos, sujetos y temas que han sido desatendidos o infrarrepresentados en las visualizaciones hegemónicas y dominantes. En este contexto, la presente ponencia se centra en el análisis de los imaginarios sociales relacionados con la elaboración de mapas durante la pandemia. Es decir, trata de indagar en la importancia de los mapas para el activismo digital, las potencialidades que se extraen de esta tecnología y los valores asociados a las visualizaciones creadas con ellos. El objetivo último es reflexionar sobre la vía emergente del activismo de datos, así como sobre la intersección entre los imaginarios sociales y la geografía digital.
Designing RISC-V-based Accelerators for next generation Computers (DRAC) is a 3-year project (2019-2022) funded by the ERDF Operational Program of Catalonia 2014-2020. DRAC will design, verify, implement and fabricate a high performance general purpose processor that will incorporate different accelerators based on the RISC-V technology, with specific applications in the field of post-quantum security, genomics and autonomous navigation. In this talk, we will provide an overview of the main achievements in the DRAC project, including the fabrication of Lagarto, the first RISC-V processor developed in Spain.
This talk will begin introducing the uElectronics section of ESA at ESTEC and the general activities the group is responsible for. Then, it will go through some of the R+D on-going activities that the group is involved with, hand in hand with universities and/or companies. One of the major ones is related to the European rad-hard FPGAs that have been partially founded by ESA for several years and that will be playing a major role in the sector in the upcoming years. It´s also worth talking about the RTL soft IPs that are currently under development and that will allow us to keep on providing the European ecosystem with some key capabilities. The latter will be an overview of RISC-V space hardened on-going activities that might be replacing the current SPARC based processors available for our missions.
El objetivo de esta charla es presentar las últimas novedades incorporadas en la arquitectura ARM y describir las tendencias en la microarquitectura de los procesadores con arquitectura ARM. ARM es una empresa relativamente pequeña en comparación con otros gigantes del sector tecnológico. Sin embargo, la amplia implantación de su arquitectura, siendo ampliamente dominante en algunos sectores, y sus microarquitecturas, hacen que la tecnología ARM ocupe un lugar central en el desarrollo tecnológico del mundo actual. La tecnología ARM está presente prácticamente en todo el espectro tecnológico, desde los dispositivos más sencillos hasta el HPC y Cloud computing, pasando por los smartphones, automoción electrónica de consumo, etc
"Formal verification has been used by computer scientists for decades to prevent
software bugs. However, with a few exceptions, it has not been used by researchers
working in most areas of mathematics (geometry, algebra, analysis, etc.). In this
talk, we will discuss how this has changed in the past few years, and the possible
implications to the future of mathematical research, teaching and communication.
We will focus on the theorem prover Lean and its mathematical library
mathlib, since this is currently the system most widely used by mathematicians.
Lean is a functional programming language and interactive theorem prover based
on dependent type theory, with proof irrelevance and non-cumulative universes.
The mathlib library, open-source and designed as a basis for research level
mathematics, is one of the largest collections of formalized mathematics. It allows
classical reasoning, uses large- and small-scale automation, and is characterized
by its decentralized nature with over 200 contributors, including both computer
scientists and mathematicians."
"Part of the research community thinks that it is still early to tackle the development of quantum software engineering techniques. The reason is that how the quantum computers of the future will look like is still unknown. However, there are some facts that we can affirm today: 1) quantum and classical computers will coexist, each dedicated to the tasks at which they are most efficient. 2) quantum computers will be part of the cloud infrastructure and will be accessible through the Internet. 3) complex software systems will be made up of smaller pieces that will collaborate with each other. 4) some of those pieces will be quantum, therefore the systems of the future will be hybrid. 5) the coexistence and interaction between the components of said hybrid systems will be supported by service composition: quantum services.
This talk analyzes the challenges that the integration of quantum services poses to Service Oriented Computing."
In this talk, after a brief overview of AI concepts in particular Machine Learning (ML) techniques, some of the well-known computer design concepts for high performance and power efficiency are presented. Subsequently, those techniques that have had a promising impact for computing ML algorithms are discussed. Deep learning has emerged as a game changer for many applications in various fields of engineering and medical sciences. Although the primary computation function is matrix vector multiplication, many competing efficient implementations of this primary function have been proposed and put into practice. This talk will review and compare some of those techniques that are used for ML computer design.
Tras una breve introducción a la informática médica y unas pinceladas sobre conceptos prácticos de Inteligencia Artificial (posible definición consensuada, strong VS weak AI y técnicas y métodos comúnmente empleados), el bloque central de la charla muestra ejemplos prácticos (en forma de casos de éxito) de distintos desarrollos llevados a cabo por el grupo de Sistemas Informáticos de Nueva Generación (SING: http//sing-group.org/) en los ámbitos de (i) Informática clínica (InNoCBR, PolyDeep), (ii) Informática para investigación clínica (PathJam, WhichGenes), (iii) bioinformática traslacional (Genómica: ALTER, Proteómica: DPD, BI, BS, Mlibrary, Mass-Up, e integración de datos ÓMICOS: PunDrugs) y (iv) Informática en salud pública (CURMIS4th). Finalmente, se comenta brevemente la importancia que se espera tenga en un futuro inmediato la IA interpretable (XAI, Explainable Artificial Intelligence) y la participación humana (HITL. Human-In-The-Loop). La charla termina con una breve reflexión sobre las lecciones aprendidas por el ponente después de más de 16 años de desarrollo de sistemas inteligentes en el ámbito de la informática médica.
Many emerging applications require methods tailored towards high-speed data acquisition and filtering of streaming data followed by offline event reconstruction and analysis. In this case, the main objective is to relieve the immense pressure on the storage and communication resources within the experimental infrastructure. In other applications, ultra low latency real time analysis is required for autonomous experimental systems and anomaly detection in acquired scientific data in the absence of any prior data model for unknown events. At these data rates, traditional computing approaches cannot carry out even cursory analyses in a time frame necessary to guide experimentation. In this talk, Prof. Ogrenci will present some examples of AI hardware architectures. She will discuss the concept of co-design, which makes the unique needs of an application domain transparent to the hardware design process and present examples from three applications: (1) An in-pixel AI chip built using the HLS methodology; (2) A radiation hardened ASIC chip for quantum systems; (3) An FPGA-based edge computing controller for real-time control of a High Energy Physics experiment.
En esta conferencia se presentará una revisión del concepto de autonomía para robots móviles de campo y la identificación de desafíos para lograr un verdadero sistema autónomo, además de sugerir posibles direcciones de investigación. Los sistemas robóticos inteligentes, por lo general, obtienen conocimiento de sus funciones y del entorno de trabajo en etapa de diseño y desarrollo. Este enfoque no siempre es eficiente, especialmente en entornos semiestructurados y complejos como puede ser el campo de cultivo. Un sistema robótico verdaderamente autónomo debería desarrollar habilidades que le permitan tener éxito en tales entornos sin la necesidad de tener a-priori un conocimiento ontológico del área de trabajo y la definición de un conjunto de tareas o comportamientos predefinidos. Por lo que en esta conferencia se presentarán posibles estrategias basadas en Inteligencia Artificial que permitan perfeccionar las capacidades de navegación de robots móviles y que sean capaces de ofrecer un nivel de autonomía lo suficientemente elevado para poder ejecutar todas las tareas dentro de una misión casa-a-casa (home-to-home).
Quantum computing has become a noteworthy topic in academia and industry. The multinational companies in the world have been obtaining impressive advances in all areas of quantum technology during the last two decades. These companies try to construct real quantum computers in order to exploit their theoretical preferences over today’s classical computers in practical applications. However, they are challenging to build a full-scale quantum computer because of their increased susceptibility to errors due to decoherence and other quantum noise. Therefore, quantum error correction (QEC) and fault-tolerance protocol will be essential for running quantum algorithms on large-scale quantum computers.
The overall effect of noise is modeled in terms of a set of Pauli operators and the identity acting on the physical qubits (bit flip, phase flip and a combination of bit and phase flips). In addition to Pauli errors, there is another error named leakage errors that occur when a qubit leaves the defined computational subspace. As the location of leakage errors is unknown, these can damage even more the quantum computations. Thus, this talk will briefly provide quantum error models.
Los chatbots son un elemento clave en la transformación digital de nuestra sociedad. Están por todas partes: eCommerce, salud digital, asistencia a clientes, turismo,... Pero si habéis usado alguno, probablemente os habrá decepcionado. Lo confieso, la mayoría de los chatbots que existen son muy malos. Y es que no es nada fácil hacer un chatbot que sea realmente útil e inteligente. Un chatbot combina toda la complejidad de la ingeniería de software con la del procesamiento de lenguaje natural. Pensad que muchos chatbots hay que desplegarlos en varios canales (web, telegram, slack,...) y a menudo tienen que utilizar APIs y servicios externos, acceder a bases de datos internas o integrar modelos de lenguaje preentrenados (por ej. detectores de toxicidad), etc. Y el problema no es sólo crear el bot, si no también probarlo y evolucionarlo. En esta charla veremos los mayores desafíos a los que hay que enfrentarse cuando nos encargan un proyecto de desarrollo que incluye un chatbot y qué técnicas y estrategias podemos ir aplicando en función de las necesidades del proyecto, para conseguir, esta vez sí un chatbot que sepa de lo que habla.
Many HPC applications are massively parallel and can benefit from the spatial parallelism offered by reconfigurable logic. While modern memory technologies can offer high bandwidth, designers must craft advanced communication and memory architectures for efficient data movement and on-chip storage. Addressing these challenges requires to combine compiler optimizations, high-level synthesis, and hardware design.
In this talk, I will present challenges, solutions, and trends for generating massively parallel accelerators on FPGA for high-performance computing. These architectures can provide performance comparable to software implementations on high-end processors, and much higher energy efficiency thanks to logic customization.
The main challenge of concurrent software verification has always been in achieving modularity, i.e., the ability to divide and conquer the correctness proofs with the goal of scaling the verification effort. Types are a formal method well-known for its ability to modularize programs, and in the case of dependent types, the ability to modularize and scale complex mathematical proofs.
In this talk I will present our recent work towards reconciling dependent types with shared memory concurrency, with the goal of achieving modular proofs for the latter. Applying the type-theoretic paradigm to concurrency has lead us to view separation logic as a type theory of state, and has motivated novel abstractions for expressing concurrency proofs based on the algebraic structure of a resource and on structure-preserving functions (i.e., morphisms) between resources.
Microarchitectural attacks, such as Spectre and Meltdown, are a class of
security threats that affect almost all modern processors. These attacks exploit the side-effects resulting from processor optimizations to leak sensitive information and compromise a system’s security.
Over the years, a large number of hardware and software mechanisms for
preventing microarchitectural leaks have been proposed. Intuitively, more
defensive mechanisms are less efficient, while more permissive mechanisms may offer more performance but require more defensive programming. Unfortunately, there are no
hardware-software contracts that would turn this intuition into a basis for
principled co-design.
In this talk, we present a framework for specifying hardware/software security
contracts, an abstraction that captures a processor’s security guarantees in a
simple, mechanism-independent manner by specifying which program executions a
microarchitectural attacker can distinguish.
La aparición de vulnerabilidades por la falta de controles de seguridad es una de las causas por las que se demandan nuevos marcos de trabajo que produzcan software seguro de forma predeterminada. En la conferencia se abordará cómo transformar el proceso de desarrollo de software dando la importancia que merece la seguridad desde el inicio del ciclo de vida. Para ello se propone un nuevo modelo de desarrollo – modelo Viewnext-UEx – que incorpora prácticas de seguridad de forma preventiva y sistemática en todas las fases del proceso de ciclo de vida del software. El propósito de este nuevo modelo es anticipar la detección de vulnerabilidades aplicando la seguridad desde las fases más tempranas, a la vez que se optimizan los procesos de construcción del software. Se exponen los resultados de un escenario preventivo, tras la aplicación del modelo Viewnext-UEx, frente al escenario reactivo tradicional de aplicar la seguridad a partir de la fase de testing.
This document discusses trusting artificial intelligence systems. It begins with an overview of trust in social and computing contexts. It then discusses artificial intelligence, including machine learning, deep learning, and natural language processing. It details how AI systems can be attacked, including adversarial inputs, data poisoning, and model stealing. It raises important discussions around using AI in contexts like cybersecurity, medicine, transportation, and sentiment analysis, and the challenges of ensuring systems can be trusted.
El uso de energías renovables es clave para cumplir los objetivos de desarrollo sostenible de la Agenda 2030. Entre estas energías, la eólica es la segunda más utilizada debido a su alta eficiencia. Algunos estudios sugieren que la energía eólica será la principal fuente de generación en 2050. Por ello es conveniente seguir investigando en la aplicación de técnicas de control avanzadas en estos sistemas.
Entre estas técnicas avanzadas cabe destacar las redes neuronales y el aprendizaje por refuerzo combinadas con estrategias clásicas de control. Estas técnicas ya se han empleado con éxito en el modelado y el control de sistemas complejos.
Esta conferencia presentará la aplicación de redes neuronales y aprendizaje por refuerzo al control de aerogeneradores, centrándolo especialmente en el control de pitch. Se detallarán diferentes configuraciones con redes neuronales y otras técnicas aplicadas al control de pitch. Finalmente se propondrán algunas técnicas híbridas que combinen lógica difusa, tablas de búsqueda y redes neuronales, mostrando resultados que han permitido probar su utilidad para mejorar la eficiencia de las turbinas eólicas.
As the world's energy demand rises, so does the amount of renewable energy, particularly wind energy, in the supply. The life cycle of wind farms starting from manufacturing the components to decommission stage involve significant involvement of cost and the application of AI and data analytics are on reducing these costs are limited. With this conference talk, the audience expected to know some of the interesting applications of AI and data analytics on offshore wind. And, also highlight the future challenges and opportunities. This conference could be useful for students, academics and researcher who want to make next career in offshore wind but yet know where to start.
Understanding Inductive Bias in Machine LearningSUTEJAS
This presentation explores the concept of inductive bias in machine learning. It explains how algorithms come with built-in assumptions and preferences that guide the learning process. You'll learn about the different types of inductive bias and how they can impact the performance and generalizability of machine learning models.
The presentation also covers the positive and negative aspects of inductive bias, along with strategies for mitigating potential drawbacks. We'll explore examples of how bias manifests in algorithms like neural networks and decision trees.
By understanding inductive bias, you can gain valuable insights into how machine learning models work and make informed decisions when building and deploying them.
Optimizing Gradle Builds - Gradle DPE Tour Berlin 2024Sinan KOZAK
Sinan from the Delivery Hero mobile infrastructure engineering team shares a deep dive into performance acceleration with Gradle build cache optimizations. Sinan shares their journey into solving complex build-cache problems that affect Gradle builds. By understanding the challenges and solutions found in our journey, we aim to demonstrate the possibilities for faster builds. The case study reveals how overlapping outputs and cache misconfigurations led to significant increases in build times, especially as the project scaled up with numerous modules using Paparazzi tests. The journey from diagnosing to defeating cache issues offers invaluable lessons on maintaining cache integrity without sacrificing functionality.
Use PyCharm for remote debugging of WSL on a Windo cf5c162d672e4e58b4dde5d797...shadow0702a
This document serves as a comprehensive step-by-step guide on how to effectively use PyCharm for remote debugging of the Windows Subsystem for Linux (WSL) on a local Windows machine. It meticulously outlines several critical steps in the process, starting with the crucial task of enabling permissions, followed by the installation and configuration of WSL.
The guide then proceeds to explain how to set up the SSH service within the WSL environment, an integral part of the process. Alongside this, it also provides detailed instructions on how to modify the inbound rules of the Windows firewall to facilitate the process, ensuring that there are no connectivity issues that could potentially hinder the debugging process.
The document further emphasizes on the importance of checking the connection between the Windows and WSL environments, providing instructions on how to ensure that the connection is optimal and ready for remote debugging.
It also offers an in-depth guide on how to configure the WSL interpreter and files within the PyCharm environment. This is essential for ensuring that the debugging process is set up correctly and that the program can be run effectively within the WSL terminal.
Additionally, the document provides guidance on how to set up breakpoints for debugging, a fundamental aspect of the debugging process which allows the developer to stop the execution of their code at certain points and inspect their program at those stages.
Finally, the document concludes by providing a link to a reference blog. This blog offers additional information and guidance on configuring the remote Python interpreter in PyCharm, providing the reader with a well-rounded understanding of the process.
Batteries -Introduction – Types of Batteries – discharging and charging of battery - characteristics of battery –battery rating- various tests on battery- – Primary battery: silver button cell- Secondary battery :Ni-Cd battery-modern battery: lithium ion battery-maintenance of batteries-choices of batteries for electric vehicle applications.
Fuel Cells: Introduction- importance and classification of fuel cells - description, principle, components, applications of fuel cells: H2-O2 fuel cell, alkaline fuel cell, molten carbonate fuel cell and direct methanol fuel cells.
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECTjpsjournal1
The rivalry between prominent international actors for dominance over Central Asia's hydrocarbon
reserves and the ancient silk trade route, along with China's diplomatic endeavours in the area, has been
referred to as the "New Great Game." This research centres on the power struggle, considering
geopolitical, geostrategic, and geoeconomic variables. Topics including trade, political hegemony, oil
politics, and conventional and nontraditional security are all explored and explained by the researcher.
Using Mackinder's Heartland, Spykman Rimland, and Hegemonic Stability theories, examines China's role
in Central Asia. This study adheres to the empirical epistemological method and has taken care of
objectivity. This study analyze primary and secondary research documents critically to elaborate role of
china’s geo economic outreach in central Asian countries and its future prospect. China is thriving in trade,
pipeline politics, and winning states, according to this study, thanks to important instruments like the
Shanghai Cooperation Organisation and the Belt and Road Economic Initiative. According to this study,
China is seeing significant success in commerce, pipeline politics, and gaining influence on other
governments. This success may be attributed to the effective utilisation of key tools such as the Shanghai
Cooperation Organisation and the Belt and Road Economic Initiative.
DEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODELgerogepatton
As digital technology becomes more deeply embedded in power systems, protecting the communication
networks of Smart Grids (SG) has emerged as a critical concern. Distributed Network Protocol 3 (DNP3)
represents a multi-tiered application layer protocol extensively utilized in Supervisory Control and Data
Acquisition (SCADA)-based smart grids to facilitate real-time data gathering and control functionalities.
Robust Intrusion Detection Systems (IDS) are necessary for early threat detection and mitigation because
of the interconnection of these networks, which makes them vulnerable to a variety of cyberattacks. To
solve this issue, this paper develops a hybrid Deep Learning (DL) model specifically designed for intrusion
detection in smart grids. The proposed approach is a combination of the Convolutional Neural Network
(CNN) and the Long-Short-Term Memory algorithms (LSTM). We employed a recent intrusion detection
dataset (DNP3), which focuses on unauthorized commands and Denial of Service (DoS) cyberattacks, to
train and test our model. The results of our experiments show that our CNN-LSTM method is much better
at finding smart grid intrusions than other deep learning algorithms used for classification. In addition,
our proposed approach improves accuracy, precision, recall, and F1 score, achieving a high detection
accuracy rate of 99.50%.
Literature Review Basics and Understanding Reference Management.pptxDr Ramhari Poudyal
Three-day training on academic research focuses on analytical tools at United Technical College, supported by the University Grant Commission, Nepal. 24-26 May 2024
Generative AI leverages algorithms to create various forms of content
Métodos computacionales para el estudio de modelos epidemiológicos con incertidumbre - Juan Carlos Cortés
1. Computational Methods for Random
Epidemiological Models
M´etodos Computacionales para el Estudio de
Modelos Epidemiol´ogicos con Incertidumbre
Conferencias de Investigaci´on para Posgrado 2016
Universidad Complutense de Madrid
24 junio de 2016
Prof. Dr. Juan Carlos Cort´es
Instituto Universitario de Matem´atica Multidisciplinar
Universitat Polit`ecnica de Val`encia
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 1
3. A naive (but maybe useful) comparison:
Deterministic Random
numbers: a = 3 r.v.’s: A ∼ N(µ = 3;σ2 > 0)
functions: x(t) = 3t s.p.’s: X(t) = At, A ∼ N(µ = 3;σ2 > 0)
There are s.p.’s which are not defined by algebraic formulas as
Wiener process or Brownian motion
{W (t) : t ≥ 0} ≡ {B(t) : t ≥ 0} is called the (standard) Wiener process or Brownian
motion if it satisfies the following conditions:
1 It starts at zero w.p. 1: P[{ω ∈ Ω : W (0)(ω) = 0}] = P[W (0) = 0}] = 1.
2 It has stationary increments:
W (t)−W (s)
d
= W (t +h)−W (s +h), ∀h : s,t,s +h,t +h ∈ [0,+∞[.
3 It has independent increments:
W (t2)−W (t1),...,W (tn)−W (tn−1) are independent r.v.’s
∀{ti }n
i=1 : 0 ≤ t1 < t2 < ··· < tn−1 < tn < +∞, n ≥ 1.
4 It is Gaussian with mean zero and variance t: W (t) ∼ N(0;t), ∀t ≥ 0.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 3
5. Since a s.p. X(t) = {X(t) : t ∈ T } can be considered as a collection of random vectors
(Xt1 ,...,Xtn ), t1,...,tn ∈ T , n ≥ 1, we can extend the concept of expectation and
covariance for random vectors to s.p.’s and consider these quantities as functions of
t ∈ T :
One-dimensional probabilistic description of a s.p.
Expectation, variance and 1-p.d.f. of a s.p.
Expectation: µX (t) = E[X(t)], t ∈ T .
Variance: σ2
X (t) = V[X(t)] = E[(X(t))2]−(E[X(t)])2
, t ∈ T .
1-p.d.f.: It is the p.d.f. of the r.v. X(t) for every t. It is denoted by f1(x,t).
Two-dimensional probabilistic description of a s.p.
Covariance and 2-p.d.f. of a s.p.
Covariance: CX (t1,t2) = C[Xt1 ,Xt2 ] = E[(X(t1)− µX (t1))(X(t2)− µX (t2))],
t1,t2 ∈ T .
2-p.d.f.: It is the joint p.d.f. of the r.v.’s X(t1) and X(t2) for every t1 and t2. It
is denoted by f2(x1,t1;x2,t2).
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 5
7. Motivating the linear case: The malthusian population model with migration
p(t )
p(t +Δt )
t
t +Δt
p(t +∆t)−p(t) =
births
bp(t)∆t −
deaths
dp(t)∆t +
immigrants
i∆t −
emigrants
e∆t,
p(t +∆t)−p(t) = kp(t)∆t +m∆t, k = b −d, m = i −e ∈ R,
p(t +∆t)−p(t)
∆t
= kp(t)+m ⇒
˙p(t) = kp(t)+m, t > 0,
p(0) = p0,
Malthusian population model considering migration
˙p(t) = kp(t)+m, t > 0,
p(0) = p0,
, k = b −d, m = i −e.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 7
8. How can uncertainty be introduced?
There are two main approaches:
Unknown uncertainty: Wiener process or Brownian motion. It requires the
so-called Itˆo-calculus.
Known uncertainty: It requires the so-called Lp(Ω)-calculus.
Itˆo-Stochastic Differential Equations (SDE’s)
Assuming, for instance, that the birth-rate coefficient is affected by a Gaussian
perturbation (unknown uncertainty):
˙p(t) = kp(t)+m, t > 0,
p(0) = p0,
, k ⇒ k +λ W (t)
white noise
, k ∈ R, λ > 0,
dp(t)
dt
= (k +λW (t))p(t)+m
dp(t) = (kp(t)+m)dt +λp(t)W (t)dt
dW (t)
dp(t) = (kp(t)+m)dt +λp(t)dW (t)
p(t) = p0 +
t
0
(kp(s)+m)dt +
t
0
λp(s)dW (s)
Itˆo-type integral
Itˆo Lemma
−−−−−−−−→ p(t)
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 8
9. Random Differential Equations (RDE’s)
Known uncertainty:
k is positive: k ∼ Exp(λ); k ∼ Be(α;β).
k is negative: k ∼ Un(−2,−0.5); k ∼ N(µ;σ) truncated at (−2,−0.5).
Malthusian population model considering migration
˙p(t) = kp(t)+m, t > 0,
p(0) = p0,
, k = b −d, m = i −e.
In practice the birth, death, immigration, emigration rates and the initial population
are fixed after sampling and measurements, hence it is more realistic to consider that:
k,m,p0 are r.v.’s, defined in a common probability space, (Ω,F,P)
rather than deterministic constants
⇓
This motivates to consider the above model from a stochastic standpoint. As a
consequence, its solution is a stochastic process (s.p.) rather than a classical function.
⇓
The main goals include to compute:
The solution s.p.: p(t) = p(t;ω), ω ∈ Ω.
The mean function: E[p(t)].
The variance function: V[p(t)].
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 9
10. To deal with RDE’s, Lp(Ω)-calculus has demonstrate to be a powerful tool.
p = 2 ⇒ mean square (m.s.) calculus
L2(Ω) = {X : Ω → R, 2-r.v.}
X 2 = E X2 1/2
< +∞
⇒ (L2(Ω), · 2) Banach space
(Ω,F,P) probability space
X : Ω → R is a (continuous absolutely) real random variable (r.v.)
F is a distribution function (d.f.); f is a probability density function (p.d.f.) of X
X 2-r.v. ⇔ E X2
=
Ω
x2
dF(ω) =
R
x2
f (x)dx < +∞
X 2-r.v. ⇒ V[X] = E X2 −(E[X])2
< +∞
Examples
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 10
11. mean square (m.s.) convergence of {Xn : n ≥ 0} ∈ L2(Ω)
Xn
m.s.
−−−→
n→∞
X ⇔ ( Xn −X 2)2
= E (Xn −X)2
−−−→
n→∞
0
Some reasons to select mean square convergence
Zn
m.s.
−−−→
n→∞
Z ⇒
E[Zn] −−−→
n→∞
E[Z],
V[Zn] −−−→
n→∞
V[Z].
⇓
XN (t) =
N
∑
n=0
Xntn
⇓
t ∈ T fixed, ZN = XN (t) ⇒
E[XN (t)] −−−→
N→∞
E[X(t)]
V[XN (t)] −−−→
N→∞
V[X(t)]
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 11
12. However, it would be more desirable to determine the first probability density
function (1-p.d.f.), f1(p,t), associated to the solution s.p. p(t) since from it one can
compute, as merely particular cases, the mean and variance functions:
µp(t) = E[p(t)] =
∞
−∞
p f1(p,t)dp,
σ2
p (t) = V[p(t)] =
∞
−∞
p2
f1(p,t)dp −(µp(t))2
.
But in addition, from it one can also compute higher statistical moments:
E[(p(t))k
] =
∞
−∞
pk
f1(p,t)dp, k = 0,1,2,...,
and significant information such as the probability of the solution lies within a set of
interest
P[a ≤ p(t) ≤ b] =
b
a
f1(p,t)dp.
This improves the computation of rough bounds like
P[|p(t)− µp(t)| ≥ λ] ≤
(σp(t))2
λ2
,
usually used in practice.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 12
13. The general random linear differential equation
Motivated by the previous presentation, in the following we focus on determining the
1-p.d.f., fZ (z,t), of the solution s.p. Z(t) to the general linear random initial value
problem (i.v.p.):
˙Z(t) = AZ(t)+B, t > t0,
Z(t0) = Z0,
where the data Z0, B and A are assumed to be absolutely continuous random
variables (r.v.’s) defined on a common probability space (Ω,F,P), whose domains are
assumed to be:
DZ0
= { z0 = Z0(ω),ω ∈ Ω : z0,1 ≤ z0 ≤ z0,2},
DB = { b = B(ω),ω ∈ Ω : b1 ≤ b ≤ b2},
DA = { a = A(ω),ω ∈ Ω : a1 ≤ a ≤ a2}.
As we shall see later, the unifying element to conduct our study is the Random
Variable Transformation (R.V.T.) method.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 13
14. For the sake of clarity in the presentation we will distinguish the following cases:
TYPE I.V.P. CASE
H
˙Z(t) = AZ(t)
Z(t0) = Z0
(I)
I.1 Z0 is a random variable
I.2 A is a random variable
I.3 (Z0,A) is a random vector
NH
˙Z(t) = B
Z(t0) = Z0
(II)
II.1 Z0 is a random variable
II.2 B is a random variable
II.3 (Z0,B) is a random vector
˙Z(t) = AZ(t)+B
Z(t0) = Z0
(III)
III.1 Z0 is a random variable
III.2 B is a random variable
III.3 A is a random variable
III.4 (Z0,B) is a random vector
III.5 (Z0,A) is a random vector
III.6 (B,A) is a random vector
III.7 (Z0,B,A) is a random vector
Z(t) = eA(t−t0)
Z0 +
B
A
eA(t−t0)
−1 , t ≥ t0.
Remarks:
I.V.P. (I): P[{ω ∈ Ω : B(ω) = 0}] = 1; I.V.P. (II): P[{ω ∈ Ω : A(ω) = 0}] = 1.
Hereinafter, deterministic parameters will be written by lower case letters and r.v.’s by capital letters.
Notation for the p.d.f.’s: fZ0
(z0); fZ0,A(z0,a); fZ0,B,A(z0,b,a), etc.
Standard and non-standard p.d.f.’s including copulas can be considered.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 14
15. Preliminaries on Random Variable Transformation (R.V.T.) method
R.V.T. method: simple scalar version
H : Let X be a continuous r.v. with p.d.f. fX (x) with support S (X) and Y = r(X)
being r a bijective mapping.
T : The p.d.f. of Y , gY (y), is given by:
gY (y) = fX (x = s(y))
ds(y)
dy
, y ∈ S (r(X)).
R.V.T. technique: general scalar version
H : Let X be a r.v. with p.d.f. fX (x) and codomain or support DX = {x : fX (x) > 0}.
Let Y = r(X) be a new r.v. generated by the map r : R −→ R which is assumed to be
continuously differentiable on DX and such that r (x) = 0 except at a finite number of
points. Let us suppose that for each y ∈ R, there exist m(y) ≥ 1 points:
x1(y),x2(y),...,xm(y)(y) ∈ DX such that
r(xk (y)) = y, r (xk (y)) = 0, k = 1,2,...,m(y).
T : Then
fY (y) =
m(y)
∑
i=1
fX (xk (y)) r (xk (y))
−1
if m(y) > 0,
0 if m(y) = 0.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 15
16. Next, we shall present some particular cases of R.V.T. method that will be useful later.
Case I.1: Z(t) = Z0ea(t−t0)
, t ≥ t0.
R.V.T. technique: linear transformation
H : Let X be a continuous r.v. with domain: DX = {x : x1 ≤ x ≤ x2} and p.d.f. fX (x).
T : Then, the p.d.f. fY (y) of the linear transformation Y = αX +β, α = 0 is given
by:
fY (y) =
1
|α|
fX
y −β
α
, where
y1 = αx1 +β ≤ y ≤ αx2 +β = y2 if α > 0,
y1 = αx2 +β ≤ y ≤ αx1 +β = y2 if α < 0.
If α = 0, then Y = β with probability 1 (w.p. 1) and
fY (y) = δ(y −β), −∞ < y < ∞,
where δ(·) denotes the Dirac delta distribution.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 16
17. Case I.2: Z(t) = z0eA(t−t0)
, t ≥ t0.
R.V.T. technique: exponential transformation
H : Let X be a continuous r.v. with domain: DX = {x : x1 ≤ x ≤ x2} and p.d.f. fX (x).
T : Then the p.d.f. fY (y) of the exponential transformation Y = αeβX +γ, with
αβ = 0 is given by:
fY (y) =
1
|β(y −γ)|
fX
1
β
ln
y −γ
α
,
where
y1 = αeβx1 +γ ≤ y ≤ αeβx2 +γ = y2 if αβ > 0,
y1 = αeβx2 +γ ≤ y ≤ αeβx1 +γ = y2 if αβ < 0.
If α = 0 or β = 0, then Y = α +γ w.p. 1 and
fY (y) = δ(y −(α +γ)), −∞ < y < ∞.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 17
18. Case I.3: Z(t) = Z0eA(t−t0)
, t ≥ t0.
R.V.T. technique: multi-dimensional version
H : Let X = (X1,...,Xn) be a random vector of dimension n with joint p.d.f. fX(x).
Let r : Rn −→ Rn be a one-to-one deterministic map which is assumed to be continuous
with respect to each one of its arguments, and with continuous partial derivatives.
T : Then, the joint p.d.f. fY(y) of the random vector Y = r(X) is given by
fY(y) = fX (s(y))|Jn|,
where s(y) is the inverse transformation of r(x): x = r−1(y) = s(y) and Jn is the
jacobian of the transformation, i.e.,
Jn = det
∂x
∂y
= det
∂x1
∂y1
··· ∂xn
∂y1
.
..
...
.
..
∂x1
∂yn
··· ∂xn
∂yn
,
which is assumed to be different from zero.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 18
19. Case II.3: Z(t) = Z0 +B(t −t0), t ≥ t0.
R.V.T. technique: sum of two r.v.’s
H : Let (X1,X2) be a continuous random vector with joint p.d.f. fX1,X2
(x1,x2) and
respective domains: DX1
= {x1 : x1,1 ≤ x1 ≤ x1,2} and DX2
= {x2 : x2,1 ≤ x2 ≤ x2,2}.
T : Then the p.d.f. fY1
(y1) of their sum Y1 = X1 +X2 is given by:
fY1
(y1) =
x1,2
x1,1
fX1,X2
(x1,y1 −x1)dx1, y1,1 = x1,1 +x2,1 ≤ y1 ≤ x1,2 +x2,2 = y1,2,
or, equivalently by
fY1
(y1) =
x2,2
x2,1
fX1,X2
(y1 −x2,x2)dx2, y1,1 = x1,1 +x2,1 ≤ y1 ≤ x1,2 +x2,2 = y1,2.
If X1 and X2 are independent r.v.’s, since fX1,X2
(x1,x2) = fX1
(x1)fX2
(x2), being fXi
(xi )
the p.d.f. of Xi , i = 1,2, the p.d.f. of the sum of two independent r.v.’s is just the
convolution of their respective p.d.f.’s:
fY1
(y1) =
x1,2
x1,1
fX1
(x1)fX2
(y1 −x1)dx1, or fY1
(y1) =
x2,2
x2,1
fX1
(y1 −x2)fX2
(x2)dx2.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 19
20. Case I.3: Z(t) = Z0eA(t−t0)
, t ≥ t0.
R.V.T. technique: product of two r.v.’s
H : Let (X1,X2) be a continuous random vector with joint p.d.f. fX1,X2
(x1,x2) with
respective domains: DX1
= {x1 = 0 : x1,1 ≤ x1 ≤ x1,2} and DX2
= {x2 : x2,1 ≤ x2 ≤ x2,2}.
T : Then the p.d.f. fY1
(y1) of their product Y1 = X1X2 is given by:
fY1
(y1) =
x1,2
x1,1
fX1,X2
x1,
y1
x1
1
|x1|
dx1.
Equivalently, if DX1
= {x1 : x1,1 ≤ x1 ≤ x1,2} and DX2
= {x2 = 0 : x2,1 ≤ x2 ≤ x2,2} then
fY1
(y1) =
x2,2
x2,1
fX1,X2
y1
x2
,x2
1
|x2|
dx2. ( )
If X1 and X2 are independent r.v.’s with p.d.f.’s fX1
(x1) and fX2
(x2), respectively, then
previous formulas write:
fY1
(y1) =
x1,2
x1,1
fX1
(x1)fX2
y1
x1
1
|x1|
dx1, or fY1
(y1) =
x2,2
x2,1
fX1
y1
x2
fX2
(x2)
1
|x2|
dx2,
respectively.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 20
21. Computing the 1-p.d.f. of the solution s.p. of the general linear random differential
equation: Some study-cases
Case I.1: Z0 is a r.v.
In this case the solution s.p. has the following expression:
Z(t) = Z0ea(t−t0)
, t ≥ t0.
Next, we first fix t : t ≥ t0 and denote Z = Z(t). Then, we apply R.V.T. method
(linear transformation: Y = αX +β, α = 0) to:
α = ea(t−t0)
> 0, β = 0, X = Z0, Y = Z,
and, taking into account that fY (y) = 1
|α| fX
y−β
α and the domain of r.v. Z0, one
gets:
f1(z,t) = e−a(t−t0)
fZ0
z e−a(t−t0)
, z1 ≤ z ≤ z2, t ≥ t0,
where
z1 = z0,1ea(t−t0)
, z2 = z0,2ea(t−t0)
.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 21
22. Example Case I.1: Z0 ∼ N µ;σ2 , µ ∈ R and σ2 > 0
f1(z,t) =
1
√
2πσ2
e
− a(t−t0)+ 1
2σ2 z e−a(t−t0)−µ
2
, −∞ < z < ∞, t ≥ t0.
Example : Z0 ∼ N(0;1), t0 = 0, a = −1.
Z(t) = Z0e−t
, t ≥ t0.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 22
23. Case I.2: A is a r.v.
In this case the solution s.p. has the following expression:
Z(t) = z0eA(t−t0)
, t ≥ t0.
Next, we first fix t : t > t0 and denote Z = Z(t). Then we apply R.V.T. method
(exponential transformation: Y = αeβX +γ, αβ = 0) to:
α = z0 = 0, β = t −t0 = 0, X = A, γ = 0, Y = Z.
Then, taking into account that fY (y) = 1
|β(y−γ)| fX
1
β ln y−γ
α and
z/z0 = ea(t−t0) > 0 and the domain of r.v. A, one gets:
f1(z,t) =
1
(t −t0)|z|
fA
1
t −t0
ln
z
z0
, z1 ≤ z ≤ z2, t > t0,
where
z1 = z0ea1(t−t0), z2 = z0ea2(t−t0), if z0 > 0,
z1 = z0ea2(t−t0), z2 = z0ea1(t−t0), if z0 < 0.
For t = t0: Z(t) = Z(t0) = z0, which is deterministic. Then its 1-p.d.f. can be written
by the Dirac delta function as follows:
f1(z,t0) = δ(z −z0), −∞ < z < ∞.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 23
24. Example Case I.2: A ∼ Be(α;β), α,β > 0 and z0 > 0
f1(z,t) = 1
B(α,β)|z|
1
t−t0
α
ln z
z0
α−1
1− 1
t−t0
ln z
z0
β−1
,
z0 ≤ z ≤ z0et−t0 , t > t0.
f1(z,t0) = δ(z −z0), −∞ < z < ∞.
Remark: Since z = z0ea(t−t0) and 0 ≤ a ≤ 1, it is guaranteed that 0 ≤ 1
t−t0
ln z
z0
≤ 1.
Example : A ∼ Be(2;3), t0 = 0, z0 = 1.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 24
25. Case I.3: (Z0,A) is a random vector
In this case that the solution s.p. has the following expression:
Z(t) = Z1(t)Z2(t), where
Z1(t) = Z0,
Z2(t) = eA(t−t0).
To compute the p.d.f. of Z = Z(t), t : t > t0 fix, first we will determine the joint p.d.f.
of Z1 = Z1(t) and Z2 = Z2(t) by R.V.T. method (two–dimensional version) to:
X1 = Z0, X2 = A, r1(z0,a) = z0, r2(z0,a) = ea(t−t0),
Y1 = Z1, Y2 = Z2, s1(z1,z2) = z1, s2(z1,z2) = ln(z2)
t−t0
.
Hence, the Jacobian is given by
J2 =
∂s1(z1,z2)
∂z1
∂s2(z1,z2)
∂z2
=
1
z2(t −t0)
> 0,
therefore
fZ1,Z2
(z1,z2) =
1
z2(t −t0)
fZ0,A z1,
ln(z2)
t −t0
, z0,1 ≤ z1 ≤ z0,2, ea1(t−t0)
≤ z2 ≤ ea2(t−t0)
.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 25
26. Now, we apply R.V.T. method (product of two r.v.’s: Y1 = X1 X2) to obtain the p.d.f.
of Z = Z1 Z2. As Z2 = eA(t−t0) = 0, we will apply formula ( ):
fY1
(y1) =
x2,2
x2,1
fX1,X2
y1
x2
,x2
1
|x2|
dx2, ( )
to
X1 = Z1 = Z0, X2 = Z2 = eA(t−t0)
> 0, Y1 = Z = Z1 Z2 :
f1(z,t) = fZ (z) =
z2,2
z2,1
fZ1,Z2
z
z2
,z2
1
z2
dz2
=
z2,2
z2,1
fZ0,A
z
z2
,
ln(z2)
t −t0
1
(z2)2(t −t0)
dz2, ˆz1 ≤ z ≤ ˆz2, t > t0,
where
z2,1 = ea1(t−t0)
, z2,2 = ea2(t−t0)
,
ˆz1 = z0,1ea1(t−t0), ˆz2 = z0,2ea2(t−t0), if z0,1 > 0,
ˆz1 = z0,1ea2(t−t0), ˆz2 = z0,2ea2(t−t0), if z0,1 z0,2 ≤ 0,
ˆz1 = z0,1ea2(t−t0), ˆz2 = z0,2ea1(t−t0), if z0,2 < 0.
f1(z0,t0) = fZ0
(z0) =
a2
a1
fZ0,A(z0,a)da, z0,1 ≤ z0 ≤ z0,2.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 26
27. Example Case I.3: (Z0,A) is a random vector whose components are independent
fZ0,A(z0,a) =
4az0 if 0 < z0, a < 1,
0 otherwise.
we substitute into the obtained formula and after making some simplifications one
obtains:
f1(z,t) =
4z
(t −t0)2
et−t0
1
ln(z2)
(z2)3
dz2 if 0 ≤ z ≤ 1,
4z
(t −t0)2
et−t0
z
ln(z2)
(z2)3
dz2 if 1 ≤ z ≤ et−t0 ,
t > t0.
Let us take t0 = 0. For t > 0:
f1(z,t) =
z
t2
e−2t
−1+e2t
−2t if 0 ≤ z ≤ 1,
z
t2
−e−2t
(1+2t)+
1+2ln(z)
z2
if 1 ≤ z ≤ et .
t > 0.
For t = 0:
f1(z0,0) = fZ0
(z0) =
1
0
4az0 da = 2z0, z0,1 = 0 < z < 1 = z0,2.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 27
28. Example : t > 0, t0 = 0.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 28
29. Case II.3: (Z0,B) is a random vector
In this case the solution s.p. has the following expression:
Z(t) = Z1(t)+Z2(t), where
Z1(t) = Z0,
Z2(t) = B(t −t0).
To compute the p.d.f. of Z = Z(t), t : t > t0 fix, first we will determine the joint p.d.f.
of Z1 = Z1(t) and Z2 = Z2(t) by R.V.T. method (two–dimensional version) to:
X1 = Z0, X2 = B, r1(z0,b) = z0, r2(z0,b) = b(t −t0),
Y1 = Z1, Y2 = Z2, s1(z1,z2) = z1, s2(z1,z2) = z2
t−t0
.
Hence, the Jacobian is given by:
J2 =
∂s1(z1,z2)
∂z1
∂s2(z1,z2)
∂z2
=
1
t −t0
> 0,
therefore
fZ1,Z2
(z1,z2) =
1
t −t0
fZ0,B z1,
z2
t −t0
,
where
z1,1 = z0,1 ≤ z1 ≤ z0,2 = z1,2, z2,1 = b1(t −t0) ≤ z2 ≤ b2(t −t0) = z2,2.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 29
30. Now, we apply R.V.T. method (sum of two r.v.’s: Y1 = X1 +X2)
fY1
(y1) =
x1,2
x1,1
fX1,X2
(x1,y1 −x1)dx1,
to X1 = Z1, X2 = Z2 and Y1 = Z and we will obtain the p.d.f. of Z = Z1 +Z2:
f1(z,t) = fZ (z) =
z1,2
z1,1
fZ1,Z2
(z1,z −z1)dz1,
=
1
t −t0
z0,2
z0,1
fZ0,B z0,
z −z0
t −t0
dz0, ˆz1 ≤ z ≤ ˆz2, t > t0,
where
ˆz1 = z0,1 +b1(t −t0) ≤ z ≤ z0,2 +b2(t −t0) = ˆz2.
If t = t0, then Z(t) = Z(t0) = Z0 and the 1–p.d.f. is the Z0–marginal p.d.f.:
f1(z0,t0) = fZ0
(z0) =
b2
b1
fZ0,B (z0,b)db, z0,1 ≤ z0 ≤ z0,2.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 30
31. Example Case II.3: (Z0,B) is a random vector whose components are dependent
fZ0,B (z0,b) =
1
4 + 1
4 (z0)3b − 1
4 z0b3 if −1 < z0 < 1, −1 < b < 1,
0 otherwise.
Example : t > 0, t0 = 0.
We substitute into the obtained formula and after making some simplifications to
obtain:
f1(z,t) =
1
t
min{1,z+t}
max{z−t,−1}
1
4
+
1
4
(z0)3 z −z0
t
−
1
4
z0
z −z0
t
3
dz0,
−1−t ≤ z ≤ 1+t.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 31
32. Case III.1: Z0 is a r.v. Here, we illustrate the computation of the mean, variance and
probabilities of interest
In this case the solution s.p. has the following expression:
Z(t) = ea(t−t0)
Z0 +
b
a
ea(t−t0)
−1 , t ≥ t0.
Next, we first fix t : t ≥ t0 and denote Z = Z(t). Then we apply R.V.T. method
(linear transformation: Y = αX +β, α = 0) to:
α = ea(t−t0)
> 0, β =
b
a
ea(t−t0)
−1 , X = Z0, Y = Z.
and, taking into account that fY (y) = 1
|α| fX
y−β
α the domain of r.v. Z0, one gets:
f1(z,t) = e−a(t−t0)
fZ0
e−a(t−t0)
z +
b
a
−
b
a
, z1 ≤ z ≤ z2, t ≥ t0,
where
z1 = z0,1ea(t−t0)
+
b
a
ea(t−t0)
−1 , z2 = z0,2ea(t−t0)
+
b
a
ea(t−t0)
−1 .
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 32
33. Example Case III.1: Z0 ∼ Exp(λ), λ > 0
f1(z,t) = λe
− a(t−t0)+λ (z+ b
a )e−a(t−t0)− b
a
,
b
a
ea(t−t0)
−1 ≤ z < +∞, t ≥ t0,
Example : λ = 1, t0 = 0 a = −1, b = 1.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 33
34. Example Case III.1: Computing some statistical properties by the 1–p.d.f.
Moments w.r.t. the origin:
αn(t) = E (Z(t))k
=
∞
b
a ea(t−t0)−1
zk
f1(z,t)dz, k = 0,1,2,...
E[Z(t)] = α1(t) =
−bλ +ea(t−t0)(a+bλ)
λa
,
V[Z(t)] = α2(t)−(α1(t))2
=
e2a(t−t0)
λ2
.
Example : λ = 1, t0 = 0, a = −1, b = 1.
2 4 6 8 10
t
-1.0
-0.5
0.5
1.0
E@ZHtLD
0 1 2 3 4
t
0.2
0.4
0.6
0.8
1.0
Var@ZHtLD
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 34
35. The computation of probabilities can also be carried out directly through the 1-p.d.f.
For instance, it may be of interest to determine the probability that the solution lies
between two fixed values, say, v1 = 2 and v2 = 3:
P[2 ≤ Z ≤ 3] =
3
2
f1(z,t)dz
= −e
λ
a b−(3a+b)ea(−t+t0)
+e
λ
a b−ea(−t+t0) b+aMax 2,
b −1+ea(t−t0)
a
.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 35
36. Some important remarks regarding the application of R.V.T. technique:
limitations and possibilities
Remark 1: The importance of making an appropriate choice
Let us consider Case III.5. If we write the solution s.p. in the following form:
Z(t) = Z1(t)+Z2(t), where
Z1(t) = Z0eA(t−t0),
Z2(t) = b
A eA(t−t0) −1 ,
then the application of R.V.T. (two–dimensional version) with the following choice:
X1 = Z0, X2 = A, r1(z0,a) = z0ea(t−t0), r2(a) = b
a ea(t−t0) −1 ,
Y1 = Z1, Y2 = Z2, s1(z1,z2) = ? s2(z2) = ?
does not lead to fruitful results since we cannot isolate z0 = s1(z1,z2) and
a = s2(z1,z2) and this would ruin our goal.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 36
37. Notice that the previous drawback can be overcame as follows:
Z(t) = Z1(t)+Z2(t), where
Z1(t) = Z0 + b
A eA(t−t0),
Z2(t) = − b
A .
and applying R.V.T. (two–dimensional version) with the following choice:
X1 = Z0, X2 = A, r1(z0,a) = z0 + b
a ea(t−t0), r2(a) = −b
a ,
Y1 = Z1, Y2 = Z2, s1(z1,z2) = z1e
b
z2
(t−t0)
+z2, s2(z2) = − b
z2
.
However, sometimes a good choice is not enough to apply R.V.T. method. Take a
meanwhile to deal with the apparent simplest Case III.3 where:
Z = r(A), where r(A) = z0eA(t−t0)
+
b
A
eA(t−t0)
−1 .
Can you isolate the r.v. A?
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 37
38. Lagrange–B¨urmann Theorem
H : Suppose z is defined as a function of the variable a by an equation of the form:
z = r(a) where r is analytic about the point a0 where r (a0) = 0.
T : Then, it is possible to invert (or to solve) the equation for a: a = s(z) on a
neighbourhood N (r(a0);δ), δ > 0 of r(a0):
a = s(z) = a0 +
∞
∑
n=1
lim
a→a0
dn−1
dan−1
a−a0
r(a)−r(a0)
n
(z −r(a0))n
n!
, z ∈ N (r(a0);δ), δ > 0.
Step 1: Divide the domain of the map r (or equivalently, the domain of the r.v.
A) into k subintervals: A1,A2,...,Ak where r is monotone.
Step 2: For every subinterval Aj , 1 ≤ j ≤ k , select a0,j ∈ Aj such that
r (a0,j ) = 0. By Lagrange–B¨urmann formula, construct the inverse, say sj (z), of
the map r(a) = rj (a) on Aj :
sj (z) = a0,j +
∞
∑
n=1
lim
a→a0,j
dn−1
dan−1
a−a0,j
r(a)−r(a0,j )
n
(z −r(a0,j ))n
n!
, z ∈ N (r(a0,j );δ).
Step 3: Compute the derivative of sj (z):
dsj (z)
dz
=
∞
∑
n=1
lim
a→a0,j
dn−1
dan−1
a−a0,j
r(a)−r(a0,j )
n
(z −r(a0,j ))n−1
(n −1)!
, z ∈ N (r(a0,j );δ).
Step 4: Construct the 1-p.d.f. of Z(t) as follows:
f1(z,t) =
k
∑
j=1
fA(sj (z))
dsj (z)
dz
.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 38
39. Often, the above infinite series must be truncated at the term Nj to control
computational burden:
sj,Nj
(z) = a0,j +
Nj
∑
n=1
lim
a→a0,j
dn−1
dan−1
a−a0,j
r(a)−r(a0,j )
n
(z −r(a0,j ))n
n!
.
Thus, an approximation of its derivative is:
dsj,Nj
(z)
dz
=
Nj
∑
n=1
lim
a→a0,j
dn−1
dan−1
a−a0,j
r(a)−r(a0,j )
n
(z −r(a0,j ))n−1
(n −1)!
.
Repeating the foregoing process on each interval Aj , 1 ≤ j ≤ k, one gets the
corresponding approximation of f1(z,t) given by:
f1(z,t) =
k
∑
j=1
fA(sj,Nj
(z))
dsj,Nj
(z)
dz
.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 39
40. Example Case III.3: A ∼ Be(α = 2;β = 3), b = 1, t0 = 0, z0 = 1
Since in this case r(A) is monotone on the whole interval A1 = [0,1], we take k = 1.
In order to carry out computations, A1 has been split into 7 subintervals in accordance
with the process described previously. In each subinterval, an approximation of degree
Nj = 2, 1 ≤ j ≤ 7, has been used.
For the sake of clarity in the representation, due to differences in the scale the plot has
been split in two pieces: t ∈ [0,1] and t ∈ [1,2].
0.0
0.2
0.4
0.6
0.8
1.0
t
1
2
3
4
5
z
0
4
8
12
16
f1 z,t
0.9
1.2
1.5
1.8
2.1
t
3
6
9
12
z
0.0
0.2
0.4
0.6
0.8
1.0
f1 z,t
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 40
41. Remark 2: Computing the 2–p.d.f. of the solution s.p.
Let us consider Case II.3 and let us fix t1,t2 such as t2 > t1 ≥ t0 and denote
Z1 = Z(t1) and Z2 = Z(t2). All we need to determine the 2–p.d.f. of the solution s.p.
Z(t) is computing the joint p.d.f. of r.v.’s Z1 and Z2. Notice that:
Z(t) = Z0 +B(t −t0).
Then, we apply R.V.T. (two–dimensional version) with the following choice:
X1 = Z0, X2 = B, r1(z0,b) = z0 +b(t1 −t0), r2(z0,b) = z0 +b(t2 −t0),
Y1 = Z1, Y2 = Z2, s1(z1,z2) = z1(t2−t0)−z2(t1−t0)
t2−t1
, s2(z1,z2) = z2−z1
t2−t1
,
Now, taking into account that:
ds1(z1,z2)
dz1
=
t2 −t0
t2 −t1
,
ds1(z1,z2)
dz2
= −
t1 −t0
t2 −t1
,
ds2(z1,z2)
dz1
= −
1
t2 −t1
,
ds2(z1,z2)
dz2
=
1
t2 −t1
,
one obtains the Jacobian:
|J2| =
1
t2 −t1
> 0.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 41
42. Finally:
f2(z1,t1;z2,t2) = fZ1,Z2
(z1,z2)
= fZ0,B
z1(t2 −t0)−z2(t1 −t0)
t2 −t1
,
z2 −z1
t2 −t1
1
t2 −t1
,
where z1,1 ≤ z1 ≤ z1,2, z2,1 ≤ z2 ≤ z2,2 satisfy
z1,1 = z0,1 +b1(t1 −t0), z1,2 = z0,2 +b2(t1 −t0),
z2,1 = z0,1 +b1(t2 −t0), z2,2 = z0,2 +b2(t2 −t0).
From the 2–p.d.f., we can calculate relevant probabilistic properties such as the
correlation function:
ΓZ (t1,t2) =
∞
−∞
∞
−∞
z1z2f2(z1,t1;z2,t2)dz1 dz2.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 42
43. Remark 3: Sometimes the computation of the 1–p.d.f. gives full information of the
solution s.p.
Let us consider Case III.1 for which:
Z(t) = Z0 +
b
a
ea(t−t0)
−
b
a
.
In this case, the solution s.p. at t2 can be represented as follows:
Z(t2) = Z0 + b
a ea(t2−t0) − b
a ,
= ea(t2−t1) Z0 + b
a ea(t1−t0) − b
a
= ea(t2−t1) Z(t1)+ b
a − b
a
= ea(t2−t1)Z(t1)+ b
a ea(t2−t1) −1 .
From this expression we see that the behaviour of the solution Z(t) at the time
instant t2 is deterministically given by a linear transformation of Z(t1). Therefore, the
computation of the 2-p.d.f. is not required.
Let us check it from another point of view!
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 43
44. Let us assume without loss of generality that the expectation of the initial condition is
zero: E[Z0] = 0 and its variance is σ2
Z0
> 0. Then it is easy to check that:
E[Z(ti )] = b
a ea(ti −t0) − b
a , i = 1,2,
σ2
Z(ti ) = σ2
Z0
e2a(ti −t0), i = 1,2,
E[Z(t1)Z(t2)] = σ2
Z0
ea(t2+t1−2t0) + b
a
2
ea(t2+t1−2t0) −ea(t2−t0) −ea(t1−t0) +1 .
Then the correlation coefficient function is given by
ρZ(t1),Z(t2) =
E[Z(t1)Z(t2)]−E[Z(t1)]E[Z(t2)]
σZ(t1)σZ(t2)
= 1.
Z(t2) is completely determined by Z(t1)!
Remark 4: Different but equivalent representations of the 1-p.d.f.
It is important to underline that there usually exist several ways to conduct the study
when applying R.V.T. method, although some of them are easier. Therefore, different
apparently results can appear.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 44
45. Part III
Nonlinear Models in Epidemiolgy
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 45
46. Motivating the nonlinear case: The SI-type epidemiological model
S
I
β
S(t) number of susceptibles in the time instant t.
I(t) number of infected in the time instant t.
n size of the total population. It is assumed to be constant for all time t.
β > 0 rate of decline in the number of susceptibles.
S (t) = −β
n S(t)[n −S(t)], t > 0,
S(0) = m,
Putting the change of variable: P(t) = S(t)
n ∈ [0,1], the model can be recast as follows
P (t) = −β P(t)[1−P(t)], t > 0,
P(0) = P0 = m/n.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 46
47. normalized SI-type epidemiological model
P (t) = −β P(t)[1−P(t)], t > 0,
P(0) = P0.
It is more realistic to assume that β and P0 are r.v.’s rather than deterministic
constants. We will assume that they are independent r.v.’s with p.d.f.’s fP0
(p0) and
fβ (β) and domains
DP0
= { p0 = P0(ω),ω ∈ Ω : 0 ≤ p0,1 ≤ p0 ≤ p0,2 ≤ 1},
Dβ = { β = β(ω),ω ∈ Ω : 0 < β1 < β < β2},
respectively.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 47
48. To compute the 1-p.d.f. of the solution s.p. P(t). To this end, we make several
changes of variables to accommodate the nonlinear SI-model to random linear model
previously studied using the linearization technique:
First change of variable: Q(t) = 1
P(t) . Then, the problem SI-model writes
Q (t) = β Q(t)−β , t > 0,
Q(0) = 1
P0
.
Second change of variable: H(t) = Q(t)−1. This leads
H (t) = β H(t), t > 0,
H(0) = 1
P0
−1.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 48
49. Using R.V.T. technique one can establish the following result:
Case I.3 of linear random model
H : Let us consider the linear random i.v.p.
˙Z(t) = AZ(t), t > t0,
Z(t0) = Z0,
Z0,A r.v.’s with joint p.d.f. fZ0,A(z0,a) (1)
and domains
DZ0
= {z0 = Z0(ω),ω ∈ Ω : z0,1 ≤ z0 ≤ z0,2}, DA = {a = A(ω),ω ∈ Ω : a1 ≤ a ≤ a2}.
T : Then, the 1-p.d.f. of the solution s.p. Z(t) of (1) is given by
f1(z,t) =
1
t −t0
ea2(t−t0)
ea1(t−t0)
fZ0,A
z
ξ
,
ln(ξ)
t −t0
1
ξ2
dξ, z1 ≤ z ≤ z2, ∀t > t0,
where
z1 = z0,1ea1(t−t0), z2 = z0,2ea2(t−t0), if z0,1 > 0,
z1 = z0,1ea2(t−t0), z2 = z0,2ea2(t−t0), if z0,1 z0,2 ≤ 0,
z1 = z0,1ea2(t−t0), z2 = z0,2ea1(t−t0), if z0,2 < 0.
If t = t0,
f1(z0,t0) =
a2
a1
fZ0,A(z0,a)da, z0,1 ≤ z0 ≤ z0,2.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 49
50. We identify the inputs of both problems:
H (t) = β H(t), t > 0,
H(0) = 1
P0
−1.
≡
˙Z(t) = AZ(t), t > t0,
Z(t0) = Z0,
Z0 =
1
P0
−1, A = β, Z(t) = H(t), t0 = 0,
and, fixed t > 0, the p.d.f. of r.v. H = H(t) yields
fH (h) =
1
t
ea2t
ea1t
fZ0,A
h
ξ
,
ln(ξ)
t
1
ξ2
dξ =
1
t
ea2t
ea1t
fZ0
h
ξ
fA
ln(ξ)
t
1
ξ2
dξ ,
where independence between r.v.’s Z0 and A has been used.
Now, we need to write fH (h) in terms of the p.d.f.’s of the inputs P0 and β. With this
aim we establish the following specialization of R.V.T. method:
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 50
51. R.V.T. technique: inverse-vertical translation transformation
H : Let c ∈ R and X be an absolutely continuous real r.v. defined on a probability
space (Ω,F,P), with p.d.f. fX (x). Assume that X is a non-zero r.v. and let us denote
by DX the domain of r.v. X, where
DX = I−
x ∪I+
x ,
I−
x = {x = X(ω) ∈ R : −∞ < x < 0, ω ∈ Ω} ,
I+
x = {x = X(ω) ∈ R : 0 < x < +∞, ω ∈ Ω} .
T : Then, the p.d.f. fY (y) of the inverse-vertical translation transformation
Y = 1
X +c is given by
fY (y) =
1
(y −c)2
fX
1
y −c
, y ∈ DY = I−
y ∪I+
y ,
I−
y = {y ∈ R : y < c} ,
I+
y = {y ∈ R : y > c} .
Applying this result to:
X = P0 ,Y = Z0, c = −1, Z0 =
1
P0
−1
one gets
fH (h) =
1
t
ea2t
ea1t
fZ0
h
ξ
fA
ln(ξ)
t
1
ξ2
dξ =
1
t
eβ2t
eβ1t
fP0
ξ
h +ξ
fβ
ln(ξ)
t
1
(h +ξ)2
dξ .
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 51
52. Remember that: P(t) = 1
H(t)+1 , so fixed t, we finally need to recover the p.d.f. fP (p)
of r.v. P = P(t) from the p.d.f. fH (h). With this end, we establish the following result:
R.V.T. technique: inverse-horizontal translation transformation
H : Let d ∈ R and X be an absolutely continuous real r.v. defined on a probability
space (Ω,F,P), with p.d.f. fX (x). Assume that X −d is a non-zero r.v. and let us
denote by DX the domain of r.v. X, where
DX = I−
x ∪I+
x ,
I−
x = {x = X(ω) ∈ R : −∞ < x < d , ω ∈ Ω} ,
I+
x = {x = X(ω) ∈ R : d < x < +∞, ω ∈ Ω} .
T : Then, the p.d.f. fY (y) of the inverse-horizontal translation transformation
Y = 1
X−d is given by
fY (y) =
1
y2
fX
1
y
+d , y ∈ DY = I−
y ∪I+
y ,
I−
y = {y ∈ R : y < 0} ,
I+
y = {y ∈ R : y > 0} .
Applying this result to:
X = H ,Y = P, d = −1,
one gets
fP (p) =
1
p2
fH
1
p
−1 =
1
t
eβ2t
eβ1t
fP0
p ξ
1−p +p ξ
fβ
ln(ξ)
t
1
(1−p +p ξ)2
dξ .
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 52
53. Summarizing,
1-p.d.f. of the solution s.p. of the normalized SI-type epidemiological model
H : Let us consider the random i.v.p.:
P (t) = −β P(t)[1−P(t)], t > 0,
P(0) = P0,
where β and P0 are independent r.v.’s with p.d.f.’s fP0
(p0) and fβ (β) and domains
DP0
= {p0 = P0(ω),ω ∈ Ω : 0 ≤ p0,1 ≤ p0 ≤ p0,2 ≤ 1},
Dβ = {β = β(ω),ω ∈ Ω : 0 ≤ β1 < β < β2},
respectively
T : Then, the 1-p.d.f. of the solution s.p. P(t) is given by:
f1(p,t) =
1
t
eβ2t
eβ1t
fP0
p ξ
1−p +p ξ
fβ
ln(ξ)
t
1
(1−p +p ξ)2
dξ if t > 0,
fP0
(p0) if t = 0.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 53
54. From this 1-p.d.f. important information related to SI-epidemiological model can be
computed straightforwardly:
Mean and variance:
µP (t) = E[P(t)] =
∞
−∞
pf1(p,t)dp, (σP (t))2
= V[P(t)] =
∞
−∞
p2
f1(p,t)dp−(µP (t))2
,
Bounds for probabilities upon intervals of interest and more:
P[|P(t)− µP (t)| ≥ λ] ≤
(σP (t))2
λ2
,
P[a ≤ P(t) ≤ b] =
b
a
f1(p,t)dp,
Confidence intervals: Fixed α ∈ (0,1), for each time instant t one can
determine x1(t) and x2(t), such that
1−α = P({ω ∈ Ω : P(t;ω) ∈ [x1(t),x2(t)]}) =
x2(t)
x1(t)
f1(p,t)dp ,
and
x1(t)
0
f1(p,t)dp =
α
2
=
1
x2(t)
f1(p,t)dp .
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 54
55. Further relevant information that can be determined from the 1-p.d.f. includes:
Distribution of time until a given proportion of susceptibles remains in the
population
This distribution answers the following question:
What is the expected time before ρ = 80% of the population remains susceptible?
This distribution is computed from the solution of the SI-model:
P(T) =
P0
eβ T (1−P0)+P0
⇒ {ρ = P(T)} ⇒ T =
1
β
ln
P0(1−ρ)
ρ(1−P0)
.
Now, we apply two-dimensional R.V.T. technique to
X1 = β, Y1 = T, Y1 = r1(X1,X2) =
ln
X2(1−ρ)
ρ(1−X2)
X1
, X1 = s1(Y1,Y2) =
ln
Y2(1−ρ)
ρ(1−Y2)
Y1
,
X2 = P0, Y2 = P0, Y2 = r2(X1,X2) = X2, X2 = s2(Y1,Y2) = Y2,
and taking into account that ∂s2(y1,y2)
∂y1
= 0, the jacobian is
J = −
1
(y1)2
ln
y2(1−ρ)
ρ(1−y2)
= 0,
hence the joint p.d.f. of (Y1,Y2) = (T,P0) is given by
fT,P0
(t,p0) =
1
t2
ln
p0(1−ρ)
ρ(1−p0)
fβ,P0
1
t
ln
p0(1−ρ)
ρ(1−p0)
,p0
=
1
t2
ln
p0(1−ρ)
ρ(1−p0)
fβ
1
t
ln
p0(1−ρ)
ρ(1−p0)
fP0
(p0),
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 55
56. Therefore, the P0-marginal distribution of fT,P0
(t,p0) yields the p.d.f. of T
fT (t;ρ) =
1
t2
min(p0,2,c2)
max(p0,1,c1)
ln
p0(1−ρ)
ρ(1−p0)
fβ
1
t
ln
p0(1−ρ)
ρ(1−p0)
fP0
(p0) dp0, p0 ∈ DP0
,
where
DP0
= {p0 = P0(ω),ω ∈ Ω : 0 ≤ p0,1 ≤ p0 ≤ p0,2 ≤ 1}
and
c1 =
ρ eβ1t
ρeβ1t +(1−ρ)
, c2 =
ρ eβ2t
ρeβ2t +(1−ρ)
.
For t and ρ previously fixed, these values have been determined by imposing that
β1 <
1
t
ln
p0(1−ρ)
ρ(1−p0)
< β2,
being
Dβ = {β = β(ω),ω ∈ Ω : 0 ≤ β1 ≤ β ≤ β2 ≤ 1}.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 56
57. Modelling the diffusion of a new technology
year 1995 1996 1997 1998 1999 2000 2001 2002 2003
penetration
rate (xi )
2.3 7.5 10.2 16.2 37.3 59.9 72.6 81.9 89.3
year 2004 2005 2006 2007 2008 2009 2010 2011 −−
penetration
rate (xi )
91.2 99.2 104.4 108.9 109.6 111.4 111.7 113.9 −−
Remarks:
xi represents the rate of mobile phone lines per 100 inhabitants taking as
reference the Spanish census corresponding to year 2011 updated by INE
(National Statistics Institute of Spain).
xi , may be greater than 100% since any individual can possess more than one
mobile phone line. In order to be able to apply the SI-model, two
transformations on the data listed in previous table will be done.
Transformation:
Pi = 1−xi /115, i = 0,1,...,16 ⇒ 0 ≤ Pi ≤ 1.
1 Standardize the values xi by assuming a saturation value of 115.
2 Since the unknown P(t) of SI-model represents the percentage of susceptibles
instead of infected (i.e., the percentage of people who have already adopted the
mobile phone technology).
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 57
58. year 1995 1996 1997 1998 1999 2000 2001 2002 2003
Pi 0.9800 0.9348 0.9113 0.8591 0.6757 0.4791 0.3687 0.2878 0.2235
year 2004 2005 2006 2007 2008 2009 2010 2011 −−
Pi 0.2070 0.1374 0.0922 0.0530 0.0470 0.0313 0.028695 0.0096 −−
Assumptions:
Pi ∈ (0,1) ⇒ P0 ∼ Be(a;b), β > 0 ⇒ β ∼ Ga(λ;τ).
Fitting the model parameters: Determining a,b,λ,τ:
1 Split the sample data: We take data from t0 = 1995 to t12 = 2007.
2 Minimizing the mean square error:
min
a,b,λ,τ>0
E(a,b,λ,τ) =
12
∑
i=0
(Pi −E[P(t;a,b,λ,τ)])2
=
12
∑
i=0
Pi −
1
0
p f1(p,t)dp ,
2
where
f1(p,t) =
1
t
∞
1
fP0
p ξ
1−p +p ξ
fβ
ln(ξ)
t
1
(1−p +p ξ)2
dξ ,
fP0
p ξ
1−p +p ξ
=
Γ(a+b)
Γ(a)Γ(b)
p ξ
1−p +p ξ
a−1
1−p
1−p +p ξ
b−1
,
fβ
ln(ξ)
t
= λτ ξ− λ
t
1
Γ(τ)
ln(ξ)
t
τ−1
.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 58
59. Using the Nelder-Mead algorithm we obtain:
a∗
= 114.95, b∗
= 1.83, λ∗
= 27.36, τ∗
= 0.032.
Out[52]=
1995
1997
1999
2001
2003
2005
2007
2009
2011
t
0.0
0.5
1.0
p
0
2
4
f1 p,t
2000 2005 2010 2015 2020 2025
t
0.2
0.4
0.6
0.8
1.0
ΜP t
2000 2005 2010 2015 2020 2025
t
0.05
0.10
0.15
0.20
ΣP t
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 59
60. Validation and prediction using confidence intervals
2000 2005 2010
t
0.2
0.4
0.6
0.8
1.0
P t
real data
real data
expectation
95 Confidence Interval
P.d.f. of the time T until a proportion ρ = 90% of susceptibles remain in the
population
E[T] =
∞
0
tfT (t;0.90)dt = 2.65
0.
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
Ρ
5
10
15
t
0.0
0.1
0.2
0.3
0.4
fT t
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 60
61. Motivating the nonlinear case: The SIS-type epidemiological model
S(t) number of susceptibles in the time instant t.
I(t) number of infected in the time instant t.
n size of the total population. It is assumed to be constant for all time t.
β > 0 rate of decline in the number of susceptibles.
γ > 0 rate of infected that recover from the disease.
S (t) = −βS(t)I(t)+γI(t),
I (t) = βS(t)I(t)−γI(t),
t > 0, S(0) = S0, I(0) = I0,
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 61
62. Taking into account that the solution (S(t),I(t)) of the SIS-model can be written as
follows
S(t) =
γ(1−S0)+(S0β −γ)e(γ−β)t
β(1−S0)+(S0β −γ)e(γ−β)t
,
I(t) =
(β −γ)(1−S0)e(β−γ)t
β(1−S0)e(β−γ)t +S0β −γ
,
t ≥ 0. (2)
Applying the RVT technique, one can establish the following results
1-p.d.f. of the solution s.p. of the SIS-type epidemiological model
f1(s,t) =
Dγ Dβ
fS0,γ,β
ξ +e(ξ−η)t (−1+s)ξ −sη
ξ +e(ξ−η)t (−1+s)η −sη
,ξ,η
e(ξ−η)t (ξ −η)2 dη dξ
(ξ +e(ξ−η)t (−1+s)η −sη)2
,
f1(i,t) =
Dγ Dβ
fS0,γ,β
ξ −η −e(ξ−η)t iξ +iη
ξ −η −e(ξ−η)t iη +iη
,ξ,η
e(ξ−η)t (ξ −η)2dη dξ
(ξ −η −e(ξ−η)t iη +iη)2
,
where
Dβ , Dγ ,
are the domains of r.v.’s β and γ, respectively.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 62
63. Distribution of time until a given proportion of susceptibles and infected remains in
the population
f1(t,ρS ) =
Dγ Dβ
fS0,γ,β
ξ(1+et(ξ−η)(−1+ρS ))−ηρS
ξ +η(et(ξ−η)(−1+ρS )−ρS )
,ξ,η
×
et(ξ−η)(ξ −η)2(1−ρS )|ξ −ηρS |
(ξ +η(et(ξ−η)(−1+ρS )−ρS ))2
dη dξ .
f1(t,ρI ) =
Dγ Dβ
fS0,γ,β
ξ +η(−1+ρI )−et(ξ−η)
ξ −η(1+(−1+et(ξ−η))ρI )
,ξ,η
×
et(ξ−η)(ξ −η)2(ξ +η(−1+ρI ))ρI
(ξ −η(1+(−1+et(ξ−η))ρI ))2
dη dξ .
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 63
64. In epidemiology, the basic reproduction number, R0, associated to an infection is
useful to elucidate whether will spread out or not. In the case of the SIS model, this
value and its relationship with the propagation of the epidemic in the long run is given
by
R0 =
β
γ
,
if R0 < 1 ≡ β < γ, then the diseases will die out as t → +∞,
if R0 > 1 ≡ β > γ, then the diseases will spread out as t → +∞.
This classification is easily derived from expression of I(t), or equivalently of S(t),
since
lim
t→+∞
I(t) = lim
t→+∞
(β −γ)(1−S0)e(β−γ)t
β(1−S0)e(β−γ)t +S0β −γ
= 0 if β < γ ,
lim
t→+∞
S(t) = lim
t→+∞
γ(1−S0)+(S0β −γ)e(γ−β)t
β(1−S0)+(S0β −γ)e(γ−β)t
= 1 if β < γ .
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 64
65. In our context, both β and γ are r.v.’s, so that the requirement for epidemic extinction
in the deterministic framework β < γ means the computation of the following
probability in the stochastic scenario
P[S ], S = {ω ∈ Ω : β(ω) < γ(ω)} = {ω ∈ Ω : R0(ω) < 1}. (3)
This key probability can be computed by taking advantage of RVT. Using the mapping
U = (U1,U2)T
= (γ,β)T
, V =
U2
U1
=
β
γ
= R0 ,
one gets
fR0
(r0) =
D(γ)
fγ,β (ξ,r0ξ)|ξ|dξ ,
where fγ,β (·,·) denotes the (γ,β)–marginal distribution of the joint p.d.f. of the
random inputs (S0,γ,β. This allows us to compute the target probability
P[S ] =
1
0 D(γ)
fγ,β (ξ,r0ξ)|ξ|dξ dr0 .
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 65
67. Note that the p.d.f.’s for input data are
fS0
ξ +e(ξ−η)t (−1+s)ξ −sη
ξ +e(ξ−η)t (−1+s)η −sη
=
Γ(a+b)
Γ(a)Γ(b)
ξ +e(ξ−η)t (−1+s)ξ −sη
ξ +e(ξ−η)t (−1+s)η −sη
a−1
×
e(ξ−η)t (−1+s)(η −ξ)
ξ +e(ξ−η)t (−1+s)η −sη
b−1
,
fβ (η) =
λβ e−λβ η
1000
0
λβ e−λβ η
dη
,
and
fγ (ξ) =
e
−
(ξ−µγ )2
2(σγ )2 1
√
2πσγ
1
2 erfc
µγ −1
√
2σγ
− 1
2 erfc
µγ
√
2σγ
, if 0 < ξ ≤ 1,
0, otherwise,
being erfc(z) = 1− 2√
π
z
0
e−t2
dt the complementary error function.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 67
68. Using the Nelder-Mead algorithm we obtain:
a∗
= 708.755, b∗
= 893.394, λ∗
β = 1362.230, µ∗
γ = 0.0231162, σ∗
γ = 0.0000526.
1987
1989
1991
1993
1995
1997
1999
2001
2003
2005
t
0.4
0.5
0.6
0.7
s
0
20
40
f1(s,t)
1990 2000 2010 2020
t
0.45
0.50
0.55
0.60
0.65
0.70
0.75
μS(t)
1990 2000 2010 2020
t
0.007
0.008
0.009
0.010
0.011
0.012
σS(t)
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 68
69. Validation and prediction using confidence intervals
1990 1995 2000 2005
t
0.45
0.50
0.55
0.60
0.65
S(t)
real data
μS(t)
μS(t)±2σS(t)
year 1987 1993 1995 1997 2001 2003 2006
(tj ) (j = 0) (j = 6) (j = 8) (j = 10) (j = 14) (j = 16) (j = 19)
Confidence level 0.9550 0.9544 0.9545 0.9546 0.9549 0.9550 0.9552
Table: Probabilities associated to the confidence intervals built according to the SIS
model.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 69
70. Expected time until a certain proportion ρS of the population remains non-smoker
f1(t,ρS ) =
1
0
+∞
0
fS0
ξ(1+et(ξ−η)(−1+ρS ))−ηρS
ξ +η(et(ξ−η)(−1+ρS )−ρS )
fγ (ξ)fβ (η)
×
et(ξ−η)(ξ −η)2(1−ρS )|ξ −ηρS |
(ξ +η(et(ξ−η)(−1+ρS )−ρS ))2
dη dξ ,
ρS 0.45 0.50 0.55 0.60 0.65 0.70 0.75 0.80 0.85
E[TS ] 0.59 4.78 9.42 14.61 20.51 27.32 35.40 45.30 58.10
Table: Expectation of time TS until a proportion, ρS , of the population
remains non-smoker for different values ρS .
E[TS ] =
∞
0
tfTS
(t;0.75)dt = 35.4013.
This means that the middle of the year 2023 approximately
represents the average time until 75% of the Spanish men aged
over 16 years old population will be non-smokers.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 70
71. 0.45
0.5
0.55
0.6
0.65
0.7
0.75
0.8
ρS
1987
1992
1997
2002
2007
2012
2017
2022
2027
t
0.0
0.2
0.4
f1(t,ρS)
Figure: Plot of the 1-p.d.f. of the time TS until a proportion
ρS ∈ {0.45,0.50,0.55,0.60,0.65,0.70,0.75} of the population remains susceptible.
Finally, we compute the probability of the event S previously introduced
P[S ] =
1
0
1
0
fγ (ξ)fβ (r0ξ)|ξ|dξ dr0 = 0.999453,
where fβ (η) and fγ (ξ) are the p.d.f.’s of β and γ, respectively. This is in accordance
with the interpretation of the basic reproductive number R0: the percentage of
Spanish smoker men older than 16 years old will likely disappear as t tends to +∞.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 71
72. The randomized Bertalanffy model: A fish weight growth over the time.
˙W (t) = −λW (t)+η(W (t))2/3, t ≥ t0 ,
W (t0) = W0 .
W (t): fish weight growth at time instant t.
η: intrinsic growth rate.
λ: linear coefficient.
We shall assume that all these inputs are r.v.’s with joint p.d.f. fW0,η,λ (w0,η,λ)
and
P[{ω ∈ Ω : W0(ω) = 0}] = 1, P[{ω ∈ Ω : λ(ω) = 0}] = 1.
Our goals are
1. To determine the 1-p.d.f. of the solution applying RVT method.
2. To use real data in order to assign a reliable probabilistic distribution to random
inputs using an inverse frequentist technique.
3. To construct both punctual and probabilistic predictions based on confidence
intervals.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 72
73. Step 1: To determine the 1-p.d.f. of the solution
Considering the change of variable W (t) = (Z(t))3
, applying the following result
A particular case of RVT
Let Z : Ω → R be an absolutely continuous real r.v. defined on a probability space
(Ω,F,P), with p.d.f. fZ (z). Assume that Z(ω) = 0 for all ω ∈ Ω. Then, the p.d.f.
fW (w) of the transformation W = Z3 is given by
fW (w) =
1
3
fZ
3
√
w |w|−2/3
.
Then, the 1-p.d.f. of the solution W (t) of the Bertalanffy model is
f1(w,t)
=
1
3
fZ w1/3
|w|−2/3
=
D(η) D(λ)
fW0,η,λ
e(1/3)λ(t−t0)λw1/3 +η −e(1/3)λ(t−t0)η
λ
3
ηλ
×
e(1/3)λ(t−t0)λw1/3 +η −e(1/3)λ(t−t0)η
λ
2
e(1/3)λ(t−t0)
|w|−2/3
dλ dη.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 73
74. Step 2: To assign a probabilistic distribution to random inputs
using real data
ti (years) 1 2 3 4 5 6 7
wi (lbs) 0.2 0.4 0.6 0.9 1 1.3 1.6
ti (years) 8 9 10 11 12 13 14
wi (lbs) 1.8 2.3 2.6 2.9 3.1 3.4 3.7
ti (years) 15 16 17 18 19 20 21
wi (lbs) 4.5 5.2 5.7 6.2 6.5 6.7 6.8
ti (years) 22 23 24 25 26 27 28
wi (lbs) 7.2 8.2 9 9.5 10 10.5 11
ti (years) 29 30 31 32 33
wi (lbs) 11.5 12 12.5 13 14
Table: Fish weights wi for walleye species in lbs every year ti , 1 ≤ i ≤ 33 = N.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 74
75. To assign a reliable probability distribution to these data, Frequentist Inverse
Technique will be applied.
STEP 2.1: It is assumed that the measured quantity of interest, fish weights (wi ),
are corrupted by measurement errors εi .
wi = W (ti ;q) = W (ti ;w0,η,λ)+εi , 1 ≤ i ≤ 33 = N ,
where errors are assumed i.i.d. and εi ∼ N(0;σ2), being σ > 0 fixed but unknown.
As a consequence of this assignment the probabilistic distribution for the random
vector Q = (W0,η,λ) is assumed to be
Q = (W0,η,λ) ∼ N3(µQ;ΣQ),
where
µQ = ( ˆw0, ˆη,ˆλ) is defined from appropriate estimates of (w0,η,λ).
ΣQ represents the variance-covariance matrix.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 75
76. STEP 2.2: A least squares fit to the data yields the following
parameter estimates µQ = ( ˆw0, ˆη,ˆλ)
ˆw0 = 0.365934, ˆη = 0.305461, ˆλ = 0.0880184.
The residuals of the fitting are,
εi = W (ti ; ˆw0, ˆη,ˆλ)−wi , 1 ≤ i ≤ 33 = N.
We need to check
i.i.d.
5 10 15 20 25 30
t
-0.4
-0.2
0.2
0.4
0.6
ϵi(t)
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 76
77. normality
Normality Test Statistic p-value
Shapiro-Walk Test 0.958995 0.242077
-0.4 -0.2 0.0 0.2 0.4
-0.4
-0.2
0.0
0.2
0.4
0.6
Normal Theoretical Quantiles
Residuals
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 77
78. STEP 2.3: Determine the sensibility matrix
According to frequentist parameter estimation method first we compute the sensitivity
matrix
χ(Q) =
∂W (t1;Q)
∂W0
···
∂W (t33;Q)
∂W0
∂W (t1;Q)
∂η
···
∂W (t33;Q)
∂η
∂W (t1;Q)
∂λ
···
∂W (t33;Q)
∂λ
T
Q=( ˆw0,ˆη,ˆλ)
.
from the solution
W (t) = (W0)1/3
e−(1/3)λ(t−t0)
−
η
λ
e−(1/3)λ(t−t0)
+
η
λ
.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 78
80. Then, the following probabilistic distribution has been assigned to model parameters
Q = (W0,η,λ) ∼ N3(µQ;ΣQ),
where
The mean vector has been previously estimated by mean square method
µQ = (0.365934,0.305461,0.0880184).
The variance-covariance matrix is
ΣQ = σ2
(χ(Q))T
χ(Q)
−1
=
0.0029288 −0.000812275 −0.000400288
−0.00081227 0.000268075 0.000136915
−0.000400288 0.000136915 0.0000705259
,
being σ the error standard deviation estimate:
σ =
33
∑
i=1
(εi )2 = 0.214435.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 80
81. 2 5 8 1114172023 26
29
32
t
0
5
10
w
0
5
10
f1(w,t)
1.11.21.31.41.5
1.6
1.7
1.8
1.9
2.
t
0.2
0.3
0.4
0.5
0.6
0.7
w
0
2
4
6
8
f1(w,t)
Figure: Left: 1-p.d.f. of the solution stochastic process to random Bertalanffy model
given for all the times of the sample, t ∈ {2,...,33 = N}. Right: Detailed
representation of the 1-p.d.f. for the times t ∈ {1.1,1.2,...,2}.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 81
82. Step 3: To construct punctual and probabilistic predictions based
on confidence intervals
5 10 15 20 25 30
t
2
4
6
8
10
12
14
W(t)
real data
expectation
99% Confidence interval
Figure: Expectation (solid line) and 99%–confidence intervals (dotted lines). Points
represent fish weigh.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 82
83. Conclusions and forthcoming work
1 Random Variable Transformation (R.V.T.) method is a powerful tool to compute
the 1-p.d.f. of the solution stochastic process of Random Differential Equations.
2 The application of this technique has been shown for first order lineal and
nonlinear random differential equations, but it can be extended to second-order
differential equations and random difference equations.
3 Extension of the results for systems of both random differential and difference
equations.
4 Application of R.V.T. technique together with numerical methods.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 83
84. References (Continuous models based on Random Differential Equations)
1 Casab´an M.C., Cort´es J.C., Romero J.V., Rosell´o M.D. (2014): Determining the
first probability density function of linear random initial value problems by the
Random Variable Transformation (R.V.T.) technique: A comprehensive study,
Abstr. & Appl. Anal. 2014- ID248512, pp: 1–25.
2 Casab´an M.C., Cort´es J.C., Navarro-Quil´es, A., Romero J.V., Rosell´o M.D.,
Villanueva, R.J. (2015): Probabilistic solution of the random homogeneous
Riccati differential equation: A comprehensive case-study by using linearization
and the Random Variable Transformation techniques, J. Comput. Appl. Math.
24, pp: 20–35.
3 Casab´an M.C., Cort´es J.C., Navarro-Quil´es, A., Romero J.V., Rosell´o M.D.,
Villanueva, R.J. (2016): Computing probabilistic solutions of the Bernoulli
random differential equation, J. Comput. Appl. Math. (accepted).
4 Casab´an M.C., Cort´es J.C., Romero J.V., Rosell´o M.D. (2016): Probabilistic
solution of random autonomous first-order linear systems of ordinary differential
equations, Romanian Reports in Physics (accepted).
5 Casab´an M.C., Cort´es J.C., Romero J.V., Rosell´o M.D. (2016): Solving random
homogeneous linear second-order differential equations: A full probabilistic
description, Mediterranean J. of Mathematics (accepted).
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 84
85. References (Discrete/Continuous Models based on Random Differential Equations)
1 Casab´an M.C., Cort´es J.C., Romero J.V., Rosell´o M.D. (2016): Random
first-order linear discrete models and their probabilistic solution: A
comprehensive study, Abstr. & Appl. Anal. 2016-ID6372108, pp: 1–22.
2 Casab´an M.C., Cort´es J.C., Romero J.V., Rosell´o M.D. (2014): Probabilistic
solution of random homogeneous linear second-order difference equations, Appl.
Math. Lett. 34, pp: 27–33.
3 Casab´an M.C., Cort´es J.C., Romero J.V., Rosell´o M.D. (2015): Probabilistic
solution of random SI-type epidemiological models using the Random Variable
Transformation technique, Comm. Nonl. Sc. Num. Simul. 24(1-3), pp: 86–97.
4 Casab´an M.C., Cort´es J.C., Navarro-Quil´es, A., Romero J.V., Rosell´o M.D.,
Villanueva, R.J. (2016): A comprehensive probabilistic solution of random
SIS-type epidemiological models using the Random Variable Transformation
technique, Comm. Nonl. Sc. Num. Simul. 32, pp: 199–210.
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 85
86. Computational Methods for Random
Epidemiological Models
M´etodos Computacionales para el Estudio de
Modelos Epidemiol´ogicos con Incertidumbre
Conferencias de Investigaci´on para Posgrado 2016
Universidad Complutense de Madrid
24 junio de 2016
Prof. Dr. Juan Carlos Cort´es
Instituto Universitario de Matem´atica Multidisciplinar
Universitat Polit`ecnica de Val`encia
M´etodos Computacionales Estoc´asticos en Epidemiolog´ıa J.C. Cort´es 86