Encouraging children towards the cognitive motivation through the discovery and knowledge of the environment around them is essential. Thus, during the two researchers’ supervision of the practical lessons that involved the female students’ application of their experience in the Applied Kindergarten Laboratory, it has been noticed that there was a difference in the cognitive motivation of kindergarten children. In order to reinforce the research problem, the two researchers sent an open questionnaire to a sample of randomly selected kindergarten teachers from Al-Karkh and Al-Rasafa sides. The responses collected accentuated the researchers’ sense of the existing problem. To achieve the aim of the study represented by examining the

Cognitive radio is observed as a new approach, which could be cope with the spectral limitations. This approach is designed to detect whether a particular segment of the radio spectrum is currently in use and to jump into the temporarily unused spectrum rapidly without interfering with the transmissions of other users. CR is the promising radio technology which aims to detect and utilize the temporally unused spectrum bands by sensing its radio environment in order to improve spectrum utilization. To enhance the sensing performance, cooperative spectrum sensing has been proposed. However, when the number of cognitive user tends to be very large, the bandwidth for reporting sensing results to the common receiver will be very huge. In this pa

The aim of this paper is to approximate multidimensional functions by using the type of Feedforward neural networks (FFNNs) which is called Greedy radial basis function neural networks (GRBFNNs). Also, we introduce a modification to the greedy algorithm which is used to train the greedy radial basis function neural networks. An error bound are introduced in Sobolev space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result is published in [16]).

    Identification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed

<p>Energy and memory limitations are considerable constraints of sensor nodes in wireless sensor networks (WSNs). The limited energy supplied to network nodes causes WSNs to face crucial functional limitations. Therefore, the problem of limited energy resource on sensor nodes can only be addressed by using them efficiently. In this research work, an energy-balancing routing scheme for in-network data aggregation is presented. This scheme is referred to as Energy-aware and load-Balancing Routing scheme for Data Aggregation (hereinafter referred to as EBR-DA). The EBRDA aims to provide an energy efficient multiple-hop routing to the destination on the basis of the quality of the links between the source and destination. In

High vehicular mobility causes frequent changes in the density of vehicles, discontinuity in inter-vehicle communication, and constraints for routing protocols in vehicular ad hoc networks (VANETs). The routing must avoid forwarding packets through segments with low network density and high scale of network disconnections that may result in packet loss, delays, and increased communication overhead in route recovery. Therefore, both traffic and segment status must be considered. This paper presents real-time intersection-based segment aware routing (RTISAR), an intersection-based segment aware algorithm for geographic routing in VANETs. This routing algorithm provides an optimal route for forwarding the data packets toward their destination