Show: 25 50 75 100 Results

Search results: 25 out of 1,618

ثنائية المشتقات العليا على الحلقات الاولية من النمط == Higher Bi - Derivations on Prime ? - Rings

Author name: احمد مزهر مرير
Supervisor name: صلاح مهدي صالح
General topic: Mathematics
Specific topic: Mathematics
Degree: Master
University: Mustansiriyah University - College Of Science - Department Of Mathematics
Language: English
University location: Baghdad
First pages:

الشروط الضرورية والكافية لمسيطر حدودي امثلي لزوج من معادلات تفاضلية جزئية غير خطية مكافئة القطع == Necessary and Sufficient conditions for boundary optimal control of couple nonlinear parabolic partial differential equations

Author name: احمد عبد الحسن نايف
Supervisor name: جميل اميرعلي الهواسي
General topic: Mathematics
Specific topic: Mathematics
Degree: Master
University: Mustansiriyah University - College Of Science - Department Of Mathematics
Language: English
University location: Baghdad
First pages:

بعض التبولوجيا على جبر - د == Some Topologies on d - algebra

Author name: حمد طالب حسين
Supervisor name: حبيب كريم عبد الله | حيدر جبر علي
General topic: Mathematics
Specific topic: Topology
Degree: Doctorate
University: Mustansiriyah University - College Of Science - Department Of Mathematics
Language: English
University location: Baghdad
First pages:

التقدير البيزي لمعوليه جومبيرتز للاجهاد و المتانة == Bayesian Estimation Of The Stress - Strength Gombertz Reliability Function

Author name: ابتهال فتحي سبع ال مجباس
Supervisor name: ندى صباح كرم
General topic: Mathematics
Specific topic: Mathematics
Degree: Master
University: Mustansiriyah University - Faculty Of Education
Language: English
University location: Baghdad
First pages:

الحلول العددية للمعادلات التفاضلية التباطؤية ذات الرتب الكسرية == Numerical Solutions for Solving Delay Differential Equations of Fractional Order

Author name: قتيبــة وادي ابراهـيم
Supervisor name: اسامـة حمـيد محـمد
General topic: Mathematics
Specific topic: Numerical Analysis
Degree: Master
University: Al-Nahrain University - College Of Science - Department Of Mathematics And Computer Applications
Language: English
University location: Baghdad
First pages:

تحميل شفرات طرق هجوم القوة الشرسة وXOR == Cryptanalysis for Brute Force Attack and XOR Ciphering Methods

Author name: سجا غازي محمد
Supervisor name: عبد الرحمن حميد مجيد
General topic: Mathematics
Specific topic: Applied Mathematics
Degree: Master
University: University of Baghdad
Language: English
University location: Baghdad
First pages:

استخدام النموذج الرياضي والشبكات العـصبية لتحديد نسبة تلوث البيئة == Employ Mathematical Model and Neural Networks for Determining Rate of the Environmental Contamination

Author name: فرح فيصل غازي
Supervisor name: لمى ناجي محمد توفيق
General topic: Mathematics
Specific topic: Mathematics
Degree: Master
University: University of Baghdad
Language: English
University location: Baghdad
First pages:
Abstract: هناك العديد من الاهداف في هذه الرسالة : الهدف الاول هو تطوير نموذج المعادلة التي تصف انتشار التلوث خلال التربة والتي يمكن استخدامها لتحديد نسبة التلوث البيئي وذلك بتقدير تركيز المعادن الثقيلة في التربة. نموذج المعادلة التي تم تطويرها يمكن اعتبارها تمثيل جيد لمشكلة التلوث البيئي.الهدف الثاني في هذه الرسالة هو تصميم شبكتين عصبيتين ذات تغذية تقدمية باعتبارها تقنية دقيقة بديلة لتحديد نسبة التلوث البيئي والتي يمكن استخدامها في حل معادلة النموذج. الشبكة الاولى تحاكي معلمات التربة التي يمكن استخدامها في ادخال البيانات في الشبكة الثانية المقترحة، في حين تحاكي الشبكة الثانية لتقدير تركيز المعادن الثقيلة.الهدف الثالث هو تطوير المفهوم النظري لمرحلة تدريب الشبكات العصبية من وجهة نظر التحليل الدالي والطرق الامثلية. ضمن هذه الصيغة، التعلم يعني حل مشكلة متغايرة بواسطة تصغير دالة الاداء المتعلقة بالشبكة العصبية. ان اختيار دالة الهدف يعتمد على تطبيق معين. من جهة اخرى، فاننا نقترح تعديل على دالة الاداء لتحسين تعميم الشبكات المقترحة وعلى الجانب الاخر، لعلاج التوقف المبكر ومشاكل النهاية الصغرى المحلية.الهدف الرابع هو مقارنة اداء الخوارزميات المذكورة اعلاه فيما يتعلق بقدرة التنبؤ. ثم تطبيق التقنية المقترحة لتقدير تركيز المعادن الثقيلة مثل : النحاس والرصاص والكادميوم والكوبالت والزنك والنيكل في تربة بغداد. اولا، تم اختيار اربعة وستين عينة من التربة من المواقع الملوثة تقع في بعض المناطق في مدينة بغداد (السكنية والصناعية والتجارية والزراعية والطرق الرئيسية). ثانيا، تم اجراء سلسلة من القياسات على عينات التربة وتحليلها لقياس تراكيز المعادن الثقيلة بواسطة اجهزة الامتصاص الطيف الذري (AAS)، فلورية الاشعة السينية (XRF) المطياف الكتلي البلازمي بالتقارون الحثي (ICP - MS) ومن خلالها نحصل على تراكيز اولية لهذه المعادن الثقيلة. ثالثا، محاكاة وتدريب الشبكات المقترحة للحصول على تركيز المعادن الثقيلة بالطريقة المقترحة ومن ثم مقارنة اداء الشبكات المقترحة مع فحص المختبر التقليدي باستخدام مجموعة بيانات التدريب والاختبار. نتائج هذا العمل تبين ان الشبكات المقترحة والمتدربة على القياسات التجريبية يمكن تطبيقها بنجاح لتقدير تركيز المعادن الثقيلة بسرعة ودقة.اخيرا، نقترح بعض الطرق لمعالجة التربة الملوثة باستخدام بعض النباتات العشبية. | There are many aims of this thesis : The first aim is to develop a model equation that describes the spread of contamination through soils which can be used to determine the rate of environmental contamination by estimate the concentration of heavy metals (HMs) in soil. The developed model equation can be considered as a good representation for a problem of environmental contamination. The second aim of this thesis is to design two feed forward neural networks (FFNN) as an alternative accurate technique to determine the rate of environmental contamination which can be used to solve the model equation. The first network is to simulate the soil parameters which can be used as input data in the second suggested network, while the second network simulates to estimate the concentration of heavy metals. The third aim is to develop a conceptual theory of training stage of neural networks from the perspective of functional analysis and optimization methods. Within this formulation, learning means to solve a variational problem by minimizing a performance function associated to the neural network. The choice of the objective functional depends on the particular application. On the other side, we suggest modification of the performance function to improve the generalization of the suggested networks and to treat the early stopping and local minima problems. The fourth aim is to compare the performance of aforementioned algorithms with regard to predicting ability. Then applied the suggested technique to estimate the concentration of heavy metals such as : Copper(Cu), Lead(Pb), Cadmium(Cd), Cobalt(Co), Zinc(Zn) and Nickel(Ni) in Baghdad soils. First, sixty four soil samples were selected from a phytoremediated contaminated site located in some zones in Baghdad city (residential, industrial, commercial, agricultural and main roads). Second, a series of measurements were performed on the soil samples and analyzed measuring of concentrations for heavy metals using devices such as : Atomic Absorption Spectrophotometer (AAS), X - Ray Fluorescence (XRF) and Inductively Coupled Plasma - Mass Spectrometry (ICP - MS) to get initial concentrations for those heavy metals. Third, simulate and train the suggested networks to get the concentration of heavy metals. The performance of the suggested networks was compared with the traditional laboratory inspecting using the training and test data sets. The results of this work show that the suggested networks trained on experimental measurements can be successfully applied to the rapid and accuracy estimation of concentration of heavy metals. Finally, we suggest some methods contaminated soil by using some herbal plants.

تحسين خوارزميات الحل التام والبحث المحلي لحل بعض مسائل الامثلية التوافقية == Improving Exact and Local Search Algorithms for Solving Some Combinatorial Optimization Problems

Author name: فائز حسن علي
Supervisor name: طارق صالح عبد الرزاق
General topic: Mathematics
Specific topic: Numerical Optimization
Degree: Doctorate
University: Mustansiriyah University - College Of Education For Pure Sciences - Department Of Mathematics
Language: English
University location: Baghdad
First pages:
Abstract: In mathematics and computer science, an optimization problem (OP) is the problem of finding the best solution from all feasible solutions. OPs can be divided into two categories depending on whether the variables are continuous or discrete. An OP with discrete variables is known as a combinatorial optimization problem (COP). In a COP, we are looking for an object such as an integer, permutation or graph from a finite set.The aim of the research presented in this thesis is to investigate the use of various optimization exacts and heuristics to solve the COP's. This thesis presented in six chapters.In this thesis we interest in discussing three samples of COP; machine scheduling problem (MSP), transposition cipher problem (TCP) and aircraft landing problem (ALP).In the first two chapters, we discuss the main concepts of the COP, the three study cases, the basic techniques and methods for solving the COP respectively.In chapter three, we interesting in MSP, with multiple objective for the 1//(Ci,Ti) problem (P1) and 1//Ci+Ti problem (P3). We investigate the usefulness of precedence rules in solving (P1) and (P3). We found that the complete enumeration method (CEM) gives efficient (and optimal) solutions for (P1) (and (P3)) with number of jobs (n)10, and branch and bound (BAB) gives efficient solutions for (P1) with n15 and optimal solution for (P3) with n80. In addition, we use the local search methods (LSM), to solve the two problems, represented by genetic algorithm (GA) and particle swarm optimization (PSO) with n2000. In general we conclude that PSO serves better than GA. Lastly, a neural network (NN) is constructed to solve problems (P1) and (P3). Two learning algorithms are used to learn the NN; pack propagation (PB) and PSO with and without depending on successive rules (SR). We see that PSO is better than BP in learning NN to obtaining good results.In chapter four, we suggest a new direction in cryptanalysis of TCP, we suggest using the techniques of COP to solve TCP in another word, the TCP treated as one of COP. First a new mathematical formulation for TCP is introduced and proposed some new tools of TCP cryptanalysis. The CEM and modified BAB are developed by using SR to obtain the multi digits CEM (MDCEM) and MDBAB which are helpful in decreasing the CPU time. Classical bees' algorithm (CBA) and shifted key BA (SKBA) are improving the cryptanalysis results. To increase the performance of the mentioned algorithms we construct cryptanalysis system for TCP to find exact solution (as possible) for n20 in reasonable time, which is called SR keys BA (SRKBA). The main result of this thesis is suggesting a general solving system for COP specially, when the problem submits to SR.Chapter five focused in one of the important problems of COP; ALP. A new improvement in a heuristic method, called parallel improving algorithm (PIA), is introduced, the new algorithm called modified PIA (MPIA) which is serves better than PIA. The CEM is used to solve ALP using two techniques; exhaustive search method (ESM) which gives optimal solution but in unreasonable time for n>9 while MPIA gives approximation solutions for n9 in 6 seconds. Lastly, hybridization is proposed between MPIA and CBA, which is called improvement CBA (ICBA). ICBA gives optimal solutions in solving ALP for n<50 and near optimal for n=50.In chapter six, some conclusions together with some suggestions for future researches have been given.The exact and heuristics methods all were tested by programming them using version 10.0 of Delphi Language and MATLAB, and running on Processor Intel(R) Core (TM) i3 CPU, 2.53 GHz, Core(s), with Ram 1.21 GB computer.

مسالة السيطرة الامثلية التقليدية المستمرة لمعادلات تفاضلية جزئية == The Continuous Classical Optimal Control Problem of Partial Differential Equations

Author name: غفران مناتي كاظم
Supervisor name: جميل اميرعلي الهواسي
General topic: Mathematics
Specific topic: Mathematics
Degree: Master
University: Mustansiriyah University - College Of Education For Pure Sciences - Department Of Mathematics
Language: English
University location: Baghdad
First pages:
Abstract: الهدف الرئيسي لهذه الرسالة هو دراسة مسالة السيطرة الامثلية التقليدية المستمرة لزوج من المعادلات التفاضلية الجزئية الخطية واللاخطية من النوع المكافئ )stateفي برهان مبرهنة وجود ووحدانية الحل للحالة ( Galerkin حيث استخدمنا طريقة لزوج من المعادلات المذكورة اعلاه ولكن من النوع اللا خطي عندما يكون متجه السيطرة التقليدية المستمرة ثابت . قمنا ايضا ببرهان مبرهنات خاصة بوجود سيطرة (متجه السيطرة) التقليدية المستمرة لزوج من المعادلات التفاضلية الجزئية الخطية واللاخطية من النوع المكافئ. برهنا ايضا مبرهنة وجود ووحدانية الحل لزوج المعادلات التفاضلية الجزئية الخطية واللاخطية للحالة. طورت بشكل يتناسب مع المسالة Kuhn - Tucker - Lagrange’s Multipliers مبرهنات السيطرة التقليدية المستمرة المقترحة في هذه الرسالة وصيغت وبرهنت مبرهنتا الشرط الضروري لوجود السيطرة الامثلية | The main aim of this thesis is to study the continuous classical optimal control problem of a couple of linear and nonlinear parabolic partial differential equations. With a suitable assumptions, the existence and the uniqueness of solution of the state vector of couple of linear parabolic PDEs for a given continuous classical control vector are proved by using Galerkin method. The existence theorems of a continuous classical optimal control vector associated with a couple of nonlinear parabolic equations are developed and proved. The existence and the uniqueness theorem of a solution of the couple of adjoint equations associated with the considered state equations of nonlinear parabolic equations with equality and inequality constraints is also proved once again. The Kuhn - Tucker - Lagrange multipliers theorems are developed and used to prove the necessary conditions theorem and the sufficient conditions theorem of optimality of a couple of nonlinear parabolic equations with equality and inequality constraints

الحل العددي لبعض المعادلات التفاضليه باستخدام تحويل لاكير == Numerical Solution for some Differential Equations via Laguerre Transform Approach

Author name: غصون سعيد عبد محمد
Supervisor name: ايمان علي حسين
General topic: Mathematics
Specific topic: Numerical Analysis
Degree: Master
University: Mustansiriyah University - College Of Education For Pure Sciences - Department Of Mathematics
Language: English
University location: Baghdad
First pages:
Abstract: The main aim of this work is to introduce new formulae that can be used to deal with LT and to utilize them for solving different types of DEs.A new simple general formula is derived to evaluate the LT of the higher derivatives of a variable. The new formula is easily modeled by a computer program, and there is no need for tedious operations of successive integration by part, as in the conventional method.This work proposes a method utilizing LT to solve ODE's (linear and nonlinear, homogeneous or inhomogeneous, boundary or initial value problems), which is explained and implemented in different examples. The results are in a good agreement with the analytical solution.Two other new methods are proposed, utilizing LT to solve PDE's with one spatial dimension. The two methods are explained and implemented in different examples, and the results show a good agreement with the analytical solutions.Another new method, utilizing LT, is proposed to solve PDE's with two spatial dimensions. The method is implemented to solve heat equation with two spatial dimensions and the results show a good agreement with that of finite difference solution. The method is also modified to achieve image smoothing as a global smoothing technique. The new image smoothing technique is compared with a finite difference technique for image smoothing, which is a local smoothing technique. The results of the proposed new technique show better smoothing (less fogy) with an expenditure of a long execution time.Finally, it is worth to mention that all the programs used in this work have been coded by the MATLAB 7 system environment

طرق تكرارية موثوقة لحساب تراكيز ثنائي اوكسيد الكاربون الممتص بواسطة فينيل غلايسيدل الايثر == Reliable Iterative Methods for Calculating the Concentrations of Carbon Dioxide Absorbed into Phenyl Glycidyl Ether

Author name: غسان حسن محمود راضي
Supervisor name: مجيد احمد ولي
General topic: Mathematics
Specific topic: Mathematics
Degree: Master
University: University of Baghdad
Language: English
University location: Baghdad
First pages:
Abstract: In this thesis, two reliable iterative methods are used to calculate the concentrations of carbon dioxide CO2 and phenyl glycidyl ether PGE. The first one is the variational iteration method. It is used to get an approximate solution for a system of two coupled nonlinear ordinary differential equations which represent the concentrations of CO2 and PGE. The other method is the standard homotopy analysis method which is implemented on this system. Formerly, this system has been solved by the Adomiandecomposition method. In solving this system by Adomian’s method, the nonlinearity needs calculating the Adomian’s polynomials. On the other hand, the two methods do not require any assumptions like the calculating of the Adomian’s polynomials. In this system there are boundary conditions of Dirichlet type and the other is a mix of Neumann and Dirichlet type. Our calculations are evidenced by tables and figures for the analysis of the maximal error remainder values. The variational iteration method givesapproximate solutions with fast convergence. Comparison with the results obtained by the Adomian decomposition method shows that the numerical solutions obtained by the variational iteration method converge faster than those of Adomian's method. Also, the homotopy analysis method which is implemented on this system has a very fast convergence in giving approximate solutions. Moreover, the numerical solutions resulted from the homotopy analysis method converge faster than those of Adomian's methodwhich has been implemented previously for the same problem. The numerical results also show high rates of convergence which are obtained at the increasing of the iterations. The used software of the contained calculations in our study is Mathematica 9.

بعض طرائق التقدير لمعلمة القياس لتوزيع لابلاس : دراسة مقارنة == Some Baye,s Estimators for the Scale Parameter of the Laplace Distribution / A Comparison Study

Author name: عماد فرهود محي الشريفي
Supervisor name: هدى عبد الله رشيد
General topic: Mathematics
Specific topic: Mathematics
Degree: Master
University: Mustansiriyah University - College Of Science - Department Of Mathematics
Language: English
University location: Baghdad
First pages:
Abstract: The Laplace distribution is important to the development of mathematics ,statistics, physics, and astronomy, and usually used as its characteristics apply to a large ratio of natural, social and economic phenomenon. Hence, the importance of this thesis is to Find the best estimator for the scale parameter θ, when location parameter (a) is known and unknown through obtaining and comparing the classical estimators (Maximum Likelihood Estimator, Uniformly Minimum variance unbiased Estimator, and Minimum Mean Squared Error), as well as Bayesian estimators under different loss functions (Quadratic loss function, squared - Log error loss function, Generalized squared error loss function, Entropy loss function, Suggested loss function).In order to get a better understanding of our Bayesian analysis, we consider the non - informative prior for the scale parameter () using Jeffreys prior information, as well as informative prior density represented by Gumbel Type II Prior.All these estimators are compared empirically using Mont - Carlo simulation by employing the mean squared errors (MSE's).Also we derived the Minimax estimators of the scale parameter θ for the Laplace distribution for all loss functions referred to above and reach to the estimators under Quadratic loss function, Squared - log error loss function, special case of Suggested loss function and Entropy loss function are Minimax estimators.Among conclusions that have been reached, the Suggested loss function with Gumble prior has recorded the best performance of the used for other loss functions. On the other hand, Gumble prior under different loss functions with Gumble Type II prior is better comparing to the corresponding Jeffrey's prior (under the same loss function) for all cases.

الجدوله لمقاييس متعددة الاداء == Scheduling with Multiple Performance Measures

Author name: علي عباس نعمان المالكي
Supervisor name: طارق صالح عبد الرزاق
General topic: Mathematics
Specific topic: Mathematics
Degree: Master
University: Mustansiriyah University - College Of Education For Pure Sciences - Department Of Mathematics
Language: English
University location: Baghdad
First pages:
Abstract: في هذه الرسالة تصغير دالة لمعياريين او ثلاثة والحاصلة من جدولة n من الاعمال على ماكنة واحدة . تم التركيزفي هذه الدراسة والاخذ بنظر الاعتبار على حالة التاخير اللاسالب والعمل المتاخر ووقت الاتمام الكلي . ونوقشت المسائل التالية : 1 . تصغير الدالة (Tmax+Vmax) . 2 .تصغيرالدالة ذات ثلاث معايير والتي تاخذ الصيغة Lex(Tmax+Vmax ,Σ■(n@i)Ci) وLex(Σ■(n@i)Ci , Tmax+Vmax ) . . (■(n@i)Ti + ■(n@i)Vi) تصغير الدالة .3 للمسالة الاولى اقترحنا خوارزمية التفرع والتقييد لايجاد الحل الامثل كذلك برهنا بعض الحالات الخاصة التي تؤدي الى الحل الامثل .كذلك اقترحنا خوارزمية (A) المطورة من خوارزمية لولر لحل المسالة وهذا قادنا الى ملاحظة مشجعه وهي ان اغلب النتائج الحسابية تؤدي الى الحل الامثل. كما واجرينا تجارب حسابية لطريقة التفرع والتقييد على مجموعة كبيرة لمسائل اختبارية. .للمسالة الثانية والتي هي تعميم للمسالة الاولى قمنا باستخدمنا قاعدة (SPT) وكذلك الخوارزمية (A) المطورة لايجاد افضل الحلول . للمسالة الثالثة اقترحنا خوارزمية التفرع والتقييد مع قيدين سفلي وقيد علوي الذي هو اصغر ثلاث قيود تقريبيه مقترحة لايجاد الحل كذلك برهنا بعض الحالات الخاصة واستخدمنا قواعد الهيمنة مع خوارزمية التفرع والتقييد لتحسين النتائج الحسابية لهذه المسالة. | This thesis intends, to minimize a function of two and three cost criteria for scheduling n jobs on a single machine. The study focuses on the case where Tardiness, late work and total Completion times are considered. The following problems are discussed 1. Minimizing a function of two criteria (Tmax+Vmax). 2.Minimizing a function of three criteria of the forms Lex(Tmax+Vmax,Σ■(n@i=1)Ci) and Lex(Σ■(n@i=1)Ci , Tmax+Vmax ). 3. Minimizing a function of two criteria (■(n@i=1)Ti + ■(n@i=1)Vi). For the first problem 1// Tmax+Vmax , a branch and bound algorithm are proposed to find optimal solution . Also, we proved some special cases for this problem which lead to optimal solution. An improved algorithm (A) for Lawler algorithm has been constructed for solving this problem, which leads to an interesting observation that the algorithm (A) will yield optimal solutions in all instances of the test problems. Also computational experience for the (BAB) algorithm is presented. For the second problem which is a generalization of the first problem we use either the SPT rule or modified algorithm (A) to find the best solutions. For the third problem we proposed a (BAB) algorithm with two lower bounds and upper bound which is the minimum of three heuristic methods .We proved some special cases which lead to the optimal solution . We used dominance rules with BAB algorithm to enhance the computational results for this problem

طرق تكرارية كفوءة لحل مسائل القيم الحدودية ذات النقطتين == Efficient Iterative Methods for Solving Two - Point Boundary Value Problems

Author name: علي حسين عباس
Supervisor name: مجيد احمد ولي
General topic: Mathematics
Specific topic: Mathematics
Degree: Master
University: University of Baghdad
Language: English
University location: Baghdad
First pages:
Abstract: قدمت في هذه الرساله ثلاثه طرق تكراريه موثوقه لحل مسائل القيم الحدوديه ذات النقطتين الخطيه وغير الخطيه. الطريقه الاولى تتناول تطبيق الاسلوب الشبه تحليلي لحل هذه المشكله. وفي هذه الطريقه تم الحصول على الحل بشكل متسلسله وبحسابات سهله. ان النتائج التي تم الحصول عليها لقيم الخطا المتبقي تبين ان هذه الطريقه فعاله جدا وموثوقهالطريقه الثانيه هي الطريقه التكراريه المطوره وتسمى DJM لحل هذه المشكله. هذه الطريقه تعطي حلا تقريبيا مع تقارب سريع. النتائج العدديه تثبت ان الطريقه المستخدمه هي طريقه موثوقه وفعاله. اما الطريقه الثالثه والاخيره تسمى طريقه متسلسله القوى لحل هذه المشكله. وهناك بعض الامثله العدديه قدمت لاثبات كفاءه هذه الطريقه وكما استخدمت بعض التطبيقات على هذه المشكله وحلها بواسطه هذه الطرق المذكوره. ان البرنامج المستخدم لايجاد هذه النتائج العدديه هو الماثيماتيك | In this thesis, three reliable iterative methods have been introduced to solve linear and nonlinear two - point boundary value problems (TPBVPs). The first method deals with the implementation of the semi - analytic method namely (TAM) to solve two - point boundary value problems. In TAM, the solution is obtained in the series form with easily computed components. The results of the maximal error remainder values show that the present method is very effective and reliable. The second method namely a new iterative method (NIM or DJM) to solve the TPBVPs. DJM gives an approximate solution with fast convergence. The numerical results prove that the suggested method is reliable and effective. The third and final method is called Power series method (PSM). It is presented to solve TPBVPs. Numerical examples are given to demonstrate the efficiency of the proposed method and some application of TPBVPs will be solved by this methods. The software used for the numerical calculation was MATHEMATICA® 10.0.

درجة افضل تقريب للدوال غير المقيدة في الفضاءات المحلية العامة الموزونة == The Degree of Best Approximation of Unbounded Functions in Locally - Global Weighted Spaces

Author name: علي حسين زبون
Supervisor name: صاحب كحيط جاسم الساعدي
General topic: Mathematics
Specific topic: Mathematics
Degree: Master
University: Mustansiriyah University - College Of Science - Department Of Mathematics
Language: English
University location: Baghdad
First pages:
Abstract: The aim of this thesis is to obtain the degree of best approximation of unbounded functions in locally - global weighted - space L_(P,δ,w) (X),1≤P<∞ using many kinds of polynomials such as I - Bernstein polynomials in terms of weighted Ditzain - Totik modulus of smoothness.II - Trigonometric polynomials S_n^* (f,x) and in addition to that we defined a new operator, which depends on Dirchlet Kernel G_(2n - 3n) - operator in terms of weighted Ditzain - Totik modulus of smoothness.III - q - Bernstein - Kantorovich B ̃_(n,q)^* (f,x) operator by using the locally second usual weighted modulus of smoothness.IV - The linear positive operators L_n^*⁡〖(f,x)〗 and K_n^*⁡〖(f,x)〗 for f∈L_(P,δ,w) (X),X=[0,∞) which is used to obtain the degree of the best approximation of this function in weighted space in terms of weighted modulus of function f.V - Szasz - Mirakjan - Beta U_n^* (f,x) and R ̃_n^* (f,x) operators in terms of weighted locally averaged modulus of smoothness.VI - Also supported by some important results to improve the approximation of unbounded functions classes.

افضل تقريب احادي الاتجاه لدوال غير مقيدة في الفضاء Lp,w (X) == The Best One Sided Approximation of Unbound ed Functions in Lp,w(X) Spaces

Author name: علاء عدنان عواد المحمدي
Supervisor name: صاحب كحيط جاسم الساعدي
General topic: Mathematics
Specific topic: Mathematics
Degree: Doctorate
University: Mustansiriyah University - College Of Science - Department Of Mathematics
Language: English
University location: Baghdad
First pages:
Abstract: This thesis is devoted to approximation of unbounded functions and deals with what is called one - sided approximation by positive linear operators and entire functions in Approximation Theory. More precisely, the existence of a sequence of polynomials which lie above (or below) a given unbounded functions and approximate it arbitrary well have been investigating. Our offer an overview of this subject in the spaces , starting with the early works of Freud and ending by the latest results in this area. This branch of estimate degree of best one - sided approximation was studied in last 60 years and now contains a big variety of techniques and approaches. Our developed modified methods on one - sided approximation in the space and obtain several results.The degree of best one - sided approximation for unbounded functions in the space , by using Hermite - Fejer interpolation polynomials on [ - 1,1] and the interpolation polynomials on [ - , ] have been studied and founded.In addition, the estimation of best one - sided approximation in , by Valle - Poussin operator and Jackson's polynomial in terms average modulus have studied.Furthermore, an estimate of best one - sided approximation in weighted space by using Bernstein polynomial and by spline polynomials in terms the kth local modulus of - continuity and Ditzian - Totic modulus of smoothness are also proposed with details.The direct and inverse inequalities of best one sided approximation by entire functions are proved in space. Some conditions have been used to prove the relations between degree of best multi approximation and best one - sided multi approximation on interval ,as well as some results consisting direct and converse theorems for one - sided multi approximation in space on interval have been proved.

جدولة متعددة المقاييس : نماذج رياضياتية وخوارزميات مضبوطة وتقريبية == Multicriteria Scheduling : Mathematical Models, Exact and Approximation Algorithms

Author name: عدوية علي محمود النعيمي
Supervisor name: طارق صالح عبد الرزاق
General topic: Mathematics
Specific topic: Mathematics
Degree: Doctorate
University: Mustansiriyah University - College Of Science - Department Of Mathematics
Language: English
University location: Baghdad
First pages:
Abstract: هذه الاطروحة مخصصة لمسائل جدولة متعددة المقاييس وعرضت بستة فصول.الفصلين الاول والثاني هي مقدمة وفيها مختلف المفاهيم لصيغ مسائل متعددة المقاييس وناقشنا طرائق الحل المعروفة لمسائل الجدولة وتحتوي الفصول الثلاثة البحث الاساسي على مختلف المقاييس لمسالة جدولة ماكنة واحدة.هذه الاطروحة تقدم نماذج رياضياتية وخوارزميات لايجاد الحلول الكفوءة، المثلى والتقريبية لمسائل جدولة متعددة المقاييس.استخدمنا تقنيات التفرع والتقيد لتصغير المقياسين : مجموع الاجزاء للاعمال المتاخرة (∑Vj) واعظم جزء لعمل متاخر (Vmax). هذه المسالة رمز لها 1//F(∑Vj,Vmax)، واقترحت خوارزمية كفوءة (ADA) لايجاد مجموعة حلول كفوءة لها. قدمت ايضا خوارزمية التفرع والتقيد (BAB) لايجاد حل امثل لمسالة تصغير الدالة الخطية ∑Vj+Vmax. الصعوبة للمسالة الاخيرة تقترح بانه ليس بالامكان دائما ايجاد حل امثل بسرعة. لذلك استخدمت خوارزميات بحث محلية (local search algorithms) وهي descent method (DM), simulated annealing (SA) algorithm and genetic algorithm (GA) لايجاد حلول قريبة من الحل الامثل وبزمن حسابي اقل.اقترحت خوارزمية كفوءة لايجاد الحلول الكفوءة لمسالة الماكنة الواحدة مع اوقات تحضير التي رمز لها 1/rj/F(Tmax,Vmax). قدمت ايضا خوارزمية التفرع والتقيد (BAB) لايجاد حل امثل لمسالة تصغير الدالة الخطية Tmax+Vmax مع اوقات تحضير. استخدمت لهذه المسالة ايضا خوارزميات بحث محلية (local search algorithms) لايجاد حلول تقريبية.درست مسائل جدولة متعددة المقاييس على ماكنة واحدة لايجاد مجموعة حلول كفوءة للمسائل العامة 1//F(∑Cj, Tmax, Vmax)، 1//F(∑Cj, ∑Vj, Vmax)، 1//F(∑Cj, ∑Vj, Tmax)، 1//F(∑C2j, Tmax, Vmax)، 1//F(∑Cj, Tmax+Vmax). اقترحـت الخوارزمية الكفؤة (ADA1) لحل هذه المسائل. اقترحـت ايضا خوارزميتيــن لايجاد افضــل حـل ممكن لكـل من المسالتيـن الهرميتيـن 1//Lex(Vmax,∑Cj,Tmax) و1//Lex(Vmax,Tmax,∑Cj).الخوارزميات الكفوءة المقترحة هي عامة ويمكن استخدامها لايجاد مجموعة الحلول الكفوءة الفعلية (strict Pareto optimal) لمسائل جدولة متعددة المقاييس. نتائجنا التجريبية تشير الى ان الخوارزميات المقترحة تجد الحلول الكفوءة بشكل فعال في معظم الحالات وايضا، نتائجنا الحسابية تبين بان الخوارزمية (GA) فعالة اكثر للمسائل 1//∑Vj+Vmax و1/rj/Tmax+Vmax. اخيرا، قدمت استنتاجاتنا مع بعض المقترحات لبحوث مستقبلية. | This thesis is devoted to multicriteria scheduling problems. It is presented in six chapters.The first two chapters are introductory in which we give various aspects of multicriteria problem formulation and we discuss the well known methods of solution for machine scheduling problem.The next three chapters contain original research on various multicriteria single machine scheduling.This thesis presents the mathematical models and algorithms for generating efficient, optimal and approximation solutions for multicriteria scheduling problems.We use branch and bound techniques for minimizing the two criteria : the total late work (∑Vj) and the maximum late work (Vmax), this problem is denoted by 1//F(∑Vj,Vmax). An efficient algorithm (ADA) is proposed to find efficient solutions set. A branch and bound (BAB) algorithm is also presented to find optimal solution for the problem of minimizing a linear function ∑Vj+Vmax. The NP - hardness of the last problem suggests that it is not always possible to find an optimal solution quickly. Therefore, local search algorithms (descent method (DM), simulated annealing (SA) algorithm and genetic algorithm (GA)) are used to find approximation solutions that are close to the optimum with less computational time.An efficient algorithm is proposed, to find efficient solutions for one machine problem with release dates denoted by 1/rj/F(Tmax,Vmax). A branch and bound (BAB) algorithm is also presented to find optimal solution for the problem of minimizing a linear function Tmax+Vmax with release dates. For this problem also local search algorithms are used to find approximation solutions.The multicriteria scheduling problems are studied on a single machine to find efficient solutions set for the general problems 1//F(∑Cj,Tmax,Vmax), 1//F(∑Cj,∑Vj,Vmax), 1//F(∑Cj, ∑Vj, Tmax), 1//F(∑C2j, Tmax,Vmax) and 1//F(∑Cj,Tmax+Vmax). An efficient algorithm (ADA1) is proposed for solving these problems. Also two algorithms are proposed to find the best possible solution for each of the two hierarchical problems 1//Lex(Vmax, ∑Cj,Tmax) and 1//Lex(Vmax, Tmax, ∑Cj).The proposed efficient algorithms are general and can be used to enumerate the set of strict Pareto optimal for the multicriteria scheduling problems. Our experimental results indicate that the proposed algorithms find efficient solutions optimality in most cases. Also, our computational results show that the genetic algorithm (GA) is more effective for the problems 1//(∑Vj+Vmax) and 1/rj/(Tmax+Vmax). Finally, our conclusions together with some suggestions for future researches are given

بعض طرائق التقدير لمعلمتي توزيع باريتو من النوع الاول باستخدام المحاكاة مع تطبيقات عملية == Some Estimation Methods for the Parameters of Pareto type I by using Simulation with Practical Application

Author name: عدويه ناجي عطيوي الخشالي
Supervisor name: حازم منصور كوركيس
General topic: Mathematics
Specific topic: Applied Mathematics
Degree: Master
University: University of Baghdad
Language: English
University location: Baghdad
First pages:
Abstract: تناولت رسالة الماجستير هذه مناقشة العديد من الخصائص الاحصائية لتوزيع باريتو من النوع الاول ذو المعلمتين، كذلك تم التطرق الى العلاقة بين توزيع باريتو وعدد من التوزيعات المستمرة الاخرى.ان الغرض من الرسالة هو مقارنة طريقة بيز القياسية مع اربعة من الطرق التقليدية لتقدير معلمتي الشكل والقياس باستخدام طريقة مونت - كارلو لمحاكاة نماذج مختلفة.وقد تبين من خلال الدراسة ان مقدر بايز افضل من المقدرات الاخرى لتقدير المعالم باستخدام متوسط مربعات الخطا (M.S.E) من اجل المقارنة بين افضلية مقدرات طرائق التقدير المختلفة ولحجوم العينات المختلفة. علاوة على ذلك، تناول الباحث بعض التطبيقات الحقيقية من الحياة والتي تتوزع بعضها توزيع باريتو.تم استخراج النتائج عن طريق كتابة برامج باستخدام برنامج الماتلاب MATLAB R2013b. | In this thesis several statistical properties for Pareto distribution type one with two parameters had been discussed. The relationship of Pareto distribution with many other continuous distributions is also presented. However, the main purpose of this thesis is to compare between standard Bayes method and four classical methods to estimate the shape and scale parameters by using Monte Carlo simulation method for different models. It had been shown that standard Bayes estimator is better than other estimators in the sense of MSE by assuming different sample sizes. Moreover, some real life applications related to Pareto distribution are given. The computer programs are writing and the run is made by using MATLAB (R2013b) professional software.

تصميم شبكات عـصبية ملائمة لحل مسائل القيم الذاتية وتطبيقاتها == Design Suitable Neural Networks to Solve Eigen Value Problems and It?s Application

Author name: عثمان مهدي صالح
Supervisor name: عثمان مهدي صالح
General topic: Mathematics
Specific topic: Applied Mathematics
Degree: Master
University: University of Baghdad
Language: English
University location: Baghdad
First pages:
Abstract: الهدف من هذه الرسالة هو تصميم شبكات عصبية ملائمة ذات تغذية تقدمية كطريقة لحل مسائل القيم الذاتية للمعادلات التفاضلية الاعتيادية الشاذة وغير الشاذة ذات الشروط الحدودية. الشبكة المقترحة تتعلق بحساب القيم الذاتية والدالة الذاتية المرافقة لها والتي تمثل الحل الغير صفري لنموذج المسالة.ايضا ناقشنا عدد من خوارزميات الاداء ذات المستوى العالي المستخدمة في خوارزميات تدريب الانتشار المرتد للشبكات العصبية ذات التغذية التقدمية وعرض نتائج المقارنة الحاصلة من تطبيق MATLAB مثل ﻟﻴفنبرﻙ - ماركواردت , شبيه نيوتن, تنظيم بيزن, ومن ثم تسريع اداء الشبكات المقترحة من خلال تعديل خوارزميات التدريب هذه, حيث ان بعضها يمتلك نسبة تقارب سريعة جدا لشبكات ذات احجام معقولة.الهدف الاخر لهذه الرسالة هو تحسين خوارزمية التدريب ﻟﻴفنبرﻙ - ماركوارت من خلال الاختيار المناسب للمعامل μk والذي يضمن التقارب لخوارزمية التدريب هذه.ايضا عالجنا عدة مشاكل واجهتنا اثناء تقنية التدريب مثل : التوقف المبكر, خزن الذاكرة , التنظيم وحساب مصفوفة هيسين ومعكوسها.اخيرا تم توضيح الشبكات المقترحة من خلال حل مسائل متنوعة ومقارنتها مع حلول بطرق مختلفة اخرى لاثبات سرعة , دقة وفاعلية استخدام تقنية الشبكات في حل هذا النوع من المعادلات. | The aim of this thesis is to design suitable feed forward neural networks to present a method to solve eigenvalue problems for non - singular ordinary differential equations with boundary conditions. The suggested networks concerned with the computation of eigenvalues and associated eigenfunction which represent the nontrivial solution of the problem model. Also, we will discuss several high performance algorithms used in back propagation training of the feed forward neural networks and present comparative results obtained in MATLAB implementation such as : Levenberg - Marquardt, quasi - Newton and Bayesian regularization, update procedure, then speeding suggested networks by modification these training algorithms, many of them have a very fast convergence rate for reasonable size networks.Other aims of this thesis is to modify Levenberg - Marquardt training algorithm by suitable choice of the parameter μk which guarantee super linearly convergence for this training algorithm. Also, we treat many problems that confront during the training technique such as : early stopping, memory storage, regularization and calculating of Hessian matrix and its inverse.Finally, illustrate the suggested networks by solving a variety of model problems and present comparisons with solutions obtained using other different methods to show speed, accuracy and effectiveness of using the networks technique for solving this type of equations

المقاسات الجزيئة المقاسات المستحوذة على 2 وبعض اعماماتها == 2 - Absorbing Submdules (Modules) and Some of Their Generalizations

Author name: عبد الرحمن عبد الله حرفش
Supervisor name: انعام محمد علي هادي
General topic: Mathematics
Specific topic: Mathematics
Degree: Master
University: University of Baghdad
Language: English
University location: Baghdad
First pages:
Abstract: Let R be a commutative ring with identity, and let M be a unitary left Rmodule. Prime ideals one of the main concepts in ring theory and many generalizations of this concept are introduced such as strongly prime ideals, almost prime ideals, weakly prime ideals, semi - prime ideals, weakly semiprime ideals and 2 - absorbing ideals. Moreover each of the above concepts generalized to submodules. Main goals in this work :  Presenting a comprehensive study of 2 - absorbing submodules and giving many new characterizations and properties related with this concept. Also we use this concept to define and study a new class of modules which is called 2 - absorbing modules.  Introducing and studying many generalizations of 2 - absorbing submodules, 2 - absorbing modules. In fact we introduce and study semi - 2 - absorbing submodules, semi - 2 - absorbing modules, Endo 2 - absorbing submodules, Endo semi - 2 - absorbing submodules, Endo 2 - absorbing modules and Endo semi - 2 - absorbing modules.  Presenting other kinds of 2 - absorbing submodules(resp.2 - absorbing modules) namely small 2 - absorbing submodules (resp. small 2 - absorbing modules ). Then Endo small 2 - absorbing submodules (resp. Endo small 2absorbing modules) are introduced and studied.

القابلية على السيطرة لبعض انظمة السيطرة بواسطة نظرية شبه الزمرة == The Controllability of Some Control Systems Via Semigroup Theory

Author name: عبد الرحمن حميد نجم حسين
Supervisor name: نصيف جاسم الجواري
General topic: Mathematics
Specific topic: Mathematics
Degree: Master
University: Mustansiriyah University - College Of Science - Department Of Mathematics
Language: English
University location: Baghdad
First pages:
Abstract: في هذا العمل، تم ادخال الشروط الكافية لمفهوم القابلية على السيطرة لانظمة غير خطية ذات الشرط الابتدائي والحدودي في فضاءات بناخ المحدبة بشكل منتظم, واثباتها باستخدام نظرية شبه الزمرة (شبه الزمرة المستمرة بقوة) وبعض الطرائق التقنية ضمن التحليل الدالي غير الخطي مثل نظرية النقطة الصامدة لكيرك. علاوة على ذلك, تم اعطاء بعض الامثلة التي توضح قيمة النتائج اعلاه. كذلك تم تقديم النتائج التي تتعامل مع قابلية السيطرة لانظمة غير خطية ذات الشرط الابتدائي والحدودي في فضاءات بناخ وذلك باستخدام نظرية النقطة الصامدة لكل من بناخ وشويدر. | In this thesis, the sufficient conditions for controllability concept of certain nonlinear initial and boundary - value systems in uniformly convex Banach spaces are introduced, and proved by using semigroup theory "strongly continuous semigroup" and some techniques of nonlinear functional analysis, such as, Kirk fixed point theorem. Moreover, examples which illustrate mathematical justification of these theorems are given. Also, the above results for controllability of nonlinear initial and boundary - value systems in any Banach spaces have been presented by using Banach's and Schauder's fixed point theorem.

التماثيل في المعادلات التفاضلية == SYMMETRY OF DIFFERENTIAL EQUATIONS

Author name: طلعت جاسم محمود
Supervisor name: انعام عبد الرحمن ملوكي
General topic: Mathematics
Specific topic: Differential Equations
Degree: Master
University: Mustansiriyah University - College Of Science - Department Of Mathematics
Language: English
University location: Baghdad
First pages:
Abstract: Symmetries of a system of di erential equations are transformations, which transform the family of solutions of a system of di erential equations to itselves. In fact, the theory of symmetry of di erential equations in arguably one of the most successful methods in nding the solutions of di erential equations, this theory uni es a number of previously unrelated methods into a single method. However, as with all theories, there are instances in which it provide no useful information. Thus extensions and generalizations of the method are necessary to broader the class of equations analyzed by this method. In this thesis, a general view about the subject of classical symmetry and its generalization on di erential equations is considered, classical symmetry for many di erential equations using Lie's algorithm or Maple program have been calculated. A comparison between the classical and nonclassical symmetries, and we have found, some nonclassical symmetries of the Benjamin Bona Mahony equation and some weak symmetries for this equation, which have been used to nd exact solution for this equation.Moreover, this thesis studied some applications for symmetry which can be used to solve di erential equations, such as : Finding the hidden symmetries and their origins (sources) for some ODEs and for Benjamin Bona Mahony equation, nding discrete symmetry, by using continuous symmetry, and we got new symmetries which can be considered as a composition of continuous and discrete symmetries, solving boundary value problems of di erential equation and nding the boundary conditions which are consistent with symmetry of the di erential equation. Moreover, the Clarkson problem was discussed in order to know whether the di erential equation possess a nonclassical symmetries, without solving the problem and that by using hidden symmetries.

المقاسات الغامرة الخاصة == Special Injective Modules

Author name: شيماء نوري عبد الرضا
Supervisor name: مهدي صادق عباس
General topic: Mathematics
Specific topic: Mathematics
Degree: Master
University: Mustansiriyah University - College Of Science - Department Of Mathematics
Language: English
University location: Baghdad
First pages:
Abstract: قمنا بتعميم مفهوم المقاسات الغامرة (المقاسات الغامرة النسبية)الى المقاسات الغامرة الخاصة (المقاسات الغامرة النسبية الخاصة ) كثير من الحقائق والتشخيصات للمقاسات الغامرة تم توسيعها على هذا النوع المعمم من المقاسات .تم اعطاء توصيفات متعددة للحلقات شبه البسيطة الارتينية بدلالة تلك المقاسات تمت دراسة حلقات التشاكلات الذاتية للمقاسات الغامرة النسبية الخاصة .تم التامل في بعض الاطياف لمقاسات غامرةخاصة , نقصد بذلك دراسة مفهوم الخصوصية على المقاسات شبه الغامرة ,مقاسات شبه غامرة رئيسية ومقاسات كاذبة - غامرة نسبية واخيرا درسنا الصفات التبولوجية للغمر الخاص . | The notion of injective modules (relative injective modules) is generalized to that of special injective modules (special relative injective modules).Many properties and characterizations of injective modules are extended to these modules characterizations of semi simple Artinian rings are given in term of those module.The present study treats the endomorphism rings of special relative injective modules. It considers some spectra of special injection modules, namely, It considers the property of specialty to quasi - injective modules, principally quasi - injective modules and relative pseudo - injective modules.Finally, the study tackles the topological properties of special injectivity.

حل المسالة العكسية للكسوريات من خلال الاساليب التطويرية المثلى وتطبيقاتها

Author name: شيماء سلمان عبد
Supervisor name: نادية محمد غانم | نصيف جاسم الجواري
General topic: Mathematics
Specific topic: Mathematics
Degree: Doctorate
University: Mustansiriyah University - College Of Science - Department Of Mathematics
Language: English
University location: Baghdad
First pages:
Abstract: Fractal image coding based on the inverse problem of an iterated function system plays an essential role in several areas of computer graphics and in many other interesting applications. Despite this method have received much attention because of its high resolution and fast decoding and many other advantages, but it has not been used widely because, it required high computation time in the encoding process. Genetic algorithm as an efficient optimization approach is highly used to solve such problems. In this study, this technique is improved and implemented, and another improvement that helps to optimize the search space in the target image is proposed, this is through reaching of global optimum in a single run. It is known as crowding method. The first use of this method in solving of fractal inverse problem shows acceptable result, especially, in reducing of the encoding time and obtaining of good quality images. Although, crowding method provides a satisfactory results in comparing to the original Jacquin and genetic algorithm techniques, but it concentrates on the best elements in the population of the search space. To support global exploration and prevent trapping in local optima, a new probability is added, which helps to satisfy diversity in the population selection from both the best and worst individuals. This is satisfied through proposing of a new diversity method to reduce being trapped in local optima, and improve the time complexity of the algorithm. The relation between searching for an optimum solution and playing music is known as harmony search algorithm (HAS). This algorithm is used in this study for the first time to solve fractal inverse problem. It has been proved that access to find music harmony corresponds to solving of an optimization problem searching for an optimal solution. In comparing to the original technique, the experiments on the three proposed approaches show their efficiency and effectivity In this study, a new method that combines fractal dimension (FD) which is an indicator of image complexity with the FIC scheme is proposed. Classifying images in databases according to their texture by using FD helps reduce the retrieval time of query images. The validity of the proposed method is evaluated using geosciences images. Result shows that the method is computationally attractive.

مقدرات بيز وبيز التجريبي لتوزيع لوماكس == Bayes and Empirical Bayes Estimators for Lomax Distribution

Author name: شهد سعد علوان
Supervisor name: نادية هاشم النور
General topic: Mathematics
Specific topic: Mathematics
Degree: Master
University: Mustansiriyah University - College Of Science - Department Of Mathematics
Language: English
University location: Baghdad
Abstract: Point estimation is one of the core topics in mathematical statistics.The main aim of this study is to discuss the most common methods of point estimation : non - Bayes, Bayes and empirical Bayes methods. We consider these estimation methods to estimate the shape parameter, reliability and failure rate functions of Lomax distribution based on complete data. The maximum likelihood, moment and uniformly minimum variance unbiased estimators are obtained as non - Bayes estimators. Bayes and empirical Bayes estimators are obtained corresponding to three informative priors "gamma, chi - square and inverted Levy" based on symmetric "squared error" and asymmetric "LINEX and general entropy" loss functions. Comparisons are made between different estimators empirically via Monte Carlo simulation study. The estimates of the shape parameter were compared based upon the mean squared error while the estimates of reliability and failure rate functions were compared based upon the integrated mean squared error. Among the set of conclusions that have been reached, it is observed that, for all sample sizes and different cases, the performance of uniformly minimum variance unbiased estimator is better than other non - Bayes estimator for estimating the shape parameter and failure rate function of Lomax distribution. Also, it is observed that conjugate gamma prior record full appearance as best prior distribution with Bayes estimates for reliability function. Further that, Monte Carlo simulation results indicate that the performance of Bayes and empirical Bayes estimator for some cases are better than non - Bayes for some appropriate of prior distribution, loss function, values of parameters and sample size.
1 ... 29 30 31 32 33 ... 65