Where@UM - Dependable organic radio maps

In the past decade, the research community has been dedicating considerable effort into indoor positioning systems based on Wi-Fi fingerprinting techniques, mainly due to their capability to exploit existing infrastructures. Crowdsourcing approaches, also known as organic, have been proposed recently to address the problem of creating and maintaining the corresponding radio maps. In these organic systems, the users of the system build the radio map themselves while using it to estimate their own position/location. However, most of these collaborative methods, proposed by several authors, assume that all the users are honest and committed to contribute to a good quality radio map. In this paper we assess the quality of a radio map built collaboratively and propose a method to classify the credibility of individual contributions and the reputation of individual users. Experimental results are presented for an organic indoor location system that has been used by more than one hundred users over a period of around 12 months.

An algorithmic approach to estimating the minimal number of periodic points for smooth self-maps of simply-connected manifolds

For a given self-map f of M, a closed smooth connected and simply-connected manifold of dimension m ≥ 4, we provide an algorithm for estimating the values of the topological invariant Dm r [f], which equals the minimal number of r-periodic points in the smooth homotopy class of f. Our results are based on the combinatorial scheme for computing Dm r [f] introduced by G. Graff and J. Jezierski [J. Fixed Point Theory Appl. 13 (2013), 63–84]. An open-source implementation of the algorithm programmed in C++ is publicly available at http://www.pawelpilarczyk.com/combtop/.