In this research, we use fuzzy nonparametric methods based on some smoothing techniques, were applied to real data on the Iraqi stock market especially the data about Baghdad company for soft drinks for the year (2016) for the period (1/1/2016-31/12/2016) .A sample of (148) observations was obtained in order to construct a model of the relationship between the stock prices (Low, high, modal) and the traded value by comparing the results of the criterion (G.O.F.) for three techniques , we note that the lowest value for this criterion was for the K-Nearest Neighbor at Gaussian function .

This study was done to test the activity of some plant extracts as antioxidant agents. The plants were (Morus rubra, Hibiscus sabdariffa L ., Rhus coriaria L., Anethum graveolens and Petroselinum sativum).
Ethanolic 98% (24 hours/ 25˚c) and distilled water (30 minutes/ 25˚c have been used for extraction.The Total phenols, total flavonoids, total anthocyanin, antioxidant activities were studied.
The extract of Morus rubra was chosen because it has a higher antioxidant activity.
The phenolic extract of Morus rubra was prepare and examined by application it in burger . The antioxidant activity test of Morus rubra was made before and after 3,6 days of cold storage. The sensory evaluation of all treatments were done within 5,1

Some responses to ancient grammarians
And contemporary researchers
In monograms

This paper describes a number of new interleaving strategies based on the golden section. The new interleavers are called golden relative prime interleavers, golden interleavers, and dithered golden interleavers. The latter two approaches involve sorting a real-valued vector derived from the golden section. Random and so-called “spread” interleavers are also considered. Turbo-code performance results are presented and compared for the various interleaving strategies. Of the interleavers considered, the dithered golden interleaver typically provides the best performance, especially for low code rates and large block sizes. The golden relative prime interleaver is shown to work surprisingly well for high puncture rates. These interleav

"In this article, "we introduce the concept of a WE-Prime submodule", as a stronger form of a weakly prime submodule". "And as a "generalization of WE-Prime submodule", we introduce the concept of WE-Semi-Prime submodule, which is also a stronger form of a weakly semi-prime submodule". "Various basic properties of these two concepts are discussed. Furthermore, the relationships between "WE-Prime submodules and weakly prime submodules" and studied". "On the other hand the relation between "WE-Prime submodules and WE-Semi-Prime submodules" are consider". "Also" the relation of "WE-Sime-Prime submodules and weakly semi-prime submodules" are explained. Behind that, some characterizations of these concepts are investigated".

The purpose of this paper is to study a new types of compactness in the dual bitopological spaces. We shall introduce the concepts of L-pre- compactness and L-semi-P- compactness .

The primary purpose of this paper is to introduce the, 2- coprobabilistic normed space, coprobabilistic dual space of 2- coprobabilistic normed space and give some facts that are related of them

Our scientists Arabs old efforts in achieving texts that led to the foundations of general
rules they have set for this work in accordance with the systematic context is based on the
study, analysis and precision in dealing with this work, which became the basis for each
investigator to the present day, which was to them careful consideration manuscripts and
work to be closer to the image by its author, so produced their efforts in this area several
books provided the technical wizards of this science, which did not leave a gap in which only
gave her treatments and suggestions each and every one of the point made by and gave her
what produced the expertise in this direction in accordance with the formulations
meth

Czerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if  for every pair of adjacent vertices u and v in G where . A graph G may admit any number of lucky labelings. The least integer k for which a graph G has a lucky labeling from the set 1, 2, k is the lucky number of G denoted by η(G). This paper aims to determine the lucky number of Complete graph K_n, Complete bipartite graph K_m,n and Complete tripartite graph K_l,m,n. It has also been studied how the lucky number changes whi