Let R be associative ring with identity and M is a non- zero unitary left module over R. M is called M- hollow if every maximal submodule of M is small submodule of M. In this paper we study the properties of this kind of modules.

Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with  is the same for all . Here  is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i

Let M be an R-module. We introduce in this paper the concept of strongly cancellation module as a generalization of cancellation modules. We give some characterizations about this concept, and some basic properties. We study the direct sum and the localization of this kind of modules. Also we prove that every module over a PID is strongly module and we prove every locally strong module is strongly module.

The process of accurate localization of the basic components of human faces (i.e., eyebrows, eyes, nose, mouth, etc.) from images is an important step in face processing techniques like face tracking, facial expression recognition or face recognition. However, it is a challenging task due to the variations in scale, orientation, pose, facial expressions, partial occlusions and lighting conditions. In the current paper, a scheme includes the method of three-hierarchal stages for facial components extraction is presented; it works regardless of illumination variance. Adaptive linear contrast enhancement methods like gamma correction and contrast stretching are used to simulate the variance in light condition among images. As testing material

Most Internet-tomography problems such as shared congestion detection depend on network measurements. Usually, such measurements are carried out in multiple locations inside the network and relied on local clocks. These clocks usually skewed with time making these measurements unsynchronized and thereby degrading the performance of most techniques. Recently, shared congestion detection has become an important issue in many computer networked applications such as multimedia streaming and
peer-to-peer file sharing. One of the most powerful techniques that employed in literature is based on Discrete Wavelet Transform (DWT) with cross-correlation operation to determine the state of the congestion. Wavelet transform is used as a de-noisin

     In this paper the design of hybrid retina matching algorithm that is used in identification systems is considered. Retina based recognition is apparent as the most secure method for identification of an identity utilized to differentiate persons.

     The characteristics of Speeded up Robust Feature (SURF) and Binary Robust Invariant Scalable Key-Points (BRISK) algorithm have been used in order to produce a fast matching algorithm than the classical ones, those characteristics are important for real-time applications which usually need quick processing of a growing quantity of data. The algorithm is divided into three stages: retinal image processing and segmentation, extracting the lo

In this paper, we introduce and study new types of soft open sets and soft closed
sets in soft bitopological spaces (X,~ ,~ ,E) 1 2   , namely, (1,2)*-maximal soft open
sets, (1,2)*-maximal soft (1,2)*-pre-open sets, semi (1,2)*-maximal soft (1,2)*-preopen
sets, (1,2)*-maximal soft closed sets, (1,2)*-maximal soft (1,2)*-pre-closed
sets, (1,2)*-minimal soft open sets, (1,2)*-minimal soft (1,2)*-pre-open sets, (1,2)*-
minimal soft closed sets, (1,2)*-minimal soft (1,2)*-pre-closed sets, and semi (1,2)*-
minimal soft (1,2)*-pre-closed sets. Also, properties and the relation among these
concepts have been studied.

     Let Ḿ be a unitary R-module and R is a commutative ring with identity. Our aim in this paper  to study the concepts T-ABSO fuzzy ideals, T-ABSO fuzzy submodules and T-ABSO quasi primary fuzzy submodules, also we discuss these concepts in the class of multiplication fuzzy modules and relationships between these concepts. Many new basic properties and characterizations on these concepts are given.

Let m ≥ 1,n ≥ 1 be fixed integers and let R be a prime ring with char (R) ≠2 and
(m+n). Let T be a (m,n)(U,R)-Centralizer where U is a Jordan ideal of R and T(R)
⊆ Z(R) where Z(R) is the center of R ,then T is (U,R)- Centralizer.

In this paper, some estimators of the unknown shape parameter and reliability function  of Basic Gompertz distribution (BGD) have been obtained, such as MLE, UMVUE, and MINMSE, in addition to estimating Bayesian estimators under Scale invariant squared error loss function assuming informative prior represented by Gamma distribution and non-informative prior by using Jefferys prior. Using Monte Carlo simulation method, these estimators of the shape parameter and R(t), have been compared based on mean squared errors and integrated mean squared, respectively