Preferred Language
Articles
/
HxjoKZgBVTCNdQwCBrpT
Speeding Up Back-Propagation Learning (SUBPL) Algorithm: A New Modified Back_Propagation Algorithm
...Show More Authors

The convergence speed is the most important feature of Back-Propagation (BP) algorithm. A lot of improvements were proposed to this algorithm since its presentation, in order to speed up the convergence phase. In this paper, a new modified BP algorithm called Speeding up Back-Propagation Learning (SUBPL) algorithm is proposed and compared to the standard BP. Different data sets were implemented and experimented to verify the improvement in SUBPL.

View Publication
Publication Date
Thu Jan 01 2026
Journal Name
Aip Conference Proceedings
Estimation parameter for non-linear regression by using HGSABAT algorithm
...Show More Authors

This study offers a new Mixed Meta Heuristics algorithm (HGSABAT) for estimating the parameter values of each of the six categories of Non-Linear regression models examined (Misrald, Meyer4, Meyer7, Militky4, Militky2, and MGH09) by combining the Gravitational Search Algorithm and Bat Algorithm. Some models have different numbers of parameters. For example, the Misrald and Militky2 models of the Non-Linear Regression model have two parameters (Bl, B2). In contrast, the MGH09 and Militky4 models have four parameters (MGHl, MGH2, MGH3, and MGH4), in which location as the Meyer4 and Meyer7 models have three attributes (Meyerl, MGH2, and MGH3). To examine the effectiveness of the suggested Hybrid Meta Heuristics algorithm (HGSABAT), a simulatio

... Show More
View Publication Preview PDF
Scopus Crossref
Publication Date
Mon Sep 12 2022
Journal Name
Electronics
TWGH: A Tripartite Whale–Gray Wolf–Harmony Algorithm to Minimize Combinatorial Test Suite Problem
...Show More Authors

Today’s academics have a major hurdle in solving combinatorial problems in the actual world. It is nevertheless possible to use optimization techniques to find, design, and solve a genuine optimal solution to a particular problem, despite the limitations of the applied approach. A surge in interest in population-based optimization methodologies has spawned a plethora of new and improved approaches to a wide range of engineering problems. Optimizing test suites is a combinatorial testing challenge that has been demonstrated to be an extremely difficult combinatorial optimization limitation of the research. The authors have proposed an almost infallible method for selecting combinatorial test cases. It uses a hybrid whale–gray wol

... Show More
View Publication
Scopus (11)
Crossref (6)
Scopus Clarivate Crossref
Publication Date
Thu Jun 01 2023
Journal Name
Iaes International Journal Of Artificial Intelligence (ij-ai)
Innovations in t-way test creation based on a hybrid hill climbing-greedy algorithm
...Show More Authors

<p>In combinatorial testing development, the fabrication of covering arrays is the key challenge by the multiple aspects that influence it. A wide range of combinatorial problems can be solved using metaheuristic and greedy techniques. Combining the greedy technique utilizing a metaheuristic search technique like hill climbing (HC), can produce feasible results for combinatorial tests. Methods based on metaheuristics are used to deal with tuples that may be left after redundancy using greedy strategies; then the result utilization is assured to be near-optimal using a metaheuristic algorithm. As a result, the use of both greedy and HC algorithms in a single test generation system is a good candidate if constructed correctly. T

... Show More
View Publication
Scopus (5)
Crossref (5)
Scopus Crossref
Publication Date
Wed Sep 05 2007
Journal Name
Neural Network World
A canonical generic algorithm for likelihood estimator of first order moving average model parameter
...Show More Authors

The increasing availability of computing power in the past two decades has been use to develop new techniques for optimizing solution of estimation problem. Today's computational capacity and the widespread availability of computers have enabled development of new generation of intelligent computing techniques, such as our interest algorithm, this paper presents one of new class of stochastic search algorithm (known as Canonical Genetic' Algorithm ‘CGA’) for optimizing the maximum likelihood function strategy is composed of three main steps: recombination, mutation, and selection. The experimental design is based on simulating the CGA with different values of are compared with those of moment method. Based on MSE value obtained from bot

... Show More
Scopus (3)
Scopus
Publication Date
Wed Nov 16 2016
Journal Name
Eurasip Journal On Wireless Communications And Networking
Evaluation of efficient vehicular ad hoc networks based on a maximum distance routing algorithm
...Show More Authors

Traffic management at road intersections is a complex requirement that has been an important topic of research and discussion. Solutions have been primarily focused on using vehicular ad hoc networks (VANETs). Key issues in VANETs are high mobility, restriction of road setup, frequent topology variations, failed network links, and timely communication of data, which make the routing of packets to a particular destination problematic. To address these issues, a new dependable routing algorithm is proposed, which utilizes a wireless communication system between vehicles in urban vehicular networks. This routing is position-based, known as the maximum distance on-demand routing algorithm (MDORA). It aims to find an optimal route on a hop-by-ho

... Show More
View Publication Preview PDF
Scopus (27)
Crossref (19)
Scopus Clarivate Crossref
Publication Date
Fri Jan 01 2021
Journal Name
Journal Of Engineering
A Proposed Adaptive Bitrate Scheme Based on Bandwidth Prediction Algorithm for Smoothly Video Streaming
...Show More Authors

A robust video-bitrate adaptive scheme at client-aspect plays a significant role in keeping a good quality of video streaming technology experience. Video quality affects the amount of time the video has turned off playing due to the unfilled buffer state. Therefore to maintain a video streaming continuously with smooth bandwidth fluctuation, a video buffer structure based on adapting the video bitrate is considered in this work. Initially, the video buffer structure is formulated as an optimal control-theoretic problem that combines both video bitrate and video buffer feedback signals. While protecting the video buffer occupancy from exceeding the limited operating level can provide continuous video str

... Show More
View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Mon Jan 01 2024
Journal Name
Fifth International Conference On Applied Sciences: Icas2023
A modified Mobilenetv2 architecture for fire detection systems in open areas by deep learning
...Show More Authors

This research describes a new model inspired by Mobilenetv2 that was trained on a very diverse dataset. The goal is to enable fire detection in open areas to replace physical sensor-based fire detectors and reduce false alarms of fires, to achieve the lowest losses in open areas via deep learning. A diverse fire dataset was created that combines images and videos from several sources. In addition, another self-made data set was taken from the farms of the holy shrine of Al-Hussainiya in the city of Karbala. After that, the model was trained with the collected dataset. The test accuracy of the fire dataset that was trained with the new model reached 98.87%.

Scopus Crossref
Publication Date
Wed Sep 15 2021
Journal Name
2021 International Conference On Computing And Communications Applications And Technologies (i3cat)
Parallel Hybrid String Matching Algorithm Using CUDA API Function
...Show More Authors

View Publication
Scopus Crossref
Publication Date
Sun Oct 01 2017
Journal Name
International Journal Of Scientific & Engineering Research
Horizontal Fragmentation for Most Frequency Frequent Pattern Growth Algorithm
...Show More Authors

Abstract: Data mining is become very important at the present time, especially with the increase in the area of information it's became huge, so it was necessary to use data mining to contain them and using them, one of the data mining techniques are association rules here using the Pattern Growth method kind enhancer for the apriori. The pattern growth method depends on fp-tree structure, this paper presents modify of fp-tree algorithm called HFMFFP-Growth by divided dataset and for each part take most frequent item in fp-tree so final nodes for conditional tree less than the original fp-tree. And less memory space and time.

View Publication Preview PDF
Publication Date
Wed Nov 20 2019
Journal Name
Proceedings Of The 2019 3rd International Conference On Big Data Research
Pressure Vessel Design Simulation Using Hybrid Harmony Search Algorithm
...Show More Authors

View Publication
Scopus (2)
Scopus Crossref