In this paper, we shall introduce a new kind of Perfect (or proper) Mappings, namely ω-Perfect Mappings, which are strictly weaker than perfect mappings. And the following are the main results: (a) Let f : X→Y be ω-perfect mapping of a space X onto a space Y, then X is compact (Lindeloff), if Y is so. (b) Let f : X→Y be ω-perfect mapping of a regular space X onto a space Y. then X is paracompact (strongly paracompact), if Y is so paracompact (strongly paracompact). (c) Let X be a compact space and Y be a p*-space then the projection p : X×Y→Y is a ω-perfect mapping. Hence, X×Y is compact (paracompact, strongly paracompact) if and only if Y is so.
In this paper ,the problem of point estimation for the two parameters of logistic distribution has been investigated using simulation technique. The rank sampling set estimator method which is one of the Non_Baysian procedure and Lindley approximation estimator method which is one of the Baysian method were used to estimate the parameters of logistic distribution. Comparing between these two mentioned methods by employing mean square error measure and mean absolute percentage error measure .At last simulation technique used to generate many number of samples sizes to compare between these methods.
In this paper, we introduce a new type of functions in bitopological spaces, namely, (1,2)*-proper functions. Also, we study the basic properties and characterizations of these functions . One of the most important of equivalent definitions to the (1,2)*-proper functions is given by using (1,2)*-cluster points of filters . Moreover we define and study (1,2)*-perfect functions and (1,2)*-compact functions in bitopological spaces and we study the relation between (1,2)*-proper functions and each of (1,2)*-closed functions , (1,2)*-perfect functions and (1,2)*-compact functions and we give an example when the converse may not be true .
In this paper, the concept of semi-?-open set will be used to define a new kind of strongly connectedness on a topological subspace namely "semi-?-connectedness". Moreover, we prove that semi-?-connectedness property is a topological property and give an example to show that semi-?-connectedness property is not a hereditary property. Also, we prove thate semi-?-irresolute image of a semi-?-connected space is a semi-?-connected space.
This work aimed to design and testing of a computer program – based eyeQ improvement, photographic memory enhancement, and speed reading to match the reading speed 150 – 250 word per minute (WPM) with the mind ability of processing and eye snap shooting 5000WPM . The package designed based on Visual Basic 6. The efficiency of the designed program was tested on a 10 persons with different levels of education and ages and the results show an increase in their reading speed of approximately 25% in the first month of training with noticeable enhancement in the memory as well as an increase in the ability to read for longer time without feeling nerves or boring, a nonlinear continuously increase in reading speed is assured after the first mo
... Show MoreThe Ozone Monitoring Instrument (OMI) measures the reflected solar radiation in the ultraviolet and visible part in the spectral range that is between 270 and 500 nm, using two channels with a spectral resolution of about 0.5 nm. Ground-level tropospheric ozone is one of the air pollutants of most concern. In the troposphere, near the Earth's surface, human activities lead to ozone concentrations several times higher than the natural background level. To evaluate the ozone distribution over Iraq, the ozone data from OMI were analyzed using geostatistical techniques. Theoretical spherical models provided the best fit for all monthly experimental variograms. The parameters of these variograms (sill, range and nugget) wer
... Show MoreThere 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 MoreLet R be a commutative ring with identity, and M be a left untial module. In this paper we introduce and study the concept w-closed submodules, that is stronger form of the concept of closed submodules, where asubmodule K of a module M is called w-closed in M, "if it has no proper weak essential extension in M", that is if there exists a submodule L of M with K is weak essential submodule of L then K=L. Some basic properties, examples of w-closed submodules are investigated, and some relationships between w-closed submodules and other related modules are studied. Furthermore, modules with chain condition on w-closed submodules are studied.
The study of fixed points on the maps fulfilling certain contraction requirements has several applications and has been the focus of numerous research endeavors. On the other hand, as an extension of the idea of the best approximation, the best proximity point (ƁƤƤ) emerges. The best approximation theorem ensures the existence of an approximate solution; the best proximity point theorem is considered for addressing the problem in order to arrive at an optimum approximate solution. This paper introduces a new kind of proximal contraction mapping and establishes the best proximity point theorem for such mapping in fuzzy normed space ( space). In the beginning, the concept of the best proximity point was introduced. The concept of prox
... Show MoreThe class of quasi semi -convex functions and pseudo semi -convex functions are presented in this paper by combining the class of -convex functions with the class of quasi semi -convex functions and pseudo semi -convex functions, respectively. Various non-trivial examples are introduced to illustrate the new functions and show their relationships with -convex functions recently introduced in the literature. Different general properties and characteristics of this class of functions are established. In addition, some optimality properties of generalized non-linear optimization problems are discussed. In this generalized optimization problems, we used, as the objective function, quasi semi -convex (respectively, strictly quasi semi -convex
... Show MoreLet be a commutative ring with identity, and be a unitary left -module. In this paper we introduce the concept pseudo weakly closed submodule as a generalization of -closed submodules, where a submodule of an -module is called a pseudo weakly closed submodule, if for all , there exists a -closed submodule of with is a submodule of such that . Several basic properties, examples and results of pseudo weakly closed submodules are given. Furthermore the behavior of pseudo weakly closed submodules in class of multiplication modules are studied. On the other hand modules with chain conditions on pseudo weakly closed submodules are established. Also, the relationships of pseudo weakly closed
... Show More