The rising popularity of location-based services has prompted considerable research in the field of indoor location systems. Since there is no single technology to support these systems, it is necessary to consider the fusion of the information coming from heterogeneous sensors. This paper presents a software architecture designed for a hybrid location system where we can merge information from...

extended abstract 1. introduction mechanical life and pollution in the cities, air pollution and noise pollution and other environmental pollutants led to increasingly citizen’s need to nature and the use of its blessings. naqadeh town located in west azerbaijan state, invites the numbers of passengers from inside and outside of the state, in tourism seasons, yearly. potential element of touris...

Let M = {v1, v2 ... vl} be an ordered set of vertices in a graph G. Then (d(u, v1), d(u, v2) ... d(u, vl)) is called the M-location of a vertex u of G. The set M is called a locating set if the vertices of G have distinct M-locations. A minimum locating set is a set M with minimum cardinality. The cardinality of a minimum locating set of G is called Location Number L(G). This concept has wide a...

A dominating set S of a graph is a metric-locating-dominating set if each vertex of the graph is uniquely distinguished by its distances from the elements of S, and the minimum cardinality of such a set is called the metric-locationdomination number. In this paper, we undertake a study that, in general graphs and specific families, relates metric-locating-dominating sets to other special sets: ...

The problem of locating local maxima and minima of a function from approximate measurement results is vital for many physical applications: in spectral analysis, chemical species are identified by locating local maxima of the spectra; in radioastronomy, sources of celestial radio emission and and their subcomponents are identified by locating local maxima of the measured brightness of the radio...

Locating specific chunks (records) of information within documents on the web is an interesting and nontrivial problem. If the problem of locating and separating records can be solved well, the longstanding problem of grouping extracted values into appropriate relationships in a record structure can be more easily resolved. Our solution is a hybrid of two well established techniques: (1) ontolo...

Data-extrapolating (extension) technique has important applications in image processing on implicit surfaces and in level set methods. The existing data-extrapolating techniques are inefficient because they are designed without concerning the specialities of the extrapolating equations. Besides, there exists little work on locating the narrow band after data extrapolating—a very important probl...

Let c be a proper k-coloring of a connected graph G and Π = (V1, V2, . . . , Vk) be an ordered partition of V (G) into the resulting color classes. For a vertex v of G, the color code of v with respect to Π is defined to be the ordered k-tuple cΠ(v) := (d(v, V1), d(v, V2), . . . , d(v, Vk)), where d(v, Vi) = min{d(v, x) | x ∈ Vi}, 1 ≤ i ≤ k. If distinct vertices have distinct color codes, then ...