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

The CdS quantum dots were prepared by chemical reaction
of cadmium oleylamine (Cd –oleylamine complex) with the
sulfite-oleylamine (S-oleylamine) with 1:6 mole ratios. The
optical properties structure and spectroscopy of the product
quantum dot were studied. The results show the dependence of the
optical properties on the crystal dimension and the formation of
the trap states in the energy band gap.

Objective: To determine the effectiveness of a dietary educational program upon the hypertensive client’s
information.
Methodology: The sample of the study consists of (60) hypertensive clients who attended Al Anbar Health Office –Al
Andalus Health Center during the period of the study from the14th of March 2010 to the 30th of September 2010. The
sample is divided into two groups; study group (30) hypertensive clients who received dietary educational program
and control group (30) hypertensive clients who received a routine care from the center. Three major instruments
were used; these instruments included (1) knowledge test which was applied on both groups pretest and eight weeks
post-test (2) questions to know

Today’s modern medical imaging research faces the challenge of detecting brain tumor through Magnetic Resonance Images (MRI). Normally, to produce images of soft tissue of human body, MRI images are used by experts. It is used for analysis of human organs to replace surgery. For brain tumor detection, image segmentation is required. For this purpose, the brain is partitioned into two distinct regions. This is considered to be one of the most important but difficult part of the process of detecting brain tumor. Hence, it is highly necessary that segmentation of the MRI images must be done accurately before asking the computer to do the exact diagnosis. Earlier, a variety of algorithms were developed for segmentation of MRI images by usin

      Long memory analysis is one of the most active areas in econometrics and time series where various methods have been introduced to identify and estimate the long memory parameter in partially integrated time series. One of the most common models used to represent time series that have a long memory is the ARFIMA (Auto Regressive Fractional Integration Moving Average Model) which diffs are a fractional number called the fractional parameter. To analyze and determine the ARFIMA model, the fractal parameter must be estimated. There are many methods for fractional parameter estimation. In this research, the estimation methods were divided into indirect methods, where the Hurst parameter is estimated fir

KE Sharquie, AF Hameed, AA Noaimi, Indian Journal of Pathology and Microbiology, 2016 - Cited by 12

Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with  is the same for all . Here  is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i