Nothing Special   »   [go: up one dir, main page]

Next Issue
Volume 10, December
Previous Issue
Volume 10, June
You seem to have javascript disabled. Please note that many of the page functionalities won't work as expected without javascript enabled.
 
 

Axioms, Volume 10, Issue 3 (September 2021) – 109 articles

Cover Story (view full-size image): Our knowledge on groups has developed for 200 years. Lie groups emerged 150 years ago. Compact and locally compact topological groups were researched for 100 years. Our review addresses what followed beyond in the last 25 years. It describes results on the building of infinite composites of finite dimensional groups, technically called projective limits. The resulting topological groups are called pro-Lie groups, named after the founder of the theory of groups on manifolds, Sophus Lie, 1842–1899. His theory combined algebra, geometry, analysis, and topology. In this spirit, we present an overview of recent developments in the appropriate area of group theory. View this paper
  • Issues are regarded as officially published after their release is announced to the table of contents alert mailing list.
  • You may sign up for e-mail alerts to receive table of contents of newly released issues.
  • PDF is the official format for papers published in both, html and pdf forms. To view the papers in pdf format, click on the "PDF Full-text" link, and use the free Adobe Reader to open them.
Order results
Result details
Section
Select all
Export citation of selected articles as:
9 pages, 247 KiB  
Article
Mellin Transform of Logarithm and Quotient Function with Reducible Quartic Polynomial in Terms of the Lerch Function
by Robert Reynolds and Allan Stauffer
Axioms 2021, 10(3), 236; https://doi.org/10.3390/axioms10030236 - 21 Sep 2021
Viewed by 1624
Abstract
A class of definite integrals involving a quotient function with a reducible polynomial, logarithm and nested logarithm functions are derived with a possible connection to contact problems for a wedge. The derivations are expressed in terms of the Lerch function. Special cases are [...] Read more.
A class of definite integrals involving a quotient function with a reducible polynomial, logarithm and nested logarithm functions are derived with a possible connection to contact problems for a wedge. The derivations are expressed in terms of the Lerch function. Special cases are also derived in terms fundamental constants. The majority of the results in this work are new. Full article
(This article belongs to the Collection Mathematical Analysis and Applications)
12 pages, 266 KiB  
Article
Integral Characterizations for Uniform Stability with Growth Rates in Banach Spaces
by Rovana Boruga (Toma), Mihail Megan and Daniela Maria-Magdalena Toth
Axioms 2021, 10(3), 235; https://doi.org/10.3390/axioms10030235 - 21 Sep 2021
Cited by 7 | Viewed by 1857
Abstract
The aim of this paper is to present some integral characterizations for the concept of uniform stability with growth rates in Banach spaces. In this sense, we prove necessary and sufficient conditions (of Barbashin and Datko type) for an evolution operator to be [...] Read more.
The aim of this paper is to present some integral characterizations for the concept of uniform stability with growth rates in Banach spaces. In this sense, we prove necessary and sufficient conditions (of Barbashin and Datko type) for an evolution operator to be uniform h- stable. As particular cases of this notion, we obtain four characterizations for uniform exponential stability and two characterizations for uniform polynomial stability. Full article
(This article belongs to the Special Issue Nonautonomous and Random Dynamical Systems)
11 pages, 257 KiB  
Article
On Solvability Conditions for a Certain Conjugation Problem
by Vladimir Vasilyev and Nikolai Eberlein
Axioms 2021, 10(3), 234; https://doi.org/10.3390/axioms10030234 - 20 Sep 2021
Cited by 2 | Viewed by 1602
Abstract
We study a certain conjugation problem for a pair of elliptic pseudo-differential equations with homogeneous symbols inside and outside of a plane sector. The solution is sought in corresponding Sobolev–Slobodetskii spaces. Using the wave factorization concept for elliptic symbols, we derive a general [...] Read more.
We study a certain conjugation problem for a pair of elliptic pseudo-differential equations with homogeneous symbols inside and outside of a plane sector. The solution is sought in corresponding Sobolev–Slobodetskii spaces. Using the wave factorization concept for elliptic symbols, we derive a general solution of the conjugation problem. Adding some complementary conditions, we obtain a system of linear integral equations. If the symbols are homogeneous, then we can apply the Mellin transform to such a system to reduce it to a system of linear algebraic equations with respect to unknown functions. Full article
(This article belongs to the Special Issue Modern Problems of Mathematical Physics and Their Applications)
14 pages, 298 KiB  
Article
On r-Noncommuting Graph of Finite Rings
by Rajat Kanti Nath, Monalisha Sharma, Parama Dutta and Yilun Shang
Axioms 2021, 10(3), 233; https://doi.org/10.3390/axioms10030233 - 19 Sep 2021
Cited by 4 | Viewed by 2066
Abstract
Let R be a finite ring and rR. The r-noncommuting graph of R, denoted by ΓRr, is a simple undirected graph whose vertex set is R and two vertices x and y are adjacent if [...] Read more.
Let R be a finite ring and rR. The r-noncommuting graph of R, denoted by ΓRr, is a simple undirected graph whose vertex set is R and two vertices x and y are adjacent if and only if [x,y]r and [x,y]r. In this paper, we obtain expressions for vertex degrees and show that ΓRr is neither a regular graph nor a lollipop graph if R is noncommutative. We characterize finite noncommutative rings such that ΓRr is a tree, in particular a star graph. It is also shown that ΓR1r and ΓR2ψ(r) are isomorphic if R1 and R2 are two isoclinic rings with isoclinism (ϕ,ψ). Further, we consider the induced subgraph ΔRr of ΓRr (induced by the non-central elements of R) and obtain results on clique number and diameter of ΔRr along with certain characterizations of finite noncommutative rings such that ΔRr is n-regular for some positive integer n. As applications of our results, we characterize certain finite noncommutative rings such that their noncommuting graphs are n-regular for n6. Full article
(This article belongs to the Special Issue Latest Trends in Noncommutative Algebra)
Show Figures

Figure 1

Figure 1
<p><math display="inline"><semantics> <msubsup> <mi mathvariant="sans-serif">Γ</mi> <mrow> <mi>E</mi> <mo>(</mo> <mn>4</mn> <mo>)</mo> </mrow> <mn>0</mn> </msubsup> </semantics></math>: <span class="html-italic">r</span>-noncommuting graph of <math display="inline"><semantics> <mrow> <mi>E</mi> <mo>(</mo> <mn>4</mn> <mo>)</mo> </mrow> </semantics></math> when <math display="inline"><semantics> <mrow> <mi>r</mi> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 2
<p><math display="inline"><semantics> <msubsup> <mi mathvariant="sans-serif">Γ</mi> <mrow> <mi>E</mi> <mo>(</mo> <mn>4</mn> <mo>)</mo> </mrow> <mrow> <mi>a</mi> <mo>+</mo> <mi>b</mi> </mrow> </msubsup> </semantics></math>: <span class="html-italic">r</span>-noncommuting graph of <math display="inline"><semantics> <mrow> <mi>E</mi> <mo>(</mo> <mn>4</mn> <mo>)</mo> </mrow> </semantics></math> when <math display="inline"><semantics> <mrow> <mi>r</mi> <mo>=</mo> <mi>a</mi> <mo>+</mo> <mi>b</mi> </mrow> </semantics></math>.</p>
Full article ">Figure 3
<p><math display="inline"><semantics> <msubsup> <mi mathvariant="sans-serif">Γ</mi> <mrow> <mi>E</mi> <mo>(</mo> <mn>9</mn> <mo>)</mo> </mrow> <mn>0</mn> </msubsup> </semantics></math>: <span class="html-italic">r</span>-noncommuting graph of <math display="inline"><semantics> <mrow> <mi>E</mi> <mo>(</mo> <mn>9</mn> <mo>)</mo> </mrow> </semantics></math> when <math display="inline"><semantics> <mrow> <mi>r</mi> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 4
<p><math display="inline"><semantics> <msubsup> <mi mathvariant="sans-serif">Γ</mi> <mrow> <mi>E</mi> <mo>(</mo> <mn>9</mn> <mo>)</mo> </mrow> <mi>r</mi> </msubsup> </semantics></math>: <span class="html-italic">r</span>-noncommuting graph of <math display="inline"><semantics> <mrow> <mi>E</mi> <mo>(</mo> <mn>9</mn> <mo>)</mo> </mrow> </semantics></math> when <math display="inline"><semantics> <mrow> <mi>r</mi> <mo>=</mo> <mi>a</mi> <mo>+</mo> <mn>2</mn> <mi>b</mi> </mrow> </semantics></math> or <math display="inline"><semantics> <mrow> <mn>2</mn> <mi>a</mi> <mo>+</mo> <mi>b</mi> </mrow> </semantics></math>.</p>
Full article ">
20 pages, 335 KiB  
Article
Two Forms of An Inverse Operator to the Generalized Bessel Potential
by Akhmed Dzhabrailov, Yuri Luchko and Elina Shishkina
Axioms 2021, 10(3), 232; https://doi.org/10.3390/axioms10030232 - 18 Sep 2021
Cited by 6 | Viewed by 1778
Abstract
In this paper, we treat a convolution-type operator called the generalized Bessel potential. Our main result is the derivation of two different forms of its inversion. The first inversion is provided in terms of an approximative inverse operator using the method of an [...] Read more.
In this paper, we treat a convolution-type operator called the generalized Bessel potential. Our main result is the derivation of two different forms of its inversion. The first inversion is provided in terms of an approximative inverse operator using the method of an improving multiplier. The second one employs the regularization technique for the divergent integrals in the form of the appropriate segments of the Taylor–Delsarte series. Full article
5 pages, 229 KiB  
Article
Fixed Point Results for Frum-Ketkov Type Contractions in b-Metric Spaces
by Cristian Chifu, Erdal Karapınar and Gabriela Petrusel
Axioms 2021, 10(3), 231; https://doi.org/10.3390/axioms10030231 - 18 Sep 2021
Cited by 2 | Viewed by 1388
Abstract
The purpose of this paper is to present some fixed point results for Frum-Ketkov type operators in complete b-metric spaces. Full article
(This article belongs to the Special Issue Advances in Nonlinear Analysis and Related Fixed Point Problems)
21 pages, 1181 KiB  
Article
The Approximate and Analytic Solutions of the Time-Fractional Intermediate Diffusion Wave Equation Associated with the Fokker–Planck Operator and Applications
by Entsar A. Abdel-Rehim
Axioms 2021, 10(3), 230; https://doi.org/10.3390/axioms10030230 - 17 Sep 2021
Cited by 4 | Viewed by 1916
Abstract
In this paper, the time-fractional wave equation associated with the space-fractional Fokker–Planck operator and with the time-fractional-damped term is studied. The concept of the Green function is implemented to drive the analytic solution of the three-term time-fractional equation. The explicit expressions for the [...] Read more.
In this paper, the time-fractional wave equation associated with the space-fractional Fokker–Planck operator and with the time-fractional-damped term is studied. The concept of the Green function is implemented to drive the analytic solution of the three-term time-fractional equation. The explicit expressions for the Green function G3(t) of the three-term time-fractional wave equation with constant coefficients is also studied for two physical and biological models. The explicit analytic solutions, for the two studied models, are expressed in terms of the Weber, hypergeometric, exponential, and Mittag–Leffler functions. The relation to the diffusion equation is given. The asymptotic behaviors of the Mittag–Leffler function, the hypergeometric function 1F1, and the exponential functions are compared numerically. The Grünwald–Letnikov scheme is used to derive the approximate difference schemes of the Caputo time-fractional operator and the Feller–Riesz space-fractional operator. The explicit difference scheme is numerically studied, and the simulations of the approximate solutions are plotted for different values of the fractional orders. Full article
(This article belongs to the Special Issue Fractional Calculus - Theory and Applications)
Show Figures

Figure 1

Figure 1
<p>The simulation of the Mittag–Leffler as <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>:</mo> <mn>0</mn> <mo>→</mo> <mn>1</mn> </mrow> </semantics></math>, for different values of <math display="inline"><semantics> <mi>β</mi> </semantics></math>.</p>
Full article ">Figure 2
<p>The simulation of the Mittag–Leffler as <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>:</mo> <mn>0</mn> <mo>→</mo> <mn>10</mn> </mrow> </semantics></math>, for different values of <math display="inline"><semantics> <mi>β</mi> </semantics></math>.</p>
Full article ">Figure 3
<p><math display="inline"><semantics> <mrow> <mrow> <mi>Hypergeometric</mi> <mn>1</mn> <mi mathvariant="normal">F</mi> <mn>1</mn> </mrow> <mo>[</mo> <mn>1</mn> <mo>+</mo> <mi>n</mi> <mo>,</mo> <mn>2</mn> <mo>+</mo> <mi>n</mi> <mo>,</mo> <mo>−</mo> <mi>t</mi> <mo>]</mo> </mrow> </semantics></math>.</p>
Full article ">Figure 4
<p><math display="inline"><semantics> <mrow> <mrow> <mi>Hypergeometric</mi> <mn>1</mn> <mi mathvariant="normal">F</mi> <mn>1</mn> </mrow> <mo>[</mo> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mo>−</mo> <mi>t</mi> <mo>]</mo> </mrow> </semantics></math>.</p>
Full article ">Figure 5
<p><math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>2</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 6
<p><math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>5</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 7
<p><math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>10</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 8
<p><math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>20</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 9
<p><math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>5</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 10
<p><math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>10</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 11
<p><math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>20</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 12
<p><math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>25</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 13
<p><math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>2</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 14
<p><math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>5</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 15
<p><math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>10</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 16
<p><math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>20</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 17
<p><math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>5</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 18
<p><math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>20</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 19
<p><math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>40</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 20
<p><math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>60</mn> </mrow> </semantics></math>.</p>
Full article ">
16 pages, 314 KiB  
Article
Statistical Riemann and Lebesgue Integrable Sequence of Functions with Korovkin-Type Approximation Theorems
by Hari Mohan Srivastava, Bidu Bhusan Jena and Susanta Kumar Paikray
Axioms 2021, 10(3), 229; https://doi.org/10.3390/axioms10030229 - 16 Sep 2021
Cited by 9 | Viewed by 1923
Abstract
In this work we introduce and investigate the ideas of statistical Riemann integrability, statistical Riemann summability, statistical Lebesgue integrability and statistical Lebesgue summability via deferred weighted mean. We first establish some fundamental limit theorems connecting these beautiful and potentially useful notions. Furthermore, based [...] Read more.
In this work we introduce and investigate the ideas of statistical Riemann integrability, statistical Riemann summability, statistical Lebesgue integrability and statistical Lebesgue summability via deferred weighted mean. We first establish some fundamental limit theorems connecting these beautiful and potentially useful notions. Furthermore, based upon our proposed techniques, we establish the Korovkin-type approximation theorems with algebraic test functions. Finally, we present two illustrative examples under the consideration of positive linear operators in association with the Bernstein polynomials to exhibit the effectiveness of our findings. Full article
24 pages, 906 KiB  
Article
Mathematical Modeling and Forecasting of COVID-19 in Saudi Arabia under Fractal-Fractional Derivative in Caputo Sense with Power-Law
by Mdi Begum Jeelani, Abeer S. Alnahdi, Mohammed S. Abdo, Mansour A. Abdulwasaa, Kamal Shah and Hanan A. Wahash
Axioms 2021, 10(3), 228; https://doi.org/10.3390/axioms10030228 - 15 Sep 2021
Cited by 19 | Viewed by 2725
Abstract
This manuscript is devoted to investigating a fractional-order mathematical model of COVID-19. The corresponding derivative is taken in Caputo sense with power-law of fractional order μ and fractal dimension χ. We give some detailed analysis on the existence and uniqueness of the [...] Read more.
This manuscript is devoted to investigating a fractional-order mathematical model of COVID-19. The corresponding derivative is taken in Caputo sense with power-law of fractional order μ and fractal dimension χ. We give some detailed analysis on the existence and uniqueness of the solution to the proposed problem. Furthermore, some results regarding basic reproduction number and stability are given. For the proposed theoretical analysis, we use fixed point theory while for numerical analysis fractional Adams–Bashforth iterative techniques are utilized. Using our numerical scheme is verified by using some real values of the parameters to plot the approximate solution to the considered model. Graphical presentations corresponding to different values of fractional order and fractal dimensions are given. Moreover, we provide some information regarding the real data of Saudi Arabia from 1 March 2020 till 22 April 2021, then calculated the fatality rates by utilizing the SPSS, Eviews and Expert Modeler procedure. We also built forecasts of infection for the period 23 April 2021 to 30 May 2021, with 95% confidence. Full article
Show Figures

Figure 1

Figure 1
<p>Transmission of confirmed infected cases of COVID-19 in Saudi Arabia for the period from 1 March 2020 to 22 April 2021.</p>
Full article ">Figure 2
<p>Death cases of COVID-19 in Saudi Arabia for the period from 1 March 2020 to 22 April 2021.</p>
Full article ">Figure 3
<p>Total confirmed infected cases of COVID-19 in Saudi Arabia for the period from March 2020 to 22 April 2021.</p>
Full article ">Figure 4
<p>The total number of deaths of COVID-19 in Saudi Arabia for the period from March 2020 to 22 April 2021.</p>
Full article ">Figure 5
<p>Transmission of the data of confirmed cases of COVID-19 in Saudi Arabia to the first difference.</p>
Full article ">Figure 6
<p>Transmission of the death cases of COVID-19 in Saudi Arabia to the first difference.</p>
Full article ">Figure 7
<p>Predicting daily COVID-19 confirmed cases with 95% confidence intervals (CIs) in Saudi Arabia for the period from 23 April 2021 to 31 May 2021.</p>
Full article ">Figure 8
<p>Predicting daily COVID-19 deaths with 95% confidence intervals (CIs) in Saudi Arabia for the period from 23 April 2021 to 31 May 2020.</p>
Full article ">Figure 9
<p>Graphs of numerical solutions at different fractal-fractional order for Susceptible class.</p>
Full article ">Figure 10
<p>Graphs of numerical solutions at different fractal-fractional order for Exposed class.</p>
Full article ">Figure 11
<p>Graphs of numerical solutions at different fractal-fractional order for Infected class.</p>
Full article ">Figure 12
<p>Graphs of numerical solutions at different fractal-fractional order for Asymptomatic class.</p>
Full article ">Figure 13
<p>Graphs of numerical solutions at different fractal-fractional order for Recovered class.</p>
Full article ">Figure 14
<p>Graphs of numerical solutions at different fractal-fractional order for class <span class="html-italic">M</span>.</p>
Full article ">Figure 15
<p>Comparison between real and simulated data for infected class in the considered model.</p>
Full article ">Figure 16
<p>Comparison between real and simulated data for deaths class in the considered model.</p>
Full article ">
18 pages, 2540 KiB  
Article
Chaotic Dynamics by Some Quadratic Jerk Systems
by Mei Liu, Bo Sang, Ning Wang and Irfan Ahmad
Axioms 2021, 10(3), 227; https://doi.org/10.3390/axioms10030227 - 14 Sep 2021
Cited by 15 | Viewed by 2640
Abstract
This paper is about the dynamical evolution of a family of chaotic jerk systems, which have different attractors for varying values of parameter a. By using Hopf bifurcation analysis, bifurcation diagrams, Lyapunov exponents, and cross sections, both self-excited and hidden attractors are [...] Read more.
This paper is about the dynamical evolution of a family of chaotic jerk systems, which have different attractors for varying values of parameter a. By using Hopf bifurcation analysis, bifurcation diagrams, Lyapunov exponents, and cross sections, both self-excited and hidden attractors are explored. The self-exited chaotic attractors are found via a supercritical Hopf bifurcation and period-doubling cascades to chaos. The hidden chaotic attractors (related to a subcritical Hopf bifurcation, and with a unique stable equilibrium) are also found via period-doubling cascades to chaos. A circuit implementation is presented for the hidden chaotic attractor. The methods used in this paper will help understand and predict the chaotic dynamics of quadratic jerk systems. Full article
Show Figures

Figure 1

Figure 1
<p>The curve <math display="inline"><semantics> <mrow> <mi>k</mi> <mo>=</mo> <mi>k</mi> <mo>(</mo> <mi>a</mi> <mo>)</mo> </mrow> </semantics></math> with <math display="inline"><semantics> <mrow> <mi>a</mi> <mo>∈</mo> <mo>(</mo> <mn>0</mn> <mo>,</mo> <mo>∞</mo> <mo>)</mo> </mrow> </semantics></math>.</p>
Full article ">Figure 2
<p>(<b>a</b>) Bifurcation diagram, and (<b>b</b>) Lyapunov exponents spectrum versus <span class="html-italic">a</span> of system (<a href="#FD16-axioms-10-00227" class="html-disp-formula">16</a>).</p>
Full article ">Figure 3
<p>Self-excited chaotic attractor (in blue) of system (<a href="#FD16-axioms-10-00227" class="html-disp-formula">16</a>) with <math display="inline"><semantics> <mrow> <mi>a</mi> <mo>=</mo> <mn>2</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>α</mi> <mo>=</mo> <mn>0.3</mn> </mrow> </semantics></math> for the initial condition <math display="inline"><semantics> <mrow> <mo>(</mo> <mn>0.1</mn> <mo>,</mo> <mn>0.1</mn> <mo>,</mo> <mn>0.1</mn> <mo>)</mo> </mrow> </semantics></math>.</p>
Full article ">Figure 4
<p>Cross sections of the basin of attraction of the chaotic attractor in the planes: <math display="inline"><semantics> <mrow> <mi>z</mi> <mo>(</mo> <mn>0</mn> <mo>)</mo> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math> (<b>left</b>); <math display="inline"><semantics> <mrow> <mi>y</mi> <mo>(</mo> <mn>0</mn> <mo>)</mo> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math> (<b>center</b>); <math display="inline"><semantics> <mrow> <mi>x</mi> <mo>(</mo> <mn>0</mn> <mo>)</mo> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math> (<b>right</b>). Initial conditions in the white regions lead to unbounded orbits, and those in the red regions lead to the chaotic attractor.</p>
Full article ">Figure 5
<p>(<b>a</b>) Bifurcation diagram, and (<b>b</b>) Lyapunov exponents spectrum versus <span class="html-italic">a</span> of system (<a href="#FD25-axioms-10-00227" class="html-disp-formula">25</a>).</p>
Full article ">Figure 6
<p>(<b>a</b>) Bifurcation diagram, and (<b>b</b>) Lyapunov exponents spectrum versus <span class="html-italic">a</span> of system (<a href="#FD26-axioms-10-00227" class="html-disp-formula">26</a>).</p>
Full article ">Figure 7
<p>(<b>a</b>) Bifurcation diagram, and (<b>b</b>) Lyapunov exponents spectrum versus <span class="html-italic">a</span> of system (<a href="#FD27-axioms-10-00227" class="html-disp-formula">27</a>).</p>
Full article ">Figure 8
<p>A 3D view of the hidden chaotic attractor (in blue) and point attractor (in red) of system (<a href="#FD28-axioms-10-00227" class="html-disp-formula">28</a>) and its various projections. Initial condition that realizes the hidden hidden chaotic attractor: <math display="inline"><semantics> <mrow> <mo>(</mo> <mi>x</mi> <mo>(</mo> <mn>0</mn> <mo>)</mo> <mo>,</mo> <mi>y</mi> <mo>(</mo> <mn>0</mn> <mo>)</mo> <mo>,</mo> <mi>z</mi> <mo>(</mo> <mn>0</mn> <mo>)</mo> <mo>)</mo> <mo>=</mo> <mo>(</mo> <mn>0</mn> <mo>,</mo> <mo>−</mo> <mn>1.5</mn> <mo>,</mo> <mn>0</mn> <mo>)</mo> </mrow> </semantics></math>.</p>
Full article ">Figure 9
<p>Cross sections of the basins of attraction of the two coexisting attractors in the coordinate planes: <math display="inline"><semantics> <mrow> <mi>z</mi> <mo>(</mo> <mn>0</mn> <mo>)</mo> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math> (<b>left</b>); <math display="inline"><semantics> <mrow> <mi>y</mi> <mo>(</mo> <mn>0</mn> <mo>)</mo> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math> (<b>center</b>); <math display="inline"><semantics> <mrow> <mi>x</mi> <mo>(</mo> <mn>0</mn> <mo>)</mo> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math> (<b>right</b>). Initial conditions in the white regions lead to unbounded orbits, those in the red regions lead to the hidden chaotic attractor, and those in the purple regions lead to the stable equilibrium located at the origin.</p>
Full article ">Figure 10
<p>Circuital implementation of the hidden chaotic system (<a href="#FD28-axioms-10-00227" class="html-disp-formula">28</a>) with a stable equilibrium at the origin.</p>
Full article ">Figure 11
<p>Hidden chaotic attractor of system (<a href="#FD29-axioms-10-00227" class="html-disp-formula">29</a>): (<b>a</b>) X-Y projection of the attractor, (<b>b</b>) X-Z projection of the attractor, and (<b>c</b>) Y-Z projection.</p>
Full article ">
13 pages, 287 KiB  
Article
Closed-Form Solutions of Linear Ordinary Differential Equations with General Boundary Conditions
by Efthimios Providas, Stefanos Zaoutsos and Ioannis Faraslis
Axioms 2021, 10(3), 226; https://doi.org/10.3390/axioms10030226 - 14 Sep 2021
Cited by 1 | Viewed by 1964
Abstract
This paper deals with the solution of boundary value problems for ordinary differential equations with general boundary conditions. We obtain closed-form solutions in a symbolic form of problems with the general n-th order differential operator, as well as the composition of linear [...] Read more.
This paper deals with the solution of boundary value problems for ordinary differential equations with general boundary conditions. We obtain closed-form solutions in a symbolic form of problems with the general n-th order differential operator, as well as the composition of linear operators. The method is based on the theory of the extensions of linear operators in Banach spaces. Full article
(This article belongs to the Special Issue Modern Problems of Mathematical Physics and Their Applications)
11 pages, 253 KiB  
Article
An Expository Lecture of María Jesús Chasco on Some Applications of Fubini’s Theorem
by Alberto Castejón, María Jesús Chasco, Eusebio Corbacho and Virgilio Rodríguez de Miguel
Axioms 2021, 10(3), 225; https://doi.org/10.3390/axioms10030225 - 14 Sep 2021
Viewed by 1671
Abstract
The usefulness of Fubini’s theorem as a measurement instrument is clearly understood from its multiple applications in Analysis, Convex Geometry, Statistics or Number Theory. This article is an expository paper based on a master class given by the second author at the University [...] Read more.
The usefulness of Fubini’s theorem as a measurement instrument is clearly understood from its multiple applications in Analysis, Convex Geometry, Statistics or Number Theory. This article is an expository paper based on a master class given by the second author at the University of Vigo and is devoted to presenting some Applications of Fubini’s theorem. In the first part, we present Brunn–Minkowski’s and Isoperimetric inequalities. The second part is devoted to the estimations of volumes of sections of balls in Rn. Full article
23 pages, 5686 KiB  
Article
Error Compensation of Strapdown Inertial Navigation System for the Boom-Type Roadheader under Complex Vibration
by Yang Shen, Pengjiang Wang, Weixiong Zheng, Xiaodong Ji, Hai Jiang and Miao Wu
Axioms 2021, 10(3), 224; https://doi.org/10.3390/axioms10030224 - 14 Sep 2021
Cited by 9 | Viewed by 2765
Abstract
The strapdown inertial navigation system can provide the navigation information for the boom-type roadheader in the unmanned roadway tunneling working face of the coal mine. However, the complex vibration caused by the cutting process of the boom-type roadheader may result in significant errors [...] Read more.
The strapdown inertial navigation system can provide the navigation information for the boom-type roadheader in the unmanned roadway tunneling working face of the coal mine. However, the complex vibration caused by the cutting process of the boom-type roadheader may result in significant errors of its attitude and position measured by the strapdown inertial navigation system. Thus, an error compensation method based on the vibration characteristics of the roadheader is proposed in this paper. In order to further analyze the angular and linear vibration of the fuselage, as the main vibration sources of the roadheader, the dynamic model of the roadheader is formulated based on the cutting load. Following that, multiple sub-samples compensation algorithms for the coning and sculling errors are constructed. Simulation experiments were carried out under different subsample compensation algorithms, different coal and rock characteristics, and different types of roadheader. The experimental results show that the proposed error compensation algorithm can eliminate the effect of the angular and linear vibration on the measurement accuracy. The coning and sculling error of the strapdown inertial navigation system can reduce at least 52.21% and 42.89%, respectively. Finally, a strapdown inertial navigation error compensation accuracy experiment system is built, and the validity and superiority of the method proposed in this paper are verified through calculation and analysis of the data collected on the actual tunneling work face. Full article
Show Figures

Figure 1

Figure 1
<p>Schematic diagram for the roadheader (1—cutting head; 2—cutting arm; 3—coal wall; 4—walking mechanism; 5—SINS; 6—fuselage).</p>
Full article ">Figure 2
<p>Force analysis diagram of the roadheader.</p>
Full article ">Figure 3
<p>The cutting path of the cutting head.</p>
Full article ">Figure 4
<p>Force analysis diagram of cutting head.</p>
Full article ">Figure 5
<p>Mechanical model of roadheader. (<b>a</b>) Z-direction; (<b>b</b>) X-direction; (<b>c</b>) Y-direction.</p>
Full article ">Figure 6
<p>The curve of linear vibration of roadheader fuselage.</p>
Full article ">Figure 7
<p>The curve of line angular of roadheader.</p>
Full article ">Figure 8
<p>The coning error curve of SINS with the compensation algorithm of one-subsample (OS), three-subsample(TS), and four-subsample (FS): (<b>a</b>) the error curve in X-direction, (<b>b</b>) the error curve in Y-direction, (<b>c</b>) the error curve in Z-direction.</p>
Full article ">Figure 8 Cont.
<p>The coning error curve of SINS with the compensation algorithm of one-subsample (OS), three-subsample(TS), and four-subsample (FS): (<b>a</b>) the error curve in X-direction, (<b>b</b>) the error curve in Y-direction, (<b>c</b>) the error curve in Z-direction.</p>
Full article ">Figure 9
<p>The sculling error curve of SINS with the compensation algorithm of one-subsample(OS), three-subsample(TS), and four-subsample (FS): (<b>a</b>) the error curve in X-direction, (<b>b</b>) the error curve in Y-direction, (<b>c</b>) the error curve in Z-direction.</p>
Full article ">Figure 10
<p>The coning error statistics using three-subsample (TS) compensation algorithm and four-subsample (FS) compensation algorithm under different coal and rock characteristics.</p>
Full article ">Figure 11
<p>The sculling error statistics using three-subsample (TS) compensation algorithm and four-subsample (FS) compensation algorithm under different coal and rock characteristics.</p>
Full article ">Figure 12
<p>The coning error statistics using three-subsample (TS) compensation algorithm and four-subsample (FS) compensation algorithm under different types of roadheaders.</p>
Full article ">Figure 13
<p>The sculling error statistics using three-subsample (TS) compensation algorithm and four-subsample (FS) compensation algorithm under different types of roadheaders.</p>
Full article ">Figure 14
<p>The diagram of experimental system composition.</p>
Full article ">Figure 15
<p>The coning error of SINS in X, Y, and Z directions.</p>
Full article ">Figure 16
<p>The sculling error of SINS in X, Y, and Z directions.</p>
Full article ">
13 pages, 278 KiB  
Article
On New Generalizations of Hermite-Hadamard Type Inequalities via Atangana-Baleanu Fractional Integral Operators
by Erhan Set, Ahmet Ocak Akdemir, Ali Karaoǧlan, Thabet Abdeljawad and Wasfi Shatanawi
Axioms 2021, 10(3), 223; https://doi.org/10.3390/axioms10030223 - 12 Sep 2021
Cited by 7 | Viewed by 1864
Abstract
Fractional operators are one of the frequently used tools to obtain new generalizations of clasical inequalities in recent years and many new fractional operators are defined in the literature. This development in the field of fractional analysis has led to a new orientation [...] Read more.
Fractional operators are one of the frequently used tools to obtain new generalizations of clasical inequalities in recent years and many new fractional operators are defined in the literature. This development in the field of fractional analysis has led to a new orientation in various branches of mathematics and in many of the applied sciences. Thanks to this orientation, it has brought a whole new dimension to the field of inequality theory as well as many other disciplines. In this study, a new lemma has been proved for the fractional integral operator defined by Atangana and Baleanu. Later with the help of this lemma and known inequalities such as Young, Jensen, Hölder, new generalizations of Hermite-Hadamard inequality are obtained. Many reduced corollaries about the main findings are presented for classical integrals. Full article
(This article belongs to the Special Issue Differential Equations: Theories, Methods and Modern Applications)
12 pages, 315 KiB  
Article
Periodic Third-Order Problems with a Parameter
by Feliz Minhós and Nuno Oliveira
Axioms 2021, 10(3), 222; https://doi.org/10.3390/axioms10030222 - 11 Sep 2021
Cited by 3 | Viewed by 1926
Abstract
This work concerns with the solvability of third-order periodic fully problems with a weighted parameter, where the nonlinearity must verify only a local monotone condition and no periodic, coercivity or super or sublinearity restrictions are assumed, as usual in the literature. The arguments [...] Read more.
This work concerns with the solvability of third-order periodic fully problems with a weighted parameter, where the nonlinearity must verify only a local monotone condition and no periodic, coercivity or super or sublinearity restrictions are assumed, as usual in the literature. The arguments are based on a new type of lower and upper solutions method, not necessarily well ordered. A Nagumo growth condition and Leray–Schauder’s topological degree theory are the existence tools. Only the existence of solution is studied here and it will remain open the discussion on the non-existence and the multiplicity of solutions. Last section contains a nonlinear third-order differential model for periodic catatonic phenomena, depending on biological and/or chemical parameters. Full article
Show Figures

Figure 1

Figure 1
<p>Thyroid-pituitary interaction.</p>
Full article ">Figure 2
<p>Variation of <math display="inline"><semantics> <mrow> <msub> <mi>θ</mi> <mn>0</mn> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </semantics></math>.</p>
Full article ">Figure 3
<p>Variation of <math display="inline"><semantics> <mrow> <msubsup> <mi>θ</mi> <mrow> <mn>0</mn> </mrow> <mo>′</mo> </msubsup> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </semantics></math>.</p>
Full article ">
5 pages, 216 KiB  
Article
Strictly Convex Banach Algebras
by David Yost
Axioms 2021, 10(3), 221; https://doi.org/10.3390/axioms10030221 - 11 Sep 2021
Viewed by 2198
Abstract
We discuss two facets of the interaction between geometry and algebra in Banach algebras. In the class of unital Banach algebras, there is essentially one known example which is also strictly convex as a Banach space. We recall this example, which is finite-dimensional, [...] Read more.
We discuss two facets of the interaction between geometry and algebra in Banach algebras. In the class of unital Banach algebras, there is essentially one known example which is also strictly convex as a Banach space. We recall this example, which is finite-dimensional, and consider the open question of generalising it to infinite dimensions. In C-algebras, we exhibit one striking example of the tighter relationship that exists between algebra and geometry there. Full article
(This article belongs to the Collection Topological Groups)
9 pages, 246 KiB  
Article
Inequalities on General Lp-Mixed Chord Integral Difference
by Hongying Xiao, Weidong Wang and Zhaofeng Li
Axioms 2021, 10(3), 220; https://doi.org/10.3390/axioms10030220 - 10 Sep 2021
Viewed by 1472
Abstract
In this article, we introduce the concept of general Lp-mixed chord integral difference of star bodies. Further, we establish the Brunn–Minkowski type, Aleksandrov–Fenchel type and cyclic inequalities for the Lp-mixed chord integral difference. Full article
16 pages, 1881 KiB  
Article
A Family of the r-Associated Stirling Numbers of the Second Kind and Generalized Bernoulli Polynomials
by Paolo Emilio Ricci, Rekha Srivastava and Pierpaolo Natalini
Axioms 2021, 10(3), 219; https://doi.org/10.3390/axioms10030219 - 9 Sep 2021
Cited by 5 | Viewed by 2938
Abstract
In this article, we derive representation formulas for a class of r-associated Stirling numbers of the second kind and examine their connections with a class of generalized Bernoulli polynomials. Herein, we use the Blissard umbral approach and the familiar Bell polynomials. Links [...] Read more.
In this article, we derive representation formulas for a class of r-associated Stirling numbers of the second kind and examine their connections with a class of generalized Bernoulli polynomials. Herein, we use the Blissard umbral approach and the familiar Bell polynomials. Links with available literature on this subject are also pointed out. The extension to the bivariate case is discussed. Full article
(This article belongs to the Collection Mathematical Analysis and Applications)
Show Figures

Figure 1

Figure 1
<p><span class="html-italic">Numbers</span><math display="inline"> <semantics> <mrow> <mspace width="0.277778em"/> <msubsup> <mi>B</mi> <mi>n</mi> <mrow> <mo>[</mo> <mn>1</mn> <mo>,</mo> <mi>k</mi> <mo>]</mo> </mrow> </msubsup> <mo>;</mo> <mi>k</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mn>3</mn> <mo>,</mo> <mn>4</mn> <mo>;</mo> <mspace width="0.166667em"/> <mi>n</mi> <mo>=</mo> <mn>0</mn> <mo>,</mo> <mn>1</mn> <mo>,</mo> <mo>…</mo> <mo>,</mo> <mn>10</mn> <mo>.</mo> </mrow> </semantics> </math></p>
Full article ">Figure 2
<p><span class="html-italic">Numbers</span><math display="inline"> <semantics> <mrow> <mspace width="0.277778em"/> <msubsup> <mi>B</mi> <mi>n</mi> <mrow> <mo>[</mo> <mn>2</mn> <mo>,</mo> <mi>k</mi> <mo>]</mo> </mrow> </msubsup> <mo>;</mo> <mi>k</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mn>3</mn> <mo>,</mo> <mn>4</mn> <mo>;</mo> <mspace width="0.166667em"/> <mi>n</mi> <mo>=</mo> <mn>0</mn> <mo>,</mo> <mn>1</mn> <mo>,</mo> <mo>…</mo> <mo>,</mo> <mn>10</mn> <mo>.</mo> </mrow> </semantics> </math></p>
Full article ">Figure 3
<p><span class="html-italic">Numbers</span><math display="inline"> <semantics> <mrow> <mspace width="0.277778em"/> <msubsup> <mi>B</mi> <mi>n</mi> <mrow> <mo>[</mo> <mn>3</mn> <mo>,</mo> <mi>k</mi> <mo>]</mo> </mrow> </msubsup> <mo>;</mo> <mi>k</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mn>3</mn> <mo>,</mo> <mn>4</mn> <mo>;</mo> <mspace width="0.166667em"/> <mi>n</mi> <mo>=</mo> <mn>0</mn> <mo>,</mo> <mn>1</mn> <mo>,</mo> <mo>…</mo> <mo>,</mo> <mn>10</mn> <mo>.</mo> </mrow> </semantics> </math></p>
Full article ">Figure 4
<p><span class="html-italic">Numbers</span><math display="inline"> <semantics> <mrow> <mspace width="0.277778em"/> <msubsup> <mi>B</mi> <mi>n</mi> <mrow> <mo>[</mo> <mn>4</mn> <mo>,</mo> <mi>k</mi> <mo>]</mo> </mrow> </msubsup> <mo>;</mo> <mi>k</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mn>3</mn> <mo>,</mo> <mn>4</mn> <mo>;</mo> <mspace width="0.166667em"/> <mi>n</mi> <mo>=</mo> <mn>0</mn> <mo>,</mo> <mn>1</mn> <mo>,</mo> <mo>…</mo> <mo>,</mo> <mn>10</mn> <mo>.</mo> </mrow> </semantics> </math></p>
Full article ">Figure 5
<p><span class="html-italic">Numbers</span><math display="inline"> <semantics> <mrow> <mi>S</mi> <mo>(</mo> <mi>n</mi> <mo>+</mo> <mn>2</mn> <mi>k</mi> <mo>,</mo> <mi>k</mi> <mo>;</mo> <mn>2</mn> <mo>)</mo> <mo>,</mo> <mspace width="0.166667em"/> <mi>k</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mn>3</mn> <mo>,</mo> <mn>4</mn> <mo>;</mo> <mspace width="0.166667em"/> <mi>n</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mo>…</mo> <mo>,</mo> <mn>10</mn> <mo>.</mo> </mrow> </semantics> </math></p>
Full article ">Figure 6
<p><span class="html-italic">Numbers</span><math display="inline"> <semantics> <mrow> <mi>S</mi> <mo>(</mo> <mi>n</mi> <mo>+</mo> <mn>3</mn> <mi>k</mi> <mo>,</mo> <mi>k</mi> <mo>;</mo> <mn>3</mn> <mo>)</mo> <mo>,</mo> <mspace width="0.166667em"/> <mi>k</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mn>3</mn> <mo>,</mo> <mn>4</mn> <mo>;</mo> <mspace width="0.166667em"/> <mi>n</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mo>…</mo> <mo>,</mo> <mn>10</mn> <mo>.</mo> </mrow> </semantics> </math></p>
Full article ">Figure 7
<p><span class="html-italic">Numbers</span><math display="inline"> <semantics> <mrow> <mi>S</mi> <mo>(</mo> <mi>n</mi> <mo>+</mo> <mn>4</mn> <mi>k</mi> <mo>,</mo> <mi>k</mi> <mo>;</mo> <mn>4</mn> <mo>)</mo> <mo>,</mo> <mspace width="0.166667em"/> <mi>k</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mn>3</mn> <mo>,</mo> <mn>4</mn> <mo>;</mo> <mspace width="0.166667em"/> <mi>n</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mo>…</mo> <mo>,</mo> <mn>10</mn> <mo>.</mo> </mrow> </semantics> </math></p>
Full article ">Figure 8
<p><span class="html-italic">Numbers</span><math display="inline"> <semantics> <mrow> <mi>S</mi> <mo>(</mo> <mi>n</mi> <mo>+</mo> <mn>5</mn> <mi>k</mi> <mo>,</mo> <mi>k</mi> <mo>;</mo> <mn>5</mn> <mo>)</mo> <mo>,</mo> <mspace width="0.166667em"/> <mi>k</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mn>3</mn> <mo>,</mo> <mn>4</mn> <mo>;</mo> <mspace width="0.166667em"/> <mi>n</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mo>…</mo> <mo>,</mo> <mn>10</mn> <mo>.</mo> </mrow> </semantics> </math></p>
Full article ">
12 pages, 326 KiB  
Article
Calculations on Matrix Transformations Involving an Infinite Tridiagonal Matrix
by Ali Fares, Ali Ayad and Bruno de Malafosse
Axioms 2021, 10(3), 218; https://doi.org/10.3390/axioms10030218 - 8 Sep 2021
Viewed by 1641
Abstract
Given any sequence z=znn1 of positive real numbers and any set E of complex sequences, we write Ez for the set of all sequences y=ynn1 such that [...] Read more.
Given any sequence z=znn1 of positive real numbers and any set E of complex sequences, we write Ez for the set of all sequences y=ynn1 such that y/z=yn/znn1E; in particular, sz0 denotes the set of all sequences y such that y/z tends to zero. Here, we consider the infinite tridiagonal matrix Br,s,t˜, obtained from the triangle Br,s,t, by deleting its first row. Then we determine the sets of all positive sequences a=ann1 such that EaBr,s,t˜Ea, where E=, c0, or c. These results extend some recent results. Full article
(This article belongs to the Special Issue Operator Theory and Its Applications)
6 pages, 243 KiB  
Article
Normed Spaces Which Are Not Mackey Groups
by Saak Gabriyelyan
Axioms 2021, 10(3), 217; https://doi.org/10.3390/axioms10030217 - 8 Sep 2021
Cited by 2 | Viewed by 1401
Abstract
It is well known that every normed (even quasibarrelled) space is a Mackey space. However, in the more general realm of locally quasi-convex abelian groups an analogous result does not hold. We give the first examples of normed spaces which are not Mackey [...] Read more.
It is well known that every normed (even quasibarrelled) space is a Mackey space. However, in the more general realm of locally quasi-convex abelian groups an analogous result does not hold. We give the first examples of normed spaces which are not Mackey groups. Full article
23 pages, 2374 KiB  
Article
A Dynamic Model of Multiple Time-Delay Interactions between the Virus-Infected Cells and Body’s Immune System with Autoimmune Diseases
by Hoang Pham
Axioms 2021, 10(3), 216; https://doi.org/10.3390/axioms10030216 - 7 Sep 2021
Cited by 6 | Viewed by 2179
Abstract
The immune system is a complex interconnected network consisting of many parts including organs, tissues, cells, molecules and proteins that work together to protect the body from illness when germs enter the body. An autoimmune disease is a disease in which the body’s [...] Read more.
The immune system is a complex interconnected network consisting of many parts including organs, tissues, cells, molecules and proteins that work together to protect the body from illness when germs enter the body. An autoimmune disease is a disease in which the body’s immune system attacks healthy cells. It is known that when the immune system is working properly, it can clearly recognize and kill the abnormal cells and virus-infected cells. But when it doesn’t work properly, the human body will not be able to recognize the virus-infected cells and, therefore, it can attack the body’s healthy cells when there is no invader or does not stop an attack after the invader has been killed, resulting in autoimmune disease.; This paper presents a mathematical modeling of the virus-infected development in the body’s immune system considering the multiple time-delay interactions between the immune cells and virus-infected cells with autoimmune disease. The proposed model aims to determine the dynamic progression of virus-infected cell growth in the immune system. The patterns of how the virus-infected cells spread and the development of the body’s immune cells with respect to time delays will be derived in the form of a system of delay partial differential equations. The model can be used to determine whether the virus-infected free state can be reached or not as time progresses. It also can be used to predict the number of the body’s immune cells at any given time. Several numerical examples are discussed to illustrate the proposed model. The model can provide a real understanding of the transmission dynamics and other significant factors of the virus-infected disease and the body’s immune system subject to the time delay, including approaches to reduce the growth rate of virus-infected cell and the autoimmune disease as well as to enhance the immune effector cells. Full article
(This article belongs to the Special Issue Modern Problems of Mathematical Physics and Their Applications)
Show Figures

Figure 1

Figure 1
<p>(<b>a</b>,<b>b</b>): The immune-effector cells (<b>a</b>) and virus-infected cells (<b>b</b>) vs. time (days), (note: (<b>a</b>) is on the left; (<b>b</b>) is on the right); (<b>c</b>,<b>d</b>): The relationship between the immune-effector cells and virus-infected cells.; (<b>e</b>,<b>f</b>): 3-D relationships of the effector cells, immune-effector cells and unit of time (days); (<b>g</b>,<b>h</b>): The immune-effector cells (<b>g</b>) and virus-infected cells (<b>h</b>) vs. time (days). The same as Case 1, except I<sub>0</sub> = 75,000 cellsvs. time (days); (<b>i</b>,<b>j</b>): The immune-effector cells (<b>i</b>) and virus-infected cells (<b>j</b>) vs. time (days). The same as Case 1, except V<sub>0</sub> = 15,000 cells; (<b>k</b>,<b>l</b>): The immune-effector cells (<b>k</b>) and virus-infected cells (<b>l</b>) vs. time (days). The same as Case 1, except V<sub>0</sub> = 15,000 cells and I<sub>0</sub> = 75,000 cells; (<b>m</b>): The immune-effector cells vs. time (days); (<b>n</b>): The virus-infected cells vs. time (days).</p>
Full article ">Figure 1 Cont.
<p>(<b>a</b>,<b>b</b>): The immune-effector cells (<b>a</b>) and virus-infected cells (<b>b</b>) vs. time (days), (note: (<b>a</b>) is on the left; (<b>b</b>) is on the right); (<b>c</b>,<b>d</b>): The relationship between the immune-effector cells and virus-infected cells.; (<b>e</b>,<b>f</b>): 3-D relationships of the effector cells, immune-effector cells and unit of time (days); (<b>g</b>,<b>h</b>): The immune-effector cells (<b>g</b>) and virus-infected cells (<b>h</b>) vs. time (days). The same as Case 1, except I<sub>0</sub> = 75,000 cellsvs. time (days); (<b>i</b>,<b>j</b>): The immune-effector cells (<b>i</b>) and virus-infected cells (<b>j</b>) vs. time (days). The same as Case 1, except V<sub>0</sub> = 15,000 cells; (<b>k</b>,<b>l</b>): The immune-effector cells (<b>k</b>) and virus-infected cells (<b>l</b>) vs. time (days). The same as Case 1, except V<sub>0</sub> = 15,000 cells and I<sub>0</sub> = 75,000 cells; (<b>m</b>): The immune-effector cells vs. time (days); (<b>n</b>): The virus-infected cells vs. time (days).</p>
Full article ">Figure 1 Cont.
<p>(<b>a</b>,<b>b</b>): The immune-effector cells (<b>a</b>) and virus-infected cells (<b>b</b>) vs. time (days), (note: (<b>a</b>) is on the left; (<b>b</b>) is on the right); (<b>c</b>,<b>d</b>): The relationship between the immune-effector cells and virus-infected cells.; (<b>e</b>,<b>f</b>): 3-D relationships of the effector cells, immune-effector cells and unit of time (days); (<b>g</b>,<b>h</b>): The immune-effector cells (<b>g</b>) and virus-infected cells (<b>h</b>) vs. time (days). The same as Case 1, except I<sub>0</sub> = 75,000 cellsvs. time (days); (<b>i</b>,<b>j</b>): The immune-effector cells (<b>i</b>) and virus-infected cells (<b>j</b>) vs. time (days). The same as Case 1, except V<sub>0</sub> = 15,000 cells; (<b>k</b>,<b>l</b>): The immune-effector cells (<b>k</b>) and virus-infected cells (<b>l</b>) vs. time (days). The same as Case 1, except V<sub>0</sub> = 15,000 cells and I<sub>0</sub> = 75,000 cells; (<b>m</b>): The immune-effector cells vs. time (days); (<b>n</b>): The virus-infected cells vs. time (days).</p>
Full article ">Figure 1 Cont.
<p>(<b>a</b>,<b>b</b>): The immune-effector cells (<b>a</b>) and virus-infected cells (<b>b</b>) vs. time (days), (note: (<b>a</b>) is on the left; (<b>b</b>) is on the right); (<b>c</b>,<b>d</b>): The relationship between the immune-effector cells and virus-infected cells.; (<b>e</b>,<b>f</b>): 3-D relationships of the effector cells, immune-effector cells and unit of time (days); (<b>g</b>,<b>h</b>): The immune-effector cells (<b>g</b>) and virus-infected cells (<b>h</b>) vs. time (days). The same as Case 1, except I<sub>0</sub> = 75,000 cellsvs. time (days); (<b>i</b>,<b>j</b>): The immune-effector cells (<b>i</b>) and virus-infected cells (<b>j</b>) vs. time (days). The same as Case 1, except V<sub>0</sub> = 15,000 cells; (<b>k</b>,<b>l</b>): The immune-effector cells (<b>k</b>) and virus-infected cells (<b>l</b>) vs. time (days). The same as Case 1, except V<sub>0</sub> = 15,000 cells and I<sub>0</sub> = 75,000 cells; (<b>m</b>): The immune-effector cells vs. time (days); (<b>n</b>): The virus-infected cells vs. time (days).</p>
Full article ">Figure 2
<p>(<b>a</b>,<b>b</b>): The immune-effector cells (<b>a</b>) and virus-infected cells (<b>b</b>) vs. time (days); (<b>c</b>,<b>d</b>): The relationship between the immune-effector cells and virus-infected cells; (<b>e</b>,<b>f</b>): 3D relationships of the effector cells, immune-effector cells and unit of time (days); (<b>g</b>,<b>h</b>): The immune-effector cells (<b>g</b>) and virus-infected cells (<b>h</b>) vs. time (days). The same as Case 2, except I<sub>0</sub> = 75,000 cells; (<b>i</b>,<b>j</b>): The immune-effector cells (<b>i</b>) and virus-infected cells (<b>j</b>) vs. time (days). The same as Case 2, except V<sub>0</sub> = 15,000 cells.</p>
Full article ">Figure 2 Cont.
<p>(<b>a</b>,<b>b</b>): The immune-effector cells (<b>a</b>) and virus-infected cells (<b>b</b>) vs. time (days); (<b>c</b>,<b>d</b>): The relationship between the immune-effector cells and virus-infected cells; (<b>e</b>,<b>f</b>): 3D relationships of the effector cells, immune-effector cells and unit of time (days); (<b>g</b>,<b>h</b>): The immune-effector cells (<b>g</b>) and virus-infected cells (<b>h</b>) vs. time (days). The same as Case 2, except I<sub>0</sub> = 75,000 cells; (<b>i</b>,<b>j</b>): The immune-effector cells (<b>i</b>) and virus-infected cells (<b>j</b>) vs. time (days). The same as Case 2, except V<sub>0</sub> = 15,000 cells.</p>
Full article ">Figure 2 Cont.
<p>(<b>a</b>,<b>b</b>): The immune-effector cells (<b>a</b>) and virus-infected cells (<b>b</b>) vs. time (days); (<b>c</b>,<b>d</b>): The relationship between the immune-effector cells and virus-infected cells; (<b>e</b>,<b>f</b>): 3D relationships of the effector cells, immune-effector cells and unit of time (days); (<b>g</b>,<b>h</b>): The immune-effector cells (<b>g</b>) and virus-infected cells (<b>h</b>) vs. time (days). The same as Case 2, except I<sub>0</sub> = 75,000 cells; (<b>i</b>,<b>j</b>): The immune-effector cells (<b>i</b>) and virus-infected cells (<b>j</b>) vs. time (days). The same as Case 2, except V<sub>0</sub> = 15,000 cells.</p>
Full article ">Figure 3
<p>(<b>a</b>,<b>b</b>): The immune-effector cells (<b>a</b>) and virus-infected cells (<b>b</b>) vs. time (days); (<b>c</b>,<b>d</b>): The immune-effector cells (<b>c</b>) and virus-infected cells (<b>d</b>) vs. time (days). The same as Case 3, except I<sub>0</sub> = 75,000 cells; (<b>e</b>,<b>f</b>): The immune-effector cells (<b>e</b>) and virus-infected cells (<b>f</b>) vs. time (days). The same as Case 3, except V<sub>0</sub> = 15,000 cells.</p>
Full article ">Figure 3 Cont.
<p>(<b>a</b>,<b>b</b>): The immune-effector cells (<b>a</b>) and virus-infected cells (<b>b</b>) vs. time (days); (<b>c</b>,<b>d</b>): The immune-effector cells (<b>c</b>) and virus-infected cells (<b>d</b>) vs. time (days). The same as Case 3, except I<sub>0</sub> = 75,000 cells; (<b>e</b>,<b>f</b>): The immune-effector cells (<b>e</b>) and virus-infected cells (<b>f</b>) vs. time (days). The same as Case 3, except V<sub>0</sub> = 15,000 cells.</p>
Full article ">Figure 4
<p>(<b>a</b>,<b>b</b>): The immune-effector cells (<b>a</b>) and virus-infected cells (<b>b</b>) vs. time (days); (<b>c</b>,<b>d</b>): The immune-effector cells (<b>c</b>) and virus-infected cells (<b>d</b>) vs. time (days). The same as Case 4, except I<sub>0</sub> = 75,000 cells; (<b>e</b>,<b>f</b>): The immune-effector cells (<b>e</b>) and virus-infected cells (<b>f</b>) vs. time (days). The same as Case 4, except V<sub>0</sub> = 15,000 cells.</p>
Full article ">Figure 4 Cont.
<p>(<b>a</b>,<b>b</b>): The immune-effector cells (<b>a</b>) and virus-infected cells (<b>b</b>) vs. time (days); (<b>c</b>,<b>d</b>): The immune-effector cells (<b>c</b>) and virus-infected cells (<b>d</b>) vs. time (days). The same as Case 4, except I<sub>0</sub> = 75,000 cells; (<b>e</b>,<b>f</b>): The immune-effector cells (<b>e</b>) and virus-infected cells (<b>f</b>) vs. time (days). The same as Case 4, except V<sub>0</sub> = 15,000 cells.</p>
Full article ">Figure 5
<p>(<b>a</b>,<b>b</b>): The immune-effector cells (<b>a</b>) and virus-infected cells (<b>b</b>) vs. time (days); (<b>c</b>,<b>d</b>):When the initial number of immune-effector cells I<sub>0</sub> = 75,000 cells. The immune-effector cells (<b>c</b>) and virus-infected cells (<b>d</b>) vs. time (days); (<b>e</b>,<b>f</b>): When the initial number of virus-infected cells V<sub>0</sub> = 15,000 cells. The immune-effector cells (<b>e</b>) and virus-infected cells (<b>f</b>) vs. time (days).</p>
Full article ">Figure 5 Cont.
<p>(<b>a</b>,<b>b</b>): The immune-effector cells (<b>a</b>) and virus-infected cells (<b>b</b>) vs. time (days); (<b>c</b>,<b>d</b>):When the initial number of immune-effector cells I<sub>0</sub> = 75,000 cells. The immune-effector cells (<b>c</b>) and virus-infected cells (<b>d</b>) vs. time (days); (<b>e</b>,<b>f</b>): When the initial number of virus-infected cells V<sub>0</sub> = 15,000 cells. The immune-effector cells (<b>e</b>) and virus-infected cells (<b>f</b>) vs. time (days).</p>
Full article ">Figure 6
<p>(<b>a</b>,<b>b</b>): The immune-effector cells (<b>a</b>) and virus-infected cells (<b>b</b>) vs. time (days); (<b>c</b>,<b>d</b>): When I<sub>0</sub> = 75,000 cells. The immune-effector cells (<b>c</b>) and virus-infected cells (<b>d</b>) vs. time (days); (<b>e</b>,<b>f</b>): When V<sub>0</sub> = 15,000 cells. The immune-effector cells (<b>e</b>) and virus-infected cells (<b>f</b>) vs. time (days).</p>
Full article ">Figure 6 Cont.
<p>(<b>a</b>,<b>b</b>): The immune-effector cells (<b>a</b>) and virus-infected cells (<b>b</b>) vs. time (days); (<b>c</b>,<b>d</b>): When I<sub>0</sub> = 75,000 cells. The immune-effector cells (<b>c</b>) and virus-infected cells (<b>d</b>) vs. time (days); (<b>e</b>,<b>f</b>): When V<sub>0</sub> = 15,000 cells. The immune-effector cells (<b>e</b>) and virus-infected cells (<b>f</b>) vs. time (days).</p>
Full article ">
27 pages, 25974 KiB  
Article
Image Encryption and Decryption System through a Hybrid Approach Using the Jigsaw Transform and Langton’s Ant Applied to Retinal Fundus Images
by Andrés Romero-Arellano, Ernesto Moya-Albor, Jorge Brieva, Ivan Cruz-Aceves, Juan Gabriel Avina-Cervantes, Martha Alicia Hernandez-Gonzalez and Luis Miguel Lopez-Montero
Axioms 2021, 10(3), 215; https://doi.org/10.3390/axioms10030215 - 7 Sep 2021
Cited by 10 | Viewed by 4819
Abstract
In this work, a new medical image encryption/decryption algorithm was proposed. It is based on three main parts: the Jigsaw transform, Langton’s ant, and a novel way to add deterministic noise. The Jigsaw transform was used to hide visual information effectively, whereas Langton’s [...] Read more.
In this work, a new medical image encryption/decryption algorithm was proposed. It is based on three main parts: the Jigsaw transform, Langton’s ant, and a novel way to add deterministic noise. The Jigsaw transform was used to hide visual information effectively, whereas Langton’s ant and the deterministic noise algorithm give a reliable and secure approach. As a case study, the proposal was applied to high-resolution retinal fundus images, where a zero mean square error was obtained between the original and decrypted image. The method performance has been proven through several testing methods, such as statistical analysis (histograms and correlation distributions), entropy computation, keyspace assessment, robustness to differential attack, and key sensitivity analysis, showing in each one a high security level. In addition, the method was compared against other works showing a competitive performance and highlighting with a large keyspace (>1×101,134,190.38). Besides, the method has demonstrated adequate handling of high-resolution images, obtaining entropy values between 7.999988 and 7.999989, an average Number of Pixel Change Rate (NPCR) of 99.5796%±0.000674, and a mean Uniform Average Change Intensity (UACI) of 33.4469%±0.00229. In addition, when there is a small change in the key, the method does not give additional information to decrypt the image. Full article
(This article belongs to the Special Issue Mathematics Behind Machine Learning)
Show Figures

Figure 1

Figure 1
<p>Complete image dataset. Healthy patients (rows 1 and 2). Non-healthy patients (rows 3 and 4).</p>
Full article ">Figure 2
<p>Examples of the Jigsaw transform on an RGB image by varying the number of subsections (<span class="html-italic">M</span>). (<b>a</b>) RGB image. (<b>b</b>) <math display="inline"><semantics> <mrow> <mi>M</mi> <mo>=</mo> <mn>16</mn> </mrow> </semantics></math>, blocks of <math display="inline"><semantics> <mrow> <mn>64</mn> <mo>×</mo> <mn>64</mn> </mrow> </semantics></math> pixels. (<b>c</b>) <math display="inline"><semantics> <mrow> <mi>M</mi> <mo>=</mo> <mn>64</mn> </mrow> </semantics></math>, blocks of <math display="inline"><semantics> <mrow> <mn>32</mn> <mo>×</mo> <mn>32</mn> </mrow> </semantics></math> pixels. (<b>d</b>) <math display="inline"><semantics> <mrow> <mi>M</mi> <mo>=</mo> <mn>1024</mn> </mrow> </semantics></math>, blocks of <math display="inline"><semantics> <mrow> <mn>8</mn> <mo>×</mo> <mn>8</mn> </mrow> </semantics></math> pixels.</p>
Full article ">Figure 3
<p>Examples of a cyclic permutation over the Lena image. (<b>a</b>) RGB image of Lena. (<b>b</b>) Left horizontal cyclic permutation <math display="inline"><semantics> <mrow> <mi>C</mi> <mi>P</mi> <mo stretchy="false">{</mo> <msub> <mi>k</mi> <mi>x</mi> </msub> <mo>=</mo> <mo>−</mo> <mn>150</mn> <mo>,</mo> <msub> <mi>k</mi> <mi>y</mi> </msub> <mo>=</mo> <mn>0</mn> <mo stretchy="false">}</mo> </mrow> </semantics></math> result. (<b>c</b>) Vertical upward cyclic permutation <math display="inline"><semantics> <mrow> <mi>C</mi> <mi>P</mi> <mo stretchy="false">{</mo> <msub> <mi>k</mi> <mi>x</mi> </msub> <mo>=</mo> <mn>0</mn> <mo>,</mo> <msub> <mi>k</mi> <mi>y</mi> </msub> <mo>=</mo> <mn>150</mn> <mo stretchy="false">}</mo> </mrow> </semantics></math> result. (<b>d</b>) Left cyclic permutation <math display="inline"><semantics> <mrow> <mi>C</mi> <mi>P</mi> <mo stretchy="false">{</mo> <msub> <mi>k</mi> <mi>x</mi> </msub> <mo>=</mo> <mo>−</mo> <mn>100</mn> <mo>,</mo> <msub> <mi>k</mi> <mi>y</mi> </msub> <mo>=</mo> <mn>0</mn> <mo stretchy="false">}</mo> </mrow> </semantics></math> followed by a upward cyclic permutation <math display="inline"><semantics> <mrow> <mi>C</mi> <mi>P</mi> <mo stretchy="false">{</mo> <msub> <mi>k</mi> <mi>x</mi> </msub> <mo>=</mo> <mn>0</mn> <mo>,</mo> <msub> <mi>k</mi> <mi>y</mi> </msub> <mo>=</mo> <mo>−</mo> <mn>100</mn> <mo stretchy="false">}</mo> </mrow> </semantics></math> applied.</p>
Full article ">Figure 4
<p>The first 4 iterations of an ant on a 3 × 3 grid. The black cells are OFF, the rest are ON. (<b>a</b>) First iteration. (<b>b</b>) Second iteration. (<b>c</b>) Third iteration. (<b>d</b>) Fourth iteration.</p>
Full article ">Figure 5
<p>The ant (white cell), after 11,538 iterations, is stuck in “The Highway”.</p>
Full article ">Figure 6
<p>Examples of Lanton’s ant. (<b>a</b>) Input RGB image. (<b>b</b>) Result after 100,000 steps. (<b>c</b>) Result after 300,000 steps. (<b>d</b>) Result after 1,500,000 steps.</p>
Full article ">Figure 7
<p>The result of the first version of the deterministic noise. (<b>a</b>) Black image. (<b>b</b>) Deterministic noise added to (<b>a</b>).</p>
Full article ">Figure 8
<p>The result of the second version of the deterministic noise. (<b>a</b>) Black image. (<b>b</b>) Deterministic noise added to (<b>a</b>).</p>
Full article ">Figure 9
<p>Zoom on the first 10 rows and 11 columns of a black picture with deterministic noise added. (<b>a</b>) Using the parameters <math display="inline"><semantics> <mrow> <msub> <mi>p</mi> <mn>1</mn> </msub> <mo>=</mo> <mn>65</mn> <mo>,</mo> <msub> <mi>p</mi> <mn>2</mn> </msub> <mo>=</mo> <mn>31</mn> </mrow> </semantics></math>, and <math display="inline"><semantics> <mrow> <msub> <mi>p</mi> <mn>3</mn> </msub> <mo>=</mo> <mn>18</mn> </mrow> </semantics></math>. (<b>b</b>) Using the parameters <math display="inline"><semantics> <mrow> <msub> <mi>p</mi> <mn>1</mn> </msub> <mo>=</mo> <mn>210</mn> <mo>,</mo> <msub> <mi>p</mi> <mn>2</mn> </msub> <mo>=</mo> <mn>133</mn> </mrow> </semantics></math>, and <math display="inline"><semantics> <mrow> <msub> <mi>p</mi> <mn>3</mn> </msub> <mo>=</mo> <mn>97</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 10
<p>The six steps of the encryption algorithm.</p>
Full article ">Figure 11
<p>The six steps of the decryption algorithm.</p>
Full article ">Figure 12
<p>Results of the encryption algorithm applied to image 6 from the healthy patients. (<b>a</b>) Original image. (<b>b</b>) First step: Jigsaw transform. (<b>c</b>) Second step: deterministic noise. (<b>d</b>) Third step: cyclic permutation. (<b>e</b>) Fourth step: Jigsaw transform. (<b>f</b>) Fifth step: deterministic noise. (<b>g</b>) Sixth step: Langton’s ant.</p>
Full article ">Figure 13
<p>Results of the encryption algorithm applied to image 15 from the sick patients. (<b>a</b>) Original image. (<b>b</b>) First step: Jigsaw transform. (<b>c</b>) Second step: deterministic noise. (<b>d</b>) Third step: cyclic permutation. (<b>e</b>) Fourth step: Jigsaw transform. (<b>f</b>) Fifth step: deterministic noise. (<b>g</b>) Sixth step: Langton’s ant.</p>
Full article ">Figure 14
<p>Histograms of image number 6 (healthy patient). (<b>a</b>) Original image, red channel. (<b>b</b>) Original image, green channel. (<b>c</b>) Original image, blue channel. (<b>d</b>) Encrypted image, red channel. (<b>e</b>) Encrypted image, green channel. (<b>f</b>) Encrypted image, blue channel.</p>
Full article ">Figure 15
<p>Histograms of image number 15 (sick patient). (<b>a</b>) Original image, red channel. (<b>b</b>) Original image, green channel. (<b>c</b>) Original image, blue channel. (<b>d</b>) Encrypted image, red channel. (<b>e</b>) Encrypted image, green channel. (<b>f</b>) Encrypted image, blue channel.</p>
Full article ">Figure 16
<p>Correlation distributions of image number 6 (healthy patient). (<b>a</b>) Original image, red channel. (<b>b</b>) Original image, green channel. (<b>c</b>) Original image, blue channel. (<b>d</b>) Encrypted image, red channel. (<b>e</b>) Encrypted image, green channel. (<b>f</b>) Encrypted image, blue channel.</p>
Full article ">Figure 17
<p>Correlation distributions of image number 15 (sick patient). (<b>a</b>) Original image, red channel. (<b>b</b>) Original image, green channel. (<b>c</b>) Original image, blue channel. (<b>d</b>) Encrypted image, red channel. (<b>e</b>) Encrypted image, green channel. (<b>f</b>) Encrypted image, blue channel.</p>
Full article ">Figure 18
<p>Correlation distributions of image number 15 (sick patient). (<b>a</b>) Wrong key for the first Jigsaw transform. (<b>b</b>) Wrong key for the first deterministic noise. (<b>c</b>) Wrong key for the cyclic permutation. (<b>d</b>) Wrong key for the second Jigsaw transform. (<b>e</b>) Wrong key for the second deterministic noise. (<b>f</b>) Wrong key for Langton’s ant.</p>
Full article ">
22 pages, 4426 KiB  
Article
Location of Urban Logistics Spaces (ULS) for Two-Echelon Distribution Systems
by José Ruiz-Meza, Karen Meza-Peralta, Jairo R. Montoya-Torres and Jesus Gonzalez-Feliu
Axioms 2021, 10(3), 214; https://doi.org/10.3390/axioms10030214 - 7 Sep 2021
Cited by 8 | Viewed by 2618
Abstract
The main concern in city logistics is the need to optimize the movement of goods in urban contexts, and to minimize the multiple costs inherent in logistics operations. Inspired by an application in a medium-sized city in Latin America, this paper develops a [...] Read more.
The main concern in city logistics is the need to optimize the movement of goods in urban contexts, and to minimize the multiple costs inherent in logistics operations. Inspired by an application in a medium-sized city in Latin America, this paper develops a bi-objective mixed linear integer programming (MILP) model to locate different types of urban logistics spaces (ULS) for the configuration of a two-echelon urban distribution system. The objective functions seek to minimize the costs associated with distance traveled and relocation, in addition to the costs of violation of time windows. This model considers heterogeneous transport, speed assignment, and time windows. For experimental evaluation, two operational scenarios are considered, and Pareto frontiers are obtained to identify the efficient non-dominated solutions to select the most feasible ones from such a set. A case study of a distribution company of goods for supermarkets in the city of Barranquilla, Colombia, is also used to validate the proposed model. These solutions allow decision-makers to define the configuration of ULS networks for urban product delivery. Full article
Show Figures

Figure 1

Figure 1
<p>The problem solving cycle of Ackoff extended and adapted (authors’elaboration from Gonzalez-Feliu’s [<a href="#B70-axioms-10-00214" class="html-bibr">70</a>], considerations).</p>
Full article ">Figure 2
<p>Location of the city of Barranquilla, Colombia.</p>
Full article ">Figure 3
<p>Logistics spaces in the city of Barranquilla, Colombia.</p>
Full article ">Figure 4
<p>Representation of the conceptual model.</p>
Full article ">Figure 5
<p>Pareto frontier for the first scenario.</p>
Full article ">Figure 6
<p>Results obtained in the first scenario.</p>
Full article ">Figure 7
<p>Pareto frontier for the second scenario.</p>
Full article ">Figure 8
<p>Results obtained in the second scenario.</p>
Full article ">Figure 9
<p>Pareto frontier for the case study application.</p>
Full article ">Figure 10
<p>Location of transshipment urban logistics spaces.</p>
Full article ">
19 pages, 280 KiB  
Article
De Moivre’s and Euler Formulas for Matrices of Hybrid Numbers
by Mücahit Akbıyık, Seda Yamaç Akbıyık, Emel Karaca and Fatih Yılmaz
Axioms 2021, 10(3), 213; https://doi.org/10.3390/axioms10030213 - 6 Sep 2021
Cited by 7 | Viewed by 3240
Abstract
It is known that the hybrid numbers are generalizations of complex, hyperbolic and dual numbers. Recently, they have attracted the attention of many scientists. At this paper, we provide the Euler’s and De Moivre’s formulas for the 4×4 matrices associated with [...] Read more.
It is known that the hybrid numbers are generalizations of complex, hyperbolic and dual numbers. Recently, they have attracted the attention of many scientists. At this paper, we provide the Euler’s and De Moivre’s formulas for the 4×4 matrices associated with hybrid numbers by using trigonometric identities. Also, we give the roots of the matrices of hybrid numbers. Moreover, we give some illustrative examples to support the main formulas. Full article
(This article belongs to the Special Issue Advances in Mathematics and Its Applications)
7 pages, 247 KiB  
Article
(ρ,η,μ)-Interpolative Kannan Contractions I
by Yaé Ulrich Gaba, Hassen Aydi and Nabil Mlaiki
Axioms 2021, 10(3), 212; https://doi.org/10.3390/axioms10030212 - 3 Sep 2021
Cited by 7 | Viewed by 2001
Abstract
We point out a vital error in the paper of Gaba et al. (2019), showing that a (ρ,η,μ) interpolative Kannan contraction in a complete metric space need not have a fixed point. Then we give an appropriate [...] Read more.
We point out a vital error in the paper of Gaba et al. (2019), showing that a (ρ,η,μ) interpolative Kannan contraction in a complete metric space need not have a fixed point. Then we give an appropriate restriction on a (ρ,η,μ)-interpolative Kannan contraction that guarantees the existence of a fixed point and provide an equivalent formulation. Moreover, we show that this formulation can be extended to the interpolative Reich-Rus-Ćirić type contraction. Full article
(This article belongs to the Special Issue Fixed Point Theory and Its Related Topics II)
14 pages, 407 KiB  
Article
Numerical Algorithms for Computing an Arbitrary Singular Value of a Tensor Sum
by Asuka Ohashi and Tomohiro Sogabe
Axioms 2021, 10(3), 211; https://doi.org/10.3390/axioms10030211 - 31 Aug 2021
Cited by 1 | Viewed by 1688
Abstract
We consider computing an arbitrary singular value of a tensor sum: [...] Read more.
We consider computing an arbitrary singular value of a tensor sum: T:=InImA+InBI+CImIRmn×mn, where AR×, BRm×m, CRn×n. We focus on the shift-and-invert Lanczos method, which solves a shift-and-invert eigenvalue problem of (TTTσ˜2Imn)1, where σ˜ is set to a scalar value close to the desired singular value. The desired singular value is computed by the maximum eigenvalue of the eigenvalue problem. This shift-and-invert Lanczos method needs to solve large-scale linear systems with the coefficient matrix TTTσ˜2Imn. The preconditioned conjugate gradient (PCG) method is applied since the direct methods cannot be applied due to the nonzero structure of the coefficient matrix. However, it is difficult in terms of memory requirements to simply implement the shift-and-invert Lanczos and the PCG methods since the size of T grows rapidly by the sizes of A, B, and C. In this paper, we present the following two techniques: (1) efficient implementations of the shift-and-invert Lanczos method for the eigenvalue problem of TTT and the PCG method for TTTσ˜2Imn using three-dimensional arrays (third-order tensors) and the n-mode products, and (2) preconditioning matrices of the PCG method based on the eigenvalue and the Schur decomposition of T. Finally, we show the effectiveness of the proposed methods through numerical experiments. Full article
(This article belongs to the Special Issue Numerical Analysis and Computational Mathematics)
Show Figures

Figure 1

Figure 1
<p>Convergence histories with relative residual norm of the Lanczos method for the 5-th max. singular value of the almost symmetric matrix <span class="html-italic">T</span> whose size is <math display="inline"><semantics> <mrow> <mi>n</mi> <mo>=</mo> <mn>15</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 2
<p>Convergence histories with relative residual norm of the Lanczos method for the median singular value of the almost symmetric matrix <span class="html-italic">T</span> whose size is <math display="inline"><semantics> <mrow> <mi>n</mi> <mo>=</mo> <mn>15</mn> </mrow> </semantics></math>.</p>
Full article ">
18 pages, 824 KiB  
Article
Qualitative and Quantitative Analyses of COVID-19 Dynamics
by Taye Samuel Faniran, Leontine Nkague Nkamba and Thomas Timothee Manga
Axioms 2021, 10(3), 210; https://doi.org/10.3390/axioms10030210 - 31 Aug 2021
Cited by 3 | Viewed by 2272
Abstract
COVID-19 is a highly contagious disease which has spread across the world. A deterministic model that considers an important component of individuals with vertically transmitted underlying diseases (high-risk susceptible individuals), rather than the general public, is formulated in this paper. We also consider [...] Read more.
COVID-19 is a highly contagious disease which has spread across the world. A deterministic model that considers an important component of individuals with vertically transmitted underlying diseases (high-risk susceptible individuals), rather than the general public, is formulated in this paper. We also consider key parameters that are concerned with the disease. An epidemiological threshold, R0, is computed using next-generation matrix approach. This is used to establish the existence and global stability of equilibria. We identify the most sensitive parameters which effectively contribute to change the disease dynamics with the help of sensitivity analysis. Our results reveal that increasing contact tracing of the exposed individuals who are tested for COVID-19 and hospitalizing them, largely has a negative impact on R0. Results further reveal that transmission rate between low-risk/high-risk susceptible individuals and symptomatic infectious individuals β and incubation rate of the exposed individuals σ have positive impact on R0. Numerical simulations show that there are fewer high-risk susceptible individuals than the general public when R0<1. This may be due to the fact that high-risk susceptible individuals may prove a bit more difficult to control than the low-risk susceptible individuals as a result of inherited underlying diseases present in them. We thus conclude that high level of tracing and hospitalizing the exposed individuals, as well as adherence to standard precautions and wearing appropriate Personal Protective Equipment (PPE) while handling emergency cases, are needed to flatten the epidemic curve. Full article
Show Figures

Figure 1

Figure 1
<p>Scheme of COVID-19 model.</p>
Full article ">Figure 2
<p>Sensitivity analysis between <math display="inline"><semantics> <msub> <mi>R</mi> <mn>0</mn> </msub> </semantics></math> and its associated parameters.</p>
Full article ">Figure 3
<p>Simulation results showing the global stability of the disease-free equilibrium.</p>
Full article ">Figure 3 Cont.
<p>Simulation results showing the global stability of the disease-free equilibrium.</p>
Full article ">Figure 4
<p>Simulation results showing the global stability of the endemic equilibrium.</p>
Full article ">Figure 4 Cont.
<p>Simulation results showing the global stability of the endemic equilibrium.</p>
Full article ">
13 pages, 306 KiB  
Article
θ*-Weak Contractions and Discontinuity at the Fixed Point with Applications to Matrix and Integral Equations
by Atiya Perveen, Waleed M. Alfaqih, Salvatore Sessa and Mohammad Imdad
Axioms 2021, 10(3), 209; https://doi.org/10.3390/axioms10030209 - 31 Aug 2021
Cited by 3 | Viewed by 1829
Abstract
In this paper, the notion of θ*-weak contraction is introduced, which is utilized to prove some fixed point results. These results are helpful to give a positive response to certain open question raised by Kannan and Rhoades on the existence of [...] Read more.
In this paper, the notion of θ*-weak contraction is introduced, which is utilized to prove some fixed point results. These results are helpful to give a positive response to certain open question raised by Kannan and Rhoades on the existence of contractive definition which does not force the mapping to be continuous at the fixed point. Some illustrative examples are also given to support our results. As applications of our result, we investigate the existence and uniqueness of a solution of non-linear matrix equations and integral equations of Volterra type as well. Full article
(This article belongs to the Special Issue Advances in Nonlinear Analysis and Related Fixed Point Problems)
15 pages, 942 KiB  
Article
Selection of Logistics Service Provider for the E-Commerce Companies in Pakistan Based on Integrated GRA-TOPSIS Approach
by Muhammad Hamza Naseem, Jiaqi Yang and Ziquan Xiang
Axioms 2021, 10(3), 208; https://doi.org/10.3390/axioms10030208 - 30 Aug 2021
Cited by 8 | Viewed by 3004
Abstract
Recently, the demand for third-party logistics providers has become extremely relevant and the key subject for businesses to enhance their service quality and minimize logistics costs. The key success factor for an e-commerce business is product delivery, and the third-party logistics service provider [...] Read more.
Recently, the demand for third-party logistics providers has become extremely relevant and the key subject for businesses to enhance their service quality and minimize logistics costs. The key success factor for an e-commerce business is product delivery, and the third-party logistics service provider is responsible for that. Each 3PLP has its own business characteristics, meaning it is important to select the most suitable logistics provider for the e-commerce business. This study uses a combination of grey relational analysis (GRA) and the Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) method, assisting decision makers in choosing the best logistics service provider for their e-business. A case study of an e-commerce company based in Faisalabad, Pakistan, was selected to demonstrate the steps of the proposed methods. In this process, seven criteria of logistics suppliers were considered, and then the best alternatives among four logistics provider companies were selected using the proposed method. Full article
(This article belongs to the Special Issue Multiple-Criteria Decision Making)
Show Figures

Figure 1

Figure 1
<p>Flow chart of proposed methodology.</p>
Full article ">Figure 2
<p>Hierarchical structure for 3PLP selection (source: authors’ compilation).</p>
Full article ">
15 pages, 266 KiB  
Article
A Parametric Type of Cauchy Polynomials with Higher Level
by Takao Komatsu
Axioms 2021, 10(3), 207; https://doi.org/10.3390/axioms10030207 - 30 Aug 2021
Viewed by 1603
Abstract
There are many kinds of generalizations of Cauchy numbers and polynomials. Recently, a parametric type of the Bernoulli numbers with level 3 was introduced and studied as a kind of generalization of Bernoulli polynomials. A parametric type of Cauchy numbers with level 3 [...] Read more.
There are many kinds of generalizations of Cauchy numbers and polynomials. Recently, a parametric type of the Bernoulli numbers with level 3 was introduced and studied as a kind of generalization of Bernoulli polynomials. A parametric type of Cauchy numbers with level 3 is its analogue. In this paper, as an analogue of a parametric type of Bernoulli polynomials with level 3 and its extension, we introduce a parametric type of Cauchy polynomials with a higher level. We present their characteristic and combinatorial properties. By using recursions, we show some determinant expressions. Full article
(This article belongs to the Special Issue Advances in Mathematics and Its Applications)
Previous Issue
Next Issue
Back to TopTop