[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Next Issue
Volume 10, June-2
Previous Issue
Volume 10, May-2
You seem to have javascript disabled. Please note that many of the page functionalities won't work as expected without javascript enabled.
 
 

Mathematics, Volume 10, Issue 11 (June-1 2022) – 166 articles

Cover Story (view full-size image): Given an internal network, a man-in-the-middle (MitM) attack is a form of cyberattack in which a malicious agent intercepts the communication between two hosts, thus gaining access to the data that these hosts send to each other. We introduce a model of cooperative graph-restricted games, in which both nodes and edges represent agents, in order to obtain a key risk indicator (KRI) that measures the risk of suffering an attack on each element (host or link) of a network. 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:
16 pages, 341 KiB  
Article
On Polynomials Orthogonal with Respect to an Inner Product Involving Higher-Order Differences: The Meixner Case
by Roberto S. Costas-Santos, Anier Soria-Lorente and Jean-Marie Vilaire
Mathematics 2022, 10(11), 1952; https://doi.org/10.3390/math10111952 - 6 Jun 2022
Cited by 4 | Viewed by 1939
Abstract
In this contribution we consider sequences of monic polynomials orthogonal with respect to the Sobolev-type inner product f,g=uM,fg+λTjf(α)Tjg(α), [...] Read more.
In this contribution we consider sequences of monic polynomials orthogonal with respect to the Sobolev-type inner product f,g=uM,fg+λTjf(α)Tjg(α), where uM is the Meixner linear operator, λR+, jN, α0, and T is the forward difference operator Δ or the backward difference operator ∇. Moreover, we derive an explicit representation for these polynomials. The ladder operators associated with these polynomials are obtained, and the linear difference equation of the second order is also given. In addition, for these polynomials, we derive a (2j+3)-term recurrence relation. Finally, we find the Mehler–Heine type formula for the particular case α=0. Full article
(This article belongs to the Section Difference and Differential Equations)
Show Figures

Figure 1

Figure 1
<p>The gray-color curve represents the function in the left hand side in (<a href="#FD54-mathematics-10-01952" class="html-disp-formula">54</a>) for <math display="inline"><semantics> <mrow> <mi>n</mi> <mo>=</mo> <mn>50</mn> </mrow> </semantics></math>, and the black curve is the limiting function. Data: <math display="inline"><semantics> <mrow> <mi>β</mi> <mo>=</mo> <mn>7</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>c</mi> <mo>=</mo> <mn>1</mn> <mo>/</mo> <mn>5</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>λ</mi> <mo>=</mo> <msup> <mn>10</mn> <mrow> <mo>−</mo> <mn>21</mn> </mrow> </msup> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi>j</mi> <mo>=</mo> <mn>2</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 2
<p>The gray-color curve represents the function in the left hand side in (<a href="#FD54-mathematics-10-01952" class="html-disp-formula">54</a>) for <math display="inline"><semantics> <mrow> <mi>n</mi> <mo>=</mo> <mn>70</mn> </mrow> </semantics></math>, and the black curve is the limiting function. Data: <math display="inline"><semantics> <mrow> <mi>β</mi> <mo>=</mo> <mn>7</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>c</mi> <mo>=</mo> <mn>1</mn> <mo>/</mo> <mn>5</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>λ</mi> <mo>=</mo> <msup> <mn>10</mn> <mrow> <mo>−</mo> <mn>21</mn> </mrow> </msup> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi>j</mi> <mo>=</mo> <mn>2</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 3
<p>The gray-color curve represents the function in the left hand side in (<a href="#FD54-mathematics-10-01952" class="html-disp-formula">54</a>) for <math display="inline"><semantics> <mrow> <mi>n</mi> <mo>=</mo> <mn>100</mn> </mrow> </semantics></math>, and the black curve is the limiting function. Data: <math display="inline"><semantics> <mrow> <mi>β</mi> <mo>=</mo> <mn>7</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>c</mi> <mo>=</mo> <mn>1</mn> <mo>/</mo> <mn>5</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>λ</mi> <mo>=</mo> <msup> <mn>10</mn> <mrow> <mo>−</mo> <mn>21</mn> </mrow> </msup> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi>j</mi> <mo>=</mo> <mn>2</mn> </mrow> </semantics></math>.</p>
Full article ">
11 pages, 1044 KiB  
Article
A Note on the Laguerre-Type Appell and Hypergeometric Polynomials
by Paolo Emilio Ricci and Rekha Srivastava
Mathematics 2022, 10(11), 1951; https://doi.org/10.3390/math10111951 - 6 Jun 2022
Cited by 6 | Viewed by 1830
Abstract
The Laguerre derivative and its iterations have been used to define new sets of special functions, showing the possibility of generating a kind of parallel universe for mathematical entities of this kind. In this paper, we introduce the Laguerre-type Appell polynomials, in particular, [...] Read more.
The Laguerre derivative and its iterations have been used to define new sets of special functions, showing the possibility of generating a kind of parallel universe for mathematical entities of this kind. In this paper, we introduce the Laguerre-type Appell polynomials, in particular, the Bernoulli and Euler case, and we examine a set of hypergeometric Laguerre–Bernoulli polynomials. We show their main properties and indicate their possible extensions. Full article
Show Figures

Figure 1

Figure 1
<p>Graphs of polynomials <math display="inline"><semantics> <mrow> <msub> <mrow/> <mi>L</mi> </msub> <msub> <mi>B</mi> <mi>n</mi> </msub> <mrow> <mo>(</mo> <mi>x</mi> <mo>)</mo> </mrow> <mspace width="0.166667em"/> </mrow> </semantics></math> for <math display="inline"><semantics> <mrow> <mi>n</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mo>…</mo> <mo>,</mo> <mn>6</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 2
<p>Graphs of polynomials <math display="inline"><semantics> <mrow> <msub> <mrow/> <mi>L</mi> </msub> <msub> <mi>E</mi> <mi>n</mi> </msub> <mrow> <mo>(</mo> <mi>x</mi> <mo>)</mo> </mrow> <mspace width="0.166667em"/> </mrow> </semantics></math> for <math display="inline"><semantics> <mrow> <mi>n</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mo>…</mo> <mo>,</mo> <mn>6</mn> </mrow> </semantics></math>.</p>
Full article ">
13 pages, 906 KiB  
Article
Zeroing Neural Network Approaches Based on Direct and Indirect Methods for Solving the Yang–Baxter-like Matrix Equation
by Wendong Jiang, Chia-Liang Lin, Vasilios N. Katsikis, Spyridon D. Mourtas, Predrag S. Stanimirović and Theodore E. Simos
Mathematics 2022, 10(11), 1950; https://doi.org/10.3390/math10111950 - 6 Jun 2022
Cited by 15 | Viewed by 2017
Abstract
This research introduces three novel zeroing neural network (ZNN) models for addressing the time-varying Yang–Baxter-like matrix equation (TV-YBLME) with arbitrary (regular or singular) real time-varying (TV) input matrices in continuous time. One ZNN dynamic utilizes error matrices directly arising from the equation involved [...] Read more.
This research introduces three novel zeroing neural network (ZNN) models for addressing the time-varying Yang–Baxter-like matrix equation (TV-YBLME) with arbitrary (regular or singular) real time-varying (TV) input matrices in continuous time. One ZNN dynamic utilizes error matrices directly arising from the equation involved in the TV-YBLME. Moreover, two ZNN models are proposed using basic properties of the YBLME, such as the splitting of the YBLME and sufficient conditions for a matrix to solve the YBLME. The Tikhonov regularization principle enables addressing the TV-YBLME with an arbitrary input real TV matrix. Numerical experiments, including nonsingular and singular TV input matrices, show that the suggested models deal effectively with the TV-YBLME. Full article
Show Figures

Figure 1

Figure 1
<p>The ZNN error tracking and the convergence and trajectories of the solutions in <a href="#sec4dot1-mathematics-10-01950" class="html-sec">Section 4.1</a>, <a href="#sec4dot2-mathematics-10-01950" class="html-sec">Section 4.2</a> and <a href="#sec4dot3-mathematics-10-01950" class="html-sec">Section 4.3</a>. (<b>a</b>) <a href="#sec4dot1-mathematics-10-01950" class="html-sec">Section 4.1</a>: ZNN error tracking. (<b>b</b>) <a href="#sec4dot1-mathematics-10-01950" class="html-sec">Section 4.1</a>: Solutions convergence. (<b>c</b>) <a href="#sec4dot1-mathematics-10-01950" class="html-sec">Section 4.1</a>: Solutions trajectories. (<b>d</b>) <a href="#sec4dot2-mathematics-10-01950" class="html-sec">Section 4.2</a>: ZNN error tracking. (<b>e</b>) <a href="#sec4dot2-mathematics-10-01950" class="html-sec">Section 4.2</a>: Solutions convergence. (<b>f</b>) <a href="#sec4dot2-mathematics-10-01950" class="html-sec">Section 4.2</a>: Solutions trajectories. (<b>g</b>) <a href="#sec4dot3-mathematics-10-01950" class="html-sec">Section 4.3</a>: ZNN error tracking. (<b>h</b>) <a href="#sec4dot3-mathematics-10-01950" class="html-sec">Section 4.3</a>: Solutions convergence. (<b>i</b>) <a href="#sec4dot3-mathematics-10-01950" class="html-sec">Section 4.3</a>: Solutions trajectories.</p>
Full article ">Figure 2
<p>The ZNN error tracking, convergence, and trajectories of the solutions in <a href="#sec4dot4-mathematics-10-01950" class="html-sec">Section 4.4</a> under IC1 and IC2. (<b>a</b>) <a href="#sec4dot4-mathematics-10-01950" class="html-sec">Section 4.4</a> under IC1: ZNN error tracking. (<b>b</b>) <a href="#sec4dot4-mathematics-10-01950" class="html-sec">Section 4.4</a> under IC1: Solutions convergence. (<b>c</b>) <a href="#sec4dot4-mathematics-10-01950" class="html-sec">Section 4.4</a> under IC1: Solutions trajectories. (<b>d</b>) <a href="#sec4dot4-mathematics-10-01950" class="html-sec">Section 4.4</a> under IC2: ZNN error tracking. (<b>e</b>) <a href="#sec4dot4-mathematics-10-01950" class="html-sec">Section 4.4</a> under IC2: Solutions convergence. (<b>f</b>) <a href="#sec4dot4-mathematics-10-01950" class="html-sec">Section 4.4</a> under IC2: Solutions trajectories.</p>
Full article ">
26 pages, 383 KiB  
Article
Modified Mann-Type Subgradient Extragradient Rules for Variational Inequalities and Common Fixed Points Implicating Countably Many Nonexpansive Operators
by Yun-Ling Cui, Lu-Chuan Ceng, Fang-Fei Zhang, Cong-Shan Wang, Jian-Ye Li, Hui-Ying Hu and Long He
Mathematics 2022, 10(11), 1949; https://doi.org/10.3390/math10111949 - 6 Jun 2022
Viewed by 1552
Abstract
In a real Hilbert space, let the CFPP, VIP, and HFPP denote the common fixed-point problem of countable nonexpansive operators and asymptotically nonexpansive operator, variational inequality problem, and hierarchical fixed point problem, respectively. With the help of the Mann iteration method, a subgradient [...] Read more.
In a real Hilbert space, let the CFPP, VIP, and HFPP denote the common fixed-point problem of countable nonexpansive operators and asymptotically nonexpansive operator, variational inequality problem, and hierarchical fixed point problem, respectively. With the help of the Mann iteration method, a subgradient extragradient approach with a linear-search process, and a hybrid deepest-descent technique, we construct two modified Mann-type subgradient extragradient rules with a linear-search process for finding a common solution of the CFPP and VIP. Under suitable assumptions, we demonstrate the strong convergence of the suggested rules to a common solution of the CFPP and VIP, which is only a solution of a certain HFPP. Full article
(This article belongs to the Special Issue Applied Functional Analysis and Applications)
19 pages, 2020 KiB  
Article
Optimal Pricing Policies with an Allowable Discount for Perishable Items under Time-Dependent Sales Price and Trade Credit
by Mrudul Y. Jani, Manish R. Betheja, Amrita Bhadoriya, Urmila Chaudhari, Mohamed Abbas and Malak S. Alqahtani
Mathematics 2022, 10(11), 1948; https://doi.org/10.3390/math10111948 - 6 Jun 2022
Cited by 7 | Viewed by 2205
Abstract
Trade credit is generally used by businesses to obtain external funds. This article demonstrates an inventory system from the retailer’s point of view in which (1) the influence of trade credit on expanding small businesses and their consumers is the focus of this [...] Read more.
Trade credit is generally used by businesses to obtain external funds. This article demonstrates an inventory system from the retailer’s point of view in which (1) the influence of trade credit on expanding small businesses and their consumers is the focus of this research, and (2) the retailer’s on-hand inventory follows the non-instantaneous deterioration. (3) To maximize profit, the demand is disclosed, which is based on not just the sales price, but also on cumulative demand, which indicates saturation and diffusion. (4) The product’s initial price and the permitted discount rate at the time of deterioration are considered to be time-dependent functions of the sales price. In the absence of deterioration, the item is sold at a constant rate, and whenever deterioration occurs, the sales price is assumed to be an exponential function of the discount variable. The main aim is to optimize the total profit of the retailer in terms of cycle time and sales price. The traditional algorithm of optimization is used to address the optimization problem. Finally, the theoretical results are validated by solving three numerical illustrations and conducting a sensitivity analysis of the main factors resulting from the following managerial implications: (1) credit period provides the maximum profit margin of any financing method, and (2) an increase in the initial rate of demand raises sales price while increasing overall profit significantly. Full article
Show Figures

Figure 1

Figure 1
<p>The inventory system and proposed problem (Adapted from [<a href="#B28-mathematics-10-01948" class="html-bibr">28</a>]).</p>
Full article ">Figure 2
<p>Optimality of a total profit function for situation 1 (<math display="inline"><semantics> <mrow> <mn>0</mn> <mo>&lt;</mo> <mi>M</mi> <mo>&lt;</mo> <msub> <mi>t</mi> <mi>n</mi> </msub> <mo>&lt;</mo> <mi>T</mi> </mrow> </semantics></math>).</p>
Full article ">Figure 3
<p>Optimality of a total profit function for situation 2 (<math display="inline"><semantics> <mrow> <mn>0</mn> <mo>&lt;</mo> <msub> <mi>t</mi> <mi>n</mi> </msub> <mo>&lt;</mo> <mi>M</mi> <mo>&lt;</mo> <mi>T</mi> </mrow> </semantics></math>).</p>
Full article ">Figure 4
<p>Optimality of a total profit function for situation 3 (<math display="inline"><semantics> <mrow> <mn>0</mn> <mo>&lt;</mo> <msub> <mi>t</mi> <mi>n</mi> </msub> <mo>&lt;</mo> <mi>T</mi> <mo>&lt;</mo> <mi>M</mi> </mrow> </semantics></math>).</p>
Full article ">Figure 5
<p>Comparison chart of current model with [<a href="#B28-mathematics-10-01948" class="html-bibr">28</a>].</p>
Full article ">
9 pages, 266 KiB  
Article
Ćirić-Type Operators and Common Fixed Point Theorems
by Claudia Luminiţa Mihiţ, Ghiocel Moţ and Gabriela Petruşel
Mathematics 2022, 10(11), 1947; https://doi.org/10.3390/math10111947 - 6 Jun 2022
Cited by 1 | Viewed by 1574
Abstract
In the context of a complete metric space, we will consider the common fixed point problem for two self operators. The operators are assumed to satisfy a general contraction type condition inspired by the Ćirić fixed point theorems. Under some appropriate conditions we [...] Read more.
In the context of a complete metric space, we will consider the common fixed point problem for two self operators. The operators are assumed to satisfy a general contraction type condition inspired by the Ćirić fixed point theorems. Under some appropriate conditions we establish existence, uniqueness and approximation results for the common fixed point. In the same framework, the second problem is to study various stability properties. More precisely, we will obtain sufficient conditions assuring that the common fixed point problem is well-posed and has the Ulam–Hyers stability, as well as the Ostrowski property for the considered problem. Some examples and applications are finally given in order to illustrate the abstract theorems proposed in the first part of the paper. Our results extend and complement some theorems in the recent literature. Full article
(This article belongs to the Special Issue Fixed Point, Optimization, and Applications II)
20 pages, 6025 KiB  
Article
Symmetric Diffeomorphic Image Registration with Multi-Label Segmentation Masks
by Chenwei Cai, Lvda Wang and Shihui Ying
Mathematics 2022, 10(11), 1946; https://doi.org/10.3390/math10111946 - 6 Jun 2022
Cited by 2 | Viewed by 2059
Abstract
Image registration aims to align two images through a spatial transformation. It plays a significant role in brain imaging analysis. In this research, we propose a symmetric diffeomorphic image registration model based on multi-label segmentation masks to solve the problems in brain MRI [...] Read more.
Image registration aims to align two images through a spatial transformation. It plays a significant role in brain imaging analysis. In this research, we propose a symmetric diffeomorphic image registration model based on multi-label segmentation masks to solve the problems in brain MRI registration. We first introduce the similarity metric of the multi-label masks to the energy function, which improves the alignment of the brain region boundaries and the robustness to the noise. Next, we establish the model on the diffeomorphism group through the relaxation method and the inverse consistent constraint. The algorithm is designed through the local linearization and least-squares method. We then give spatially adaptive parameters to coordinate the descent of the energy function in different regions. The results show that our approach, compared with the mainstream methods, has better accuracy and noise resistance, and the transformations are more smooth and more reasonable. Full article
(This article belongs to the Special Issue Mathematical Modeling and Numerical Simulation in Engineering)
Show Figures

Figure 1

Figure 1
<p>A T1 MRI human brain image, tissue segmentation, and corresponding intensity distributions are shown.</p>
Full article ">Figure 2
<p>(<b>a</b>) The structure of the whole algorithm. (<b>b</b>) The structure of itkPDEDeformableRegistrationFilter.</p>
Full article ">Figure 3
<p>The synthetic 2D data in <a href="#sec3dot2-mathematics-10-01946" class="html-sec">Section 3.2</a> is shown. The first row displays the moving and fixed images. The boundaries of the fixed image are marked with yellow outlines. The second row plots the images of the intensity value on the line segment from <math display="inline"><semantics> <mrow> <mo>(</mo> <mn>0</mn> <mo>,</mo> <mn>50</mn> <mo>)</mo> </mrow> </semantics></math> to <math display="inline"><semantics> <mrow> <mo>(</mo> <mn>99</mn> <mo>,</mo> <mn>50</mn> <mo>)</mo> </mrow> </semantics></math>, which is the direction of the green arrows.</p>
Full article ">Figure 4
<p>The qualitative results of <a href="#sec3dot2-mathematics-10-01946" class="html-sec">Section 3.2</a> are shown. The figure has two parts, distinguishing between two kinds of smoothing parameters, i.e., <b>Kf</b>1 <b>Kd</b>1 and <b>Kf</b>2 <b>Kd</b><math display="inline"><semantics> <mrow> <mn>0.5</mn> </mrow> </semantics></math>. In each part, the three rows display the warped moving images, the deformation grids, and the residual images, respectively. Different columns are the results of different methods. The color of the deformation grids, whose scale bar ranges from <math display="inline"><semantics> <mrow> <mo>−</mo> <mn>4.5</mn> </mrow> </semantics></math> to <math display="inline"><semantics> <mrow> <mn>5.8</mn> </mrow> </semantics></math> pixels, represents the magnitude of the transformations. The color of the residual images, whose scale bar ranges from <math display="inline"><semantics> <mrow> <mo>−</mo> <mn>3.0</mn> </mrow> </semantics></math> to <math display="inline"><semantics> <mrow> <mn>3.2</mn> </mrow> </semantics></math>, represents the difference between the intensity values of the fixed image and the warped moving images.</p>
Full article ">Figure 5
<p>The axial view of both #161 in the OASIS-1 dataset and noise images are shown. The first image is the original skull-stripped image of #161, the second image is the related WGCS, and the third image is the BRS of 35 regions. The last three images display the noise images of the standard deviation <math display="inline"><semantics> <mrow> <msub> <mi>σ</mi> <mi>n</mi> </msub> <mo>=</mo> <mn>0.01</mn> <mo>,</mo> <mspace width="0.166667em"/> <mn>0.025</mn> <mo>,</mo> <mspace width="0.166667em"/> <mn>0.05</mn> </mrow> </semantics></math>, respectively.</p>
Full article ">Figure 6
<p>The qualitative results of <a href="#sec3dot3-mathematics-10-01946" class="html-sec">Section 3.3</a> are shown. The first to third rows display the BRSs of the axial, coronal, and sagittal sections, respectively. The first column shows the fixed BRS of #161. The second to forth columns show the warped BRSs of the methods.</p>
Full article ">Figure 7
<p>The quantitative results of <a href="#sec3dot3-mathematics-10-01946" class="html-sec">Section 3.3</a> are shown. (<b>a</b>) The registration results from #227 to #161. (<b>b</b>) The registration results from #287 to #161. (<b>c</b>) The registration results from #319 to #161. (<b>d</b>) The registration results from #333 to #161. In each diagram, we plot the images of the Dice ratio with respect to the standard deviations of the noise, where 0 means no noise.</p>
Full article ">Figure 8
<p>The registration results of an example in <a href="#sec3dot4-mathematics-10-01946" class="html-sec">Section 3.4</a> are shown. All images are plotted in the axial, coronal, and sagittal sections. The first column displays the moving image #02, and the second column displays the fixed image #01. The third to fifth columns represent the warped moving images of different methods, i.e., <b>DiffDe</b>, <b>SyN</b>, and <b>Ours</b>, respectively.</p>
Full article ">Figure 9
<p>The qualitative results in <a href="#sec3dot4-mathematics-10-01946" class="html-sec">Section 3.4</a>, based on <a href="#mathematics-10-01946-f008" class="html-fig">Figure 8</a>, are shown. The first to third columns distinguish the results of <b>DiffDe</b>, <b>SyN</b>, and <b>Ours</b>. The first row displays the half-bottom volumetric plots of the <b>DR</b>, where the scale bar ranges from <math display="inline"><semantics> <mrow> <mn>0.7</mn> </mrow> </semantics></math> to <math display="inline"><semantics> <mrow> <mn>0.91</mn> </mrow> </semantics></math>. The second row displays volumetric plots of the <b>SMErr</b>, where the scale bar ranges from 0 to <math display="inline"><semantics> <mrow> <mn>11.28</mn> </mrow> </semantics></math>. The third row displays the point cloud maps showing where the negative Jacobian determinant occurs (<math display="inline"><semantics> <mrow> <mi>Det</mi> <mi>J</mi> <mo>&lt;</mo> <mn>0</mn> </mrow> </semantics></math>).</p>
Full article ">
15 pages, 313 KiB  
Article
Supplements Related to Normal π-Projective Hypermodules
by Burcu Nişancı Türkmen, Hashem Bordbar and Irina Cristea
Mathematics 2022, 10(11), 1945; https://doi.org/10.3390/math10111945 - 6 Jun 2022
Cited by 2 | Viewed by 1499
Abstract
In this study, the role of supplements in Krasner hypermodules is examined and related to normal π-projectivity. We prove that the class of supplemented Krasner hypermodules is closed under finite sums and under quotients. Moreover, we give characterizations of finitely generated supplemented [...] Read more.
In this study, the role of supplements in Krasner hypermodules is examined and related to normal π-projectivity. We prove that the class of supplemented Krasner hypermodules is closed under finite sums and under quotients. Moreover, we give characterizations of finitely generated supplemented and amply supplemented Krasner hypermodules. In the second part of the paper we relate the normal projectivity to direct summands and supplements in Krasner hypermodules. Full article
(This article belongs to the Special Issue State-of-the-Art Mathematical Applications in Europe)
19 pages, 4592 KiB  
Article
Improved Deep Neural Network (IDNN) with SMO Algorithm for Enhancement of Third Zone Distance Relay under Power Swing Condition
by Cholleti Sriram, Jarupula Somlal, B. Srikanth Goud, Mohit Bajaj, Mohamed F. Elnaggar and Salah Kamel
Mathematics 2022, 10(11), 1944; https://doi.org/10.3390/math10111944 - 6 Jun 2022
Cited by 4 | Viewed by 2018
Abstract
A zone 3 distance relay is utilized to provide remote backup protection in the event that the primary protection fails. However, under stressful situations such as severe loads, voltage, and transient instability, the danger of malfunction in distance relay is relatively high since [...] Read more.
A zone 3 distance relay is utilized to provide remote backup protection in the event that the primary protection fails. However, under stressful situations such as severe loads, voltage, and transient instability, the danger of malfunction in distance relay is relatively high since it collapses the system’s stability and reliability. During maloperation, the relay does not function properly to operate the transmission line. To overcome this problem, an advanced power swing blocking scheme has been developed. An improved DNN-based power swing blocking system is proposed to avoid the maloperation of the distance relay and improve the system’s reliability. The current and voltage signal of the system is sensed, and the sensed data is fed into the Improved Discrete Wavelet Transform (IMDWT). The IMDWT generates the coefficient value of the sensed data and further computes the standard deviation (SD) from the coefficient, which is used to detect the condition of a system, such as normal or stressed. The SD value is given to the most valuable algorithm for the improved Deep Neural Network (IDNN). In the proposed work, the improved DNN operates in two modes, the first mode is RDL-1 (normal condition), and the second mode is RDL-2 (power swing condition). The performance of the IDNN is enhanced by using the threshold-based blocking approach. Based on the threshold value, the proposed method detects an appropriate condition of the system. The proposed method is implemented in the Western System Coordinating Council (WSCC) IEEE 9 bus system, and the results are validated in MATLAB/Simulink software. The overall accuracy of the proposed method is 97%. The proposed method provides rapid operation and detects the power swing condition to trip the distance relay. Full article
(This article belongs to the Special Issue Advanced Aspects of Computational Intelligence with Its Applications)
Show Figures

Figure 1

Figure 1
<p>The architecture of the proposed approach.</p>
Full article ">Figure 2
<p>Proposed IDNN Structure.</p>
Full article ">Figure 3
<p>Flow chart of the proposed method.</p>
Full article ">Figure 4
<p>WSCC 9 bus test system.</p>
Full article ">Figure 5
<p>Voltage and current flow under normal conditions at Bus 2.</p>
Full article ">Figure 6
<p>Analysis of (<b>a</b>) Bus 2 voltage and (<b>b</b>) Bus 2 current under power swing conditions.</p>
Full article ">Figure 7
<p>Analysis of (<b>a</b>) Bus 5 voltage and (<b>b</b>) Bus 5 current under power swing conditions.</p>
Full article ">Figure 8
<p>Analysis of (<b>a</b>) Bus 6 voltage and (<b>b</b>) Bus 6 current under power swing conditions.</p>
Full article ">Figure 9
<p>Analysis of (<b>a</b>) Bus 8 voltage and (<b>b</b>) Bus 8 current under power swing conditions.</p>
Full article ">Figure 10
<p>Comparison of AUC and ROC characteristics.</p>
Full article ">Figure 11
<p>Distance relay characteristics under power swing conditions.</p>
Full article ">Figure 12
<p>The training process of (<b>a</b>) June, (<b>b</b>) July, (<b>c</b>) August.</p>
Full article ">Figure 12 Cont.
<p>The training process of (<b>a</b>) June, (<b>b</b>) July, (<b>c</b>) August.</p>
Full article ">Figure 13
<p>Comparison of proposed and existing method response time.</p>
Full article ">
16 pages, 3135 KiB  
Article
Wind Speed Prediction via Collaborative Filtering on Virtual Edge Expanding Graphs
by Xiang Ying, Keke Zhao, Zhiqiang Liu, Jie Gao, Dongxiao He, Xuewei Li and Wei Xiong
Mathematics 2022, 10(11), 1943; https://doi.org/10.3390/math10111943 - 6 Jun 2022
Cited by 4 | Viewed by 1880
Abstract
Accurate and stable wind speed prediction is crucial for the safe operation of large-scale wind power grid connections. Existing methods are typically limited to a certain fixed area when learning the information of the wind speed sequence, which cannot make full use of [...] Read more.
Accurate and stable wind speed prediction is crucial for the safe operation of large-scale wind power grid connections. Existing methods are typically limited to a certain fixed area when learning the information of the wind speed sequence, which cannot make full use of the spatiotemporal correlation of the wind speed sequence. To address this problem, in this paper we propose a new wind speed prediction method based on collaborative filtering against a virtual edge expansion graph structure in which virtual edges enrich the semantics that the graph can express. It is an effective extension of the dataset, connecting wind turbines of different wind farms through virtual edges to ensure that the spatial correlation of wind speed sequences can be effectively learned and utilized. The new collaborative filtering on the graph is reflected in the processing of the wind speed sequence. The wind speed is preprocessed from the perspective of pattern mining to effectively integrate various information, and the k-d tree is used to match the wind speed sequence to achieve the purpose of collaborative filtering. Finally, a model with long short-term memory (LSTM) as the main body is constructed for wind speed prediction. By taking the wind speed of the actual wind farm as the research object, we compare the new approach with four typical wind speed prediction methods. The mean square error is reduced by 16.40%, 11.78%, 9.57%, and 18.36%, respectively, which demonstrates the superiority of the proposed new method. Full article
(This article belongs to the Special Issue Mathematics-Based Methods in Graph Machine Learning)
Show Figures

Figure 1

Figure 1
<p>A wind farm graph.</p>
Full article ">Figure 2
<p>Actual edge connection graph.</p>
Full article ">Figure 3
<p>Virtual edge expansion graph.</p>
Full article ">Figure 4
<p>Wind speed pattern curve.</p>
Full article ">Figure 5
<p>Results of collaborative filtering for wind speed patterns.</p>
Full article ">Figure 6
<p>LSTM network unit structure.</p>
Full article ">Figure 7
<p>Overall model structure.</p>
Full article ">Figure 8
<p>Curves of the Wind speed trend.</p>
Full article ">Figure 9
<p>Loss drop plot for the proposed model.</p>
Full article ">
18 pages, 1362 KiB  
Article
A Two-Step Data Normalization Approach for Improving Classification Accuracy in the Medical Diagnosis Domain
by Ivan Izonin, Roman Tkachenko, Nataliya Shakhovska, Bohdan Ilchyshyn and Krishna Kant Singh
Mathematics 2022, 10(11), 1942; https://doi.org/10.3390/math10111942 - 6 Jun 2022
Cited by 41 | Viewed by 6033
Abstract
Data normalization is a data preprocessing task and one of the first to be performed during intellectual analysis, particularly in the case of tabular data. The importance of its implementation is determined by the need to reduce the sensitivity of the artificial intelligence [...] Read more.
Data normalization is a data preprocessing task and one of the first to be performed during intellectual analysis, particularly in the case of tabular data. The importance of its implementation is determined by the need to reduce the sensitivity of the artificial intelligence model to the values of the features in the dataset to increase the studied model’s adequacy. This paper focuses on the problem of effectively preprocessing data to improve the accuracy of intellectual analysis in the case of performing medical diagnostic tasks. We developed a new two-step method for data normalization of numerical medical datasets. It is based on the possibility of considering both the interdependencies between the features of each observation from the dataset and their absolute values to improve the accuracy when performing medical data mining tasks. We describe and substantiate each step of the algorithmic implementation of the method. We also visualize the results of the proposed method. The proposed method was modeled using six different machine learning methods based on decision trees when performing binary and multiclass classification tasks. We used six real-world, freely available medical datasets with different numbers of vectors, attributes, and classes to conduct experiments. A comparison between the effectiveness of the developed method and that of five existing data normalization methods was carried out. It was experimentally established that the developed method increases the accuracy of the Decision Tree and Extra Trees Classifier by 1–5% in the case of performing the binary classification task and the accuracy of the Bagging, Decision Tree, and Extra Trees Classifier by 1–6% in the case of performing the multiclass classification task. Increasing the accuracy of these classifiers only by using the new data normalization method satisfies all the prerequisites for its application in practice when performing various medical data mining tasks. Full article
(This article belongs to the Special Issue Computational Approaches for Data Inspection in Biomedicine)
Show Figures

Figure 1

Figure 1
<p>Visualization of the results of two data normalization methods. (<b>a</b>) Vector Scaler; (<b>b</b>) Proposed Scaler.</p>
Full article ">Figure 2
<p>Accuracy scores for two machine learning methods used to perform binary classification tasks on three medical datasets using six data normalization methods.</p>
Full article ">Figure 3
<p>F1-scores for three machine learning methods used to perform multiclass classification tasks on three medical datasets using six data normalization methods.</p>
Full article ">
24 pages, 3361 KiB  
Article
Design and Operation of Multipurpose Production Facilities Using Solar Energy Sources for Heat Integration Sustainable Strategies
by Pedro Simão, Miguel Vieira, Telmo Pinto and Tânia Pinto-Varela
Mathematics 2022, 10(11), 1941; https://doi.org/10.3390/math10111941 - 6 Jun 2022
Viewed by 2003
Abstract
Industrial production facilities have been facing the requirement to optimise resource efficiency, while considering sustainable goals. This paper addresses the introduction of renewable energies in production by exploring the combined design and scheduling of a multipurpose batch facility, with innovative consideration of direct/indirect [...] Read more.
Industrial production facilities have been facing the requirement to optimise resource efficiency, while considering sustainable goals. This paper addresses the introduction of renewable energies in production by exploring the combined design and scheduling of a multipurpose batch facility, with innovative consideration of direct/indirect heat integration using a solar energy source for thermal energy storage. A mixed-integer linear programming model is formulated to support decisions on scheduling and design selection of storage and processing units, heat exchange components, collector systems, and energy storage units. The results show the minimisation of utilities consumption, with an increase in the operational profit using combined heat integration strategies for the production schedule. A set of illustrative case-study examples highlight the advantages of the solar-based heat storage integration, assessing optimal decision support in the strategic and operational management of these facilities. Full article
(This article belongs to the Special Issue Operations Research and Optimization)
Show Figures

Figure 1

Figure 1
<p>Direct heat integration representation.</p>
Full article ">Figure 2
<p>Thermal energy storage (TES) system and state-task network (STN) representation.</p>
Full article ">Figure 3
<p>STN representation of the products recipe.</p>
Full article ">Figure 4
<p>Optimal scheduling and batch processing solutions for scenarios (<b>a</b>,<b>b</b>).</p>
Full article ">Figure 5
<p>Energy profile for scenario (a).</p>
Full article ">Figure 6
<p>Energy profile for scenario (b).</p>
Full article ">Figure 7
<p>Scenario (b) TES1 temperature profile.</p>
Full article ">Figure 8
<p>Scenario (b) Solar collector efficiency.</p>
Full article ">Figure 9
<p>Plant topology for scenario (a).</p>
Full article ">Figure 10
<p>Plant topology for scenario (b).</p>
Full article ">Figure 11
<p>STN representation of the product recipe.</p>
Full article ">Figure 12
<p>Optimal scheduling and batch processing solution.</p>
Full article ">Figure 13
<p>Energy profile.</p>
Full article ">Figure 14
<p>TES1 (<b>a</b>) and TES2 (<b>b</b>) temperature profiles.</p>
Full article ">Figure 15
<p>Plant topology.</p>
Full article ">
17 pages, 803 KiB  
Article
Stability Results of Quadratic-Additive Functional Equation Based on Hyers Technique in Matrix Paranormed Spaces
by Kandhasamy Tamilvanan, Yahya Almalki, Syed Abdul Mohiuddine and Ravi P. Agarwal
Mathematics 2022, 10(11), 1940; https://doi.org/10.3390/math10111940 - 6 Jun 2022
Cited by 2 | Viewed by 1409
Abstract
In this work, we introduce a mixed type of quadratic-additive (QA) functional equation and obtain its general solution. The objective of this work is to investigate the Ulam–Hyers stability of this quadratic-additive (QA) functional equation in matrix paranormed spaces (briefly, MP spaces) using [...] Read more.
In this work, we introduce a mixed type of quadratic-additive (QA) functional equation and obtain its general solution. The objective of this work is to investigate the Ulam–Hyers stability of this quadratic-additive (QA) functional equation in matrix paranormed spaces (briefly, MP spaces) using the Hyers method for the factor sum of norms. Full article
(This article belongs to the Section Difference and Differential Equations)
19 pages, 333 KiB  
Article
Sharp Bounds of Hankel Determinant on Logarithmic Coefficients for Functions of Bounded Turning Associated with Petal-Shaped Domain
by Lei Shi, Muhammad Arif, Ayesha Rafiq, Muhammad Abbas and Javed Iqbal
Mathematics 2022, 10(11), 1939; https://doi.org/10.3390/math10111939 - 6 Jun 2022
Cited by 12 | Viewed by 1623
Abstract
The purpose of this article is to obtain the sharp estimates of the first four initial logarithmic coefficients for the class BTs of bounded turning functions associated with a petal-shaped domain. Further, we investigate the sharp estimate of Fekete-Szegö inequality, Zalcman inequality [...] Read more.
The purpose of this article is to obtain the sharp estimates of the first four initial logarithmic coefficients for the class BTs of bounded turning functions associated with a petal-shaped domain. Further, we investigate the sharp estimate of Fekete-Szegö inequality, Zalcman inequality on the logarithmic coefficients and the Hankel determinant H2,1Ff/2 and H2,2Ff/2 for the class BTs with the determinant entry of logarithmic coefficients. Full article
(This article belongs to the Special Issue Advances on Complex Analysis)
22 pages, 333 KiB  
Article
Stability of Quartic Functional Equation in Modular Spaces via Hyers and Fixed-Point Methods
by Syed Abdul Mohiuddine, Kandhasamy Tamilvanan, Mohammad Mursaleen and Trad Alotaibi
Mathematics 2022, 10(11), 1938; https://doi.org/10.3390/math10111938 - 6 Jun 2022
Cited by 6 | Viewed by 1799
Abstract
In this work, we introduce a new type of generalised quartic functional equation and obtain the general solution. We then investigate the stability results by using the Hyers method in modular space for quartic functional equations without using the Fatou property, without using [...] Read more.
In this work, we introduce a new type of generalised quartic functional equation and obtain the general solution. We then investigate the stability results by using the Hyers method in modular space for quartic functional equations without using the Fatou property, without using the Δb-condition and without using both the Δb-condition and the Fatou property. Moreover, we investigate the stability results for this functional equation with the help of a fixed-point technique involving the idea of the Fatou property in modular spaces. Furthermore, a suitable counter example is also demonstrated to prove the non-stability of a singular case. Full article
19 pages, 623 KiB  
Article
Estimation of Error Variance in Regularized Regression Models via Adaptive Lasso
by Xin Wang, Lingchen Kong and Liqun Wang
Mathematics 2022, 10(11), 1937; https://doi.org/10.3390/math10111937 - 6 Jun 2022
Cited by 5 | Viewed by 2710
Abstract
Estimation of error variance in a regression model is a fundamental problem in statistical modeling and inference. In high-dimensional linear models, variance estimation is a difficult problem, due to the issue of model selection. In this paper, we propose a novel approach for [...] Read more.
Estimation of error variance in a regression model is a fundamental problem in statistical modeling and inference. In high-dimensional linear models, variance estimation is a difficult problem, due to the issue of model selection. In this paper, we propose a novel approach for variance estimation that combines the reparameterization technique and the adaptive lasso, which is called the natural adaptive lasso. This method can, simultaneously, select and estimate the regression and variance parameters. Moreover, we show that the natural adaptive lasso, for regression parameters, is equivalent to the adaptive lasso. We establish the asymptotic properties of the natural adaptive lasso, for regression parameters, and derive the mean squared error bound for the variance estimator. Our theoretical results show that under appropriate regularity conditions, the natural adaptive lasso for error variance is closer to the so-called oracle estimator than some other existing methods. Finally, Monte Carlo simulations are presented, to demonstrate the superiority of the proposed method. Full article
(This article belongs to the Special Issue Statistical Methods for High-Dimensional and Massive Datasets)
Show Figures

Figure 1

Figure 1
<p>Boxplots of 100 RE values for five estimators, true <math display="inline"><semantics> <mrow> <msup> <mi>σ</mi> <mn>2</mn> </msup> <mo>=</mo> <mn>0.5</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 2
<p>Boxplots of 100 RE values for five estimators, true <math display="inline"><semantics> <mrow> <msup> <mi>σ</mi> <mn>2</mn> </msup> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math>.</p>
Full article ">
6 pages, 242 KiB  
Article
Solution Spaces Associated to Continuous or Numerical Models for Which Integrable Functions Are Bounded
by Brian Villegas-Villalpando, Jorge E. Macías-Díaz and Qin Sheng
Mathematics 2022, 10(11), 1936; https://doi.org/10.3390/math10111936 - 6 Jun 2022
Viewed by 1467
Abstract
Boundedness is an essential feature of the solutions for various mathematical and numerical models in the natural sciences, especially those systems in which linear or nonlinear preservation or stability features are fundamental. In those cases, the boundedness of the solutions outside a set [...] Read more.
Boundedness is an essential feature of the solutions for various mathematical and numerical models in the natural sciences, especially those systems in which linear or nonlinear preservation or stability features are fundamental. In those cases, the boundedness of the solutions outside a set of zero measures is not enough to guarantee that the solutions are physically relevant. In this note, we will establish a criterion for the boundedness of integrable solutions of general continuous and numerical systems. More precisely, we establish a characterization of those measures over arbitrary spaces for which real-valued integrable functions are necessarily bounded at every point of the domain. The main result states that the collection of measures for which all integrable functions are everywhere bounded are exactly all of those measures for which the infimum of the measures for nonempty sets is a positive extended real number. Full article
(This article belongs to the Special Issue Numerical Methods for Solving Differential Problems-II)
21 pages, 3629 KiB  
Article
Sliding Mode Control of Manipulator Based on Improved Reaching Law and Sliding Surface
by Peng Ji, Chenglong Li and Fengying Ma
Mathematics 2022, 10(11), 1935; https://doi.org/10.3390/math10111935 - 5 Jun 2022
Cited by 17 | Viewed by 3307
Abstract
Aiming at the problem of convergence speed and chattering in sliding mode variable structure control of manipulator, an improved exponential reaching law and nonlinear sliding surface are proposed, and the Lyapunov function is used to analyze its stability. According to the dynamic model [...] Read more.
Aiming at the problem of convergence speed and chattering in sliding mode variable structure control of manipulator, an improved exponential reaching law and nonlinear sliding surface are proposed, and the Lyapunov function is used to analyze its stability. According to the dynamic model of the 6-DOF UR5 manipulator and the proposed reaching law and sliding surface, the corresponding control scheme is designed. The control performance of the proposed control scheme is verified by tracking the end trajectory of the manipulator on the MATLAB and CoppeliaSim robot simulation platform. The experimental results show that the proposed control scheme can not only significantly improve the convergence speed and make the system converge quickly, but also can effectively reduce the chattering of the system. Even in the presence of disturbance signals, fast and stable tracking can be achieved while ensuring the robustness of the system, and the chattering of the robotic arm system can be weakened to a certain extent. Compared with the classical control method based on the computational torque method and the traditional sliding mode control scheme based on the exponential reaching law, the proposed scheme has certain advantages in terms of tracking accuracy, convergence speed, and reducing system chattering, and effectively improves the overall control performance of the system. Full article
(This article belongs to the Special Issue Control Problem of Nonlinear Systems with Applications)
Show Figures

Figure 1

Figure 1
<p>Schematic diagram of the sliding mode control system of the manipulator.</p>
Full article ">Figure 2
<p>Physical simulation model of the UR5 manipulator.</p>
Full article ">Figure 3
<p>Uniform circular trajectory tracking experiment without considering disturbance signal. (<b>a</b>) comparison of trajectory tracking for desired uniform circular trajectory with three control algorithms; (<b>b</b>) comparison of square root error of three control algorithms; (<b>c</b>) comparison of mean error and variance of three control algorithms.</p>
Full article ">Figure 4
<p>In the uniform circular trajectory experiment without considering disturbance signal, the expected position of each joint is compared with the position and error of each joint obtained by the three control algorithms.</p>
Full article ">Figure 5
<p>In the uniform circular trajectory experiment without considering disturbance signal, the output torque of each joint obtained by the three control algorithms is compared.</p>
Full article ">Figure 6
<p>Uniform circular trajectory tracking experiment with disturbance signal. (<b>a</b>) comparison of trajectory tracking for desired uniform circular trajectory with three control algorithms; (<b>b</b>) comparison of square root error of three control algorithms; (<b>c</b>) comparison of mean error and variance of three control algorithms.</p>
Full article ">Figure 7
<p>In the uniform circular trajectory experiment with disturbance signal, the expected position of each joint is compared with the position and error of each joint obtained by the three control algorithms.</p>
Full article ">Figure 8
<p>In the uniform circular trajectory experiment with disturbance signal, the output torque of each joint obtained by the three control algorithms is compared.</p>
Full article ">Figure 9
<p>Non-uniform circular trajectory tracking experiment without considering disturbance signal. (<b>a</b>) comparison of trajectory tracking for desired non-uniform circular trajectory with three control algorithms; (<b>b</b>) comparison of square root error of three control algorithms; (<b>c</b>) comparison of mean error and variance of three control algorithms.</p>
Full article ">Figure 10
<p>In the non-uniform circular trajectory experiment without considering disturbance signal, the expected position of each joint is compared with the position and error of each joint obtained by the three control algorithms.</p>
Full article ">Figure 11
<p>In the non-uniform circular trajectory experiment without considering disturbance signal, the output torque of each joint obtained by the three control algorithms is compared.</p>
Full article ">Figure 12
<p>Non-uniform square trajectory tracking experiment without considering disturbance signal. (<b>a</b>) comparison of trajectory tracking for desired non-uniform square trajectory with three control algorithms; (<b>b</b>) comparison of square root error of three control algorithms; (<b>c</b>) comparison of mean error and variance of three control algorithms.</p>
Full article ">Figure 13
<p>In the non-uniform square trajectory experiment without considering disturbance signal, the expected position of each joint is compared with the position and error of each joint obtained by the three control algorithms.</p>
Full article ">Figure 14
<p>In the non-uniform square trajectory experiment without considering disturbance signal, the output torque of each joint obtained by the three control algorithms is compared.</p>
Full article ">
10 pages, 3064 KiB  
Article
Deep Learning Approaches for the Segmentation of Glomeruli in Kidney Histopathological Images
by Giovanna Maria Dimitri, Paolo Andreini, Simone Bonechi, Monica Bianchini, Alessandro Mecocci, Franco Scarselli, Alberto Zacchi, Guido Garosi, Thomas Marcuzzo and Sergio Antonio Tripodi
Mathematics 2022, 10(11), 1934; https://doi.org/10.3390/math10111934 - 5 Jun 2022
Cited by 10 | Viewed by 2605
Abstract
Deep learning is widely applied in bioinformatics and biomedical imaging, due to its ability to perform various clinical tasks automatically and accurately. In particular, the application of deep learning techniques for the automatic identification of glomeruli in histopathological kidney images can play a [...] Read more.
Deep learning is widely applied in bioinformatics and biomedical imaging, due to its ability to perform various clinical tasks automatically and accurately. In particular, the application of deep learning techniques for the automatic identification of glomeruli in histopathological kidney images can play a fundamental role, offering a valid decision support system tool for the automatic evaluation of the Karpinski metric. This will help clinicians in detecting the presence of sclerotic glomeruli in order to decide whether the kidney is transplantable or not. In this work, we implemented a deep learning framework to identify and segment sclerotic and non-sclerotic glomeruli from scanned Whole Slide Images (WSIs) of human kidney biopsies. The experiments were conducted on a new dataset collected by both the Siena and Trieste hospitals. The images were segmented using the DeepLab V2 model, with a pre-trained ResNet101 encoder, applied to 512 × 512 patches extracted from the original WSIs. The results obtained are promising and show a good performance in the segmentation task and a good generalization capacity, despite the different coloring and typology of the histopathological images. Moreover, we present a novel use of the CD10 staining procedure, which gives promising results when applied to the segmentation of sclerotic glomeruli in kidney tissues. Full article
(This article belongs to the Special Issue Neural Networks and Learning Systems II)
Show Figures

Figure 1

Figure 1
<p>(<b>a</b>) Healthy glomerulus; (<b>b</b>) Sclerotic glomerulus. The image shown is one of the Masson-stained images collected in our novel dataset from the Siena Hospital.</p>
Full article ">Figure 2
<p>Segmentation performances obtained with 5-fold cross-validation on the non-sclerotic glomeruli in Masson-stained images.</p>
Full article ">Figure 3
<p>Segmentation performance obtained with 5-fold cross-validation on the non-sclerotic glomeruli in CD10-stained images.</p>
Full article ">Figure 4
<p>Segmentation performance obtained with 5-fold cross-validation on the sclerotic glomeruli in Masson-stained images.</p>
Full article ">Figure 5
<p>Segmentation performance obtained with 5-fold cross-validation on the sclerotic glomeruli in CD10-stained images.</p>
Full article ">Figure 6
<p>A patch of a Masson-stained image, its corresponding ground truth mask relative to non-sclerotic glomeruli and the related segmented output (IOU = 0.97 and DICE = 0.98).</p>
Full article ">Figure 7
<p>A patch of a CD10-stained image, its corresponding ground truth mask relative to sclerotic glomeruli and the related segmented output (IOU = 0.77 and DICE = 0.637).</p>
Full article ">
18 pages, 3645 KiB  
Article
Unsteady Separated Stagnation-Point Flow Past a Moving Plate with Suction Effect in Hybrid Nanofluid
by Nurul Amira Zainal, Roslinda Nazar, Kohilavani Naganthran and Ioan Pop
Mathematics 2022, 10(11), 1933; https://doi.org/10.3390/math10111933 - 5 Jun 2022
Cited by 3 | Viewed by 2295
Abstract
Previous research has shown that incorporating stagnation-point flow in diverse manufacturing industries is beneficial due to its importance in thermal potency. Consequently, this research investigates the thermophysical properties of the unsteady separated stagnation-point flow past a moving plate by utilising a dual-type nanoparticle, [...] Read more.
Previous research has shown that incorporating stagnation-point flow in diverse manufacturing industries is beneficial due to its importance in thermal potency. Consequently, this research investigates the thermophysical properties of the unsteady separated stagnation-point flow past a moving plate by utilising a dual-type nanoparticle, namely a hybrid nanofluid. The impact of suction imposition on the entire hydrodynamic flow and heat transfer as well as the growth of boundary layers was also taken into account. A new mathematical hybrid nanofluid model is developed, and similarity solutions are obtained in the form of ordinary differential equations (ODEs). The bvp4c approach in MATLAB determines the reduced ODEs estimated solutions. The results show that increasing the stagnation strength parameters expands the skin friction coefficient and heat transfer rate. The addition of the suction parameter also resulted in an augmentation of thermal conductivity. Interestingly, reducing the unsteadiness parameter proportionately promotes heat-transfer performance. This significant involvement is noticeable in advancing industrial development, specifically in the manufacturing industries and operations systems. Full article
(This article belongs to the Section Computational and Applied Mathematics)
Show Figures

Figure 1

Figure 1
<p>The geometrical coordinates and flow pattern.</p>
Full article ">Figure 2
<p>Trend of <math display="inline"><semantics> <mrow> <msup> <mi>f</mi> <mo>″</mo> </msup> <mrow> <mo>(</mo> <mn>0</mn> <mo>)</mo> </mrow> </mrow> </semantics></math> towards <math display="inline"><semantics> <mi>ε</mi> </semantics></math> by assorted <math display="inline"><semantics> <mi>ϕ</mi> </semantics></math>.</p>
Full article ">Figure 3
<p>Trend of <math display="inline"><semantics> <mrow> <mo>−</mo> <msup> <mi>θ</mi> <mo>′</mo> </msup> <mrow> <mo>(</mo> <mn>0</mn> <mo>)</mo> </mrow> </mrow> </semantics></math> towards <math display="inline"><semantics> <mi>ε</mi> </semantics></math> by assorted <math display="inline"><semantics> <mi>ϕ</mi> </semantics></math>.</p>
Full article ">Figure 4
<p>Trend of <math display="inline"><semantics> <mrow> <msup> <mi>f</mi> <mo>″</mo> </msup> <mrow> <mo>(</mo> <mn>0</mn> <mo>)</mo> </mrow> </mrow> </semantics></math> towards <math display="inline"><semantics> <mi>ε</mi> </semantics></math> by assorted <math display="inline"><semantics> <mi>S</mi> </semantics></math>.</p>
Full article ">Figure 5
<p>Trend of <math display="inline"><semantics> <mrow> <mo>−</mo> <msup> <mi>θ</mi> <mo>′</mo> </msup> <mrow> <mo>(</mo> <mn>0</mn> <mo>)</mo> </mrow> </mrow> </semantics></math> towards <math display="inline"><semantics> <mi>ε</mi> </semantics></math> by assorted <math display="inline"><semantics> <mi>S</mi> </semantics></math>.</p>
Full article ">Figure 6
<p>Velocity profile <math display="inline"><semantics> <mrow> <msup> <mi>f</mi> <mo>′</mo> </msup> <mrow> <mo>(</mo> <mi>η</mi> <mo>)</mo> </mrow> </mrow> </semantics></math> towards <math display="inline"><semantics> <mi>η</mi> </semantics></math> by assorted <math display="inline"><semantics> <mi>S</mi> </semantics></math>.</p>
Full article ">Figure 7
<p>Temperature distribution <math display="inline"><semantics> <mrow> <mi>θ</mi> <mrow> <mo>(</mo> <mi>η</mi> <mo>)</mo> </mrow> </mrow> </semantics></math> towards <math display="inline"><semantics> <mi>η</mi> </semantics></math> by assorted <math display="inline"><semantics> <mi>S</mi> </semantics></math>.</p>
Full article ">Figure 8
<p>Trend of <math display="inline"><semantics> <mrow> <msup> <mi>f</mi> <mo>″</mo> </msup> <mrow> <mo>(</mo> <mn>0</mn> <mo>)</mo> </mrow> </mrow> </semantics></math> towards <math display="inline"><semantics> <mi>ε</mi> </semantics></math> by assorted <math display="inline"><semantics> <mi>ξ</mi> </semantics></math>.</p>
Full article ">Figure 9
<p>Trend of <math display="inline"><semantics> <mrow> <mo>−</mo> <msup> <mi>θ</mi> <mo>′</mo> </msup> <mrow> <mo>(</mo> <mn>0</mn> <mo>)</mo> </mrow> </mrow> </semantics></math> towards <math display="inline"><semantics> <mi>ε</mi> </semantics></math> by assorted <math display="inline"><semantics> <mi>ξ</mi> </semantics></math>.</p>
Full article ">Figure 10
<p>Trend of <math display="inline"><semantics> <mrow> <msup> <mi>f</mi> <mo>″</mo> </msup> <mrow> <mo>(</mo> <mn>0</mn> <mo>)</mo> </mrow> </mrow> </semantics></math> towards <math display="inline"><semantics> <mi>ε</mi> </semantics></math> by assorted <math display="inline"><semantics> <mi>α</mi> </semantics></math>.</p>
Full article ">Figure 11
<p>Trend of <math display="inline"><semantics> <mrow> <mo>−</mo> <msup> <mi>θ</mi> <mo>′</mo> </msup> <mrow> <mo>(</mo> <mn>0</mn> <mo>)</mo> </mrow> </mrow> </semantics></math> towards <math display="inline"><semantics> <mi>ε</mi> </semantics></math> by assorted <math display="inline"><semantics> <mi>α</mi> </semantics></math>.</p>
Full article ">
15 pages, 10771 KiB  
Article
Wave Loss: A Topographic Metric for Image Segmentation
by Ákos Kovács, Jalal Al-Afandi, Csaba Botos and András Horváth
Mathematics 2022, 10(11), 1932; https://doi.org/10.3390/math10111932 - 4 Jun 2022
Viewed by 2252
Abstract
The solution of segmentation problems with deep neural networks requires a well-defined loss function for comparison and network training. In most network training approaches, only area-based differences that are of differing pixel matter are considered; the distribution is not. Our brain can compare [...] Read more.
The solution of segmentation problems with deep neural networks requires a well-defined loss function for comparison and network training. In most network training approaches, only area-based differences that are of differing pixel matter are considered; the distribution is not. Our brain can compare complex objects with ease and considers both pixel level and topological differences simultaneously and comparison between objects requires a properly defined metric that determines similarity between them considering changes both in shape and values. In past years, topographic aspects were incorporated in loss functions where either boundary pixels or the ratio of the areas were employed in difference calculation. In this paper we will show how the application of a topographic metric, called wave loss, can be applied in neural network training and increase the accuracy of traditional segmentation algorithms. Our method has increased segmentation accuracy by 3% on both the Cityscapes and Ms-Coco datasets, using various network architectures. Full article
(This article belongs to the Special Issue Neural Networks and Learning Systems II)
Show Figures

Figure 1

Figure 1
<p>Two images and a reference image with the same Hamming distances but different topology; (<b>a</b>) compared image 1; (<b>b</b>) reference image; (<b>c</b>) compared image 2.</p>
Full article ">Figure 2
<p>Three images with the same Hausdorff distances but different topology; (<b>a</b>) compared image 1; (<b>b</b>) reference image; (<b>c</b>) compared image 2.</p>
Full article ">Figure 3
<p>Illustration of the wave propagation; (<b>a</b>) input A; (<b>b</b>) input B; (<b>c</b>) intersection; (<b>d</b>) union; (<b>e</b>) wave 100 iterations; (<b>f</b>) wave 150 iterations; (<b>g</b>) wave 300 iterations; (<b>h</b>) wave unreached regions.</p>
Full article ">Figure 4
<p>The propagation of the wave during the calculation of wave loss.</p>
Full article ">Figure 5
<p>Example images from the CLEVR dataset; (<b>a</b>) input Image; (<b>b</b>) segmentation mask; (<b>c</b>) instance mask; (<b>d</b>) occlusion mask.</p>
Full article ">Figure 6
<p>Losses on the CLEVR dataset averaged out on 20 independent runs; (<b>a</b>) L1 loss; (<b>b</b>) wave loss.</p>
Full article ">Figure 6 Cont.
<p>Losses on the CLEVR dataset averaged out on 20 independent runs; (<b>a</b>) L1 loss; (<b>b</b>) wave loss.</p>
Full article ">Figure 7
<p>Example images at different iterations from the CLEVR dataset; (<b>a</b>) input; (<b>b</b>) seg. 200; (<b>c</b>) input; (<b>d</b>) seg. 200; (<b>e</b>) input; (<b>f</b>) seg. 400; (<b>g</b>) input; (<b>h</b>) seg. 400; (<b>i</b>) input; (<b>j</b>) seg. 600; (<b>k</b>) input; (<b>l</b>) seg. 600; (<b>m</b>) input; (<b>n</b>) seg. 1000; (<b>o</b>) input; (<b>p</b>) seg. 1000.</p>
Full article ">Figure 8
<p>Example results on the COCO dataset segmented with Mask-RCNN; (<b>a</b>) cross entropy loss; (<b>b</b>) wave loss.</p>
Full article ">
15 pages, 2668 KiB  
Article
Agglomeration Regimes of Particles under a Linear Laminar Flow: A Numerical Study
by Yunzhou Qian, Shane P. Usher, Peter J. Scales, Anthony D. Stickland and Alessio Alexiadis
Mathematics 2022, 10(11), 1931; https://doi.org/10.3390/math10111931 - 4 Jun 2022
Cited by 3 | Viewed by 2642
Abstract
In this work, a combined smoothed particle hydrodynamics and discrete element method (SPH-DEM) model was proposed to model particle agglomeration in a shear flow. The fluid was modeled with the SPH method and the solid particles with DEM. The system was governed by [...] Read more.
In this work, a combined smoothed particle hydrodynamics and discrete element method (SPH-DEM) model was proposed to model particle agglomeration in a shear flow. The fluid was modeled with the SPH method and the solid particles with DEM. The system was governed by three fundamental dimensionless groups: the Reynolds number Re (1.5~150), which measured the effect of the hydrodynamics; the adhesion number Ad (6 × 10−5~6 × 10−3), which measured the inter-particle attraction; and the solid fraction α, which measured the concentration of particles. Based on these three dimensionless groups, several agglomeration regimes were found. Within these regimes, the aggregates could have different sizes and shapes that went from long thread-like structures to compact spheroids. The effect of the particle–particle interaction model was also investigated. The results were combined into ‘agglomeration maps’ that allowed for a quick determination of the agglomerate type once α, Re, Ad were known. Full article
(This article belongs to the Special Issue Computational Fluid Dynamics II)
Show Figures

Figure 1

Figure 1
<p>Geometry of the system and initial status (time = 0). Four particle types are coloured. The top wall (yellow, constant velocity <span class="html-italic">U</span> along x direction) and bottom wall (blue, stationary) generated a simple shear flow. Solid particles (red) were randomly located within the fluid (green) domain based on their volume fractions.</p>
Full article ">Figure 2
<p>The evolution of average aggregate size with different fluid resolutions (initial distance between fluid particles, <span class="html-italic">sc</span>; the ratio between the number of solid and liquid particles). The average number of particles per aggregate <math display="inline"><semantics> <mrow> <msub> <mrow> <mo>〈</mo> <mi>n</mi> <mo>〉</mo> </mrow> <mi>t</mi> </msub> </mrow> </semantics></math> and time <span class="html-italic">t</span> along axes were both dimensionless. The unit of <span class="html-italic">t</span> in the x axis is the number of frames for visualization using Ovito software. Here, 600 frames at the end of simulation corresponded to 60 s.</p>
Full article ">Figure 3
<p>Steady−state structures of solid particle aggregates in the <span class="html-italic">x</span>−<span class="html-italic">y</span> plane side view (length along <span class="html-italic">x</span> and <span class="html-italic">y</span> directions: W (75 mm) × H (200 mm)) at a solid particle volume fraction of 4.2% for different Reynolds numbers and adhesion numbers.</p>
Full article ">Figure 4
<p>Agglomeration regime map. Phase diagram illustrating the observed cases as a function of the Reynolds and adhesion numbers at a solid particle volume fraction 4.2%.</p>
Full article ">Figure 5
<p>Agglomeration regime map. Phase diagram illustrating the observed cases as a function of the Reynolds and adhesion numbers at <span class="html-italic">α</span> = 2.4%. The simulation results of solid volume fraction at <span class="html-italic">α</span> = <math display="inline"><semantics> <mrow> <mn>1.2</mn> <mo>%</mo> </mrow> </semantics></math> and <span class="html-italic">α</span> = <math display="inline"><semantics> <mrow> <mn>2.4</mn> <mo>%</mo> </mrow> </semantics></math> were similar. For simplicity and to avoid repeated comparisons, here we only compared simulation results at <span class="html-italic">α</span> = <math display="inline"><semantics> <mrow> <mn>2.4</mn> <mo>%</mo> </mrow> </semantics></math> and <span class="html-italic">α</span> = <math display="inline"><semantics> <mrow> <mn>4.2</mn> <mo>%</mo> </mrow> </semantics></math> in order to investigate the effect of <span class="html-italic">α</span>.</p>
Full article ">Figure 6
<p>Agglomeration regime map for the DMT model. Phase diagram illustrating the observed cases as a function of the Reynolds and adhesion numbers at a solid particle volume fraction 4.2%.</p>
Full article ">
16 pages, 1611 KiB  
Article
Relational Structure-Aware Knowledge Graph Representation in Complex Space
by Ke Sun, Shuo Yu, Ciyuan Peng, Yueru Wang, Osama Alfarraj, Amr Tolba and Feng Xia
Mathematics 2022, 10(11), 1930; https://doi.org/10.3390/math10111930 - 4 Jun 2022
Cited by 3 | Viewed by 3023
Abstract
Relations in knowledge graphs have rich relational structures and various binary relational patterns. Various relation modelling strategies are proposed for embedding knowledge graphs, but they fail to fully capture both features of relations, rich relational structures and various binary relational patterns. To address [...] Read more.
Relations in knowledge graphs have rich relational structures and various binary relational patterns. Various relation modelling strategies are proposed for embedding knowledge graphs, but they fail to fully capture both features of relations, rich relational structures and various binary relational patterns. To address the problem of insufficient embedding due to the complexity of the relations, we propose a novel knowledge graph representation model in complex space, namely MARS, to exploit complex relations to embed knowledge graphs. MARS takes the mechanisms of complex numbers and message-passing and then embeds triplets into relation-specific complex hyperplanes. Thus, MARS can well preserve various relation patterns, as well as structural information in knowledge graphs. In addition, we find that the scores generated from the score function approximate a Gaussian distribution. The scores in the tail cannot effectively represent triplets. To address this particular issue and improve the precision of embeddings, we use the standard deviation to limit the dispersion of the score distribution, resulting in more accurate embeddings of triplets. Comprehensive experiments on multiple benchmarks demonstrate that our model significantly outperforms existing state-of-the-art models for link prediction and triple classification. Full article
(This article belongs to the Special Issue New Trends in Graph and Complexity Based Data Analysis and Processing)
Show Figures

Figure 1

Figure 1
<p>An illustration of complex relations in knowledge graphs. Different colours of solid arrows (r) between entities represent different relations. The dashed arrows represent the predictable relations.</p>
Full article ">Figure 2
<p>Score distributions of positive triplets.</p>
Full article ">Figure 3
<p>The framework of MARS.</p>
Full article ">Figure 4
<p>Visualisation of entity feature vectors. The two figures in the first and second quadrants are the visualisations of the vectors obtained by MARS. The two figures in the third and fourth quadrants are visualisations of the vectors obtained by RotatE. The heat maps are used to visualise embedding matrices, where the vertical axis represents nodes and the horizontal axis represents the values corresponding to different dimensions.</p>
Full article ">
24 pages, 1978 KiB  
Article
Binary Aquila Optimizer for Selecting Effective Features from Medical Data: A COVID-19 Case Study
by Mohammad H. Nadimi-Shahraki, Shokooh Taghian, Seyedali Mirjalili and Laith Abualigah
Mathematics 2022, 10(11), 1929; https://doi.org/10.3390/math10111929 - 4 Jun 2022
Cited by 50 | Viewed by 3205
Abstract
Medical technological advancements have led to the creation of various large datasets with numerous attributes. The presence of redundant and irrelevant features in datasets negatively influences algorithms and leads to decreases in the performance of the algorithms. Using effective features in data mining [...] Read more.
Medical technological advancements have led to the creation of various large datasets with numerous attributes. The presence of redundant and irrelevant features in datasets negatively influences algorithms and leads to decreases in the performance of the algorithms. Using effective features in data mining and analyzing tasks such as classification can increase the accuracy of the results and relevant decisions made by decision-makers using them. This increase can become more acute when dealing with challenging, large-scale problems in medical applications. Nature-inspired metaheuristics show superior performance in finding optimal feature subsets in the literature. As a seminal attempt, a wrapper feature selection approach is presented on the basis of the newly proposed Aquila optimizer (AO) in this work. In this regard, the wrapper approach uses AO as a search algorithm in order to discover the most effective feature subset. S-shaped binary Aquila optimizer (SBAO) and V-shaped binary Aquila optimizer (VBAO) are two binary algorithms suggested for feature selection in medical datasets. Binary position vectors are generated utilizing S- and V-shaped transfer functions while the search space stays continuous. The suggested algorithms are compared to six recent binary optimization algorithms on seven benchmark medical datasets. In comparison to the comparative algorithms, the gained results demonstrate that using both proposed BAO variants can improve the classification accuracy on these medical datasets. The proposed algorithm is also tested on the real-dataset COVID-19. The findings testified that SBAO outperforms comparative algorithms regarding the least number of selected features with the highest accuracy. Full article
Show Figures

Figure 1

Figure 1
<p>S-shaped and V-shaped transfer functions.</p>
Full article ">Figure 2
<p>Average accuracy gained by BAO and comparative algorithms.</p>
Full article ">Figure 3
<p>The Number of selected features comparison on small datasets.</p>
Full article ">Figure 4
<p>The Number of selected features comparison on large datasets.</p>
Full article ">Figure 5
<p>The convergence curves of BAO and comparative algorithms on all datasets.</p>
Full article ">Figure 5 Cont.
<p>The convergence curves of BAO and comparative algorithms on all datasets.</p>
Full article ">Figure 6
<p>Accuracy gained by BAO and comparative algorithms.</p>
Full article ">Figure 7
<p>The number of selected features gained by BAO and comparative algorithms.</p>
Full article ">
22 pages, 929 KiB  
Article
Novel Methods for the Global Synchronization of the Complex Dynamical Networks with Fractional-Order Chaotic Nodes
by Yifan Zhang, Tianzeng Li, Zhiming Zhang and Yu Wang
Mathematics 2022, 10(11), 1928; https://doi.org/10.3390/math10111928 - 4 Jun 2022
Viewed by 1655
Abstract
The global synchronization of complex networks with fractional-order chaotic nodes is investigated via a simple Lyapunov function and the feedback controller in this paper. Firstly, the GMMP method is proposed to obtain the numerical solution of the fractional-order nonlinear equation based on the [...] Read more.
The global synchronization of complex networks with fractional-order chaotic nodes is investigated via a simple Lyapunov function and the feedback controller in this paper. Firstly, the GMMP method is proposed to obtain the numerical solution of the fractional-order nonlinear equation based on the relation of the fractional derivatives. Then, the new feedback controllers are proposed to achieve synchronization between the complex networks with the fractional-order chaotic nodes based on feedback control. We propose some new sufficient synchronous criteria based on the Lyapunov stability and a simple Lyapunov function. By the numerical simulations of the complex networks, we find that these synchronous criteria can apply to the arbitrary complex dynamical networks with arbitrary fractional-order chaotic nodes. Numerical simulations of synchronization between two complex dynamical networks with the fractional-order chaotic nodes are given by the GMMP method and the Newton method, and the results of numerical simulation demonstrate that the proposed method is universal and effective. Full article
(This article belongs to the Topic Complex Systems and Network Science)
Show Figures

Figure 1

Figure 1
<p>The three-dimensional phase orbits for fractional order chaotic Liu system with the order <math display="inline"><semantics> <mrow> <mi>β</mi> <mo>=</mo> <mn>0.95</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 2
<p>Trajectories of synchronization errors <math display="inline"><semantics> <mrow> <msub> <mi>e</mi> <mrow> <mi>j</mi> <mn>1</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>1</mn> <mo>≤</mo> <mi>j</mi> <mo>≤</mo> <mn>8</mn> <mo>)</mo> </mrow> </mrow> </semantics></math> for the complex networks (<a href="#FD70-mathematics-10-01928" class="html-disp-formula">70</a>) and (<a href="#FD73-mathematics-10-01928" class="html-disp-formula">73</a>) with eight fractional order nodes with time variance.</p>
Full article ">Figure 3
<p>Trajectories of synchronization errors <math display="inline"><semantics> <mrow> <msub> <mi>e</mi> <mrow> <mi>j</mi> <mn>2</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>1</mn> <mo>≤</mo> <mi>j</mi> <mo>≤</mo> <mn>8</mn> <mo>)</mo> </mrow> </mrow> </semantics></math> for the complex networks (<a href="#FD70-mathematics-10-01928" class="html-disp-formula">70</a>) and (<a href="#FD73-mathematics-10-01928" class="html-disp-formula">73</a>) with eight fractional order nodes with time variance.</p>
Full article ">Figure 4
<p>Trajectories of synchronization errors <math display="inline"><semantics> <mrow> <msub> <mi>e</mi> <mrow> <mi>j</mi> <mn>3</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>1</mn> <mo>≤</mo> <mi>j</mi> <mo>≤</mo> <mn>8</mn> <mo>)</mo> </mrow> </mrow> </semantics></math> for the complex networks (<a href="#FD70-mathematics-10-01928" class="html-disp-formula">70</a>) and (<a href="#FD73-mathematics-10-01928" class="html-disp-formula">73</a>) with eight fractional order nodes with time variance.</p>
Full article ">Figure 5
<p>Trajectories of total synchronization errors <math display="inline"><semantics> <mrow> <mi>E</mi> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </semantics></math> for the complex networks (<a href="#FD70-mathematics-10-01928" class="html-disp-formula">70</a>) and (<a href="#FD73-mathematics-10-01928" class="html-disp-formula">73</a>) with eight fractional order nodes with time variance.</p>
Full article ">Figure 6
<p>Trajectories of synchronization errors <math display="inline"><semantics> <mrow> <msub> <mi>e</mi> <mrow> <mi>j</mi> <mn>1</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>1</mn> <mo>≤</mo> <mi>j</mi> <mo>≤</mo> <mn>10</mn> <mo>)</mo> </mrow> </mrow> </semantics></math> for the complex networks (<a href="#FD77-mathematics-10-01928" class="html-disp-formula">77</a>) and (<a href="#FD80-mathematics-10-01928" class="html-disp-formula">80</a>) with 10 fractional order nodes with time variance.</p>
Full article ">Figure 7
<p>Trajectories of synchronization errors <math display="inline"><semantics> <mrow> <msub> <mi>e</mi> <mrow> <mi>j</mi> <mn>2</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>1</mn> <mo>≤</mo> <mi>j</mi> <mo>≤</mo> <mn>10</mn> <mo>)</mo> </mrow> </mrow> </semantics></math> for the complex networks (<a href="#FD77-mathematics-10-01928" class="html-disp-formula">77</a>) and (<a href="#FD80-mathematics-10-01928" class="html-disp-formula">80</a>) with 10 fractional order nodes with time variance.</p>
Full article ">Figure 8
<p>Trajectories of synchronization errors <math display="inline"><semantics> <mrow> <msub> <mi>e</mi> <mrow> <mi>j</mi> <mn>3</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>1</mn> <mo>≤</mo> <mi>j</mi> <mo>≤</mo> <mn>10</mn> <mo>)</mo> </mrow> </mrow> </semantics></math> for the complex networks (<a href="#FD77-mathematics-10-01928" class="html-disp-formula">77</a>) and (<a href="#FD80-mathematics-10-01928" class="html-disp-formula">80</a>) with 10 fractional order nodes with time variance.</p>
Full article ">Figure 9
<p>Trajectories of total synchronization error <math display="inline"><semantics> <mrow> <mi>E</mi> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </semantics></math> for the complex networks (<a href="#FD77-mathematics-10-01928" class="html-disp-formula">77</a>) and (<a href="#FD80-mathematics-10-01928" class="html-disp-formula">80</a>) with 10 fractional order nodes with time variance.</p>
Full article ">
15 pages, 1324 KiB  
Article
An Active Learning Algorithm Based on the Distribution Principle of Bhattacharyya Distance
by He Xu, Chunyue Ding, Peng Li and Yimu Ji
Mathematics 2022, 10(11), 1927; https://doi.org/10.3390/math10111927 - 4 Jun 2022
Cited by 1 | Viewed by 1804
Abstract
Active learning is a method that can actively select examples with much information from a large number of unlabeled samples to query labeled by experts, so as to obtain a high-precision classifier with a small number of samples. Most of the current research [...] Read more.
Active learning is a method that can actively select examples with much information from a large number of unlabeled samples to query labeled by experts, so as to obtain a high-precision classifier with a small number of samples. Most of the current research uses the basic principles to optimize the classifier at each iteration, but the batch query with the largest amount of information in each round does not represent the overall distribution of the sample, that is, it may fall into partial optimization and ignore the whole, which will may affect or reduce its accuracy. In order to solve this problem, a special distance measurement method—Bhattacharyya Distance—is used in this paper. By using this distance and designing a new set of query decision logic, we can improve the accuracy of the model. Our method embodies the query of the samples with the most representative distribution and the largest amount of information to realize the classification task based on a small number of samples. We perform theoretical proofs and experimental analysis. Finally, we use different data sets and compare them with other classification algorithms to evaluate the performance and efficiency of our algorithm. Full article
(This article belongs to the Topic Machine and Deep Learning)
Show Figures

Figure 1

Figure 1
<p>The comparison of different performance on different datasets, and it can be seen that the active learning algorithm with Bhattacharyya distance as the measurement still maintains a high learning accuracy, and shows a high-speed upward trend as the number of query samples increases.</p>
Full article ">Figure 2
<p>Performance on different datasets with query size = 30; it can be seen that, in the case of a single query, although the start is relatively slow, it can quickly improve in most data sets. In addition, it performs better than most data sets. These situations show that active learning with Bhattacharyya distance as a measure is superior in comparison with the same type of active learning. However, there are still relatively unstable situations in some data sets, indicating that the algorithm may need further optimization in specific occasions.</p>
Full article ">Figure 2 Cont.
<p>Performance on different datasets with query size = 30; it can be seen that, in the case of a single query, although the start is relatively slow, it can quickly improve in most data sets. In addition, it performs better than most data sets. These situations show that active learning with Bhattacharyya distance as a measure is superior in comparison with the same type of active learning. However, there are still relatively unstable situations in some data sets, indicating that the algorithm may need further optimization in specific occasions.</p>
Full article ">Figure 3
<p>Performance comparison on the German dataset, compared with single active learning; batch active learning is more efficient while maintaining higher accuracy.</p>
Full article ">Figure 4
<p>Performance comparison on the Pima dataset, and it can be found that, when batch_size = 5, the performance is the best, and the rising trend of accuracy improvement is also the most obvious, which is suitable for the application of actual scenes.</p>
Full article ">Figure 5
<p>Performance comparison about different parameters on German dataset.</p>
Full article ">Figure 6
<p>Performance comparison about different parameters on Breast dataset.</p>
Full article ">
22 pages, 2685 KiB  
Article
Analysis of Dipolar Sources in the Solution of the Electroencephalographic Inverse Problem
by María Monserrat Morín-Castillo, Jesús Arriaga-Hernández, Bolivia Cuevas-Otahola and José Jacobo Oliveros-Oliveros
Mathematics 2022, 10(11), 1926; https://doi.org/10.3390/math10111926 - 4 Jun 2022
Cited by 5 | Viewed by 2033
Abstract
In this work, we propose a solution to the problem of identification of sources in the brain from measurements of the electrical potential, recorded on the scalp EEG (electroencephalogram), where boundary problems are used to model the skull, brain region, and scalp, solving [...] Read more.
In this work, we propose a solution to the problem of identification of sources in the brain from measurements of the electrical potential, recorded on the scalp EEG (electroencephalogram), where boundary problems are used to model the skull, brain region, and scalp, solving the inverse problem from the EEG measurements, the so-called Electroencephalographic Inverse Problem (EIP), which is ill-posed in the Hadamard sense since the problem has numerical instability. We focus on the identification of volumetric dipolar sources of the EEG by constructing and modeling a simplification to reduce the multilayer conductive medium (two layers or regions Ω1 and Ω2) to a problem of a single layer of a homogeneous medium with a null Neumann condition on the boundary. For this simplification purpose, we consider the Cauchy problem to be solved at each time. We compare the results we obtained solving the multiple layers problem with those obtained by our simplification proposal. In both cases, we solve the direct and inverse problems for two different sources, as synthetic results for dipolar sources resembling epileptic foci, and a similar case with an external stimulus (intense light, skin stimuli, sleep problems, etc). For the inverse problem, we use the Tikhonov regularization method to handle its numerical instability. Additionally, we build an algorithm to solve both models (multiple layers problem and our simplification) in time, showing optimization of the problem when considering 128 divisions in the time interval [0,1] s, solving the inverse problem at each time (interval division) and comparing the recovered source with the initial one in the algorithm. We observed a significant decrease in the computation times when simplifying the numerical calculations, resulting in a decrease up to 50% in the execution times, between the EIP multilayer model and our simplification proposal, to a single layer homogeneous problem of a homogeneous medium, which translates into a numerical efficiency in this type of problem. Full article
(This article belongs to the Topic Mathematical Modeling in Physical Sciences)
Show Figures

Figure 1

Figure 1
<p>(<b>a</b>) 3D model of a human head; (<b>b</b>) cut in the skull and scalp in the upper-frontal left region to show the frontal and parietal brain lobes; (<b>c</b>) rotation of the cut in (<b>b</b>); (<b>d</b>) transversal cut in (<b>c</b>) to show the inner region of the brain. The skull and scalp are shown as interfaces; (<b>e</b>) profile of (<b>d</b>). (<b>f</b>) The same as (<b>e</b>), contrasting the skull and scalp in white; (<b>g</b>) rotation of (<b>f</b>) showing in red a region in the inner brain zone representing an anomaly; (<b>h</b>) the same as (<b>g</b>), showing the whole brain. We indicate in red a possible anomaly in the brain surface. (<b>i</b>) mesh of the brain, similar to a 3D mesh for applying certain types of numerical methods.</p>
Full article ">Figure 2
<p>(<b>a</b>) 3D model in <a href="#mathematics-10-01926-f001" class="html-fig">Figure 1</a>e; (<b>b</b>) 3D model showing the scalp and skull as a single region (region 2) in a light-tone color (similar to white); (<b>c</b>) two different regions 1 and 2, with different conductivities <math display="inline"><semantics> <msub> <mi>σ</mi> <mn>1</mn> </msub> </semantics></math> and <math display="inline"><semantics> <msub> <mi>σ</mi> <mn>2</mn> </msub> </semantics></math>, and outer regions <math display="inline"><semantics> <msub> <mi>S</mi> <mn>1</mn> </msub> </semantics></math> and <math display="inline"><semantics> <msub> <mi>S</mi> <mn>2</mn> </msub> </semantics></math>, respectively, for the regions <math display="inline"><semantics> <msub> <mo>Ω</mo> <mn>1</mn> </msub> </semantics></math> and <math display="inline"><semantics> <msub> <mo>Ω</mo> <mn>2</mn> </msub> </semantics></math>.</p>
Full article ">Figure 3
<p>(<b>a</b>) Two regions model in <a href="#mathematics-10-01926-f002" class="html-fig">Figure 2</a>c chosen for representation with two simple regions; (<b>b</b>) 2D representation of the model in (<b>a</b>) with two concentric circles representing regions 1 and 2; (<b>c</b>) 3D representation of the model in (<b>a</b>) with concentric spheres.</p>
Full article ">Figure 4
<p>Algorithm of the proposal in this work, for optimizing the computation times by simplifying the direct problem having an inverse problem solution that allows us to determine the source function and the solution at different times. The algorithm is iterative, with <span class="html-italic">i</span> the number of iterations, depending on the number of points or divisions equal to 64, 128, 256, 512 in the time interval <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mo>[</mo> <mn>0</mn> <mo>,</mo> <mn>1</mn> <mo>]</mo> </mrow> </semantics></math>. The comparison was performed according to the COMSOL problem construction to generate the Matlab code, starting from the geometry construction, the regions or region (due to the problem simplification), boundary conditions, and the mesh quantification in the finite element method.</p>
Full article ">Figure 5
<p>Solution of the problem described in Equations (<a href="#FD21-mathematics-10-01926" class="html-disp-formula">21</a>) and (<a href="#FD22-mathematics-10-01926" class="html-disp-formula">22</a>) for the 2D (<b>a</b>) and 3D (<b>b</b>) cases. The solution of the original boundary problem for two regions described in Equations (<a href="#FD4-mathematics-10-01926" class="html-disp-formula">4</a>)–(<a href="#FD8-mathematics-10-01926" class="html-disp-formula">8</a>) for the 2D (<b>e</b>) and 3D (<b>f</b>) cases for a single time (at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math> seg). We simulate the problem in time to obtain a solution (in Matlab) to <math display="inline"><semantics> <mrow> <mover accent="true"> <mi>u</mi> <mo>^</mo> </mover> <msub> <mo>∣</mo> <mrow> <mo>Ω</mo> <mfenced open="(" close=")"> <mi>z</mi> </mfenced> </mrow> </msub> </mrow> </semantics></math><math display="inline"><semantics> <mrow> <mi>z</mi> <mo>=</mo> <mi>x</mi> </mrow> </semantics></math> in <a href="#mathematics-10-01926-f005" class="html-fig">Figure 5</a>c and <math display="inline"><semantics> <mrow> <mi>z</mi> <mo>=</mo> <mo>−</mo> <mi>x</mi> </mrow> </semantics></math> in <a href="#mathematics-10-01926-f005" class="html-fig">Figure 5</a>g. Solution of the direct problem (Matlab) for the 3D case of region 1, <math display="inline"><semantics> <mrow> <mover accent="true"> <mi>u</mi> <mo>^</mo> </mover> <msub> <mo>∣</mo> <mrow> <mo>Ω</mo> <mfenced open="(" close=")"> <mi>z</mi> </mfenced> </mrow> </msub> </mrow> </semantics></math>, with <math display="inline"><semantics> <mrow> <mi>z</mi> <mo>=</mo> <mi>y</mi> </mrow> </semantics></math> in (<b>d</b>), with <math display="inline"><semantics> <mrow> <mi>z</mi> <mo>=</mo> <mo>−</mo> <mi>y</mi> </mrow> </semantics></math> in (<b>h</b>), with <math display="inline"><semantics> <mrow> <mi>z</mi> <mo>=</mo> <mi>x</mi> </mrow> </semantics></math> in (<b>c</b>), and with <math display="inline"><semantics> <mrow> <mi>z</mi> <mo>=</mo> <mo>−</mo> <mi>x</mi> </mrow> </semantics></math> in (<b>g</b>). Considering both the regions, the radii values are 1 and <math display="inline"><semantics> <mrow> <mn>1.2</mn> </mrow> </semantics></math>, conductivities 2 and 1, for regions 1 and 2, respectively.</p>
Full article ">Figure 6
<p>Solution of the problem described in Equations (<a href="#FD21-mathematics-10-01926" class="html-disp-formula">21</a>) and (<a href="#FD22-mathematics-10-01926" class="html-disp-formula">22</a>) (simplified) for the 2D and 3D case for the dipolar source and <math display="inline"><semantics> <mrow> <mo>(</mo> <msup> <mi>x</mi> <mn>2</mn> </msup> <mo>−</mo> <msup> <mi>y</mi> <mn>2</mn> </msup> <mo>)</mo> <mi>z</mi> </mrow> </semantics></math>, as well as the original boundary problem for two regions described in Equations (<a href="#FD4-mathematics-10-01926" class="html-disp-formula">4</a>)–(<a href="#FD8-mathematics-10-01926" class="html-disp-formula">8</a>). (<b>a</b>–<b>d</b>) solution of the boundary problem in the dipolar source; (<b>a</b>,<b>b</b>) two regions case; (<b>c</b>,<b>d</b>) simplified 2D and 3D regions case, respectively; (<b>e</b>,<b>f</b>) source and recovered solution from solving the inverse problem; (<b>g</b>–<b>j</b>) solution of the boundary problem of the source <math display="inline"><semantics> <mrow> <mo>(</mo> <msup> <mi>x</mi> <mn>2</mn> </msup> <mo>−</mo> <msup> <mi>y</mi> <mn>2</mn> </msup> <mo>)</mo> <mi>z</mi> </mrow> </semantics></math>; (<b>g</b>,<b>h</b>) two regions case; (<b>i</b>,<b>j</b>) simplified 2D and 3D case, respectively; (<b>k</b>,<b>l</b>) source and recovered solutions from solving the inverse problem.</p>
Full article ">
21 pages, 3146 KiB  
Article
Multicompartmental Mathematical Model of SARS-CoV-2 Distribution in Human Organs and Their Treatment
by Vasiliy N. Afonyushkin, Ilya R. Akberdin, Yulia N. Kozlova, Ivan A. Schukin, Tatyana E. Mironova, Anna S. Bobikova, Viktoriya S. Cherepushkina, Nikolaj A. Donchenko, Yulia E. Poletaeva and Fedor A. Kolpakov
Mathematics 2022, 10(11), 1925; https://doi.org/10.3390/math10111925 - 4 Jun 2022
Cited by 7 | Viewed by 2905
Abstract
Patients with COVID-19 can develop pneumonia, severe symptoms of acute respiratory distress syndrome, and multiple organ failure. Nevertheless, the variety of forms of this disease requires further research on the pathogenesis of this disease. Based on the analysis of published data and original [...] Read more.
Patients with COVID-19 can develop pneumonia, severe symptoms of acute respiratory distress syndrome, and multiple organ failure. Nevertheless, the variety of forms of this disease requires further research on the pathogenesis of this disease. Based on the analysis of published data and original experiments on the concentrations of SARS-CoV-2 in biological fluids of the nasopharynx, lungs, and intestines and using a developed modular model of the virus distribution in human tissue and organs, an assessment of the SARS-CoV-2 reproduction in various compartments of the body is presented. Most of the viral particles can transport to the esophagus from the nasopharynx. The viral particles entering the gastrointestinal tract will obviously be accompanied by the infection of the intestinal epithelium and accumulation of the virus in the intestinal lumen in an amount proportional to their secretory and protein-synthetic activities. The relatively low concentration of SARS-CoV-2 in tissues implies an essential role of transport processes and redistribution of the virus from the nasopharynx and intestines to the lungs. The model simulations also suppose that sanitation of the nasopharynx mucosa at the initial stage of the infectious process has prospects for the use in medical practice. Full article
(This article belongs to the Special Issue Mathematical and Computational Methods in Systems Biology)
Show Figures

Figure 1

Figure 1
<p>The developed multicompartmental model of the SARS-CoV-2 infection processes and distribution among three human organs, taking into account the virus reproduction in each compartment and viral transport between them. Gray circles are contact ports representing the interface of the module through which it can be connected with other modules or with the integrated model itself. V<sub>NP</sub>, V<sub>I</sub>, and V<sub>L</sub> correspond to viral particles in the nasopharynx, intestine, and lungs, respectively.</p>
Full article ">Figure 2
<p>A schematic diagram describing the multiplication and inactivation of the virus in a certain compartment (the NP module is shown as an example), in the SBGN format [<a href="#B8-mathematics-10-01925" class="html-bibr">8</a>]. “Fraction of target cells” is the proportion of cells sensitive to the infection, and “Virus” is the number of viral particles in a given compartment of the model. The vertices in the bipartite graph in the form of white squares correspond to the reactions in the model, the rate equations of which are given below in the system of ordinary differential equations. To account for the transport of viral particles from the NP module to the intestine and lung, a “contact”-type port (gray color) is used within the modular approach in BioUML.</p>
Full article ">Figure 3
<p>An electron micrograph of bacteriophage ph 57 particles. Uranyl acetate staining method (<b>a</b>) and morphology of negative colonies of bacteriophage ph 57 on a matte background of <span class="html-italic">P. aeruginosa</span> CEMTK 670 culture (<b>b</b>).</p>
Full article ">Figure 4
<p>Predicted viral load trajectories in the nasopharyngeal region (NP, blue curve), gastrointestinal tract (intestine, red curve), and lungs (lung, orange curve) are shown. The dashed vertical lines correspond to the timing of humoral immune response initiation in a certain compartment (the color of the dotted line corresponds to the color of the viral trajectory in the compartment). The initial viral load is 100 viral particles in the NP. <span class="html-italic">Y</span>-axis—log10 of viral load (copies/mL); <span class="html-italic">X</span>-axis—days from the moment of infection. (<b>A</b>) Values of the transport parameters correspond to the default values from <a href="#mathematics-10-01925-t001" class="html-table">Table 1</a>. (<b>B</b>) Values of the transport parameters from the nasopharyngeal region to the lungs and from the intestine to the lung were reduced 100 times. (<b>C</b>) Values of the transport parameters from the nasopharyngeal region to the lungs and from the intestine to the lung were increased 100 times.</p>
Full article ">Figure 5
<p>Predicted viral load trajectories in the nasopharyngeal region (NP, blue curve), gastrointestinal tract (Intestine, red curve), and lungs (Lung, orange curve) are shown. The time of humoral immune response initiation in each compartment is the same as in <a href="#mathematics-10-01925-f004" class="html-fig">Figure 4</a>. The initial viral load is varied in the NP. <span class="html-italic">Y</span>-axis—log10 of viral load (copies/mL); <span class="html-italic">X</span>-axis—days from the moment of infection. (<b>A</b>) Initial dose of the viral particles corresponds to 10<sup>2</sup>, (<b>B</b>) initial dose is 10<sup>3</sup>, and (<b>C</b>) initial dose is 10<sup>4</sup>.</p>
Full article ">Figure 6
<p>Predicted viral load trajectories in the nasopharyngeal region (NP, blue curve), gastrointestinal tract (intestine, red curve), and lungs (lung, orange curve), depending on the consideration of the T-cellular response, are shown. The dashed vertical lines correspond to the timing of humoral immune response initiation in a certain compartment, while dash-dotted lines represent the initiation of T-cellular immune response in a certain compartment (the color of the dashed and dash-dotted lines correspond to the color of the viral trajectory in the compartment). The initial viral load is 100 viral particles in the NP. <span class="html-italic">Y</span>-axis—log10 of viral load (copies/mL); <span class="html-italic">X</span>-axis—days from the moment of infection. (<b>A</b>) Only B-cellular response is involved in the virus clearance. (<b>B</b>) B- and T-cellular responses are activated.</p>
Full article ">Figure 7
<p>Sensitivity analysis of the model. The target variables in the analysis correspond to the target cell ratios in each compartment, where the column height indicates the scaled sensitivity’s value of the variable to a certain model parameter.</p>
Full article ">
18 pages, 29860 KiB  
Article
Design of a Thermal Measurement System with Vandal Protection Used for the Characterization of New Asphalt Pavements through Discriminated Dimensionless Analysis
by Juan Francisco Sánchez-Pérez, Gloria Motos-Cascales, Manuel Conesa, Francisco Moral-Moreno, Enrique Castro and Gonzalo García-Ros
Mathematics 2022, 10(11), 1924; https://doi.org/10.3390/math10111924 - 3 Jun 2022
Cited by 2 | Viewed by 2042
Abstract
This work focuses on the protection of measurement sensors against accidents, vandalism, or theft and on the improvement of the data collected due to the interference produced by these protections. These sensors are part of a larger study, within the framework of a [...] Read more.
This work focuses on the protection of measurement sensors against accidents, vandalism, or theft and on the improvement of the data collected due to the interference produced by these protections. These sensors are part of a larger study, within the framework of a LIFE Heatland project, carried out in a Spanish city, Murcia, with the fundamental objective of minimizing the urban heat island effect using pavements with lower solar energy storage than traditional ones. The study presented here has been carried out through the implementation of aluminum tubes that protect the sensors installed in the street. Once the problem of sensor protection had been solved, the problem of thermal interference in the measurements due to overheating inside the tubes had to be overcome by means of discriminated dimensionless analysis techniques, focusing on heat transfer by convection of the air flow in the inner part of the tube, by finding the most suitable size and materials to complement the outer aluminum coating. In particular, the search for the critical radius of the tubes was essential since it allowed the insulator size to be optimized. Derived from the study carried out to avoid the overheating of the tube, a small part was covered with a dark material and holes were made to improve air circulation inside the tube, allowing adequate measurement results to be obtained. Finally, the results showed that the designed device was suitable for temperature measurement, since small variations were observed with respect to the control device. Full article
Show Figures

Figure 1

Figure 1
<p>Location of new pavement—city of Murcia (Spain). Tower no. 1, installed on the streetlight identified as number 21, located at the intersection of Pio Baroja and San Juan de la Cruz Avenues. Tower no. 2 is installed on streetlight number 14, located in Pio Baroja Avenue in front of Lope de Rueda Street. Tower no. 3 is installed together with streetlight number 8, in Lope de Rueda Street. Tower no. 4 is installed on the streetlight which is within the roundabout where los Dolores Avenue, Ronda Sur Avenue, Pintor Pedro Almela Costa Street and Vicente Aleixandre Street converge.</p>
Full article ">Figure 2
<p>Detail of measuring station.</p>
Full article ">Figure 3
<p>Detail of the tube of protection.</p>
Full article ">Figure 4
<p>Holes drilled in tube.</p>
Full article ">Figure 5
<p>Internal flow in tubes.</p>
Full article ">Figure 6
<p>Temperature profile development in forced convection in a tube.</p>
Full article ">Figure 7
<p>Detail of final tube.</p>
Full article ">Figure 8
<p>Data from <a href="#mathematics-10-01924-t003" class="html-table">Table 3</a>.</p>
Full article ">Figure 9
<p>Data from <a href="#mathematics-10-01924-t004" class="html-table">Table 4</a>.</p>
Full article ">
24 pages, 3849 KiB  
Article
Emergent Intelligence in Smart Ecosystems: Conflicts Resolution by Reaching Consensus in Resource Management
by George Rzevski, Petr Skobelev and Alexey Zhilyaev
Mathematics 2022, 10(11), 1923; https://doi.org/10.3390/math10111923 - 3 Jun 2022
Cited by 9 | Viewed by 2486
Abstract
A new emergent intelligence approach to the design of smart ecosystems, based on the complexity science principles, is introduced and discussed. The smart ecosystem for resource management is defined as a system of autonomous decision-making multi-agent systems capable to allocate resources, plan orders [...] Read more.
A new emergent intelligence approach to the design of smart ecosystems, based on the complexity science principles, is introduced and discussed. The smart ecosystem for resource management is defined as a system of autonomous decision-making multi-agent systems capable to allocate resources, plan orders for resources, and to optimize, coordinate, monitor, and control the execution of plans in real time. The emergent intelligence enables software agents to collectively resolve conflicts arising in resource management decisions by reaching a consensus through a process of detecting conflicts and negotiation for finding trade-offs. The key feature of the proposed approach is the ontological model of the enterprise and the method of collective decision-making by software agents that compete or cooperate with each other on the virtual market of the digital ecosystem. Emergent intelligent systems do not require extensive training using a large quantity of data, like conventional artificial intelligence/machine learning systems. The developed model, method, and tool were applied for managing the resources of a factory workshop, a group of small satellites, and some other applications. A comparison of the developed and traditional tools is given. The new metric for measuring the adaptability of emergent intelligence is introduced. The performance of the new model and method are validated by constructing and evaluating large-scale resource management solutions for commercial clients. As demonstrated, the essential benefit is the high adaptability and efficiency of the resource management systems when operating under complex and dynamic market conditions. Full article
(This article belongs to the Section Mathematics and Computer Science)
Show Figures

Figure 1

Figure 1
<p>The relations between real world and digital world of digital ecosystem.</p>
Full article ">Figure 2
<p>The basic (in yellow) and domain ontology for manufacturing (in blue).</p>
Full article ">Figure 3
<p>The modified protocol of agent interaction and coordinated decision making for solving conflicts and reaching consensus.</p>
Full article ">Figure 4
<p>Fragment of negotiations of demand agent.</p>
Full article ">Figure 5
<p>The initial state of orders and resources.</p>
Full article ">Figure 6
<p>Reallocation of orders after negotiations.</p>
Full article ">Figure 7
<p>A fragment of agent negotiation aimed at resolving conflicts.</p>
Full article ">Figure 8
<p>The fragment of smart manufacturing ecosystem which supports p2p interaction of smart ERP solutions for manufacturing and transportation.</p>
Full article ">Figure 9
<p>The number of orders for distant observation of Earth: (<b>a</b>) Geographical distribution of 3 satellites and 7 ground stations; (<b>b</b>) the initial set of orders for distant observation of Earth.</p>
Full article ">Figure 10
<p>Examples of screens of the toolset: (<b>a</b>) initial state where many new orders (red circles) are not allocated to satellites (RESOURCE) and ground stations (GS); (<b>b</b>) the final state of consensus where only few red orders are still not scheduled.</p>
Full article ">Figure 11
<p>The example of resulting schedule of group of satellites.</p>
Full article ">Figure 12
<p>Quality and computational time achieved using the developed method (blue line) comparing with the full combinatorial search (black line).</p>
Full article ">Figure 13
<p>Adaptation by EI in case of an unpredictable, disruptive event.</p>
Full article ">
Previous Issue
Next Issue
Back to TopTop