â  â  ibn al-amid’s poetry â â â â â  s.f. mirghaderi * â  hossein kiani** â  â  abstract â  ibn al-amid is one of the most distinguished writers of the arabic literature who is believed, even by his contemporary critics, to be at the top of his profession due to the unique characteristics of his writings. besides being a writer, ibn al-amid also had a taste in composing poems. his poems are ...

aluminum base composite materials with variable properties which have been strengthened by alb 2 particles have been widely used. in this study, composites with variable properties of al-5%b and al-2%mg-2%b which are produced through centrifugal casting are investigated as far as their microstructure and hardness are concerned. the microstructure of these composite were studied by using metallo...

jamal–od-din al-asadabadi (1838-1897) is one of the greatest reformers in modern islamic history. he has valuable views and suggestions of advancement of the islamic world and unity among muslims, and he is one of the pioneers of the fight against despotism and colonialism. the reformer thinker has paid many attempts for the renewal of religious understanding that fits contemporary necessities....

the current study examines contradictions in muhammad mahdi al-jawahiri’s political poetry. al-jawahiri led most of his life amidst the turmoil caused by the political events and developments that iraq has undergone through different periods beginning with the 1920 revolution led by religious leaders and ending with al-ba‘th party and saddam hussein. al-jawahiri has beencontradictory in his poe...

This study aimed to develop a speaking-skill test at the B1 of CEFR, determine levels validity, reliability, and difficulty each item, organize distinguishing power item on prepared test. research was motivated by need Arabic Language Test as an evaluation activity that required for various purposes. Several universities in Indonesia have also intended existence language requirement continuing ...

Lower bounds for distributed algorithms for complete networks of processors (i.e., networks where each pair of processors is connected by a communication line) are discussed. We first show an f2(n log n) lower bound for the number of messages required by any algorithm in a given class of distributed algorithms for such networks. This class includes algorithms for problems like finding a leader ...