样式: 排序: IF: - GO 导出 标记为已读
-
Reputation-dependent social learning on the evolution of cooperation in spatial public goods games Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-17 Ji Quan, Xiyue Zhang, Wenman Chen, Caixia Tang, Xianjia Wang
In this study, we propose a new second-order reputation evaluation rule in the spatial public goods games, in which both actions of the individual and his neighbors with the worst reputation are taken into account. Considering the incomplete accessibility of individual reputation information, we introduce a reputation reasoning ability parameter and study the effect of reputation on individual strategy
-
Harmonic signed trees Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-17 Qian Yu, Yaoping Hou
A signed graph is defined to be harmonic if its net-degree vector is a zero vector or an eigenvector of adjacency matrix corresponding to an eigenvalue . In this paper, we demonstrate the existence of -harmonic signed trees with arbitrary diameter and the nonexistence of finite 0-harmonic signed trees. And we determine all harmonic signed trees with diameter at most 5. Moreover, we give some general
-
Composite adaptive exponential tracking control for large-scale nonlinear systems with sensor faults Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-17 Hicham Khebbache, Abderrahim Benmicia, Salim Labiod, Naamane Bounar, Abdesselem Boulkroune
The issue of composite adaptive exponential tracking control for a class of large-scale nonlinear systems under model uncertainties, external disturbances, along with multiplicative and additive time-varying sensor faults is considered in this paper. The command filtered backstepping approach is employed to address the “explosion of terms” issue inherent in standard backstepping method. A novel compensating
-
Stability analysis of Clifford-valued memristor-based neural networks with impulsive disturbances and its application to image encryption Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-17 Ningning Zhao, Yuanhua Qiao
In this paper, a type of delayed Clifford-valued memristor-based neural networks (CLVMNNs) with impulsive disturbances is established, and the global exponential stability is investigated by using generalized norm. Firstly, the n-dimensional Clifford-valued systems are decomposed into -dimensional real-valued systems to address the non-commutativity problem of the multiplication of Clifford numbers
-
A novel observer-based neural-network finite-time output control for high-order uncertain nonlinear systems Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-17 Hoai Vu Anh Truong, Van Du Phan, Duc Thien Tran, Kyoung Kwan Ahn
Due to the difficulty encountered in dealing with unstructured system dynamics with unmeasured system state variables, this paper presents a novel observer-based neural network finite-time output control strategy for general high-order nonlinear systems (HNSs). The suggested technique is performed based on the backstepping-like control (BSC) scheme with a hybrid nonlinear disturbance-state observer
-
A second-order linear and unconditional energy-stable scheme for Swift-Hohenberg equations Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-16 Yaoda Li, Zhibin Han, Yajun Yin, Wen Li
In the paper, an unconditional energy-stable scheme is developed with the help of the scalar auxiliary variable (SAV) approach and the leapfrog time-discretization. The fully discrete scheme gives a linear and decoupled system, whereas previous SAV-type methods usually gave a coupled linear system. Therefore, the proposed scheme is decoupled and thus easier to be implemented. Moreover, it is proved
-
Cost function analysis of a single-server queueing system with Poisson input stream and Erlang-k service time Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-16 Stefan Mirchevski, Verica Bakeva
In this paper, the cost function of a single-server queueing system with Poisson input stream and Erlang- service time will be analyzed. Treated as a function of the traffic intensity , with respect to some known constants, we will show that its stationary points are solutions of a fourth-degree polynomial equation with real coefficients. Moreover, an explicit form of these solutions is given and it
-
A coupled smoothed finite element method and Lagrangian particle tracking model for three-dimensional dilute particle-laden flows Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-16 Guo Zhou, Tiantian Wang, Chen Jiang, Fangcheng Shi, Lei Zhang, Yu Wang, Buyao Yang
In this study, a coupled solution algorithm for three-dimensional dilute particle-laden flows is proposed by integrating the Lagrangian particle tracking model into the smoothed finite element method (S-FEM). Initially, an unstructured mesh fluid solver with multi-type elements is developed using the cell-based S-FEM (CS-FEM) in the Eulerian framework. Subsequently, a fluid force-driven strategy is
-
The use of entropy of recurrence microstates and artificial intelligence to detect cardiac arrhythmia in ECG records Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-15 B.R.R. Boaretto, A.C. Andreani, S.R. Lopes, T.L. Prado, E.E.N. Macau
Cardiac arrhythmia is a common clinical problem in cardiology defined as the abnormality in heart rhythm. Bradycardia, atrial fibrillation, tachycardia, supraventricular tachycardia, atrial flutter and sinus irregularity are common different classifications for arrhythmia. In this study, we develop a new approach to distinguishing between these most common heart rhythms. Our approach is based on dynamical
-
Stability of solutions of systems of Volterra integral equations Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-12 I.V. Boykov, V.A. Roudnev, A.I. Boykova
In this paper, we propose new sufficient conditions for stability of solutions of systems of Volterra linear integral equations and systems of linear integro-differential Volterra equations. Solution stability conditions for systems of Volterra linear integral equations are studied with perturbed right hand sides of the equations. These new sufficient conditions are expressed in terms of logarithmic
-
Enhancing continuous time series modelling with a latent ODE-LSTM approach Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-12 C. Coelho, M. Fernanda P. Costa, L.L. Ferrás
Due to their dynamic properties such as irregular sampling rate and high-frequency sampling, Continuous Time Series (CTS) are found in many applications. Since CTS with irregular sampling rate are difficult to model with standard Recurrent Neural Networks (RNNs), RNNs have been generalised to have continuous-time hidden dynamics defined by a Neural Ordinary Differential Equation (Neural ODE), leading
-
Asynchronous finite-time extended dissipative filter on linear neutral semi-Markov jump systems under sensor saturation and dual-channel DoS attacks Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-12 Guifang Cheng, Hao Liu
This paper designs the asynchronous finite-time extended dissipative filter on neutral semi-Markov jump systems subject to sensor saturation and dual-channel denial-of-service attacks. Based on event-triggering scheme and hidden Markov model, the asynchronous filter is designed. Sufficient conditions which filter error system is extended dissipative stochastic finite-time bound are derived. In the
-
Output-mask-based adaptive NN control for stochastic time-delayed multi-agent systems with a unified event-triggered approach Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-11 Xiyue Guo, Huaguang Zhang, Xin Liu, Xiaohui Yue
This paper investigates a class of output-mask-based adaptive neural network (NN) tracking control for nonlinear stochastic time-delayed multi-agent systems (STMASs) based on a unified event-triggered approach. The output signal relies on an output mapping acted as a mask, defined as a privacy-protection-like method, so that the internal state of one agent cannot be identified by other distrustful
-
Null controllability of an ODE-heat system coupled at boundary and internal term Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-11 Caijin Zeng, Zhongcheng Zhou, Chengkang Xie
In this article, the null controllability of a coupled ODE-heat system is considered by backstepping method. First, according to a backstepping transformation, the system is transferred into an intermediate system which has an equivalence of null controllability with the original system. Second, we divide the finite time interval into a sequence of time intervals, and on each time interval, transform
-
Enumeration of spanning trees containing perfect matchings in hexagonal chains with a unique kink Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-09 Xiaoxu Ma, Yujun Yang
Hexagonal chains are graph representations of benzenoid polymers which are common but important molecular structures in chemistry. A spanning tree of a graph is a subgraph which is a tree and contains all the vertices of the graph. A perfect matching of a graph is a set of disjoint edges covering all vertices of the graph. In this paper, we give exact expression for the number of spanning trees containing
-
Double weakly singular kernels in stochastic Volterra integral equations with application to the rough Heston model Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-09 O. Farkhondeh Rouz, S. Shahmorad, D. Ahmadian
This paper focuses on investigating the stochastic Volterra integral equations (SVIEs) with double weakly singular kernels. Our primary objective is to examine the well-posedness of the proposed equation. Specifically, we explore the presence of existence, uniqueness, boundedness, and the continuous dependence of the exact solution on the initial data. Additionally, we develop a stochastic -scheme
-
The competitive diffusion of knowledge and rumor in a multiplex network: A mathematical model Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-09 He Huang, Jialin Pan, Yahong Chen
The competition between rumor and knowledge has received significant attention from the global world. How to spread knowledge to better contain rumor has also become an important practical issue. In this study, we build a multi-compartment model in a multiplex network to study the competitive diffusion of knowledge and rumor. Two factors are emphasized in the model: penetration of knowledge into rumor
-
Robust control with protected feedback information for switched systems under injection attacks Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-09 Chen Wang, Yiwen Qi, Yiwen Tang, Xin Li, Ming Ji
In this paper, the robust security protection control for switched systems is studied. A robust anti-disturbance mechanism using the Radial Basis Function Neural Network (RBFNN) is proposed for switched systems, which can approximate and compensate for the impact of unknown disturbance on the system state. Then, a network security protection mechanism based on encoder and decoder is presented, which
-
An efficient algorithm for Fantope-constrained sparse principal subspace estimation problem Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-09 Yong-Jin Liu, Yuqi Wan, Lanyu Lin
The Fantope-constrained sparse principal subspace estimation problem is initially proposed by Vu et al. (Vu et al., 2013). This paper investigates a semismooth Newton based proximal point () algorithm for solving the equivalent form of this problem, where a semismooth Newton () method is utilized to optimize the inner problems involved in the algorithm. Under standard conditions, the algorithm is proven
-
The impact of anxiety on cooperative behavior: A network evolutionary game theory approach Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-09 Qianwei Zhang, Rui Tang, Yilun Lu, Xinyu Wang
Complex and intense competition always exists in human society, in which people would inevitably feel anxiety due to failure. Anxious people would doubt their own strategies and try to change them. For the individuals, anxiety stems mainly from their past failures and from their concerns about the current lack of competitiveness, which could be identified as two sources of anxiety. Based on the Prisoner's
-
Protocol-based fault detection for state-saturated systems with sensor nonlinearities and redundant channels Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-08 Weilu Chen, Jun Hu, Zhihui Wu, Xiaojian Yi, Hongjian Liu
This paper is concerned with the protocol-based fault detection (FD) issue for state-saturated delayed nonlinear systems with both redundant channels and sensor nonlinearities. Specifically, in pursuit of relieving the communication pressure, the stochastic communication protocol is adopted, which can regulate the transmission of output signal during the communication process. Moreover, for the purpose
-
Two-disjoint-cycle-cover pancyclicity of data center networks Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-08 Rong-Xia Hao, Xiao-Wen Qin, Hui Zhang, Jou-Ming Chang
A graph is two-disjoint-cycle-cover -pancyclic if for any integer satisfying , there exist two vertex-disjoint cycles and in such that and . The -dimensional data center network DCell with port switches and order , denoted by , plays an important role in big data cloud computing. In this paper, we study the structural properties of and show that is two-disjoint-cycle-cover -pancyclic for and , that
-
Time-varying formation of uncertain nonlinear multi-agent systems via adaptive feedback control approach with event-triggered impulsive estimator Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-08 Ziqiang Xu, Yun Li, Xisheng Zhan, Huaicheng Yan, Yiyan Han
The time-varying formation problem under directed topology is investigated for the uncertain nonlinear multi-agent systems (MASs) via the neural networks-based adaptive feedback control (NNAFC). Compared with the simple adaptive control, the designed control protocol consists of two parts: NNAFC and the event-triggered impulsive estimator. To save communication costs, communications among followers
-
Double fast algorithm for solving time-space fractional diffusion problems with spectral fractional Laplacian Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-06 Yi Yang, Jin Huang
This paper presents an efficient and concise double fast algorithm to solve high dimensional time-space fractional diffusion problems with spectral fractional Laplacian. We first establish semi-discrete scheme of time-space fractional diffusion equation, which uses linear finite element or fourth-order compact difference method combining with matrix transfer technique to approximate spectral fractional
-
Learn to solve dominating set problem with GNN and reinforcement learning Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-05 Mujia Chen, Sihao Liu, Weihua He
The Dominating Set Problem has a wide range of applications in many industrial areas and the problem has been proven to be NP-hard. The idea using neural networks to solve combinatorial optimization problems has been shown to be effective and time-saving in recent years. Inspired by these studies, to solve the Dominating Set Problem, we train a neural network by Double Deep Q-Networks (DDQN). To better
-
The polyomino graphs whose resonance graphs have a 1-degree vertex Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-05 Chunhu Sun, Yaxian Zhang, Heping Zhang
A polyomino graph is a 2-connected plane graph such that each interior face is a square of side length one. The resonance graph of a polyomino graph is a graph in which the vertices are the 1-factors of and two vertices are adjacent provided their corresponding two 1-factors differ in exactly one unite square. In this paper, we determine the polyomino graphs whose resonance graph has a 1-degree vertex
-
Computational efficiency study of a micro-macro Markov chain Monte Carlo method for molecular dynamics Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-05 Hannes Vandecasteele, Giovanni Samaey
We study the numerical properties of a recently introduced micro-macro Markov chain Monte Carlo (mM-MCMC) scheme that accelerates sampling of Gibbs distributions when there is a time-scale separation between the complete (microscopic) molecular dynamics and the slow dynamics of a low dimensional reaction coordinate. The micro-macro Markov chain works in three steps: 1) compute the reaction coordinate
-
Numerical inverse transformation of double sided Laplace transform with parameter optimization Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-04 András Mészáros, Miklós Telek
There are efficient numerical inverse Laplace transformation (NILT) procedures for double sided Laplace transforms (DSLT), which are based on some hyperparameters. If those hyperparameters are set properly, the computed inverse is accurate, while using an incorrect hyperparameter results in a completely incorrect inverse.
-
Distributed dual consensus algorithm for time-varying optimization with coupled equality constraint Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-04 Yuanyuan Yue, Qingshan Liu
This paper introduces a distributed continuous-time algorithm that utilizes dual consensus to tackle the optimization problem involving time-varying (TV) local objective functions and TV coupled equality constraint. Here, the local objective functions can be any strongly convex functions. The optimum solution is represented by a trajectory rather than a fixed point, owing to the dynamic nature of the
-
Enumerating maximal dissociation sets in three classes of grid graphs Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-04 Yuting Tian, Jianhua Tu
A dissociation set in a graph is a subset of vertices inducing a subgraph of maximum degree at most 1, and a dissociation set is maximal if it is not a proper subset of any other dissociation set. In this paper, we use the state matrix recursion algorithm to enumerate maximal dissociation sets in grid graphs, cyclical grid graphs and cylindrical grid graphs. We also analyze the growth rates of the
-
The evolutionary game of emotions considering the influence of reputation Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-04 Xi Bai, Ye Ye, Tong Chen, Nenggang Xie
The influence of reputation and emotions on the evolution of cooperation is acknowledged, but current research predominantly focuses on one aspect. This paper integrates both reputation and emotions to examine their collective impacts on the evolution of cooperation. Initially, we define the expression of individual emotional profiles and emotional reputation. Subsequently, we consider the combined
-
Partitioning planar graphs into bounded degree forests Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-04 Yang Wang, Jiali Wang, Weifan Wang, Jiangxu Kong
An -partition of a graph is a partition of into two subsets and such that is a forest with maximum degree at most for . In this paper we show that every planar graph without 4-cycles and 6-cycles has an -partition. This improves a result by Huang, Huang and Lv in 2023, which says that has an -partition.
-
Event-triggered robust fuzzy adaptive control for non-strict feedback nonlinear system with prescribed performance Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-04 Shuai Sui, Yuelei Yu, Shaocheng Tong, C.L. Philip Chen
This paper addresses a class of uncertain non-strict feedback nonlinear systems and proposes an event-triggered fuzzy adaptive prescribed performance control (PPC) strategy. Fuzzy logic systems (FLSs) are employed to approximate unknown smooth functions. In the control design, an event-triggered mechanism (ETM) from sensor-to-controller is introduced to economize on unnecessary transmission and communication
-
Multi-information and epidemic coupling propagation considering indirect contact on two-layer networks Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-04 Dandan Li, Weijie Xie, Dun Han
This research provides an in-depth examination of the interplay between diverse information propagation and epidemic spread within a two-layer network, placing particular emphasis on the implications of both direct and indirect modes of disease transmission. Individuals are categorized based on their susceptibility to and their capacity for disease propagation, while the influence of varying infection
-
On the minimum driver node set of k-uniform linear hypertree networks Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-03 Liang Wei, Faxu Li, Haixing Zhao, Bo Deng
The exact controllability research framework of complex networks points out that the controllability of the network has a great relationship with the minimum number of driver nodes. It is generally believed that the smaller the minimum number of driver nodes and the lower the cost of external control of the whole network to achieve the ideal state, the better the controllability of networks. In this
-
Levenberg-Marquardt method with singular scaling and applications Appl. Math. Comput. (IF 4.0) Pub Date : 2024-04-03 Everton Boos, Douglas S. Gonçalves, Fermín S.V. Bazán
Inspired by certain regularization techniques for linear inverse problems, in this work we investigate the convergence properties of the Levenberg-Marquardt method using singular scaling matrices. Under a completeness condition, we show that the method is well-defined and establish its local quadratic convergence under an error bound assumption. We also prove that the search directions are gradient-related
-
A sufficient condition for planar graphs with girth 5 to be (1,6)-colorable Appl. Math. Comput. (IF 4.0) Pub Date : 2024-03-29 Ganchao Zhang, Min Chen, Weifan Wang
A graph is -colorable if its vertices can be partitioned into two subsets and such that and . Let denote the family of planar graphs with girth at least 5. In this paper, we prove that every graph in without adjacent 5-cycles is -colorable.
-
New LMI approach to [formula omitted] control of discrete-time singular systems Appl. Math. Comput. (IF 4.0) Pub Date : 2024-03-29 Xiao-Heng Chang, Xiao-Yan Wang, Li-Wei Hou
This article studies the problem of feedback control for discrete-time singular system. The objective is to design the controller to make the closed-loop system admissible and satisfy the specified performance. Firstly, the admissibility of the closed-loop system is analyzed via the Lyapunov function and linear matrix inequality (LMI) method, the admissibility condition of the singular system with
-
Epidemic models in well-mixed multiplex networks with distributed time delay Appl. Math. Comput. (IF 4.0) Pub Date : 2024-03-29 Jonq Juang, Yu-Hao Liang
In this paper, we consider an epidemic model in well-mixed multiplex networks with distributed time delay. Specifically, the model consists of two layers of well-mixed networks in the physical and virtual worlds, respectively, where two diffusive processes interact and influence each other within the same individual. We assume that there is a distributed time delay for an individual to become infected
-
The smallest eigenvalue of the Hankel matrices associated with a perturbed Jacobi weight Appl. Math. Comput. (IF 4.0) Pub Date : 2024-03-29 Yuxi Wang, Yang Chen
In this paper, we study the large behavior of the smallest eigenvalue of the Hankel matrix, , generated by the dependent Jacobi weight . Applying the arguments of Szegö, Widom and Wilf, we obtain the asymptotic representation of the orthonormal polynomials , , with the weight . Using the polynomials , we obtain the theoretical expression of , for large . We also display the smallest eigenvalue for
-
Pricing European call options with interval-valued volatility and interest rate Appl. Math. Comput. (IF 4.0) Pub Date : 2024-03-27 Song Wang
We propose a novel approach to pricing European call options when both of the volatility of the underlying asset and interest are uncertain. In this approach, we formulate the option pricing problem with uncertain parameters as a partial-differential inequality constrained interval optimization problem. An interior penalty method is then developed for the numerical solution of the finite-dimensional
-
Stationary distribution of a double epidemic stochastic model driven by saturated incidence rates Appl. Math. Comput. (IF 4.0) Pub Date : 2024-03-27 T. Tamil Selvan, M. Kumar
The double epidemic study is one of the critical studies in recent times as humankind experiences various simultaneous spreads of diseases. Reproduction numbers are important, which helps to derive sufficient conditions for extinction, persistence and co-persistence of diseases. This work aims to establish the stationary distribution of a stochastic double epidemic model comprised of SIR and SIRS transmission
-
A spectral approach to Hebbian-like neural networks Appl. Math. Comput. (IF 4.0) Pub Date : 2024-03-27 Elena Agliari, Alberto Fachechi, Domenico Luongo
We consider the Hopfield neural network as a model of associative memory and we define its neuronal interaction matrix as a function of a set of binary vectors representing a sample of the reality that we want to retrieve. In particular, any item is meant as a corrupted version of an unknown ground pattern , that is the target of our retrieval process. We consider and compare two definitions for ,
-
Truncated predictive tracking control design for semi-Markovian jump systems with time-varying input delays Appl. Math. Comput. (IF 4.0) Pub Date : 2024-03-27 S. Harshavarthini, S.M. Lee
A state tracking control problem for a class of semi-Markovian jump systems (SMJSs) with input delay and disturbances is addressed in this study. In particular, an improved-equivalent-input-disturbance estimator approach (IEIDEA)-based truncated predictive controller is designed to synchronously compensate the effect of unknown external disturbances and time-varying delay. Specifically, by making use
-
Linear saturation numbers of Berge-C3 and Berge-C4 Appl. Math. Comput. (IF 4.0) Pub Date : 2024-03-27 Changxin Wang, Junxue Zhang
The linear saturation number (linear extremal number ) of is the minimum (maximum) number of hyperedges of an -vertex linear -uniform hypergraph containing no member of as a subgraph, but the addition of any new hyperedge such that the result hypergraph is still a linear -uniform hypergraph creates a copy of some hypergraph in . Determining , Berge-) is equivalent to the famous (6,3)-problem, which
-
Orthotope-search-expansion-based extended zonotopic Kalman filter design for a discrete-time linear parameter-varying system with a dual-noise term Appl. Math. Comput. (IF 4.0) Pub Date : 2024-03-27 Ziyun Wang, Xianzhe Wang, Yan Wang
A novel algorithm utilizing an extended zonotopic Kalman filter based on the orthotope search expansion method is introduced to solve the state estimation problem in discrete-time linear parameter-varying systems when the dual noise of the systems is assumed to be bounded but unknown. First, to identify unknown parameters, an orthotope search expansion method is proposed with a measurement strip constraint
-
Prescribed time formation synchronous tracking of unmanned aerial vehicles with denial of service attacks Appl. Math. Comput. (IF 4.0) Pub Date : 2024-03-27 Shi-Xun Xiong, Xiang-Peng Xie, Guo-Ping Jiang, Meng-ting Chen
This paper addresses the issue of robust prescribed time synchronous tracking control of unmanned aerial vehicles (UAVs) formation with denial of service attacks. A novel prescribed time synchronous tracking control scheme is proposed within a denial of service attack conversion mechanism. Firstly, on account of the UAV formation in the presence of aerodynamic damping and denial of service attacks
-
Cooperation emerged and survived in scale-free networks in co-evolution and betrayer-prevailing circumstances Appl. Math. Comput. (IF 4.0) Pub Date : 2024-03-27 Qiu Yuhui, Lv Tianyang, Zhang Xizhe, Hu Honghua, Ma Yuanchi
How did cooperation emerge and persist while betrayal was beneficial for individuals? Previous studies suggested that network reciprocity was a promising explanation. However, these studies usually analyzed cooperation performances of different types of networks separately and/or statically, thus failing to fully capture the co-evolution and interaction features in our history. We proposed a mechanism
-
H∞ observer-based controller synthesis for fractional order systems over finite frequency range Appl. Math. Comput. (IF 4.0) Pub Date : 2024-03-26 Xuefeng Zhang, Yuanda Lv, Jin-Xi Zhang
This paper focuses on the observer-based control problem for fractional order systems (FOSs) over finite frequency range. Firstly, as an extension to the KYP lemma, the structure singular value– and its upper bound are analyzed and determined. The necessary and sufficient conditions of the performance for FOSs over finite frequency range are given through the generalized analysis method. This method
-
Designing incoherent unit norm tight frames via block coordinate descent-based alternating projection Appl. Math. Comput. (IF 4.0) Pub Date : 2024-03-25 Fenghua Tong, Dawei Zhao, Xin Li, Lixiang Li
In this paper, we introduce a novel methodology for constructing incoherent unit norm tight frames, termed block coordinate descent-based alternating projection. In the proposed approach, the underlying min-max problem was reformulated in a block-wise fashion by taking a fixed number of columns as a block and adding a spectral constraint, and it was approximately solved via an alternating projection
-
Fault tolerability evaluation for the component edge-connectivity of folded Petersen networks Appl. Math. Comput. (IF 4.0) Pub Date : 2024-03-25 Liqiong Xu
Analysis on the link fault tolerability of multiprocessor systems plays a significance role in designing and optimizing for multiprocessor systems. The component edge-connectivity, as a generalization of the classical edge-connectivity, is a considerable measurement for the analysis of the robustness of multiprocessor systems. The -component edge-connectivity of a connected graph , expressed by , is
-
Repeated prisoner's dilemma games in multi-player structured populations with crosstalk Appl. Math. Comput. (IF 4.0) Pub Date : 2024-03-23 Ji Quan, Xinyue Chen, Xianjia Wang
Crosstalk represents a ubiquitous phenomenon in which strategic moves made in one game can influence actions in another. Reiter et al. [1] first integrated crosstalk with the repeated prisoner's dilemma model in structured populations. We extend their strategic space from one-step reactive strategies that consider only the actions of the opponent to memory-one strategies that consider the actions of
-
CN ADI fast algorithm on non-uniform meshes for the three-dimensional nonlocal evolution equation with multi-memory kernels in viscoelastic dynamics Appl. Math. Comput. (IF 4.0) Pub Date : 2024-03-22 Ziyi Zhou, Haixiang Zhang, Xuehua Yang
This paper proposes a Crank-Nicolson alternating direction implicit (CN-ADI) finite difference scheme for solving the three-dimensional nonlocal evolution equation with multi-memory kernels in viscoelastic dynamic for the first time. Due to the weakly singular behavior of the exact solution near the initial time , we use the non-uniform meshes to capture the rapid change of the solution at . The Crank-Nicolson
-
Particle swarm intelligence promotes cooperation by adapting interaction radii in co-evolutionary games Appl. Math. Comput. (IF 4.0) Pub Date : 2024-03-22 Yue Tian, Shun Gao, Haihong Li, Qionglin Dai, Junzhong Yang
Particle swarm optimization (PSO), a population-based optimization algorithm inspired by swarm behaviors, has been applied extensively to simulate social behaviors such as migration, urban planning, or resource utilization. It capitalizes on the inherent principles of social cooperation, adaptability and learning from peers to help individuals in a population search for optima. In this work, we propose
-
Exploring multi-potential games in strategic form: A graph theoretic approach Appl. Math. Comput. (IF 4.0) Pub Date : 2024-03-21 Aixin Liu, Haitao Li, Lin Wang
Multi-potential games (MPGs), wherein the facility cost functions of players are distinct, significantly expand the scope of traditional potential games. This paper explores the payoff-related structure properties within MPGs, with a focus on the categorization of players according to their conflicting interests. Initially, the study establishes a necessary and sufficient condition to determine if
-
The emergence of cooperation in the context of prior agreement with threshold and posterior compensation Appl. Math. Comput. (IF 4.0) Pub Date : 2024-03-21 Jianwei Wang, Wei Chen, Fengyuan Yu, Siyuan Zhou, Jialu He, Wenshu Xu, Wenhui Dai
Previous experience suggests that prior agreement (a mechanism to test how strongly peers are committed to a common goal) and posterior compensation (a way to compensate cooperators by punishing defectors who violate their commitments) together contribute to the flourishing of cooperation. Far less is known, however, how the determination of the optimal threshold for prior agreement in force and the
-
Poidge-convexity in triangular lattices Appl. Math. Comput. (IF 4.0) Pub Date : 2024-03-21 Bo Wang, Liping Yuan, Tudor Zamfirescu
We adapt the notion of poidge-convexity to subgraphs of the triangular lattice, and investigate the poidge-convexity of graphs belonging to two families of such subgraphs: paths and grid graphs.
-
Stability analysis and Hopf bifurcation for two-species reaction-diffusion-advection competition systems with two time delays Appl. Math. Comput. (IF 4.0) Pub Date : 2024-03-20 H.Y. Alfifi
This paper examines a class of two-species reaction-diffusion-advection competition models with two time delays. A system of DDE equations was derived, both theoretically and numerically, using the Galerkin technique method. A condition is defined that helps to find the existence of Hopf bifurcation points. Full diagrams of the Hopf bifurcation points and areas of stability are investigated in detail
-
Rainbow disjoint union of P4 and a matching in complete graphs Appl. Math. Comput. (IF 4.0) Pub Date : 2024-03-20 Zemin Jin, Qing Jie, Zhenxin Cao
An edge-colored graph is called rainbow if all the colors on its edges are distinct. Given graphs and , the anti-Ramsey number is the maximum number such that there exists an edge-coloring of with exactly colors containing no rainbow copy of . Recently, the anti-Ramsey problem for disjoint union of graphs received much attention. In particular, several researchers focused on the problem for graphs
-
Injective edge chromatic number of sparse graphs Appl. Math. Comput. (IF 4.0) Pub Date : 2024-03-20 Junlei Zhu, Hongguo Zhu, Yuehua Bu
A -edge coloring of graph is injective if any two edges at distance 2 or in the same triangle get different colors. The minimum in such an edge coloring is the injective edge chromatic number of , written as . We prove in this paper that for any graph with , if , if and if .