in this paper the second order neutral differential equations are incestigated are were we give some new suffucient conditions for all nonoscillatory

            In this paper, the Normality set  will be investigated. Then, the study highlights some concepts properties and important results. In addition, it will prove that every operator with normality set has non trivial invariant subspace of  .

Recalcitrant adventitious root (AR) development is a major hurdle in propagating commercially important woody plants. Although significant progress has been made to identify genes involved in subsequent steps of AR development, the molecular basis of differences in apparent recalcitrance to form AR between easy-to-root and difficult-to-root genotypes remains unknown. To address this, we generated cambium tissue-specific transcriptomic data from stem cuttings of hybrid aspen, T89 (difficult-to-root) and hybrid poplar OP42 (easy-to-root), and used transgenic approaches to verify the role of several transcription factors in the control of adventitious rooting. Increased peroxidase activity was positively correlated with better rooting. We foun

Among the available chaotic modulation schemes, differential chaos shift keying (DSCK) offers the perfect noise performance. The power consumption of DCSK is high since it sends chaotic signal in both of 1 and 0 transmission, so it does not represent the optimal choice for some applications like indoor wireless sensing where power consumption is a critical issue. In this paper a novel noncoherent chaotic communication scheme called differential chaos on-off keying (DCOOK) is proposed as a solution of this problem. With the proposed scheme, the DCOOK signal have a structure similar to chaos on-off keying (COOK) scheme with improved performance in noisy and multipath channels by introducing the concept of differential coherency used in DCS

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