Optimizing the Access Point (AP) deployment has a great role in wireless applications due to the need for providing an efficient communication with low deployment costs. Quality of Service (QoS), is a major significant parameter and objective to be considered along with AP placement as well the overall deployment cost. This study proposes and investigates a multi-level optimization algorithm called Wireless Optimization Algorithm for Indoor Placement (WOAIP) based on Binary Particle Swarm Optimization (BPSO). WOAIP aims to obtain the optimum AP multi-floor placement with effective coverage that makes it more capable of supporting QoS and cost-effectiveness. Five pairs (coverage, AP deployment) of weights, signal thresholds and received signal strength (RSS) measurements simulated using Wireless InSite (WI) software were considered in the test case study by comparing the results collected from WI with the present wireless simulated physical AP deployment of the targeted building - Computer Science Department at University of Baghdad. The performance evaluation of WOAIP shows an increase in terms of AP placement and optimization distinguished in order to increase the wireless coverage ratio to 92.93% compared to 58.5% of present AP coverage (or 24.5% coverage enhancement on average).
The linear segment with parabolic blend (LSPB) trajectory deviates from the specified waypoints. It is restricted to that the acceleration must be sufficiently high. In this work, it is proposed to engage modified LSPB trajectory with particle swarm optimization (PSO) so as to create through points on the trajectory. The assumption of normal LSPB method that parabolic part is centered in time around waypoints is replaced by proposed coefficients for calculating the time duration of the linear part. These coefficients are functions of velocities between through points. The velocities are obtained by PSO so as to force the LSPB trajectory passing exactly through the specified path points. Also, relations for velocity correction and exact v
... Show MoreThis work consists of a numerical simulation to predict the velocity and temperature distributions, and an experimental work to visualize the air flow in a room model. The numerical work is based on non-isothermal, incompressible, three dimensional, k turbulence model, and solved using a computational fluid dynamic (CFD) approach, involving finite volume technique to solve continuity, momentum and energy equations, that governs the room’s turbulent flow domain. The experimental study was performed using (1/5) scaled room model of the actual dimensions of the room to simulate room air flow and visualize the flow pattern using smoke generated from burnt herbs and collected in a smoke generator to delivered through
... Show MoreRecently, detecting dynamic patterns for growing communities in social networks have attracted significant attention. The objective of dynamic community detection is to analyze and identify clusters in complex networks that change over time. Different optimization algorithms, including both single-objective and multi-objective approaches, have been employed to address the challenge of dynamic community detection. Although current evolutionary algorithms for identifying community structure can traverse extensive areas of partition space, they often become stuck in local minima. In addition, limited studies have addressed this issue by integrating local search strategies with evolutionary algorithms for community identification. This paper in
... Show More<p>In combinatorial testing development, the fabrication of covering arrays is the key challenge by the multiple aspects that influence it. A wide range of combinatorial problems can be solved using metaheuristic and greedy techniques. Combining the greedy technique utilizing a metaheuristic search technique like hill climbing (HC), can produce feasible results for combinatorial tests. Methods based on metaheuristics are used to deal with tuples that may be left after redundancy using greedy strategies; then the result utilization is assured to be near-optimal using a metaheuristic algorithm. As a result, the use of both greedy and HC algorithms in a single test generation system is a good candidate if constructed correctly. T
... Show MoreBackground: One effective second-generation triptan for migraine attacks is sumatriptan. Following oral use, it has a 40% restricted bioavailability because of the first-pass metabolism. Aim: To develop the best intranasal Solusomes formula as a substitute that delivers into the brain directly, improving its bioavailability, and removing the first-pass outcome was the aim of this effort. Methodology: We developed solute formulations based on the Box-Behnken design and subsequently produced them via thin-film hydration. The quality by design technique was used to establish a correlation between the formulation parameters (Soluplus® and phosphatidylcholine (PC) concentrations) and signif¬icant quality powers (entrapment efficiency (
... Show MoreA simple, fast, inexpensive and sensitive method has been proposed to screen and optimize experimental factors that effecting the determination of phenylephrine hydrochloride (PHE.HCl) in pure and pharmaceutical formulations. The method is based on the development of brown-colored charge transfer (CT) complex with p-Bromanil (p-Br) in an alkaline medium (pH=9) with 1.07 min after heating at 80 °C. ‘Design of Experiments’ (DOE) employing ‘Central Composite Face Centered Design’ (CCF) and ‘Response Surface Methodology’ (RSM) were applied as an improvement to traditional ‘One Variable at Time’ (OVAT) approach to evaluate the effects of variations in selected factors (volume of 5×10-3 M p-Br, heating time, and temperature) on
... Show More