This paper presents an improved gravitational search algorithm （IGSA） as a hybridization of a relatively recent evolutionary algorithm called gravitational search algorithm （GSA）, with the free search differential...This paper presents an improved gravitational search algorithm （IGSA） as a hybridization of a relatively recent evolutionary algorithm called gravitational search algorithm （GSA）, with the free search differential evolution （FSDE）. This combination incorporates FSDE into the optimization process of GSA with an attempt to avoid the premature convergence in GSA. This strategy makes full use of the exploration ability of GSA and the exploitation ability of FSDE. IGSA is tested on a suite of benchmark functions. The experimental results demonstrate the good performance of IGSA.展开更多
Let F be a field of characteristic not 2 and 3.Let f:Mmn(F)→Mmn(F)be an additive map preserving{1,2,T}-inverse,i.e.f(A)=f(A)f(B)Tf(A),f(B)=f(B)f(A)Tf(B)for any A,B C Mmn(F)with A=ABTA,B=BATB.In this paper,we give the...Let F be a field of characteristic not 2 and 3.Let f:Mmn(F)→Mmn(F)be an additive map preserving{1,2,T}-inverse,i.e.f(A)=f(A)f(B)Tf(A),f(B)=f(B)f(A)Tf(B)for any A,B C Mmn(F)with A=ABTA,B=BATB.In this paper,we give the sufficient and necessary condition for f to be such a map.展开更多
In this paper,we propose a parareal algorithm for stochastic differential equations(SDEs),which proceeds as a two-level temporal parallelizable integrator with the Milstein scheme as the coarse propagator and the exac...In this paper,we propose a parareal algorithm for stochastic differential equations(SDEs),which proceeds as a two-level temporal parallelizable integrator with the Milstein scheme as the coarse propagator and the exact solution as the fine propagator.The convergence order of the proposed algorithm is analyzed under some regular assumptions.Finally,numerical experiments are dedicated to illustrate the convergence and the convergence order with respect to the iteration number k,which show the efficiency of the proposed method.展开更多
From Bethe-Salpeter equation,we deduce the equation which describes the two-body system consisting of a scalar meson and a vector meson.This equation is applied to investigate the exotic narrow state X (3872) assumed ...From Bethe-Salpeter equation,we deduce the equation which describes the two-body system consisting of a scalar meson and a vector meson.This equation is applied to investigate the exotic narrow state X (3872) assumed as a molecule state composed of D 0 0.The contribution of the resonance 0 is the attractive interaction between two heavy mesons in this molecule state.The calculated mass of X is consistent with the experimental data.展开更多
Let Π = B1/B2/… /Bk be any set partition of[n]= {1,2,...,n} satisfying that entries are increasing in each block and blocks are arranged in increasing order of their first entries.Then Callan defined the flattened ...Let Π = B1/B2/… /Bk be any set partition of[n]= {1,2,...,n} satisfying that entries are increasing in each block and blocks are arranged in increasing order of their first entries.Then Callan defined the flattened Π to be the permutation of[n]obtained by erasing the divers between its blocks,and Callan also enumerated the number of set partitions of[n]whose flattening avoids a single3-letter pattern.Mansour posed the question of counting set partitions of[n]whose flattening avoids a pattern of length 4.In this paper,we present the number of set partitions of[n]whose flattening avoids one of the patterns：1234,1243,1324,1342,1423,1432,3142 and 4132.展开更多
基金supported by the National Natural Science Foundation of China (70871081)the Shanghai Leading Academic Discipline Project of China (S1205YLXK)
文摘This paper presents an improved gravitational search algorithm （IGSA） as a hybridization of a relatively recent evolutionary algorithm called gravitational search algorithm （GSA）, with the free search differential evolution （FSDE）. This combination incorporates FSDE into the optimization process of GSA with an attempt to avoid the premature convergence in GSA. This strategy makes full use of the exploration ability of GSA and the exploitation ability of FSDE. IGSA is tested on a suite of benchmark functions. The experimental results demonstrate the good performance of IGSA.
文摘Let F be a field of characteristic not 2 and 3.Let f:Mmn(F)→Mmn(F)be an additive map preserving{1,2,T}-inverse,i.e.f(A)=f(A)f(B)Tf(A),f(B)=f(B)f(A)Tf(B)for any A,B C Mmn(F)with A=ABTA,B=BATB.In this paper,we give the sufficient and necessary condition for f to be such a map.
基金We are very grateful to the reviewers for reading our paper carefully and providing many useful comments and suggestions.The first author is supported by NNSFC(Nos.11601514,11771444,11801556 and 11971458)The fourth author is supported by Beijing Nature Science Foundation(No.1152002)This work is also supported by NSF of Jiangsu Province of China(BK.20130779).
文摘In this paper,we propose a parareal algorithm for stochastic differential equations(SDEs),which proceeds as a two-level temporal parallelizable integrator with the Milstein scheme as the coarse propagator and the exact solution as the fine propagator.The convergence order of the proposed algorithm is analyzed under some regular assumptions.Finally,numerical experiments are dedicated to illustrate the convergence and the convergence order with respect to the iteration number k,which show the efficiency of the proposed method.
文摘From Bethe-Salpeter equation,we deduce the equation which describes the two-body system consisting of a scalar meson and a vector meson.This equation is applied to investigate the exotic narrow state X (3872) assumed as a molecule state composed of D 0 0.The contribution of the resonance 0 is the attractive interaction between two heavy mesons in this molecule state.The calculated mass of X is consistent with the experimental data.
文摘Let Π = B1/B2/… /Bk be any set partition of[n]= {1,2,...,n} satisfying that entries are increasing in each block and blocks are arranged in increasing order of their first entries.Then Callan defined the flattened Π to be the permutation of[n]obtained by erasing the divers between its blocks,and Callan also enumerated the number of set partitions of[n]whose flattening avoids a single3-letter pattern.Mansour posed the question of counting set partitions of[n]whose flattening avoids a pattern of length 4.In this paper,we present the number of set partitions of[n]whose flattening avoids one of the patterns：1234,1243,1324,1342,1423,1432,3142 and 4132.
