In this work we explain and discuss new notion of fibrewise topological spaces, calledfibrewise soft ideal topological spaces, Also, we show the notions of fibrewise closed soft ideal topological spaces, fibrewise open soft ideal topological spaces and fibrewise soft near ideal topological spaces.

In this work, new kinds of blocking sets in a projective plane over Galois field PG(2,q) can be obtained. These kinds are called the complete blocking set and maximum blocking set. Some results can be obtained about them.

The main aim of this paper is to introduce the relationship between the topic of coding theory and the projective plane of order three. The maximum value of size of code over finite field of order three and an incidence matrix with the parameters,  (length of code),  (minimum distance of code) and  (error-correcting of code ) have been constructed. Some examples and theorems have been given.

The main purpose of this paper is to introduce and prove some fixed point theorems for two maps that

satisfy -contractive conditions with rational expression in partially ordered metric spaces, our results improve and unify a multitude of fixed point theorems and generalize some recent results in ordered partially metric space.

Localization is an essential demand in wireless sensor networks (WSNs). It relies on several types of measurements. This paper focuses on positioning in 3-D space using time-of-arrival- (TOA-) based distance measurements between the target node and a number of anchor nodes. Central localization is assumed and either RF, acoustic or UWB signals are used for distance measurements. This problem is treated by using iterative gradient descent (GD), and an iterative GD-based algorithm for localization of moving sensors in a WSN has been proposed. To localize a node in 3-D space, at least four anchors are needed. In this work, however, five anchors are used to get better accuracy. In GD localization of a moving sensor, the algo

In recent years, due to the economic benefits and technical advances of cloud
computing, huge amounts of data have been outsourced in the cloud. To protect the
privacy of their sensitive data, data owners have to encrypt their data prior
outsourcing it to the untrusted cloud servers. To facilitate searching over encrypted
data, several approaches have been provided. However, the majority of these
approaches handle Boolean search but not ranked search; a widely accepted
technique in the current information retrieval (IR) systems to retrieve only the top–k
relevant files. In this paper, propose a distributed secure ranked search scheme over
the encrypted cloud servers. Such scheme allows for the authorized user to

Existence of these soils, sometimes with high gypsum content, caused difficult problems to the buildings and strategic projects due to dissolution and leaching of gypsum by the action of waterflow through soil mass. In this research, a new technique is adopted to investigate the performance of replacement and geosynthetic reinforcement materials to improve the gypseous soil behavior through experimential set up manufactured loaclally specially for this work. A series of tests were carried out using steel container (600*600*500) mm. A square footing (100*100) mm was placed at the center of the top surface of the bed soil. The results showed that the most effective thickness for the dune sand layer with geotextile at the interface, within

Let 


 
, 1
( )
1 2 ,
( , ) 1 2
m n
s s
m n
f s s a e m n   , (s   it , j 1,2) j j j  ,  
m 1  and
 
n 1  being an increasing sequences of positive numbers and a E m n  , where E
is Banach algebra, represent a vector valued entire Dirichlet functions in two
variables. The space  of all such entire functions having order at most equal to 
is considered in this paper. A metric topology using the growth parameters of f is
defined on  and its various properties are obtained. The form of linear operator on
the space  is characterized and proper bases are also characterized in terms of
growth parameters  .

Let  be an n-Banach space, M be a nonempty closed convex subset of , and S:M→M be a mapping that belongs to the class  mapping. The purpose of this paper is to study the stability and data dependence results of a Mann iteration scheme on n-Banach space