Building City-Scale Walking Itineraries Using Large Geospatial Datasets

Nowadays, social networks play an important role in many aspects of people’s life and in traveling in particular. People share their experience and opinions not only on specialized sites, like TripAdvisor, but also in social networks, e.g. Instagram. Combining information from different sources we can get a manifold dataset, which covers main sights, famous buildings as well as places popular with city residents. In this paper, we propose method for generation of walking tours based on large multi-source dataset. In order to create this dataset, we developed data crawling framework, which is able to collect data from Instagram at high speed. We provide several use cases for the developed itinerary generation method and demonstrate that it can significantly enrich standard touristic paths provided by official site

Forecasting of the Urban Area State Using Convolutional Neural Networks

Active development of modern cities requires not only efficient monitoring systems but furthermore forecasting systems that can predict future state of the urban area with high accuracy. In this work we present a method for urban area prediction based on geospatial activity of users in social network. One of the most popular social networks, Instagram, was taken as a source for spatial data and two large cities with different peculiarities of online activity – New York City, USA, and Saint Petersburg, Russia – were taken as target cities. We propose three different deep learning architectures that are able to solve a target problem and show that convolutional neural network based on three-dimensional convolution layers provides the best results with accuracy of 99%

SUPERCOMPUTER SIMULATION OF CRITICAL PHENOMENA IN COMPLEX SOCIAL SYSTEMS

The paper describes a problem of computer simulation of critical phenomena in complex social systems on a petascale computing systems in frames of complex networks approach. The three-layer system of nested models of complex networks is proposed including aggregated analytical model to identify critical phenomena, detailed model of individualized network dynamics and model to adjust a topological structure of a complex network. The scalable parallel algorithm covering all layers of complex networks simulation is proposed. Performance of the algorithm is studied on different supercomputing systems. The issues of software and information infrastructure of complex networks simulation are discussed including organization of distributed calculations, crawling the data in social networks and results visualization. The applications of developed methods and technologies are considered including simulation of criminal networks disruption, fast rumors spreading in social networks, evolution of financial networks and epidemics spreading

Orienteering Problem with Functional Profits for multi-source dynamic path construction.

Orienteering problem (OP) is a routing problem, where the aim is to generate a path through set of nodes, which would maximize total score and would not exceed the budget. In this paper, we present an extension of classic OP-Orienteering Problem with Functional Profits (OPFP), where the score of a specific point depends on its characteristics, position in the route, and other points in the route. For solving OPFP, we developed an open-source framework for solving orienteering problems, which utilizes four core components of OP in its modular architecture. Fully-written in Go programming language our framework can be extended for solving different types of tasks with different algorithms; this was demonstrated by implementation of two popular algorithms for OP solving-Ant Colony Optimization and Recursive Greedy Algorithm. Computational efficiency of the framework was shown through solving four well-known OP types: classic Orienteering Problem (OP), Orienteering Problem with Compulsory Vertices (OPCV), Orienteering Problem with Time Windows (OPTW), and Time Dependent Orienteering Problem (TDOP) along with OPFP. Experiments were conducted on a large multi-source dataset for Saint Petersburg, Russia, containing data from Instagram, TripAdvisor, Foursquare and official touristic website. Our framework is able to construct touristic paths for different OP types within few seconds using dataset with thousands of points of interest

Urgent Information Spreading Multi-layer Model for Simulation in Mobile Networks

AbstractInformation spreading simulation is an important problem in scientific community and is widely studied nowadays using different techniques. Efficient users’ activity simulation for urgent scenarios is even more important, because fast and accurate reaction in such situations can save human lives. In this paper we present multi-layer agent-based network model for information spreading simulation in urgent scenarios, which allows to investigate agents’ behavior in a variety of situations. This model can be used for live city simulation in integration with other agent-based human interaction models. Experimental results demonstrate logical consistency of the proposed approach and show different cases of information spreading in the network with different social aspect

Execution time estimation for workflow scheduling

Estimation of the execution time is an important part of the workflow scheduling problem. The aim of this paper is to highlight common problems in estimating the workflow execution time and propose a solution that takes into account the complexity and the stochastic aspects of the workflow components as well as their runtime. The solution proposed in this paper addresses the problems at different levels from a task to a workflow, including the error measurement and the theory behind the estimation algorithm. The proposed makespan estimation algorithm can be integrated easily into a wide class of schedulers as a separate module. We use a dual stochastic representation, characteristic/distribution function, in order to combine task estimates into the overall workflow makespan. Additionally, we propose the workflow reductions—operations on a workflow graph that do not decrease the accuracy of the estimates but simplify the graph structure, hence increasing the performance of the algorithm. Another very important feature of our work is that we integrate the described estimation schema into earlier developed scheduling algorithm GAHEFT and experimentally evaluate the performance of the enhanced solution in the real environment using the CLAVIRE platform

LUMINEU: a search for neutrinoless double beta decay based on ZnMoO 4 scintillating bolometers

The LUMINEU is designed to investigate the possibility to search for neutrinoless double beta decay in 100Mo by means of a large array of scintillating bolometers based on ZnMoO4 crystals enriched in 100Mo. High energy resolution and relatively fast detectors, which are able to measure both the light and the heat generated upon the interaction of a particle in a crystal, are very promising for the recognition and rejection of background events. We present the LUMINEU concepts and the experimental results achieved aboveground and underground with large-mass natural and enriched crystals. The measured energy resolution, the α/β discrimination power and the radioactive internal contamination are all within the specifications for the projected final LUMINEU sensitivity. Simulations and preliminary results confirm that the LUMINEU technology can reach zero background in the region of interest (around 3 MeV) with exposures of the order of hundreds kgXyears, setting the bases for a next generation 0v2β decay experiment capable to explore the inverted hierarchy region of the neutrino mass pattern