Preferred Language
Articles
/
bsj-4699
An Efficient Algorithm for Fuzzy Linear Fractional Programming Problems via Ranking Function
...Show More Authors

In many applications such as production, planning, the decision maker is important in optimizing an objective function that has fuzzy ratio two functions which can be handed using fuzzy fractional programming problem technique. A special class of optimization technique named fuzzy fractional programming problem is considered in this work when the coefficients of objective function are fuzzy. New ranking function is proposed and used to convert the data of the fuzzy fractional programming problem from fuzzy number to crisp number so that the shortcoming when treating the original fuzzy problem can be avoided. Here a novel ranking function approach of ordinary fuzzy numbers is adopted for ranking of triangular fuzzy numbers with simpler and easier calculations as well as shortening in the procedures. The fuzzy fractional programming problem is the first reduced to a fractional programming problem and then solved with the technique to obtain the optimal solution. It has a power to give a best solution for supporting the solution theory proposed in this work, some numerical fuzzy fractional programming problem are included to ensure the advantage, efficiency and accuracy of the suggested algorithm. In addition, this research paper describes a comparison between our optimal solutions with other existing solutions for inequalities constrains fuzzy fractional program.

Scopus Clarivate Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Mon Jul 01 2019
Journal Name
Iop Conference Series: Materials Science And Engineering
Fuzzy orbit topological spaces
...Show More Authors
Abstract<p>The concept of fuzzy orbit open sets under the mapping <italic>f</italic>:<italic>X</italic> → <italic>X</italic> in a fuzzy topological space (<italic>X</italic>,<italic>τ</italic>) was introduced by Malathi and Uma (2017). In this paper, we introduce some conditions on the mapping <italic>f</italic>, to obtain some properties of these sets. Then we employ these properties to show that the family of all fuzzy orbit open sets construct a new fuzzy topology, which we denoted by <italic>τ</italic> <sub> <italic>F0</italic> </sub> coarser </p> ... Show More
View Publication
Scopus (1)
Scopus Crossref
Publication Date
Mon Aug 01 2022
Journal Name
Journal Of Physics: Conference Series
Fibrewise Fuzzy Separation Axioms
...Show More Authors
Abstract<p>Within that research, we introduce fibrewise fuzzy types of the most important separation axioms in ordinary fuzz topology, namely fibrewise fuzzy (T 0 spaces, T 1 spaces, R 0 spaces, Hausdorff spaces, functionally Hausdorff spaces, regular spaces, completely regular spaces, normal spaces, and normal spaces). Too we add numerous outcomes about it.</p>
View Publication
Scopus (3)
Scopus Crossref
Publication Date
Fri Apr 01 2011
Journal Name
Al-mustansiriyah Journal Of Science
A Genetic Algorithm Based Approach For Generating Unit Maintenance Scheduling
...Show More Authors

Publication Date
Mon Jul 01 2019
Journal Name
2019 International Joint Conference On Neural Networks (ijcnn)
A Fast Feature Extraction Algorithm for Image and Video Processing
...Show More Authors

View Publication
Scopus (40)
Crossref (38)
Scopus Clarivate Crossref
Publication Date
Thu Feb 01 2024
Journal Name
Baghdad Science Journal
A Novel Gravity ‎Optimization Algorithm for Extractive Arabic Text Summarization
...Show More Authors

 

An automatic text summarization system mimics how humans summarize by picking the most ‎significant sentences in a source text. However, the complexities of the Arabic language have become ‎challenging to obtain information quickly and effectively. The main disadvantage of the ‎traditional approaches is that they are strictly constrained (especially for the Arabic language) by the ‎accuracy of sentence feature ‎functions, weighting schemes, ‎and similarity calculations. On the other hand, the meta-heuristic search approaches have a feature tha

... Show More
View Publication Preview PDF
Scopus (1)
Scopus 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
Fri Feb 08 2019
Journal Name
Journal Of The College Of Education For Women
Minimum Spanning Tree Algorithm for Skin Cancer Image Object Detection
...Show More Authors

This paper proposes a new method Object Detection in Skin Cancer Image, the minimum
spanning tree Detection descriptor (MST). This ObjectDetection descriptor builds on the
structure of the minimum spanning tree constructed on the targettraining set of Skin Cancer
Images only. The Skin Cancer Image Detection of test objects relies on their distances to the
closest edge of thattree. Our experimentsshow that the Minimum Spanning Tree (MST) performs
especially well in case of Fogginessimage problems and in highNoisespaces for Skin Cancer
Image.
The proposed method of Object Detection Skin Cancer Image wasimplemented and tested on
different Skin Cancer Images. We obtained very good results . The experiment showed that

... Show More
View Publication Preview PDF
Publication Date
Thu May 01 2008
Journal Name
2008 International Conference On Computer And Communication Engineering
A binary Particle Swarm Optimization for attacking knapsacks Cipher Algorithm
...Show More Authors

View Publication
Scopus (11)
Crossref (6)
Scopus Clarivate Crossref
Publication Date
Sun Jun 12 2011
Journal Name
Baghdad Science Journal
Development Binary Search Algorithm
...Show More Authors

There are many methods of searching large amount of data to find one particular piece of information. Such as find name of person in record of mobile. Certain methods of organizing data make the search process more efficient the objective of these methods is to find the element with least cost (least time). Binary search algorithm is faster than sequential and other commonly used search algorithms. This research develops binary search algorithm by using new structure called Triple, structure in this structure data are represented as triple. It consists of three locations (1-Top, 2-Left, and 3-Right) Binary search algorithm divide the search interval in half, this process makes the maximum number of comparisons (Average case com

... Show More
View Publication Preview PDF
Crossref
Publication Date
Sun Dec 01 2013
Journal Name
Journal Of Economics And Administrative Sciences
CALCULATION BIASES FOR COEFFICIENTS AND SCALE PARAMETER FOR LINEAR (TYPE 1) EXTREME VALUE REGRESSION MODEL FOR LARGEST VALUES
...Show More Authors

Abstract

Characterized by the Ordinary Least Squares (OLS) on Maximum Likelihood for the greatest possible way that the exact moments are known , which means that it can be found, while the other method they are unknown, but approximations to their biases correct to 0(n-1) can be obtained by standard methods. In our research expressions for approximations to the biases of the ML estimators (the regression coefficients and scale parameter) for linear (type 1) Extreme Value Regression Model for Largest Values are presented by using the advanced approach depends on finding the first derivative, second and third.

View Publication Preview PDF
Crossref