Preferred Language
Articles
/
WxfGNY8BVTCNdQwCNmLJ
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 conclude that (hGA) can give good estimators (phi(1),theta(1)) of ARMA(1,1)parameters and more reliable than estimators obtained by cGA and SDA algorithm

Scopus Crossref
View Publication
Publication Date
Wed Sep 01 2021
Journal Name
Baghdad Science Journal
Measuring Positive and Negative Association of Apriori Algorithm with Cosine Correlation Analysis
...Show More Authors

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

... Show More
View Publication Preview PDF
Scopus (2)
Crossref (1)
Scopus Clarivate Crossref
Publication Date
Sun Sep 15 2019
Journal Name
Al-academy
Role of the Internet in Spreading Rumors Social networking sites "Facebook" model For the duration of 1-7-2017 until 30-11-2017: يوسف محمد حسين
...Show More Authors

This study is about the role of the Internet in spreading rumors, especially through social networking sites "Facebook" model as the effectiveness of social networks lies in the speed of transmission of events; these two characteristics are important to the public, making the Internet a strong contender for television and its relationship with the public. That's why we find that the Internet today has become a fertile environment for the growth and spread of rumors. The more limited the platforms and places of publication, the greater the responsibility in the search for the original source in   spreading this or that rumor, as the Internet is considered an easy means in the production, spreading  and re-spreading  of

... Show More
View Publication Preview PDF
Crossref
Publication Date
Fri Jan 01 2016
Journal Name
Journal Of Computer And Communications
Pathfinding in Strategy Games and Maze Solving Using A* Search Algorithm
...Show More Authors

View Publication
Crossref (22)
Crossref
Publication Date
Fri Oct 03 2025
Journal Name
Mesopotamian Journal Of Computer Science
Enhanced TEA Algorithm Performance using Affine Transformation and Chaotic Arnold Map
...Show More Authors

In digital images, protecting sensitive visual information against unauthorized access is considered a critical issue; robust encryption methods are the best solution to preserve such information. This paper introduces a model designed to enhance the performance of the Tiny Encryption Algorithm (TEA) in encrypting images. Two approaches have been suggested for the image cipher process as a preprocessing step before applying the Tiny Encryption Algorithm (TEA). The step mentioned earlier aims to de-correlate and weaken adjacent pixel values as a preparation process before the encryption process. The first approach suggests an Affine transformation for image encryption at two layers, utilizing two different key sets for each layer. Th

... Show More
View Publication Preview PDF
Scopus Crossref
Publication Date
Tue Jan 01 2019
Journal Name
Ieee Access
Speech Enhancement Algorithm Based on Super-Gaussian Modeling and Orthogonal Polynomials
...Show More Authors

View Publication
Scopus (45)
Crossref (44)
Scopus Clarivate Crossref
Publication Date
Sat Apr 01 2023
Journal Name
International Journal Of Electrical And Computer Engineering (ijece)
Image encryption algorithm based on the density and 6D logistic map
...Show More Authors

One of the most difficult issues in the history of communication technology is the transmission of secure images. On the internet, photos are used and shared by millions of individuals for both private and business reasons. Utilizing encryption methods to change the original image into an unintelligible or scrambled version is one way to achieve safe image transfer over the network. Cryptographic approaches based on chaotic logistic theory provide several new and promising options for developing secure Image encryption methods. The main aim of this paper is to build a secure system for encrypting gray and color images. The proposed system consists of two stages, the first stage is the encryption process, in which the keys are genera

... Show More
View Publication
Scopus (25)
Crossref (13)
Scopus Crossref
Publication Date
Thu Jan 30 2025
Journal Name
Iraqi Journal Of Science
Improving the Reliability of Evolutionary Algorithm for Complex Detection in Noisy Protein-Protein Interaction Networks
...Show More Authors

Evolutionary algorithms are better than heuristic algorithms at finding protein complexes in protein-protein interaction networks (PPINs). Many of these algorithms depend on their standard frameworks, which are based on topology. Further, many of these algorithms have been exclusively examined on networks with only reliable interaction data. The main objective of this paper is to extend the design of the canonical and topological-based evolutionary algorithms suggested in the literature to cope with noisy PPINs. The design of the evolutionary algorithm is extended based on the functional domain of the proteins rather than on the topological domain of the PPIN. The gene ontology annotation in each molecular function, biological proce

... Show More
View Publication
Scopus Crossref
Publication Date
Sun Jun 05 2016
Journal Name
Baghdad Science Journal
Developing an Immune Negative Selection Algorithm for Intrusion Detection in NSL-KDD data Set
...Show More Authors

With the development of communication technologies for mobile devices and electronic communications, and went to the world of e-government, e-commerce and e-banking. It became necessary to control these activities from exposure to intrusion or misuse and to provide protection to them, so it's important to design powerful and efficient systems-do-this-purpose. It this paper it has been used several varieties of algorithm selection passive immune algorithm selection passive with real values, algorithm selection with passive detectors with a radius fixed, algorithm selection with passive detectors, variable- sized intrusion detection network type misuse where the algorithm generates a set of detectors to distinguish the self-samples. Practica

... Show More
View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Fri Jul 19 2024
Journal Name
An International Journal Of Optimization And Control: Theories & Applications (ijocta)
Design optimal neural network based on new LM training algorithm for solving 3D - PDEs
...Show More Authors

In this article, we design an optimal neural network based on new LM training algorithm. The traditional algorithm of LM required high memory, storage and computational overhead because of it required the updated of Hessian approximations in each iteration. The suggested design implemented to converts the original problem into a minimization problem using feed forward type to solve non-linear 3D - PDEs. Also, optimal design is obtained by computing the parameters of learning with highly precise. Examples are provided to portray the efficiency and applicability of this technique. Comparisons with other designs are also conducted to demonstrate the accuracy of the proposed design.

View Publication Preview PDF
Scopus (3)
Crossref (2)
Scopus Clarivate Crossref
Publication Date
Wed Jun 01 2022
Journal Name
Baghdad Science Journal
WOAIP: Wireless Optimization Algorithm for Indoor Placement Based on Binary Particle Swarm Optimization (BPSO)
...Show More Authors

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 s

... Show More
View Publication Preview PDF
Scopus (7)
Crossref (5)
Scopus Clarivate Crossref