Cadastral modelling uses the cadastral data including bearings and distances of boundary lines to calculate coordinates of boundary corners and associated marks, and to evaluate the data. This paper shows that at sites where several boundary corners are intended to be on a straight line a Least Squares adjustment of the boundary data may cause the points to move away from one straight line. M e...

The Government of India is transcending from traditional modus operandi of governance towards technological involvement in the process of governance. Currently, the Government of India is in the transition phase and seamlessly unleashing the power of ICT in governance. The government is spending an enormous amount of finances in deployment of e-governance, but, are these efforts are going in th...

It is known that many (upper) cluster algebras possess different kinds of good bases which contain the monomials and are parametrized by tropical points Poisson varieties. For a large class upper (injective-reachable ones with full rank coefficients), we describe all its these properties. Moreover, show existence generic basis for them. In addition, prove Bridgeland's representation theoretic f...

Introduction. This paper is meant as an introduction and a guide to some recent developments in real algebraic geometry — more precisely, in semialgebraic geometry. In real algebraic geometry one is concerned with the set of real points V(R) of a variety V defined over R. More generally, one may replace the field of real numbers R by any real closed field. Real algebraic geometry is clearly a p...

The prototype Texture Analyser at Fontainebleau permits very swift simulations of many random processes, be they point processes or random set processes .We shall illustrate, with some examples of general processes, the possibilities of this apparatus. Three kinds of processes are presented here:-The Poisson point process-Cluster Processes ("shooting" scheme)-Hard-Core processes (repulsion mode...

-This p a p e r p r e s e n t s a p l a n n e r t h a t d e t e r m i n e s a p a t h s u c h t h a t t h e r o b o t d o e s n o t h a v e t o h e a v i l y r e l y o n o d o m e t r y t o r e a c h i ts goa l . T h e p l a n n e r d e t e r m i n e s a s e q u e n c e o f o b s t a c l e b o u n d a r i e s t h a t t h e r o b o t m u s t fo l low t o r e a c h t h e goa l . S ince t h i s p ...

We present high statistics data on the distribution of shortest path lengths between two near-by points on the same cluster at the percolation threshold. Our data are based on a new and very efficient algorithm. For d = 2 they clearly disprove a recent conjecture by M. Porto et al., Phys. Rev. E 58, R5205 (1998). Our data also provide upper bounds on the probability that two near-by points are ...

In many scienti c and commercial applications such as Earth Observation System (EOSDIS) and mobile phone services tracking a large number of clients, it is a daunting task to archive and index ever increasing volume of complex data that are continuously added to databases. To eÆciently manage multidimensional data in scienti c and data warehousing environments, R-tree based index structures hav...

We present a practical approach to nonparametric cluster analysis of large data sets. The number of clusters and the cluster centers are automatically derived by mode seeking with the mean shift procedure on a reduced set of points randomly selected from the data. The cluster boundaries are delineated using a k-nearest neighbor technique. The proposed algorithm is stable and e cient, a 10000 po...