Preferred Language
Articles
/
BRef848BVTCNdQwCnIFF
Reliable computational methods for solving Jeffery-Hamel flow problem based on polynomial function spaces
...Show More Authors

In this paper reliable computational methods (RCMs) based on the monomial stan-dard polynomials have been executed to solve the problem of Jeffery-Hamel flow (JHF). In addition, convenient base functions, namely Bernoulli, Euler and Laguerre polynomials, have been used to enhance the reliability of the computational methods. Using such functions turns the problem into a set of solvable nonlinear algebraic system that MathematicaⓇ12 can solve. The JHF problem has been solved with the help of Improved Reliable Computational Methods (I-RCMs), and a review of the methods has been given. Also, published facts are used to make comparisons. As further evidence of the accuracy and dependability of the proposed methods, the maximum error remainder (MERn) has been calculated. The results have been provided strong evidence that the RCMs and I-RCMs are credible and accurate methods for obtaining approximate solutions to this problem.

Scopus Clarivate Crossref
View Publication
Publication Date
Wed Mar 30 2022
Journal Name
Journal Of Economics And Administrative Sciences
Comparing Some Methods of Estimating the Parameters and Survival Function of a Log-logistic Distribution with a Practical Application
...Show More Authors

The Log-Logistic distribution is one of the important statistical distributions as it can be applied in many fields and biological experiments and other experiments, and its importance comes from the importance of determining the survival function of those experiments. The research will be summarized in making a comparison between the method of maximum likelihood and the method of least squares and the method of weighted least squares to estimate the parameters and survival function of the log-logistic distribution using the comparison criteria MSE, MAPE, IMSE, and this research was applied to real data for breast cancer patients. The results showed that the method of Maximum likelihood best in the case of estimating the paramete

... Show More
View Publication Preview PDF
Crossref
Publication Date
Sat May 01 2021
Journal Name
Journal Of Physics: Conference Series
A Parallel Adaptive Genetic Algorithm for Job Shop Scheduling Problem
...Show More Authors

Publication Date
Sat Jan 01 2005
Journal Name
Iraqi Journal Of Science
Comparison between Zernike moment and central moments for matching problem
...Show More Authors

Moment invariants have wide applications in image recognition since they were proposed.

Publication Date
Wed Apr 25 2018
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Local Search Algorithms for Multi-criteria Single Machine Scheduling Problem
...Show More Authors

   Real life scheduling problems require the decision maker to consider a number of criteria before arriving at any decision. In this paper, we consider the multi-criteria scheduling problem of n jobs on single machine to minimize a function of five criteria denoted by total completion times (∑), total tardiness (∑), total earliness (∑), maximum tardiness () and maximum earliness (). The single machine total tardiness problem and total earliness problem are already NP-hard, so the considered problem is strongly NP-hard.

We apply two local search algorithms (LSAs) descent method (DM) and simulated annealing method (SM) for the 1// (∑∑∑

... Show More
View Publication Preview PDF
Crossref (2)
Crossref
Publication Date
Mon Sep 25 2017
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Comparison of the Suggested loss Function with Generalized Loss Function for One Parameter Inverse Rayleigh Distribution
...Show More Authors

The experiences in the life are considered important for many fields, such as industry, medical and others. In literature, researchers are focused on flexible lifetime distribution.

In this paper, some Bayesian estimators for the unknown scale parameter  of Inverse Rayleigh Distribution have been obtained, of different two loss functions, represented by Suggested and Generalized loss function based on Non-Informative prior using Jeffery's and informative prior represented by Exponential distribution. The performance of   estimators is compared empirically with Maximum Likelihood estimator, Using Monte Carlo Simulation depending on the Mean Square Error (MSE). Generally, the preference of Bayesian method of Suggeste

... Show More
View Publication Preview PDF
Publication Date
Mon Apr 20 2020
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Bayesian Inference for the Parameter and Reliability Function of Basic Gompertz Distribution under Precautionary loss Function
...Show More Authors

     In this paper, some estimators for the unknown shape parameter and reliability function of Basic Gompertz distribution have been obtained, such as Maximum likelihood estimator and Bayesian estimators under Precautionary loss function using Gamma prior and Jefferys prior. Monte-Carlo simulation is conducted to compare mean squared errors (MSE) for all these estimators for the shape parameter and integrated mean squared error (IMSE's) for comparing the performance of the Reliability estimators. Finally, the discussion is provided to illustrate the results that summarized in tables.

View Publication Preview PDF
Crossref
Publication Date
Mon Jul 20 2020
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Exact Solutions for Minimizing cost Function with Five Criteria and Release Dates on Single Machine
...Show More Authors

     In this paper, we present a Branch and Bound (B&B) algorithm of scheduling (n) jobs on a single machine to minimize the sum total completion time, total tardiness, total earliness, number of tardy jobs and total late work with unequal release dates. We proposed six heuristic methods for account upper bound. Also to obtain lower bound (LB) to this problem we modified a (LB) select from literature, with (Moore algorithm and Lawler's algorithm).  And some dominance rules were suggested. Also, two special cases were derived. Computational experience showed the proposed (B&B) algorithm was effective in solving problems with up to (16) jobs, also the upper bounds and the lower bound were effective in restr

... Show More
View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Thu Jan 01 2009
Journal Name
Ibn Al– Haitham Journal For Pure And Applied Science
Some Results on Fibrewise Lindelöf and Locally Lindelöf Topological Spaces
...Show More Authors

In this paper we define and study new concepts of fibrewise topological spaces over B namely, fibrewise Lindelöf and locally Lindelöf topological spaces, which are generalizations of will-known concepts: Lindelöf topological space (1) "A topological space X is called a Lindelöf space if for every open cover of X has a countable subcover" and locally Lindelöf topological space (1) "A topological space X is called a locally Lindelöf space if for every point x in X, there exist a nbd U of x such that the closure of U in X is Lindelöf space". Either the new concepts are: "A fibrewise topological space X over B is called a fibrewise Lindelöf if the projection function p : X→B is Lindelöf" and "The fibrewise topological space X over B

... Show More
Preview PDF
Publication Date
Mon Mar 11 2019
Journal Name
Baghdad Science Journal
Properties of Fuzzy Compact Linear Operators on Fuzzy Normed Spaces
...Show More Authors

In this paper the definition of fuzzy normed space is recalled and its basic properties. Then the definition of fuzzy compact operator from fuzzy normed space into another fuzzy normed space is introduced after that the proof of an operator is fuzzy compact if and only if the image of any fuzzy bounded sequence contains a convergent subsequence is given. At this point the basic properties of the vector space FC(V,U)of all fuzzy compact linear operators are investigated such as when U is complete and the sequence ( ) of fuzzy compact operators converges to an operator T then T must be fuzzy compact. Furthermore we see that when T is a fuzzy compact operator and S is a fuzzy bounded operator then the composition TS and ST are fuzzy compact

... Show More
View Publication Preview PDF
Scopus (13)
Crossref (6)
Scopus Clarivate Crossref
Publication Date
Thu Apr 26 2018
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Normalization Bernstein Basis For Solving Fractional Fredholm-Integro Differential Equation
...Show More Authors

In this work, we employ a new normalization Bernstein basis for solving linear Freadholm of fractional integro-differential equations  nonhomogeneous  of the second type (LFFIDEs). We adopt Petrov-Galerkian method (PGM) to approximate solution of the (LFFIDEs) via normalization Bernstein basis that yields linear system. Some examples are given and their results are shown in tables and figures, the Petrov-Galerkian method (PGM) is very effective and convenient and overcome the difficulty of traditional methods. We solve this problem (LFFIDEs) by the assistance of Matlab10.   

View Publication Preview PDF
Crossref