Seeds of five cultivars of oats (Avena sativa) were introduced from Italy in 2009. Seeds were propagated on the farm of the Dept. of Field Crops Sci. / Coll. of Agric. / Univ. of Baghdad in the season 2009 – 2010. The cultivars Anatolia, Alguda, Hamel, Pimula and Genzania were planted under 3 irrigation intervals; 3, 4 and 5 weeks to give water depth of 480, 400 and 320 mm, respectively . The depth of water was 80 mm each irrigation. A factorial experiment with RCBD of 4 replicates was conducted in 2 consecutive seasons in 2010 – 2011 and 2011 – 2012. The cultivar Alguda gave highest grain yield (8.07 t/ ha) under 480 mm, and 7.02 t / ha average of 3 water depths. This cultivar was characterized by high growth rate (13.2 g/m2/ d) that

To improve the efficiency of a processor in recent multiprocessor systems to deal with data, cache memories are used to access data instead of main memory which reduces the latency of delay time. In such systems, when installing different caches in different processors in shared memory architecture, the difficulties appear when there is a need to maintain consistency between the cache memories of different processors. So, cache coherency protocol is very important in such kinds of system. MSI, MESI, MOSI, MOESI, etc. are the famous protocols to solve cache coherency problem. We have proposed in this research integrating two states of MESI's cache coherence protocol which are Exclusive and Modified, which responds to a request from reading

Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith

The limitations of wireless sensor nodes are power, computational capabilities, and memory. This paper suggests a method to reduce the power consumption by a sensor node. This work is based on the analogy of the routing problem to distribute an electrical field in a physical media with a given density of charges. From this analogy a set of partial differential equations (Poisson's equation) is obtained. A finite difference method is utilized to solve this set numerically. Then a parallel implementation is presented. The parallel implementation is based on domain decomposition, where the original calculation domain is decomposed into several blocks, each of which given to a processing element. All nodes then execute computations in parall

Broadband satellite is playing a main role in provision global coverage and onboard processing ability over IP networks to assess user applications. In order to lower the cost, get better security, solve IPv4 addressing limitation, expand the expected advantages of modern routing and mobility characteristics; the next-generation satellite systems ought to support IPv6 and seamlessly incorporate with terrestrial networks including wireless local loops. Satellite communication links have a number of limitations compared to terrestrial communications networks such as large delay and high header overhead for IPv6 consumes the bandwidth and causes lower transmission effectiveness; however, the quality of service (QoS) (such as delay, jitter,

In this article, an inverse problem of finding timewise-dependent thermal conductivity has been investigated numerically. Numerical solution of forward (direct) problem has been solved by finite-difference method (FDM). Whilst, the inverse (indirect) problem solved iteratively using Lsqnonlin   routine  from MATLAB. Initial guess for unknown coefficient expressed by explicit relation   based on nonlocal overdetermination conditions and intial input data .The obtained numrical results are presented and discussed in several figures and tables. These results are accurate and stable even in the presense of noisy data.

Recurrent strokes can be devastating, often resulting in severe disability or death. However, nearly 90% of the causes of recurrent stroke are modifiable, which means recurrent strokes can be averted by controlling risk factors, which are mainly behavioral and metabolic in nature. Thus, it shows that from the previous works that recurrent stroke prediction model could help in minimizing the possibility of getting recurrent stroke. Previous works have shown promising results in predicting first-time stroke cases with machine learning approaches. However, there are limited works on recurrent stroke prediction using machine learning methods. Hence, this work is proposed to perform an empirical analysis and to investigate machine learning al

Mobile Ad hoc Networks (MANETs) is a wireless technology that plays an important role in several modern applications which include military, civil, health and real-time applications. Providing Quality of Service (QoS) for this application with network characterized by node mobility, infrastructure-less, limitation resource is a critical issue and takes greater attention. However, transport protocols effected influential on the performance of MANET application. This study provides an analysis and evaluation of the performance for TFRC, UDP and TCP transport protocols in MANET environment. In order to achieve high accuracy results, the three transport protocols are implemented and simulated with four different network topology which are 5, 10