In the rendezvous problem, two computing entities (called \emph{agents}) located at different vertices in a graph have to meet same vertex. this paper, we consider synchronous \emph{neighborhood problem}, where agents are initially adjacent vertices. While problem can be trivially solved $O(\Delta)$ rounds ($\Delta$ is maximum degree of graph), it highly challenging reveal whether that $o(\Delt...

urban space has been formed in historical texture of cities under the influence of meaning and shape on the onehand and qualities related to human behaviors on the other hand. among these points, neighborhood centers as themost important areas of social life in urban open space play a critical role in attracting people and improving qualityand vitality of environment. this study presents the re...

Image transforms are used extensively in image processing to convert one image form into another form. These transforms are either point-operation transforms or neighborhood-operation transforms. Injective transforms, also known as reversible or one-to-one transforms, are a subset of point-operation transforms where each intensity value maps to a distinct intensity value. In this paper we prese...