The specifications of lubricating oil are fundamentally the final product of materials that have been added for producing the desired properties. In this research, spherical nanoparticles copper oxide (CuO) and titanium oxides (TiO₂) are added to SAE 15W40 engine oil to study the thermal conductivity, stability, viscosity of nano-lubricants, which are prepared at different concentrations of 0.1%, 0.2%, 0.5%, and 1% by weight, and also their pour point, and flash point as five quality parameters. The obtained results show that CuO nanoparticles in all cases, give the best functionality and effect on engine oil with respect to TiO₂. With 0.1 wt. % concentration, the thermal conductivity of CuO/oil and TiO₂/

   There is a growing imperative to extract oil not only through primary and secondary means but also via tertiary recovery methods to meet the escalating global energy demands. Consequently, Enhanced Oil Recovery (EOR) is slated to increase significance in the oil industry in the coming years. The amalgamation of low salinity water (LSW) with chemicals to augment oil recovery has gained substantial traction in recent years owing to its demonstrated effectiveness. In this study, a systematic investigation utilizing contact angle measurements to elucidate the underlying mechanisms was undertaken. The results reveal that the contact angle (CA) demonstrated the effectiveness of the combined fluid in altering the wettability from oil-

In this paper, a modified derivation has been introduced to analyze the construction of C-space. The profit from using C-space is to make the process of path planning more safety and easer. After getting the C-space construction and map for two-link planar robot arm, which include all the possible situations of collision between robot parts and obstacle(s), the A* algorithm, which is usually used to find a heuristic path on Cartesian W-space, has been used to find a heuristic path on C-space map. Several modifications are needed to apply the methodology for a manipulator with degrees of freedom more than two. The results of C-space map, which are derived by the modified analysis, prove the accuracy of the overall C-space mapping and cons

In the past two decades, maritime transport traffic has increased, especially in the case of container flow. The BAP (Berth Allocation Problem) (BAP) is a main problem to optimize the port terminals. The current manuscript explains the DBAP problems in a typical arrangement that varies from the conventional separate design station, where each berth can simultaneously accommodate several ships when their entire length is less or equal to length. Be a pier, serve. This problem was then solved by crossing the Red Colobuses Monkey Optimization (RCM) with the Genetic Algorithm (GA). In conclusion, the comparison and the computational experiments are approached to demonstrate the effectiveness of the proposed method contrasted with other

Tchebichef polynomials (TPs) play a crucial role in various fields of mathematics and applied sciences, including numerical analysis, image and signal processing, and computer vision. This is due to the unique properties of the TPs and their remarkable performance. Nowadays, the demand for high-quality images (2D signals) is increasing and is expected to continue growing. The processing of these signals requires the generation of accurate and fast polynomials. The existing algorithms generate the TPs sequentially, and this is considered as computationally costly for high-order and larger-sized polynomials. To this end, we present a new efficient solution to overcome the limitation of sequential algorithms. The presented algorithm us

In networking communication systems like vehicular ad hoc networks, the high vehicular mobility leads to rapid shifts in vehicle densities, incoherence in inter-vehicle communications, and challenges for routing algorithms. It is necessary that the routing algorithm avoids transmitting the pockets via segments where the network density is low and the scale of network disconnections is high as this could lead to packet loss, interruptions and increased communication overhead in route recovery. Hence, attention needs to be paid to both segment status and traffic. The aim of this paper is to present an intersection-based segment aware algorithm for geographic routing in vehicular ad hoc networks. This algorithm makes available the best route f