样式： 排序： IF:  GO 导出 标记为已读

Diameter of nanotori Appl. Math. Comput. (IF 4.0) Pub Date : 20230922
Vesna Andova, Pavel Dimovski, Martin Knor, Riste ŠkrekovskiA cubic graph which has only hexagonal faces, and can be embedded into a torus is known as generalized honeycomb torus or honeycomb toroidal graph, abbreviated as nanotorus. This graph is determined by three parameters a,b, and c, and denoted by Ga,b,c. B. Alpspach in 2010 dedicated a survey paper to nanotori, wherein a number of open problems are suggested. In this article we deal with one of the

Algorithms for enumerating multiple leafdistance granular regular αsubtree of unicyclic and edgedisjoint bicyclic graphs Appl. Math. Comput. (IF 4.0) Pub Date : 20230919
Long Li, Yu Yang, Zhihao Hui, BangBang Jin, Hua Wang, Asfand Fahad, Heng ZhangA multiple leafdistance granular regular αtree (abbreviated as LDR αtree for short) is a tree (with at least α+1 vertices) where any two leaves are at some distance divisible by α. A connected graph's subtree which is additionally an LDR αtree is known as an LDR αsubtree. Obviously, α=1 and 2, correspond to the general subtrees (excluding the single vertex subtrees) and the BCsubtrees (the distance

Kernel method for estimating overlapping coefficient using numerical integration methods Appl. Math. Comput. (IF 4.0) Pub Date : 20230919
Omar M. Eidous, Enas A. AnanbehIn this paper, we proposed three nonparametric kernel estimators for the overlapping Weitzman measure Δ. Due to the difficulty of finding a general expression for Δ when the nonparametric kernel method is adopted, we suggest using the numerical integration method as the first stage of our estimation process. In particular, three numerical integration rules are considered, which are known as, trapezoidal

Antidirected spanning closed trail in tournaments Appl. Math. Comput. (IF 4.0) Pub Date : 20230919
Hong Yang, Juan Liu, Jixiang MengLet D be a digraph with vertex set V(D) and arc set A(D). An antidirected spanning closed trail of D is a spanning closed trail in which consecutive arcs have opposite directions and each arc of D occurs at most once. If all vertices in this antidirected spanning closed trail are distinct, then the antidirected spanning closed trail is called an antidirected hamiltonian cycle. Grünbaum in 1971 conjectured

A local simplex spline basis for C3 quartic splines on arbitrary triangulations Appl. Math. Comput. (IF 4.0) Pub Date : 20230920
Tom Lyche, Carla Manni, Hendrik SpeleersWe deal with the problem of constructing, representing, and manipulating C3 quartic splines on a given arbitrary triangulation T, where every triangle of T is equipped with the quartic Wang–Shi macrostructure. The resulting C3 quartic spline space has a stable dimension and any function in the space can be locally built via Hermite interpolation on each of the macrotriangles separately, without any

A robust bitlevel image encryption based on Bessel map Appl. Math. Comput. (IF 4.0) Pub Date : 20230920
Abdurrahim Toktas, Uğur Erkan, Suo Gao, Chanil PakA chaotic map plays a critical role in image encryption (IME). The map used to generate chaotic sequences should perform high dynamic characteristics. In this study, a new chaotic system depending on the Bessel function, socalled Bessel map, and a novel Bessel mapbased IME scheme are proposed for the IME. The Bessel map has three control parameters, which provide superior ergodicity and diversity

Output feedback H∞ control for discrete time singularly perturbed systems with Markov lossy network: The roundrobinlike protocol case Appl. Math. Comput. (IF 4.0) Pub Date : 20230920
Yue Hu, OhMin Kwon, Chenxiao Cai, YeongJae KimIn this paper, the output feedback H∞ control is investigated for the networked singularly perturbed systems (SPSs) with Markov lossy network, in which the packet loss probability varies in different modes. A new network modedependent roundrobinlike protocol (RRLP) is introduced to the networked SPSs, which can dynamically adjust the number of the selected sensor nodes according to the network environment

Cooperative faulttolerant tracking control for multiagent systems: A multiple description encoding scheme Appl. Math. Comput. (IF 4.0) Pub Date : 20230920
Xi Wang, Yamei Ju, Derui Ding, Hongjian LiuIn this article, the cooperative faulttolerant tracking control (FTTC) is investigated for discretetime multiagent systems (MASs) with timevarying delays (TVDs) under multiple description encoding schemes (MDESs). First, a uniform channel model is proposed to describe the employed MDES subject to the effect of packet dropouts by introducing two independent random variables obeying the Bernoulli

Two fast and unconditionally stable finite difference methods for Riesz fractional diffusion equations with variable coefficients Appl. Math. Comput. (IF 4.0) Pub Date : 20230920
Xue Zhang, XianMing Gu, YongLiang Zhao, Hu Li, ChuanYun GuIn this paper, for variable coefficient Riesz fractional diffusion equations in one and two dimensions, we first design a secondorder implicit difference scheme by using the CrankNicolson method and a fractional centered difference formula for time and space variables, respectively. With the compact operator acting on, a novel fourthorder finite difference scheme is subsequently constructed. Solvability

Destabilization of a seasonal synchronization in a population model with a seasonally varying Allee effect Appl. Math. Comput. (IF 4.0) Pub Date : 20230920
Lenka Přibylová, Deeptajyoti Sen, Veronika EclerováClimate change causing large seasonal fluctuations is likely to lead to an increase in the average threshold of the Allee effect as well as an increase in its seasonal variability. In this paper, we show that a seasonally synchronized predatorprey system can be strongly destabilized by these changes in the threshold of the Allee effect. The typical result first leads to twoyear and multiyear cycles

Successful initial positioning of noncooperative individuals in cooperative populations effectively hinders cooperation prosperity Appl. Math. Comput. (IF 4.0) Pub Date : 20230914
Wei Chen, Jianwei Wang, Fengyuan Yu, Jialu He, Wenshu Xu, Wenhui DaiIdentifying the most influential individuals in structured populations is an important research topic throughout network science. Previous studies, whether identifying the initial cooperators in a network that can lead to the spread of cooperation or assessing the chances that an intrusive defector may lead to the collapse of cooperation, have assumed that all individual attributes are homogeneous

One or two frequencies? The Iterative Filtering answers Appl. Math. Comput. (IF 4.0) Pub Date : 20230913
Antonio Cicone, Stefano SerraCapizzano, Haomin ZhouThe Iterative Filtering method is a technique aimed at the decomposition of nonstationary and nonlinear signals into simple oscillatory components. This method, proposed a decade ago as an alternative technique to the Empirical Mode Decomposition, has been used extensively in many applied fields of research and studied, from a mathematical point of view, in several papers published in the last few

A weak Galerkin finite element method for nonlinear convectiondiffusion equation Appl. Math. Comput. (IF 4.0) Pub Date : 20230908
Wenjuan Li, Fuzheng Gao, Jintao CuiIn this paper, a weak Galerkin (WG) finite element method for onedimensional nonlinear convectiondiffusion equation with Dirichlet boundary condition is developed. Based on a special variational form featuring two builtin parameters, the semidiscrete and fully discrete WG finite element schemes are proposed. The backward Euler method is utilized for time discretization. The WG finite element method

The pathindex of a graph Appl. Math. Comput. (IF 4.0) Pub Date : 20230908
Leyou Xu, Bo ZhouFor a graph, its pathindex is the greatest eigenvalue of its pathmatrix, whose (x,y)entry for vertices x and y equals the connectivity of x and y if x≠y and 0 otherwise. Some upper and lower bounds are established on the pathindex over graphs with prescribed parameters, and those graphs that attain the bounds are also identified.

An efficient accurate scheme for solving the threedimensional Bratutype problem Appl. Math. Comput. (IF 4.0) Pub Date : 20230908
H. Temimi, M. BenRomdhane, M. BaccouchIn this manuscript, we present an innovative discretization algorithm designed to address the challenges posed by the threedimensional (3D) Bratu problem, a wellknown problem characterized by nonunique solutions. Our algorithm aims to achieve exceptional precision and accuracy in determining all potential solutions, as previous studies in the literature have only managed to produce limited accurate

A convolutional dispersion relation preserving scheme for the acoustic wave equation Appl. Math. Comput. (IF 4.0) Pub Date : 20230908
Oded Ovadia, Adar Kahana, Eli TurkelWe propose a numerical scheme for approximating the solution of the two dimensional acoustic wave problem. We use machine learning to find a stencil suitable even for high wavenumbers. The proposed scheme incorporates physics informed elements from the field of dispersionrelationpreserving (DRP) schemes into a convolutional optimization machine learning algorithm. We test the proposed method and

OnlineOffline HigherOrder Rumor Propagation Model Based on Quantum Cellular Automata Considering Social Adaptation Appl. Math. Comput. (IF 4.0) Pub Date : 20230909
Jipeng Tan, Man Zhang, Fengming LiuWith the development of the Internet, the influence of rumors is more widespread. Studying the propagation law of rumors is an effective way to reduce the damage of rumors. We therefore propose a new twolayer rumor propagation model, which simultaneously introduces simplicial complexes into the online and offline network layers and considers the social adaptation of individuals. We derive the basic

Coloring graphs without induced P5 or K5 − e Appl. Math. Comput. (IF 4.0) Pub Date : 20230907
Yian XuWe use P5 to denote a path of length 5 and C5 to denote a cycle of length 5. The aim of this paper is to prove that, if G is a connected graph satisfying (1). G has an induced C5 and no clique cutset, (2). G has no induced subgraph isomorphic to P5 or K5−e, then G is max{13,ω(G)+1}colorable.

Datadriven optimal output regulation for unknown linear discretetime systems based on parameterization approach Appl. Math. Comput. (IF 4.0) Pub Date : 20230903
Ganghui Zhai, Engang Tian, Yuqiang Luo, Dong LiangThe output regulation problem has been studied based on a parameterization approach. Different from existing literature, the proposed method does not rely on prior knowledge of the system dynamics. Instead, it leverages state and input data to address the absence of information regarding unmodeled dynamics. Firstly, the output regulation problem is transformed into a stabilization problem by using

A scheme for the game pLaplacian and its application to image inpainting Appl. Math. Comput. (IF 4.0) Pub Date : 20230903
Elisabetta Carlini, Silvia TozzaWe propose a new numerical scheme for the game pLaplacian, based on a semiLagrangian approximation. We focus on the 2D version of the game pLaplacian, with the aim to apply the new scheme in the context of image processing. Specifically, we want to solve the socalled inpainting problem, which consists in reconstructing one or more missing parts of an image using information taken from the known

Modeling and PassivityBased Control for a convertible fixedwing VTOL Appl. Math. Comput. (IF 4.0) Pub Date : 20230903
J.E. DuránDelfín, C.D. GarcíaBeltrán, M.E. GuerreroSánchez, G. ValenciaPalomo, O. HernándezGonzálezThis article presents a mathematical model and a controller for a convertible fixedwing Vertical TakeOff and Landing (VTOL). The mathematical model considers the aerodynamic forces generated by the motors. The developed PassivityBased Control (PBC) law stabilizes the rotational and translational dynamics of a convertible Unmanned Aerial Vehicle (UAV) in the transition stages of cruisestationary

Caputo−Wirtinger integral inequality and its application to stability analysis of fractionalorder systems with mixed timevarying delays Appl. Math. Comput. (IF 4.0) Pub Date : 20230831
Xujun Yang, Xiang Wu, Qiankun SongVarious techniques of integral inequality are widely used to establish the delaydependent conditions for the dynamics of differential systems so that the conservatism of conditions can be reduced. In the integerorder systems, the integral term of ∫τωp˙T(s)Sp˙(s)ds often appears in the derivative of Lyapunov−Krasovskii functional, and how to scale down this term to obtain less conservative condition

Optimistic valuebased optimal control problems with uncertain discretetime noncausal systems Appl. Math. Comput. (IF 4.0) Pub Date : 20230830
Xin Chen, Yifu Song, Yu Shao, Jian Wang, Liu He, Yuefen ChenUncertain discretetime noncausal systems are uncertain singular systems that are supposed to be regular along. This study examines optimal control problems (OCPs) using the optimistic value criterion in the context of uncertain discretetime noncausal systems. Recurrence equations for tackling these OCPs are provided in terms of uncertainty theory. These equations have effectively addressed OCPs involving

Novel stability criteria of generalized neural networks with timevarying delay based on the same augmented LKF and bounding technique Appl. Math. Comput. (IF 4.0) Pub Date : 20230830
Zhengliang Zhai, Huaicheng Yan, Shiming Chen, Yufang Chang, Jing ZhouThis paper researches the stability issue of generalized neural networks (GNN) with timevarying delay. For the delay, its derivative has an upper bound or is unknown. Firstly, the augmented LyapunovKrasovskii functional (LKF) is constructed based on the state vectors of the third order integral inequalities. Then, by introducing two sets of state vectors, the LKF derivative is presented as the quadratic

Heterogeneous optimal formation control of nonlinear multiagent systems with unknown dynamics by safe reinforcement learning Appl. Math. Comput. (IF 4.0) Pub Date : 20230830
Fatemeh Mahdavi Golmisheh, Saeed ShamaghdariThis article presents the problem of distributed training with a decentralized execution policy as a safe, optimal formation control for a heterogeneous nonlinear multiagent system. The control objective is to guarantee safety while achieving optimal performance. This objective is achieved by introducing novel distributed optimization problems with cost and local control barrier functions (CBFs).

A note on maximum size of a graph without isolated vertices under the given matching number Appl. Math. Comput. (IF 4.0) Pub Date : 20230828
Chao Shi, Tianlong MaIn this paper, we determine the maximum size of a graph of fixed order without isolated vertices which contains (fractional) matching of given size, which is a variation of some known results involving the maximum size of all graphs of fixed order containing matching of given size by Erdős and Gallai. As corollaries of our results, Turántype results for a connected graph on (fractional) matching are

Long time decay analysis of complexvalued fractional abstract evolution equations with delay Appl. Math. Comput. (IF 4.0) Pub Date : 20230824
Zichen Yao, Zhanwen Yang, Yongqiang FuThe asymptotic stability and long time decay rates of solutions to linear Caputo timefractional ordinary differential equations are known to be completely determined by the eigenvalues of the coefficient matrices. Very different from the exponential decay of solutions to classical ordinary differential equations, solutions of timefractional ordinary differential equations decay only polynomially

On singular value decomposition and generalized inverse of a commutative quaternion matrix and applications Appl. Math. Comput. (IF 4.0) Pub Date : 20230824
Dong Zhang, Tongsong Jiang, Gang Wang, V.I. Vasil'evBy means of a complex representation of a commutative quaternion matrix, the singular value decomposition and the generalized inverse problems of a commutative quaternion matrix are studied, and the corresponding theorems and algorithms are given. In addition, based on the singular value decomposition and generalized inverse of a commutative quaternion matrix, the numerical experiments for solving

Contagion dynamics on a compound model Appl. Math. Comput. (IF 4.0) Pub Date : 20230825
JinXuan Yang, ZhongPan Cao, Yikang LuIn the real world, a single homogeneous or heterogeneous network is very rare, so we consider a compound model which contains two different types of subnetworks. The compound model may be applied to analyze the contagion dynamics of two different communities where they have a probability to communicate. The global infection threshold is obtained, and many factors affecting spread of epidemics are analyzed

H∞ filter design for switched descriptor systems with different derivative term matrices Appl. Math. Comput. (IF 4.0) Pub Date : 20230824
Jiasheng Shi, Jun ZhaoThis paper takes into consideration the H∞ filtering problem based on L2gain analyses for switched descriptor systems. To start with, the state jumps that have been ignored for the existing results in the literature are precisely characterized for the filtering error system at the switching moments utilizing a modedependent coordinates transformation for the first time. Next, by utilizing multiple

The maxsum inverse median location problem on trees with budget constraint Appl. Math. Comput. (IF 4.0) Pub Date : 20230823
Huong NguyenThu, Kien Trung Nguyen, Nguyen Thanh ToanThe theory of inverse location involves modifying parameters in such a way that the total cost is minimized and one/several prespecified facilities become optimal based on these perturbed parameters. When the modifying parameters are grouped into sets, with each group's cost measured under the rectilinear norm and the overall cost measured under the Chebyshev norm, the resulting problem is known as

Tensor product approach to modelling epidemics on networks Appl. Math. Comput. (IF 4.0) Pub Date : 20230823
Sergey Dolgov, Dmitry SavostyanovTo improve mathematical models of epidemics it is essential to move beyond the traditional assumption of homogeneous well–mixed population and involve more precise information on the network of contacts and transport links by which a stochastic process of the epidemics spreads. In general, the number of states of the network grows exponentially with its size, and a master equation description suffers

C1smooth isogeometric spline functions of general degree over planar mixed meshes: The case of two quadratic mesh elements Appl. Math. Comput. (IF 4.0) Pub Date : 20230822
Jan Grošelj, Mario Kapl, Marjeta Knez, Thomas Takacs, Vito VitrihSplines over triangulations and splines over quadrangulations (tensor product splines) are two common ways to extend bivariate polynomials to splines. However, combination of both approaches leads to splines defined over mixed triangle and quadrilateral meshes using the isogeometric approach. Mixed meshes are especially useful for representing complicated geometries obtained e.g. from trimming. As

Analysis of two conservative fourthorder compact finite difference schemes for the KleinGordonZakharov system in the subsonic limit regime Appl. Math. Comput. (IF 4.0) Pub Date : 20230822
Jiyong Li, Lu ZhaoWe propose two conservative fourthorder compact finite difference (CFD4C) schemes and give the rigorous error analysis for the KleinGordonZakharov system (KGZS) with ε∈(0,1] being a small parameter. In the case 0<ε≪1, i.e., the subsonic limit regime, the solution of KGZS propagates waves with wavelength O(ε) in time and O(1) in space, respectively, with amplitude at O(εα†) with α†=min{α,β+1,2}

Packing 2 and 3stars into cubic graphs Appl. Math. Comput. (IF 4.0) Pub Date : 20230822
Wenying Xi, Wensong Lin, Yuquan LinLet i be a positive integer. A complete bipartite graph K1,i is called an istar, denoted by Si. An {S2,S3}packing of a graph G is a collection of vertexdisjoint subgraphs of G in which each subgraph is a 2star or a 3star. The maximum {S2,S3}packing problem is to find an {S2,S3}packing of a given graph containing the maximum number of vertices. The perfect {S2,S3}packing problem is to answer

G1 spline functions for point cloud fitting Appl. Math. Comput. (IF 4.0) Pub Date : 20230822
Michelangelo Marsala, Angelos Mantzaflaris, Bernard MourrainIn this work we present a new construction of basis functions that generate the space of geometrically smooth splines on an unstructured quadrilateral mesh. The basis is represented in terms of biquintic Bézier polynomials on each quadrilateral face. The gluing along the face boundaries is achieved using quadratic gluing data functions, leading to globally G1–smooth spaces. We analyze the latter space

Application of the social force modelling method to evacuation dynamics involving pedestrians with disabilities Appl. Math. Comput. (IF 4.0) Pub Date : 20230820
Libi Fu, Huigui Qin, Yangjian He, Yongqian ShiWith the development of urban architecture, the growing demand for larger public buildings is becoming challenging for indoor human evacuation under emergencies such as fires. However, the indoor fire evacuation behaviour of heterogeneous crowds when including individuals with disabilities have not been adequately explained. Therefore, this paper aims to study indoor evacuation characteristics of a

Eventbased distributed resilient control strategy for microgrids subject to disturbances and hybrid attacks Appl. Math. Comput. (IF 4.0) Pub Date : 20230819
Shuang Wu, Dan Ye, Xinfeng ShaoAs a typical class of CyberPhysical Systems (CPSs), microgrids (MGs) are susceptible to malicious cyber attacks and disturbances that can compromise their security and reliability. To address this issue, an eventtriggered distributed resilient control method is proposed in this paper to mitigate the impacts of disturbances, FDI and DoS attacks on MGs. The proposed approach employs a piecewise control

A numerical investigation of crack behavior near a fixed boundary using singular integral equation and finite element methods Appl. Math. Comput. (IF 4.0) Pub Date : 20230818
George A. Gazonas, Brian M. PowersIn this paper, we present the method of integral transforms and the GaussChebyshev quadrature methods to solve the problem of a crack parallel to a fixed boundary under remote tension. We derive a system of singular integral equations of the first kind, specific to the problem at hand, which we numerically solve using GaussChebyshev integration. We specialize our results to the problem of a crack

Geodesic packing in graphs Appl. Math. Comput. (IF 4.0) Pub Date : 20230817
Paul Manuel, Boštjan Brešar, Sandi KlavžarA geodesic packing of a graph G is a set of vertexdisjoint maximal geodesics. The maximum cardinality of a geodesic packing is the geodesic packing number gpack(G). It is proved that the decision version of the geodesic packing number is NPcomplete. We also consider the geodesic transversal number, gt(G), which is the minimum cardinality of a set of vertices that hit all maximal geodesics in G. While

Adaptive eventtriggered filtering for semiMarkov jump systems under communication constraints Appl. Math. Comput. (IF 4.0) Pub Date : 20230817
Qiyi Wang, Li Peng, Huarong Zhao, Shenhao YangThis paper investigates the problem of adaptive eventtriggered filtering for a class of semiMarkov jump systems. A more general scenario of semiMarkov jump systems under communication constraints is explored, where the output signal occurs with saturation nonlinearity, packet loss, and quantization. The saturation nonlinearity and packet dropout are described by two random variables subject to Bernoulli

A parallel PageRank algorithm for undirected graph Appl. Math. Comput. (IF 4.0) Pub Date : 20230816
Qi Zhang, Rongxia Tang, Zhengan Yao, ZanBo ZhangAs a measure of vertex importance according to the graph structure, PageRank has been widely applied in various fields. While many PageRank algorithms have been proposed in the past decades, few of them take into account whether the graph under investigation is directed or not. Thus, some important properties of undirected graph—symmetry on edges, for example—is ignored. In this paper, we propose a

Exponential stability of nonlinear systems via eventtriggered impulsive control based on partial states Appl. Math. Comput. (IF 4.0) Pub Date : 20230816
Mingyue Li, Mingzhu Wang, Wenlu Liu, Shuchen Wu, Xiaodi LiIn the framework of partial unknown states, this paper studies the exponential stability problem of nonlinear systems. A novel eventtriggered mechanism (ETM) just involving partial known states is designed to guarantee the exponential stability of considered system, where forced impulse with great freedom degree is introduced in ETM. What's more, the information of known states of the system is fetched

Error estimation of anisotropic interpolation for serendipity elements of arbitrary degree Appl. Math. Comput. (IF 4.0) Pub Date : 20230811
Jianjun Wan, Guozheng Dai, Shaochun Chen, Wen Dong, Shicang SongSerendipity elements are a class of simplified forms of the doublek element in 2D or the triplek element in 3D. The main advantage is that serendipity elements can maintain a proper order of convergence of the interpolation error under the condition of regularity, while reducing the number of inner freedoms. In practice, it is necessary to analyze their interpolation error on anisotropic meshes.

Strategic use of payoff information in khop evolutionary Bestshot networked public goods game Appl. Math. Comput. (IF 4.0) Pub Date : 20230808
Xing Jin, Yuchen Tao, Jingrui Wang, Chao Wang, Yongheng Wang, Zhouyang Zhang, Zhen WangGlobalization has led to increasingly interconnected interactions among individuals. Their payoffs are affected by the investment decision of themselves and their neighbors, which will cause conflicting interests between individual and social investment. Such problems can be modeled as a networked public goods game (NPGG). In this paper, we study the Bestshot NPGG model by introducing three mechanisms:

Accurate derivatives approximations and applications to some elliptic PDEs using HOC methods Appl. Math. Comput. (IF 4.0) Pub Date : 20230808
Jin Li, Zhilin Li, Kejia PanFor many application problems that are modeled by partial differential equations (PDEs), not only it is important to obtain accurate approximations to the solutions, but also accurate approximations to the derivatives of the solutions. In this study, some new high order compact (HOC) finite difference schemes are derived to approximate the first and second derivatives of the solution to some elliptic

Twoparameters formulas for general solution to planar weakly delayed linear discrete systems with multiple delays, equivalent nondelayed systems, and conditional stability Appl. Math. Comput. (IF 4.0) Pub Date : 20230807
Josef Diblík, Hana Halfarová, Jan ŠafaříkWeakly delayed planar linear discrete systems with multiple delaysx(k+1)=Dx(k)+∑l=1nHlx(k−ml),k=0,1,… are considered where m1,m2,…,mn are fixed integers, D, H1, …, Hn are nonzero 2×2 real constant matrices and x:{−mn,−mn+1,…}→R2. Formulas for general solutions are found and simplified, equivalent nondelayed planar linear discrete systems are constructed and conditional stability is analyzed. Results

A semiimplicit semiLagrangian method for simulating immersed boundary motion under high inertia and elasticity Appl. Math. Comput. (IF 4.0) Pub Date : 20230807
Sangbeom Park, Soyoon Bak, Philsu Kim, Yunchang SeolIn this paper, we present an efficient and stable fractionalstep 2D immersed boundary (IB) method for solving the interaction problems between bulk fluid and elastic interface, in particular, when the fluid inertia and the interfacial elasticity are the significant factors affecting its dynamics. In myriads of realworld applications, the effects of high inertia and elasticity are dominant. So the

Laplacian eigenvalues of the unit graph of the ring Zn Appl. Math. Comput. (IF 4.0) Pub Date : 20230807
Shouqiang Shen, Weijun Liu, Wei JinWe investigate the Laplacian eigenvalues about unit graph G(Zn) on Zn and show the case whenever n is an even number or an odd prime power, G(Zn) would be Laplacian integral. We also prove that if n>1, then the Laplacian spectral radius of G(Zn) is equal cardinal number of V(G(Zn)) if and only if n=pk, here p is a prime integer, k is an integer that positive. In addition, this paper also characterizes

AntiRamsey problems in the Mycielskian of a cycle Appl. Math. Comput. (IF 4.0) Pub Date : 20230807
Wenjie Hu, Yibo Li, Huiqing Liu, Xiaolan HuLet G and H be two graphs. The maximum integer k, for which there exists an edge coloring ϕ:E(G)→{1,2,…,k} that makes every copy of H has at least two edges with the same color, is the antiRamsey number of G with respect to H. Mycielski developed an interesting graph transformation that transforms G into the Mycielskian μ(G) of G. In this paper, we determine the antiRamsey number of μ(Cn) with respect

Further analysis of the statistical independence of the NIST SP 80022 randomness tests Appl. Math. Comput. (IF 4.0) Pub Date : 20230804
Elena Almaraz Luengo, Bittor Alaña Olivares, Luis Javier García Villalba, Julio HernandezCastroIn multiple applications, from Statistics to Particle Physics and notably in Cryptography and Computer Security, it is necessary to obtain long sequences of random numbers. In order to verify the properties of these sequences, different statistical tests are commonly applied, which are usually included in the socalled test batteries or test suites. The batteries need to be both effective and efficient

The disjoint path cover in the data center network HSDC with prescribed vertices in each path Appl. Math. Comput. (IF 4.0) Pub Date : 20230804
Yujia He, Shurong Zhang, Lin Chen, Weihua YangThe ndimensional HSDC with the logic graph Hn is one of the most attractive servercentric data center networks for high incremental scalability. The routing design in network topology is very important for information transmission. In particular, the application of disjoint path covers can solve various problems such as program code optimization and mapping parallel programs to parallel structures

Coloring the square of maximal planar graphs with diameter two Appl. Math. Comput. (IF 4.0) Pub Date : 20230803
Yiqiao Wang, Jingjing Huo, Jiangxu Kong, Qiuyue TanLet G be a maximal planar graph with diameter two and maximum degree Δ. Let χ(G2) denote the chromatic number of the square of G. In this paper, we prove that χ(G2)=Δ+1 if 2≤Δ≤3; χ(G2)≤6 if Δ=4; χ(G2)≤9 if Δ=5; χ(G2)≤Δ+5 if 6≤Δ≤7; and χ(G2)≤⌊3Δ/2⌋+1 if Δ≥8. All bounds are tight. This confirms the Wegner's conjecture for maximal planar graphs with diameter two.

A Markovian epidemic model in a resourcelimited environment Appl. Math. Comput. (IF 4.0) Pub Date : 20230802
A. GómezCorral, M.J. LopezHerrero, D. TaipeIn this paper, we present a Markov chain model to study infectious disease outbreaks assuming that healthcare facilities, specifically the number of hospital beds for infected individuals, are limited. Therefore, only a restricted number of infected individuals can be admitted to a hospital ward and receive medical care at the same time. Since the pathogen spreads both inside and outside the ward,

Gametheoretical approach for task allocation problems with constraints Appl. Math. Comput. (IF 4.0) Pub Date : 20230802
Chunxia Liu, Kaihong Lu, Xiaojie Chen, Attila SzolnokiThe distributed task allocation problem, as one of the most interesting distributed optimization challenges, has received considerable research attention recently. Previous works mainly focused on the task allocation problem in a population of individuals, where there are no constraints for affording task amounts. The latter condition, however, cannot always be hold. In this paper, we study the task

Graphical representation and hierarchical decomposition mechanism for vertexcover solution space Appl. Math. Comput. (IF 4.0) Pub Date : 20230802
Wei Wei, Xiangnan FengNP problems act essential roles in modelling and analysing various complex systems, and representation learning of system individuals and relations has faced the kernel difficulty in understanding the complexity and solving the NP problems. In this paper, solution space organisation of minimum vertexcover problem is deeply investigated using the famous KönigEgérvary (KE) graph and theorem, in which

Multiple description encodingdecodingbased resilient filtering for complex networks under the roundRobin protocol Appl. Math. Comput. (IF 4.0) Pub Date : 20230731
Xiaoyuan Zheng, Yu Kang, Hongyi Li, Jitao LiThe problem of distributed filtering for a class of discretetime nonlinear complex networks subject to the network bandwidth limitation is investigated. In order to reduce the network transmission burden, the roundrobin protocol is employed. Under which, a quantizationbased encodingdecoding mechanism is introduced to protect the security of measurements. Taking into account the quality of transmission

Hopfield model with planted patterns: A teacherstudent selfsupervised learning model Appl. Math. Comput. (IF 4.0) Pub Date : 20230731
Francesco Alemanno, Luca Camanzi, Gianluca Manzan, Daniele TantariWhile Hopfield networks are known as paradigmatic models for memory storage and retrieval, modern artificial intelligence systems mainly stand on the machine learning paradigm. We show that it is possible to formulate a teacherstudent selfsupervised learning problem with Boltzmann machines in terms of a suitable generalization of the Hopfield model with structured patterns, where the spin variables

Direct emotional interaction in prisoner's dilemma game Appl. Math. Comput. (IF 4.0) Pub Date : 20230729
Wen Lu, Shu LiangIn this paper, we develop a prisoner's dilemma game model with three types of strategies and six types of emotions. We propose a direct emotional interaction mechanism considering memory effect in which a player's favorability serves as an index of emotions and directly impacts payoffs and emotions. Our model enables that individuals gradually increase the tendency to loneliness or defection in the

Observerbased adaptive eventtriggered control method for inputsaturated systems Appl. Math. Comput. (IF 4.0) Pub Date : 20230731
Hassan Adloo, Mohammad Hossein ShafieiThis paper presents an adaptive eventtriggered control method for linear systems subject to input saturation. At the first, using convex hull properties, an observerbased controller is designed and then a generalized eventtriggering mechanism is regarded. In order to extend more time interval between any two successive events, an adaptive eventtriggered control method is also proposed. The proposed