Staff Portal
Iehab AbdulJabbar Kamil (Lecturer)

PhD in Information Technology
Lecturer
Information Technology - Computer Sciences and IT
iehab.a.k@uoanbar.edu.iq

ScopusGoogle ScholarResearch GateORCIDPublonsFacebook


Biography

<p>Born in Iraq, Baghdad, 11-11-1976, he obtained a bachelor&rsquo;s degree from Al-Rafidain University College in computer science. He holds a master&#39;s degree from Belarusian State University of Informatics and Radioelectronics in Computer Science - Information Security. He obtained a doctorate from Tomsk State University (Russian Federation). He is fluent in English and Russian. He worked as an employee in the Ministry of Science and Technology, Iraq - Baghdad. He worked as an assistant lecturer at Saratov State University. He currently works as a lecturer at Anbar University, Department of Information Systems, and has more than 10 research papers in national and international conferences. His area of interest is Fault Tolerance, Real-Time System and Computer security.</p>

Publication

<table cellspacing="0" class="MsoTableGrid" style="border-collapse:collapse; border:none; width:656px"> <tbody> <tr> <td style="border-bottom:1px solid black; border-left:1px solid black; border-right:1px solid black; border-top:1px solid black; height:62px; vertical-align:top; width:126px"> <p style="text-align:center"><span style="font-size:11pt"><span style="font-family:Calibri,sans-serif"><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">2013</span></span></span></span></p> </td> <td style="border-bottom:1px solid black; border-left:none; border-right:1px solid black; border-top:1px solid black; height:62px; vertical-align:top; width:530px"> <p style="text-align:justify"><span style="font-size:11pt"><span style="font-family:Calibri,sans-serif"><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">Kamil Iehab Abduljabbar Kamil, Lynkov L.M., Nasonova&nbsp; N.V. Analysis of jammers application for information security purposes&nbsp; // proceedings of XVIII International Scientific &ndash;Technical Conference &ldquo;Modern Communications Facilities&rdquo;. &ndash; Minsk, 2013. &ndash; Pp.177-178.</span></span></span></span></p> </td> </tr> <tr> <td style="border-bottom:1px solid black; border-left:1px solid black; border-right:1px solid black; border-top:none; height:93px; vertical-align:top; width:126px"> <p style="text-align:center"><span style="font-size:11pt"><span style="font-family:Calibri,sans-serif"><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">2013</span></span></span></span></p> </td> <td style="border-bottom:1px solid black; border-left:none; border-right:1px solid black; border-top:none; height:93px; vertical-align:top; width:530px"> <p><span style="font-size:11pt"><span style="font-family:Calibri,sans-serif"><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">Kamil, Iehab Abduljabbar Kamil.&nbsp; Means of individual protection against EMR of information processing equipment and EM jammers / Kamil Iehab Abduljabbar Kamil, Belousova E.S., Allabad H.M., etc // XI&nbsp; Belarusian-Russian Scientific-Technical Conference &ldquo;Technical Means Of Information Security&rdquo; &ndash; Minsk, BSUIR, 2013. &ndash; P.57</span></span></span></span></p> </td> </tr> <tr> <td style="border-bottom:1px solid black; border-left:1px solid black; border-right:1px solid black; border-top:none; height:62px; vertical-align:top; width:126px"> <p style="text-align:center"><span style="font-size:11pt"><span style="font-family:Calibri,sans-serif"><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">2015</span></span></span></span></p> </td> <td style="border-bottom:1px solid black; border-left:none; border-right:1px solid black; border-top:none; height:62px; vertical-align:top; width:530px"> <p><span style="font-size:11pt"><span style="font-family:Calibri,sans-serif"><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">Kamil I.A.K. Information security for SCADA systems / I. A. K. Kamil, N. Nasonova // Technical means of information security: Abstracts of the XIII Belarusian Russian Scientific and Technical Conference. Minsk, Republic of Belarus, June 04-05, 2015. Minsk: BSUIR, 2015. P. 22</span></span></span></span></p> </td> </tr> <tr> <td style="border-bottom:1px solid black; border-left:1px solid black; border-right:1px solid black; border-top:none; height:59px; vertical-align:top; width:126px"> <p style="text-align:center"><span style="font-size:11pt"><span style="font-family:Calibri,sans-serif"><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">2017</span></span></span></span></p> <p style="text-align:center">&nbsp;</p> </td> <td style="border-bottom:1px solid black; border-left:none; border-right:1px solid black; border-top:none; height:59px; vertical-align:top; width:530px"> <p style="text-align:justify"><span style="font-size:11pt"><span style="font-family:Calibri,sans-serif"><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">Abrosimov M. Increasing SCADA System Availability by Fault Tolerance Techniques / M. Abrosimov, I. A. Kamil, H. Mahajan // 2017 International Conference 105 on Computing, Communication, Control and Automation (ICCUBEA), PUNE, India, 2017. &ndash;&ndash; P. 461&ndash;&ndash;466.</span></span></span></span></p> </td> </tr> <tr> <td style="border-bottom:1px solid black; border-left:1px solid black; border-right:1px solid black; border-top:none; height:62px; vertical-align:top; width:126px"> <p style="text-align:center"><span style="font-size:11pt"><span style="font-family:Calibri,sans-serif"><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">2017</span></span></span></span></p> </td> <td style="border-bottom:1px solid black; border-left:none; border-right:1px solid black; border-top:none; height:62px; vertical-align:top; width:530px"> <p><span style="font-size:11pt"><span style="font-family:Calibri,sans-serif"><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">Kamil I.A.K. Design and development complex safety SCADA systems / I. A. K. Kamil, M. B. Abrosimov // Technical means of information security: Abstracts of the XV Belarusian Russian Scientific and Technical Conference. Minsk, Republic of Belarus, June 06, 2017. Minsk: BSUIR, 2017. P. 77</span></span></span></span></p> </td> </tr> <tr> <td style="border-bottom:1px solid black; border-left:1px solid black; border-right:1px solid black; border-top:none; height:59px; vertical-align:top; width:126px"> <p style="text-align:center"><span style="font-size:11pt"><span style="font-family:Calibri,sans-serif"><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">2018</span></span></span></span></p> </td> <td style="border-bottom:1px solid black; border-left:none; border-right:1px solid black; border-top:none; height:59px; vertical-align:top; width:530px"> <p style="text-align:justify"><span style="font-size:11pt"><span style="font-family:Calibri,sans-serif"><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">Abrosimov M.B. Development of an intrusion prevention system using parallel programming and a fault tolerance system / M. B. Abrosimov, I. A. K. Kamil // Security of Information Technologies. 2018. V. 25, No. 1. S. 65 73.</span></span></span></span></p> <p>&nbsp;</p> </td> </tr> <tr> <td style="border-bottom:1px solid black; border-left:1px solid black; border-right:1px solid black; border-top:none; height:62px; vertical-align:top; width:126px"> <p style="text-align:center"><span style="font-size:11pt"><span style="font-family:Calibri,sans-serif"><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">2018</span></span></span></span></p> </td> <td style="border-bottom:1px solid black; border-left:none; border-right:1px solid black; border-top:none; height:62px; vertical-align:top; width:530px"> <p><span style="font-size:11pt"><span style="font-family:Calibri,sans-serif"><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">Kamil I.A.K. On the issue of parallel algorithms for constructing minimal vertex and edge 1 extensions of graphs / I. A. K. Kamil, Kh. Kh. K. Sudani, M. B. Abrosimov // Computer science and information technology: materials of the International scientific conf. Saratov: Publishing house. Center &quot;Nauka&quot;, 2018. S. 173 176</span></span></span></span></p> </td> </tr> <tr> <td style="border-bottom:1px solid black; border-left:1px solid black; border-right:1px solid black; border-top:none; height:59px; vertical-align:top; width:126px"> <p style="text-align:center"><span style="font-size:11pt"><span style="font-family:Calibri,sans-serif"><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">2018</span></span></span></span></p> </td> <td style="border-bottom:1px solid black; border-left:none; border-right:1px solid black; border-top:none; height:59px; vertical-align:top; width:530px"> <p style="text-align:justify"><span style="font-size:11pt"><span style="font-family:Calibri,sans-serif">&nbsp;<span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">Kamil I.A.K. Ensuring fault tolerance of a high-performance parallel computing node with a message passing interface (MPI) // Modern Science: Actual Problems of Theory and Practice: Natural and Technical Sciences Series. 2018. No. 4. S. 57 59. </span></span></span></span></p> </td> </tr> <tr> <td style="border-bottom:1px solid black; border-left:1px solid black; border-right:1px solid black; border-top:none; height:97px; vertical-align:top; width:126px"> <p style="text-align:center"><span style="font-size:11pt"><span style="font-family:Calibri,sans-serif"><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">2018</span></span></span></span></p> <p>&nbsp;</p> </td> <td style="border-bottom:1px solid black; border-left:none; border-right:1px solid black; border-top:none; height:97px; vertical-align:top; width:530px"> <p style="text-align:justify"><span style="font-size:11pt"><span style="font-family:Calibri,sans-serif"><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">Kamil I.A.K. Development of an intrusion prevention system using parallel programming and fault tolerance technologies / I. A. K. Kamil, M. B. Abrosimov // Technical means of information protection: Abstracts of reports of the XVI Belarusian Russian Scientific technical conference. Minsk, Republic of Belarus, June 05, 2018 Minsk. Minsk: BGUIR, 2018, p. 44.</span></span></span></span></p> </td> </tr> <tr> <td style="border-bottom:1px solid black; border-left:1px solid black; border-right:1px solid black; border-top:none; height:59px; vertical-align:top; width:126px"> <p style="text-align:center"><span style="font-size:11pt"><span style="font-family:Calibri,sans-serif"><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">2019</span></span></span></span></p> </td> <td style="border-bottom:1px solid black; border-left:none; border-right:1px solid black; border-top:none; height:59px; vertical-align:top; width:530px"> <p style="text-align:justify"><span style="font-size:11pt"><span style="font-family:Calibri,sans-serif"><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">Abrosimov M.B. Construction of all non-isomorphic minimal vertex extensions of a graph by the method of canonical representatives / M.B. Abrosimov, I.A.K. Kamil, A.A. Lobov // Izv. Sarat. un ta. New ser. Ser. Maths. Mechanics. Informatics. 2019. Vol. 19, no. 4. S. 479 485</span></span></span></span></p> </td> </tr> <tr> <td style="border-bottom:1px solid black; border-left:1px solid black; border-right:1px solid black; border-top:none; height:59px; vertical-align:top; width:126px"> <p style="text-align:center"><span style="font-size:11pt"><span style="font-family:Calibri,sans-serif"><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">2019</span></span></span></span></p> </td> <td style="border-bottom:1px solid black; border-left:none; border-right:1px solid black; border-top:none; height:59px; vertical-align:top; width:530px"> <p style="text-align:justify"><span style="font-size:11pt"><span style="font-family:Calibri,sans-serif"><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">Kamil I.A.K. System security and fault tolerance system / I. A. K. Kamil, M. B. Abrosimov // Technical means of information protection: Abstracts of the XVII Belarusian Russian Scientific and Technical Conference, Minsk, Republic of Belarus, June 11, 2019. Minsk: BSUIR, 2019 pp. 68.</span></span></span></span></p> </td> </tr> <tr> <td style="border-bottom:1px solid black; border-left:1px solid black; border-right:1px solid black; border-top:none; height:77px; vertical-align:top; width:126px"> <p style="text-align:center"><span style="font-size:11pt"><span style="font-family:Calibri,sans-serif"><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">2019</span></span></span></span></p> <p style="text-align:center">&nbsp;</p> </td> <td style="border-bottom:1px solid black; border-left:none; border-right:1px solid black; border-top:none; height:77px; vertical-align:top; width:530px"> <p style="text-align:justify"><span style="font-size:11pt"><span style="font-family:Calibri,sans-serif"><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">Kamil I.A.K. Construction of minimal graph extensions by the method of canonical representatives / I. A. K. Kamil, Kh. Kh. K. Sudani, A. A. Lobov, M. B. Abrosimov // Applied Discrete Mathematics. Application. 2019. No. 12. S. 179 182.</span></span></span></span></p> </td> </tr> <tr> <td style="border-bottom:1px solid black; border-left:1px solid black; border-right:1px solid black; border-top:none; height:59px; vertical-align:top; width:126px"> <p style="text-align:center"><span style="font-size:11pt"><span style="font-family:Calibri,sans-serif"><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">2020</span></span></span></span></p> </td> <td style="border-bottom:1px solid black; border-left:none; border-right:1px solid black; border-top:none; height:59px; vertical-align:top; width:530px"> <p style="text-align:justify"><span style="font-size:11pt"><span style="font-family:Calibri,sans-serif"><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">Kamil I.A.K. Computational experiment on building fault-tolerant implementations of graphs with up to 9 vertices // International Journal of Open Information Technologies. 2020 Vol. 8, No. 9. P. 43 47.</span></span></span></span></p> </td> </tr> <tr> <td style="border-bottom:1px solid black; border-left:1px solid black; border-right:1px solid black; border-top:none; height:59px; vertical-align:top; width:126px"> <p style="text-align:center"><span style="font-size:11pt"><span style="font-family:Calibri,sans-serif"><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">2020</span></span></span></span></p> </td> <td style="border-bottom:1px solid black; border-left:none; border-right:1px solid black; border-top:none; height:59px; vertical-align:top; width:530px"> <p style="text-align:justify"><span style="font-size:11pt"><span style="font-family:Calibri,sans-serif"><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">Kamil I.A.K. On the development of a parallel algorithm for constructing optimal vertex-fault-tolerant extensions of graphs without checking for isomorphism // Proceedings of the International Youth Scientific Forum &quot;LOMONOSOV 2020&quot; [Electronic resource] / Ed. I.A. Aleshkovsky, A.V. Andriyanov, E.A. Antipov. Electron. text data. (1500 Mb.) M.: MAKS Press, 2020. Access mode: </span></span><a href="https://lomonosov" style="color:#0563c1; text-decoration:underline"><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">https://lomonosov</span></span></a><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif"> msu.ru/archive/Lomonosov_2020/index.htm, free Materials of the International Youth Scientific Forum &quot;LOMONOSOV 2020&quot;.</span></span></span></span></p> </td> </tr> <tr> <td style="border-bottom:1px solid black; border-left:1px solid black; border-right:1px solid black; border-top:none; height:59px; vertical-align:top; width:126px"> <p style="text-align:center"><span style="font-size:11pt"><span style="font-family:Calibri,sans-serif"><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">2020</span></span></span></span></p> </td> <td style="border-bottom:1px solid black; border-left:none; border-right:1px solid black; border-top:none; height:59px; vertical-align:top; width:530px"> <p style="text-align:justify"><span style="font-size:11pt"><span style="font-family:Calibri,sans-serif"><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">Kamil I.A.K. Construction of all nonisomorphic supergraphs without checking for isomorphism / I.&nbsp;A.&nbsp;K. Kamil, Kh.&nbsp;H.&nbsp;K. Sudani, A.&nbsp;A. Lobov, M.&nbsp;B. Abrosimov // Applied Discrete Mathematics. 2020. No. 48. P.82 92.</span></span></span></span></p> </td> </tr> <tr> <td style="border-bottom:1px solid black; border-left:1px solid black; border-right:1px solid black; border-top:none; height:68px; vertical-align:top; width:126px"> <p style="text-align:center"><span style="font-size:11pt"><span style="font-family:Calibri,sans-serif"><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">2020</span></span></span></span></p> </td> <td style="border-bottom:1px solid black; border-left:none; border-right:1px solid black; border-top:none; height:68px; vertical-align:top; width:530px"> <p style="text-align:justify"><span style="font-size:11pt"><span style="font-family:Calibri,sans-serif"><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">Kamil I.A.K. Construction of minimal vertex extensions of a graph by the method of Reed Farajev / I. A. K. Kamil, M. B. Abrosimov, A. A. Lobov // International Journal of Open Information Technologies. 2020 Vol. 8, No. 4. R. 54 58.</span></span></span></span></p> </td> </tr> <tr> <td style="border-bottom:1px solid black; border-left:1px solid black; border-right:1px solid black; border-top:none; height:59px; vertical-align:top; width:126px"> <p style="text-align:center"><span style="font-size:11pt"><span style="font-family:Calibri,sans-serif"><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">2020</span></span></span></span></p> </td> <td style="border-bottom:1px solid black; border-left:none; border-right:1px solid black; border-top:none; height:59px; vertical-align:top; width:530px"> <p style="text-align:justify"><span style="font-size:11pt"><span style="font-family:Calibri,sans-serif"><span style="font-size:12.0pt"><span style="font-family:&quot;Times New Roman&quot;,serif">Kamil I.A.K. Development reliability node fault tolerant computing systems by parallel technics / I. A. K. Kamil, M. B. Abrosimov // Technical means of information protection: abstracts of the XVIII Belarusian Russian scientific technical conference. Minsk, Republic of Belarus, June 09, 2020. Minsk: BSUIR, 2020. P. 9 10.</span></span></span></span></p> </td> </tr> </tbody> </table> <p>&nbsp;</p>

Lectures


# المادة اسم المحاضرة المرحلة التحميل مشاهدة