To get access into the orbital floor 3 paths are commonly used which are transconjunctival, subciliary and subtarsal approaches. Each one of these approaches has its advantages and disadvantages. The study assessed the outcomes of the transconjunctival retroseptal approach, which reflects our experience in this type of surgery. Along 8 years, 26 patients received in the emergency room diagnosed with pure isolated orbital floor fractures, all of them admitted to the maxillofacial surgery department and approached by transconjunctival incision without lateral canthotomy. Three types of complications occurred: laceration of the lower eyelid, injury to the lacrimal system and entropion. All of these complications were managed accordingly with n

Background and objectives: Whether to use a cold scalpel or laser surgery to remove a lesion in the skin of the craniofacial area is the main question the surgeon asks him- or herself to do. The study tried to extend the literature with data that may help the surgeons to choose the right method. Methods: Thirty patients with intra- and extraoral craniofacial skin lesions managed by Carbone dioxide (CO2) laser surgery. Results: The most common type of lesion treated was melanocytic nevi (15 patients; 50%). Conclusion: The main complication of CO2 laser surgery is the remaining permanent hypopigmentation of the treated area; however, the CO2 laser has many advantages (especially at the time of surgery) making it a good choice for the manageme

Background: Background: Helicobacter pylori is an important gastrointestinal bacteria related to the development of  superficial atrophic gastritis, peptic ulcer and gastric cancer. Human leukocyte antigens (HLA) may play an important roles in host immune responses to H pylori antigens.

Aim of the study: to investigate the association between HLA-DRB1 genotypes and superficial gastritis with H. pylori infection in an Iraqi patients.

Patients and methods: Sixty patients with superficial gastritis and 100 individuals with apparently normal results after endoscopic examination were recruited from Al-Kindy Teaching Hospital - G

The involvement of maxillofacial tissues in SARS‐CoV‐2 infections ranges from mild dysgeusia to life‐threatening tissue necrosis, as seen in SARS‐CoV‐2‐associated mucormycosis. Angiotensin‐converting enzyme 2 (ACE2) which functions as a receptor for SARS‐CoV‐2 was reported in the epithelial surfaces of the oral and nasal cavities; however, a complete understanding of the expression patterns in deep oral and maxillofacial tissues is still lacking.

In this paper, the main work is to minimize a function of three cost criteria for scheduling n jobs on a single machine. We proposed algorithms to solve the single machine scheduling multiobjective problem. In this problem, we consider minimizing the total completion times, total tardiness and maximum tardiness criteria. First a branch and bound (BAB) algorithm is applied for the 1//∑Ci+∑Ti+Tmax problem. Second we compare two multiobjective algorithms one of them based on (BAB) algorithm to find the set of efficient (non dominated) solutions for the 1//(∑Ci ,∑Ti ,Tmax) problem. The computational results show that the algorithm based on (BAB) algorithm is better than the other one for generated the total number of

Total protein and total fucose were determined in sera of thyroid

disorder patients.

Sera of (40) diagnosed by consultant hyperthyroidism, and 40 hypothyroidism  were analyzed  for  the above  parameter  for  control, sera of (40) normal individuals were used.

They   were   healthy   with    no  appearing   disorder   results   analysis revealed  no significant  differences  (P<0.05)  in  the (mean  Â±SD)  of total   protein   values  in   sera  of   hyper  and   hypothyroidism   were compared

     In this paper, the bi-criteria machine scheduling problems (BMSP) are solved, where the discussed problem is represented by the sum of completion and the sum of late work times  simultaneously. In order to solve the suggested BMSP, some metaheurisitc methods are suggested which produce good results. The suggested local search methods are simulated annulling and bees algorithm. The results of the new metaheurisitc methods are compared with the complete enumeration method, which is considered an exact method, then compared results of the heuristics with each other to obtain the most efficient method.

Machine scheduling problems (MSP) are     considered as one of the most important classes of combinatorial optimization problems. In this paper, the problem of job scheduling on a single machine is studied to minimize the multiobjective and multiobjective objective function. This objective function is: total completion time, total lead time and maximum tardiness time, respectively, which are formulated as  are formulated. In this study, a mathematical model is created to solve the research problem. This problem can be divided into several sub-problems and simple algorithms have been found to find the solutions to these sub-problems and compare them with efficient solutions. For this problem, some rules that provide efficient solutio

Within this research, The problem of scheduling jobs on a single machine is the subject of study to minimize the multi-criteria and multi-objective functions. The first problem, minimizing the multi-criteria, which include Total Completion Time, Total Late Work, and Maximum Earliness Time (∑𝐶𝑗, ∑𝑉𝑗, 𝐸𝑚𝑎𝑥), and the second problem, minimizing the multi-objective functions ∑𝐶𝑗 + ∑𝑉𝑗 +𝐸𝑚𝑎𝑥 are the problems at hand in this paper. In this study, a mathematical model is created to address the research problems, and some rules provide efficient (optimal) solutions to these problems. It has also been proven that each optimal solution for ∑𝐶𝑗 + ∑𝑉𝑗 + 𝐸𝑚𝑎𝑥 is an effic