The notion of a probabilistic metric  space  corresponds to thesituations when we do not know exactly the  distance.  Probabilistic Metric space was  introduced by Karl Menger. Alsina, Schweizer and Sklar gave a general definition of  probabilistic normed space based on the definition of Menger [1]. In this note we study the PN spaces which are  topological vector spaces and the open mapping an...

in this paper, the detector of moving target in mimo radar with widely separated antenna in the presence of α-stable clutter is proposed. due to the complexity of unknown parameter estimation in the presence of target, the rao test is applied. the α-stable model is a general model that can applied to different environments with appropriate selection of parameters. the problem with this model is...

In a closed 2-cell embedding of a graph each face is homeomorphic to an open disk and is bounded by a cycle in the graph. The Orientable Strong Embedding Conjecture says that every 2-connected graph has a closed 2-cell embedding in some orientable surface. This implies both the Cycle Double Cover Conjecture and the Strong Embedding Conjecture. In this paper we prove that every 2-connected proje...

Let = (X,R) be a distance-regular graph of diameter d . A parallelogram of length i is a 4-tuple xyzw consisting of vertices of such that ∂(x, y)= ∂(z,w)= 1, ∂(x, z)= i, and ∂(x,w)= ∂(y,w)= ∂(y, z)= i− 1. A subset Y of X is said to be a completely regular code if the numbers πi,j = | j (x)∩ Y | (i, j ∈ {0,1, . . . , d}) depend only on i = ∂(x,Y ) and j . A subset Y of X is said to be strongly c...

‎In this paper‎, ‎some properties of pre-monotone operators are proved‎. ‎It is shown that in a reflexive Banach space‎, ‎a full domain multivalued $sigma$-monotone operator with sequentially norm$times$weak$^*$ closed graph is norm$times$weak$^*$ upper semicontinuous‎. ‎The notion of $sigma$-convexity is introduced and the‎ ‎relations between the $sigma$-monotonicity and $sigma$-convexity is i...

Let G be a graph class. The square root of G contains all graphs whose square belong in G. We prove that if G is non-trivial and minor closed, then all graphs in its square root have carving-width bounded by some constant depending only on G. As a consequence, every square root of such a graph class has a linear time recognition algorithm.