Preferred Language
Articles
/
bsj-2557
Development Binary Search Algorithm
...Show More Authors

There are many methods of searching large amount of data to find one particular piece of information. Such as find name of person in record of mobile. Certain methods of organizing data make the search process more efficient the objective of these methods is to find the element with least cost (least time). Binary search algorithm is faster than sequential and other commonly used search algorithms. This research develops binary search algorithm by using new structure called Triple, structure in this structure data are represented as triple. It consists of three locations (1-Top, 2-Left, and 3-Right) Binary search algorithm divide the search interval in half, this process makes the maximum number of comparisons (Average case complexity of Search) is O(log2 n) (pronounce this "big-Oh-n" or "the order of magnitude"), if we search in a list consists of (N) elements. In this research the number of comparison is reduced to triple by using Triple structure, this process makes the maximum number of comparisons is O(log2 (n)/3+1) if we search key in list consist of (N) elements.

Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Tue Sep 01 2020
Journal Name
Ceramics International
High-performance (K,Na)NbO3-based binary lead-free piezoelectric ceramics modified with acceptor metal oxide
...Show More Authors

View Publication
Scopus (36)
Crossref (35)
Scopus Clarivate Crossref
Publication Date
Mon Jan 01 2024
Journal Name
Nanotechnology, Science And Applications
Formulation and Characterization of Intranasal Drug Delivery of Frovatriptan-Loaded Binary Ethosomes Gel for Brain Targeting
...Show More Authors

Background: Frovatriptan succinate (FVT) is an effective medication used to treat migraines; however, available oral formulations suffer from low permeability; accordingly, several formulations of FVT were prepared. Objective: Prepare, optimize, and evaluate FVT-BE formulation to develop enhanced intranasal binary nano-ethosome gel. Methods: Binary ethosomes were prepared using different concentrations of phospholipid PLH90, ethanol, propylene glycol, and cholesterol by thin film hydration and characterized by particle size, zeta potential, and entrapment efficiency. Furthermore, in-vitro, in-vivo, ex-vivo, pharmacokinetics, and histopathological studies were done. Results: Regarding FVT-loaded BE, formula (F9) demonstrated the best paramet

... Show More
View Publication
Scopus (24)
Crossref (24)
Scopus Clarivate Crossref
Publication Date
Tue Feb 01 2022
Journal Name
Baghdad Science Journal
An Efficient Algorithm for Fuzzy Linear Fractional Programming Problems via Ranking Function
...Show More Authors

In many applications such as production, planning, the decision maker is important in optimizing an objective function that has fuzzy ratio two functions which can be handed using fuzzy fractional programming problem technique. A special class of optimization technique named fuzzy fractional programming problem is considered in this work when the coefficients of objective function are fuzzy. New ranking function is proposed and used to convert the data of the fuzzy fractional programming problem from fuzzy number to crisp number so that the shortcoming when treating the original fuzzy problem can be avoided. Here a novel ranking function approach of ordinary fuzzy numbers is adopted for ranking of triangular fuzzy numbers with simpler an

... Show More
View Publication Preview PDF
Scopus (13)
Crossref (6)
Scopus Clarivate Crossref
Publication Date
Thu Apr 25 2019
Journal Name
Engineering And Technology Journal
Improvement of Harris Algorithm Based on Gaussian Scale Space
...Show More Authors

Features is the description of the image contents which could be corner, blob or edge. Corners are one of the most important feature to describe image, therefore there are many algorithms to detect corners such as Harris, FAST, SUSAN, etc. Harris is a method for corner detection and it is an efficient and accurate feature detection method. Harris corner detection is rotation invariant but it isn’t scale invariant. This paper presents an efficient harris corner detector invariant to scale, this improvement done by using gaussian function with different scales. The experimental results illustrate that it is very useful to use Gaussian linear equation to deal with harris weakness.

View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Thu Mar 01 2018
Journal Name
Journal Of Engineering
Flexible Genetic Algorithm Based Optimal Power Flow of Power Systems
...Show More Authors

Nowadays, the power plant is changing the power industry from a centralized and vertically integrated form into regional, competitive and functionally separate units. This is done with the future aims of increasing efficiency by better management and better employment of existing equipment and lower price of electricity to all types of customers while retaining a reliable system. This research is aimed to solve the optimal power flow (OPF) problem. The OPF is used to minimize the total generations fuel cost function. Optimal power flow may be single objective or multi objective function. In this thesis, an attempt is made to minimize the objective function with keeping the voltages magnitudes of all load buses, real outp

... Show More
View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Fri Apr 01 2022
Journal Name
Baghdad Science Journal
An Evolutionary Algorithm for Solving Academic Courses Timetable Scheduling Problem
...Show More Authors

Scheduling Timetables for courses in the big departments in the universities is a very hard problem and is often be solved by many previous works although results are partially optimal. This work implements the principle of an evolutionary algorithm by using genetic theories to solve the timetabling problem to get a random and full optimal timetable with the ability to generate a multi-solution timetable for each stage in the collage. The major idea is to generate course timetables automatically while discovering the area of constraints to get an optimal and flexible schedule with no redundancy through the change of a viable course timetable. The main contribution in this work is indicated by increasing the flexibility of generating opti

... Show More
View Publication Preview PDF
Scopus (17)
Crossref (8)
Scopus Clarivate Crossref
Publication Date
Mon Feb 01 2021
Journal Name
International Journal Of Electrical And Computer Engineering (ijece)
Features of genetic algorithm for plain text encryption
...Show More Authors

The data communication has been growing in present day. Therefore, the data encryption became very essential in secured data transmission and storage and protecting data contents from intruder and unauthorized persons. In this paper, a fast technique for text encryption depending on genetic algorithm is presented. The encryption approach is achieved by the genetic operators Crossover and mutation. The encryption proposal technique based on dividing the plain text characters into pairs, and applying the crossover operation between them, followed by the mutation operation to get the encrypted text. The experimental results show that the proposal provides an important improvement in encryption rate with comparatively high-speed Process

... Show More
View Publication
Scopus (15)
Crossref (4)
Scopus Crossref
Publication Date
Thu Sep 26 2019
Journal Name
Processes
Fine-Tuning Meta-Heuristic Algorithm for Global Optimization
...Show More Authors

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 t

... Show More
View Publication Preview PDF
Scopus (26)
Crossref (23)
Scopus Clarivate Crossref
Publication Date
Sun Jun 20 2021
Journal Name
Baghdad Science Journal
Multifactor Algorithm for Test Case Selection and Ordering
...Show More Authors

Regression testing being expensive, requires optimization notion. Typically, the optimization of test cases results in selecting a reduced set or subset of test cases or prioritizing the test cases to detect potential faults at an earlier phase. Many former studies revealed the heuristic-dependent mechanism to attain optimality while reducing or prioritizing test cases. Nevertheless, those studies were deprived of systematic procedures to manage tied test cases issue. Moreover, evolutionary algorithms such as the genetic process often help in depleting test cases, together with a concurrent decrease in computational runtime. However, when examining the fault detection capacity along with other parameters, is required, the method falls sh

... Show More
View Publication Preview PDF
Scopus (4)
Crossref (2)
Scopus Clarivate Crossref
Publication Date
Mon Apr 26 2021
Journal Name
Journal Of Real-time Image Processing
Fast and efficient recursive algorithm of Meixner polynomials
...Show More Authors

View Publication
Scopus (33)
Crossref (29)
Scopus Clarivate Crossref