in this paper, exp-function and (g′/g)expansion methods are presented to derive traveling wave solutions for a class of nonlinear space-time fractional differential equations. as a results, some new exact traveling wave solutions are obtained.

                                          ...

We prove that every finitely generated nilpotent group of class c admits a polynomial isoperimetric function of degree c+1 and a linear upper bound on its filling length function. 1991 Mathematics Subject Classification: 20F05, 20F32, 57M07

the theory of c-frames and c-bessel mappings are the generalizationsof the theory of frames and bessel sequences. in this paper, weobtain several equivalent conditions for dual of c-bessel mappings.we show that for a c-bessel mapping $f$, a retrievalformula with respect to a c-bessel mapping $g$ is satisfied if andonly if $g$ is sum of the canonical dual of $f$ with a c-besselmapping which  wea...

Category allows the abstraction of similar ideas into a single term for easy communication with another person. The similarities may be succinctly captured by a definition. In this paper, we are interested in the implementation of a program to acquire definitions, and use them to answer questions concerning these definitions. Several major components of a definition have been identified and imp...

aim : assessment of short term changes in portal blood flow and long term changes in liver functions in cirrhotic patients who chose to fast during the month of ramadan in summer. background : during ramadan, healthy muslims obligated to fast from predawn to sunset. patients and methods : forty cirrhotic patients intended to fast during the month of ramadan in the year 2014, were examined by co...

For a class C of binary linear codes, we write θC : (0, 1) → [0, 12 ] for the maximum-likelihood decoding threshold function of C, the function whose value at R ∈ (0, 1) is the largest bit-error rate p that codes in C can tolerate with a negligible probability of maximum-likelihood decoding error across a binary symmetric channel. We show that, if C is the class of cycle codes of graphs, then θ...