This study delves into the design optimization of a hydropower harvesting system, exploring various parameters and their influence on system performance. By modifying the variables within the model to suit different flow conditions, a judiciously optimized design is attainable. Notably, the lift force generated is found to be intricately linked to the strategic interplay of the bluff body's location, cylinder dimensions, and flow velocity. The findings culminate in the establishment of empirical equations, one for lift force and another for displacement, based on the force equation. Many energy harvesting approaches hinge on the reciprocating motion inherent to the structural system. The methodology developed in this study emerges as a pot

Abstract 

This paper presents mechanical and electrical design, and implementation  process of industrial robot, 3-DoF type SCARA (selective compliment assembly robot arm),with two rotations and one translation used for welding applications.The design process also included the controller design which was based on PLC(programmable logic controller) as well as selection of mechanical and electrical components.The challenge was to use the available components in Iraq with reasonable costs. The robot mentioned is fully automated using programmable logic controller PLC(Zelio type SR3-B261BD),with 16inputs and 10 outputs. The PLC was implemented in FBD logic to obtain three different automatic motions with hi

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

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

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