In this work, electrodialysis (ED) has been demonstrated to be appropriate technique for reducing the electrical conductivity of real wastewater from fuel washing unit, which has been previously treated by other electrochemical technology (electrocoagulation and electrooxidation).  A five cell electrodialysis stack, with an active membrane area of 60 cm² per cell was employed. During a batch recirculation mode ED system, the effects of parameters such as electrical potential applied (6-18 V) and flow rate of streams (0.5-1.7 L/min.) on the performance of the total dissolved solids (TDS) separation and specific power consumption (SPC) were studied. The results indicate that the process of ED under potential (15 V) and flow

This study reported the investigation of the Radio Frequency (RF) signal propagation of Global System for Mobile Communications (GSM) coverage in Emmanuel Alayande College of Education (EACOED), Oyo, Oyo State, Nigeria. The study aims at amplifying the quality of service and augment end users' sensitivity of the wireless services operation. The drive test method is adopted with estimation of coverage level and received signal strength. The Network Cell Info Lite application installed in three INFINIX GSM mobile phones was employed to take the measurement of the signal strength received from the transmitting stations of different mobile networks. The results of the study revealed that MTN has the maximum signal strength with a mean value

     By definition, the detection of protein complexes that form protein-protein interaction networks (PPINs) is an NP-hard problem. Evolutionary algorithms (EAs), as global search methods, are proven in the literature to be more successful than greedy methods in detecting protein complexes. However, the design of most of these EA-based approaches relies on the topological information of the proteins in the PPIN. Biological information, as a key resource for molecular profiles, on the other hand, acquired a little interest in the design of the components in these EA-based methods. The main aim of this paper is to redesign two operators in the EA based on the functional domain rather than the graph topological domain. The perturb

Text Clustering consists of grouping objects of similar categories. The initial centroids influence operation of the system with the potential to become trapped in local optima. The second issue pertains to the impact of a huge number of features on the determination of optimal initial centroids. The problem of dimensionality may be reduced by feature selection. Therefore, Wind Driven Optimization (WDO) was employed as Feature Selection to reduce the unimportant words from the text. In addition, the current study has integrated a novel clustering optimization technique called the WDO (Wasp Swarm Optimization) to effectively determine the most suitable initial centroids. The result showed the new meta-heuristic which is WDO was employed as t

Precision is one of the main elements that control the quality of a geodetic network, which defines as the measure of the network efficiency in propagation of random errors. This research aims to solve ZOD and FOD problems for a geodetic network using Rosenbrock Method to optimize the geodetic networks by using MATLAB programming language, to find the optimal design of geodetic network with high precision. ZOD problem was applied to a case study network consists of 19 points and 58 designed distances with a priori deviation equal to 5mm, to determine the best points in the network to consider as control points. The results showed that P55 and P73 having the minimum ellipse of error and considered as control points. FOD problem was applie

Chemical compounds, characteristics, and molecular structures are inevitably connected. Topological indices are numerical values connected with chemical molecular graphs that contribute to understanding a chemical compounds physical qualities, chemical reactivity, and biological activity. In this study, we have obtained some topological properties of the first dominating David derived (DDD) networks and computed several K-Banhatti polynomials of the first type of DDD.