in this paper, we introduce the notion of derivation on krasner hyperrings as follows: the function d : r  r isa derivation on a krasner hyperring r if for all , , ry x  ) ( ) ( = ) ( y d x d y x d   andd (x  y) d (x)  y  x  d ( y). then, we investigate some fundamental properties of derivation on krasnerhyperings and prime krasner hyperrings. also, we introduce differential krasner hy...

begin{abstract} If $F,D:Rto R$ are additive mappings which satisfy $F(x^{n}y^{n})=x^nF(y^{n})+y^nD(x^{n})$ for all $x,yin R$. Then, $F$ is a generalized left derivation with associated Jordan left derivation $D$ on $R$. Similar type of result has been done for the other identity forcing to generalized derivation and at last an example has given in support of the theorems. end{abstract}

We provide a rigorous derivation of a class of double-hybrid approximations, combining Hartree-Fock exchange and second-order Møller-Plesset correlation with a semilocal exchange-correlation density functional. These double-hybrid approximations contain only one empirical parameter and use a density-scaled correlation energy functional. Neglecting density scaling leads to a one-parameter versio...

using fixed pointmethods, we investigate approximately higher ternary jordan derivations in banach ternaty algebras via the cauchy functional equation$$f(lambda_{1}x+lambda_{2}y+lambda_3z)=lambda_1f(x)+lambda_2f(y)+lambda_3f(z)~.$$

The basic Schema Theorem for genetic algorithms is modiied for a grammatically-based learning system. A context-free grammar is used to deene a language in which each sentence is mapped to a tness value. The derivation trees associated with these sentences are used to deene the structure of schemata. The eeect of crossover and mutation on schemata is described. A schema theorem is developed whi...