Street networks are crucial in shaping the quality of urban life. Through their impact on mobility and social interaction, they play a critical role in shaping how people move around the city and determine the connectivity, accessibility, safety, and convenience of different areas. Thus, it is essential to develop a systematic understanding of street networks to create livable, sustainable, accessible, and equitable cities. The aim of this study is to analyze and develop the role of street networks in shaping urban mobility, connectivity, and accessibility, and thereby enhance sustainable urban living by creating people-centric cities. Quantitative techniques and measures are employed to examine urban structure metrics to understand

An energy and exergy thermodynamic analysis using EES program was done for a domestic refrigerator working with R-134a using vapor compression refrigeration cycle. The analysis deals with the system component, i.e. compressor, condenser, evaporator and the expansion device. The analysis depends on the entropy generation minimization approach to improve the refrigerator performance by exploring the optimum design points. These design points were derived from three different theories governing the entropy generation minimization using exergy analyzing method. These theories were first applied to find the optimum balance between the hot inner condenser area and the cold inner evaporator area of the refrigerator and between

Ziegler and Nichols proposed the well-known Ziegler-Nichols method to tune the coefficients of PID controller. This tuning method is simple and gives fixed values for the coefficients which make PID controller have weak adaptabilities for the model parameters variation and changing in operating conditions. In order to achieve adaptive controller, the Neural Network (NN) self-tuning PID control is proposed in this paper which combines conventional PID controller and Neural Network learning capabilities. The proportional, integral and derivative (K_P, K_I, K_D) gains are self tuned on-line by the NN output which is obtained due to the error value on the desired output of the system under control. The conventio

    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

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

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

In recent years, the field of research around the congestion problem of 4G and 5G networks has grown, especially those based on artificial intelligence (AI). Although 4G with LTE is seen as a mature technology, there is a continuous improvement in the infrastructure that led to the emergence of 5G networks. As a result of the large services provided in industries, Internet of Things (IoT) applications and smart cities, which have a large amount of exchanged data, a large number of connected devices per area, and high data rates, have brought their own problems and challenges, especially the problem of congestion. In this context, artificial intelligence (AI) models can be considered as one of the main techniques that can be used to solve ne

Traffic management at road intersections is a complex requirement that has been an important topic of research and discussion. Solutions have been primarily focused on using vehicular ad hoc networks (VANETs). Key issues in VANETs are high mobility, restriction of road setup, frequent topology variations, failed network links, and timely communication of data, which make the routing of packets to a particular destination problematic. To address these issues, a new dependable routing algorithm is proposed, which utilizes a wireless communication system between vehicles in urban vehicular networks. This routing is position-based, known as the maximum distance on-demand routing algorithm (MDORA). It aims to find an optimal route on a hop-by-ho