Path planning in autonomous robotic systems (ARS) is challenging, especially in dynamic or uncertain environments. Many classical methods are computationally expensive and lack adaptability to real-world scenarios. In order to improve the overall path-planning capabilities of robots; this paper introduces a new smart robotic navigation system which uses Software Defined Network (SDN) and Multi-Spike Elman Neural Network (MS-ENN). The introduced system includes an innovative way to encode temporal information using multiple spikes which can capture much greater amounts of detail about changing environmental characteristics than conventional artificial neural networks. Additionally, it includes a spiking wave-front planner (SWP) to pr

This present paper aim at knowing  the process of evaluating the training program that could be applied  in Maysan Health office  for it significance and importance in field of management and vocational staff  preparations  of high  scientific experience in different fields of  Health.  The society of research includes staffs  working in Maysan Health Office  , of specialists ,  dentists, pharmacists, laboratories, nursing  and administrators. Their number is 100 employees, the researcher has designed questionnaire by depending on "Kirkpatrick"  for assessing  the training . The researcher has used   thorough survey and has entailed 90 questionnaire,

Data centric techniques, like data aggregation via modified algorithm based on fuzzy clustering algorithm with voronoi diagram which is called modified Voronoi Fuzzy Clustering Algorithm (VFCA) is presented in this paper. In the modified algorithm, the sensed area divided into number of voronoi cells by applying voronoi diagram, these cells are clustered by a fuzzy C-means method (FCM) to reduce the transmission distance. Then an appropriate cluster head (CH) for each cluster is elected. Three parameters are used for this election process, the energy, distance between CH and its neighbor sensors and packet loss values. Furthermore, data aggregation is employed in each CH to reduce the amount of data transmission which le

The advancement of digital technology has increased the deployment of wireless sensor networks (WSNs) in our daily life. However, locating sensor nodes is a challenging task in WSNs. Sensing data without an accurate location is worthless, especially in critical applications. The pioneering technique in range-free localization schemes is a sequential Monte Carlo (SMC) method, which utilizes network connectivity to estimate sensor location without additional hardware. This study presents a comprehensive survey of state-of-the-art SMC localization schemes. We present the schemes as a thematic taxonomy of localization operation in SMC. Moreover, the critical characteristics of each existing scheme are analyzed to identify its advantages

    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