[go: up one dir, main page]

Next Issue
Volume 9, August-1
Previous Issue
Volume 9, July-1
 
 

Mathematics, Volume 9, Issue 14 (July-2 2021) – 127 articles

Cover Story (view full-size image): This study investigates the effect of bundling contracts on electricity procurement auctions in Tokyo. We conduct structural estimations that include investigating the effect of bundling on the costs of firms, competition between the incumbent and the new firms, and auction outcomes. The results are that bundling contracts raises the cost of firms, increases the asymmetry between incumbent and new firms and helps exclude new firms from auctions. We find the negative effect increasing the costs of firms is somewhat mitigated by a larger scale of bundling, but that the negative effect on participation is scarcely offset by scale. The payment of the auctioneer may decline if bundling results in a large-sized auction, but the profit of the winner is always found to be lower in bundled auctions. 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:
17 pages, 369 KiB  
Article
Delay in a 2-State Discrete-Time Queue with Stochastic State-Period Lengths and State-Dependent Server Availability and Arrivals
by Freek Verdonck, Herwig Bruneel and Sabine Wittevrongel
Mathematics 2021, 9(14), 1709; https://doi.org/10.3390/math9141709 - 20 Jul 2021
Viewed by 1873
Abstract
In this paper, we consider a discrete-time multiserver queueing system with correlation in the arrival process and in the server availability. Specifically, we are interested in the delay characteristics. The system is assumed to be in one of two different system states, and [...] Read more.
In this paper, we consider a discrete-time multiserver queueing system with correlation in the arrival process and in the server availability. Specifically, we are interested in the delay characteristics. The system is assumed to be in one of two different system states, and each state is characterized by its own distributions for the number of arrivals and the number of available servers in a slot. Within a state, these numbers are independent and identically distributed random variables. State changes can only occur at slot boundaries and mark the beginnings and ends of state periods. Each state has its own distribution for its period lengths, expressed in the number of slots. The stochastic process that describes the state changes introduces correlation to the system, e.g., long periods with low arrival intensity can be alternated by short periods with high arrival intensity. Using probability generating functions and the theory of the dominant singularity, we find the tail probabilities of the delay. Full article
(This article belongs to the Special Issue Applications of Mathematical Analysis in Telecommunications)
Show Figures

Figure 1

Figure 1
<p>The delay of customer <span class="html-italic">P</span>.</p>
Full article ">Figure 2
<p>Distribution of delay for Case A and Case B both based on the theory of this paper (tail distribution) and based on simulation (probability mass function).</p>
Full article ">Figure 3
<p>Average and 99th percentile of the delay for the example of <a href="#sec7dot2-mathematics-09-01709" class="html-sec">Section 7.2</a>.</p>
Full article ">
10 pages, 596 KiB  
Article
Modelling Oil Price with Lie Algebras and Long Short-Term Memory Networks
by Melike Bildirici, Nilgun Guler Bayazit and Yasemen Ucan
Mathematics 2021, 9(14), 1708; https://doi.org/10.3390/math9141708 - 20 Jul 2021
Cited by 4 | Viewed by 2250
Abstract
In this paper, we propose hybrid models for modelling the daily oil price during the period from 2 January 1986 to 5 April 2021. The models on S2 manifolds that we consider, including the reference ones, employ matrix representations rather than differential [...] Read more.
In this paper, we propose hybrid models for modelling the daily oil price during the period from 2 January 1986 to 5 April 2021. The models on S2 manifolds that we consider, including the reference ones, employ matrix representations rather than differential operator representations of Lie algebras. Firstly, the performance of LieNLS model is examined in comparison to the Lie-OLS model. Then, both of these reference models are improved by integrating them with a recurrent neural network model used in deep learning. Thirdly, the forecasting performance of these two proposed hybrid models on the S2 manifold, namely Lie-LSTMOLS and Lie-LSTMNLS, are compared with those of the reference LieOLS and LieNLS models. The in-sample and out-of-sample results show that our proposed methods can achieve improved performance over LieOLS and LieNLS models in terms of RMSE and MAE metrics and hence can be more reliably used to assess volatility of time-series data. Full article
(This article belongs to the Special Issue Numerical Analysis and Scientific Computing)
29 pages, 16690 KiB  
Article
A Simple Analytical Method for Estimation of the Five-Parameter Model: Second-Order with Zero Plus Time Delay
by Tomaž Kos and Damir Vrančić
Mathematics 2021, 9(14), 1707; https://doi.org/10.3390/math9141707 - 20 Jul 2021
Cited by 3 | Viewed by 2350
Abstract
Process models play an important role in the process industry. They are used for simulation purposes, quality control, fault detection, and control design. Many researchers have been engaged in model identification. However, it is difficult to find an analytical identification method that provides [...] Read more.
Process models play an important role in the process industry. They are used for simulation purposes, quality control, fault detection, and control design. Many researchers have been engaged in model identification. However, it is difficult to find an analytical identification method that provides a good model and requires a relatively simple experiment. This is the advantage of the method of moments. In this paper, an analytical method based on the measurement of the process moments (characteristic areas) is proposed, to identify the five-parameter model (second-order process with zero plus time delay) from either the closed-loop or open-loop time responses of the process (in the time-domain), or the general-order transfer function with time delay (in the frequency-domain). The only parameter required by the user is the type of process (minimum phase or non-minimum phase process), which in practice can be easily determined from the time response of the process. The method can also be used to reduce the higher-order process model. The proposed identification method was tested on several illustrative examples, and compared to other identification methods. The comparison with existing methods showed the superiority of the proposed method. Moreover, the tests confirmed that the algorithm of the proposed method works properly for a wide family of process models, even in the presence of moderate process noise. Full article
(This article belongs to the Special Issue New Trends on Identification of Dynamic Systems)
Show Figures

Figure 1

Figure 1
<p>Flowchart of the proposed model identification method.</p>
Full article ">Figure 2
<p>The results of the algorithm conditions for process <span class="html-italic">G</span><sub>P1</sub>(s) parameters perturbation.</p>
Full article ">Figure 3
<p>The calculated zeroes <span class="html-italic">b</span><sub>1m</sub> for process <span class="html-italic">G</span><sub>P1</sub>(s) parameters perturbation.</p>
Full article ">Figure 4
<p>The calculated time delays <span class="html-italic">T</span><sub>dm</sub> for process <span class="html-italic">G</span><sub>P1</sub>(s) parameters perturbation.</p>
Full article ">Figure 5
<p>The IAE criterion values for process <span class="html-italic">G</span><sub>P1</sub>(s) parameters perturbation.</p>
Full article ">Figure 6
<p>The absolute difference of the IAE criteria for process <span class="html-italic">G</span><sub>P1</sub>(s) parameters perturbation. Values are calculated from the IAE criterion of the method proposed by Vrečko et al. [<a href="#B44-mathematics-09-01707" class="html-bibr">44</a>] and the IAE criterion of the proposed model identification method.</p>
Full article ">Figure 7
<p>The step-change responses for process <span class="html-italic">G</span><sub>P1</sub>.</p>
Full article ">Figure 8
<p>The Nyquist plots for process <span class="html-italic">G</span><sub>P1</sub>.</p>
Full article ">Figure 9
<p>The Bode plots for process <span class="html-italic">G</span><sub>P1</sub>.</p>
Full article ">Figure 10
<p>The step-change responses for process <span class="html-italic">G</span><sub>P2</sub>.</p>
Full article ">Figure 11
<p>The Nyquist plots for process <span class="html-italic">G</span><sub>P2</sub>.</p>
Full article ">Figure 12
<p>The Bode plots for process <span class="html-italic">G</span><sub>P2</sub>.</p>
Full article ">Figure 13
<p>The step-change responses for process <span class="html-italic">G</span><sub>P3</sub>.</p>
Full article ">Figure 14
<p>The Nyquist plots for process <span class="html-italic">G</span><sub>P3</sub>.</p>
Full article ">Figure 15
<p>The Bode plots for process <span class="html-italic">G</span><sub>P3</sub>.</p>
Full article ">Figure 16
<p>The step-change responses for process <span class="html-italic">G</span><sub>P4</sub>.</p>
Full article ">Figure 17
<p>The Nyquist plots for process <span class="html-italic">G</span><sub>P4</sub>.</p>
Full article ">Figure 18
<p>The Bode plots for process <span class="html-italic">G</span><sub>P4</sub>.</p>
Full article ">Figure 19
<p>The step-change responses for process <span class="html-italic">G</span><sub>P5</sub>.</p>
Full article ">Figure 20
<p>The Nyquist plots for process <span class="html-italic">G</span><sub>P5</sub>.</p>
Full article ">Figure 21
<p>The Bode plots for process <span class="html-italic">G</span><sub>P5</sub>.</p>
Full article ">Figure 22
<p>The step-change responses for process <span class="html-italic">G</span><sub>P6</sub>.</p>
Full article ">Figure 23
<p>The Nyquist plots for process <span class="html-italic">G</span><sub>P6</sub>.</p>
Full article ">Figure 24
<p>The Bode plots for process <span class="html-italic">G</span><sub>P6</sub>.</p>
Full article ">Figure 25
<p>Typical step responses of process <span class="html-italic">G</span><sub>P7</sub> under noise gain value.</p>
Full article ">Figure 26
<p>Histograms of the calculated characteristic areas.</p>
Full article ">Figure 27
<p>Histograms of the calculated process model parameters.</p>
Full article ">Figure 28
<p>The Nyquist plots for process <span class="html-italic">G</span><sub>P7</sub>.</p>
Full article ">Figure 29
<p>The Bode plots for process <span class="html-italic">G</span><sub>P7</sub>.</p>
Full article ">
16 pages, 297 KiB  
Article
A Certain Subclass of Multivalent Analytic Functions Defined by the q-Difference Operator Related to the Janowski Functions
by Bo Wang, Rekha Srivastava and Jin-Lin Liu
Mathematics 2021, 9(14), 1706; https://doi.org/10.3390/math9141706 - 20 Jul 2021
Cited by 11 | Viewed by 1769
Abstract
A class of p-valent analytic functions is introduced using the q-difference operator and the familiar Janowski functions. Several properties of functions in the class, such as the Fekete–Szegö inequality, coefficient estimates, necessary and sufficient conditions, distortion and growth theorems, radii of [...] Read more.
A class of p-valent analytic functions is introduced using the q-difference operator and the familiar Janowski functions. Several properties of functions in the class, such as the Fekete–Szegö inequality, coefficient estimates, necessary and sufficient conditions, distortion and growth theorems, radii of convexity and starlikeness, closure theorems and partial sums, are discussed in this paper. Full article
(This article belongs to the Special Issue Mathematical Analysis and Analytic Number Theory 2020)
12 pages, 648 KiB  
Article
A Mathematical Program for Scheduling Preventive Maintenance of Cogeneration Plants with Production
by Khaled Alhamad, Rym M’Hallah and Cormac Lucas
Mathematics 2021, 9(14), 1705; https://doi.org/10.3390/math9141705 - 20 Jul 2021
Cited by 4 | Viewed by 2010
Abstract
This paper considers the scheduling of preventive maintenance for the boilers, turbines, and distillers of power plants that produce electricity and desalinated water. It models the problem as a mathematical program (MP) that maximizes the sum of the minimal ratios of production to [...] Read more.
This paper considers the scheduling of preventive maintenance for the boilers, turbines, and distillers of power plants that produce electricity and desalinated water. It models the problem as a mathematical program (MP) that maximizes the sum of the minimal ratios of production to the demand of electricity and water during a planning time horizon. This objective encourages the plants’ production and enhances the chances of meeting consumers’ needs. It reduces the chance of power cuts and water shortages that may be caused by emergency disruptions of equipment on the network. To assess its performance and effectiveness, we test the MP on a real system consisting of 32 units and generate a preventive maintenance schedule for a time horizon of 52 weeks (one year). The generated schedule outperforms the schedule established by experts of the water plant; it induces, respectively, 16% and 12% increases in the surpluses while either matching or surpassing the total production. The sensitivity analysis further indicates that the generated schedule can handle unforeseen longer maintenance periods as well as a 120% increase in demand—a sizable realization in a country that heavily relies on electricity to acclimate to the harsh weather conditions. In addition, it suggests the robustness of the schedules with respect to increased demand. In summary, the MP model yields optimal systematic sustainable schedules. Full article
Show Figures

Figure 1

Figure 1
<p>Demand for electricity and water.</p>
Full article ">Figure 2
<p>MP water production versus demand.</p>
Full article ">Figure 3
<p>MP electricity production versus demand.</p>
Full article ">Figure 4
<p>MEW water production versus demand.</p>
Full article ">Figure 5
<p>MEW electricity production versus demand.</p>
Full article ">Figure 6
<p>Water surplus production versus increased demand.</p>
Full article ">Figure 7
<p>Electricity surplus production versus increased demand.</p>
Full article ">
10 pages, 283 KiB  
Article
Para-Ricci-Like Solitons on Riemannian Manifolds with Almost Paracontact Structure and Almost Paracomplex Structure
by Hristo Manev and Mancho Manev
Mathematics 2021, 9(14), 1704; https://doi.org/10.3390/math9141704 - 20 Jul 2021
Cited by 8 | Viewed by 1487
Abstract
We introduce and study a new type of soliton with a potential Reeb vector field on Riemannian manifolds with an almost paracontact structure corresponding to an almost paracomplex structure. The special cases of para-Einstein-like, para-Sasaki-like and having a torse-forming Reeb vector field were [...] Read more.
We introduce and study a new type of soliton with a potential Reeb vector field on Riemannian manifolds with an almost paracontact structure corresponding to an almost paracomplex structure. The special cases of para-Einstein-like, para-Sasaki-like and having a torse-forming Reeb vector field were considered. It was proved a necessary and sufficient condition for the manifold to admit a para-Ricci-like soliton, which is the structure that is para-Einstein-like. Explicit examples are provided in support of the proven statements. Full article
(This article belongs to the Section Algebra, Geometry and Topology)
20 pages, 4849 KiB  
Article
Reversible Data Hiding Based on Pixel-Value-Ordering and Prediction-Error Triplet Expansion
by Heng-Xiao Chi, Ji-Hwei Horng and Chin-Chen Chang
Mathematics 2021, 9(14), 1703; https://doi.org/10.3390/math9141703 - 20 Jul 2021
Cited by 4 | Viewed by 2369
Abstract
Pixel value ordering and prediction error expansion (PVO+PEE) is a very successful reversible data hiding (RDH) scheme. A series of studies were proposed to improve the performance of the PVO-based scheme. However, the embedding capacity of those schemes is quite limited. We propose [...] Read more.
Pixel value ordering and prediction error expansion (PVO+PEE) is a very successful reversible data hiding (RDH) scheme. A series of studies were proposed to improve the performance of the PVO-based scheme. However, the embedding capacity of those schemes is quite limited. We propose a two-step prediction-error-triplet expansion RDH scheme based on PVO. A three-dimensional state transition map for the prediction-error triplet is also proposed to guide the embedding of the two-step scheme. By properly designing the state transitions, the proposed scheme can embed secret data or expand without embedding by modifying just a single entry of the triplet. The experimental results show that the proposed scheme significantly enlarges the embedding capacity of the PVO-based scheme and further reduces the distortion due to embedding. Full article
Show Figures

Figure 1

Figure 1
<p>The state transition map for PVO-based RDH schemes. (<b>a</b>) PVO [<a href="#B21-mathematics-09-01703" class="html-bibr">21</a>]; (<b>b</b>) IPVO [<a href="#B22-mathematics-09-01703" class="html-bibr">22</a>]; (<b>c</b>) Pairwise-PVO [<a href="#B24-mathematics-09-01703" class="html-bibr">24</a>]; (<b>d</b>) PVO-k [<a href="#B26-mathematics-09-01703" class="html-bibr">26</a>]; (<b>e</b>) k-pass PVO [<a href="#B27-mathematics-09-01703" class="html-bibr">27</a>]; (<b>f</b>) Improved k-pass PVO [<a href="#B28-mathematics-09-01703" class="html-bibr">28</a>].</p>
Full article ">Figure 2
<p>Flowcharts of the proposed scheme. (<b>a</b>) Embedding phase; (<b>b</b>) Extraction phase.</p>
Full article ">Figure 3
<p>Slice representation of 3D prediction error histogram. (<b>a</b>) Lena; (<b>b</b>) <math display="inline"><semantics> <mrow> <msubsup> <mi>e</mi> <mrow> <mi>m</mi> <mi>a</mi> <mi>x</mi> </mrow> <mn>3</mn> </msubsup> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math>; (<b>c</b>) <math display="inline"><semantics> <mrow> <msubsup> <mi>e</mi> <mrow> <mi>m</mi> <mi>a</mi> <mi>x</mi> </mrow> <mn>3</mn> </msubsup> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math>; (<b>d</b>) <math display="inline"><semantics> <mrow> <msubsup> <mi>e</mi> <mrow> <mi>m</mi> <mi>a</mi> <mi>x</mi> </mrow> <mn>3</mn> </msubsup> <mo>=</mo> <mn>2</mn> </mrow> </semantics></math>; (<b>e</b>) <math display="inline"><semantics> <mrow> <msubsup> <mi>e</mi> <mrow> <mi>m</mi> <mi>a</mi> <mi>x</mi> </mrow> <mn>3</mn> </msubsup> <mo>=</mo> <mn>3</mn> </mrow> </semantics></math>; (<b>f</b>) <math display="inline"><semantics> <mrow> <msubsup> <mi>e</mi> <mrow> <mi>m</mi> <mi>a</mi> <mi>x</mi> </mrow> <mn>3</mn> </msubsup> <mo>=</mo> <mn>4</mn> </mrow> </semantics></math>; (<b>g</b>) <math display="inline"><semantics> <mrow> <msubsup> <mi>e</mi> <mrow> <mi>m</mi> <mi>a</mi> <mi>x</mi> </mrow> <mn>3</mn> </msubsup> <mo>=</mo> <mn>5</mn> </mrow> </semantics></math>; (<b>h</b>) <math display="inline"><semantics> <mrow> <msubsup> <mi>e</mi> <mrow> <mi>m</mi> <mi>a</mi> <mi>x</mi> </mrow> <mn>3</mn> </msubsup> <mo>=</mo> <mn>6</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 4
<p>3D prediction error histogram with a view at the maximum value. (<b>a</b>) 3D histogram; (<b>b</b>) Cross section view.</p>
Full article ">Figure 5
<p>Layered structure of the 3D transition map.</p>
Full article ">Figure 6
<p>(<b>a</b>–<b>c</b>) 3D state transition map for the <math display="inline"><semantics> <mn>0</mn> </semantics></math>-th layer <math display="inline"><semantics> <mrow> <msub> <mi>L</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>0</mn> </mrow> </msub> </mrow> </semantics></math>; (<b>d</b>–<b>f</b>) the projection versions.</p>
Full article ">Figure 7
<p>(<b>a</b>–<b>c</b>) 3D state transition map for the <math display="inline"><semantics> <mi>p</mi> </semantics></math>-th layer <math display="inline"><semantics> <mrow> <msub> <mi>L</mi> <mrow> <mi>p</mi> <mo>≠</mo> <mn>0</mn> </mrow> </msub> </mrow> </semantics></math>; (<b>d</b>–<b>f</b>) the projection versions.</p>
Full article ">Figure 8
<p>Two examples of the secret data embedding process. (<b>a</b>) Embedding Example 1; (<b>b</b>) Embedding Example 2.</p>
Full article ">Figure 9
<p>Two examples of the secret data extraction and block recovery process. (<b>a</b>) Extract Example 1; (<b>b</b>) Extract Example 2.</p>
Full article ">Figure 10
<p>A 2 × 2 sized block and its context (gray pixels), where NL is the noise level.</p>
Full article ">Figure 11
<p>Eight gray level standard test images applied in our experiments. (<b>a</b>) Lena; (<b>b</b>) Baboon; (<b>c</b>) Barbara; (<b>d</b>) Elaine; (<b>e</b>) Airplane; (<b>f</b>) Peppers; (<b>g</b>) Lake; (<b>h</b>) Boat.</p>
Full article ">Figure 12
<p>The PSNR values under different payloads. (<b>a</b>) Lena; (<b>b</b>) Baboon; (<b>c</b>) Barbara; (<b>d</b>) Elaine; (<b>e</b>) Airplane; (<b>f</b>) Peppers; (<b>g</b>) Lake; (<b>h</b>) Boat.</p>
Full article ">Figure 12 Cont.
<p>The PSNR values under different payloads. (<b>a</b>) Lena; (<b>b</b>) Baboon; (<b>c</b>) Barbara; (<b>d</b>) Elaine; (<b>e</b>) Airplane; (<b>f</b>) Peppers; (<b>g</b>) Lake; (<b>h</b>) Boat.</p>
Full article ">
31 pages, 1106 KiB  
Article
Corruption Shock in Mexico: fsQCA Analysis of Entrepreneurial Intention in University Students
by Fernando Castelló-Sirvent and Pablo Pinazo-Dallenbach
Mathematics 2021, 9(14), 1702; https://doi.org/10.3390/math9141702 - 20 Jul 2021
Cited by 10 | Viewed by 3004
Abstract
Entrepreneurship is the basis of the production network, and thus a key to territorial development. In this line, entrepreneurial intention has been pointed out as an indicator of latent entrepreneurship. In this article, the entrepreneurial intention of university students is studied from a [...] Read more.
Entrepreneurship is the basis of the production network, and thus a key to territorial development. In this line, entrepreneurial intention has been pointed out as an indicator of latent entrepreneurship. In this article, the entrepreneurial intention of university students is studied from a configurational approach, allowing the study of the combined effect of corruption perception, corruption normalization, gender, university career area, and family entrepreneurial background to explain high levels of entrepreneurial intention. The model was tested with the fsQCA methodology according to two samples of students grouped according to their household income (medium and high level: N = 180; low level: N = 200). Stress tests were run to confirm the robustness of the results. This study highlights the negative impact produced by corruption among university students’ entrepreneurial intention. Furthermore, the importance of family entrepreneurial background for specific archetypes like female, STEM, and low household income students is pointed out, as well as the importance of implementing education programs for entrepreneurship in higher education, and more specifically in STEM areas. Policies focused on facilitating the access to financial resources for female students and low household income students, and specific programs to foster female entrepreneurship, are also recommended. Full article
(This article belongs to the Special Issue Fuzzy Sets in Business Management, Finance, and Economics)
11 pages, 369 KiB  
Review
Soft Computing for Decision-Making in Fuzzy Environments: A Tribute to Professor Ioan Dzitac
by Simona Dzitac and Sorin Nădăban
Mathematics 2021, 9(14), 1701; https://doi.org/10.3390/math9141701 - 20 Jul 2021
Cited by 17 | Viewed by 3436
Abstract
This paper is dedicated to Professor Ioan Dzitac (1953–2021). Therefore, his life has been briefly presented as well as a comprehensive overview of his major contributions in the domain of soft computing methods in a fuzzy environment. This paper is part of a [...] Read more.
This paper is dedicated to Professor Ioan Dzitac (1953–2021). Therefore, his life has been briefly presented as well as a comprehensive overview of his major contributions in the domain of soft computing methods in a fuzzy environment. This paper is part of a special reverential volume, dedicated to the Centenary of the Birth of Lotfi A. Zadeh, whom Ioan Dzitac considered to be is his mentor, and to whom he showed his gratitude many times and in innumerable ways, including by being the Guest Editor of this Special Issue. Professor Ioan Dzitac had many important achievements throughout his career: he was co-founder and Editor-in-Chief of an ISI Expanded quoted journal, International Journal of Computers Communications & Control; together with L.A. Zadeh, D. Tufis and F.G. Filip he edited the volume “From Natural Language to Soft Computing: New Paradigms in Artificial Intelligence”; his scientific interest focused on different sub-fields: fuzzy logic applications, soft computing in a fuzzy environment, artificial intelligence, learning platform, distributed systems in internet. He had the most important contributions in soft computing in a fuzzy environment. Some of them will be presented in this paper. Finally, some future trends are discussed. Full article
Show Figures

Figure 1

Figure 1
<p>Ioan Dzitac and Lotfi A. Zadeh at ICCCC 2008.</p>
Full article ">Figure 2
<p>The structure of a fuzzy logic system.</p>
Full article ">
16 pages, 781 KiB  
Article
Multiple Criteria Decision-Making for Developing an International Game Participation Strategy: A Novel Application of the Data Envelopment Analysis (DEA) Two-Stage Efficiency Process
by Yi-Chieh Chen, Lin-Huan Hu, Wan Chen Lu, Jei-Zheng Wu and Jiun-Jen Yang
Mathematics 2021, 9(14), 1700; https://doi.org/10.3390/math9141700 - 20 Jul 2021
Cited by 4 | Viewed by 2315
Abstract
Background: This study aims to develop an efficient future game participation strategy for teenaged athletes based on an analysis of the 2019 International Table Tennis Federation (ITTF) World Tour game expenditure efficiency and prize-winning efficiency. Methods: In this research, Chinese Taipei (TPE) players [...] Read more.
Background: This study aims to develop an efficient future game participation strategy for teenaged athletes based on an analysis of the 2019 International Table Tennis Federation (ITTF) World Tour game expenditure efficiency and prize-winning efficiency. Methods: In this research, Chinese Taipei (TPE) players served as the main research subjects. The input and output categories were determined through a literature analysis. A two-stage efficiency process of data envelopment analysis (DEA) and Boston consulting group (BCG) matrix were applied in this study to facilitate the calculation. Results: Based on a slack variable analysis, local travel expenses are the key elements impacting efficiency. The game recommendation order was based on a BCG matrix. The top seven recommended games were the Japan Open, Czech Open, Australian Open, Bulgarian Open, Austrian Open, China Open, and German Open. Conclusion: The results of this current study provide efficient game participation recommendations for teenaged athletes. Long-term follow-up records of game participation information should be developed to provide teenaged athletes with a precise efficiency analysis. Full article
Show Figures

Figure 1

Figure 1
<p>BCG matrix reference modified form [<a href="#B27-mathematics-09-01700" class="html-bibr">27</a>].</p>
Full article ">Figure 2
<p>Conceptual framework.</p>
Full article ">Figure 3
<p>Game BCG matrix for the 2021 ITTF World Tour.</p>
Full article ">
15 pages, 2186 KiB  
Article
Nonlinear Differential Braking Control for Collision Avoidance During Lane Change
by Young Seop Son and Wonhee Kim
Mathematics 2021, 9(14), 1699; https://doi.org/10.3390/math9141699 - 19 Jul 2021
Cited by 3 | Viewed by 1982
Abstract
In this paper, a nonlinear differential braking control method is developed to avoid collision during lane change under driver torque. The lateral dynamics consist of lateral offset error and yaw error dynamics and can be interpreted as a semi-strict feedback form. In the [...] Read more.
In this paper, a nonlinear differential braking control method is developed to avoid collision during lane change under driver torque. The lateral dynamics consist of lateral offset error and yaw error dynamics and can be interpreted as a semi-strict feedback form. In the differential braking control problem under the driver torque, a matching condition does not satisfy, and the system is not in the form of, the strict feedback form. Thus, a general backstepping control method cannot be applied. To overcome this problem, the proposed method is designed via the combination of the sliding mode control and backstepping. Two sliding surfaces are designed for differential braking control. One of the surfaces is designed considering the lateral offset error, and the other sliding surface is designed using the combination of the yaw and yaw rate errors as the virtual input of the lateral offset error dynamics. A brake steer force input is developed to regulate the two sliding surfaces using a backstepping procedure under the driver torque. Integral action and a super twisting algorithm are used in the lateral controller to ensure the robustness of the system. The proposed method, which is designed via the combination of the sliding mode control and backstepping, can improve the lateral control performance using differential braking. The proposed method is validated through simulations. Full article
Show Figures

Figure 1

Figure 1
<p>Bicycle model diagram of lateral vehicle dynamics.</p>
Full article ">Figure 2
<p>Lateral position and velocity errors at the look-ahead distance point.</p>
Full article ">Figure 3
<p>Architecture of the collision avoidance system.</p>
Full article ">Figure 4
<p>Strategy of the lateral control for the avoidance of the side crash.</p>
Full article ">Figure 5
<p>Block diagram of the proposed method.</p>
Full article ">Figure 6
<p>Vehicle and camera models used in the simulations.</p>
Full article ">Figure 7
<p>Steering angle and Brake steer force.</p>
Full article ">Figure 8
<p>System operation index.</p>
Full article ">Figure 9
<p>Lateral offset and yaw errors.</p>
Full article ">Figure 10
<p>Sliding surface <math display="inline"><semantics> <msub> <mi>s</mi> <mn>1</mn> </msub> </semantics></math> and surface tracking error <math display="inline"><semantics> <msub> <mi>z</mi> <mn>2</mn> </msub> </semantics></math>.</p>
Full article ">Figure 11
<p>Vehicle trajectory of the proposed method.</p>
Full article ">Figure 12
<p>Curved Road.</p>
Full article ">Figure 13
<p>Steering angle.</p>
Full article ">Figure 14
<p>Lateral offset errors for the PI control and the proposed methods.</p>
Full article ">Figure 15
<p>Vehicle trajectory of the proposed method.</p>
Full article ">
22 pages, 2637 KiB  
Article
Theoretical Efficiency Study of Output Lubricant Flow Rate Regulating Principle on the Example of a Two-Row Aerostatic Journal Bearing with Longitudinal Microgrooves and a System of External Combined Throttling
by Vladimir Kodnyanko, Stanislav Shatokhin, Andrey Kurzakov, Yuri Pikalov, Lilia Strok, Iakov Pikalov, Olga Grigorieva and Maxim Brungardt
Mathematics 2021, 9(14), 1698; https://doi.org/10.3390/math9141698 - 19 Jul 2021
Cited by 4 | Viewed by 1752
Abstract
Due to their vanishingly low air friction, high wear resistance, and environmental friendliness, aerostatic bearings are used in machines, machine tools, and devices that require high accuracy of micro-movement and positioning. The characteristic disadvantages of aerostatic bearings are low load capacity, high compliance [...] Read more.
Due to their vanishingly low air friction, high wear resistance, and environmental friendliness, aerostatic bearings are used in machines, machine tools, and devices that require high accuracy of micro-movement and positioning. The characteristic disadvantages of aerostatic bearings are low load capacity, high compliance and an increased tendency for instability. In radial bearings, it is possible to use longitudinal microgrooves, which practically exclude circumferential air leakage, and contributes to a significant increase in load-bearing capacity. To reduce compliance to zero and negative values, inlet diaphragm and elastic airflow regulators are used. Active flow compensation is inextricably linked to the problem of ensuring the stability of bearings due to the presence of relatively large volumes of gas in the regulator, which have a destabilizing effect. This problem was solved by using an external combined throttling system. Bearings with input flow regulators have a number of disadvantages-they are very energy-intensive and have an insufficiently stable load capacity. A more promising way to reduce compliance is the use of displacement compensators for the movable element. Such bearings also allow for a decrease in compliance to zero and negative values, which makes it possible to use them not only as supports, but also as active deformation compensators of the technological system of machine tools in order to reduce the time and increase the accuracy of metalworking. The new idea of using active flow compensators is to regulate the flow rate not at the inlet, but at the outlet of the air flow. This design has the energy efficiency that is inherent to a conventional bearing, but the regulation of the lubricant output flow allows the compliance to be reduced to zero and negative values. This article discusses the results of a theoretical study of the static and dynamic characteristics of a two-row radial aerostatic bearing with longitudinal microgrooves and an output flow regulator. Mathematical modeling and theoretical study of stationary modes have been carried out. Formulas for determining static compliance and load capacity are obtained. Iterative finite-difference methods for determining the dynamic characteristics of a structure are proposed. The calculation of dynamic quality criteria was carried out on the basis of the method of rational interpolation of the bearing transfer function, as a system with distributed parameters, developed by the authors. It was found that the volumes of the microgrooves do not have a noticeable effect on the bearing dynamics. It is shown that, in this design, the external combined throttling system is an effective means of maintaining stability and high dynamic quality of the design operating in the modes of low, zero and negative compliance. Full article
(This article belongs to the Special Issue Computational Mechanics in Engineering Mathematics)
Show Figures

Figure 1

Figure 1
<p>Design diagram of a radial aerostatic bearing.</p>
Full article ">Figure 2
<p>Diaphragms, movable part and seals.</p>
Full article ">Figure 3
<p>Unfolded drawing of seals and throttling cavities.</p>
Full article ">Figure 4
<p>Unfolded drawing of the bearing surface with microgrooves.</p>
Full article ">Figure 5
<p>Dependences of static compliance <span class="html-italic">K</span> on the adjustment factor χ for different values of the coefficient of elasticity <span class="html-italic">K<sub>e</sub></span>.</p>
Full article ">Figure 6
<p>Dependences of static compliance <span class="html-italic">K</span> on the adjustment factor ς for different values of the coefficient of elasticity <span class="html-italic">K<sub>e</sub></span>, χ = 0.45.</p>
Full article ">Figure 7
<p>Dependences of the eccentricity ε on the external load F at different values of the elasticity coefficient <span class="html-italic">K<sub>e</sub></span>.</p>
Full article ">Figure 8
<p>Dependences of the eccentricity ε on the external load <span class="html-italic">F</span> at different values of the length <span class="html-italic">L</span> and the coefficient of elasticity <span class="html-italic">K<sub>e</sub></span> = 2<span class="html-italic">K<sub>e</sub></span><sub>0</sub>.</p>
Full article ">Figure 9
<p>Dependences of the degree of stability η on the compression number σ for different values of the dimensionless volume of the inter-throttle chambers and the coefficient of elasticity <span class="html-italic">K<sub>e</sub></span> = 2<span class="html-italic">K<sub>e</sub></span><sub>0</sub>.</p>
Full article ">Figure 10
<p>Dependences of the criterion of damping of oscillations for the period ξ on the compression number σ for various values of the dimensionless volume of the inter-throttling chambers and the coefficient of elasticity <span class="html-italic">K<sub>e</sub></span> = 2<span class="html-italic">K<sub>e</sub></span><sub>0</sub>.</p>
Full article ">Figure 11
<p>Dependences of the degree of stability η on the coefficient of elasticity <span class="html-italic">K<sub>e</sub></span> at various values of the compression number σ.</p>
Full article ">Figure 12
<p>Dependences of the criterion of oscillations damping for the period ξ on the coefficient of elasticity <span class="html-italic">K<sub>e</sub></span> for different values of the compression number σ.</p>
Full article ">
16 pages, 347 KiB  
Article
Mathematics Preservice Trainee Teachers’ Perceptions of Attention to Diversity in Initial Training as Secondary Education Teachers
by María Jesús Caurcel Cara, Emilio Crisol Moya and Carmen del Pilar Gallardo-Montes
Mathematics 2021, 9(14), 1697; https://doi.org/10.3390/math9141697 - 19 Jul 2021
Cited by 3 | Viewed by 2368
Abstract
Research on teachers’ perceptions about diversity is key to understanding the different approaches to be implemented to build inclusive education. Within this framework, the perceptions and attitudes of 73 students in the Mathematics specialization of the University Master’s Degree in Teacher Training for [...] Read more.
Research on teachers’ perceptions about diversity is key to understanding the different approaches to be implemented to build inclusive education. Within this framework, the perceptions and attitudes of 73 students in the Mathematics specialization of the University Master’s Degree in Teacher Training for Secondary Education, Bachillerato, Vocational Training and Language Teaching (Máster Universitario en Profesorado de Educación Secundaria Obligatoria, Formación Profesional y Enseñanza de Idiomas (MAES) at the University of Granada (Spain) were analyzed to determine their views about the initial training they received on attention to diversity during the Master’s program. The study is a descriptive and correlational-predictive transversal examination of the responses obtained from the “Questionnaire for preservice secondary education teachers on perceptions about attention to diversity” (Colmenero Ruiz and Pegalajar Palomino, 2015). The findings demonstrate that the students—preservice secondary education teachers—held favorable attitudes toward diversity and the principle of inclusion. The findings also show that contact with persons with disability influences perception of this population. The authors conclude that better training and knowledge of the elements that condition the teaching–learning process for high-quality attention to diversity predict better pedagogical preparation in matters of attention to diversity. Full article
24 pages, 7253 KiB  
Article
Design and Numerical Implementation of V2X Control Architecture for Autonomous Driving Vehicles
by Piyush Dhawankar, Prashant Agrawal, Bilal Abderezzak, Omprakash Kaiwartya, Krishna Busawon and Maria Simona Raboacă
Mathematics 2021, 9(14), 1696; https://doi.org/10.3390/math9141696 - 19 Jul 2021
Cited by 8 | Viewed by 4002
Abstract
This paper is concerned with designing and numerically implementing a V2X (Vehicle-to-Vehicle and Vehicle-to-Infrastructure) control system architecture for a platoon of autonomous vehicles. The V2X control architecture integrates the well-known Intelligent Driver Model (IDM) for a platoon of Autonomous Driving Vehicles (ADVs) with [...] Read more.
This paper is concerned with designing and numerically implementing a V2X (Vehicle-to-Vehicle and Vehicle-to-Infrastructure) control system architecture for a platoon of autonomous vehicles. The V2X control architecture integrates the well-known Intelligent Driver Model (IDM) for a platoon of Autonomous Driving Vehicles (ADVs) with Vehicle-to-Infrastructure (V2I) Communication. The main aim is to address practical implementation issues of such a system as well as the safety and security concerns for traffic environments. To this end, we first investigated a channel estimation model for V2I communication. We employed the IEEE 802.11p vehicular standard and calculated path loss, Packet Error Rate (PER), Signal-to-Noise Ratio (SNR), and throughput between transmitter and receiver end. Next, we carried out several case studies to evaluate the performance of the proposed control system with respect to its response to: (i) the communication infrastructure; (ii) its sensitivity to an emergency, inter-vehicular gap, and significant perturbation; and (iii) its performance under the loss of communication and changing driving environment. Simulation results show the effectiveness of the proposed control model. The model is collision-free for an infinite length of platoon string on a single lane road-driving environment. It also shows that it can work during a lack of communication, where the platoon vehicles can make their decision with the help of their own sensors. V2X Enabled Intelligent Driver Model (VX-IDM) performance is assessed and compared with the state-of-the-art models considering standard parameter settings and metrics. Full article
Show Figures

Figure 1

Figure 1
<p>The working of the IDM in physical world environments, incorporating V2V communication.</p>
Full article ">Figure 2
<p>Transmitter and receiver design of IEEE 802.11p for V2I communication.</p>
Full article ">Figure 3
<p>Integration of IDM in MATLAB.</p>
Full article ">Figure 4
<p>Integration of IDM and 802.11p V2I communication in MATLAB.</p>
Full article ">Figure 5
<p>V2X enabled platoon vehicles in physical world environments.</p>
Full article ">Figure 6
<p>V2X oriented Intelligent Driver Control Model.</p>
Full article ">Figure 7
<p>Case I vehicle platoon motion as described in <a href="#sec3dot4-mathematics-09-01696" class="html-sec">Section 3.4</a>: (<b>a</b>) Displacement of the vehicles over the simulation time. The inset shows a magnified image of the vehicle movement as the platoon enters the RSU coverage; (<b>b</b>) Velocity of the vehicles over the simulation time. The inset shows a magnified image of the vehicle velocities as the platoon enters the RSU coverage; (<b>c</b>) Variation of SNR and PER as the platoon moves along the road. Leader is the platoon leader.</p>
Full article ">Figure 8
<p>Case II vehicle platoon motion as described in <a href="#sec3dot4-mathematics-09-01696" class="html-sec">Section 3.4</a>: (<b>a</b>) Displacement of the vehicles over the simulation time. The inset shows a magnified image of the vehicle displacements as the platoon encounters a dynamic message from the RSU’s; (<b>b</b>) Velocity of the vehicles over the simulation time. The inset shows a magnified image of the car velocities as the platoon encounters a dynamic message from the RSU’s; (<b>c</b>) Variation of SNR and PER as the platoon moves along the road. Leader is the platoon leader.</p>
Full article ">Figure 9
<p>Case III vehicle platoon motion as described in <a href="#sec3dot4-mathematics-09-01696" class="html-sec">Section 3.4</a>: (<b>a</b>) Displacement of the vehicles over the simulation time; (<b>b</b>) Velocity of the vehicles over the simulation time; (<b>c</b>) Variation of SNR and PER as the platoon moves along the road. Leader is the platoon leader.</p>
Full article ">Figure 10
<p>Case IV vehicle platoon motion for case IV, as described in <a href="#sec3dot4-mathematics-09-01696" class="html-sec">Section 3.4</a>: (<b>a</b>) Displacement of the vehicles over the simulation time; (<b>b</b>) Velocity of the vehicles over the simulation time; (<b>c</b>) Depiction of the coverage range of RSU’s (red) and the range during which the car communicates with the RSU (blue). The distance lag (red), time lag (green), and the RSU range are also mentioned; (<b>d</b>) Variation of SNR and PER as the platoon moves along the road. Leader is the platoon leader.</p>
Full article ">Figure 11
<p>Case V vehicle platoon motion as described in <a href="#sec3dot4-mathematics-09-01696" class="html-sec">Section 3.4</a>: (<b>a</b>) Displacement of the vehicles over the simulation time; (<b>b</b>) Velocity of the vehicles over the simulation time; (<b>c</b>) Depiction of the coverage range of RSU’s (red) and the range during which the car communicates with the RSU (blue). The distance lag (red), time lag (green) and the RSU range are also mentioned; (<b>d</b>) Variation of SNR and PER as the platoon moves along the road. Leader is the platoon leader.</p>
Full article ">Figure 12
<p>Case VI vehicle platoon motion as described in <a href="#sec3dot4-mathematics-09-01696" class="html-sec">Section 3.4</a>: (<b>a</b>) Displacement of the vehicles over the simulation time; (<b>b</b>) Velocity of the vehicles over the simulation time; (<b>c</b>) Depiction of the coverage range of RSU’s (red) and the range during which the car communicates with the RSU (blue). The distance lag (red), time lag (green) and the RSU range are also mentioned; (<b>d</b>) Variation of SNR and PER as the platoon moves along the road. Leader is the platoon leader.</p>
Full article ">
14 pages, 5073 KiB  
Article
Determination of Optimal Diffusion Coefficients in Lake Zirahuén through a Local Inverse Problem
by Tzitlali Gasca-Ortiz, Francisco J. Domínguez-Mota and Diego A. Pantoja
Mathematics 2021, 9(14), 1695; https://doi.org/10.3390/math9141695 - 19 Jul 2021
Cited by 2 | Viewed by 2985
Abstract
In this study, optimal diffusion coefficients for Lake Zirahuén, Mexico, were found under particular conditions based on images taken with a drone of a dye release experiment. First, the dye patch concentration was discretized using image processing tools, and it was then approximated [...] Read more.
In this study, optimal diffusion coefficients for Lake Zirahuén, Mexico, were found under particular conditions based on images taken with a drone of a dye release experiment. First, the dye patch concentration was discretized using image processing tools, and it was then approximated by an ellipse, finding the optimal major and minor axes. The inverse problem was implemented by comparing these observational data with the concentration obtained numerically from the 2D advection–diffusion equation, varying the diffusion tensor. When the tensor was isotropic, values of K11=K220.003 m2/s were found; when nonequal coefficients were considered, it was found that K110.005 m2/s and K220.002 m2/s, and the cross-term K12 influenced the results of the orientation of the ellipse. It is important to mention that, with this simple technique, the parameter estimation had consequences of great importance as the value for the diffusion coefficient was bounded significantly under particular conditions for this site of study. Full article
Show Figures

Figure 1

Figure 1
<p>Flowchart of the proposed methodology to find the optimal coefficient.</p>
Full article ">Figure 2
<p>Rectangular domain with an element size of 1 m. Black ellipses indicate the initial/final condition.</p>
Full article ">Figure 3
<p>(<b>a</b>) Image processing steps (i) selection of the RGB intensity, (ii) inverted mask, (iii) binary image, and (iv) selection of the dye patch. (<b>b</b>) Optimal ellipse for the boundary dataset <math display="inline"><semantics> <mrow> <mrow> <mo>(</mo> <mrow> <msub> <mi>ζ</mi> <mi>i</mi> </msub> <mo>,</mo> <msub> <mi>η</mi> <mi>i</mi> </msub> </mrow> <mo>)</mo> </mrow> </mrow> </semantics></math>.</p>
Full article ">Figure 4
<p>Dye patch extent mapping where the spatial and temporal variation is shown. The images (<b>A</b>–<b>H</b>) show the dye patch dispersing over time, whereas the evolution of the corresponding ellipses after processing is shown in (<b>a</b>–<b>h</b>). The optimal ellipses are shown in blue with the geometrical center marked with a red asterisk.</p>
Full article ">Figure 5
<p>Selected dye contours for velocity field computation, and the computed velocities for each contour. The length scale and the velocity scale are shown in the lower part of the figure.</p>
Full article ">Figure 6
<p>Objective function and number of iterations, with <math display="inline"><semantics> <mrow> <msub> <mi>K</mi> <mrow> <mn>11</mn> </mrow> </msub> <mo>=</mo> <msub> <mi>K</mi> <mrow> <mn>22</mn> </mrow> </msub> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <msub> <mi>K</mi> <mrow> <mn>11</mn> </mrow> </msub> <mo>≠</mo> <msub> <mi>K</mi> <mrow> <mn>22</mn> </mrow> </msub> </mrow> </semantics></math>.</p>
Full article ">Figure 7
<p>Concentration distribution. Concentration contours obtained with the optimal diffusion coefficient <math display="inline"><semantics> <mrow> <msub> <mi>K</mi> <mrow> <mn>11</mn> </mrow> </msub> <mo>≠</mo> <msub> <mi>K</mi> <mrow> <mn>22</mn> </mrow> </msub> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <msub> <mi>K</mi> <mrow> <mn>12</mn> </mrow> </msub> <mo>=</mo> <msub> <mi>K</mi> <mrow> <mn>21</mn> </mrow> </msub> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math>. The gray contour exemplifies the temporal evolution.</p>
Full article ">Figure 8
<p>(<b>a</b>) Concentration contours obtained with optimal diffusion coefficients for <math display="inline"><semantics> <mrow> <msub> <mi>K</mi> <mrow> <mn>11</mn> </mrow> </msub> <mo>=</mo> <msub> <mi>K</mi> <mrow> <mn>22</mn> </mrow> </msub> </mrow> </semantics></math>. Observations are shown in black and the solution in red. In (<b>b</b>), the dispersion diagram of the data and the analytical solution with <span class="html-italic">SSE</span> and <math display="inline"><semantics> <mrow> <msup> <mi>R</mi> <mn>2</mn> </msup> </mrow> </semantics></math> is shown.</p>
Full article ">Figure 9
<p>(<b>a</b>) Concentration contours obtained with optimal diffusion coefficients for <math display="inline"><semantics> <mrow> <msub> <mi>K</mi> <mrow> <mn>11</mn> </mrow> </msub> <mo>≠</mo> <msub> <mi>K</mi> <mrow> <mn>22</mn> </mrow> </msub> </mrow> </semantics></math>. Observations are shown in black and the solution in red. In (<b>b</b>), the dispersion diagram of the data and the analytical solution with <span class="html-italic">SSE</span> and <math display="inline"><semantics> <mrow> <msup> <mi>R</mi> <mn>2</mn> </msup> </mrow> </semantics></math> is shown.</p>
Full article ">Figure 10
<p>(<b>a</b>) Concentration contours obtained with optimal diffusion coefficients for <math display="inline"><semantics> <mrow> <msub> <mi>K</mi> <mrow> <mn>11</mn> </mrow> </msub> <mo>≠</mo> <msub> <mi>K</mi> <mrow> <mn>22</mn> </mrow> </msub> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <msub> <mi>K</mi> <mrow> <mn>12</mn> </mrow> </msub> <mo>=</mo> <msub> <mi>K</mi> <mrow> <mn>21</mn> </mrow> </msub> <mo> </mo> <mo>≠</mo> <mn>0</mn> </mrow> </semantics></math>. Observations are shown in black and the solution in red. In (<b>b</b>), the dispersion diagram of the data and the analytical solution with <span class="html-italic">SSE</span> and <math display="inline"><semantics> <mrow> <msup> <mi>R</mi> <mn>2</mn> </msup> </mrow> </semantics></math> is shown.</p>
Full article ">
17 pages, 371 KiB  
Article
Estimation of the Average Kappa Coefficient of a Binary Diagnostic Test in the Presence of Partial Verification
by José Antonio Roldán-Nofuentes and Saad Bouh Regad
Mathematics 2021, 9(14), 1694; https://doi.org/10.3390/math9141694 - 19 Jul 2021
Cited by 5 | Viewed by 2085
Abstract
The average kappa coefficient of a binary diagnostic test is a measure of the beyond-chance average agreement between the binary diagnostic test and the gold standard, and it depends on the sensitivity and specificity of the diagnostic test and on disease prevalence. In [...] Read more.
The average kappa coefficient of a binary diagnostic test is a measure of the beyond-chance average agreement between the binary diagnostic test and the gold standard, and it depends on the sensitivity and specificity of the diagnostic test and on disease prevalence. In this manuscript the estimation of the average kappa coefficient of a diagnostic test in the presence of verification bias is studied. Confidence intervals for the average kappa coefficient are studied applying the methods of maximum likelihood and multiple imputation by chained equations. Simulation experiments have been carried out to study the asymptotic behaviors of the proposed intervals, given some application rules. The results obtained in our simulation experiments have shown that the multiple imputation by chained equations method provides better results than the maximum likelihood method. A function has been written in R to estimate the average kappa coefficient by applying multiple imputation. The results have been applied to the diagnosis of liver disease. Full article
17 pages, 813 KiB  
Article
Existence and U-H-R Stability of Solutions to the Implicit Nonlinear FBVP in the Variable Order Settings
by Mohammed K. A. Kaabar, Ahmed Refice, Mohammed Said Souid, Francisco Martínez, Sina Etemad, Zailan Siri and Shahram Rezapour
Mathematics 2021, 9(14), 1693; https://doi.org/10.3390/math9141693 - 19 Jul 2021
Cited by 19 | Viewed by 1939
Abstract
In this paper, the existence of the solution and its stability to the fractional boundary value problem (FBVP) were investigated for an implicit nonlinear fractional differential equation (VOFDE) of variable order. All existence criteria of the solutions in our establishments were derived via [...] Read more.
In this paper, the existence of the solution and its stability to the fractional boundary value problem (FBVP) were investigated for an implicit nonlinear fractional differential equation (VOFDE) of variable order. All existence criteria of the solutions in our establishments were derived via Krasnoselskii’s fixed point theorem and in the sequel, and its Ulam–Hyers–Rassias (U-H-R) stability is checked. An illustrative example is presented at the end of this paper to validate our findings. Full article
8 pages, 254 KiB  
Article
Approximation of Endpoints for α—Reich–Suzuki Nonexpansive Mappings in Hyperbolic Metric Spaces
by Izhar Uddin, Sajan Aggarwal and Afrah A. N. Abdou
Mathematics 2021, 9(14), 1692; https://doi.org/10.3390/math9141692 - 19 Jul 2021
Cited by 5 | Viewed by 1911
Abstract
The concept of an endpoint is a relatively new concept compared to the concept of a fixed point. The aim of this paper is to perform a convergence analysis of M—iteration involving α—Reich–Suzuki nonexpansive mappings. In this paper, we prove strong [...] Read more.
The concept of an endpoint is a relatively new concept compared to the concept of a fixed point. The aim of this paper is to perform a convergence analysis of M—iteration involving α—Reich–Suzuki nonexpansive mappings. In this paper, we prove strong and Δ—convergence theorems in a hyperbolic metric space. Thus, our results generalize and improve many existing results. Full article
(This article belongs to the Special Issue Nonlinear Problems and Applications of Fixed Point Theory)
20 pages, 2215 KiB  
Article
Three Solutions for a Partial Discrete Dirichlet Problem Involving the Mean Curvature Operator
by Shaohong Wang and Zhan Zhou
Mathematics 2021, 9(14), 1691; https://doi.org/10.3390/math9141691 - 19 Jul 2021
Cited by 2 | Viewed by 1676
Abstract
Partial difference equations have received more and more attention in recent years due to their extensive applications in diverse areas. In this paper, we consider a Dirichlet boundary value problem of the partial difference equation involving the mean curvature operator. By applying critical [...] Read more.
Partial difference equations have received more and more attention in recent years due to their extensive applications in diverse areas. In this paper, we consider a Dirichlet boundary value problem of the partial difference equation involving the mean curvature operator. By applying critical point theory, the existence of at least three solutions is obtained. Furthermore, under some appropriate assumptions on the nonlinearity, we respectively show that this problem admits at least two or three positive solutions by means of a strong maximum principle. Finally, we present two concrete examples and combine with images to illustrate our main results. Full article
(This article belongs to the Special Issue Functional Differential Equations and Epidemiological Modelling)
Show Figures

Figure 1

Figure 1
<p>The image of components x, y, z of the solutions for (<a href="#FD14-mathematics-09-01691" class="html-disp-formula">14</a>).</p>
Full article ">Figure 2
<p>The image of components x, y, z of the solutions for (<a href="#FD15-mathematics-09-01691" class="html-disp-formula">15</a>).</p>
Full article ">
38 pages, 4857 KiB  
Article
Efficient Space–Time Reduced Order Model for Linear Dynamical Systems in Python Using Less than 120 Lines of Code
by Youngkyu Kim, Karen Wang and Youngsoo Choi
Mathematics 2021, 9(14), 1690; https://doi.org/10.3390/math9141690 - 19 Jul 2021
Cited by 18 | Viewed by 5914
Abstract
A classical reduced order model (ROM) for dynamical problems typically involves only the spatial reduction of a given problem. Recently, a novel space–time ROM for linear dynamical problems has been developed [Choi et al., Space–tume reduced order model for large-scale linear dynamical systems [...] Read more.
A classical reduced order model (ROM) for dynamical problems typically involves only the spatial reduction of a given problem. Recently, a novel space–time ROM for linear dynamical problems has been developed [Choi et al., Space–tume reduced order model for large-scale linear dynamical systems with application to Boltzmann transport problems, Journal of Computational Physics, 2020], which further reduces the problem size by introducing a temporal reduction in addition to a spatial reduction without much loss in accuracy. The authors show an order of a thousand speed-up with a relative error of less than 105 for a large-scale Boltzmann transport problem. In this work, we present for the first time the derivation of the space–time least-squares Petrov–Galerkin (LSPG) projection for linear dynamical systems and its corresponding block structures. Utilizing these block structures, we demonstrate the ease of construction of the space–time ROM method with two model problems: 2D diffusion and 2D convection diffusion, with and without a linear source term. For each problem, we demonstrate the entire process of generating the full order model (FOM) data, constructing the space–time ROM, and predicting the reduced-order solutions, all in less than 120 lines of Python code. We compare our LSPG method with the traditional Galerkin method and show that the space–time ROMs can achieve O(103) to O(104) relative errors for these problems. Depending on parameter–separability, online speed-ups may or may not be achieved. For the FOMs with parameter–separability, the space–time ROMs can achieve O(10) online speed-ups. Finally, we present an error analysis for the space–time LSPG projection and derive an error bound, which shows an improvement compared to traditional spatial Galerkin ROM methods. Full article
Show Figures

Figure 1

Figure 1
<p>Illustration of spatial and temporal bases construction, using SVD with <math display="inline"><semantics> <mrow> <msub> <mi>n</mi> <mi>μ</mi> </msub> <mo>=</mo> <mn>3</mn> </mrow> </semantics></math>. The right singular vector, <math display="inline"><semantics> <msub> <mi mathvariant="bold-italic">v</mi> <mi>i</mi> </msub> </semantics></math>, describes three different temporal behaviors of a left singular basis vector <math display="inline"><semantics> <msub> <mi mathvariant="bold-italic">w</mi> <mi>i</mi> </msub> </semantics></math>, i.e., three different temporal behaviors of a spatial mode due to three different parameters that are denoted as <math display="inline"><semantics> <msub> <mi mathvariant="bold-italic">μ</mi> <mn>1</mn> </msub> </semantics></math>, <math display="inline"><semantics> <msub> <mi mathvariant="bold-italic">μ</mi> <mn>2</mn> </msub> </semantics></math>, and <math display="inline"><semantics> <msub> <mi mathvariant="bold-italic">μ</mi> <mn>3</mn> </msub> </semantics></math>. Each temporal behavior is denoted as <math display="inline"><semantics> <msubsup> <mi mathvariant="bold-italic">v</mi> <mrow> <mi>i</mi> </mrow> <mn>1</mn> </msubsup> </semantics></math>, <math display="inline"><semantics> <msubsup> <mi mathvariant="bold-italic">v</mi> <mrow> <mi>i</mi> </mrow> <mn>2</mn> </msubsup> </semantics></math>, and <math display="inline"><semantics> <msubsup> <mi mathvariant="bold-italic">v</mi> <mrow> <mi>i</mi> </mrow> <mn>3</mn> </msubsup> </semantics></math>.</p>
Full article ">Figure 2
<p>Growth rate of stability constant in Theorem 1. Backward Euler time stepping scheme with uniform time step size, <math display="inline"><semantics> <mrow> <mo>Δ</mo> <mi>t</mi> <mo>=</mo> <msup> <mn>10</mn> <mrow> <mo>−</mo> <mn>2</mn> </mrow> </msup> </mrow> </semantics></math> is used. (<b>a</b>): <math display="inline"><semantics> <mrow> <mrow> <mo>∥</mo> </mrow> <msup> <mrow> <mo>(</mo> <msup> <mi mathvariant="bold-italic">A</mi> <mi>st</mi> </msup> <mo>)</mo> </mrow> <mrow> <mo>−</mo> <mn>1</mn> </mrow> </msup> <msub> <mrow> <mo>∥</mo> </mrow> <mn>2</mn> </msub> </mrow> </semantics></math> in inequality (41), (<b>b</b>): Stability constant, <math display="inline"><semantics> <mi>η</mi> </semantics></math> in inequality (41).</p>
Full article ">Figure 3
<p>2D linear diffusion equation. Graph of singular value decay. (<b>a</b>): Singular value decay of solution snapshot, (<b>b</b>): Singular value decay of temporal snapshot for the first spatial basis vector.</p>
Full article ">Figure 4
<p>2D linear diffusion equation. Relative errors vs. reduced dimensions. Note that the scales of the <span class="html-italic">z</span>-axis, i.e., the average relative error, are the same both for Galerkin and LSPG. Although the Galerkin achieves slightly lower minimum average relative error values than the LSPG, both Galerkin and LSPG show comparable results. (<b>a</b>): Relative errors vs. reduced dimensions for Galerkin projection, (<b>b</b>): Relative errors vs. reduced dimensions for LSPG projection.</p>
Full article ">Figure 5
<p>2D linear diffusion equation. Space-time residuals vs. reduced dimensions. Note that the scales of the <span class="html-italic">z</span>-axis, i.e., the residual norm, are the same both for Galerkin and LSPG. Although the LSPG achieves slightly lower minimum residual norm values than the Galerkin, both Galerkin and LSPG show comparable results. (<b>a</b>): Space-time residuals vs. reduced dimensions for Galerkin projection, (<b>b</b>): Space-time residuals vs. reduced dimensions for LSPG projection.</p>
Full article ">Figure 6
<p>2D linear diffusion equation. Online speed-ups vs. reduced dimensions. Both Galerkin and LSPG show similar speed-ups. (<b>a</b>): Online speed-ups vs. reduced dimensions for Galerkin projection, (<b>b</b>): Online speed-ups vs. reduced dimensions for LSPG projection.</p>
Full article ">Figure 7
<p>2D linear diffusion equation. Solving speed-ups vs. reduced dimensions. (<b>a</b>): Solving speed-ups vs. reduced dimensions for Galerkin projection, (<b>b</b>): Solving speed-ups vs. reduced dimensions for LSPG projection.</p>
Full article ">Figure 8
<p>2D linear diffusion equation. Solution snapshots of FOM, Galerkin ROM, and LSPG ROM at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>2</mn> </mrow> </semantics></math>. (<b>a</b>): FOM, (<b>b</b>): Galerkin ROM, (<b>c</b>): LSPG ROM.</p>
Full article ">Figure 9
<p>2D linear diffusion equation. The comparison of the Galerkin and LSPG ROMs for predictive cases. The block dots indicate the train parameters. (<b>a</b>): Galerkin, (<b>b</b>): LSPG.</p>
Full article ">Figure 10
<p>Plot of Equation (<a href="#FD60-mathematics-09-01690" class="html-disp-formula">60</a>).</p>
Full article ">Figure 11
<p>2D linear convection diffusion equation. Graph of singular value decay. (<b>a</b>): Singular value decay of solution snapshot, (<b>b</b>): Singular value decay of temporal snapshot for the first spatial basis vector.</p>
Full article ">Figure 12
<p>2D linear convection diffusion equation. Relative errors vs. reduced dimensions. Note that the scales of the <span class="html-italic">z</span>-axis, i.e., the average relative error, are the same both for Galerkin and LSPG. Although the Galerkin achieves slightly lower minimum average relative error values than the LSPG, both Galerkin and LSPG show comparable results. (<b>a</b>): Relative errors vs. reduced dimensions for Galerkin projection, (<b>b</b>): Relative errors vs. reduced dimensions for LSPG projection.</p>
Full article ">Figure 13
<p>2D linear convection diffusion equation. Space-time residuals vs. reduced dimensions. Note that the scales of the <span class="html-italic">z</span>-axis, i.e., the residual norm, are the same both for Galerkin and LSPG. Although the LSPG achieves slightly lower minimum residual norm values than the Galerkin, both Galerkin and LSPG show comparable results. (<b>a</b>): Space-time residuals vs. reduced dimensions for Galerkin projection, (<b>b</b>): Space-time residuals vs. reduced dimensions for LSPG projection.</p>
Full article ">Figure 14
<p>2D linear convection diffusion equation. Online speed-ups vs. reduced dimensions. Both Galerkin and LSPG show similar speed-ups. (<b>a</b>): Online speed-ups vs. reduced dimensions for Galerkin projection, (<b>b</b>): Online speed-ups vs. reduced dimensions for LSPG projection.</p>
Full article ">Figure 15
<p>2D linear convection diffusion equation. Solution snapshots of FOM, Galerkin ROM, and LSPG ROM at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math>. (<b>a</b>): FOM, (<b>b</b>): Galerkin ROM, (<b>c</b>): LSPG ROM.</p>
Full article ">Figure 16
<p>2D linear convection diffusion equation. The comparison of the Galerkin and LSPG ROMs for predictive cases. The block dots indicate the train parameters. (<b>a</b>): Galerkin, (<b>b</b>): LSPG.</p>
Full article ">Figure 17
<p>2D linear convection diffusion equation with source term. Graph of singular value decay. (<b>a</b>): Singular value decay of solution snapshot, (<b>b</b>): Singular value decay of temporal snapshot for the first spatial basis vector.</p>
Full article ">Figure 18
<p>2D linear convection diffusion equation with source term. Relative errors vs. reduced dimensions. Note that the scales of the <span class="html-italic">z</span>-axis, i.e., the average relative error, are the same both for Galerkin and LSPG. Although the Galerkin achieves slightly lower minimum average relative error values than the LSPG, both Galerkin and LSPG show comparable results. (<b>a</b>): Relative errors vs. reduced dimensions for Galerkin projection, (<b>b</b>): Relative errors vs. reduced dimensions for LSPG projection.</p>
Full article ">Figure 19
<p>2D linear convection diffusion equation with source term. Space-time residuals vs. reduced dimensions. Note that the scales of the <span class="html-italic">z</span>-axis, i.e., the residual norm, are the same both for Galerkin and LSPG. Although the LSPG achieves slightly lower minimum residual norm values than the Galerkin, both Galerkin and LSPG show comparable results. (<b>a</b>): Space-time residuals vs. reduced dimensions for Galerkin projection, (<b>b</b>): Space-time residuals vs. reduced dimensions for LSPG projection.</p>
Full article ">Figure 20
<p>2D linear convection diffusion equation with source term. Online speed-ups vs. reduced dimensions. Both Galerkin and LSPG show similar speed-ups. (<b>a</b>): Online speed-ups vs. reduced dimensions for Galerkin projection, (<b>b</b>): Online speed-ups vs. reduced dimensions for LSPG projection.</p>
Full article ">Figure 21
<p>2D linear convection diffusion equation with source term. Solution snapshots of FOM, Galerkin ROM, and LSPG ROM at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>2</mn> </mrow> </semantics></math>. (<b>a</b>): FOM, (<b>b</b>): Galerkin ROM, (<b>c</b>): LSPG ROM.</p>
Full article ">Figure 22
<p>2D linear convection diffusion equation with source term. The comparison of the Galerkin and LSPG ROMs for predictive cases. The block dots indicate the train parameters. (<b>a</b>): Galerkin, (<b>b</b>): LSPG.</p>
Full article ">
16 pages, 9213 KiB  
Article
On the Geometric Description of Nonlinear Elasticity via an Energy Approach Using Barycentric Coordinates
by Odysseas Kosmas, Pieter Boom and Andrey P. Jivkov
Mathematics 2021, 9(14), 1689; https://doi.org/10.3390/math9141689 - 19 Jul 2021
Viewed by 2020
Abstract
The deformation of a solid due to changing boundary conditions is described by a deformation gradient in Euclidean space. If the deformation process is reversible (conservative), the work done by the changing boundary conditions is stored as potential (elastic) energy, a function of [...] Read more.
The deformation of a solid due to changing boundary conditions is described by a deformation gradient in Euclidean space. If the deformation process is reversible (conservative), the work done by the changing boundary conditions is stored as potential (elastic) energy, a function of the deformation gradient invariants. Based on this, in the present work we built a “discrete energy model” that uses maps between nodal positions of a discrete mesh linked with the invariants of the deformation gradient via standard barycentric coordinates. A special derivation is provided for domains tessellated by tetrahedrons, where the energy functionals are constrained by prescribed boundary conditions via Lagrange multipliers. The analysis of these domains is performed via energy minimisation, where the constraints are eliminated via pre-multiplication of the discrete equations by a discrete null-space matrix of the constraint gradients. Numerical examples are provided to verify the accuracy of the proposed technique. The standard barycentric coordinate system in this work is restricted to three-dimensional (3-D) convex polytopes. We show that for an explicit energy expression, applicable also to non-convex polytopes, the general barycentric coordinates constitute fundamental tools. We define, in addition, the discrete energy via a gradient for general polytopes, which is a natural extension of the definition for discrete domains tessellated by tetrahedra. We, finally, prove that the resulting expressions can consistently describe the deformation of solids. Full article
(This article belongs to the Special Issue Dynamical Systems in Engineering)
Show Figures

Figure 1

Figure 1
<p>Initial <math display="inline"><mi>ℬ</mi></math> and current <span class="html-italic">S</span> configurations of a domain related by map <math display="inline"><semantics> <mrow> <msub> <mi>φ</mi> <mi>t</mi> </msub> <mo>≡</mo> <mi>φ</mi> </mrow> </semantics></math>.</p>
Full article ">Figure 2
<p>Examples of partitioned volumes <math display="inline"><semantics> <msub> <mi>V</mi> <mi>I</mi> </msub> </semantics></math> associated with point <math display="inline"><semantics> <mi mathvariant="double-struck">X</mi> </semantics></math>: (<b>top</b>) two figures illustrate two volumes for point inside the tetrahedron; (<b>bottom</b>) two figures illustrate two volumes for a point outside the tetrahedron.</p>
Full article ">Figure 3
<p>The deformation of a 3D tetrahedral element.</p>
Full article ">Figure 4
<p>3d cantilever beam.</p>
Full article ">Figure 5
<p>The deflection of the geometrically nonlinear case of a cantilever beam subjected to a regular distributed load calculated using finite element method with tetrahedral elements (FEM-tet) and the proposed scheme.</p>
Full article ">Figure 6
<p>Cube with a spherical hole.</p>
Full article ">Figure 7
<p>Stress distribution around the hole for distance <math display="inline"><semantics> <mrow> <mi>x</mi> <mo>&gt;</mo> <mn>1</mn> </mrow> </semantics></math> from the centre of the hole (size does not corresponds to example).</p>
Full article ">Figure 8
<p>Two-dimensional triangle formed from points with nodal positions <math display="inline"><semantics> <mrow> <msub> <mi mathvariant="double-struck">X</mi> <mi>a</mi> </msub> <mo>,</mo> <msub> <mi mathvariant="double-struck">X</mi> <mi>b</mi> </msub> </mrow> </semantics></math> and <math display="inline"><semantics> <msub> <mi mathvariant="double-struck">X</mi> <mi>c</mi> </msub> </semantics></math>.</p>
Full article ">
13 pages, 3967 KiB  
Article
Diffusion in Sephadex Gel Structures: Time Dependency Revealed by Multi-Sequence Acquisition over a Broad Diffusion Time Range
by Guangyu Dan, Weiguo Li, Zheng Zhong, Kaibao Sun, Qingfei Luo, Richard L. Magin, Xiaohong Joe Zhou and M. Muge Karaman
Mathematics 2021, 9(14), 1688; https://doi.org/10.3390/math9141688 - 19 Jul 2021
Cited by 5 | Viewed by 2415
Abstract
It has been increasingly reported that in biological tissues diffusion-weighted MRI signal attenuation deviates from mono-exponential decay, especially at high b-values. A number of diffusion models have been proposed to characterize this non-Gaussian diffusion behavior. One of these models is the continuous-time [...] Read more.
It has been increasingly reported that in biological tissues diffusion-weighted MRI signal attenuation deviates from mono-exponential decay, especially at high b-values. A number of diffusion models have been proposed to characterize this non-Gaussian diffusion behavior. One of these models is the continuous-time random-walk (CTRW) model, which introduces two new parameters: a fractional order time derivative α and a fractional order spatial derivative β. These new parameters have been linked to intravoxel diffusion heterogeneities in time and space, respectively, and are believed to depend on diffusion times. Studies on this time dependency are limited, largely because the diffusion time cannot vary over a board range in a conventional spin-echo echo-planar imaging sequence due to the accompanying T2 decays. In this study, we investigated the time-dependency of the CTRW model in Sephadex gel phantoms across a broad diffusion time range by employing oscillating-gradient spin-echo, pulsed-gradient spin-echo, and pulsed-gradient stimulated echo sequences. We also performed Monte Carlo simulations to help understand our experimental results. It was observed that the diffusion process fell into the Gaussian regime at extremely short diffusion times whereas it exhibited a strong time dependency in the CTRW parameters at longer diffusion times. Full article
(This article belongs to the Special Issue Fractional Calculus in Magnetic Resonance)
Show Figures

Figure 1

Figure 1
<p>Pulse sequences employed in this study. (<b>a</b>) Cosine-trapezoid OGSE where <span class="html-italic">N</span> is the number of half oscillation period and <span class="html-italic">δ</span> is the total waveform duration (<span class="html-italic">N</span> = 4 in the sequence diagram). (<b>b</b>) PGSE where <span class="html-italic">δ</span> is the diffusion lobe duration and Δ is the diffusion lobe separation. (<b>c</b>) PGSTE where <span class="html-italic">δ</span> and Δ are defined similarly as in (<b>b</b>).</p>
Full article ">Figure 2
<p>DW images acquired by using the PGSE sequence (Δ = 35 ms and <span class="html-italic">b</span> = 0). (<b>a</b>) The first Sephadex series: G25–50 (bottom right), G50–50 (bottom left), and G75–50 (top). (<b>b</b>) The second Sephadex series: G50–50 (bottom left), G50–80 (bottom right), and G50–150 (top). The rhombus-shaped ROIs indicate the regions used to calculate the mean parameter values.</p>
Full article ">Figure 3
<p>Plots of <span class="html-italic">D<sub>α,β</sub></span> versus effective diffusion time, Δ<span class="html-italic"><sub>eff</sub></span>, for gels G25–50 (<b>a</b>) and G50–50 (<b>b</b>), and G75–50 (<b>c</b>) with increased macromolecular exclusion limit. The data acquired by using the OGSE, PGSE, and PGSTE pulse sequences are marked in black, red, and blue, respectively.</p>
Full article ">Figure 4
<p>Plots of temporal fractional order (<span class="html-italic">α</span>) versus effective diffusion time, Δ<span class="html-italic"><sub>eff</sub></span>, for gels G25–50 (<b>a</b>) and G50–50 (<b>b</b>), and G75–50 (<b>c</b>). The data acquired by using the OGSE, PGSE, and PGSTE pulse sequences are marked in black, red, and blue, respectively.</p>
Full article ">Figure 5
<p>Plots of spatial fractional order (<span class="html-italic">β</span>) versus effective diffusion time, Δ<span class="html-italic"><sub>eff</sub></span>, for gels G25–50 (<b>a</b>) and G50–50 (<b>b</b>), and G75–50 (<b>c</b>). The data acquired by using the OGSE, PGSE, and PGSTE pulse sequences are marked in black, red, and blue, respectively.</p>
Full article ">Figure 6
<p>Plot of <span class="html-italic">D<sub>α,β</sub></span> versus effective diffusion time, Δ<span class="html-italic"><sub>eff</sub></span>, for gels G50–50 (<b>a</b>), G50–80 (<b>b</b>), and G50–150 (<b>c</b>). The data acquired by using the OGSE, PGSE, and PGSTE pulse sequences are marked in black, red, and blue, respectively.</p>
Full article ">Figure 7
<p>Plot of temporal fractional order (<span class="html-italic">α</span>) versus effective diffusion time, Δ<span class="html-italic"><sub>eff</sub></span>, for gels G50–50 (<b>a</b>), G50–80 (<b>b</b>), and G50–150 (<b>c</b>). The data acquired by using the OGSE, PGSE, and PGSTE pulse sequences are marked in black, red, and blue, respectively.</p>
Full article ">Figure 8
<p>Plot of spatial fractional order (<span class="html-italic">β</span>) versus effective diffusion time, Δ<span class="html-italic"><sub>eff</sub></span>, for gels G50–50 (<b>a</b>), G50–80 (<b>b</b>), and G50–150 (<b>c</b>). The data acquired by using the OGSE, PGSE, and PGSTE pulse sequences are marked in black, red, and blue, respectively.</p>
Full article ">Figure 9
<p>Plots of <span class="html-italic">D<sub>α,β</sub></span> (<b>a</b>), <span class="html-italic">α</span> (<b>b</b>), and <span class="html-italic">β</span> (<b>c</b>) versus Δ<span class="html-italic"><sub>eff</sub></span> obtained from the Monte Carlo simulations with fixed <span class="html-italic">r</span> = 8 µm and varying <span class="html-italic">p</span> of 0.1% (red), 0.2% (green) and 0.4% (blue). The rhombi and circles represent the simulation results with oscillating diffusion gradient (OGSE) and Stejskal–Tanner diffusion gradient (PGSE/PGSTE), respectively.</p>
Full article ">Figure 10
<p>Plots of <span class="html-italic">D<sub>α,β</sub></span> (<b>a</b>), <span class="html-italic">α</span> (<b>b</b>), and <span class="html-italic">β</span> (<b>c</b>) versus Δ<span class="html-italic"><sub>eff</sub></span> from Monte Carlo simulation with fixed <span class="html-italic">p</span> = 0.2% and varying <span class="html-italic">r</span> of 6 µm (red), 7 µm (green) and 8 µm (blue). The rhombi and circles represent simulation results with oscillating diffusion gradient (OGSE) and Stejskal–Tanner diffusion gradient (PGSE/PGSTE), respectively.</p>
Full article ">
10 pages, 256 KiB  
Article
Bounds for the Energy of Graphs
by Slobodan Filipovski and Robert Jajcay
Mathematics 2021, 9(14), 1687; https://doi.org/10.3390/math9141687 - 18 Jul 2021
Cited by 18 | Viewed by 3782
Abstract
Let G be a graph on n vertices and m edges, with maximum degree Δ(G) and minimum degree δ(G). Let A be the adjacency matrix of G, and let [...] Read more.
Let G be a graph on n vertices and m edges, with maximum degree Δ(G) and minimum degree δ(G). Let A be the adjacency matrix of G, and let λ1λ2λn be the eigenvalues of G. The energy of G, denoted by E(G), is defined as the sum of the absolute values of the eigenvalues of G, that is E(G)=|λ1|++|λn|. The energy of G is known to be at least twice the minimum degree of G, E(G)2δ(G). Akbari and Hosseinzadeh conjectured that the energy of a graph G whose adjacency matrix is nonsingular is in fact greater than or equal to the sum of the maximum and the minimum degrees of G, i.e., E(G)Δ(G)+δ(G). In this paper, we present a proof of this conjecture for hyperenergetic graphs, and we prove an inequality that appears to support the conjectured inequality. Additionally, we derive various lower and upper bounds for E(G). The results rely on elementary inequalities and their application. Full article
(This article belongs to the Section Computational and Applied Mathematics)
21 pages, 7098 KiB  
Protocol
A Comparison of Regional Classification Strategies Implemented for the Population Based Approach to Modelling Atrial Fibrillation
by Jordan Elliott, Maria Kristina Belen, Luca Mainardi and Josè Felix Rodriguez Matas
Mathematics 2021, 9(14), 1686; https://doi.org/10.3390/math9141686 - 17 Jul 2021
Cited by 4 | Viewed by 1906
Abstract
(1) Background: in silico models are increasingly relied upon to study the mechanisms of atrial fibrillation. Due to the complexity associated with atrial models, cellular variability is often ignored. Recent studies have shown that cellular variability may have a larger impact on electrophysiological [...] Read more.
(1) Background: in silico models are increasingly relied upon to study the mechanisms of atrial fibrillation. Due to the complexity associated with atrial models, cellular variability is often ignored. Recent studies have shown that cellular variability may have a larger impact on electrophysiological behaviour than previously expected. This paper compares two methods for AF remodelling using regional populations. (2) Methods: using 200,000 action potentials, experimental data was used to calibrate healthy atrial regional populations with two cellular models. AF remodelling was applied by directly adjusting maximum channel conductances. AF remodelling was also applied through adjusting biomarkers. The methods were compared upon replication of experimental data. (3) Results: compared to the percentage method, the biomarker approach resulted in smaller changes. RMP, APD20, APD50, and APD90 were changed in the percentage method by up to 11%, 500%, 50%, and 60%, respectively. In the biomarker approach, RMP, APD20, APD50, and APD90 were changed by up to 4.5%, 132%, 50%, and 35%, respectively. (4) Conclusion: applying AF remodelling through biomarker-based clustering resulted in channel conductance changes that were consistent with experimental data, while maintaining the highly non-linear relationships between channel conductances and biomarkers. Directly changing conductances in the healthy regional populations impacted the non-linear relationships and resulted in non-physiological APD20 and APD50 values. Full article
Show Figures

Figure 1

Figure 1
<p>Relative impact of channel conductances on regional biomarkers for both atrial models in healthy atrial populations with respect to the channel conductance with the largest impact. Red shows a positive relationship between biomarker and channel conductance, while blue shows a negative relationship.</p>
Full article ">Figure 2
<p>Impact on RMP. Boxplots showing population distribution for the Courtemanche model (<b>a</b>) and Maleckar model (<b>c</b>), for the healthy (red), AF remodelled biomarker (blue), and AF remodelled percentage (green) populations. The percentage change in the population mean for the Courtemanche model (<b>b</b>) and Maleckar model (<b>d</b>) for both remodelling techniques from the healthy populations.</p>
Full article ">Figure 3
<p>Impact on APA. Boxplots showing population distribution for the Courtemanche model (<b>a</b>) and Maleckar model (<b>c</b>), for the healthy (red), AF remodelled biomarker (blue), and AF remodelled percentage (green) populations. The percentage change in the population mean for the Courtemanche model (<b>b</b>) and Maleckar model (<b>d</b>) for both remodelling techniques from the healthy populations.</p>
Full article ">Figure 4
<p>Impact on APD20. Boxplots showing population distribution for the Courtemanche model (<b>a</b>) and Maleckar model (<b>c</b>), for the healthy (red), AF remodelled biomarker (blue), and AF remodelled percentage (green) populations. The percentage change in the population mean for the Courtemanche model (<b>b</b>) and Maleckar model (<b>d</b>) for both remodelling techniques from the healthy populations.</p>
Full article ">Figure 5
<p>Impact on APD50. Boxplots showing population distribution for the Courtemanche model (<b>a</b>) and Maleckar model (<b>c</b>), for the healthy (red), AF remodelled biomarker (blue), and AF remodelled percentage (green) populations. The percentage change in the population mean for the Courtemanche model (<b>b</b>) and Maleckar model (<b>d</b>) for both remodelling techniques from the healthy populations.</p>
Full article ">Figure 6
<p>Impact on APD90. Boxplots showing population distribution for the Courtemanche model (<b>a</b>) and Maleckar model (<b>c</b>), for the healthy (red), AF remodelled biomarker (blue), and AF remodelled percentage (green) populations. The percentage change in the population mean for the Courtemanche model (<b>b</b>) and Maleckar model (<b>d</b>) for both remodelling techniques from the healthy populations.</p>
Full article ">Figure 7
<p>Impact on gTo channel. Boxplots showing population distribution for the Courtemanche model (<b>a</b>) and Maleckar model (<b>c</b>), for the healthy (red), AF remodelled biomarker (blue), and AF remodelled percentage (green) populations. The percentage change in the population mean for the Courtemanche model (<b>b</b>) and Maleckar model (<b>d</b>) for both remodelling techniques from the healthy populations.</p>
Full article ">Figure 8
<p>Impact on gKur channel. Boxplots showing population distribution for the Courtemanche model (<b>a</b>) and Maleckar model (<b>c</b>), for the healthy (red), AF remodelled biomarker (blue), and AF remodelled percentage (green) populations. The percentage change in the population mean for the Courtemanche model (<b>b</b>) and Maleckar model (<b>d</b>) for both remodelling techniques from the healthy populations.</p>
Full article ">Figure 9
<p>Impact on gKs channel. Boxplots showing population distribution for the Courtemanche model (<b>a</b>) and Maleckar model (<b>c</b>), for the healthy (red), AF remodelled biomarker (blue), and AF remodelled percentage (green) populations. The percentage change in the population mean for the Courtemanche model (<b>b</b>) and Maleckar model (<b>d</b>) for both remodelling techniques from the healthy populations.</p>
Full article ">Figure 10
<p>Impact on gCaL channel. Boxplots showing population distribution for the Courtemanche model (<b>a</b>) and Maleckar model (<b>c</b>), for the healthy (red), AF remodelled biomarker (blue), and AF remodelled percentage (green) populations. The percentage change in the population mean for the Courtemanche model (<b>b</b>) and Maleckar model (<b>d</b>) for both remodelling techniques from the healthy populations.</p>
Full article ">Figure 11
<p>Impact on gK1 channel. Boxplots showing population distribution for the Courtemanche model (<b>a</b>) and Maleckar model (<b>c</b>), for the healthy (red), AF remodelled biomarker (blue), and AF remodelled percentage (green) populations. The percentage change in the population mean for the Courtemanche model (<b>b</b>) and Maleckar model (<b>d</b>) for both remodelling techniques from the healthy populations.</p>
Full article ">
14 pages, 288 KiB  
Article
A Theoretical Model for Global Optimization of Parallel Algorithms
by Julian Miller, Lukas Trümper, Christian Terboven and Matthias S. Müller
Mathematics 2021, 9(14), 1685; https://doi.org/10.3390/math9141685 - 17 Jul 2021
Cited by 6 | Viewed by 2333
Abstract
With the quickly evolving hardware landscape of high-performance computing (HPC) and its increasing specialization, the implementation of efficient software applications becomes more challenging. This is especially prevalent for domain scientists and may hinder the advances in large-scale simulation software. One idea to overcome [...] Read more.
With the quickly evolving hardware landscape of high-performance computing (HPC) and its increasing specialization, the implementation of efficient software applications becomes more challenging. This is especially prevalent for domain scientists and may hinder the advances in large-scale simulation software. One idea to overcome these challenges is through software abstraction. We present a parallel algorithm model that allows for global optimization of their synchronization and dataflow and optimal mapping to complex and heterogeneous architectures. The presented model strictly separates the structure of an algorithm from its executed functions. It utilizes a hierarchical decomposition of parallel design patterns as well-established building blocks for algorithmic structures and captures them in an abstract pattern tree (APT). A data-centric flow graph is constructed based on the APT, which acts as an intermediate representation for rich and automated structural transformations. We demonstrate the applicability of this model to three representative algorithms and show runtime speedups between 1.83 and 2.45 on a typical heterogeneous CPU/GPU architecture. Full article
Show Figures

Figure 1

Figure 1
<p>Pattern diagram of a stencil on <math display="inline"><semantics> <mrow> <mn>3</mn> <mo>×</mo> <mn>3</mn> </mrow> </semantics></math> matrix with a <math display="inline"><semantics> <mrow> <mn>2</mn> <mo>×</mo> <mn>2</mn> </mrow> </semantics></math> filter.</p>
Full article ">Figure 2
<p>Example of the algorithmic structure of an image manipulation algorithm that first computes the image gradients and then applies a 1D-filter to the image.</p>
Full article ">
17 pages, 721 KiB  
Article
Statistical Analysis for Contract Cheating in Chinese Universities
by Yuexia Wang and Zhihuo Xu
Mathematics 2021, 9(14), 1684; https://doi.org/10.3390/math9141684 - 17 Jul 2021
Cited by 8 | Viewed by 3461
Abstract
Contract cheating refers to students using third-party online resources to complete their coursework. It is not only a unilateral result of the student, but also has a relationship with educators, as well as social resources. However, little work has been performed to analyze [...] Read more.
Contract cheating refers to students using third-party online resources to complete their coursework. It is not only a unilateral result of the student, but also has a relationship with educators, as well as social resources. However, little work has been performed to analyze the complex behavioral aspects behind contract cheating in Chinese universities. To this end, this article presents a statistical analysis of contract cheating in Chinese universities. First, a unique parallel survey of educators and students was conducted to collect data from August 2018 to August 2020. Next, statistical analyses were performed to explore students’ experiences and attitudes toward contract cheating and the contextual factors that relate to these behaviors. Additionally, Pearson correlation tests were conducted on the survey data to find potential factors for contract cheating. Finally, a multivariate statistical technique, partial-least-squares regression (PLSR), was applied to interpret the results. The results of the statistical analysis showed that the main motivation for contract cheating is to receive good grades (the correlation coefficient ρ is 0.1309) from the perspective of students’ personal learning; from the side of university management, clear regulations (ρ=0.1378), penalties for cheating (ρ=0.1275), and the use of cheating-detection software (ρ=0.1186) can directly reduce cheating; from the perspective of teachers’ teaching, lecturers’ feedback on cheating on assignments (ρ=0.1510) can effectively reduce students’ cheating behavior; in addition, increasing students’ sense of achievement in course learning (ρ=0.2619) also helps to reduce the probability of cheating. Full article
(This article belongs to the Special Issue Quantitative Methods for Social Sciences)
Show Figures

Figure 1

Figure 1
<p>This figure shows the results of students’ understanding and perceptions of cheating on coursework. Q1–Q4 represent Questions 1–4 in <a href="#mathematics-09-01684-t001" class="html-table">Table 1</a>. The blue bars represent the percentage of students who understood the definition of cheating in the relevant coursework, university regulations, and teacher requirements for noncheating on assignments, respectively, while the red bars represent the percentage of students who did not understand or agree with the items in question.</p>
Full article ">Figure 2
<p>The satisfaction levels with their completed submissions by different frequencies of student engagement in cheating.</p>
Full article ">Figure 3
<p>The different accomplishments achieved from the coursework by the different frequencies of student engagement in cheating.</p>
Full article ">Figure 4
<p>This figure shows the results of educators’ perceptions of and responses to student engagement in cheating. Q1–Q4 and Q7–Q9 represent Questions 1–4 and 7–9 in <a href="#mathematics-09-01684-t002" class="html-table">Table 2</a>, respectively. The bottom bar represents the percentages of educators who understood the definition of cheating, whose universities had clear regulations and penalization rules, who emphasized cheating rules in the class, whose institutions have cheat-detection software tools, who given feedback to students when there was plagiarism in their coursework submissions, and who designed creative learning environments, respectively, while the top bars indicate the opposite results.</p>
Full article ">Figure 5
<p>Percent of variance explained in <span class="html-italic">y</span> with respect to the number of PLS components: (<b>a</b>) The data of the all participant; (<b>b</b>) the data of the student participants from the UCAS, first-class, and national key universities; and (<b>c</b>) the data of the students from the ordinary universities.</p>
Full article ">Figure 6
<p>The regression coefficients with respect to the potential factors: (<b>a</b>) The data of the all participant; (<b>b</b>) the data of the student participants from the UCAS, first-class, and national key universities; and (<b>c</b>) the data of the student participants from the ordinary universities. The potential factors are denoted as follows: students understand what plagiarism is (F1), clear regulations on plagiarism in coursework (F2), penalization for plagiarism (F3), lecturers have highlighted plagiarism in their courses (F4), weather teachers make lectures interesting and lively (F5), disinterest in the course assignment (F6), desire to receive a good final course grade (F7), poor time management (F8), fear of failure (F9), coursework is too easy (F10), teachers themselves have committed plagiarism, such as copying lecture notes (F11), lecturers give feedback on plagiarized assignments (F12), use of plagiarism detection tools (F13), lecturers design creative learning environments (F14), lecturers review assignments carefully (F15), satisfaction with teachers’ reviews of submissions (F16), satisfaction with their completed coursework (F17), doing coursework improves learning (F18), doing coursework builds confidence (F19), learn nothing by doing coursework (F20), and doing coursework is a waste of time (F21).</p>
Full article ">
18 pages, 1337 KiB  
Article
A Cooperative Network Packing Game with Simple Paths
by Sergei Dotsenko and Vladimir Mazalov
Mathematics 2021, 9(14), 1683; https://doi.org/10.3390/math9141683 - 17 Jul 2021
Viewed by 1817
Abstract
We consider a cooperative packing game in which the characteristic function is defined as the maximum number of independent simple paths of a fixed length included in a given coalition. The conditions under which the core exists in this game are established, and [...] Read more.
We consider a cooperative packing game in which the characteristic function is defined as the maximum number of independent simple paths of a fixed length included in a given coalition. The conditions under which the core exists in this game are established, and its form is obtained. For several particular graphs, the explicit form of the core is presented. Full article
(This article belongs to the Special Issue Mathematical Game Theory 2021)
Show Figures

Figure 1

Figure 1
<p>Covers of graph <span class="html-italic">G</span>.</p>
Full article ">Figure 2
<p>Terminal vertices in graph.</p>
Full article ">Figure 3
<p>Graph packing by vertex triplets.</p>
Full article ">Figure 4
<p>There are three possible packings of <math display="inline"><semantics> <msub> <mi>L</mi> <mn>5</mn> </msub> </semantics></math> by pairs. According to Lemma 8, <math display="inline"><semantics> <mrow> <msub> <mi>x</mi> <mn>1</mn> </msub> <mo>=</mo> <msub> <mi>x</mi> <mn>3</mn> </msub> <mo>=</mo> <msub> <mi>x</mi> <mn>5</mn> </msub> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math>. Moreover, <math display="inline"><semantics> <mrow> <msub> <mi>x</mi> <mn>1</mn> </msub> <mo>+</mo> <msub> <mi>x</mi> <mn>2</mn> </msub> <mo>=</mo> <mn>1</mn> <mo>,</mo> <msub> <mi>x</mi> <mn>3</mn> </msub> <mo>+</mo> <msub> <mi>x</mi> <mn>4</mn> </msub> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math>, so <math display="inline"><semantics> <mrow> <msub> <mi>x</mi> <mn>2</mn> </msub> <mo>=</mo> <msub> <mi>x</mi> <mn>4</mn> </msub> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math>. There is only unique point in the core: <math display="inline"><semantics> <mrow> <mo>(</mo> <mn>0</mn> <mo>;</mo> <mn>1</mn> <mo>;</mo> <mn>0</mn> <mo>;</mo> <mn>1</mn> <mo>;</mo> <mn>0</mn> <mo>)</mo> </mrow> </semantics></math>.</p>
Full article ">Figure 5
<p>There is only unique packing of <math display="inline"><semantics> <msub> <mi>L</mi> <mn>4</mn> </msub> </semantics></math> by pairs.</p>
Full article ">Figure 6
<p>There are three possible packings of <math display="inline"><semantics> <msub> <mi>L</mi> <mn>5</mn> </msub> </semantics></math> by triples. According to Lemma 8, <math display="inline"><semantics> <mrow> <msub> <mi>x</mi> <mn>1</mn> </msub> <mo>=</mo> <msub> <mi>x</mi> <mn>2</mn> </msub> <mo>=</mo> <msub> <mi>x</mi> <mn>4</mn> </msub> <mo>=</mo> <msub> <mi>x</mi> <mn>5</mn> </msub> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math>. Moreover, <math display="inline"><semantics> <mrow> <msub> <mi>x</mi> <mn>1</mn> </msub> <mo>+</mo> <msub> <mi>x</mi> <mn>2</mn> </msub> <mo>+</mo> <msub> <mi>x</mi> <mn>3</mn> </msub> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math>, so <math display="inline"><semantics> <mrow> <msub> <mi>x</mi> <mn>3</mn> </msub> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math>. There is only unique point in the core: <math display="inline"><semantics> <mrow> <mo>(</mo> <mn>0</mn> <mo>;</mo> <mn>0</mn> <mo>;</mo> <mn>1</mn> <mo>;</mo> <mn>0</mn> <mo>;</mo> <mn>0</mn> <mo>)</mo> </mrow> </semantics></math>.</p>
Full article ">Figure 7
<p><math display="inline"><semantics> <msub> <mi>C</mi> <mn>5</mn> </msub> </semantics></math>: by “rotating” the packing set, one can see that each vertex is not included in some packing. So, <math display="inline"><semantics> <mrow> <msub> <mi>x</mi> <mn>1</mn> </msub> <mo>=</mo> <mo>…</mo> <mo>=</mo> <msub> <mi>x</mi> <mn>5</mn> </msub> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math>, which contradicts condition <math display="inline"><semantics> <mrow> <msub> <mi>x</mi> <mn>1</mn> </msub> <mo>+</mo> <mo>…</mo> <mo>+</mo> <msub> <mi>x</mi> <mn>5</mn> </msub> <mo>=</mo> <mn>2</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 8
<p>Two packings of <math display="inline"><semantics> <msub> <mi>C</mi> <mn>6</mn> </msub> </semantics></math>. All vertices are in the packing.</p>
Full article ">Figure 9
<p><math display="inline"><semantics> <msub> <mi>C</mi> <mn>4</mn> </msub> </semantics></math>: by “rotating” the packing set, one can see that each vertex is not included in some packing, so <math display="inline"><semantics> <mrow> <msub> <mi>x</mi> <mn>1</mn> </msub> <mo>=</mo> <mo>…</mo> <mo>=</mo> <msub> <mi>x</mi> <mn>4</mn> </msub> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math>, which contradicts condition <math display="inline"><semantics> <mrow> <msub> <mi>x</mi> <mn>1</mn> </msub> <mo>+</mo> <mo>…</mo> <mo>+</mo> <msub> <mi>x</mi> <mn>4</mn> </msub> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 10
<p>Finding a point in the core.</p>
Full article ">Figure 11
<p>Star graph, <math display="inline"><semantics> <mrow> <mi>n</mi> <mo>=</mo> <mn>4</mn> </mrow> </semantics></math>. When the graph is rotated, each vertex of the graph except vertex 1 is not included in some packing, so <math display="inline"><semantics> <mrow> <msub> <mi>x</mi> <mn>2</mn> </msub> <mo>=</mo> <mo>…</mo> <mo>=</mo> <msub> <mi>x</mi> <mn>5</mn> </msub> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math>. <math display="inline"><semantics> <mrow> <msub> <mi>x</mi> <mn>1</mn> </msub> <mo>+</mo> <msub> <mi>x</mi> <mn>2</mn> </msub> <mo>+</mo> <msub> <mi>x</mi> <mn>3</mn> </msub> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math> yields <math display="inline"><semantics> <mrow> <msub> <mi>x</mi> <mn>1</mn> </msub> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 12
<p>Each vertex is at any packing.</p>
Full article ">Figure 13
<p>Each vertex from <span class="html-italic">B</span> is not included in some packings, so <math display="inline"><semantics> <mrow> <msub> <mi>x</mi> <mn>4</mn> </msub> <mo>=</mo> <mo>…</mo> <mo>=</mo> <msub> <mi>x</mi> <mn>7</mn> </msub> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math>, and <math display="inline"><semantics> <mrow> <msub> <mi>x</mi> <mn>1</mn> </msub> <mo>=</mo> <msub> <mi>x</mi> <mn>2</mn> </msub> <mo>=</mo> <msub> <mi>x</mi> <mn>3</mn> </msub> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 14
<p>Packing by pairs for Zachary’s karate club network.</p>
Full article ">Figure 15
<p>Packing by triplets for Zachary’s karate club network.</p>
Full article ">
20 pages, 1165 KiB  
Article
Altruistic Preference Models of Low-Carbon E-Commerce Supply Chain
by Jianfeng Liu, Liguo Zhou and Yuyan Wang
Mathematics 2021, 9(14), 1682; https://doi.org/10.3390/math9141682 - 17 Jul 2021
Cited by 15 | Viewed by 2724
Abstract
With the gradual popularity of online sales and the enhancement of consumers’ low-carbon awareness, the low-carbon e-commerce supply chain (LCECSC) has developed rapidly. However, most of the current research on LCECSC assumes that the decision-making body is rational, and there is less research [...] Read more.
With the gradual popularity of online sales and the enhancement of consumers’ low-carbon awareness, the low-carbon e-commerce supply chain (LCECSC) has developed rapidly. However, most of the current research on LCECSC assumes that the decision-making body is rational, and there is less research on the irrational behavior of the e-platform altruistic preference. Therefore, aiming at the LCECSC composed of a single e-platform and a single manufacturer, this paper establishes two basic models with or without altruistic preference. Additionally, this paper combines the characteristics of online sales and assumes that altruistic preference is a proportional function of commission, then establishes a commission-based extended model with altruistic preference to further explore the influence of commission on its altruistic preference. The current literature does not consider this point, nor does it analyze the influence of other parameters on the degree of altruism preference. By comparing the optimal decisions and numerical analysis among the models, the following conclusions can be drawn that: (1) different from the traditional offline supply chain, the profit of the dominator e-platform is lower than the profit of the follower manufacturer; (2) when the consumers’ carbon emission reduction elasticity coefficient increases, service level, sales price, carbon emission reduction, sales, supply chain members profits, and system profit increase, ultimately improving economic and environmental performances; (3) the altruistic preference behavior of the e-platform is a behavior of ‘profit transferring’. The moderate altruistic preference is conducive to the stable operation and long-term development of LCECSC. Full article
Show Figures

Figure 1

Figure 1
<p>The model structure of the low-carbon e-commerce supply chain (LCECSC).</p>
Full article ">Figure 2
<p>Changing graphs of the decision variables in the basic models with the altruistic preference coefficient: (<b>a</b>) the changes of <math display="inline"><semantics> <mi>s</mi> </semantics></math> over <math display="inline"><semantics> <mi mathvariant="sans-serif">θ</mi> </semantics></math>; (<b>b</b>) the change of <math display="inline"><semantics> <mi>p</mi> </semantics></math> over <math display="inline"><semantics> <mi>θ</mi> </semantics></math>; (<b>c</b>) the changes of <math display="inline"><semantics> <mi>h</mi> </semantics></math> over <math display="inline"><semantics> <mi>θ</mi> </semantics></math>; (<b>d</b>) the changes of <math display="inline"><semantics> <mi>q</mi> </semantics></math> over <math display="inline"><semantics> <mi>θ</mi> </semantics></math>; (<b>e</b>) the changes of profits over <math display="inline"><semantics> <mrow> <mo> </mo> <mi>θ</mi> </mrow> </semantics></math>.</p>
Full article ">Figure 3
<p>Graphs of the changes of each variable in the extended model and the basic model without altruistic preference: (<b>a</b>) the changes of <math display="inline"><semantics> <mi>s</mi> </semantics></math> over <math display="inline"><semantics> <mi mathvariant="sans-serif">ρ</mi> </semantics></math>; (<b>b</b>) the changes of <math display="inline"><semantics> <mi>p</mi> </semantics></math> over <math display="inline"><semantics> <mi>ρ</mi> </semantics></math>; (<b>c</b>) the changes of <math display="inline"><semantics> <mi>h</mi> </semantics></math> over <math display="inline"><semantics> <mi>ρ</mi> </semantics></math>; (<b>d</b>) the changes of <math display="inline"><semantics> <mi>q</mi> </semantics></math> over <math display="inline"><semantics> <mi>ρ</mi> </semantics></math>; (<b>e</b>) the changes of the manufacturer profits over<math display="inline"><semantics> <mrow> <mo> </mo> <mi>ρ</mi> </mrow> </semantics></math>; (<b>f</b>) the changes of the e-platform’s profit over<math display="inline"><semantics> <mrow> <mo> </mo> <mi>ρ</mi> </mrow> </semantics></math>; (<b>g</b>) the changes of the systems’ profits over<math display="inline"><semantics> <mrow> <mo> </mo> <mi>ρ</mi> </mrow> </semantics></math>.</p>
Full article ">Figure 3 Cont.
<p>Graphs of the changes of each variable in the extended model and the basic model without altruistic preference: (<b>a</b>) the changes of <math display="inline"><semantics> <mi>s</mi> </semantics></math> over <math display="inline"><semantics> <mi mathvariant="sans-serif">ρ</mi> </semantics></math>; (<b>b</b>) the changes of <math display="inline"><semantics> <mi>p</mi> </semantics></math> over <math display="inline"><semantics> <mi>ρ</mi> </semantics></math>; (<b>c</b>) the changes of <math display="inline"><semantics> <mi>h</mi> </semantics></math> over <math display="inline"><semantics> <mi>ρ</mi> </semantics></math>; (<b>d</b>) the changes of <math display="inline"><semantics> <mi>q</mi> </semantics></math> over <math display="inline"><semantics> <mi>ρ</mi> </semantics></math>; (<b>e</b>) the changes of the manufacturer profits over<math display="inline"><semantics> <mrow> <mo> </mo> <mi>ρ</mi> </mrow> </semantics></math>; (<b>f</b>) the changes of the e-platform’s profit over<math display="inline"><semantics> <mrow> <mo> </mo> <mi>ρ</mi> </mrow> </semantics></math>; (<b>g</b>) the changes of the systems’ profits over<math display="inline"><semantics> <mrow> <mo> </mo> <mi>ρ</mi> </mrow> </semantics></math>.</p>
Full article ">
13 pages, 308 KiB  
Article
Discrete Time Hybrid Semi-Markov Models in Manpower Planning
by Brecht Verbeken and Marie-Anne Guerry
Mathematics 2021, 9(14), 1681; https://doi.org/10.3390/math9141681 - 16 Jul 2021
Cited by 7 | Viewed by 2845
Abstract
Discrete time Markov models are used in a wide variety of social sciences. However, these models possess the memoryless property, which makes them less suitable for certain applications. Semi-Markov models allow for more flexible sojourn time distributions, which can accommodate for duration of [...] Read more.
Discrete time Markov models are used in a wide variety of social sciences. However, these models possess the memoryless property, which makes them less suitable for certain applications. Semi-Markov models allow for more flexible sojourn time distributions, which can accommodate for duration of stay effects. An overview of differences and possible obstacles regarding the use of Markov and semi-Markov models in manpower planning was first given by Valliant and Milkovich (1977). We further elaborate on their insights and introduce hybrid semi-Markov models for open systems with transition-dependent sojourn time distributions. Hybrid semi-Markov models aim to reduce model complexity in terms of the number of parameters to be estimated by only taking into account duration of stay effects for those transitions for which it is useful. Prediction equations for the stock vector are derived and discussed. Furthermore, the insights are illustrated and discussed based on a real world personnel dataset. The hybrid semi-Markov model is compared with the Markov and the semi-Markov models by diverse model selection criteria. Full article
Show Figures

Figure 1

Figure 1
<p>The seniority based stock matrix, consisting of columns <math display="inline"><semantics> <mrow> <mi mathvariant="bold">N</mi> <mo>(</mo> <mi>t</mi> <mo>,</mo> <mi>k</mi> <mo>)</mo> </mrow> </semantics></math>.</p>
Full article ">Figure 2
<p>Decision flowchart for the hybrid semi-Markov model.</p>
Full article ">Figure 3
<p>Graph of the states and state transitions.</p>
Full article ">
22 pages, 551 KiB  
Article
Self-Expressive Kernel Subspace Clustering Algorithm for Categorical Data with Embedded Feature Selection
by Hui Chen, Kunpeng Xu, Lifei Chen and Qingshan Jiang
Mathematics 2021, 9(14), 1680; https://doi.org/10.3390/math9141680 - 16 Jul 2021
Cited by 5 | Viewed by 1918
Abstract
Kernel clustering of categorical data is a useful tool to process the separable datasets and has been employed in many disciplines. Despite recent efforts, existing methods for kernel clustering remain a significant challenge due to the assumption of feature independence and equal weights. [...] Read more.
Kernel clustering of categorical data is a useful tool to process the separable datasets and has been employed in many disciplines. Despite recent efforts, existing methods for kernel clustering remain a significant challenge due to the assumption of feature independence and equal weights. In this study, we propose a self-expressive kernel subspace clustering algorithm for categorical data (SKSCC) using the self-expressive kernel density estimation (SKDE) scheme, as well as a new feature-weighted non-linear similarity measurement. In the SKSCC algorithm, we propose an effective non-linear optimization method to solve the clustering algorithm’s objective function, which not only considers the relationship between attributes in a non-linear space but also assigns a weight to each attribute in the algorithm to measure the degree of correlation. A series of experiments on some widely used synthetic and real-world datasets demonstrated the better effectiveness and efficiency of the proposed algorithm compared with other state-of-the-art methods, in terms of non-linear relationship exploration among attributes. Full article
(This article belongs to the Special Issue Statistical Data Modeling and Machine Learning with Applications)
Show Figures

Figure 1

Figure 1
<p>Analysis of weight with different <math display="inline"><semantics> <mi>θ</mi> </semantics></math>.</p>
Full article ">Figure 2
<p>Comparison of F-score with different algorithms on different datasets.</p>
Full article ">Figure 2 Cont.
<p>Comparison of F-score with different algorithms on different datasets.</p>
Full article ">Figure 3
<p>Weight distributions generated by two algorithms on Breastcancer dataset.</p>
Full article ">Figure 4
<p>F-score values of the different clustering algorithms on the Breastcancer dataset with original and reduced feature sets.</p>
Full article ">Figure 5
<p>F-Score values of the different clustering algorithms on the Breastcancer dataset with original and reduced feature sets.</p>
Full article ">
Previous Issue
Next Issue
Back to TopTop