The use of Near-Surface Mounted (NSM) Carbon-Fiber-Reinforced Polymer (CFRP) strips is an efficient technology for increasing flexural and shear strength or for repairing damaged Reinforced Concrete (RC) members. This strengthening method is a promising technology. However, the thin layer of concrete covering the NSM-CFRP strips is not adequate to resist heat effect when directly exposed to a fire or at a high temperature. There is clear evidence that the strength and stiffness of CFRPs severely deteriorate at high temperatures. Therefore, in terms of fire resistance, the NSM technique has a significant defect. Thus, it is very important to develop a set of efficient fire protection systems to overcome these disadvantages. This pape

The fall angle of sun rays on the surface of a photovoltaic PV panel and its temperature is negatively affecting the panel electrical energy produced and efficiency. The fall angle problem was commonly solved by using a dual-axis solar tracker that continually maintains the panel orthogonally positioning to the sun rays all day long. This leads to maximum absorption for solar radiation necessary to produce maximum amount of energy and maintain high level of electrical efficiency. To solve the PV panel temperature problem, a Water-Flow Double Glazing WFDG technique has been introduced as a new cooling tool to reduce the panel temperature. In this paper, an integration design of the water glazing system with a dual-axis tracker has been ac

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