In this paper Volterra Runge-Kutta methods which include: method of order two and four will be applied to general nonlinear Volterra integral equations of the second kind. Moreover we study the convergent of the algorithms of Volterra Runge-Kutta methods. Finally, programs for each method are written in MATLAB language and a comparison between the two types has been made depending on the least square errors.

     In this paper, we introduce an approximate method for solving fractional order delay variational problems using fractional Euler polynomials operational matrices. For this purpose, the operational matrices of fractional integrals and derivatives are designed for Euler polynomials. Furthermore, the delay term in the considered functional is also decomposed in terms of the operational matrix of the fractional Euler polynomials. It is applied and substituted together with the other matrices of the fractional integral and derivative into the suggested functional. The main equations are then reduced to a system of algebraic equations. Therefore, the desired solution to the original variational problem is obtained by solving the resul

Many of the key stream generators which are used in practice are LFSR-based in the sense that they produce the key stream according to a rule y = C(L(x)), where L(x) denotes an internal linear bit stream, produced by small number of parallel linear feedback shift registers (LFSRs), and C denotes some nonlinear compression function. In this paper we combine between the output sequences from the linear feedback shift registers with the sequences out from non linear key generator to get the final very strong key sequence

At the last years, the interesting of measurement spicilists was increased to study differential item functioning (DIF) wich is reflect the difference of propability true response for test item from subgroups which have equal level of ability . The aims of this research are, inform the DIFat Namers’scale(2009) for mental health to prepare students and detect items that have DIF. Sample research contants (540) students, we use Mantel- Haenzel chi-square to detect DIF. The results are point to there are (26) items have DIF according to gender which are delated form the scale after that.

The quality of Global Navigation Satellite Systems (GNSS) networks are considerably influenced by the configuration of the observed baselines. Where, this study aims to find an optimal configuration for GNSS baselines in terms of the number and distribution  of baselines to improve the quality criteria of the GNSS networks. First order design problem (FOD) was applied in this research to optimize GNSS network baselines configuration, and based on sequential adjustment method to solve its objective functions.

FOD for optimum precision (FOD-p) was the proposed model which based on the design criteria of A-optimality and E-optimality. These design criteria were selected as objective functions of precision, whic

In this paper, a discretization of a three-dimensional fractional-order prey-predator model has been investigated with Holling type III functional response. All its fixed points are determined; also, their local stability is investigated. We extend the discretized system to an optimal control problem to get the optimal harvesting amount. For this, the discrete-time Pontryagin’s maximum principle is used. Finally, numerical simulation results are given to confirm the theoretical outputs as well as to solve the optimality problem.

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the

This paper aims at introducing a new generalized differential operator and new subclass of analytic functions to obtain some interesting properties like coefficient estimates and fractional derivatives.

   For a finite group G, the intersection graph   of G is the graph whose vertex set is the set of all proper non-trivial subgroups of G, where two distinct vertices are adjacent if their intersection is a non-trivial subgroup of G. In this article, we investigate the detour index, eccentric connectivity, and total eccentricity polynomials of the intersection graph  of subgroups of the dihedral group  for distinct primes . We also find the mean distance of the graph  .