Application of the Extended G\u27/G-expansion Method to the Improved Eckhaus Equation

In this paper, the extended (G\u27/G)-expansion method is used to seek more general exact solutions of the improved Eckhaus equation and the (2+1)-dimensional improved Eckhaus equation. As a result, hyperbolic function solutions, trigonometric function solutions and rational function solutions with free parameters are obtained. When the parameters are taken as special values the solitary wave solutions are also derived from the traveling wave solutions. Moreover, it is shown that the proposed method is direct, effective and can be used for many other nonlinear evolution equations in mathematical physics

Characterizing Driving Context from Driver Behavior

Because of the increasing availability of spatiotemporal data, a variety of data-analytic applications have become possible. Characterizing driving context, where context may be thought of as a combination of location and time, is a new challenging application. An example of such a characterization is finding the correlation between driving behavior and traffic conditions. This contextual information enables analysts to validate observation-based hypotheses about the driving of an individual. In this paper, we present DriveContext, a novel framework to find the characteristics of a context, by extracting significant driving patterns (e.g., a slow-down), and then identifying the set of potential causes behind patterns (e.g., traffic congestion). Our experimental results confirm the feasibility of the framework in identifying meaningful driving patterns, with improvements in comparison with the state-of-the-art. We also demonstrate how the framework derives interesting characteristics for different contexts, through real-world examples.Comment: Accepted to be published at The 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM SIGSPATIAL 2017

Application of Reduced Differential Transform Method for Solving Two-dimensional Volterra Integral Equations of the Second Kind

In this paper, we propose new theorems of the reduced differential transform method (RDTM) for solving a class of two-dimensional linear and nonlinear Volterra integral equations (VIEs) of the second kind. The advantage of this method is its simplicity in using. It solves the equations straightforward and directly without using perturbation, Adomian’s polynomial, linearization or any other transformation and gives the solution as convergent power series with simply determinable components. Also, six examples and numerical results are provided so as to validate the reliability and efficiency of the method

Two Reliable Methods for Solving the Modified Improved Kadomtsev-Petviashvili Equation

In this paper, the tanh-coth method and the extended (G\u27/G)-expansion method are used to construct exact solutions of the nonlinear Modified Improved Kadomtsev-Petviashvili (MIKP) equation. These methods transform nonlinear partial differential equation to ordinary differential equation and can be applied to nonintegrable equation as well as integrable ones. It has been shown that the two methods are direct, effective and can be used for many other nonlinear evolution equations in mathematical physics

Exact Solutions of the Generalized Benjamin Equation and (3 + 1)- Dimensional Gkp Equation by the Extended Tanh Method

In this paper, the extended tanh method is used to construct exact solutions of the generalized Benjamin and (3 + 1)-dimensional gKP equation. This method is shown to be an efficient method for obtaining exact solutions of nonlinear partial differential equations. It can be applied to nonintegrable equations as well as to integrable ones

ON THE GRUNDY BONDAGE NUMBERS OF GRAPHS

For a graph $G=(V,E)$, a sequence $S=(v_1,\ldots,v_k)$ of distinct vertices of $G$ it is called a \emph{dominating sequence} if $N_G[v_i]\setminus \bigcup_{j=1}^{i-1}N[v_j]\neq\varnothing$. The maximum length of dominating sequences is denoted by $\gamma_{gr}(G)$. We define the Grundy bondage numbers $b_{gr}(G)$ of a graph $G$ to be the cardinality of a smallest set $E$ of edges for which $\gamma_{gr}(G-E)>\gamma_{gr}(G).$ In this paper the exact values of $b_{gr}(G)$ are determined for several classes of graphs