In this paper, variable gain nonlinear PD and PI fuzzy logic controllers are designed and the effect of the variable gain characteristic of these controllers is analyzed to show its contribution in enhancing the performance of the closed loop system over a conventional linear PID controller. Simulation results and time domain performance characteristics show how these fuzzy controllers outperform the conventional PID controller when used to control a nonlinear plant and a plant that has time delay.

Gray-Scale Image Brightness/Contrast Enhancement with Multi-Model
Histogram linear Contrast Stretching (MMHLCS) method

Nimodipine (NMD) is a dihydropyridine calcium channel blocker useful for the prevention and treatment of delayed ischemic effects. It belongs to class ? drugs, which is characterized by low solubility and high permeability. This research aimed to prepare Nimodipine nanoparticles (NMD NPs) for the enhancement of solubility and dissolution rate. The formulation of nanoparticles was done by the solvent anti-solvent technique using either magnetic stirrer or bath sonicator for maintaining the motion of the antisolvent phase. Five different stabilizers were used to prepare NMD NPs( TPGS, Soluplus®, HPMC E5, PVP K90, and poloxamer 407). The selected formula F2, in which  Soluplus 

has been utilized as a stabilizer, has a par

The aim of this work is to enhance the mechanical properties of the glass ionomer cement GIC (dental materials) by adding Zirconium Oxide ZrO₂ in both micro and nano particles. GIC were mixed with (3, 5 and 7) wt% of both ZrO₂ micro and nanoparticles separately. Compressive strength (CS), biaxial flexural strength (BFS), Vickers Microhardness (VH) and wear rate losses (WR) were investigated. The maximum compression strength was 122.31 MPa with 5 wt. % ZrO₂ micro particle, while 3wt% nanoparticles give highest Microhardness and biaxial flexural strength of 88.8 VHN and 35.79 MPa respectively. The minimum wear rate losses were 3.776µg/m with 7 wt. % ZrO₂ nanoparticle. GIC-contai

In the last few years, the Internet of Things (IoT) is gaining remarkable attention in both academic and industrial worlds. The main goal of the IoT is laying on describing everyday objects with different capabilities in an interconnected fashion to the Internet to share resources and to carry out the assigned tasks. Most of the IoT objects are heterogeneous in terms of the amount of energy, processing ability, memory storage, etc. However, one of the most important challenges facing the IoT networks is the energy-efficient task allocation. An efficient task allocation protocol in the IoT network should ensure the fair and efficient distribution of resources for all objects to collaborate dynamically with limited energy. The canonic

The Ant System Algorithm (ASA) is a member of the ant colony algorithms family in swarm intelligence methods (part of the Artificial Intelligence field), which is based on the behavior of ants seeking a path and a source of food in their colonies. The aim of This algorithm is to search for an optimal solution for Combinational Optimization Problems (COP) for which is extremely difficult to find solution using the classical methods like linear and non-linear programming methods. 

The Ant System Algorithm was used in the management of water resources field in Iraq, specifically for Haditha dam which is one of the most important dams in Iraq. The target is to find out an efficient management system for

This work aims to see the positive association rules and negative association rules in the Apriori algorithm by using cosine correlation analysis. The default and the modified Association Rule Mining algorithm are implemented against the mushroom database to find out the difference of the results. The experimental results showed that the modified Association Rule Mining algorithm could generate negative association rules. The addition of cosine correlation analysis returns a smaller amount of association rules than the amounts of the default Association Rule Mining algorithm. From the top ten association rules, it can be seen that there are different rules between the default and the modified Apriori algorithm. The difference of the obta

    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

The performance quality and searching speed of Block Matching (BM) algorithm are affected by shapes and sizes of the search patterns used in the algorithm. In this paper, Kite Cross Hexagonal Search (KCHS) is proposed. This algorithm uses different search patterns (kite, cross, and hexagonal) to search for the best Motion Vector (MV). In first step, KCHS uses cross search pattern. In second step, it uses one of kite search patterns (up, down, left, or right depending on the first step). In subsequent steps, it uses large/small Hexagonal Search (HS) patterns. This new algorithm is compared with several known fast block matching algorithms. Comparisons are based on search points and Peak Signal to Noise Ratio (PSNR). According to resul