Preferred Language
Articles
/
xhedJZIBVTCNdQwCEJ6q
Solving tri-criteria: total completion time, total late work, and maximum earliness by using exact, and heuristic methods on single machine scheduling problem
...Show More Authors

The presented study investigated the scheduling regarding  jobs on a single machine. Each  job will be processed with no interruptions and becomes available for the processing at time 0. The aim is finding a processing order with regard to jobs, minimizing total completion time , total late work , and maximal tardiness  which is an NP-hard problem. In the theoretical part of the present work, the mathematical formula for the examined problem will be presented, and a sub-problem of the original problem of minimizing the multi-objective functions  is introduced. Also, then the importance regarding the dominance rule (DR) that could be applied to the problem to improve good solutions will be shown. While in the practical part, two exact methods are important; a Branch and Bound algorithm (BAB) and a complete enumeration (CEM) method are applied to solve the three proposed MSP criteria by finding a set of efficient solutions. The experimental results showed that CEM can solve problems for up to  jobs. Two approaches of the BAB method were applied: the first approach was BAB without dominance rule (DR), and the BAB method used dominance rules to reduce the number of sequences that need to be considered. Also, this method can solve problems for up to , and the second approach BAB with dominance rule (DR), can solve problems for up to  jobs in a reasonable time to find efficient solutions to this problem. In addition, to find good approximate solutions, two heuristic methods for solving the problem are proposed, the first heuristic method can solve up to  jobs, while the second heuristic method can solve up to  jobs. Practical experiments prove the good performance regarding the two suggested approaches for the original problem. While for a sub-problem the experimental results showed that CEM can solve problems for up to  jobs, the BAB without dominance rule (DR) can solve problems for up to , and the second approach BAB with dominance rule (DR), can solve problems for up to  jobs in a reasonable time to find efficient solutions to this problem. Finally, the heuristic method can solve up to jobs. Arithmetic results are calculated by coding (programming) algorithms using (MATLAB 2019a)  

Scopus Crossref
View Publication
Publication Date
Tue Jan 01 2019
Journal Name
Desalination And Water Treatment
Xylenol orange removal from aqueous solution by natural bauxite (BXT) and BXT-HDTMA: kinetic, thermodynamic and isotherm modeling
...Show More Authors

View Publication
Scopus (10)
Crossref (6)
Scopus Clarivate Crossref
Publication Date
Tue Jan 01 2019
Journal Name
Desalination And Water Treatment
Xylenol orange removal from aqueous solution by natural bauxite (BXT) and BXT-HDTMA: kinetic, thermodynamic and isotherm modeling
...Show More Authors

Preview PDF
Scopus (10)
Crossref (6)
Scopus Clarivate Crossref
Publication Date
Mon Jan 01 2018
Journal Name
The Journal Of Contemporary Dental Practice
The Relationship Between Orthodontic Force Applied by Monoblock and Salivary Levels of Alkaline Phosphatase and Lactate Dehydrogenase Enzymes
...Show More Authors

Aim: The current study was aimed to determine the relationship between the orthodontic force applied by monobloc and the salivary level of alkaline phosphatase (ALP) and lactate dehydrogenase (LDH) enzymes, considering the time factor after insertion of the appliance and whether there is a correlation between these enzymes. Materials and methods: A sample of 28 growing patients requiring orthodontic treatment with myofunctional appliance (Monoblock) was taken for the current study with an age range 9 to 12 years,all patients had Angle's class II division 1 malocclusion with no or mild crowding, the sample was selected using simple random sampling. Only 16 subjects (10 males and 6 females) were included who follow certain inclusion criteria.

... Show More
View Publication Preview PDF
Scopus (4)
Crossref (4)
Scopus Crossref
Publication Date
Sat Oct 01 2016
Journal Name
2016 6th International Conference On Information Communication And Management (icicm)
Enhancing case-based reasoning retrieval using classification based on associations
...Show More Authors

View Publication
Scopus (4)
Crossref (2)
Scopus Crossref
Publication Date
Tue Feb 01 2022
Journal Name
Svu-international Journal Of Engineering Sciences And Applications
Water Quality Detection using cost-effective sensors based on IoT
...Show More Authors

Crossref (1)
Crossref
Publication Date
Tue Jan 01 2013
Journal Name
Thesis
User Authentication Based on Keystroke Dynamics Using Artificial Neural Networks
...Show More Authors

Computer systems and networks are being used in almost every aspect of our daily life, the security threats to computers and networks have increased significantly. Usually, password-based user authentication is used to authenticate the legitimate user. However, this method has many gaps such as password sharing, brute force attack, dictionary attack and guessing. Keystroke dynamics is one of the famous and inexpensive behavioral biometric technologies, which authenticate a user based on the analysis of his/her typing rhythm. In this way, intrusion becomes more difficult because the password as well as the typing speed must match with the correct keystroke patterns. This thesis considers static keystroke dynamics as a transparent layer of t

... Show More
Publication Date
Sat May 01 2021
Journal Name
Journal Of Physics: Conference Series
Image Steganography using Dynamic Threshold based on Discrete Cosine Transform
...Show More Authors

The art of preventing the detection of hidden information messages is the way that steganography work. Several algorithms have been proposed for steganographic techniques. A major portion of these algorithms is specified for image steganography because the image has a high level of redundancy. This paper proposed an image steganography technique using a dynamic threshold produced by the discrete cosine coefficient. After dividing the green and blue channel of the cover image into 1*3-pixel blocks, check if any bits of green channel block less or equal to threshold then start to store the secret bits in blue channel block, and to increase the security not all bits in the chosen block used to store the secret bits. Firstly, store in the cente

... Show More
View Publication Preview PDF
Scopus (6)
Crossref (4)
Scopus Crossref
Publication Date
Sun Apr 01 2018
Journal Name
International Journal Of Electrical And Computer Engineering (ijece)
Information Hiding using LSB Technique based on Developed PSO Algorithm
...Show More Authors

<p>Generally, The sending process of secret information via the transmission channel or any carrier medium is not secured. For this reason, the techniques of information hiding are needed. Therefore, steganography must take place before transmission. To embed a secret message at optimal positions of the cover image under spatial domain, using the developed particle swarm optimization algorithm (Dev.-PSO) to do that purpose in this paper based on Least Significant Bits (LSB) using LSB substitution. The main aim of (Dev. -PSO) algorithm is determining an optimal paths to reach a required goals in the specified search space based on disposal of them, using (Dev.-PSO) algorithm produces the paths of a required goals with most effi

... Show More
View Publication
Scopus (17)
Crossref (3)
Scopus Crossref
Publication Date
Sun Jan 10 2016
Journal Name
British Journal Of Applied Science &amp; Technology
Robust Watermarking for Video Using Modulation Technique on RGB Domain
...Show More Authors

In this paper, a robust invisible watermarking system for digital video encoded by MPEG-4 is presented. The proposed scheme provides watermark hidden by embedding a secret message (watermark) in the sprite area allocated in reference frame (I-frame). The proposed system consists of two main units: (i) Embedding unit and (ii) Extraction unit. In the embedding unit, the system allocates the sprite blocks using motion compensation information. The allocated sprite area in each I–frame is used as hosting area for embedding watermark data. In the extraction unit, the system extracts the watermark data in order to check authentication and ownership of the video. The watermark data embedding method is Blocks average modulation applied on RGB dom

... Show More
View Publication Preview PDF
Crossref
Publication Date
Fri May 01 2020
Journal Name
Journal Of Engineering
Parametric Study on Unconnected Piled Raft Foundation Using Numerical Modelling
...Show More Authors

Piled raft is commonly used as foundation for high rise buildings. The design concept of piled raft foundation is to minimize the number of piles, and to utilize the entire bearing capacity. High axial stresses are therefore, concentrated at the region of connection between the piles and raft. Recently, an alternative technique is proposed to disconnect the piles from the raft in a so called unconnected piled raft (UCPR) foundation, in which a compacted soil layer (cushion) beneath the raft, is usually introduced.  The piles of the new system are considered as reinforcement members for the subsoil rather than as structural members. In the current study, the behavior of unconnected piled rafts systems has been studie

... Show More
View Publication Preview PDF
Crossref (9)
Crossref