<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
<title>مجلة ديالى للعلوم الاكاديمية / Academic Science Journal (Acad. Sci. J.)</title>
<link href="http://148.72.244.84/xmlui/handle/xmlui/2744" rel="alternate"/>
<subtitle>Academic Science Journal (Acad. Sci. J.) is a peer reviewed quarterly scientific journal published by the College of Science, University of Diyala</subtitle>
<id>http://148.72.244.84/xmlui/handle/xmlui/2744</id>
<updated>2026-04-17T16:44:44Z</updated>
<dc:date>2026-04-17T16:44:44Z</dc:date>
<entry>
<title>On BornologicalStructure</title>
<link href="http://148.72.244.84/xmlui/handle/xmlui/15906" rel="alternate"/>
<author>
<name/>
</author>
<id>http://148.72.244.84/xmlui/handle/xmlui/15906</id>
<updated>2025-02-16T08:54:29Z</updated>
<published>2024-04-01T00:00:00Z</published>
<summary type="text">On BornologicalStructure
For  multi  criteria  sequencing  problem  on  one  machine,  we  proposea  modified  branch  and bound algorithm (MBAB) to find efficient(pareto optimal) solutions in this paper. The criteria are  total  completion time  (∑&#119862;&#119895;),  total  lateness(∑&#119871;&#119895;),  and  maximum  tardiness  (Tmax).    A collection  of  n  independent  tasks(jobs)  has  to  be  sequenced  on  one  machine  ,  tasks(jobs)j (j=1,2,3,.....,n) requires processing time Pjand due data dj. The MBAB algorithm depends on branch  and  bound  technique.  Applied  examples  are  used  to  show  applicabilityof  MBAB algorithm.  The  MBAB algorithm  is  compared  with  complete  enumeration  method  (CEM). Conclusions are formulated on the performance of the (MBAB) algorithm
</summary>
<dc:date>2024-04-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Efficient Solutions for Multi-criteria Sequencing Problem by Using Modified Algorithm</title>
<link href="http://148.72.244.84/xmlui/handle/xmlui/15905" rel="alternate"/>
<author>
<name/>
</author>
<id>http://148.72.244.84/xmlui/handle/xmlui/15905</id>
<updated>2025-02-16T08:49:54Z</updated>
<published>2024-04-01T00:00:00Z</published>
<summary type="text">Efficient Solutions for Multi-criteria Sequencing Problem by Using Modified Algorithm
For  multi  criteria  sequencing  problem  on  one  machine,  we  proposea  modified  branch  and bound algorithm (MBAB) to find efficient(pareto optimal) solutions in this paper. The criteria are  total  completion  time  (∑&#119862;&#119895;),  total  lateness(∑&#119871;&#119895;),  and  maximum  tardiness  (Tmax).    A collection  of  n  independent  tasks(jobs)  has  to  be  sequenced  on  one  machine  ,  tasks(jobs)j (j=1,2,3,.....,n) requires processing time Pjand due data dj. The MBAB algorithm depends on branch  and  bound  technique.  Applied  examples  are  used  to  show  applicabilityof  MBAB algorithm.  The  MBAB algorithm  is  compared  with  complete  enumeration  method  (CEM). Conclusions are formulated on the performance of the (MBAB) algorithm
</summary>
<dc:date>2024-04-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Comparison between MDDV and VADD routing protocols in VANET(Case Study)</title>
<link href="http://148.72.244.84/xmlui/handle/xmlui/15904" rel="alternate"/>
<author>
<name/>
</author>
<id>http://148.72.244.84/xmlui/handle/xmlui/15904</id>
<updated>2025-02-16T08:43:40Z</updated>
<published>2024-04-01T00:00:00Z</published>
<summary type="text">Comparison between MDDV and VADD routing protocols in VANET(Case Study)
Routing is the process of delivering a packet from a source to a destination in the network using a  routing  algorithm  that  tries  to  create  an  efficient  path.  The  path  should  be  created  with minimum overhead and bandwidth consumption. In the literature, routing protocols in VANET were categorized in many ways, according to different aspects. In the present study, we prefer the  classification  based  on  the  number  of  hops  to  reach  the  destination  node.  The  literature, these are single-hop and multi-hops protocols.
</summary>
<dc:date>2024-04-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Preparation and Optical Characterization of Poly (Vinyl Alcohol): Eosin-Y Films Synthesized bySolventCasting Method</title>
<link href="http://148.72.244.84/xmlui/handle/xmlui/15903" rel="alternate"/>
<author>
<name/>
</author>
<id>http://148.72.244.84/xmlui/handle/xmlui/15903</id>
<updated>2025-02-16T08:32:27Z</updated>
<published>2024-04-01T00:00:00Z</published>
<summary type="text">Preparation and Optical Characterization of Poly (Vinyl Alcohol): Eosin-Y Films Synthesized bySolventCasting Method
It was found that the effect of PVA-doped Eosin-Y on the optical properties of the composite films  was  intentional  as  the  PVA  films  were  deposited  by  a  solvent  casting  process  with  a thickness of 25 ± 1 μm and were grafted with different absorptions of Eosin-Y.  The  optical diffusivity (%) was described within the wavelength range of (200-900 nm), as well as the effect of the doping ratio on the optical properties of the prepared films. The results showed that layers with indirect developments are acceptablein the interband that are affected by the doping ratio. The band gap of the doped films decreased to (2.20 eV), (2.17 eV), and (2.13 eV)for doping ratios of (2%, 4%, and 6%), respectively, compared to the pure film's 3.89 eV
</summary>
<dc:date>2024-04-01T00:00:00Z</dc:date>
</entry>
</feed>
