Preferred Language
Articles
/
sObqKJ4BmraWrQ4dJ166
Arrhythmia Recognition Algorithm Using Squared Krawtchouk-Tchebichef Polynomial-Based Feature Extraction
...Show More Authors

Scopus Crossref
View Publication
Publication Date
Mon Jul 01 2024
Journal Name
Journal Of Engineering
IoT-Based Low-Cost Smart Health Monitoring System using Raspberry Pi Pico W and Blynk Application
...Show More Authors

في السنوات الأخيرة، أدى التقدم التكنولوجي في إنترنت الأشياء (IoT) وأجهزة الاستشعار الذكية إلى فتح اتجاهات جديدة وإعطاء حلول عملية في مختلف قطاعات الحياة. يتم التعرف على إنترنت الأشياء كتنولوجيا حديثة تربط بين مختلف انواع الشبكات. تم تحسين أنواع مختلفة من قطاعات الرعاية الصحية في المجال الطبي بناءً على هذه التكنولوجيا. أحد هذه القطاعات الهامة هو نظام مراقبة الصحة (HMS). تعتبر مراقبة المريض عن بعد لاسلكيًا وبت

... Show More
View Publication
Scopus (10)
Crossref (5)
Scopus Crossref
Publication Date
Sun Dec 30 2012
Journal Name
Al-kindy College Medical Journal
Initial Recognition and Prophecy of Diabetic Nephropathy in Type I Diabetes in a Sample of Iraqi Patients
...Show More Authors

Back ground: Diabetic nephropathy is rapidly becoming the leading cause of end-stage renal disease (ESRD). The onset and course of DN can be ameliorated to a very significant degree if intervention institutes at a point very early in the course of the development of this complication.
Objective: The aim of this study was to characterize risk factors associated with nephropathy in type I diabetes and construct a module for early prediction of diabetic nephropathy (DN) by analyzing their risk factors.
Methods: Case control design of 400 patients with type I diabetes mellitus (IDDM), aged 19-45 years. The cases were 200 diabetic patients with overt protein urea while the controls were 200 diabetic patients with no protein urea or micr

... Show More
View Publication Preview PDF
Publication Date
Tue Jan 01 2019
Journal Name
Ieee Access
Intelligent EMG Pattern Recognition Control Method for Upper-Limb Multifunctional Prostheses: Advances, Current Challenges, and Future Prospects
...Show More Authors

View Publication
Scopus (165)
Crossref (163)
Scopus Clarivate Crossref
Publication Date
Mon May 01 2017
Journal Name
2017 5th International Conference On Information And Communication Technology (icoic7)
Analysis of the number of ants in ant colony system algorithm
...Show More Authors

View Publication
Scopus (29)
Crossref (14)
Scopus Crossref
Publication Date
Mon Sep 30 2013
Journal Name
International Journal Of Network Security & Its Applications
Evaluating the Performance of the Secure Block Permutation Image Steganography Algorithm
...Show More Authors

Recently, a new secure steganography algorithm has been proposed, namely, the secure Block Permutation Image Steganography (BPIS) algorithm. The new algorithm consists of five main steps, these are: convert the secret message to a binary sequence, divide the binary sequence into blocks, permute each block using a key-based randomly generated permutation, concatenate the permuted blocks forming a permuted binary sequence, and then utilize a plane-based Least-Significant-Bit (LSB) approach to embed the permuted binary sequence into BMP image file format. The performance of algorithm was given a preliminary evaluation through estimating the PSNR (Peak Signal-to-Noise Ratio) of the stego image for limited number of experiments comprised hiding

... Show More
View Publication Preview PDF
Crossref
Publication Date
Thu Jan 20 2022
Journal Name
Webology
Red Monkey Optimization and Genetic Algorithm to Solving Berth Allocation Problems
...Show More Authors

In the past two decades, maritime transport traffic has increased, especially in the case of container flow. The BAP (Berth Allocation Problem) (BAP) is a main problem to optimize the port terminals. The current manuscript explains the DBAP problems in a typical arrangement that varies from the conventional separate design station, where each berth can simultaneously accommodate several ships when their entire length is less or equal to length. Be a pier, serve. This problem was then solved by crossing the Red Colobuses Monkey Optimization (RCM) with the Genetic Algorithm (GA). In conclusion, the comparison and the computational experiments are approached to demonstrate the effectiveness of the proposed method contrasted with other

... Show More
View Publication Preview PDF
Crossref (3)
Crossref
Publication Date
Wed Oct 12 2022
Journal Name
Axioms
Razy: A String Matching Algorithm for Automatic Analysis of Pathological Reports
...Show More Authors

Pathology reports are necessary for specialists to make an appropriate diagnosis of diseases in general and blood diseases in particular. Therefore, specialists check blood cells and other blood details. Thus, to diagnose a disease, specialists must analyze the factors of the patient’s blood and medical history. Generally, doctors have tended to use intelligent agents to help them with CBC analysis. However, these agents need analytical tools to extract the parameters (CBC parameters) employed in the prediction of the development of life-threatening bacteremia and offer prognostic data. Therefore, this paper proposes an enhancement to the Rabin–Karp algorithm and then mixes it with the fuzzy ratio to make this algorithm suitable

... Show More
View Publication
Scopus (3)
Crossref (1)
Scopus Clarivate Crossref
Publication Date
Sun Dec 01 2019
Journal Name
Applied Soft Computing
A new evolutionary multi-objective community mining algorithm for signed networks
...Show More Authors

View Publication
Scopus (8)
Crossref (6)
Scopus Clarivate Crossref
Publication Date
Tue Oct 16 2018
Journal Name
Springer Science And Business Media Llc
MOGSABAT: a metaheuristic hybrid algorithm for solving multi-objective optimisation problems
...Show More Authors

Scopus (68)
Crossref (51)
Scopus Clarivate Crossref
Publication Date
Wed May 10 2023
Journal Name
Journal Of Engineering
A Proposal Algorithm to Solve Delay Constraint Least Cost Optimization Problem
...Show More Authors

Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).

View Publication Preview PDF
Crossref (2)
Crossref