Discrete Krawtchouk polynomials are widely utilized in different fields for their remarkable characteristics, specifically, the localization property. Discrete orthogonal moments are utilized as a feature descriptor for images and video frames in computer vision applications. In this paper, we present a new method for computing discrete Krawtchouk polynomial coefficients swiftly and efficiently. The presented method proposes a new initial value that does not tend to be zero as the polynomial size increases. In addition, a combination of the existing recurrence relations is presented which are in the n- and x-directions. The utilized recurrence relations are developed to reduce the computational cost. The proposed method computes app

Based on analyzing the properties of Bernstein polynomials, the extended orthonormal Bernstein polynomials, defined on the interval [0, 1] for n=7 is achieved. Another method for computing operational matrices of derivative and integration D_b and R_(n+1)^B respectively is presented. Also the result of the proposed method is compared with true answers to show the convergence and advantages of the new method.

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

The efficiency evaluation of the railway lines performance is done through a set of indicators and criteria, the most important are transport density, the productivity of enrollee, passenger vehicle production, the productivity of freight wagon, and the productivity of locomotives. This study includes an attempt to calculate the most important of these indicators which transport density index from productivity during the four indicators, using artificial neural network technology. Two neural networks software are used in this study, (Simulnet) and (Neuframe), the results of second program has been adopted. Training results and test to the neural network data used in the study, which are obtained from the international in

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 study, synthesis of polymer Nanocomposites through the blending of prepared polymers with polyvinyl alcohol (a synthetic polymer) or chitosan (a natural polymer) then mixed with nano oxide silica by many steps. The new compound [I] was obtained via reaction of 3,3’-dimethoxybiphenyl-4,4’-diamine as starting material with malic anhydride in DMF then treatment with ammonium persulfate (NH4 )2 S2 O8 (as the initiator) in order to produce polymer [II]. Also, we prepared new polymers [III-V] by using the same starting material (3,3’-dimethoxybiphenyl-4,4’-diamine) with glutaric acid or adipic acid or isophthalic acid in DMF and pyridine. In this study, new polymer blending [VI-IX] and [X-XIII] were synthesized from a prepared pol

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