Search results for "Applied Mathematics"
showing 10 items of 4379 documents
Stability of stationary solutions in models of the Calvin cycle
2017
Abstract In this paper results are obtained concerning the number of positive stationary solutions in simple models of the Calvin cycle of photosynthesis and the stability of these solutions. It is proved that there are open sets of parameters in the model of Zhu et al. (2009) for which there exist two positive stationary solutions. There are never more than two isolated positive stationary solutions but under certain explicit special conditions on the parameters there is a whole continuum of positive stationary solutions. It is also shown that in the set of parameter values for which two isolated positive stationary solutions exist there is an open subset where one of the solutions is asym…
A study on time discretization and adaptive mesh refinement methods for the simulation of cancer invasion: The urokinase model
2016
In the present work we investigate a model that describes the chemotactically and proteolytically driven tissue invasion by cancer cells. The model is a system of advection-reaction-diffusion equations that takes into account the role of the serine protease urokinase-type plasminogen activator. The analytical and numerical study of such a system constitutes a challenge due to the merging, emerging, and traveling concentrations that the solutions exhibit. Classical numerical methods applied to this system necessitate very fine discretization grids to resolve these dynamics in an accurate way. To reduce the computational cost without sacrificing the accuracy of the solution, we apply adaptive…
Parallel algorithms for large-scale biological sequence alignment on Xeon-Phi based clusters
2016
Computing alignments between two or more sequences are common operations frequently performed in computational molecular biology. The continuing growth of biological sequence databases establishes the need for their efficient parallel implementation on modern accelerators. This paper presents new approaches to high performance biological sequence database scanning with the Smith-Waterman algorithm and the first stage of progressive multiple sequence alignment based on the ClustalW heuristic on a Xeon Phi-based compute cluster. Our approach uses a three-level parallelization scheme to take full advantage of the compute power available on this type of architecture; i.e. cluster-level data par…
Natural visibility graphs for diagnosing attention deficit hyperactivity disorder (ADHD)
2016
“NOTICE: this is the author’s version of a work that was accepted for publication in Electronic Notes in Discrete Mathematics. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Electronic Notes in Discrete Mathematics, [Volume 54, October 2016, Pages 337-342] DOI 10.1016/j.endm.2016.09.058 ¨
Preventive and Therapeutic Role of Muscle Contraction Against Chronic Diseases.
2016
Background: Due to the continuing increase of the elderly population in the western countries, the prevalence of the main chronic diseases (obesity, type 2 diabetes and related metabolic disorders, arterial hypertension, vascular damage due to atherosclerotic process, cancer, chronic obstructive pulmonary disease, neurodegenerative diseases, chronic kidney disease, immune-mediated diseases) is increasing. There is incontrovertible evidence that regular physical activity contributes to the primary and secondary prevention of several chronic diseases and is associated with a reduced risk of premature death. Methods: In this review the most prevalent chronic pathologic conditions are discussed…
A solution of the minimum-time velocity planning problem based on lattice theory
2018
For a vehicle on an assigned path, we find the minimum-time speed law that satisfies kinematic and dynamic constraints, related to maximum speed and maximum tangential and transversal acceleration. We present a necessary and sufficient condition for the feasibility of the problem and a simple operator, based on the solution of two ordinary differential equations, which computes the optimal solution. Theoretically, we show that the problem feasible set, if not empty, is a lattice, whose supremum element corresponds to the optimal solution.
A continuous time tug-of-war game for parabolic $p(x,t)$-Laplace type equations
2019
We formulate a stochastic differential game in continuous time that represents the unique viscosity solution to a terminal value problem for a parabolic partial differential equation involving the normalized $p(x,t)$-Laplace operator. Our game is formulated in a way that covers the full range $1<p(x,t)<\infty$. Furthermore, we prove the uniqueness of viscosity solutions to our equation in the whole space under suitable assumptions.
A stochastic dynamical social model involving a human happiness index
2018
[EN] This paper presents a new human happiness index built through five dimensions: development, freedom, solidarity, justice and peace. These five dimensions are evaluated through quantitative variables obtained from the Human Development Reports, World Data Bank and Eurostat. The new happiness index has been built following the guidelines set by the Human Development Reports of the UN for the construction of quality indices, and it has been compared on a set of 13 EU countries with the Overall Life Satisfaction Index, which is used by the UN. Moreover, the new index has been included in a dynamic mathematical model through the demographic rates to study the evolution of the population. Th…
Packing colorings of subcubic outerplanar graphs
2018
Given a graph $G$ and a nondecreasing sequence $S=(s_1,\ldots,s_k)$ of positive integers, the mapping $c:V(G)\longrightarrow \{1,\ldots,k\}$ is called an $S$-packing coloring of $G$ if for any two distinct vertices $x$ and $y$ in $c^{-1}(i)$, the distance between $x$ and $y$ is greater than $s_i$. The smallest integer $k$ such that there exists a $(1,2,\ldots,k)$-packing coloring of a graph $G$ is called the packing chromatic number of $G$, denoted $\chi_{\rho}(G)$. The question of boundedness of the packing chromatic number in the class of subcubic (planar) graphs was investigated in several earlier papers; recently it was established that the invariant is unbounded in the class of all sub…
Miscellaneous Graph Preliminaries
2020
Summary This article contains many auxiliary theorems which were missing in the Mizar Mathematical Library [2] to the best of the author’s knowledge. Most of them regard graph theory as formalized in the GLIB series (cf. [8]) and most of them are preliminaries needed in [7] or other forthcoming articles.