Preferred Language
Articles
/
ijs-7175
Some Transformation Properties with Omitted Value
...Show More Authors

     The purpose of this  paper is to show that for a holomorphic and univalent function in class S, an omitted –value transformation  yields a class of starlike functions as a rotation transformation of  the Koebe function, allowing both the image and rotation of the function

   to be connected. Furthermore, these functions have several properties that are not far from a convexity properties. We also show that Pre- Schwarzian derivative is not invariant since the convexity property of the function   is so weak.

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Mon Nov 01 2021
Journal Name
Journal Of Engineering
Numerical Study for the Tube Rotation Effect on Melting Process in Shell and Tube Latent Heat Energy Storage LHES System
...Show More Authors

Although renewable energy systems have become an interesting global issue, it is not continuous either daily or seasonally. Latent heat energy storage (LHES) is one of the suitable solutions for this problem. LHES becomes a basic element in renewable energy systems. LHES compensate for the energy lack when these systems are at low production conditions. The present work considered a shell and tube LHES for numerical investigation of the tube rotation influence on the melting process. The simulation and calculations were carried out using ANSYS Fluent software. Paraffin wax represents the phase change material (PCM) in this work, while water was selected to be the heat transfer fluid (HTF). The calculations were carried o

... Show More
View Publication Preview PDF
Crossref (7)
Crossref
Publication Date
Sun Jan 01 2012
Journal Name
International Journal Of Computer Science Issues (ijcsi)
Near Rough and Near Exact Subgraphs in Gm-Closure spaces
...Show More Authors

The basic concepts of some near open subgraphs, near rough, near exact and near fuzzy graphs are introduced and sufficiently illustrated. The Gm-closure space induced by closure operators is used to generalize the basic rough graph concepts. We introduce the near exactness and near roughness by applying the near concepts to make more accuracy for definability of graphs. We give a new definition for a membership function to find near interior, near boundary and near exterior vertices. Moreover, proved results, examples and counter examples are provided. The Gm-closure structure which suggested in this paper opens up the way for applying rich amount of topological facts and methods in the process of granular computing.

Preview PDF
Publication Date
Wed Jan 01 2020
Journal Name
Periodicals Of Engineering And Natural Sciences
Comparison between the estimated of nonparametric methods by using the methodology of quantile regression models
...Show More Authors

This paper study two stratified quantile regression models of the marginal and the conditional varieties. We estimate the quantile functions of these models by using two nonparametric methods of smoothing spline (B-spline) and kernel regression (Nadaraya-Watson). The estimates can be obtained by solve nonparametric quantile regression problem which means minimizing the quantile regression objective functions and using the approach of varying coefficient models. The main goal is discussing the comparison between the estimators of the two nonparametric methods and adopting the best one between them

Scopus
Publication Date
Sun Oct 01 2023
Journal Name
Baghdad Science Journal
Numerical Investigation, Error Analysis and Application of Joint Quadrature Scheme in Physical Sciences
...Show More Authors

In this work, a joint quadrature for numerical solution of the double integral is presented. This method is based on combining two rules of the same precision level to form a higher level of precision. Numerical results of the present method with a lower level of precision are presented and compared with those performed by the existing high-precision Gauss-Legendre five-point rule in two variables, which has the same functional evaluation. The efficiency of the proposed method is justified with numerical examples. From an application point of view, the determination of the center of gravity is a special consideration for the present scheme. Convergence analysis is demonstrated to validate the current method.

View Publication Preview PDF
Scopus (6)
Crossref (1)
Scopus Crossref
Publication Date
Sat Sep 30 2023
Journal Name
Iraqi Journal Of Science
Generalized Pre α-Regular and Generalized Pre α-Normal Spaces in Topological Spaces
...Show More Authors

     The concept of separation axioms constitutes a key role in general topology and all generalized forms of topologies. The present authors continued the study of gpα-closed sets by utilizing this concept, new separation axioms, namely gpα-regular and gpα-normal spaces are studied and established their characterizations. Also, new spaces namely gpα-Tk  for k = 0, 1, 2 are studied.

View Publication Preview PDF
Scopus Crossref
Publication Date
Mon Jan 20 2020
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
CONVERGENCES VIA ẛـ PREـ gـ OPEN SET
...Show More Authors

   The main aim of this paper is to use the notion  which was introduced in [1], to offered new classes of separation axioms in ideal spaces. So, we offered new type of notions of convergence in ideal spaces via the set. Relations among several types of separation axioms that offered were explained.

 

View Publication Preview PDF
Crossref
Publication Date
Sun Mar 07 2010
Journal Name
Baghdad Science Journal
Hypercyclictty and Countable Hypercyclicity for Adjoint of Operators
...Show More Authors

Let be an infinite dimensional separable complex Hilbert space and let , where is the Banach algebra of all bounded linear operators on . In this paper we prove the following results. If is a operator, then 1. is a hypercyclic operator if and only if D and for every hyperinvariant subspace of . 2. If is a pure, then is a countably hypercyclic operator if and only if and for every hyperinvariant subspace of . 3. has a bounded set with dense orbit if and only if for every hyperinvariant subspace of , .

View Publication Preview PDF
Crossref
Publication Date
Thu Apr 01 2021
Journal Name
Chaos, Solitons & Fractals
Modeling and analysis of an <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si7.svg"><mml:mrow><mml:mi>S</mml:mi><mml:msub><mml:mi>I</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:msub><mml:mi>I</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mi>R</mml:mi></mml:mrow></mml:math> epidemic model with nonlinear incidence and general recovery functions of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si8.svg"><mml:msub><mml:mi>I</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math>
...Show More Authors

View Publication
Scopus (15)
Crossref (13)
Scopus Clarivate Crossref
Publication Date
Thu Sep 30 2021
Journal Name
Iraqi Journal Of Science
Compactness Property of Fuzzy Soft Metric Space and Fuzzy Soft Continuous Function
...Show More Authors

      The theories of metric spaces and fuzzy metric spaces are crucial topics in mathematics.   

Compactness is one of the most important and fundamental properties that have been widely used in Functional Analysis. In this paper, the definition of compact fuzzy soft metric space is introduced and some of its important theorems are investigated. Also, sequentially compact fuzzy soft metric space and locally compact fuzzy soft metric space are defined and the relationships between them are studied. Moreover, the relationships between each of the previous two concepts and several other known concepts are investigated separately. Besides, the compact fuzzy soft continuous functions are studie

... Show More
View Publication Preview PDF
Scopus (7)
Crossref (1)
Scopus 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