Preferred Language
Articles
/
nRc9Po4BVTCNdQwCND5r
Art Image Compression Based on Lossless LZW Hashing Ciphering Algorithm
...Show More Authors
Abstract<p>Color image compression is a good way to encode digital images by decreasing the number of bits wanted to supply the image. The main objective is to reduce storage space, reduce transportation costs and maintain good quality. In current research work, a simple effective methodology is proposed for the purpose of compressing color art digital images and obtaining a low bit rate by compressing the matrix resulting from the scalar quantization process (reducing the number of bits from 24 to 8 bits) using displacement coding and then compressing the remainder using the Mabel ZF algorithm Welch LZW. The proposed methodology maintains the quality of the reconstructed image. Macroscopic and quantitative experimental results on technical color images show that the proposed methodology gives reconstructed images with a high PSNR value compared to standard image compression techniques.</p>
Scopus Crossref
View Publication
Publication Date
Sat Feb 11 2023
Journal Name
Applied Sciences
A Preliminary Study and Implementing Algorithm Using Finite State Automaton for Remote Identification of Drones
...Show More Authors

Electronic remote identification (ER-ID) is a new radio frequency (RF) technology that is initiated by the Federal Aviation Authorities (FAA). For security reasons, traffic control, and so on, ER-ID has been applied for drones by the FAA to enable them to transmit their unique identification and location so that unauthorized drones can be identified. The current limitation of the existing ER-ID algorithms is that the application is limited to the Wi-Fi and Bluetooth wireless controllers, which results in a maximum range of 10–20 m for Bluetooth and 50–100 m for Wi-Fi. In this study, a mathematical computing technique based on finite state automaton (FSA) is introduced to expand the range of the ER-ID RF system and reduce the ene

... Show More
View Publication
Scopus (5)
Crossref (6)
Scopus Clarivate Crossref
Publication Date
Thu Aug 31 2017
Journal Name
Journal Of Engineering
Optimum Dimensions of Hydraulic Structures and Foundation Using Genetic Algorithm coupled with Artificial Neural Network
...Show More Authors

      A model using the artificial neural networks and genetic algorithm technique is developed for obtaining optimum dimensions of the foundation length and protections of small hydraulic structures. The procedure involves optimizing an objective function comprising a weighted summation of the state variables. The decision variables considered in the optimization are the upstream and downstream cutoffs lengths and their angles of inclination, the foundation length, and the length of the downstream soil protection. These were obtained for a given maximum difference in head, depth of impervious layer and degree of anisotropy. The optimization carried out is subjected to constraints that ensure a safe structure aga

... Show More
View Publication Preview PDF
Publication Date
Sat Dec 01 2018
Journal Name
Applied Soft Computing
A new evolutionary algorithm with locally assisted heuristic for complex detection in protein interaction networks
...Show More Authors

View Publication
Scopus (14)
Crossref (8)
Scopus Clarivate Crossref
Publication Date
Thu Dec 05 2019
Journal Name
Advances In Intelligent Systems And Computing
An Enhanced Evolutionary Algorithm for Detecting Complexes in Protein Interaction Networks with Heuristic Biological Operator
...Show More Authors

View Publication
Scopus (8)
Crossref (2)
Scopus Clarivate Crossref
Publication Date
Sun Jan 01 2023
Journal Name
Aip Conference Proceedings
Using the artificial TABU algorithm to estimate the semi-parametric regression function with measurement errors
...Show More Authors

Artificial Intelligence Algorithms have been used in recent years in many scientific fields. We suggest employing artificial TABU algorithm to find the best estimate of the semi-parametric regression function with measurement errors in the explanatory variables and the dependent variable, where measurement errors appear frequently in fields such as sport, chemistry, biological sciences, medicine, and epidemiological studies, rather than an exact measurement.

Scopus Crossref
Publication Date
Sun Mar 01 2020
Journal Name
Computer Networks
An improved multi-objective evolutionary algorithm for detecting communities in complex networks with graphlet measure
...Show More Authors

View Publication
Scopus (8)
Crossref (5)
Scopus Clarivate 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
Mon Jan 01 2018
Journal Name
Internet And Distributed Computing Systems
A Proposed Adaptive Rate Algorithm to Administrate the Video Buffer Occupancy for Smooth Video Streaming
...Show More Authors

View Publication
Scopus Clarivate Crossref
Publication Date
Sun Sep 01 2019
Journal Name
Baghdad Science Journal
Common Fixed Point of a Finite-step Iteration Algorithm Under Total Asymptotically Quasi-nonexpansive Maps
...Show More Authors

      Throughout this paper, a generic iteration algorithm for a finite family of total asymptotically quasi-nonexpansive maps in uniformly convex Banach space is suggested. As well as weak / strong convergence theorems of this algorithm to a common fixed point are established. Finally, illustrative numerical example by using Matlab is presented.

View Publication Preview PDF
Scopus (14)
Crossref (3)
Scopus Clarivate Crossref
Publication Date
Sun Jul 01 2012
Journal Name
2012 International Symposium On Innovations In Intelligent Systems And Applications
Edge detection for fast block-matching motion estimation to enhance Mean Predictive Block Matching algorithm
...Show More Authors

View Publication
Scopus (5)
Crossref (3)
Scopus Crossref