Mostrando recursos 1 - 20 de 90

  1. Analysis of Economic Burden of Seasonal Influenza: An Actuarial Based Conceptual Model

    Perera, S. S. N.
    Analysing the economic burden of the seasonal influenza is highly essential due to the large number of outbreaks in recent years. Mathematical and actuarial models can be considered as management tools to understand the dynamical behavior, predict the risk, and compute it. This study is an attempt to develop conceptual model to investigate the economic burden due to seasonal influenza. The compartment SIS (susceptible-infected-susceptible) model is used to capture the dynamical behavior of influenza. Considering the current investment and future medical care expenditure as premium payment and benefit (claim), respectively, the insurance and actuarial based conceptual model is proposed to...

  2. Relation between Quaternion Fourier Transform and Quaternion Wigner-Ville Distribution Associated with Linear Canonical Transform

    Bahri, Mawardi; Saleh Arif Fatimah, Muh.
    The quaternion Wigner-Ville distribution associated with linear canonical transform (QWVD-LCT) is a nontrivial generalization of the quaternion Wigner-Ville distribution to the linear canonical transform (LCT) domain. In the present paper, we establish a fundamental relationship between the QWVD-LCT and the quaternion Fourier transform (QFT). Based on this fact, we provide alternative proof of the well-known properties of the QWVD-LCT such as inversion formula and Moyal formula. We also discuss in detail the relationship among the QWVD-LCT and other generalized transforms. Finally, based on the basic relation between the quaternion ambiguity function associated with the linear canonical transform (QAF-LCT) and the...

  3. Relation between Quaternion Fourier Transform and Quaternion Wigner-Ville Distribution Associated with Linear Canonical Transform

    Bahri, Mawardi; Saleh Arif Fatimah, Muh.
    The quaternion Wigner-Ville distribution associated with linear canonical transform (QWVD-LCT) is a nontrivial generalization of the quaternion Wigner-Ville distribution to the linear canonical transform (LCT) domain. In the present paper, we establish a fundamental relationship between the QWVD-LCT and the quaternion Fourier transform (QFT). Based on this fact, we provide alternative proof of the well-known properties of the QWVD-LCT such as inversion formula and Moyal formula. We also discuss in detail the relationship among the QWVD-LCT and other generalized transforms. Finally, based on the basic relation between the quaternion ambiguity function associated with the linear canonical transform (QAF-LCT) and the...

  4. Some New Volterra-Fredholm-Type Nonlinear Discrete Inequalities with Two Variables Involving Iterated Sums and Their Applications

    Xu, Run
    Some generalized discrete Volterra-Fredholm-type inequalities were developed, which can be used as effective tools in the qualitative analysis of the solution to difference equations.

  5. Some New Volterra-Fredholm-Type Nonlinear Discrete Inequalities with Two Variables Involving Iterated Sums and Their Applications

    Xu, Run
    Some generalized discrete Volterra-Fredholm-type inequalities were developed, which can be used as effective tools in the qualitative analysis of the solution to difference equations.

  6. A Greedy Clustering Algorithm Based on Interval Pattern Concepts and the Problem of Optimal Box Positioning

    Nersisyan, Stepan A.; Pankratieva, Vera V.; Staroverov, Vladimir M.; Podolskii, Vladimir E.
    We consider a clustering approach based on interval pattern concepts. Exact algorithms developed within the framework of this approach are unable to produce a solution for high-dimensional data in a reasonable time, so we propose a fast greedy algorithm which solves the problem in geometrical reformulation and shows a good rate of convergence and adequate accuracy for experimental high-dimensional data. Particularly, the algorithm provided high-quality clustering of tactile frames registered by Medical Tactile Endosurgical Complex.

  7. A Greedy Clustering Algorithm Based on Interval Pattern Concepts and the Problem of Optimal Box Positioning

    Nersisyan, Stepan A.; Pankratieva, Vera V.; Staroverov, Vladimir M.; Podolskii, Vladimir E.
    We consider a clustering approach based on interval pattern concepts. Exact algorithms developed within the framework of this approach are unable to produce a solution for high-dimensional data in a reasonable time, so we propose a fast greedy algorithm which solves the problem in geometrical reformulation and shows a good rate of convergence and adequate accuracy for experimental high-dimensional data. Particularly, the algorithm provided high-quality clustering of tactile frames registered by Medical Tactile Endosurgical Complex.

  8. Extension of Wolfe Method for Solving Quadratic Programming with Interval Coefficients

    Syaripuddin; Suprajitno, Herry; Fatmawati
    Quadratic programming with interval coefficients developed to overcome cases in classic quadratic programming where the coefficient value is unknown and must be estimated. This paper discusses the extension of Wolfe method. The extended Wolfe method can be used to solve quadratic programming with interval coefficients. The extension process of Wolfe method involves the transformation of the quadratic programming with interval coefficients model into linear programming with interval coefficients model. The next step is transforming linear programming with interval coefficients model into two classic linear programming models with special characteristics, namely, the optimum best and the worst optimum problem.

  9. Extension of Wolfe Method for Solving Quadratic Programming with Interval Coefficients

    Syaripuddin; Suprajitno, Herry; Fatmawati
    Quadratic programming with interval coefficients developed to overcome cases in classic quadratic programming where the coefficient value is unknown and must be estimated. This paper discusses the extension of Wolfe method. The extended Wolfe method can be used to solve quadratic programming with interval coefficients. The extension process of Wolfe method involves the transformation of the quadratic programming with interval coefficients model into linear programming with interval coefficients model. The next step is transforming linear programming with interval coefficients model into two classic linear programming models with special characteristics, namely, the optimum best and the worst optimum problem.

  10. Analysis of a Heroin Epidemic Model with Saturated Treatment Function

    Wangari, Isaac Mwangi; Stone, Lewi
    A mathematical model is developed that examines how heroin addiction spreads in society. The model is formulated to take into account the treatment of heroin users by incorporating a realistic functional form that “saturates” representing the limited availability of treatment. Bifurcation analysis reveals that the model has an intrinsic backward bifurcation whenever the saturation parameter is larger than a fixed threshold. We are particularly interested in studying the model’s global stability. In the absence of backward bifurcations, Lyapunov functions can often be found and used to prove global stability. However, in the presence of backward bifurcations, such Lyapunov functions may not exist or may be difficult to construct. We make...

  11. Analysis of a Heroin Epidemic Model with Saturated Treatment Function

    Wangari, Isaac Mwangi; Stone, Lewi
    A mathematical model is developed that examines how heroin addiction spreads in society. The model is formulated to take into account the treatment of heroin users by incorporating a realistic functional form that “saturates” representing the limited availability of treatment. Bifurcation analysis reveals that the model has an intrinsic backward bifurcation whenever the saturation parameter is larger than a fixed threshold. We are particularly interested in studying the model’s global stability. In the absence of backward bifurcations, Lyapunov functions can often be found and used to prove global stability. However, in the presence of backward bifurcations, such Lyapunov functions may...

  12. Analysis of a Heroin Epidemic Model with Saturated Treatment Function

    Wangari, Isaac Mwangi; Stone, Lewi
    A mathematical model is developed that examines how heroin addiction spreads in society. The model is formulated to take into account the treatment of heroin users by incorporating a realistic functional form that “saturates” representing the limited availability of treatment. Bifurcation analysis reveals that the model has an intrinsic backward bifurcation whenever the saturation parameter is larger than a fixed threshold. We are particularly interested in studying the model’s global stability. In the absence of backward bifurcations, Lyapunov functions can often be found and used to prove global stability. However, in the presence of backward bifurcations, such Lyapunov functions may...

  13. Simulation of Wellbore Stability during Underbalanced Drilling Operation

    Abdel Azim, Reda
    The wellbore stability analysis during underbalance drilling operation leads to avoiding risky problems. These problems include (1) rock failure due to stresses changes (concentration) as a result of losing the original support of removed rocks and (2) wellbore collapse due to lack of support of hydrostatic fluid column. Therefore, this paper presents an approach to simulate the wellbore stability by incorporating finite element modelling and thermoporoelastic environment to predict the instability conditions. Analytical solutions for stress distribution for isotropic and anisotropic rocks are presented to validate the presented model. Moreover, distribution of time dependent shear stresses around the wellbore is presented to be compared with rock shear strength to select...

  14. Simulation of Wellbore Stability during Underbalanced Drilling Operation

    Abdel Azim, Reda
    The wellbore stability analysis during underbalance drilling operation leads to avoiding risky problems. These problems include (1) rock failure due to stresses changes (concentration) as a result of losing the original support of removed rocks and (2) wellbore collapse due to lack of support of hydrostatic fluid column. Therefore, this paper presents an approach to simulate the wellbore stability by incorporating finite element modelling and thermoporoelastic environment to predict the instability conditions. Analytical solutions for stress distribution for isotropic and anisotropic rocks are presented to validate the presented model. Moreover, distribution of time dependent shear stresses around the wellbore is...

  15. Simulation of Wellbore Stability during Underbalanced Drilling Operation

    Abdel Azim, Reda
    The wellbore stability analysis during underbalance drilling operation leads to avoiding risky problems. These problems include (1) rock failure due to stresses changes (concentration) as a result of losing the original support of removed rocks and (2) wellbore collapse due to lack of support of hydrostatic fluid column. Therefore, this paper presents an approach to simulate the wellbore stability by incorporating finite element modelling and thermoporoelastic environment to predict the instability conditions. Analytical solutions for stress distribution for isotropic and anisotropic rocks are presented to validate the presented model. Moreover, distribution of time dependent shear stresses around the wellbore is...

  16. Gutman Index and Detour Gutman Index of Pseudo-Regular Graphs

    Kavithaa, S.; Kaladevi, V.
    The Gutman index of a connected graph $G$ is defined as $\mathrm{G}\mathrm{u}\mathrm{t}(G)={\sum }_{u\ne v}d(u)d(v)d(u,v)$ , where $d(u)$   and   $d(v)$ are the degree of the vertices $u$   and   $v$ and $d(u,v)$ is the distance between vertices $u$   and   $v$ . The Detour Gutman index of a connected graph $G$ is defined as $  \mathrm{G}\mathrm{u}\mathrm{t}(G)={\sum }_{u\ne v}d(u)d(v)D(u,v)$ , where $D(u,v)$ is the longest distance between vertices $u$   and   $v$ . In this paper, the Gutman index and the Detour Gutman index of pseudo-regular graphs are determined.

  17. Gutman Index and Detour Gutman Index of Pseudo-Regular Graphs

    Kavithaa, S.; Kaladevi, V.
    The Gutman index of a connected graph $G$ is defined as $\mathrm{G}\mathrm{u}\mathrm{t}(G)={\sum }_{u\ne v}d(u)d(v)d(u,v)$ , where $d(u)$   and   $d(v)$ are the degree of the vertices $u$   and   $v$ and $d(u,v)$ is the distance between vertices $u$   and   $v$ . The Detour Gutman index of a connected graph $G$ is defined as $  \mathrm{G}\mathrm{u}\mathrm{t}(G)={\sum }_{u\ne v}d(u)d(v)D(u,v)$ , where $D(u,v)$ is the longest distance between vertices $u$   and   $v$ . In this paper, the Gutman index and the Detour Gutman index of pseudo-regular graphs are determined.

  18. Gutman Index and Detour Gutman Index of Pseudo-Regular Graphs

    Kavithaa, S.; Kaladevi, V.
    The Gutman index of a connected graph $G$ is defined as $\mathrm{G}\mathrm{u}\mathrm{t}(G)={\sum }_{u\ne v}d(u)d(v)d(u,v)$ , where $d(u)$   and   $d(v)$ are the degree of the vertices $u$   and   $v$ and $d(u,v)$ is the distance between vertices $u$   and   $v$ . The Detour Gutman index of a connected graph $G$ is defined as $  \mathrm{G}\mathrm{u}\mathrm{t}(G)={\sum }_{u\ne v}d(u)d(v)D(u,v)$ , where $D(u,v)$ is the longest distance between vertices $u$   and   $v$ . In this paper, the Gutman index and the Detour Gutman index of pseudo-regular graphs are determined.

  19. On the Solution of the Eigenvalue Assignment Problem for Discrete-Time Systems

    Mostafa, El-Sayed M. E.; Aboutahoun, Abdallah W.; Omar, Fatma F. S.
    The output feedback eigenvalue assignment problem for discrete-time systems is considered. The problem is formulated first as an unconstrained minimization problem, where a three-term nonlinear conjugate gradient method is proposed to find a local solution. In addition, a cut to the objective function is included, yielding an inequality constrained minimization problem, where a logarithmic barrier method is proposed for finding the local solution. The conjugate gradient method is further extended to tackle the eigenvalue assignment problem for the two cases of decentralized control systems and control systems with time delay. The performance of the methods is illustrated through various test examples.

  20. On the Solution of the Eigenvalue Assignment Problem for Discrete-Time Systems

    Mostafa, El-Sayed M. E.; Aboutahoun, Abdallah W.; Omar, Fatma F. S.
    The output feedback eigenvalue assignment problem for discrete-time systems is considered. The problem is formulated first as an unconstrained minimization problem, where a three-term nonlinear conjugate gradient method is proposed to find a local solution. In addition, a cut to the objective function is included, yielding an inequality constrained minimization problem, where a logarithmic barrier method is proposed for finding the local solution. The conjugate gradient method is further extended to tackle the eigenvalue assignment problem for the two cases of decentralized control systems and control systems with time delay. The performance of the methods is illustrated through various test...

Aviso de cookies: Usamos cookies propias y de terceros para mejorar nuestros servicios, para análisis estadístico y para mostrarle publicidad. Si continua navegando consideramos que acepta su uso en los términos establecidos en la Política de cookies.