In this paper, the oscillatory and nonoscillatory qualities for every solution of fourth-order neutral delay equation are discussed. Some conditions are established to ensure that all solutions are either oscillatory or approach to zero as .  Two examples are provided to demonstrate the obtained findings.

     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.

In this paper, a sufficient condition for stability of a system of nonlinear multi-fractional order differential equations on a finite time interval with an illustrative example, has been presented to demonstrate our result. Also, an idea to extend our result on such system on an infinite time interval is suggested.

Orthogonal polynomials and their moments have significant role in image processing and computer vision field. One of the polynomials is discrete Hahn polynomials (DHaPs), which are used for compression, and feature extraction. However, when the moment order becomes high, they suffer from numerical instability. This paper proposes a fast approach for computing the high orders DHaPs. This work takes advantage of the multithread for the calculation of Hahn polynomials coefficients. To take advantage of the available processing capabilities, independent calculations are divided among threads. The research provides a distribution method to achieve a more balanced processing burden among the threads. The proposed methods are tested for va

The main objective of this paper is to designed algorithms and implemented in the construction of the main program designated for the determination the tenser product of representation for the special linear group.

As of late, humankind has experienced radiation issues either computerized tomography (CT) or X-rays. In this investigation, we endeavor to limit the effect of examination hardware. To do this the medical image is cropping (cut and zoom) then represented the vascular network as a graph such that each contraction as the vertices and the vessel represented as an edges, the area of the coagulation was processed already, in the current search the shortest distance to reach to the place of the blood vessel clot is computed