We address the problem of long-term dynamics of tuberculosis (TB) and latent tuberculosis (LTB) in semiclosed communities. These communities are congregate settings with the potential for sustained daily contact for weeks, months, and even years between their members. Basic examples of these communities are prisons, but certain urban/rural communities, some schools, among others could possibly fit well into this definition. These communities present a sort of ideal conditions for TB spread. In order to describe key relevant dynamics of the disease in these communities, we consider a five compartments SEIR model with five possible routes toward TB infection: primary infection after a contact with infected and infectious individuals (fast TB), endogenous reactivation after a period of latency (slow TB), relapse by natural causes after a cure, exogenous reinfection of latently infected, and exogenous reinfection of recovered individuals. We discuss the possible existence of multiple endemic equilibrium states and the role that the two types of exogenous reinfections in the long-term dynamics of the disease could play.
Inequalities play an important role in pure and applied mathematics. In particular, Jensen’s inequality, one of the most famous inequalities, plays the main role in the study of the existence and uniqueness of initial and boundary value problems for differential equations. In this work, we prove some new Jensen-type inequalities for m-convex functions and apply them to generalized Riemann-Liouville-type integral operators. Furthermore, as a remarkable consequence, some new inequalities for convex functions are obtained.
14 April 2020 in Mathematical Problems in Engineering
Genetic algorithms have proved to be a useful improvement heuristic for tackling several combinatorial problems, including the coalition structure generation problem. In this case, the focus lies on selecting the best partition from a discrete set. A relevant issue when designing a Genetic algorithm for coalition structure generation problems is to choose a proper genetic encoding that enables an efficient computational implementation. In this paper, we present a novel hybrid encoding, and we compare its performance against several genetic encoding proposed in the literature. We show that even in difficult instances of the coalition structure generation problem, the proposed approach is a competitive alternative to obtaining good quality solutions in reasonable computing times. Furthermore, we also show that the encoding relevance increases as the number of players increases.
We have developed a new methodology for examining and extracting patterns from brain electric activity by using data mining and machine learning techniques. Data was collected from experiments focused on the study of cognitive processes that might evoke different specific strategies in the resolution of math problems. A binary classification problem was constructed using correlations and phase synchronization between different electroencephalographic channels as characteristics and, as labels or classes, the math performances of individuals participating in specially designed experiments. The proposed methodology is based on using well-established procedures of feature selection, which were used to determine a suitable brain functional network size related to math problem solving strategies and also to discover the most relevant links in this network without including noisy connections or excluding significant connections.