This paper proposes a novel meta-heuristic optimization algorithm called the fine-tuning meta-heuristic algorithm (FTMA) for solving global optimization problems. In this algorithm, the solutions are fine-tuned using the fundamental steps in meta-heuristic optimization, namely, exploration, exploitation, and randomization, in such a way that if one step improves the solution, then it is unnecessary to execute the remaining steps. The performance of the proposed FTMA has been compared with that of five other optimization algorithms over ten benchmark test functions. Nine of them are well-known and already exist in the literature, while the tenth one is proposed by the authors and introduced in this article. One test trial was shown to check the performance of each algorithm, and the other test for 30 trials to measure the statistical results of the performance of the proposed algorithm against the others. Results confirm that the proposed FTMA global optimization algorithm has a competing performance in comparison with its counterparts in terms of speed and evading the local minima.
The current study aims to identify:The meta-motivation and Uniqueness seeking of the study sample. The correlated relationship among them. The present study sample consists of (400) students from the colleges of engineering, University of Baghdad, and the University of Technology in the academic year (2019-2020), and the researcher has adopted the Chen Scale (1995)to measure the meta-motivation after its translation into Arabic by(Al-Samawi,2011).The scale includes six dimensions. The researcher has also adopted the Snyder&Fromkin scale (1980) to measure the uniqueness seeking after translating and adapting it into the Arabic environment. The scale consists of three dimensions. The results show that students of the Facult
... Show MoreExtractive multi-document text summarization – a summarization with the aim of removing redundant information in a document collection while preserving its salient sentences – has recently enjoyed a large interest in proposing automatic models. This paper proposes an extractive multi-document text summarization model based on genetic algorithm (GA). First, the problem is modeled as a discrete optimization problem and a specific fitness function is designed to effectively cope with the proposed model. Then, a binary-encoded representation together with a heuristic mutation and a local repair operators are proposed to characterize the adopted GA. Experiments are applied to ten topics from Document Understanding Conference DUC2002 datas
... Show MoreIncreased downscaling of CMOS circuits with respect to feature size and threshold voltage has a result of dramatically increasing in leakage current. So, leakage power reduction is an important design issue for active and standby modes as long as the technology scaling increased. In this paper, a simultaneous active and standby energy optimization methodology is proposed for 22 nm sub-threshold CMOS circuits. In the first phase, we investigate the dual threshold voltage design for active energy per cycle minimization. A slack based genetic algorithm is proposed to find the optimal reverse body bias assignment to set of noncritical paths gates to ensure low active energy per cycle with the maximum allowable frequency at the optimal supply vo
... Show MoreOptimization is the task of minimizing or maximizing an objective function f(x) parameterized by x. A series of effective numerical optimization methods have become popular for improving the performance and efficiency of other methods characterized by high-quality solutions and high convergence speed. In recent years, there are a lot of interest in hybrid metaheuristics, where more than one method is ideally combined into one new method that has the ability to solve many problems rapidly and efficiently. The basic concept of the proposed method is based on the addition of the acceleration part of the Gravity Search Algorithm (GSA) model in the Firefly Algorithm (FA) model and creating new individuals. Some stan
... Show MoreTo ensure that a software/hardware product is of sufficient quality and functionality, it is essential to conduct thorough testing and evaluations of the numerous individual software components that make up the application. Many different approaches exist for testing software, including combinatorial testing and covering arrays. Because of the difficulty of dealing with difficulties like a two-way combinatorial explosion, this brings up yet another problem: time. Using client-server architectures, this research introduces a parallel implementation of the TWGH algorithm. Many studies have been conducted to demonstrate the efficiency of this technique. The findings of this experiment were used to determine the increase in speed and co
... Show MoreThe university course timetable problem (UCTP) is typically a combinatorial optimization problem. Manually achieving a useful timetable requires many days of effort, and the results are still unsatisfactory. unsatisfactory. Various states of art methods (heuristic, meta-heuristic) are used to satisfactorily solve UCTP. However, these approaches typically represent the instance-specific solutions. The hyper-heuristic framework adequately addresses this complex problem. This research proposed Particle Swarm Optimizer-based Hyper Heuristic (HH PSO) to solve UCTP efficiently. PSO is used as a higher-level method that selects low-level heuristics (LLH) sequence which further generates an optimal solution. The proposed a
... Show MoreBackground: Breast cancer is the first one among Iraqi females. Most of them present later for diagnosis. Early detection center in tertiary hospital practice uses FNAB for early diagnosis. Publications on accuracy of this detection are scarce.
Objective: To test the accuracy of FNAB in breast lump diagnosis.
Methods: Diagnostic test accuracy study, on 204 women with breast lump, attending the oncology department in 2017.
Results: Fine-needle aspiration biopsy diagnosis of histologically malignant cases were, malignant in 89 (87.3%), suspicious of malignancy in 5 (4.9%), and benign in 4 (3.9%). Complete sensitivity was 87.3%, and specificity
... Show MoreNo-fine concrete (NFC) is cellular concrete and it’s light weight concrete produced with the exclusion of sand from the concrete. This study includes the mechanical properties of lightweight reinforced by steel fiber, containing different proportions of steel fiber. This study was done using number of tests. These tests were density, compressive strength, flexural strength and absorption. These tests of the molds at different curing time. The results of tests that implication of fiber to No. fine concrete did not affect significantly on the compressive strength, While the flexural strength were gets better. Results explained that, the flexural strength of (1%) fiber No- fine concrete molds are four times that of the reference mold
... Show MoreBiomimatic basic calcium phosphate ,known as Hydroxy apatite(HA), was
synthesised using calcium acetate and disodium phosphate dilute hot (boiling) solution of
both salts were added slowly to each other. A colloidal suspension formed was aged for few
days, then boiled for one hour to induced setting and coagulation of preapatite, and left to cool
until they reached room temperature.
The precipitate was filtered and washed with distilled water, then ethanol and dried.
The dried sample was calcined at 1100
o
C.The obtained solid lumps were then crushed
reground fine powder and analyzed for calcium to phosphorous ratio. X-ray analysis was
carried out to examine the solid sample. Chemical analysis for phos