PHD theses : Computer Science
Permanent URI for this collectionhttps://repository.neelain.edu.sd/handle/123456789/12169
Browse
12 results
Search Results
Item Devlopment of secure framework for cloud compuing Environment(AlNEElAN UNVERSLTY, 2016) Salwa Awad Abbas IdrisItem Path Computation Element Model on the Super Computer(Al-Neelain University, 2019-12) Rawya Elmahi Gobara SaliemAbstract High-performance computing has become important in this era, especially for applications that need high-speed and more accurate processing, such as meteorological research, climate research, and digital signal processing. In light of this development, it was necessary to develop the computing environment.Therefore, this research aims to develop Dijkstra's algorithmin the open source program (Path computation element) and apply the concepts of parallel and hierarchical computing using map reduction. In order to reach the shortest path in the network at the lowest cost and the highest speed of implementation while reducing the risk of failure, it is worth mentioning that Dijkstra's algorithm is dominant in solving the shortest path problems between all the nodes in the network.The researcher used the analytical and descriptive methodology to find the shortest path in the network through the hierarchical and parallel Dijkstra algorithm. 200 nodes and 36 processors as a sample implementation. The results of the researcher in the hierarchy were that the percentage of the total performance of the first 100 nodes is 430 seconds, while the percentage of the total performance of the nodes is 920 seconds, and the uptime decreases with the increase in the number of cores, the speed increases with the increase in the number of cores until it reaches the value Then the speed decreases, the cost decreases when the operating time decreases.In parallel, the percentage of total performance for the first 100 nodes is 55 seconds, and the percentage of total performance for the first 100 nodes is 100 seconds. The running time decreases in parallel with the increase in the number of nodes when all the cores are in the same node. The researcher also reached recommendations, the most important of which is the use of Dijkstra's algorithm in large and medium schemes. When the network structure is hierarchical, the Dijkstra hierarchical algorithm is used. When the source node is one layer and the destination node is in another layer, searching for the shortest path will cover not only each layer but also the short paths of the interlayer. This algorithm is based on Dijkstra's parallel algorithm, where it is divided into parallel groups in any topological layers, and each hierarchical layer will form another layer of groups. Dijkstra's algorithm does not handle negative edges. The researcher recommends using the Dijkstra algorithm using both parallel and hierarchical methods to complete the process of finding the shortest path for all nodes in the network.اﻟﻤﺴﺘﺨﻠﺺ اﻟﺤﻮﺳﺒﺔ ﻋﺎﻟﯿﺔ اﻻداء اﺻﺒﺤﺖ ﻣﮭﻤﺔ ﻓﻲ ھﺬا اﻟﻌﺼﺮ ،ﺧﺎﺻﺔ اﻟﺘﻄﺒﯿﻘﺎت اﻟﺘﻲ ﺗﺤﺘﺎج اﻟﻲ ﻣﻌﺎﻟﺠﺔ ﺑﺴﺮﻋﺔ ﻋﺎﻟﯿﺔ واﻛﺜﺮ دﻗﺔ ،ﻣﺜﻞ اﺑﺤﺎث اﻻرﺻﺎد اﻟﺠﻮي ،واﺑﺤﺎث اﻟﻤﻨﺎخ ،وﻣﻌﺎﻟﺠﺔ اﻻﺷﺎرات اﻟﺮﻗﻤﯿﺔ .وﻓﻲ ظﻞ ھﺬا اﻟﺘﻄﻮر ﻛﺎن ﻻﺑﺪ ﻣﻦ ﺗﻄﻮﯾﺮ ﺑﯿﺌﺔ اﻟﺤﻮﺳﺒﺔ. ﻟﺬا ﯾﮭﺪف ھﺬا اﻟﺒﺤﺚ اﻟﻲ ﺗﻄﻮﯾﺮ ﺧﻮارزﻣﯿﺔ دﯾﻜﺴﺘﺮا ﻓﻲ اﻟﺒﺮﻧﺎﻣﺞ ﻣﻔﺘﻮح اﻟﻤﺘﻮازﯾﺔ واﻟﮭﺮﻣﯿﺔ ﺑﺎﺳﺘﺨﺪام ﺗﻘﻠﯿﻞ ) element computation Path ( وﺗﻄﺒﯿﻖ ﻣﻔﺎھﯿﻢ اﻟﺤﻮﺳﺒﺔ اﻟﻤﺼﺪر اﻟﺨﺮﯾﻄﺔ . وذﻟﻚ ﻟﻠﻮﺻﻮل اﻟﻲ اﻗﺼﺮ ﻣﺴﺎر ﻓﻲ اﻟﺸﺒﻜﺔ ﺑﺎﻗﻞ ﺗﻜﻠﻔﺔ واﻋﻠﻲ ﺳﺮﻋﺔ ﻟﻠﺘﻨﻔﯿﺬ ﻣﻊ ﺗﻘﻠﯿﻞ ﻣﺨﺎطﺮ اﻟﻔﺸﻞ ،واﻟﺠﺪﯾﺮ ﺑﺎﻟﺰﻛﺮ ان ﺧﻮارزﻣﯿﺔ دﯾﻜﺴﺘﺮا ﻣﮭﯿﻤﻨﺔ ﻋﻠﻲ ﺣﻞ ﻣﺸﺎﻛﻞ أﻗﺼﺮ اﻟﻄﺮق ﺑﯿﻦ ﻛﻞ اﻟﻌﻘﺪ اﻟﻤﻮﺟﻮدة ﻓﻲ اﻟﺸﺒﻜﺔ .اﺳﺘﺨﺪم اﻟﺒﺎﺣﺚ اﻟﻤﻨﮭﺞ اﻟﺘﺤﻠﯿﻠﻲ واﻟﻮﺻﻔﻲ ﻛﻄﺮﯾﻘﺔ ﻋﻠﻤﯿﺔ ﻓﻲ ھﺬا اﻟﺒﺤﺚ، ﻟﻠﻌﺜﻮر ﻋﻠﻲ اﻗﺼﺮ ﻣﺴﺎر ﻓﻲ اﻟﺸﺒﻜﺔ ﻋﻦ طﺮﯾﻖ ﺧﻮارزﻣﯿﺔ دﯾﻜﺴﺘﺮا اﻟﮭﺮﻣﯿﺔ واﻟﻤﺘﻮازﯾﺔ وﺗﻢ ذﻟﻚ ﻋﻦ طﺮﯾﻖ ﺗﺼﻤﯿﻢ ﺑﺮﻧﺎﻣﺞ ﺑﻠﻐﺔ اﻟﺒﺎﯾﺜﻮن ، ﻟﻠﺒﺤﺚ ﻋﻦ اﻗﺼﺮ ﻣﺴﺎرﻓﻲ اﻟﺸﺒﻜﺔ ﻋﺒﺮ اﻟﺘﺴﻠﺴﻞ اﻟﻤﺘﻮازي واﻟﮭﺮﻣﻲ وﯾﻘﻮم ﺑﺤﺴﺎب اﻟﺰﻣﻦ واﻟﺘﻜﻠﻔﺔ ﻣﻌﺎﻟﺞ ﻛﻌﯿﻨﺔ ﻟﻠﺘﻨﻔﯿﺬ.اﻟﻨﺘﺎﺋﺞ اﻟﺘﻲ ﺗﻮﺻﻞ اﻟﯿﮭﺎ اﻟﺒﺎﺣﺚ ﻓﻲ ﻋﻘﺪة و36 200 واﻟﺴﺮﻋﺔ ، اﺳﺘﺨﺪام اﻟﺒﺎﺣﺚ اﻟﺘﺴﻠﺴﻞ اﻟﮭﺮﻣﻲ ﻛﺎﻧﺖ اﻟﻨﺴﺒﺔ اﻟﻤﺌﻮﯾﺔ ﻟﻼداء اﻟﻜﻠﻲ ﻻول 100 ﻋﻘﺪة ھﻲ 430 ﺛﺎﻧﯿﺔ ،ﻓﻲ ﺣﯿﻦ ان اﻟﻨﺴﺒﺔ اﻟﻤﺌﻮﯾﺔ ﻟﻼداء اﻟﻜﻠﻲ ﻟﻠﻌﻘﺪ ھﻲ 920 ﺛﺎﻧﯿﺔ ، ﯾﺘﻨﺎﻗﺺ وﻗﺖ اﻟﺘﺸﻐﯿﻞ ﻣﻊ ذﯾﺎدة ﻋﺪد اﻟﻨﻮي ،ﺗﺬداد اﻟﺴﺮﻋﺔ ﻣﻊ ذﯾﺎدة ﻋﺪد اﻟﻨﻮي ﺣﺘﻲ ﺗﺼﻞ اﻟﻲ اﻟﻘﯿﻤﮫ اﻟﻘﺼﻮي ﺛﻢ ﺑﻌﺪ ذﻟﻚ ﺗﺘﻨﺎﻗﺺ اﻟﺴﺮﻋﺔ ،ﺗﻘﻞ اﻟﺘﻜﻠﻔﺔ ﻋﻨﺪﻣﺎ ﯾﻘﻞ زﻣﻦ اﻟﺘﺸﻐﯿﻞ . وﻓﻲ اﻟﺘﻮازي اﻟﻨﺴﺒﺔ اﻟﻤﺌﻮﯾﺔ ﻟﻼداء اﻟﻜﻠﻲ ﻻول 100 ﻋﻘﺪة ھﻲ 55 ﺛﺎﻧﯿﺔ ، اﻟﻨﺴﺒﺔ اﻟﻤﺌﻮﯾﺔ ﻟﻼداء اﻟﻜﻠﻲ ﻓﻲ اﻟﻌﻘﺪ ھﻲ ﯾﺘﻨﺎﻗﺺ وﻗﺖ اﻟﺘﺸﻐﯿﻞ ﻓﻲ اﻟﺘﻮازي ﻣﻊ ذﯾﺎدة ﻋﺪد اﻟﻌﻘﺪ ﻋﻨﺪﻣﺎ ﺗﻜﻮن ﺟﻤﯿﻊ اﻟﻨﻮي ﻓﻲ ﻧﻔﺲ ﺛﺎﻧﯿﺔ . 100 اﻟﻌﻘﺪة،اذا ﺗﻢ اﺳﺘﺨﺪام اﻟﻨﻮي ﻣﻦ ﻋﻘﺪ ﻣﺨﺘﻠﻔﺔ ﯾﺬاد وﻗﺖ اﻟﺘﺸﻐﯿﻞ ﺑﺸﻜﻞ اﻛﺒﺮ ، اﻣﺎ ﻣﻦ ﻧﺎﺣﯿﺔ اﻟﺴﺮﻋﺔ ﺗﺬداد اذا .ﻛﺬﻟﻚ ﺗﻮﺻﻞ .ﻋﻨﺪﻣﺎ ﯾﻜﻮن ﻛﺎن اﻟﻨﻮي ﻣﻦ ﻧﻔﺲ اﻟﻌﻘﺪة ،واﻟﻌﻜﺲ ﺗﺘﻨﺎﻗﺺ اﻟﺴﺮﻋﺔ ﻋﻨﺪ اﺳﺘﺨﺪام اﻟﻨﻮي ﻣﻦ ﻋﻘﺪ ﻣﺨﺘﻠﻔﺔ اﻟﺒﺎﺣﺚ اﻟﻲ ﺗﻮﺻﯿﺎت اھﻤﮭﺎ اﺳﺘﺨﺪام ﺧﻮارزﻣﯿﺔ دﯾﻜﺴﺘﺮا ﻓﻲ اﻟﻤﺨﻄﻄﺎت اﻟﻜﺒﯿﺮة واﻟﻤﺘﻮﺳﻄﺔ ھﯿﻜﻞ اﻟﺸﺒﻜﺔ ھﺮﻣﯿًﺎ ﯾﺘﻢ اﺳﺘﺨﺪام ﺧﻮارزﻣﯿﺔ دﯾﻜﺴﺘﺮا اﻟﮭﺮﻣﯿﺔ .ﻋﻨﺪﻣﺎ ﺗﻜﻮن اﻟﻌﻘﺪة اﻟﻤﺼﺪر طﺒﻘﺔ واﺣﺪة وﺗﻜﻮن اﻟﻌﻘﺪة اﻟﻮﺟﮭﺔ ﻓﻲ طﺒﻘﺔ أﺧﺮى ، ﻓﺈن اﻟﺒﺤﺚ ﻋﻦ أﻗﺼﺮ ﻣﺴﺎر ﻟﻦ ﯾﻐﻄﻲ ﻓﻘﻂ ﻛﻞ طﺒﻘﺔ وﻟﻜﻦ أﯾﻀًﺎ اﻟﻤﺴﺎرات ﺣﯿﺚ ﺗﻘﺴﻢ اﻟﻲ اﻟﻤﺘﻮازﯾﺔ Dijkstra .ﺗﻌﺘﻤﺪ ھﺬه اﻟﺨﻮارزﻣﯿﺔ ﻋﻠﻰ ﺧﻮارزﻣﯿﺔ اﻟﻘﺼﯿﺮة ﻟﻠﻄﺒﻘﺔ اﻟﺒﯿﻨﯿﺔ ﻣﺠﻤﻮﻋﺎت ﻣﺘﻮازﯾﺔ ﻓﻲ أي طﺒﻘﺎت طﻮﺑﻮﻟﻮﺟﯿﺔ وﻛﺬﻟﻚ ﺳﺘﺸﻜﻞ ﻛﻞ طﺒﻘﺔ ھﺮﻣﯿﺔ طﺒﻘﺔ أﺧﺮى ﻣﻦ اﻟﻤﺠﻤﻮﻋﺎت . ﺧﻮارزﻣﯿﺔ دﯾﻜﺴﺘﺮا ﻻ ﺗﺘﻌﺎﻣﻞ ﻣﻊ اﻟﺤﻮاف اﻟﺴﺎﻟﺒﺔ . اوﺻﻲ ﺑﺎﺳﺘﺨﺪام ﺧﻮارزﻣﯿﺔ اﻟﺪﯾﻜﺴﺘﺮا ﺑﺎﻟﻄﺮﯾﻘﺘﯿﻦ اﻟﻤﺘﻮازﯾﺔ واﻟﮭﺮﻣﯿﺔ ﻟﺘﻜﻤﻠﺔ ﻋﻤﻠﯿﺔ اﻟﺒﺤﺚ ﻋﻦ اﻗﺼﺮ ﻣﺴﺎر ﻟﺠﻤﯿﻊ اﻟﻌﻘﺪ ﻓﻲ اﻟﺸﺒﻜﺔ .Item Data Stream Analysis for neural network tissues detection(Al-Neelain University, 2019) Samir Salah Thabit YaseenAbstract Accurate brain tissues image segmentation can be considered as effective diagnosis support system for detecting affected edema and tumor tissues. Despite all the previous and existing efforts on segmenting these tissues and classifying them for the purposes of accurate diagnosis, still a lot of optimization works can be done in terms of increasing the accuracy and effectiveness of these tissues segmentation and classification. A number of challenges still can be address particularly for preprocessing and the utilization of neural networks and Fast-Fourier Transformation for classifying the contents of the tissues. This proposed solution is motivated by the achievement of reaching high-level of optimization solution for accurate human brain tissues segmentation and classification. For this purpose, a complete pipeline of algorithms for preprocessing and skull stripping, 2D image processing (such as Binarization and Normalization) as well as transformations techniques (such as Fast-Fourier transformation from continuous to digital domain). Also, artificial-intelligence techniques as neural-network supported by Self-Organizing Map (SOM) are all together integrated to achieve the highest possible optimized solution. Implementation of each process of the proposed pipeline algorithms solution has been implemented and performance evaluation of the proposed solution confirmed that accuracy of segmenting the different tissues types as well as the effected edema and tumor tissues reached above the 90.7% of accuracy. Keywords: Brain Tissues, Segmentation, Diagnosis, Preprocessing, Neural-Network, Self-Organizing Mapيمكن اعتبار التقسيم الدقيق لصورة أنسجة المخ كنظام دعم تشخيصي فعال للكشف عن أنسجة الورم والوذمة المصابة. على الرغم من كل الجهود السابقة والحالية لتقسيم هذه الأنسجة وتصنيفها لأغراض التشخيص الدقيق ، لا يزال من الممكن القيام بالكثير من أعمال التحسين من حيث زيادة دقة وفعالية تجزئة وتصنيف هذه الأنسجة. لا يزال هناك عدد من التحديات التي يمكن معالجتها بشكل خاص للمعالجة المسبقة واستخدام الشبكات العصبية وتحويل فورييه السريع لتصنيف محتويات الأنسجة. يتم تحفيز هذا الحل المقترح من خلال تحقيق الوصول إلى مستوى عالٍ من حل التحسين لتجزئة وتصنيف أنسجة المخ البشري بدقة. لهذا الغرض ، خط أنابيب كامل من الخوارزميات للمعالجة المسبقة وتجريد الجمجمة ، ومعالجة الصور ثنائية الأبعاد (مثل الثنائيات والتطبيع) بالإضافة إلى تقنيات التحويل (مثل تحويل فورييه السريع من المجال المستمر إلى المجال الرقمي). أيضًا ، تم دمج تقنيات الذكاء الاصطناعي كشبكة عصبية مدعومة بخريطة التنظيم الذاتي (SOM) معًا لتحقيق أعلى حل محسن ممكن. تم تنفيذ كل عملية من حل خوارزميات خط الأنابيب المقترح ، وأكد تقييم الأداء للحل المقترح أن دقة تقسيم أنواع الأنسجة المختلفة وكذلك الوذمة المصابة وأنسجة الورم وصلت إلى أكثر من 90.7٪ من الدقة. الكلمات الرئيسية: أنسجة المخ ، التجزئة ، التشخيص ، المعالجة المسبقة ، الشبكة العصبية ، خريطة التنظيم الذاتيItem Title Design Adaptive Educational framework for Teaching Using Hypermedia Case study (University of holy Quran and Islamic science, Al Noor Institute for Blind Students)(Neelain University, 2019-11) Abdoalgadir doalbait yousef doalbaitAbstract The design and implementation of Adaptive educational hypermedia systems (AEHS) web-based have grown exponentially in the last decade. AEHS are built on a base of the goals, preferences, behavior and knowledge of individual users to adapt to their specific needs. The ‘one size fits all’ is not an efficient educational philosophy. Instead teachers would be better applying the principle of ‘each student are unique’. Students have various strengths, challenges and interests. This requires teachers to be flexible and open-minded. The research attempt to design Adaptive Educational Framework for Teaching using Hypermedia (AEH) web and mobile based to support students (visual and blind) learning progress at both the University of Holy Quran and Islamic sciences and Al Noor Institute for Blind Student. In addition, the research also attempts to support most the features of the e-learning standard. Moreover, illustrating student model (visual and blind) and teacher model. Also the framework includes Voice Courses Application for teaching blind students. It assists the blind student in all educational levels: primary, secondary, undergraduate. It is an interactive application through voice which can be run on the tablet or any android based phone. The research uses an analytical descriptive method. Also, the agile methodology which is used for the design of adaptive educational framework it is eXtreme Programming (XP) methodology, which was created in response to problem domains which requires change. The research uses modern tools to implement the framework and JAVA, C# are used for programming, Visual Studio 2017 and Android Studio 3.5 are used to design interfaces. Furthermore, it utilizes SQL server 2014 Database, and UML for representation of all artifacts. The adaptive educational framework has helped students learn based on individual needs and style. Also helps blind students to study and review in an easy and simple way by voice. It also helped measure the level of students for each stage in a particular course. Easy to use, managing and monitoring the course of student learning through their studies The researcher recommends that the arterial intelligence methods is suitable for improving adaptive engine processes and speech recognition. moreover, to develop the adaptive educational framework in order to include all the special educational needs. المستخلص لقد اصبح تصميم وتنفيذ أنظمة الوسائط التعليمية الفائقة على شبكة الإنترنت تنمو بشكل كبير في العقد الأخير. تعتمد هذه الانظمة على خصائص عديدة منها الاهداف والأفضليات والسلوك والمعرفة لكل طالب للتكيف مع احتياجاته بشكل فردي. إن مفهوم (مقاس واحد يناسب الجميع) ليس فلسفة تعليمية فعالة. بدلاً عن ذلك ، سيكون من الأفضل للمعلمين تطبيق مبدأ "كل طالب فريد". وهذا يتطلب أن يكون المعلمون مرينين ومتطلعين. يهدف البحث الى تصميم منصة التعليم التكيفي للتدريس باستخدام الوسائط الفائقة تعتمد على شبكة الإنترنت والموبايل لدعم الطلاب (المبصرين والمكفوفين) في العملية التعليمة في كل من جامعة القرآن الكريم والعلوم الإسلامية ومعهد النور للطلاب المكفوفين. ايضا يحاول البحث دعم معظم خصائص معايير التعليم الالكتروني. وعلاوة على ذلك ، يهدف البحث الى توضيح نموذج الطالب (المبصر والمكفوف) ونموذج المعلم. كما تضمن المنصة تطبيق المادة الصوتية لتعليم الطلاب المكفوفين. يساعد التطبيق الطلاب المكفوفين في جميع المستويات التعليمية: الابتدائية والثانوية ، والجامعية. وهو تطبيق تفاعلي من خلال الصوت الذي يمكن تشغيله على الجهاز المحمول أو أي هاتف يعمل بنظام اندرويد. يستخدم البحث طريقة التحليل الوصفي. وكذلك ، المنهجية الرشيقة التي استخدمت لتطوير المنصة المتكاملة للتعليم التكيفي. منهجية البرمجة السريعة تم إنشاؤها استجابة لنطاق المشكلة الذي يتطلب التغيير. يستخدم البحث أدوات حديثة لتنفيذ منصة التعليم التكيفي قد استخدم لغات البرمجة التالية ـ JAVA و C # ، وايضا استخدمت Visual Studio 2017 و Android Studio 3.5 لتصميم الواجهات. وعلاوة على ذلك ، فقد استخدمت SQL server 2014و UML لتوثيق النظام . منصة التعليم التكيفي ساعدت الطلاب على التعلم بناءً على احتياجات وأسلوب كل طالب على حدة. ايضا ساعدت الطلاب المكفوفين على الدراسة والمراجعة بطريقة سهلة وبسيطة من خلال الصوت. كذلك ساعدت في قياس مستوى الطلاب لكل مرحلة في كورس معين. سهولة الاستخدام وإلادارة ومراقبة مسار تعلم الطلاب من خلال دراستهم. يوصي البحث بأن أساليب الذكاء الصناعي مناسبة لتحسين عمليات التعلم التكيفي وايضا التعرف على الصوت. بالاضافة الى تطوير عمليات المنصة بحيث تشمل كل ذوي الاحتياجات الخاصة.Item Anew Conjugate Gradient Algorithm of Unconstrained Optimization Using Parallel Processor(Al Neelain University, 2007-02) Nadwa Ali Ahmad Al-Abbasln optimization methods, we try to find and determine the best solution to certain mathematically defined problems: Minimize f(x) , x em" Optimization problems can be classified as constrained and unconstrained problems; however, as constrained optimization problems can be transformed into unconstrained cases, the majority of recent research works have been focused on unconstrained optimization problems, including the new techniques. Almost all numerical methods developed to solve f(x) are iterative in nature, i.e. given an initial point xo, the methods generate a sequence of points x,,,x,,... until some stopping criterion is satisfied . The iterative methods are first theoretically developed to minimize convex quadratic functions in a finite number of iterations and they are extended to solve the general problems. These numerical methods can be divided into two classes according to whether derivatives are evaluated or not (first or second derivative). The method which evaluates derivatives is called gradient method. Within this thesis, we first choose, one of the well-known methods, Conjugate Gradient "CG-method" which can solve iteratively both linear and nonlinear functions. This method is extended to find the minima (or maxima) using two kinds of searches to find the minimum solution. These are called: 1- Exact line search , i.e. g,+,Td, = 0 for i=1,2,... . 2- inexact line search. We choose about ten nonlinear functions and we use the program of this method to optimize these functions using special starting points with different dimensions for many of them. ln this thesis, a new algorithm is developed for minimization of the quadratic and extended quadratic function using the inexact line search. This thesis is concerned with the development and testing of the new algorithm using line search to solve different standard functions. We have extended our work to other two methods, quasi- Newton method and BFGS method, which begin the search along a gradient line as the CG-method and use gradient information to build a quadratic. Then we studied the parallel solution of these algorithms and the effect of using parallelism on these algorithms. Programs have been written using sequential design (to be executed serially). We have used the parallel models of these methods (design and analysis) and the parallelism of these methods in different ways. Further study was made of the important measures used in parallel computing. We have found that parallelism is only effective in linear functions and hence linearization methods for solving nonlinear functions. The other important measures of the efficiency of these algorithms are NOF (number of function evaluation). We have tried to reduce NOF by using inexact line search with extended conjugate gradient methods to optimize the unconstrained nonlinear problems. lt is found that in some functions NOF are reduced, especially high dimension ones. In others, NOF are not reduced. So it is difficult to conclude whether this method is better or worse compared with others. However, we may, say it is competing. lt gave good result with Powell function, which is generally accepted as a good function, and it may add a new algorithm for solving these types of problems. In general, this statement in common with all algorithms of solving nonlinear equations. The function is the main factor.Item RECOMMENDED APPROACH FOR SOFTWARE PROJECT PLANNING AND COST ESTIMATIONS IN THE SUDAN(2002) AWAD ELKARIM MOHAMMED YOUSIFABSTRACT Most -if not all - the software projects, of demand, in Sudan are small- sized or, possibly, medium-sized in some cases. The software projects that the various institutions, developers and the software houses have attempted, during the elapsed decades were not inclined to adopting software engineering basics. The standard techniques, standard documentation and systematic project reviews have been neglected. Consequently, the products came too feeble to suffice customers’ requirements or, as in the overwhelming majority of cases, a complete failure to serve the cause and purpose, for which it was originally entitled. In other cases the projects were terminated at earlier stages than completion and left unfinished due to the perplexed approaches during their development. The local software project development has been born accompanied by the problems of immaturity, because it did neither follow the systematic planning nor the proper cost estimation. Recently and when software projects were in demand the problem has escalated into a severe crisis. A tremendous effort has to be made clearing the present messy situation. indeed, a start from scratch is needed to revive the proper conception of the software project development, built on understanding the basics of software engineering fundamentals. ‘- The author made a keen survey upon 26 companies that practice software project development. A careful study has been made on the ways they adopt in planning and estimating the costs of software projects. Great efforts were made attempting to put these methods as indicators that could possibly be compared with the techniques, tools and systematic approaches adopted in Software Engineering. lt was observed that Software Engineering training progress was lacking and thus leading to insufficiency in software Engineering infrastructure. Eventually, Software Engineering methodology, tools, techniques and procedures were often absent. As a consequence schedules suffered frequent changes, the thing that lead to over-budgeting and conformed a mighty causal to time slips. Beyond that, no planning for standards, as well as no proper software development procedures were maintained and plans for Quality Assurance and Risk Management were rarely considered. The study has proposed some indicators and practical procedures that can be adopted and easily followed to achieve satisfactory results in this aspect.Item Monte Carlo Based Digital Image Simulation Processing(Neelain University, 2009) Hassan Hamad Abuelhassan AbdallahAbstract lmage segmentation is a fundamental first step image processing technique which helps attaining the objectives of computer vision. The primary objective of this thesis is to enhance existing image segmentation methods based on Monte Carlo integration. We have suggested Monte Carlo techniques to find the ensemble average of neighboring image properties. This way, more precise image operations such as edge detection, merging areas of similar properties and meshing techniques will be possible. Examples from everyday's activities using advanced computer graphics and image analysis techniques are used. Future work includes using of enhanced algorithms in medical image segmentation and analysis.Item A new Conjugate Gradient Algorithm of Unconstrained Optimization Using Parallel Processor(Neelain University, 2007) Nadwa Ali Ahmad Al-AbbasABSTRIACT ln optimization methods, we try to find and determine the best solution to certain mathematically defined problems: Minimize f(x) , xeil?” Optimization problems can be classified as constrained and unconstrained problems; however, as constrained optimization problems can be transformed into unconstrained cases, the majority of recent research works have been focused on unconstrained optimization problems, including the new techniques. Almost all numerical methods developed to solve f(x) are iterative in nature, i.e. given an initial point xo, the methods generate a sequence of points x,,,x, until some stopping criterion is satisfied . The iterative methods are first theoretically developed to minimize convex quadratic functions in a finite number of iterations and they are extended to solve the general problems. These numerical methods can be divided into two classes according to whether derivatives are evaluated or not (first or second derivative). The method which evaluates derivatives is called gradient method. Within this thesis, we first choose, one of the well-known methods, Conjugate Gradient “CG~method" which can solve iteratively both linear and nonlinear functions. This method is extended to find the minima (or maxima) using two kinds of searches to find the minimum solution. These are called: 1- Exact line search , i.e. g,+,’d, = 0 for i=1,2,... . 2- lnexact line search. We choose about ten nonlinear functions and we use the program of this method to optimize these functions using special starting points with different dimensions for many of them. ln this thesis, a new algorithm is developed for minimization of the quadratic and extended quadratic function using the inexact line search. This thesis is concerned with the development and testing of the new algorithm using line search to solve different standard functions. We have extended our work to other two methods, quasi- Newton method and BFGS method, which begin the search along a gradient line as the CG-method and use gradient information to build a quadratic. Then we studied the parallel solution of these algorithms and the effect of using parallelism on these algorithms. Programs have been written using sequential design (to be executed serially). We have used the parallel models of these methods (design and analysis) and the parallelism of these methods in different ways. Further study was made of the important measures used in parallel computing. We have found that parallelism is only effective in linear functions and hence linearization methods for solving nonlinear functions. The other important measures of the efficiency of these algorithms are NOF (number of function evaluation). We have tried to reduce NOF by using inexact line search with extended conjugate gradient methods to optimize the unconstrained nonlinear problems. lt is found that in some functions NOF are reduced, especially high dimension ones. In others, NOF are not reduced. So it is difficult to conclude whether this method is better or worse compared with others. However, we may say it is competing. lt gave good result with Powell function, which is generally accepted as a good function, and it may add a new algorithm for solving these types of problems. In general, this statement in common with all algorithms of solving nonlinear equations. The function is the main factor.Item A design of simulation model and Analysis Program to Identify the order of carcinogenesis process Associated with bladder cancer(Al Neelain University, 2013) Elshibli Mohamed AhmedThis study aimed to design simulation model to predict the order of events correlated with specific result. A total of 23 genetic mutations tested in l76 bladder cancer patients used as data of the real system. The simulation model was designed using the frequency of mutation assuming that the most frequent events are the first-happing ones. Correlation test was used to identify the order of the events. Application of designed model resulted in six pathways of which two were main pathways whereas the remaining were sub pathways. The first main pathway was long and characterized by 10 events whereas the second main pathway was short, contain only 2 events. To validate the simulation results the data compared with the biological and genetic models showing complete accordance between the 2 models.Item A new Conjugate Gradient Algorithm of Unconstrained Optimization Using Parallel Processor(Neelain University, 2007) Nadwa Ali Ahmad Al-AbbasABSTRIACT ln optimization methods, we try to find and determine the best solution to certain mathematically defined problems: Minimize f(x) , xeil?” Optimization problems can be classified as constrained and unconstrained problems; however, as constrained optimization problems can be transformed into unconstrained cases, the majority of recent research works have been focused on unconstrained optimization problems, including the new techniques. Almost all numerical methods developed to solve f(x) are iterative in nature, i.e. given an initial point xo, the methods generate a sequence of points x,,,x, until some stopping criterion is satisfied . The iterative methods are first theoretically developed to minimize convex quadratic functions in a finite number of iterations and they are extended to solve the general problems. These numerical methods can be divided into two classes according to whether derivatives are evaluated or not (first or second derivative). The method which evaluates derivatives is called gradient method. Within this thesis, we first choose, one of the well-known methods, Conjugate Gradient “CG~method" which can solve iteratively both linear and nonlinear functions. This method is extended to find the minima (or maxima) using two kinds of searches to find the minimum solution. These are called: 1- Exact line search , i.e. g,+,’d, = 0 for i=1,2,... . 2- lnexact line search. We choose about ten nonlinear functions and we use the program of this method to optimize these functions using special starting points with different dimensions for many of them. ln this thesis, a new algorithm is developed for minimization of the quadratic and extended quadratic function using the inexact line search. This thesis is concerned with the development and testing of the new algorithm using line search to solve different standard functions. We have extended our work to other two methods, quasi- Newton method and BFGS method, which begin the search along a gradient line as the CG-method and use gradient information to build a quadratic. Then we studied the parallel solution of these algorithms and the effect of using parallelism on these algorithms. Programs have been written using sequential design (to be executed serially). We have used the parallel models of these methods (design and analysis) and the parallelism of these methods in different ways. Further study was made of the important measures used in parallel computing. We have found that parallelism is only effective in linear functions and hence linearization methods for solving nonlinear functions. The other important measures of the efficiency of these algorithms are NOF (number of function evaluation). We have tried to reduce NOF by using inexact line search with extended conjugate gradient methods to optimize the unconstrained nonlinear problems. lt is found that in some functions NOF are reduced, especially high dimension ones. In others, NOF are not reduced. So it is difficult to conclude whether this method is better or worse compared with others. However, we may say it is competing. lt gave good result with Powell function, which is generally accepted as a good function, and it may add a new algorithm for solving these types of problems. In general, this statement in common with all algorithms of solving nonlinear equations. The function is the main factor.