A non-polynomial spline (NPS) is an approximation method that relies on the triangular and polynomial parts, so the method has infinite derivatives of the triangular part of the NPS to compensate for the loss of smoothness inherited by the polynomial. In this paper, we propose polynomial-free linear and quadratic spline types to solve fuzzy Volterra integral equations (FVIE) of the 2nd kind with the weakly singular kernel (FVIEWSK) and Abel's type kernel. The linear type algorithm gives four parameters to form a linear spline. In comparison, the quadratic type algorithm gives five parameters to create a quadratic spline, which is more of a credit for the exact solution. These algorithms process kernel singularities with a simple techniqu

Volterra – Fredholm integral equations (VFIEs) have a massive interest from researchers recently. The current study suggests a collocation method for the mixed Volterra - Fredholm integral equations (MVFIEs)."A point interpolation collocation method is considered by combining the radial and polynomial basis functions using collocation points". The main purpose of the radial and polynomial basis functions is to overcome the singularity that could associate with the collocation methods. The obtained interpolation function passes through all Scattered Point in a domain and therefore, the Delta function property is the shape of the functions. The exact solution of selective solutions was compared with the results obtained

This paper presents a numerical solution to the inverse problem consisting of recovering time-dependent thermal conductivity and  heat source coefficients  in the one-dimensional  parabolic heat equation.   This  mathematical  formulation  ensures that the inverse problem  has a unique  solution.   However, the problem  is still  ill-posed since small errors  in the input data lead to a drastic  amount  of errors in the output coefficients.  The  finite  difference method  with  the Crank-Nicolson  scheme is adopted  as a direct  solver of the problem in a fixed domain.   The inverse problem is solved sub

     This paper investigates the simultaneous recovery for two time-dependent coefficients for heat equation under Neumann boundary condition. This problem is considered under extra conditions of nonlocal type. The main issue with this problem is the solution unstable to small contamination of noise in the input data. The Crank-Nicolson finite difference method is utilized to solve the direct problem whilst the inverse problem is viewed as nonlinear optimization problem. The later problem is solved numerically using optimization toolbox from MATLAB. We found that the numerical results are accurate and stable.

In this work, we give an identity that leads to establishing the operator . Also, we introduce the polynomials . In addition, we provide Operator proof for the generating function with its extension and the Rogers formula for . The generating function with its extension and the Rogers formula for the bivariate Rogers-Szegö polynomials  are deduced. The Rogers formula for  allows to obtain the inverse linearization formula for , which allows to deduce the inverse linearization formula for . A solution to a q-difference equation is introduced and the solution is expressed in terms of the operators . The q-difference method is used to recover an identity of the operator  and the generating function for the polynomials

In this paper, we illustrate how to use the generalized homogeneous -shift operator  in generalizing various well-known q-identities, such as Hiene's transformation, the q-Gauss sum, and Jackson's transfor- mation. For the polynomials , we provide another formula for the generating function, the Rogers formula, and the bilinear generating function of the Srivastava-Agarwal type. In addition, we also generalize the extension of both the Askey-Wilson integral and the Andrews-Askey integral.

      Detecting protein complexes in protein-protein interaction (PPI) networks is a challenging problem in computational biology. To uncover a PPI network into a complex structure, different meta-heuristic algorithms have been proposed in the literature. Unfortunately, many of such methods, including evolutionary algorithms (EAs), are based solely on the topological information of the network rather than on biological information. Despite the effectiveness of EAs over heuristic methods, more inherent biological properties of proteins are rarely investigated and exploited in these approaches. In this paper, we proposed an EA with a new mutation operator for complex detection problems. The proposed mutation operator is formulated und

      Detecting protein complexes in protein-protein interaction (PPI) networks is a challenging problem in computational biology. To uncover a PPI network into a complex structure, different meta-heuristic algorithms have been proposed in the literature. Unfortunately, many of such methods, including evolutionary algorithms (EAs), are based solely on the topological information of the network rather than on biological information. Despite the effectiveness of EAs over heuristic methods, more inherent biological properties of proteins are rarely investigated and exploited in these approaches. In this paper, we proposed an EA with a new mutation operator for complex detection problems. The proposed mutation operator is formulate