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.

     This work, aims to study and examine the description f the gradient reduced order-strategic sensors of type boundary exponential (-strategic sensors) for completion gradient  order-detectability of type boundary exponential (-detectability). Thus, this concept is linked to an estimator in distributed parameter systems (DPS_S) in Neumann problem. So,we present numerous consequences regarding to diverse kinds of information, region  and conditions of boundary region to allow existence of -detectable systems. In addition,we have estimated at the junction interface that the interior solution isharmonizedwith the exterior solution for -detectable and, we give the relationship between this concept and sensors structures. F

In this study, a fast block matching search algorithm based on blocks' descriptors and multilevel blocks filtering is introduced. The used descriptors are the mean and a set of centralized low order moments. Hierarchal filtering and MAE similarity measure were adopted to nominate the best similar blocks lay within the pool of neighbor blocks. As next step to blocks nomination the similarity of the mean and moments is used to classify the nominated blocks and put them in one of three sub-pools, each one represents certain nomination priority level (i.e., most, less & least level). The main reason of the introducing nomination and classification steps is a significant reduction in the number of matching instances of the pixels belong to the c

<span>Digital audio is required to transmit large sizes of audio information through the most common communication systems; in turn this leads to more challenges in both storage and archieving. In this paper, an efficient audio compressive scheme is proposed, it depends on combined transform coding scheme; it is consist of i) bi-orthogonal (tab 9/7) wavelet transform to decompose the audio signal into low &amp; multi high sub-bands, ii) then the produced sub-bands passed through DCT to de-correlate the signal, iii) the product of the combined transform stage is passed through progressive hierarchical quantization, then traditional run-length encoding (RLE), iv) and finally LZW coding to generate the output mate bitstream.

  The aim of this paper is to prove a theorem on the Riesz means of expansions with respect to Riesz bases, which extends the previous results of [1] and [2] on the Schrödinger operator and the ordinary differential operator of 4-th order to the operator of order 2m by using the eigen functions of the ordinary differential operator. Some Symbols that used in the paper:     the uniform norm. <,>   the inner product in L2. G   the set of all boundary elements of G. ˆ u   the dual function of u.

The aim of this paper is prove a theorem on the Riesz mean of expansions with respect to Riesz bases, which extends the previous results of Loi and Tahir on the Schrodinger operator to the operator of 4-th order.

In this paper, the dynamical behavior of a three-dimensional fractional-order prey-predator model is investigated with Holling type III functional response and constant rate harvesting. It is assumed that the middle predator species consumes only the prey species, and the top predator species consumes only the middle predator species. We also prove the boundedness, the non-negativity, the uniqueness, and the existence of the solutions of the proposed model. Then, all possible equilibria are determined, and the dynamical behaviors of the proposed model around the equilibrium points are investigated. Finally, numerical simulations results are presented to confirm the theoretical results and to give a better understanding of the dynami

   The research tackled to solve Sudoku grid problem 9 ×9 , one of artificial intelligence problems. This problem has many of solutions in search space to generate Sudoku grid by using magic square of odd order as 3. This research concludes solution by proposed heuristic algorithm from magic square of odd order as 3 and no given numbers (from 1 to 9) in each cell of nine Sudoku grid cells in starting of problem solution, this is not similar the solution in old classic methods to generate all sub grids in Sudoku grid. The experimental results in this paper show the easily implementation to solve the problem to manage without manual method, additional to position of numbers (1, 2,..9) in center of each sub grid in Sudoku grid