Search

• Understanding how strategic interactions influence trait evolution remains a challenge in evolutionary games. • The evolutionary RPS game investigates the evolution of three strategies under a fixed payoff matrix. • Exploring the impact of a dynamic instead of a fixed payoff matrix could change the dynamics of the game. • The adaptive RPS game, incorporating a dynamic payoff matrix, investigates how strategies change adaptively through trait evolution. The rock-paper-scissors (RPS) game is a classic model for exploring the performance of how multiple strategies interact and evolve over time. The classic RPS game assumes a fixed benefit and cost for each strategy against another one when two players meet, while its evolutionary game considers the frequency dynamics of the three strategies with each's fitness influenced by its net payoff. This may not reflect the complexity of real-world scenarios as strategies can co-adapt with each other. We introduce an adaptive RPS game that captures the dynamics of strategy densities with trait-mediated payoffs, and the adaptive dynamics of coevolving traits via incremental mutations leading to adaptively evolving payoffs. Results show that the adaptive RPS game approaches a steady state of strategy density, if any, faster than the evolutionary RPS game. The stable coexistence of all strategies in the evolutionary game can be easily destabilized in the adaptive game. Strategies that are allowed to adaptively change their traits also performed better and achieved greater strategy densities than those fixed strategies in the adaptive game. The coevolving strategies in the adaptive RPS game exhibit complex and diverse attractors in the trait space, sensitive to both initial conditions and model parameters, but exhibiting positive payoffs with greater benefits than costs. These findings highlight how adaptive games enhance strategy performance by sacrificing eco-evolutionary dynamic stability. [ABSTRACT FROM AUTHOR]

In this paper we construct two limit cycles with a heteroclinic polycycle for the three-dimensional continuous model of the rock–scissors–paper (RSP) game between bacteriocin producing bacteria. Our construction gives a partial answer to an open question posed by Neumann and Schuster (2007) concerning how many limit cycles can coexist for the RSP game. [ABSTRACT FROM AUTHOR]

In this paper, we first point out a gap in Yang (2012). Next, strong convergence theorem for the common solution for a finite family of φ -strongly accretive operator equations in Banach spaces is established without any bounded assumption, and we also give an example to show universality of the result of this paper, which improve and extend some recent results. [ABSTRACT FROM AUTHOR]

The future use of eddy resolving simulations (ERS) such as Large Eddy Simulation (LES), Direct Numerical Simulation (DNS) and related approaches in aerospace is explored. The turbulence modeling requirements with respect to aeroengines and aircraft is contrasted. For the latter, higher Reynolds numbers are more prevalent and this especially gives rise to the need for the hybridization of ERS methods with Reynolds Averaged Navier–Stokes (RANS) approaches. Zones where future use of pure ERS methods is now possible and those where hybridizations with RANS will be needed is outlined. The major focus is the aeroengine for which the component scales are much smaller. This gives rise to generally more benign Reynolds numbers. The use of eddy resolving methods in a wide range of zones in an aeroengine is discussed and the potential benefits and also cost drawbacks with such approaches noted. The tension when using such computationally intensive calculations in an area where the coupling of components and even the airframe and engine is becoming increasingly important is explored. Also, the numerical methods and meshing requirements are considered and the implications of ERS methods for future numerical algorithms. It is postulated that such simulations are ready now for niche uses in industry. However, to perform the scale of simulations that industry requires, to meet pressing environmental needs, challenges remain. For example, there is the need to develop optimal numerical methods that both map to the accuracy requirements for ERS and also future computer architectures. [ABSTRACT FROM AUTHOR]

In the paper the second order half-linear delay differential equation ( r ( t ) | u ′ ( t ) | α - 1 u ′ ( t ) ) ′ + p ( t ) | u ( τ ( t ) ) | α - 1 u ( τ ( t ) ) = 0 , α > 1 is studied under the condition ∫ ∞ r - 1 / α ( t ) d t < ∞ . The oscillation criterion proved by Sun and Meng (2006, Theorem 2.2) is carefully examined and improved by simplifying and sharpening the estimates used in the original proof and removing unnecessary assumptions. Among others, using elementary arguments we show that an arbitrary positive nondecreasing function ρ from this criterion can be safely and with no loss of generality replaced by a constant function. An extension to other related equations, such as neutral equations is also provided. [ABSTRACT FROM AUTHOR]

• The convergence analysis and the techniques used in Lemma 3.3 by X. Wang et al. in [1] are based essentially on Sobolev's inequality in one dimension and they cannot be extended to two dimensions. • All results based on Lemma 3.3 are false, in particular Theorem 3.3, Theorem 4.1, Theorem 5.1 and Theorem 5.2. • Regarding the conservation of mass and energy, the initial terms Q 0 and E 0 depends on U 0 and on U 1 and the authors consider only Eq. (4) without taking into account Eq. (7). Therfore, there is an error in Theorem 3.1 and Theorem 3.2. • In Theorem 4.1, the authors did not show that u1 is uniquely determined by Eq. (7). In the above article, a second-order convergence in the maximum norm of the two-dimensional regularized long-wave equation is proved. However, due to a wrong inequality in Lemma 3.3 used in X. Wang et al.[1], there are some fundamental errors in this paper, in particular the proof of Theorem 3.3 and the convergence Theorem are no longer correct. The present brief paper contains clarifying comments. [ABSTRACT FROM AUTHOR]

Abstract: Using advanced machine learning techniques as an alternative to conventional double-entry volume equations known as classical allometric models, regression models of the inside-bark volume (dependent variable) for standing Eucalyptus globulus trunks (or main stems) have been built as a function of the following three independent variables: age, height and outside-bark diameter at breast height (D). The allometric models of volume, biomass or carbon support the estimation of carbon storage in forests and agroforestry systems. On one hand, this paper presents the construction of allometric models of the inside-bark volume for E. globulus trees. On the other hand, the experimental observed data (age, height, D and inside-bark volume) for 142 trees (E. globulus) were measured and a nonlinear model was built using a data-mining methodology based on multivariate adaptive regression splines (MARS) technique and multilayer perceptron networks (MLP) for regression problems. Coefficients of determination and Furnival’s indices indicate the superiority of the MARS technique over the allometric regression models and the MLP network. The agreement of the MARS model with observed data confirmed the good performance of the same one. Finally, conclusions of this innovative research are exposed. [Copyright &y& Elsevier]

Abstract: We show that the main results in the recent paper [4] by Sadiq Basha (2012) are not real generalizations but particular cases of existing fixed point theorems in the literature. [Copyright &y& Elsevier]

Abstract: In the present paper we studied the Voronovskaya type theorem for modified Gamma operators presented by A. İzgi in the paper “Voronovskaya type asymptotic approximation by modified Gamma operators” [Applied Mathematics and Computation 217 (2011) 8061–8067]. We show that this theorem is not true. We present a correct form of this theorem and its proof. Furthermore, we obtain an error estimate for modified Gamma operators. [Copyright &y& Elsevier]

Abstract: In this paper, we focus on the proposed algorithms to solve a linear programming problem with the convex combination of the max–min and the max–average composition and the max–star composition, respectively. They have been proposed by Ghodousian and Khorram [A. Ghodousian, E. Khorram, Solving a linear programming problem with the convex combination of the max–min and the max–average fuzzy relation equations, Appl. Math. Comput. 180 (2006) 411–418] and Khorram et al. [E. Khorram, A. Ghodousian, A. Abbasi Molai, Solving linear optimization problems with max–star composition equation constraints, Appl. Math. Comput. 179 (2006) 654–661], respectively. Firstly, we show that the “Tabular method algorithm” in the first paper and the “First procedure” in the second paper may not lead to the optimal solutions of the two models in some cases. Secondly, we generalize the proposed algorithm by Abbasi Molai and Khorram [A. Abbasi Molai, E. Khorram, A modified algorithm for solving the proposed models by Ghodousian and Khorram and Khorram and Ghodousian, Appl. Math. Comput. 190 (2007) 1161–1167] to solve the two models. In fact, it modifies the presented algorithms in the two papers. Finally, some numerical examples are given to illustrate the purposes. [Copyright &y& Elsevier]

Abstract: Comment on the paper “A class of methods based on non-polynomial spline functions for the solution of a special fourth-order boundary-value problems with engineering applications” in Applied Mathematics and Computation 174 (2006) 1169–1180. The paper considered a class of two-point boundary-value problems of the form where f(x) and g(x) are continuous on [a, b], and A i and B i (i =1,2) are finite real constants. Here we correct some mistake in derivation of non-polynomial spline, boundary formulas, truncation errors, convergence analysis and computational experiments. [Copyright &y& Elsevier]

• We build a pairwise (PW) nonlinear fermi dynamics to study the rock-paper-scissors game's under evolutionary dynamics. • The model also investigates the effect of environmental noise and demographic noise. • We perform analytical analysis and numerical simulation to show the impact of linear and nonlinear to explore the noise effect. • Both linear and non-linear dynamics show comparable stability equilibria. The difference between conventional replicator dynamics and pairwise (PW) nonlinear Fermi dynamics can be discerned by studying the evolutionary dynamics of the interactions between the symmetric cyclic structure in the rock–paper–scissors game and inter- and intraspecific competitions. Often, conventional replicator models presume that the payoff difference among species is a linear function (a linear benefit). This study introduces a PW contrast under the properties of the well-known Fermi rule, where species play against one another in pairs. To model a PW nonlinear evolutionary environment (a nonlinear benefit) within this framework, both analytical and numerical approaches are applied. It is determined that the dynamics of the linear and nonlinear benefits can present the same stability conditions at equilibrium. Moreover, it is also demonstrated that, even in an identical equilibrium condition for both dynamics, the numerical result run by a deterministic approach presents a faster stability state for nonlinear benefit dynamics. This study also suggests that introducing mutation as demographic noise can effectively disrupt the phase regions and show the different relationships between linear and nonlinear dynamics. The symmetric bidirectional mutation among all the species reduced to the stable limit cycle by an arbitrary small mutation rate is also explored. Due to the environmental noise, however, linear and nonlinear exhibit the same steady state. Nevertheless, non-linearity illustrates more stable and faster stability situations. Our result suggests that environmental and demographic noise on the evolutionary dynamic framework can serve as a mechanism for supporting PW nonlinear dynamics in multi-species games. [ABSTRACT FROM AUTHOR]

Abstract: One of the desirable attributes of real-life examination timetabling solutions is the maximization of paper spread, which is a measure of the amount of study time that each student has between examinations. In this study, we face with a predefined examination schedule that must be modified in order to maximize paper spread in course of examination. We will show how the integer programming can be employed to achieve this aim. The model presents constraints for the quality of feasible examination timetables and all the requirements found in most academic institutions. The approach is tested on real-world exam timetabling problems. The computational experiments and results will be reported. [Copyright &y& Elsevier]

Abstract: In this paper we will establish some new oscillation criteria for the second-order retarded differential equation of the formThe results obtained essentially improve and extend those of Džurina and Stavroulakis [Oscillation criteria for second-order delay differential equations, Appl. Math. Comput., 140 (2003) 445–453]. An open problem is proposed at the end of this paper. [Copyright &y& Elsevier]

Abstract: In this paper, we establish new Lyapunov-type inequalities for two classes of one-dimensional quasilinear elliptic systems of resonant type, which improve the recent results of Tang and He [X.H. Tang, X. He, Lower bounds for generalized eigenvalues of the quasilinear systems, J. Math. Anal. Appl. 385 (2012) 72–85] when 1< p i <2 for i =1,2,…, n. [Copyright &y& Elsevier]

Abstract: In this paper, some sufficient conditions are established for the oscillation of second-order neutral differential equations where and . On the other hand, some new oscillation criteria are established for the second-order nonlinear neutral delay differential equations where . The results obtained here complement and correct some known results in . Some examples are given to illustrate the main results. [Copyright &y& Elsevier]

Abstract: In this short note an addition to the paper [A.G. Bratsos, M. Ehrhardt, I.Th. Famelis, A discrete Adomian decomposition method for discrete nonlinear Schrödinger equations, Appl. Math. Comput. 197(1) (2008) 190–205] using the modulus of the terms evaluated from the Adomian decomposition method on p. 194 and their relation to the convergence of the resulting series is presented. Conclusions for the accuracy of the approximated solution are derived. [Copyright &y& Elsevier]

Abstract: This paper considers certain neutral differential equation with the distributed delayWithout imposing a nonnegative restriction on coefficients of the equation, we establish a delay-dependent asymptotic stability condition for the equation by introducing a new Lyapunov function. The condition presented here is different from that of Park [J.H. Park, LMI optimization approach to asymptotic stability of certain neutral delay differential equation with time-varying coefficients, Appl. Math. Comput. 160 (2005) 355–361] in the sense that it is dependent on all delays of the equation. Numerical examples illustrate effectiveness and sharpness of our theoretical result. [Copyright &y& Elsevier]

Abstract: The aim of this note is to show that the optimization algorithm proposed in may not lead to the optimal solution in some cases. In fact, the optimization problem remains open if we do not apply the branch-and-bound method to solve it or compute all the objective values of minimal solutions of the feasible domain. [Copyright &y& Elsevier]

Abstract: A counterexample is provided in this short note to show that some of local convergence theorems established in [D.K.R. Babajee, M.Z. Dauhoo, An analysis of the properties of the variants of Newton’s method with third order convergence, Appl. Math. Comput. 183 (2006) 659–684] are not always true. Some mistakes in the proofs of these theorems are pointed out. [Copyright &y& Elsevier]

Abstract: In this technical note, we give a short extension application for nonlinear sum of ratios problem (P) considered in [Y.J. Wang, K.C. Zhang, Global optimization of nonlinear sum of ratios problem, Applied Mathematics and Computation 158 (2004) 319–330]. Actually our result is slightly more general, since we do not specify additional positive coefficient for each ratio. In this note, we use different equivalent problem as done in Wang and Zhang (2004). Our method introduce p variables less than other method (Wang and Zhang, 2004), and our approach need not additional special program to obtain the upper and lower bound of numerator and denominator for each ratio in the objective function. [Copyright &y& Elsevier]

• kinetic description of a binary game • quasi-invariant limit • numerical simulations This article studies the kinetic dynamics of the rock-paper-scissors binary game. We first prove existence and uniqueness of the solution of the kinetic equation and subsequently we prove the rigorous derivation of the quasi-invariant limit for two meaningful choices of the domain of definition of the independent variables. We notice that the domain of definition of the problem plays a crucial role and heavily influences the behavior of the solution. The rigorous proof of the relaxation limit does not need the use of entropy estimates for ensuring compactness. [ABSTRACT FROM AUTHOR]

The sole purpose of this short note is to correct false claims made in the paper "A new approach for finding the determinant of matrices" by Omid Rezaifar and Hossein Rezaee (Appl. Math. Comput. 188 (2007) 1445–1454). [ABSTRACT FROM AUTHOR]

Abstract: In this paper we expose new method to analyse time series. The method is essentially applied for the prediction of time series among approximation and modelisation. It is based on wavelet decomposition combined with autoregressive models. An iterative procedure is applied and the performance of the estimator is measured by standardized error. Finally, a comparison with some existing models and methods has been pointed out to prove the performance of our’s. [Copyright &y& Elsevier]

The present comment concerns some doubtful mathematical calculation that produced misleading results which are presented in the above paper. [ABSTRACT FROM AUTHOR]

Abstract: This paper considers the problem of local asymptotic stability for a competitive Lotka–Volterra system with time-varying delays. By employing a linear matrix inequality (LMI) approach, we not only prove that the local asymptotic stability of the positive equilibrium for the Lotka–Volterra type competitive system will be preserved for suitable delays under a well known condition, but also obtain the maximal allowable length of delays by using Matlab’s Control Systems Toolbox to solve a feasible LMI. Compared with some known results, our estimate on the length of delays is less conservative. [Copyright &y& Elsevier]

Abstract: A nonlinear periodic food-chain predator–prey model is proposed in this paper, which can be seen as the modification of the traditional Lotka–Volterra food-chain system. Sufficient conditions which guarantee the existence of the positive periodic solution of the system are obtained. [Copyright &y& Elsevier]

Abstract: In this paper, we present some sixth-order class of modified Ostrowski’s methods for solving nonlinear equations. Per iteration each class member requires three function and one first derivative evaluations, and is shown to be at least sixth-order convergent. Several numerical examples are given to illustrate the performance of some of the presented methods. [Copyright &y& Elsevier]

Abstract: A multisymplectic integrator for the periodic nonlinear Schrödinger equation is presented in this paper. Its accuracy is proved. By introducing a norm, we investigate its nonlinear stability. We also discuss the relationship between this multisymplectic integrator and two variational integrators which are derived by using the discrete multisymplectic field theory and the finite element method. [Copyright &y& Elsevier]

Abstract: In this note, we will modify several gaps in Gurudwan and Sharma [N. Gurudwan, B.K. Sharma, Convergence theorem for the common solution for a finite family of -strongly accretive operator equations, Appl. Math. Comput. 217 (2011) 6748–6754]. [Copyright &y& Elsevier]

A fan, denoted by H 2 k , is the graph obtained by joining a vertex to a path with 2 k vertices. A graph is H 2 k -free if it does not contain a subgraph H 2 k. Yuan (2021) [13] proved the Turán number and the extremal graphs of H 2 k -free graphs. In this paper, we characterize spectral extremal graphs of H 2 k -free graphs for sufficiently large n and k ≥ 3. • Spectral Turán-type problem is a frontier research field in spectral graph theory. In this paper, we characterize spectral extremal graphs of H 2 k -free graphs for sufficiently large n and k ≥ 3. • The problem investigated in this paper is very interesting and important in spectral graph theory. [ABSTRACT FROM AUTHOR]

In this paper, we propose the frozen form of nonstationary iterated Tikhonov regularization to solve the inverse problems and study its convergence analysis in the Banach space setting, where the iterates of proposed method are defined through minimization problems. These minimization problems involve uniformly convex penalty terms that may be non-smooth, which can be utilized in the reconstruction of several notable features (e.g., discontinuities and sparsity) of the sought solutions. We terminate our method through a discrepancy principle and show its regularizing nature. Moreover, we show the convergence of the iterates of the method with respect to Bregman distance as well as their strong convergence. In order to show the applicability of the proposed method, we show that it is applicable on two ill-posed inverse problems. Finally, by assuming that a stability estimate holds within a certain set, we derive the convergence rates of our method. • In this paper, the frozen form of nonstationary iterated Tikhonov regularization to solve the inverse problems is proposed. • The convergence analysis is studied in Banach spaces for both the noisy as well as non-noisy data. • The convergence rates of the method are derived through stability estimates. • Two concrete examples are discussed to showcase the validity of our results. [ABSTRACT FROM AUTHOR]

Delay partial differential equations (PDEs) are widely utilized in many fields, such as climate prediction and epidemiology. But observation data in real world is often noisy and discrete. And in order to expand the applications of delay PDEs, we consider numerical Gaussian processes to solve these models. In this paper, numerical Gaussian processes for predicting the latent solution of a type of delay PDEs with multi-delays are investigated, and various delay PDEs are studied, including problems governed by variable-order fractional order operators and nonlinear operators, so as to adapt to the needs of practical applications. Numerical Gaussian processes are very good at fitting latent solution of PDEs, when all observation data is noisy and discontinuous. And the methodology can clearly quantify the uncertainty of the predicted solution. For complex boundaries controlled by ODEs, we consider mixed boundary conditions of delay PDEs in this paper. And we also apply Runge-Kutta methods to enhance the prediction accuracy of these problems. Finally, we design seven numerical examples to investigate the efficiency of NGPs and how the noisy data influences the solution of our studied problems. • Numerical Gaussian processes for solving delay PDEs models governed by variable-order fractional order operators and nonlinear operators. • Numerical Gaussian processes are very good at fitting latent solution of PDEs, when all observation data is noisy and discontinuous. • Runge-Kutta methods are applied to enhance the prediction accuracy of these problems. • Seven numerical examples to investigate the efficiency of NGPs and how the noisy data influences the solution of our studied problems. [ABSTRACT FROM AUTHOR]

In this paper, the zero-sum game problem for linear discrete-time Markov jump systems is solved by two novel model-free reinforcement Q -learning algorithms, on-policy Q -learning and off-policy Q -learning. Firstly, under the framework of the zero-sum game, the game-coupled algebraic Riccati equation is derived. On this basis, subsystem transformation technology is employed to decouple the jumping modes. Then, a model-free on-policy Q -learning algorithm is introduced in the zero-sum game architecture to obtain the optimal control gain by measured system data. However, the probing noise will produce biases in on-policy algorithm. Thus, an off-policy Q -learning algorithm is proposed to eliminate the effect of probing noise. Subsequently, convergence is discussed for the proposed methods. Finally, an inverted pendulum system is employed to verify the validity of the proposed methods. • The zero-sum game problem for linear discrete-time Markov jump systems is addressed with the reinforcement learning method. • A novel model-free parallel off-policy Q-learning method is developed, which is not affected by probing noise. • The subsystem transformation technology is employed decoupling the jumping modes to solve the game-coupled algebraic Riccati equation. • The convergence of the proposed methods, on-policy and off-policy, for Markov jump systems are both discussed in this paper. [ABSTRACT FROM AUTHOR]

This paper is concerned with higher odd-order boundary value problems. We first prove that the operators associated with the problems are symmetric and the corresponding eigenvalues are real, and we give the resolvent operators related to the differential operators. Then we obtain that the eigenvalues are not only continuously but also smoothly dependent on the parameters of the problem. Moreover, the differential expressions of the eigenvalues as regards these parameters are given. In particular, we give the Frechet derivatives of the eigenvalues for the leading coefficient function q 0 and coefficient functions q 1 , ⋯ , q n. • This paper is concerned with dependence of eigenvalues of higher odd-order boundary value problems. • We give a brief overview of the studies related to the problems, and show that the eigenvalues of the problem depend not only continuously but also smoothly on all parameters of the problem. • By some derivation methods and techniques, we give the differential expressions of the eigenvalues with respect to the coefficient functions q 0 , q 1 , ⋯ , q n , which are some interesting and concise results. And these results have not been done by the predecessors. [ABSTRACT FROM AUTHOR]

Fredholm integral equations of the second kind that are defined on a finite or infinite interval arise in many applications. This paper discusses Nyström methods based on Gauss quadrature rules for the solution of such integral equations. It is important to be able to estimate the error in the computed solution, because this allows the choice of an appropriate number of nodes in the Gauss quadrature rule used. This paper explores the application of averaged and weighted averaged Gauss quadrature rules for this purpose and introduces new stability properties of them. • Weighted averaged quadrature rules are analyzed and their stability and convergence are proved in weighted function spaces. • A Nyström type method based on averaged rules is developed for the numerical solution of second-kind Fredholm equations. • New iterative methods are given for the solution of systems of equations associated with weighted averaged Nyström's methods. [ABSTRACT FROM AUTHOR]

This paper proposes a temporal second-order fully discrete two-grid finite element method (FEM) for solving nonlinear time-fractional variable coefficient diffusion-wave equations. The method involves introducing an auxiliary variable and utilizing a reducing order technique for the fractional derivative. This reduces the original fractional wave equations to a coupled system consisting of two equations with lower order derivative in time. The time-fractional derivative is discretized using the L2- 1 σ formula, while a second-order scheme is used for discretizing the first-order time derivative. The spatial direction is discretized using an efficient two-grid Galerkin FEM. The paper demonstrates that the optimal error estimates in L 2 -norm and H 1 -norm of the two-grid methods can achieve optimal convergence order when the mesh size satisfies H = h 1 2 and H = h r 2 r + 2 , respectively. To handle the initial singularity of the solution and the historical memory of the fractional derivative term, the paper presents the nonuniform and fast two-grid algorithms. The numerical results validate the theoretical analysis and demonstrate the effectiveness of the proposed two-grid methods. • We establish an efficient two-grid method for the nonlinear time-fractional variable coefficient diffusion-wave equations. • We provide stability and convergence results for both fully discrete scheme and two-grid scheme, respectively. • The L2- 1 σ formula is employed to discretize Caputo fractional derivative to achieve second-order numerical accuracy. • Two-grid methods achieve optimal convergence order when coarse and fine grids satisfy H = h 1 2 and H = h r 2 r + 2 , respectively. • Considering the initial singularity and historical memory, the nonuniform and fast two-grid algorithms are presented. [ABSTRACT FROM AUTHOR]

In this paper, set stability of Boolean networks (BNs) is studied based on semi-tensor product of matrices. First, an index-vector is introduced to verify whether a BN can be set stable from an initial set to a destination set. Then, an algorithm is proposed to obtain the minimal set of pinning nodes to achieve set stability, if a BN is not set stable. Moreover, in order to reduce the computational complexity, a hybrid pinning control technique is proposed, where the designed controllers are not entirely dependent on all the nodes of the networks. Further, the issue of synchronization is discussed by using the proposed hybrid pinning control methods. Finally, simulations are presented to illustrate the effectiveness of the obtained results in this paper. • Based on an index-vector, a new necessary and sufficient condition has been obtained for set stability of Boolean networks from an initial state set to a destination state set. • Compared to the existing methods, fewer pinning nodes have been found to achieve global stability for a Boolean network by using the proposed method in this paper. • By using hybrid pinning control, pinning controllers have been simplified and the computational complexity has been reduced. [ABSTRACT FROM AUTHOR]

This paper studies customers' equilibrium joining behavior in a multi-server queue with threshold policy, and then puts forward effective schemes to control customers' behaviors and to optimize social welfare. The stream of customers consists of two parts: customers in class 1 and customers in class 2, and they wait for service in order until the system is empty. Then the servers take a vacation and they would be reactivated as soon as the queue length reaches a threshold N. The two types of customers are heterogeneous in service revenue and delay sensitivity, i.e., they have different revenue-cost structures. Besides, customers in class 1 can access to the delay information on servers' status and queue length as they arrive, but customers in class 2 can not. Distinguishing the two scenarios of whether there is a joining threshold for customers in class 1 in vacation state, we get the two types of customers' equilibrium joint joining strategies, respectively, and observe the interaction between the behaviors of the two types of customers. Moreover, we also get their socially optimal joint joining strategy for comparisons and for making control measures, and discuss the influence of the fraction of customers in class 1 on social welfare and system throughput. We find that in any scenario, the equilibrium social welfare is always unimodal with respect to the fraction of customers in class 1, which indicates that the higher fraction of customers in class 1 is not necessarily beneficial. However, on the premise of effectively controlling customer behavior, this high fraction is still necessary to optimize social welfare and increase system throughput, although the optimal social welfare is also unimodal. • This paper discusses the joining behavior of heterogeneous customers in a multi-server single-queue system with threshold policy. • This paper classifies two types of customers based on both delay information and revenue-cost structure heterogeneities in a multi-server queue. • This work simultaneously discusses and compares the equilibrium and socially optimal joining behaviors of the two types of customers. [ABSTRACT FROM AUTHOR]

An oriented circulant graph is called integral if all eigenvalues of its Hermitian adjacency matrix are integers. The main purpose of this paper is to investigate the existence of perfect state transfer (PST for short) and multiple state transfer (MST for short) on integral oriented circulant graphs. Specifically, a characterization of PST and MST on integral oriented circulant graphs is provided. As an application, we also obtain a closed-form expression for the number of integral oriented circulant graphs having PST and MST. • Use Ramanujan's sum to characterize the eigenvalues of integral oriented circulant graphs and give the complete formula. • The paper provides a characterization of PST and MST on integral oriented circulant graphs. • Closed-form expression for the number of graphs with PST and MST on integral oriented circulant graphs. [ABSTRACT FROM AUTHOR]

A k -edge coloring ϕ of graph G is injective if any two edges at distance 2 or in the same triangle get different colors. The minimum k in such an edge coloring is the injective edge chromatic number of G , written as χ i ′ (G). We prove in this paper that for any graph G with Δ (G) ≤ 5 , χ i ′ (G) ≤ 18 if m a d (G) < 16 5 , χ i ′ (G) ≤ 19 if m a d (G) < 7 2 and χ i ′ (G) ≤ 20 if m a d (G) < 15 4. • The results obtained in this paper enrich the previous work concerning on the study of injective coloring of sparse graphs. • The discharging method used in this paper is especially useful to solve the problem of injective coloring. • Some important reducible configurations are presented and the discharging rulers are well designed. • It is the first time to study the sufficient conditions for graphs with maximum degree Δ = 5 satisfying χ i ′ (G) ≤ Δ (Δ − 1). [ABSTRACT FROM AUTHOR]

In this paper, we study a class of discrete-time cyber-physical systems (CPSs) with transmission delays and sparse malicious attacks on both input and output transmission channels, and present design methods for secure observer and controller. First, the states and sparse malicious attacks of the original system are reorganized into the states of the new system obtained by an improved augmentation method (rather than a singular augmentation method). Then, based on the new system, the states and attacks can be reconstructed simultaneously by the designed Luenberger-like observer. Furthermore, a novel dynamic output feedback (DOF) controller is proposed using the estimated values of the attacks, and a cone complementarity linearization (CCL) algorithm is designed to obtain the controller gains. The results show that the closed-loop system is stable in the sense of Lyapunov that both the estimation errors and the original system states will converge to a small neighborhood of the origin. In addition, the correlation results without delay are given. Finally, two examples are given to illustrate the effectiveness and superiority of the proposed method. • In addition to the sparse attacks that occur in both input and output channels, this paper also considers the transmission delays in both channels. • This paper introduces a multi-delay dynamic output feedback controller that transforms the inherently unstable original system into one that ultimately achieves Lyapunov stability. • In the case without transmission delay, compared with the results in previous researches, the proposed method of designing the observer and controller separately can reduce the difficulty of solving observer gains and controller gains, and enhance the feasibility. [ABSTRACT FROM AUTHOR]

Let Γ = (V , E) be a graph of order p. Recently, the Sombor index is introduced, defined as S O (Γ) = ∑ v i v j ∈ E (Γ) d Γ (v i) 2 + d Γ (v j) 2 , where d Γ (v i) is the degree of the vertex v i in Γ. Cruz and Rada [4] obtained an upper bound on the Sombor index of unicyclic and bicyclic graphs of order p , but did not characterize the extremal graphs. In the same paper, they mentioned that the maximal graphs over the set of unicyclic and bicyclic graphs with respect to Sombor index, is an interesting problem that remains open. In this paper we completely solve these problems. • Sombor index of a graph Γ is defined as S O (Γ) = ∑ v i v j ∈ E (Γ) d Γ (v i) 2 + d Γ (v j) 2 . • To determine maximal graph over the set of unicyclic graphs with respect to Sombor index. • To characterize the maximal bicyclic graph with respect to Sombor index. [ABSTRACT FROM AUTHOR]

The stability issue and stabilization issue for a class of singular neutral systems are studied in this paper. Firstly, we give some sufficient conditions such that the considered open-looped systems are admissible. Secondly, we give some results which design the feedback controllers and ensure that the resulting close-looped systems are admissible. Finally, the superiority and effectiveness of the obtained methods are illustrated by two numerical examples. The results obtained in this paper can be employed to analyze the singular neutral systems which do not satisfy the restrictive conditions presented in some published papers. • The singular neutral system that does not satisfy the restrictions presented in some papers is considered. • The considered system contains the neutral delay and the state delay. • This paper presents some sufficient conditions which guarantee the considered system to be admissible. • Two different methods are used to design the feedback controllers. • Numerical examples are presented to illustrate the effectiveness and superiority of the obtained results. [ABSTRACT FROM AUTHOR]

This paper addresses the stabilization problem of continuous-time Markovian jump systems (MJSs) by applying an optimization controller. A new stabilizing method based on a mode separation algorithm is proposed, whose separation will be optimized by minimizing the established cost function value. It will be seen that the presented optimal controller will have hybrid decision variables such as continuous and discrete variables. Meanwhile, the related cost function is in contrast to the traditionally linear quadratic functions. The conditions for the existence of the developed controller are established via using rigorous theory analysis, and its detailed computation method is presented too. It can be concluded that traditionally mode-dependent and -independent controllers about MJSs are contained as two special situations. A practical example is offered so as to verify the effectiveness and superiority of the methods proposed in this study. • A new stabilizing controller is proposed to deeply depend on the separation of modes or subsystems. • A novel control cost function is proposed to optimize the mode separation. • It has been proved that the stabilizing controller based on the optimized mode separation can be realized for MJSs, if a precondition is satisfied. • Compared with the similar but very few result [19] , it has showed that the method in this paper is better in having smaller cost function values. • The presented controller can include mode-dependent and -independent controllers as special situations, which is less conservative than mode-independent ones. [ABSTRACT FROM AUTHOR]

A k -limited packing partition (k LP partition) of a graph G is a partition of V (G) into k -limited packing sets. We consider the k LP partitions with minimum cardinality (with emphasis on k = 2). The minimum cardinality is called k LP partition number of G and denoted by χ × k (G). This problem is the dual problem of k -tuple domatic partitioning as well as a generalization of the well-studied 2-distance coloring problem in graphs. We give the exact value of χ × 2 for trees and bound it for general graphs. A section of this paper is devoted to the dual of this problem, where we give a solution to an open problem posed in 1998. We also revisit the total limited packing number in this paper and prove that the problem of computing this parameter is NP-hard even for some special families of graphs. We give some inequalities concerning this parameter and discuss the difference between 2TLP number and 2LP number with emphasis on trees. [ABSTRACT FROM AUTHOR]

In this paper, our intention is to investigate the blow-up theory for generalized auto-convolution Volterra integral equations (AVIEs). To accomplish this, we will consider certain conditions on the main equation. This will establish a framework for our analysis, ensuring that the solution of the equation exists uniquely and is positive. Firstly, we analyze the existence and uniqueness of a local solution for a more general class of AVIEs (including the proposed equation in this paper) under certain hypotheses. Subsequently, we demonstrate the conditions under which this local solution blows up at a finite time. In other words, the solution becomes unbounded at that time. Furthermore, we establish that this blow-up solution can be extended to an arbitrary interval on the non-negative real line, thus referred to as a global solution. These results are also discussed for a special case of generalized AVIEs in which the kernel functions are taken as positive constants. • Proof of existence and uniqueness of a local solution for a more general case of AVIEs in two cases (see Section 3). • Discussing continuation of local solution for a large interval (see the last two paragraphs of Section 3). • Proving blowing up and globality properties of local solution. [ABSTRACT FROM AUTHOR]

In this paper, a new direct method based on system solutions is proposed to give global exponential synchronization analysis of multi-link memristive neural networks. The network dynamics are affected by time-varying distribution, leakage and transmission delays, simultaneously. Based on the definition of synchronization, sufficient conditions to ensure the synchronization of multi-link memristive neural networks are investigated, and thereby, a new controller is proposed. Compared with other controllers, the controller design method proposed in this paper is relatively simple, and avoids the construction of Lyapunov–Krasovskii functionals, which greatly reduces the workload. Finally, numerical simulations are given to check the effectiveness of this method. • Global exponential synchronization of multi-link memristive neural networks is studied. • The time-varying distribution, leakage and transmission delays are involved. • A direct method based on system solutions is proposed to give synchronization conditions. • Compared with the usual methods, the direct method reduces computational complexity. • The obtained synchronization conditions can be easily checked by using MATLAB. [ABSTRACT FROM AUTHOR]

The maintenance of biological diversity has perpetually remained a central focus in the field of ecology. In the pursuit of enhanced survival rates, species have begun to explore cooperation with one another. However, the consequences of such collaboration remain largely unexplored. To delve into this matter, we introduce intraspecific cooperation within the framework of the classic rock-paper-scissors (RPS) game. In this model, the competition rate is intricately tied to interactions among individuals of the same species. A greater population of individuals from the same species tends to lead to an increased predation rate and a decreased prey rate. Through extensive simulations, we observe that (i) in the case of homogeneous intraspecific cooperation (all three species have intraspecific cooperation), increased cooperation between predators tends to increase the likelihood of species coexistence. In contrast, high levels of cooperation between prey appeared to decrease the favorability of species coexistence. Measurements of the characteristic length of spiral structures revealed that the characteristic length of spirals became longer when the intensity of prey cooperation increased. (ii) In the case of heterogeneous intraspecific cooperation (two species or only one species with intraspecific cooperation), neither an increase in the intensity of intraspecific cooperation of the predator nor an increase in the intensity of intraspecific cooperation of the prey is favorable for species coexistence. Our work underscores the critical role of intraspecific cooperation in maintaining biodiversity. • In rock-paper-scissors games, intraspecific cooperation promotes and jeopardizes biodiversity. • Under homogeneous intraspecific cooperation, predator cooperation promotes coexistence. • Under heterogeneous intraspecific cooperation, both predator and prey cooperation jeopardize coexistence. [ABSTRACT FROM AUTHOR]

In this paper, by means of sliding mode control (SMC), the problem resulted by local input matrices is investigated for fuzzy markovian jumping system. The stability of the considered fuzzy Markovian system with multiple sub-input matrices can be fulfilled using the method in this paper. First, the state equation of the considered system is transformed according to the input matrices. Second, according to the state equation, sliding mode surface is constructed. This surface contains several sub-surfaces. It can deal with this kind of fuzzy Markovian system with multiple sub-input matrices and uncertainties. And another characteristic is that there is not the process of reaching the sliding mode surface; It can settle the problem resulted by Markovian jumping and sliding mode method together. Third, by use of the Cramer's rule, a criterion is provided to judge the existence of sliding mode dynamics equation. A controller containing several sub-controllers components is designed. And these sub-controllers should keep the considered system on the several sub-surfaces and not leave it. At last, simulations are provided to illustrate the validity of the method in this paper. [ABSTRACT FROM AUTHOR]