Preferred Language
Articles
/
BxbBCocBVTCNdQwCgDL_
CTJ: Input-Output Based Relation Combinatorial Testing Strategy Using Jaya Algorithm
...Show More Authors

Software testing is a vital part of the software development life cycle. In many cases, the system under test has more than one input making the testing efforts for every exhaustive combination impossible (i.e. the time of execution of the test case can be outrageously long). Combinatorial testing offers an alternative to exhaustive testing via considering the interaction of input values for every t-way combination between parameters. Combinatorial testing can be divided into three types which are uniform strength interaction, variable strength interaction and input-output based relation (IOR). IOR combinatorial testing only tests for the important combinations selected by the tester. Most of the researches in combinatorial testing applied the uniform and the variable interaction strength, however, there is still a lack of work addressing IOR. In this paper, a Jaya algorithm is proposed as an optimization algorithm engine to construct a test list based on IOR in the proposed combinatorial test list generator strategy into a tool called CTJ. The result of applying the Jaya algorithm in input-output based combinatorial testing is acceptable since it produces a nearly optimum number of test cases in a satisfactory time range.

View Publication
Publication Date
Sat Dec 30 2017
Journal Name
Al-khwarizmi Engineering Journal
Low Cost Hardware Back Propagation Algorithm
...Show More Authors

The first successful implementation of Artificial Neural Networks (ANNs) was published a little over a decade ago. It is time to review the progress that has been made in this research area. This paper provides taxonomy for classifying Field Programmable Gate Arrays (FPGAs) implementation of ANNs. Different implementation techniques and design issues are discussed, such as obtaining a suitable activation function and numerical truncation technique trade-off, the improvement of the learning algorithm to reduce the cost of neuron and in result the total cost and the total speed of the complete ANN. Finally, the implementation of a complete very fast circuit for the pattern of English Digit Numbers NN has four layers of 70 nodes (neurons) o

... Show More
View Publication Preview PDF
Publication Date
Thu Mar 01 2007
Journal Name
Al-khwarizmi Engineering Journal
Low Cost Hardware Back Propagation Algorithm
...Show More Authors

The first successful implementation of Artificial Neural Networks (ANNs) was published a little over a decade ago. It is time to review the progress that has been made in this research area. This paper provides taxonomy for classifying Field Programmable Gate Arrays (FPGAs) implementation of ANNs. Different implementation techniques and design issues are discussed, such as obtaining a suitable activation function and numerical truncation technique trade-off, the improvement of the learning algorithm to reduce the cost of neuron and in result the total cost and the total speed of the complete ANN. Finally, the implementation of a complete very fast circuit for the pattern of English Digit Numbers NN has four layers of 70 nodes (neurons) o

... Show More
View Publication Preview PDF
Publication Date
Sun Jan 01 2017
Journal Name
Australian Journal Of Basic And Applied Sciences
Proposed Algorithm for Gumbel Distribution Estimation
...Show More Authors

Gumbel distribution was dealt with great care by researchers and statisticians. There are traditional methods to estimate two parameters of Gumbel distribution known as Maximum Likelihood, the Method of Moments and recently the method of re-sampling called (Jackknife). However, these methods suffer from some mathematical difficulties in solving them analytically. Accordingly, there are other non-traditional methods, like the principle of the nearest neighbors, used in computer science especially, artificial intelligence algorithms, including the genetic algorithm, the artificial neural network algorithm, and others that may to be classified as meta-heuristic methods. Moreover, this principle of nearest neighbors has useful statistical featu

... Show More
Preview PDF
Crossref
Publication Date
Sun Feb 25 2024
Journal Name
Baghdad Science Journal
SBOA: A Novel Heuristic Optimization Algorithm
...Show More Authors

A new human-based heuristic optimization method, named the Snooker-Based Optimization Algorithm (SBOA), is introduced in this study. The inspiration for this method is drawn from the traits of sales elites—those qualities every salesperson aspires to possess. Typically, salespersons strive to enhance their skills through autonomous learning or by seeking guidance from others. Furthermore, they engage in regular communication with customers to gain approval for their products or services. Building upon this concept, SBOA aims to find the optimal solution within a given search space, traversing all positions to obtain all possible values. To assesses the feasibility and effectiveness of SBOA in comparison to other algorithms, we conducte

... Show More
View Publication Preview PDF
Scopus (8)
Crossref (6)
Scopus Crossref
Publication Date
Thu Aug 01 2019
Journal Name
Journal Of Economics And Administrative Sciences
Building the optimal portfolio for stock using multi-objective genetic algorithm - comparative analytical research in the Iraqi stock market
...Show More Authors

Abstract:

The main objective of the research is to build an optimal investment portfolio of stocks’ listed at the Iraqi Stock Exchange after employing the multi-objective genetic algorithm within the period of time between 1/1/2006 and 1/6/2018 in the light of closing prices (43) companies after the completion of their data and met the conditions of the inspection, as the literature review has supported the diagnosis of the knowledge gap and the identification of deficiencies in the level of experimentation was the current direction of research was to reflect the aspects of the unseen and untreated by other researchers in particular, the missing data and non-reversed pieces the reality of trading at the level of compani

... Show More
View Publication Preview PDF
Crossref
Publication Date
Sun Jan 01 2017
Journal Name
Pertanika Journal Of Science & Technology
Modified Kohonen network algorithm for selection of the initial centres of Gustafson-Kessel algorithm in credit scoring
...Show More Authors

Credit risk assessment has become an important topic in financial risk administration. Fuzzy clustering analysis has been applied in credit scoring. Gustafson-Kessel (GK) algorithm has been utilised to cluster creditworthy customers as against non-creditworthy ones. A good clustering analysis implemented by good Initial Centres of clusters should be selected. To overcome this problem of Gustafson-Kessel (GK) algorithm, we proposed a modified version of Kohonen Network (KN) algorithm to select the initial centres. Utilising similar degree between points to get similarity density, and then by means of maximum density points selecting; the modified Kohonen Network method generate clustering initial centres to get more reasonable clustering res

... Show More
Scopus (9)
Scopus
Publication Date
Fri Aug 01 2008
Journal Name
2008 First International Conference On The Applications Of Digital Information And Web Technologies (icadiwt)
Hybrid canonical genetic algorithm and steepest descent algorithm for optimizing likelihood estimators of ARMA (1, 1) model
...Show More Authors

This paper presents a hybrid genetic algorithm (hGA) for optimizing the maximum likelihood function ln(L(phi(1),theta(1)))of the mixed model ARMA(1,1). The presented hybrid genetic algorithm (hGA) couples two processes: the canonical genetic algorithm (cGA) composed of three main steps: selection, local recombination and mutation, with the local search algorithm represent by steepest descent algorithm (sDA) which is defined by three basic parameters: frequency, probability, and number of local search iterations. The experimental design is based on simulating the cGA, hGA, and sDA algorithms with different values of model parameters, and sample size(n). The study contains comparison among these algorithms depending on MSE value. One can conc

... Show More
View Publication
Scopus (1)
Scopus Crossref
Publication Date
Fri Dec 01 2023
Journal Name
Bulletin Of Electrical Engineering And Informatics
A comparative study of Gaussian mixture algorithm and K-means algorithm for efficient energy clustering in MWSN
...Show More Authors

Wireless sensor networks (WSNs) represent one of the key technologies in internet of things (IoTs) networks. Since WSNs have finite energy sources, there is ongoing research work to develop new strategies for minimizing power consumption or enhancing traditional techniques. In this paper, a novel Gaussian mixture models (GMMs) algorithm is proposed for mobile wireless sensor networks (MWSNs) for energy saving. Performance evaluation of the clustering process with the GMM algorithm shows a remarkable energy saving in the network of up to 92%. In addition, a comparison with another clustering strategy that uses the K-means algorithm has been made, and the developed method has outperformed K-means with superior performance, saving ener

... Show More
View Publication
Scopus (4)
Crossref (3)
Scopus Crossref
Publication Date
Fri Mar 29 2024
Journal Name
Iraqi Journal Of Science
Kinematic Properties of the Gaseous Stellar Dynamics Using the Tully-Fisher Relation in the Different Types of Spiral Galaxies
...Show More Authors

     The goal of this paper is to show the kinematic characteristics of gaseous stellar dynamics using scaling coefficient relationships (such as Tully-Fisher) in different spiral galaxies. We selected a sample of types of spiral morphology  (116 early, 150 intermediate, and 146 late) from previous literature work, and used statistical software (statistic-win-program) to find out the associations of multiple factors under investigation, such as the main kinematic properties of the gaseous-stellar (mass, luminosity, rotational speed, and baryons) in different types of spiral galaxies. We concluded that there is a robust positive connection between Log Vrot.max.) and Log Mstar(B-V), as well as between Log Vrot.max. and Log Mbar (

... Show More
View Publication
Scopus (1)
Crossref (1)
Scopus Crossref
Publication Date
Sun Aug 25 2024
Journal Name
University Of Samarra
Preparation, diagnosis and testing of the biological ‎activity of new complexes of Schiff bases
...Show More Authors

‎ Sixteen new complexes with the general formula [M(L)2(H2O)2] were ‎prepared resulting from the reaction of the two new Schiff base ligands, which ‎are‏: -‏ L1= (E)-5-((2-hydroxybenzylidene)amino)-2-phenyl-2,4-dihydro-3H-pyrazol-3-one)‎ L2 = (E)-5-((2-hydroxy-3-methoxybenzylidene)amino)-2-phenylpyrazolidin-3-one) ‎ ‎ With divalent metal ions (manganese, cobalt, nickel, copper, zinc, cadmium, ‎mercury) and (tetravalent platinum).‎‏ ‏ ‎ Ligands was derived from the reaction of the amine (5-amino-2-phenyl-2,4-‎dihydro-3H-pyrazol-3-one) with Salicylaldehyde and ortho-vanillin, which is ‎linked to the metal ions via the nitrogen atoms are the isomethene group and ‎the oxygen is the hydroxide group of t

... Show More