Editor’s Choice Articles

Editor’s Choice articles are based on recommendations by the scientific editors of MDPI journals from around the world. Editors select a small number of articles recently published in the journal that they believe will be particularly interesting to readers, or important in the respective research area. The aim is to provide a snapshot of some of the most exciting work published in the various research areas of the journal.

Order results
Result details
Results per page
Select all
Export citation of selected articles as:

Article

12 pages, 831 KiB  
Article
Some Qualitative Behavior of Solutions of General Class of Difference Equations
by Osama Moaaz, Dimplekumar Chalishajar and Omar Bazighifan
Mathematics 2019, 7(7), 585; https://doi.org/10.3390/math7070585 - 01 Jul 2019
Cited by 36 | Viewed by 2733
Abstract
In this work, we consider the general class of difference equations (covered many equations that have been studied by other authors or that have never been studied before), as a means of establishing general theorems, for the asymptotic behavior of its solutions. Namely, [...] Read more.
In this work, we consider the general class of difference equations (covered many equations that have been studied by other authors or that have never been studied before), as a means of establishing general theorems, for the asymptotic behavior of its solutions. Namely, we state new necessary and sufficient conditions for local asymptotic stability of these equations. In addition, we study the periodic solution with period two and three. Our results essentially extend and improve the earlier ones. Full article
Show Figures

Figure 1

38 pages, 596 KiB  
Article
Long-Time Asymptotics of a Three-Component Coupled mKdV System
by Wen-Xiu Ma
Mathematics 2019, 7(7), 573; https://doi.org/10.3390/math7070573 - 27 Jun 2019
Cited by 77 | Viewed by 2818
Abstract
We present an application of the nonlinear steepest descent method to a three-component coupled mKdV system associated with a 4 × 4 matrix spectral problem. An integrable coupled mKdV hierarchy with three potentials is first generated. Based on the corresponding oscillatory Riemann-Hilbert problem, [...] Read more.
We present an application of the nonlinear steepest descent method to a three-component coupled mKdV system associated with a 4 × 4 matrix spectral problem. An integrable coupled mKdV hierarchy with three potentials is first generated. Based on the corresponding oscillatory Riemann-Hilbert problem, the leading asympototics of the three-component mKdV system is then evaluated by using the nonlinear steepest descent method. Full article
Show Figures

Figure 1

16 pages, 1504 KiB  
Article
Back to Basics: Meaning of the Parameters of Fractional Order PID Controllers
by Inés Tejado, Blas M. Vinagre, José Emilio Traver, Javier Prieto-Arranz and Cristina Nuevo-Gallardo
Mathematics 2019, 7(6), 530; https://doi.org/10.3390/math7060530 - 11 Jun 2019
Cited by 49 | Viewed by 5522
Abstract
The beauty of the proportional-integral-derivative (PID) algorithm for feedback control is its simplicity and efficiency. Those are the main reasons why PID controller is the most common form of feedback. PID combines the three natural ways of taking into account the error: the [...] Read more.
The beauty of the proportional-integral-derivative (PID) algorithm for feedback control is its simplicity and efficiency. Those are the main reasons why PID controller is the most common form of feedback. PID combines the three natural ways of taking into account the error: the actual (proportional), the accumulated (integral), and the predicted (derivative) values; the three gains depend on the magnitude of the error, the time required to eliminate the accumulated error, and the prediction horizon of the error. This paper explores the new meaning of integral and derivative actions, and gains, derived by the consideration of non-integer integration and differentiation orders, i.e., for fractional order PID controllers. The integral term responds with selective memory to the error because of its non-integer order λ , and corresponds to the area of the projection of the error curve onto a plane (it is not the classical area under the error curve). Moreover, for a fractional proportional-integral (PI) controller scheme with automatic reset, both the velocity and the shape of reset can be modified with λ . For its part, the derivative action refers to the predicted future values of the error, but based on different prediction horizons (actually, linear and non-linear extrapolations) depending on the value of the differentiation order, μ . Likewise, in case of a proportional-derivative (PD) structure with a noise filter, the value of μ allows different filtering effects on the error signal to be attained. Similarities and differences between classical and fractional PIDs, as well as illustrative control examples, are given for a best understanding of new possibilities of control with the latter. Examples are given for illustration purposes. Full article
(This article belongs to the Special Issue Fractional Order Systems)
Show Figures

Figure 1

20 pages, 1109 KiB  
Article
Economic Machine-Learning-Based Predictive Control of Nonlinear Systems
by Zhe Wu and Panagiotis D. Christofides
Mathematics 2019, 7(6), 494; https://doi.org/10.3390/math7060494 - 01 Jun 2019
Cited by 40 | Viewed by 5501
Abstract
In this work, a Lyapunov-based economic model predictive control (LEMPC) method is developed to address economic optimality and closed-loop stability of nonlinear systems using machine learning-based models to make predictions. Specifically, an ensemble of recurrent neural network (RNN) models via a k-fold [...] Read more.
In this work, a Lyapunov-based economic model predictive control (LEMPC) method is developed to address economic optimality and closed-loop stability of nonlinear systems using machine learning-based models to make predictions. Specifically, an ensemble of recurrent neural network (RNN) models via a k-fold cross validation is first developed to capture process dynamics in an operating region. Then, the LEMPC using an RNN ensemble is designed to maintain the closed-loop state in a stability region and optimize process economic benefits simultaneously. Parallel computing is employed to improve computational efficiency of real-time implementation of LEMPC with an RNN ensemble. The proposed machine-learning-based LEMPC method is demonstrated using a nonlinear chemical process example. Full article
Show Figures

Figure 1

20 pages, 984 KiB  
Article
Joint Inventory and Pricing Policy for an Online to Offline Closed-Loop Supply Chain Model with Random Defective Rate and Returnable Transport Items
by Biswajit Sarkar, Mehran Ullah and Seok-Beom Choi
Mathematics 2019, 7(6), 497; https://doi.org/10.3390/math7060497 - 01 Jun 2019
Cited by 25 | Viewed by 4243
Abstract
Environmental deterioration is one of the current hot topics of the business world. To cope with the negative environmental impacts of corporate activities, researchers introduced the concept of closed-loop supply chain (CLSC) management and remanufacturing. This paper studies joint inventory and pricing decisions [...] Read more.
Environmental deterioration is one of the current hot topics of the business world. To cope with the negative environmental impacts of corporate activities, researchers introduced the concept of closed-loop supply chain (CLSC) management and remanufacturing. This paper studies joint inventory and pricing decisions in a multi-echelon CLSC model that considers online to offline (O2O) business strategy. An imperfect production process is examined with a random defective rate that follows a probability distribution. The results show that the O2O channel increases the profit of the system. For the defective rate, three different distributions are considered and three examples are solved. The results of the three examples conclude that the highest profit is generated when the defective rate follows a uniform distribution. Furthermore, based on the salvage value of defective items, two cases were studied. Results and sensitivity analysis show that the increase in defective rate does not reduce total profit in every situation, as perceived by the existing literature. Sensitivity analysis and numerical examples are given to show robustness of the model and draw important managerial insights. Full article
Show Figures

Figure 1

20 pages, 291 KiB  
Article
Positive Solutions for a Hadamard Fractional p-Laplacian Three-Point Boundary Value Problem
by Jiqiang Jiang, Donal O’Regan, Jiafa Xu and Yujun Cui
Mathematics 2019, 7(5), 439; https://doi.org/10.3390/math7050439 - 17 May 2019
Cited by 24 | Viewed by 2370
Abstract
This article is to study a three-point boundary value problem of Hadamard fractional p-Laplacian differential equation. When our nonlinearity grows ( p 1 ) -superlinearly and ( p 1 ) -sublinearly, the existence of positive solutions is obtained via fixed [...] Read more.
This article is to study a three-point boundary value problem of Hadamard fractional p-Laplacian differential equation. When our nonlinearity grows ( p 1 ) -superlinearly and ( p 1 ) -sublinearly, the existence of positive solutions is obtained via fixed point index. Moreover, using an increasing operator fixed-point theorem, the uniqueness of positive solutions and uniform convergence sequences are also established. Full article
35 pages, 3547 KiB  
Article
Enhancing Elephant Herding Optimization with Novel Individual Updating Strategies for Large-Scale Optimization Problems
by Jiang Li, Lihong Guo, Yan Li and Chang Liu
Mathematics 2019, 7(5), 395; https://doi.org/10.3390/math7050395 - 30 Apr 2019
Cited by 37 | Viewed by 3963
Abstract
Inspired by the behavior of elephants in nature, elephant herd optimization (EHO) was proposed recently for global optimization. Like most other metaheuristic algorithms, EHO does not use the previous individuals in the later updating process. If the useful information in the previous individuals [...] Read more.
Inspired by the behavior of elephants in nature, elephant herd optimization (EHO) was proposed recently for global optimization. Like most other metaheuristic algorithms, EHO does not use the previous individuals in the later updating process. If the useful information in the previous individuals were fully exploited and used in the later optimization process, the quality of solutions may be improved significantly. In this paper, we propose several new updating strategies for EHO, in which one, two, or three individuals are selected from the previous iterations, and their useful information is incorporated into the updating process. Accordingly, the final individual at this iteration is generated according to the elephant generated by the basic EHO, and the selected previous elephants through a weighted sum. The weights are determined by a random number and the fitness of the elephant individuals at the previous iteration. We incorporated each of the six individual updating strategies individually into the basic EHO, creating six improved variants of EHO. We benchmarked these proposed methods using sixteen test functions. Our experimental results demonstrated that the proposed improved methods significantly outperformed the basic EHO. Full article
(This article belongs to the Special Issue Evolutionary Computation)
Show Figures

Figure 1

25 pages, 512 KiB  
Article
A Two-Echelon Supply Chain Management With Setup Time and Cost Reduction, Quality Improvement and Variable Production Rate
by Bikash Koli Dey, Biswajit Sarkar and Sarla Pareek
Mathematics 2019, 7(4), 328; https://doi.org/10.3390/math7040328 - 03 Apr 2019
Cited by 39 | Viewed by 5350
Abstract
This model investigates the variable production cost for a production house; under a two-echelon supply chain management where a single vendor and multi-retailers are involved. This production system goes through a long run system and generates an out-of-control state due to different issues [...] Read more.
This model investigates the variable production cost for a production house; under a two-echelon supply chain management where a single vendor and multi-retailers are involved. This production system goes through a long run system and generates an out-of-control state due to different issues and produces defective items. This model considers the reduction of the defective rate and setup cost through investment. A discrete investment for setup cost reduction and a continuous investment is considered to reduce the defective rate and to increase the quality of products. Setup and processing time are dependent on lead time in this model. The model is solved analytically to find the optimal values of the production rate, safety factors, optimum quantity, lead time length, investment for setup cost reduction, and the probability of the production process going out-of-control. An efficient algorithm is constructed to find the optimal solution numerically and sensitivity analysis is given to show the impact of different parameters. A case study and different cases are also given to validate the model. Full article
Show Figures

Figure 1

10 pages, 273 KiB  
Article
The Bounds of Vertex Padmakar–Ivan Index on k-Trees
by Shaohui Wang, Zehui Shao, Jia-Bao Liu and Bing Wei
Mathematics 2019, 7(4), 324; https://doi.org/10.3390/math7040324 - 01 Apr 2019
Cited by 18 | Viewed by 2705
Abstract
The Padmakar–Ivan ( P I ) index is a distance-based topological index and a molecular structure descriptor, which is the sum of the number of vertices over all edges u v of a graph such that these vertices are not equidistant from u [...] Read more.
The Padmakar–Ivan ( P I ) index is a distance-based topological index and a molecular structure descriptor, which is the sum of the number of vertices over all edges u v of a graph such that these vertices are not equidistant from u and v. In this paper, we explore the results of P I -indices from trees to recursively clustered trees, the k-trees. Exact sharp upper bounds of PI indices on k-trees are obtained by the recursive relationships, and the corresponding extremal graphs are given. In addition, we determine the P I -values on some classes of k-trees and compare them, and our results extend and enrich some known conclusions. Full article
(This article belongs to the Special Issue Graph-Theoretic Problems and Their New Applications)
22 pages, 3000 KiB  
Article
The Multivariate Theory of Connections
by Daniele Mortari and Carl Leake
Mathematics 2019, 7(3), 296; https://doi.org/10.3390/math7030296 - 22 Mar 2019
Cited by 37 | Viewed by 4439
Abstract
This paper extends the univariate Theory of Connections, introduced in (Mortari, 2017), to the multivariate case on rectangular domains with detailed attention to the bivariate case. In particular, it generalizes the bivariate Coons surface, introduced by (Coons, 1984), by providing analytical expressions, called [...] Read more.
This paper extends the univariate Theory of Connections, introduced in (Mortari, 2017), to the multivariate case on rectangular domains with detailed attention to the bivariate case. In particular, it generalizes the bivariate Coons surface, introduced by (Coons, 1984), by providing analytical expressions, called constrained expressions, representing all possible surfaces with assigned boundary constraints in terms of functions and arbitrary-order derivatives. In two dimensions, these expressions, which contain a freely chosen function, g ( x , y ) , satisfy all constraints no matter what the g ( x , y ) is. The boundary constraints considered in this article are Dirichlet, Neumann, and any combinations of them. Although the focus of this article is on two-dimensional spaces, the final section introduces the Multivariate Theory of Connections, validated by mathematical proof. This represents the multivariate extension of the Theory of Connections subject to arbitrary-order derivative constraints in rectangular domains. The main task of this paper is to provide an analytical procedure to obtain constrained expressions in any space that can be used to transform constrained problems into unconstrained problems. This theory is proposed mainly to better solve PDE and stochastic differential equations. Full article
(This article belongs to the Special Issue Computational Mathematics, Algorithms, and Data Processing)
Show Figures

Figure 1

18 pages, 2526 KiB  
Article
An Efficient Numerical Technique for the Nonlinear Fractional Kolmogorov–Petrovskii–Piskunov Equation
by Pundikala Veeresha, Doddabhadrappla Gowda Prakasha and Dumitru Baleanu
Mathematics 2019, 7(3), 265; https://doi.org/10.3390/math7030265 - 14 Mar 2019
Cited by 50 | Viewed by 3172
Abstract
The q -homotopy analysis transform method ( q -HATM) is employed to find the solution for the fractional Kolmogorov–Petrovskii–Piskunov (FKPP) equation in the present frame work. To ensure the applicability and efficiency of the proposed algorithm, we consider three distinct initial conditions with [...] Read more.
The q -homotopy analysis transform method ( q -HATM) is employed to find the solution for the fractional Kolmogorov–Petrovskii–Piskunov (FKPP) equation in the present frame work. To ensure the applicability and efficiency of the proposed algorithm, we consider three distinct initial conditions with two of them having Jacobi elliptic functions. The numerical simulations have been conducted to verify that the proposed scheme is reliable and accurate. Moreover, the uniqueness and convergence analysis for the projected problem is also presented. The obtained results elucidate that the proposed technique is easy to implement and very effective to analyze the complex problems arising in science and technology. Full article
Show Figures

Figure 1

24 pages, 5440 KiB  
Article
Solving Non-Linear Fractional Variational Problems Using Jacobi Polynomials
by Harendra Singh, Rajesh K. Pandey and Hari Mohan Srivastava
Mathematics 2019, 7(3), 224; https://doi.org/10.3390/math7030224 - 27 Feb 2019
Cited by 41 | Viewed by 3413
Abstract
The aim of this paper is to solve a class of non-linear fractional variational problems (NLFVPs) using the Ritz method and to perform a comparative study on the choice of different polynomials in the method. The Ritz method has allowed many researchers to [...] Read more.
The aim of this paper is to solve a class of non-linear fractional variational problems (NLFVPs) using the Ritz method and to perform a comparative study on the choice of different polynomials in the method. The Ritz method has allowed many researchers to solve different forms of fractional variational problems in recent years. The NLFVP is solved by applying the Ritz method using different orthogonal polynomials. Further, the approximate solution is obtained by solving a system of nonlinear algebraic equations. Error and convergence analysis of the discussed method is also provided. Numerical simulations are performed on illustrative examples to test the accuracy and applicability of the method. For comparison purposes, different polynomials such as 1) Shifted Legendre polynomials, 2) Shifted Chebyshev polynomials of the first kind, 3) Shifted Chebyshev polynomials of the third kind, 4) Shifted Chebyshev polynomials of the fourth kind, and 5) Gegenbauer polynomials are considered to perform the numerical investigations in the test examples. Further, the obtained results are presented in the form of tables and figures. The numerical results are also compared with some known methods from the literature. Full article
Show Figures

Figure 1

17 pages, 307 KiB  
Article
Dynamic Keynesian Model of Economic Growth with Memory and Lag
by Vasily E. Tarasov and Valentina V. Tarasova
Mathematics 2019, 7(2), 178; https://doi.org/10.3390/math7020178 - 15 Feb 2019
Cited by 20 | Viewed by 5379
Abstract
A mathematical model of economic growth with fading memory and continuous distribution of delay time is suggested. This model can be considered as a generalization of the standard Keynesian macroeconomic model. To take into account the memory and gamma-distributed lag we use the [...] Read more.
A mathematical model of economic growth with fading memory and continuous distribution of delay time is suggested. This model can be considered as a generalization of the standard Keynesian macroeconomic model. To take into account the memory and gamma-distributed lag we use the Abel-type integral and integro-differential operators with the confluent hypergeometric Kummer function in the kernel. These operators allow us to propose an economic accelerator, in which the memory and lag are taken into account. The fractional differential equation, which describes the dynamics of national income in this generalized model, is suggested. The solution of this fractional differential equation is obtained in the form of series of the confluent hypergeometric Kummer functions. The asymptotic behavior of national income, which is described by this solution, is considered. Full article
(This article belongs to the Special Issue Advanced Mathematical Methods: Theory and Applications)
15 pages, 2766 KiB  
Article
A Partial-Consensus Posterior-Aggregation FAHP Method—Supplier Selection Problem as an Example
by Yu-Cheng Wang and Tin-Chih Toly Chen
Mathematics 2019, 7(2), 179; https://doi.org/10.3390/math7020179 - 15 Feb 2019
Cited by 37 | Viewed by 2951
Abstract
Existing fuzzy analytic hierarchy process (FAHP) methods usually aggregate the fuzzy pairwise comparison results produced by multiple decision-makers (DMs) rather than the fuzzy weights estimations. This is problematic because fuzzy pairwise comparison results are subject to uncertainty and lack consensus. To address this [...] Read more.
Existing fuzzy analytic hierarchy process (FAHP) methods usually aggregate the fuzzy pairwise comparison results produced by multiple decision-makers (DMs) rather than the fuzzy weights estimations. This is problematic because fuzzy pairwise comparison results are subject to uncertainty and lack consensus. To address this problem, a partial-consensus posterior-aggregation FAHP (PCPA-FAHP) approach is proposed in this study. The PCPA-FAHP approach seeks a partial consensus among most DMs instead of an overall consensus among all DMs, thereby increasing the possibility of reaching a consensus. Subsequently, the aggregation result is defuzzified using the prevalent center-of-gravity method. The PCPA-FAHP approach was applied to a supplier selection problem to validate its effectiveness. According to the experimental results, the PCPA-FAHP approach not only successfully found out the partial consensus among the DMs, but also shrunk the widths of the estimated fuzzy weights to enhance the precision of the FAHP analysis. Full article
(This article belongs to the Special Issue Fuzzy Sets, Fuzzy Logic and Their Applications)
Show Figures

Figure 1

15 pages, 280 KiB  
Article
Hankel and Toeplitz Determinants for a Subclass of q-Starlike Functions Associated with a General Conic Domain
by Hari M. Srivastava, Qazi Zahoor Ahmad, Nasir Khan, Nazar Khan and Bilal Khan
Mathematics 2019, 7(2), 181; https://doi.org/10.3390/math7020181 - 15 Feb 2019
Cited by 104 | Viewed by 3495
Abstract
By using a certain general conic domain as well as the quantum (or q-) calculus, here we define and investigate a new subclass of normalized analytic and starlike functions in the open unit disk U . In particular, we find the Hankel [...] Read more.
By using a certain general conic domain as well as the quantum (or q-) calculus, here we define and investigate a new subclass of normalized analytic and starlike functions in the open unit disk U . In particular, we find the Hankel determinant and the Toeplitz matrices for this newly-defined class of analytic q-starlike functions. We also highlight some known consequences of our main results. Full article
14 pages, 254 KiB  
Article
New Integral Inequalities via the Katugampola Fractional Integrals for Functions Whose Second Derivatives Are Strongly η-Convex
by Seth Kermausuor, Eze R. Nwaeze and Ana M. Tameru
Mathematics 2019, 7(2), 183; https://doi.org/10.3390/math7020183 - 15 Feb 2019
Cited by 17 | Viewed by 2696
Abstract
In this paper, we introduced some new integral inequalities of the Hermite–Hadamard type for functions whose second derivatives in absolute values at certain powers are strongly η -convex functions via the Katugampola fractional integrals. Full article
(This article belongs to the Special Issue Inequalities)
26 pages, 747 KiB  
Article
Lexicographic Orders of Intuitionistic Fuzzy Values and Their Relationships
by Feng Feng, Meiqi Liang, Hamido Fujita, Ronald R. Yager and Xiaoyan Liu
Mathematics 2019, 7(2), 166; https://doi.org/10.3390/math7020166 - 13 Feb 2019
Cited by 45 | Viewed by 2683
Abstract
Intuitionistic fuzzy multiple attribute decision making deals with the issue of ranking alternatives based on the decision information quantified in terms of intuitionistic fuzzy values. Lexicographic orders can serve as efficient and indispensable tools for comparing intuitionistic fuzzy values. This paper introduces a [...] Read more.
Intuitionistic fuzzy multiple attribute decision making deals with the issue of ranking alternatives based on the decision information quantified in terms of intuitionistic fuzzy values. Lexicographic orders can serve as efficient and indispensable tools for comparing intuitionistic fuzzy values. This paper introduces a number of lexicographic orders by means of several measures such as the membership, non-membership, score, accuracy and expectation score functions. Some equivalent characterizations and illustrative examples are provided, from which the relationships among these lexicographic orders are ascertained. We also propose three different compatible properties of preorders with respect to the algebraic sum and scalar product operations of intuitionistic fuzzy values, and apply them to the investigation of compatible properties of various lexicographic orders. In addition, a benchmark problem regarding risk investment is further explored to give a comparative analysis of different lexicographic orders and highlight the practical value of the obtained results for solving real-world decision-making problems. Full article
(This article belongs to the Section Engineering Mathematics)
Show Figures

Figure 1

35 pages, 924 KiB  
Article
Analysis of General Humoral Immunity HIV Dynamics Model with HAART and Distributed Delays
by A. M. Elaiw and E. Kh. Elnahary
Mathematics 2019, 7(2), 157; https://doi.org/10.3390/math7020157 - 09 Feb 2019
Cited by 52 | Viewed by 2474
Abstract
This paper deals with the study of an HIV dynamics model with two target cells, macrophages and CD4 + T cells and three categories of infected cells, short-lived, long-lived and latent in order to get better insights into HIV infection within the body. [...] Read more.
This paper deals with the study of an HIV dynamics model with two target cells, macrophages and CD4 + T cells and three categories of infected cells, short-lived, long-lived and latent in order to get better insights into HIV infection within the body. The model incorporates therapeutic modalities such as reverse transcriptase inhibitors (RTIs) and protease inhibitors (PIs). The model is incorporated with distributed time delays to characterize the time between an HIV contact of an uninfected target cell and the creation of mature HIV. The effect of antibody on HIV infection is analyzed. The production and removal rates of the ten compartments of the model are given by general nonlinear functions which satisfy reasonable conditions. Nonnegativity and ultimately boundedness of the solutions are proven. Using the Lyapunov method, the global stability of the equilibria of the model is proven. Numerical simulations of the system are provided to confirm the theoretical results. We have shown that the antibodies can play a significant role in controlling the HIV infection, but it cannot clear the HIV particles from the plasma. Moreover, we have demonstrated that the intracellular time delay plays a similar role as the Highly Active Antiretroviral Therapies (HAAT) drugs in eliminating the HIV particles. Full article
Show Figures

Figure 1

14 pages, 358 KiB  
Article
Fractional Derivatives: The Perspective of System Theory
by Manuel Duarte Ortigueira and José Tenreiro Machado
Mathematics 2019, 7(2), 150; https://doi.org/10.3390/math7020150 - 05 Feb 2019
Cited by 45 | Viewed by 3717
Abstract
This paper addresses the present day problem of multiple proposals for operators under the umbrella of “fractional derivatives”. Several papers demonstrated that various of those “novel” definitions are incorrect. Here the classical system theory is applied to develop a unified framework to clarify [...] Read more.
This paper addresses the present day problem of multiple proposals for operators under the umbrella of “fractional derivatives”. Several papers demonstrated that various of those “novel” definitions are incorrect. Here the classical system theory is applied to develop a unified framework to clarify this important topic in Fractional Calculus. Full article
(This article belongs to the Special Issue Fractional Integrals and Derivatives: “True” versus “False”)
Show Figures

Figure 1

5 pages, 250 KiB  
Article
Desiderata for Fractional Derivatives and Integrals
by Rudolf Hilfer and Yuri Luchko
Mathematics 2019, 7(2), 149; https://doi.org/10.3390/math7020149 - 04 Feb 2019
Cited by 87 | Viewed by 5223
Abstract
The purpose of this brief article is to initiate discussions in this special issue by proposing desiderata for calling an operator a fractional derivative or a fractional integral. Our desiderata are neither axioms nor do they define fractional derivatives or integrals uniquely. Instead [...] Read more.
The purpose of this brief article is to initiate discussions in this special issue by proposing desiderata for calling an operator a fractional derivative or a fractional integral. Our desiderata are neither axioms nor do they define fractional derivatives or integrals uniquely. Instead they intend to stimulate the field by providing guidelines based on a small number of time honoured and well established criteria. Full article
(This article belongs to the Special Issue Fractional Integrals and Derivatives: “True” versus “False”)
17 pages, 2881 KiB  
Article
A Novel Bat Algorithm with Multiple Strategies Coupling for Numerical Optimization
by Yechuang Wang, Penghong Wang, Jiangjiang Zhang, Zhihua Cui, Xingjuan Cai, Wensheng Zhang and Jinjun Chen
Mathematics 2019, 7(2), 135; https://doi.org/10.3390/math7020135 - 01 Feb 2019
Cited by 109 | Viewed by 11576
Abstract
A bat algorithm (BA) is a heuristic algorithm that operates by imitating the echolocation behavior of bats to perform global optimization. The BA is widely used in various optimization problems because of its excellent performance. In the bat algorithm, the global search capability [...] Read more.
A bat algorithm (BA) is a heuristic algorithm that operates by imitating the echolocation behavior of bats to perform global optimization. The BA is widely used in various optimization problems because of its excellent performance. In the bat algorithm, the global search capability is determined by the parameter loudness and frequency. However, experiments show that each operator in the algorithm can only improve the performance of the algorithm at a certain time. In this paper, a novel bat algorithm with multiple strategies coupling (mixBA) is proposed to solve this problem. To prove the effectiveness of the algorithm, we compared it with CEC2013 benchmarks test suits. Furthermore, the Wilcoxon and Friedman tests were conducted to distinguish the differences between it and other algorithms. The results prove that the proposed algorithm is significantly superior to others on the majority of benchmark functions. Full article
(This article belongs to the Special Issue Evolutionary Computation)
Show Figures

Figure 1

6 pages, 746 KiB  
Article
Calculating Nodal Voltages Using the Admittance Matrix Spectrum of an Electrical Network
by Ioannis Dassios, Andrew Keane and Paul Cuffe
Mathematics 2019, 7(1), 106; https://doi.org/10.3390/math7010106 - 20 Jan 2019
Cited by 10 | Viewed by 4036
Abstract
Calculating nodal voltages and branch current flows in a meshed network is fundamental to electrical engineering. This work demonstrates how such calculations can be performed using the eigenvalues and eigenvectors of the Laplacian matrix which describes the connectivity of the electrical network. These [...] Read more.
Calculating nodal voltages and branch current flows in a meshed network is fundamental to electrical engineering. This work demonstrates how such calculations can be performed using the eigenvalues and eigenvectors of the Laplacian matrix which describes the connectivity of the electrical network. These insights should permit the functioning of electrical networks to be understood in the context of spectral analysis. Full article
(This article belongs to the Special Issue Mathematical Methods in Applied Sciences)
Show Figures

Figure 1

8 pages, 235 KiB  
Article
ω-Interpolative Ćirić-Reich-Rus-Type Contractions
by Hassen Aydi, Erdal Karapinar and Antonio Francisco Roldán López de Hierro
Mathematics 2019, 7(1), 57; https://doi.org/10.3390/math7010057 - 08 Jan 2019
Cited by 97 | Viewed by 3419
Abstract
In this paper, using the concept of ω -admissibility, we prove some fixed point results for interpolate Ćirić-Reich-Rus-type contraction mappings. We also present some consequences and a useful example. Full article
(This article belongs to the Special Issue Recent Advances in Fixed Point Theory and Its Applications)
15 pages, 793 KiB  
Article
An Iterative Algorithm for Solving Generalized Variational Inequalities and Fixed Points Problems
by Yonghong Yao, Mihai Postolache and Jen-Chih Yao
Mathematics 2019, 7(1), 61; https://doi.org/10.3390/math7010061 - 08 Jan 2019
Cited by 98 | Viewed by 5152
Abstract
In this paper, a generalized variational inequality and fixed points problem is presented. An iterative algorithm is introduced for finding a solution of the generalized variational inequalities and fixed point of two quasi-pseudocontractive operators under a nonlinear transformation. Strong convergence of the suggested [...] Read more.
In this paper, a generalized variational inequality and fixed points problem is presented. An iterative algorithm is introduced for finding a solution of the generalized variational inequalities and fixed point of two quasi-pseudocontractive operators under a nonlinear transformation. Strong convergence of the suggested algorithm is demonstrated. Full article
(This article belongs to the Special Issue Fixed Point, Optimization, and Applications)

Review

41 pages, 23839 KiB  
Review
Survey on Synthetic Data Generation, Evaluation Methods and GANs
by Alvaro Figueira and Bruno Vaz
Mathematics 2022, 10(15), 2733; https://doi.org/10.3390/math10152733 - 02 Aug 2022
Cited by 50 | Viewed by 17064
Abstract
Synthetic data consists of artificially generated data. When data are scarce, or of poor quality, synthetic data can be used, for example, to improve the performance of machine learning models. Generative adversarial networks (GANs) are a state-of-the-art deep generative models that can generate [...] Read more.
Synthetic data consists of artificially generated data. When data are scarce, or of poor quality, synthetic data can be used, for example, to improve the performance of machine learning models. Generative adversarial networks (GANs) are a state-of-the-art deep generative models that can generate novel synthetic samples that follow the underlying data distribution of the original dataset. Reviews on synthetic data generation and on GANs have already been written. However, none in the relevant literature, to the best of our knowledge, has explicitly combined these two topics. This survey aims to fill this gap and provide useful material to new researchers in this field. That is, we aim to provide a survey that combines synthetic data generation and GANs, and that can act as a good and strong starting point for new researchers in the field, so that they have a general overview of the key contributions and useful references. We have conducted a review of the state-of-the-art by querying four major databases: Web of Sciences (WoS), Scopus, IEEE Xplore, and ACM Digital Library. This allowed us to gain insights into the most relevant authors, the most relevant scientific journals in the area, the most cited papers, the most significant research areas, the most important institutions, and the most relevant GAN architectures. GANs were thoroughly reviewed, as well as their most common training problems, their most important breakthroughs, and a focus on GAN architectures for tabular data. Further, the main algorithms for generating synthetic data, their applications and our thoughts on these methods are also expressed. Finally, we reviewed the main techniques for evaluating the quality of synthetic data (especially tabular data) and provided a schematic overview of the information presented in this paper. Full article
(This article belongs to the Special Issue New Insights in Machine Learning and Deep Neural Networks)
Show Figures

Figure 1

74 pages, 751 KiB  
Review
Centrally Essential Rings and Semirings
by Askar Tuganbaev
Mathematics 2022, 10(11), 1867; https://doi.org/10.3390/math10111867 - 30 May 2022
Viewed by 1298
Abstract
This paper is a survey of results on centrally essential rings and semirings. A ring (respectively, semiring) is said to be centrally essential if it is either commutative or satisfies the property that for any non-central element a, there exist non-zero central [...] Read more.
This paper is a survey of results on centrally essential rings and semirings. A ring (respectively, semiring) is said to be centrally essential if it is either commutative or satisfies the property that for any non-central element a, there exist non-zero central elements x and y with ax = y. The class of centrally essential rings is very large; many corresponding examples are given in the work. Full article
35 pages, 13595 KiB  
Review
Trends in Vehicle Re-Identification Past, Present, and Future: A Comprehensive Review
by Zakria, Jianhua Deng, Yang Hao, Muhammad Saddam Khokhar, Rajesh Kumar, Jingye Cai, Jay Kumar and Muhammad Umar Aftab
Mathematics 2021, 9(24), 3162; https://doi.org/10.3390/math9243162 - 08 Dec 2021
Cited by 18 | Viewed by 5870
Abstract
Vehicle Re-identification (re-id) over surveillance camera network with non-overlapping field of view is an exciting and challenging task in intelligent transportation systems (ITS). Due to its versatile applicability in metropolitan cities, it gained significant attention. Vehicle re-id matches targeted vehicle over non-overlapping views [...] Read more.
Vehicle Re-identification (re-id) over surveillance camera network with non-overlapping field of view is an exciting and challenging task in intelligent transportation systems (ITS). Due to its versatile applicability in metropolitan cities, it gained significant attention. Vehicle re-id matches targeted vehicle over non-overlapping views in multiple camera network. However, it becomes more difficult due to inter-class similarity, intra-class variability, viewpoint changes, and spatio-temporal uncertainty. In order to draw a detailed picture of vehicle re-id research, this paper gives a comprehensive description of the various vehicle re-id technologies, applicability, datasets, and a brief comparison of different methodologies. Our paper specifically focuses on vision-based vehicle re-id approaches, including vehicle appearance, license plate, and spatio-temporal characteristics. In addition, we explore the main challenges as well as a variety of applications in different domains. Lastly, a detailed comparison of current state-of-the-art methods performances over VeRi-776 and VehicleID datasets is summarized with future directions. We aim to facilitate future research by reviewing the work being done on vehicle re-id till to date. Full article
Show Figures

Figure 1

32 pages, 3548 KiB  
Review
Nature-Inspired Metaheuristic Techniques for Combinatorial Optimization Problems: Overview and Recent Advances
by Md Ashikur Rahman, Rajalingam Sokkalingam, Mahmod Othman, Kallol Biswas, Lazim Abdullah and Evizal Abdul Kadir
Mathematics 2021, 9(20), 2633; https://doi.org/10.3390/math9202633 - 19 Oct 2021
Cited by 23 | Viewed by 4950
Abstract
Combinatorial optimization problems are often considered NP-hard problems in the field of decision science and the industrial revolution. As a successful transformation to tackle complex dimensional problems, metaheuristic algorithms have been implemented in a wide area of combinatorial optimization problems. Metaheuristic algorithms have [...] Read more.
Combinatorial optimization problems are often considered NP-hard problems in the field of decision science and the industrial revolution. As a successful transformation to tackle complex dimensional problems, metaheuristic algorithms have been implemented in a wide area of combinatorial optimization problems. Metaheuristic algorithms have been evolved and modified with respect to the problem nature since it was recommended for the first time. As there is a growing interest in incorporating necessary methods to develop metaheuristics, there is a need to rediscover the recent advancement of metaheuristics in combinatorial optimization. From the authors’ point of view, there is still a lack of comprehensive surveys on current research directions. Therefore, a substantial part of this paper is devoted to analyzing and discussing the modern age metaheuristic algorithms that gained popular use in mostly cited combinatorial optimization problems such as vehicle routing problems, traveling salesman problems, and supply chain network design problems. A survey of seven different metaheuristic algorithms (which are proposed after 2000) for combinatorial optimization problems is carried out in this study, apart from conventional metaheuristics like simulated annealing, particle swarm optimization, and tabu search. These metaheuristics have been filtered through some key factors like easy parameter handling, the scope of hybridization as well as performance efficiency. In this study, a concise description of the framework of the selected algorithm is included. Finally, a technical analysis of the recent trends of implementation is discussed, along with the impacts of algorithm modification on performance, constraint handling strategy, the handling of multi-objective situations using hybridization, and future research opportunities. Full article
(This article belongs to the Special Issue Optimization for Decision Making III)
Show Figures

Figure 1

26 pages, 385 KiB  
Review
General Fractional Dynamics
by Vasily E. Tarasov
Mathematics 2021, 9(13), 1464; https://doi.org/10.3390/math9131464 - 22 Jun 2021
Cited by 40 | Viewed by 3827
Abstract
General fractional dynamics (GFDynamics) can be viewed as an interdisciplinary science, in which the nonlocal properties of linear and nonlinear dynamical systems are studied by using general fractional calculus, equations with general fractional integrals (GFI) and derivatives (GFD), or general nonlocal mappings with [...] Read more.
General fractional dynamics (GFDynamics) can be viewed as an interdisciplinary science, in which the nonlocal properties of linear and nonlinear dynamical systems are studied by using general fractional calculus, equations with general fractional integrals (GFI) and derivatives (GFD), or general nonlocal mappings with discrete time. GFDynamics implies research and obtaining results concerning the general form of nonlocality, which can be described by general-form operator kernels and not by its particular implementations and representations. In this paper, the concept of “general nonlocal mappings” is proposed; these are the exact solutions of equations with GFI and GFD at discrete points. In these mappings, the nonlocality is determined by the operator kernels that belong to the Sonin and Luchko sets of kernel pairs. These types of kernels are used in general fractional integrals and derivatives for the initial equations. Using general fractional calculus, we considered fractional systems with general nonlocality in time, which are described by equations with general fractional operators and periodic kicks. Equations with GFI and GFD of arbitrary order were also used to derive general nonlocal mappings. The exact solutions for these general fractional differential and integral equations with kicks were obtained. These exact solutions with discrete timepoints were used to derive general nonlocal mappings without approximations. Some examples of nonlocality in time are described. Full article
(This article belongs to the Special Issue Fractional Calculus in Natural and Social Sciences)
14 pages, 517 KiB  
Review
A Survey on Software Defect Prediction Using Deep Learning
by Elena N. Akimova, Alexander Yu. Bersenev, Artem A. Deikov, Konstantin S. Kobylkin, Anton V. Konygin, Ilya P. Mezentsev and Vladimir E. Misilov
Mathematics 2021, 9(11), 1180; https://doi.org/10.3390/math9111180 - 24 May 2021
Cited by 39 | Viewed by 7258
Abstract
Defect prediction is one of the key challenges in software development and programming language research for improving software quality and reliability. The problem in this area is to properly identify the defective source code with high accuracy. Developing a fault prediction model is [...] Read more.
Defect prediction is one of the key challenges in software development and programming language research for improving software quality and reliability. The problem in this area is to properly identify the defective source code with high accuracy. Developing a fault prediction model is a challenging problem, and many approaches have been proposed throughout history. The recent breakthrough in machine learning technologies, especially the development of deep learning techniques, has led to many problems being solved by these methods. Our survey focuses on the deep learning techniques for defect prediction. We analyse the recent works on the topic, study the methods for automatic learning of the semantic and structural features from the code, discuss the open problems and present the recent trends in the field. Full article
(This article belongs to the Special Issue Numerical Analysis and Scientific Computing)
Show Figures

Figure 1

20 pages, 300 KiB  
Review
The General Fractional Derivative and Related Fractional Differential Equations
by Yuri Luchko and Masahiro Yamamoto
Mathematics 2020, 8(12), 2115; https://doi.org/10.3390/math8122115 - 26 Nov 2020
Cited by 44 | Viewed by 3135
Abstract
In this survey paper, we start with a discussion of the general fractional derivative (GFD) introduced by A. Kochubei in his recent publications. In particular, a connection of this derivative to the corresponding fractional integral and the Sonine relation for their kernels are [...] Read more.
In this survey paper, we start with a discussion of the general fractional derivative (GFD) introduced by A. Kochubei in his recent publications. In particular, a connection of this derivative to the corresponding fractional integral and the Sonine relation for their kernels are presented. Then we consider some fractional ordinary differential equations (ODEs) with the GFD including the relaxation equation and the growth equation. The main part of the paper is devoted to the fractional partial differential equations (PDEs) with the GFD. We discuss both the Cauchy problems and the initial-boundary-value problems for the time-fractional diffusion equations with the GFD. In the final part of the paper, some results regarding the inverse problems for the differential equations with the GFD are presented. Full article
(This article belongs to the Special Issue Fractional Integrals and Derivatives: “True” versus “False”)
36 pages, 12863 KiB  
Review
Fourier-Spectral Method for the Phase-Field Equations
by Sungha Yoon, Darae Jeong, Chaeyoung Lee, Hyundong Kim, Sangkwon Kim, Hyun Geun Lee and Junseok Kim
Mathematics 2020, 8(8), 1385; https://doi.org/10.3390/math8081385 - 18 Aug 2020
Cited by 24 | Viewed by 6366
Abstract
In this paper, we review the Fourier-spectral method for some phase-field models: Allen–Cahn (AC), Cahn–Hilliard (CH), Swift–Hohenberg (SH), phase-field crystal (PFC), and molecular beam epitaxy (MBE) growth. These equations are very important parabolic partial differential equations and are applicable to many interesting scientific [...] Read more.
In this paper, we review the Fourier-spectral method for some phase-field models: Allen–Cahn (AC), Cahn–Hilliard (CH), Swift–Hohenberg (SH), phase-field crystal (PFC), and molecular beam epitaxy (MBE) growth. These equations are very important parabolic partial differential equations and are applicable to many interesting scientific problems. The AC equation is a reaction-diffusion equation modeling anti-phase domain coarsening dynamics. The CH equation models phase segregation of binary mixtures. The SH equation is a popular model for generating patterns in spatially extended dissipative systems. A classical PFC model is originally derived to investigate the dynamics of atomic-scale crystal growth. An isotropic symmetry MBE growth model is originally devised as a method for directly growing high purity epitaxial thin film of molecular beams evaporating on a heated substrate. The Fourier-spectral method is highly accurate and simple to implement. We present a detailed description of the method and explain its connection to MATLAB usage so that the interested readers can use the Fourier-spectral method for their research needs without difficulties. Several standard computational tests are done to demonstrate the performance of the method. Furthermore, we provide the MATLAB codes implementation in the Appendix A. Full article
(This article belongs to the Special Issue Open Source Codes for Numerical Analysis)
Show Figures

Figure 1

50 pages, 2766 KiB  
Review
Rules for Fractional-Dynamic Generalizations: Difficulties of Constructing Fractional Dynamic Models
by Vasily E. Tarasov
Mathematics 2019, 7(6), 554; https://doi.org/10.3390/math7060554 - 18 Jun 2019
Cited by 31 | Viewed by 4011
Abstract
This article is a review of problems and difficulties arising in the construction of fractional-dynamic analogs of standard models by using fractional calculus. These fractional generalizations allow us to take into account the effects of memory and non-locality, distributed lag, and scaling. We [...] Read more.
This article is a review of problems and difficulties arising in the construction of fractional-dynamic analogs of standard models by using fractional calculus. These fractional generalizations allow us to take into account the effects of memory and non-locality, distributed lag, and scaling. We formulate rules (principles) for constructing fractional generalizations of standard models, which were described by differential equations of integer order. Important requirements to building fractional generalization of dynamical models (the rules for “fractional-dynamic generalizers”) are represented as the derivability principle, the multiplicity principle, the solvability and correspondence principles, and the interpretability principle. The characteristic properties of fractional derivatives of non-integer order are the violation of standard rules and properties that are fulfilled for derivatives of integer order. These non-standard mathematical properties allow us to describe non-standard processes and phenomena associated with non-locality and memory. However, these non-standard properties lead to restrictions in the sequential and self-consistent construction of fractional generalizations of standard models. In this article, we give examples of problems arising due to the non-standard properties of fractional derivatives in construction of fractional generalizations of standard dynamic models in economics. Full article
(This article belongs to the Special Issue Mathematical Economics: Application of Fractional Calculus)
Show Figures

Figure 1

28 pages, 356 KiB  
Review
On History of Mathematical Economics: Application of Fractional Calculus
by Vasily E. Tarasov
Mathematics 2019, 7(6), 509; https://doi.org/10.3390/math7060509 - 04 Jun 2019
Cited by 136 | Viewed by 9408
Abstract
Modern economics was born in the Marginal revolution and the Keynesian revolution. These revolutions led to the emergence of fundamental concepts and methods in economic theory, which allow the use of differential and integral calculus to describe economic phenomena, effects, and processes. At [...] Read more.
Modern economics was born in the Marginal revolution and the Keynesian revolution. These revolutions led to the emergence of fundamental concepts and methods in economic theory, which allow the use of differential and integral calculus to describe economic phenomena, effects, and processes. At the present moment the new revolution, which can be called “Memory revolution”, is actually taking place in modern economics. This revolution is intended to “cure amnesia” of modern economic theory, which is caused by the use of differential and integral operators of integer orders. In economics, the description of economic processes should take into account that the behavior of economic agents may depend on the history of previous changes in economy. The main mathematical tool designed to “cure amnesia” in economics is fractional calculus that is a theory of integrals, derivatives, sums, and differences of non-integer orders. This paper contains a brief review of the history of applications of fractional calculus in modern mathematical economics and economic theory. The first stage of the Memory Revolution in economics is associated with the works published in 1966 and 1980 by Clive W. J. Granger, who received the Nobel Memorial Prize in Economic Sciences in 2003. We divide the history of the application of fractional calculus in economics into the following five stages of development (approaches): ARFIMA; fractional Brownian motion; econophysics; deterministic chaos; mathematical economics. The modern stage (mathematical economics) of the Memory revolution is intended to include in the modern economic theory new economic concepts and notions that allow us to take into account the presence of memory in economic processes. The current stage actually absorbs the Granger approach based on ARFIMA models that used only the Granger–Joyeux–Hosking fractional differencing and integrating, which really are the well-known Grunwald–Letnikov fractional differences. The modern stage can also absorb other approaches by formulation of new economic notions, concepts, effects, phenomena, and principles. Some comments on possible future directions for development of the fractional mathematical economics are proposed. Full article
(This article belongs to the Special Issue Mathematical Economics: Application of Fractional Calculus)
21 pages, 425 KiB  
Review
Evaluation of Fractional Integrals and Derivatives of Elementary Functions: Overview and Tutorial
by Roberto Garrappa, Eva Kaslik and Marina Popolizio
Mathematics 2019, 7(5), 407; https://doi.org/10.3390/math7050407 - 07 May 2019
Cited by 88 | Viewed by 6681
Abstract
Several fractional-order operators are available and an in-depth knowledge of the selected operator is necessary for the evaluation of fractional integrals and derivatives of even simple functions. In this paper, we reviewed some of the most commonly used operators and illustrated two approaches [...] Read more.
Several fractional-order operators are available and an in-depth knowledge of the selected operator is necessary for the evaluation of fractional integrals and derivatives of even simple functions. In this paper, we reviewed some of the most commonly used operators and illustrated two approaches to generalize integer-order derivatives to fractional order; the aim was to provide a tool for a full understanding of the specific features of each fractional derivative and to better highlight their differences. We hence provided a guide to the evaluation of fractional integrals and derivatives of some elementary functions and studied the action of different derivatives on the same function. In particular, we observed how Riemann–Liouville and Caputo’s derivatives converge, on long times, to the Grünwald–Letnikov derivative which appears as an ideal generalization of standard integer-order derivatives although not always useful for practical applications. Full article
(This article belongs to the Special Issue Advanced Mathematical Methods: Theory and Applications)
Show Figures

Figure 1

Back to TopTop