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)
TThe property of 134−140Neodymium nuclei have been studied in framework Interacting Boson Model (IBM) and a new method called New Empirical Formula (NEF). The energy positive parity bands of 134−140Nd have been calculated using (IBM) and (NEF) while the negative parity bands of 134−140Nd have been calculated using (NEF) only. The E-GOS curve as a function of the spin (I) has been drawn to determine the property of the positive parity yrast band. The parameters of the best fit to the measured data are determined. The reduced transition probabilities of these nuclei was calculated. The critical point has been determined for 140Nd isotope. The potential energy surfaces (PESs) to the IBM Hamiltonian have been obtained using the intrin
... Show MoreObjectives. The current study aimed to predict the combined mesiodistal crown widths of maxillary and mandibular canines and premolars from the combined mesiodistal crown widths of maxillary and mandibular incisors and first molars. Materials and Methods. This retrospective study utilized 120 dental models from Iraqi Arab young adult subjects with normal dental relationships. The mesiodistal crown widths of all teeth (except the second molars) were measured at the level of contact points using digital electronic calipers. The relation between the sum mesiodistal crown widths of the maxillary and mandibular incisors and first molars and the combined mesiodistal crown widths of the maxillary and mandibular canines and premolars was as
... Show MoreThis study aims to demonstrate the role of artificial intelligence and metaverse techniques, mainly logistical Regression, in reducing earnings management in Iraqi private banks. Synthetic intelligence approaches have shown the capability to detect irregularities in financial statements and mitigate the practice of earnings management. In contrast, many privately owned banks in Iraq historically relied on manual processes involving pen and paper for recording and posting financial information in their accounting records. However, the banking sector in Iraq has undergone technological advancements, leading to the Automation of most banking operations. Conventional audit techniques have become outdated due to factors such as the accuracy of d
... Show MoreComputer 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 MoreIn 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 MoreThe 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