This paper presents the problem of the current separate treatment of levels of detail in city models. We propose a solution, detail the main principles, and present our initial results on the approach. We conclude with work in progress and explain the benefits of our approach.

Urban Automation Networks (UANs) are being deployed worldwide in order to enable Smart City applications. Given the crucial role of UANs, as well as their diversity, it is critically important to assess their properties and trade-offs. This article introduces the requirements and challenges for UANs, characterizes the main current and emerging UAN paradigms, provides guidelines for their design...

We introduce the h-deformation of the algebra of functions on the grass-mann supergroup Gr(1|1) via a contraction of Gr q (1|1).

As the majority of world population will be living in cities by 2050, it became a necessity for societies to build cities that are capable of meeting the needs of current and future generations in a smart way. There have been initiatives toward smart/sustainable cities that had succeeded, and others had failed. Being sustainable and smart had been used in a quite confusing way. In this paper, w...

We show that in the context of topological string theories N branes and M anti-branes give rise to Chern-Simons gauge theory with the gauge supergroup U (N |M). We also identify a deformation of the theory which corresponds to brane/anti-brane annihilation.

Development of new technologies brings people new possibilities such as smart spaces. Smart spaces can provide better user experience by allowing a user to connect new devices flexibly and to access all the information in the multi device system from any of the devices. The paper describes work-in-progress performed under a joint project of SPIIRAS and Nokia. The project is aimed at the analysi...

For a set Ω an unordered relation on Ω is a family R of subsets of Ω . If R is such a relation we let G(R) be the group of all permutations on Ω that preserve R, that is g belongs to G(R) if and only if x ∈R implies x ∈R. We are interested in permutation groups which can be represented as G= G(R) for a suitable unordered relation R on Ω . When this is the case, we say that G is defined by the r...