This paper presents an analysis solution for systems of partial differential equations using a new modification of the decomposition method to overcome the computational difficulties. Convergence of series solution was discussed with two illustrated examples, and the method showed a high-precision, being a fast approach to solve the non-linear system of PDEs with initial conditions. There is no need to convert the nonlinear terms into the linear ones due to the Adomian polynomials. The method does not require any discretization or assumption for a small parameter to be present in the problem. The steps of the suggested method are easily implemented, with high accuracy and rapid convergence to the exact solution,

In this paper we present a new method for solving fully fuzzy multi-objective linear programming problems and find the fuzzy optimal solution of it. Numerical examples are provided to illustrate the method.

This paper deals with testing a numerical solution for the discrete classical optimal control problem governed by a linear hyperbolic boundary value problem with variable coefficients. When the discrete classical control is fixed, the proof of the existence and uniqueness theorem for the discrete solution of the discrete weak form is achieved. The existence theorem for the discrete classical optimal control and the necessary conditions for optimality of the problem are proved under suitable assumptions. The discrete classical optimal control problem (DCOCP) is solved by using the mixed Galerkin finite element method to find the solution of the discrete weak form (discrete state). Also, it is used to find the solution for the discrete adj

This paper focuses on developing a self-starting numerical approach that can be used for direct integration of higher-order initial value problems of Ordinary Differential Equations. The method is derived from power series approximation with the resulting equations discretized at the selected grid and off-grid points. The method is applied in a block-by-block approach as a numerical integrator of higher-order initial value problems. The basic properties of the block method are investigated to authenticate its performance and then implemented with some tested experiments to validate the accuracy and convergence of the method.

In aspect-based sentiment analysis ABSA, implicit aspects extraction is a fine-grained task aim for extracting the hidden aspect in the in-context meaning of the online reviews. Previous methods have shown that handcrafted rules interpolated in neural network architecture are a promising method for this task. In this work, we reduced the needs for the crafted rules that wastefully must be articulated for the new training domains or text data, instead proposing a new architecture relied on the multi-label neural learning. The key idea is to attain the semantic regularities of the explicit and implicit aspects using vectors of word embeddings and interpolate that as a front layer in the Bidirectional Long Short-Term Memory Bi-LSTM. First, we

For a nonempty subset X of a group G and a positive integer m , the product of X , denoted by Xm ,is the set Xm = That is , Xm is the subset of G formed by considering all possible ordered products of m elements form X. In the symmetric group Sn, the class Cn (n odd positive integer) split into two conjugacy classes in An denoted Cn+ and Cn- . C+ and C- were used for these two parts of Cn. This work we prove that for some odd n ,the class C of 5- cycle in Sn has the property that = An n 7 and C+ has the property that each element of C+ is conjugate to its inverse, the square of each element of it is the element of C-, these results were used to prove that C+ C- = An exceptio