In this paper,we study a posteriori error estimates of the L1 scheme for time discretizations of time fractional parabolic differential equations,whose solutions have generally the initial *** derive optimal order a p...
详细信息
In this paper,we study a posteriori error estimates of the L1 scheme for time discretizations of time fractional parabolic differential equations,whose solutions have generally the initial *** derive optimal order a posteriori error estimates,the quadratic reconstruction for the L1 method and the necessary fractional integral reconstruction for the first-step integration are *** using these continuous,piecewise time reconstructions,the upper and lower error bounds depending only on the discretization parameters and the data of the problems are *** numerical experiments for the one-dimensional linear fractional parabolic equations with smooth or nonsmooth exact solution are used to verify and complement our theoretical results,with the convergence ofαorder for the nonsmooth case on a uniform *** recover the optimal convergence order 2-αon a nonuniform mesh,we further develop a time adaptive algorithm by means of barrier function recently *** numerical implementations are performed on nonsmooth case again and verify that the true error and a posteriori error can achieve the optimal convergence order in adaptive mesh.
Influence maximization,whose aim is to maximise the expected number of influenced nodes by selecting a seed set of k influential nodes from a social network,has many applications such as goods advertising and rumour *...
详细信息
Influence maximization,whose aim is to maximise the expected number of influenced nodes by selecting a seed set of k influential nodes from a social network,has many applications such as goods advertising and rumour *** the existing influence maximization methods,the community‐based ones can achieve a good balance between effectiveness and ***,this kind of algorithm usually utilise the network community structures by viewing each node as a non‐overlapping *** fact,many nodes in social networks are overlapping ones,which play more important role in influence *** this end,an overlapping community‐based particle swarm opti-mization algorithm named OCPSO for influence maximization in social networks,which can make full use of overlapping nodes,non‐overlapping nodes,and their interactive information is ***,an overlapping community detection algorithm is used to obtain the information of overlapping community structures,based on which three novel evolutionary strategies,such as initialisation,mutation,and local search are designed in OCPSO for better finding influential *** results in terms of influence spread and running time on nine real‐world social networks demonstrate that the proposed OCPSO is competitive and promising comparing to several state‐of‐the‐arts(***,CMA‐IM,CIM,CDH‐SHRINK,CNCG,and CFIN).
This paper aims to investigate the ability of reconfigurable intelligent surfaces (RIS) damaged in multi-user environments to eliminate interference. Our research found that even if the RIS is damaged, interference ca...
详细信息
The paper proposes a noise reduction algorithm based on symplectic Geometric Mode Decomposition (SGMD) and Savitzky-Golay (SG)filtering to address the issue of noise interference during signal transmission. Firstly, t...
详细信息
In this paper, a deep learning optimization method combining U-net model and cycle generative adversarial network (Cycle-GAN) is proposed to efficiently solve the electromagnetic inverse scattering (EMIS) problems. Fi...
详细信息
Due to the complexity of the underwater environment, underwater acoustic target recognition is more challenging than ordinary target recognition, and has become a hot topic in the field of underwater acoustics researc...
详细信息
The direction-of-arrival (DOA) estimation approach utilizing the adaptive nulling array framework has gained widespread attention due to its low complexity. However, in impulsive noise environments, traditional least ...
详细信息
Sum-difference driven coarray (SDCA) was paid great attention in array-signal-processing (ASP). By considering SDCA, the degrees of freedom (DOFs) for sparse arrays can be further improved. Here, a new transformed nes...
详细信息
A kernel Weibull M-transform maximum-versoria-criterion (KWMMVC) algorithm is constructed, which is to use for nonlinear system identification. The KWMMVC algorithm ingeniously integrates the Weibull M-transform schem...
详细信息
As the rapid development of wireless communication networks has resulted in better user experiences,the spectrum resources occupied and energy consumption have increased considerably and resulted in great *** address ...
详细信息
As the rapid development of wireless communication networks has resulted in better user experiences,the spectrum resources occupied and energy consumption have increased considerably and resulted in great *** address the energy consumption and cost problems of spectrum sharing in cognitive radio networks,a hybrid spectrum sharing model combining the free spectrum of authorized users and the leased spectrum of mobile network operators is *** on the hybrid model,a function of throughput and costs,including energy consumption and transaction costs,is constructed,and a joint utility optimization problem is *** transactions between secondary users and primary users are performed on the consortium blockchain on which users can directly trade spectrum and the transaction information is *** order to improve the joint utility,the Lagrange multiplier method is used to achieve the optimal solution for the sensing time,the number of secondary users involved in sensing,and the transmission *** simulation results show that the joint utility optimization algorithm proposed in this paper can achieve higher joint utility under the constraints of the minimum throughput requirement and maximum transmission power.
暂无评论