### Book

## CEUR Workshop Proceedings Volume 2416

This volume contains the papers presented at the session "Data Science" within the V International Conference on Information Technology and Nanotechnology (ITNT-2019). The conference was held in Samara, Russia, during May 21-24, 2019 (itnt-conf.org). The conference is a forum for leading researchers from all over the world aimed to discuss the latest advances in the basic and applied research in the field of Information Technology and Nanotechnology. It is also aimed to attract young people to advanced scientific research and share the latest trends in training and research programs for future ITNT specialists [1]. In addition to the session "Data Science", ITNT-2019 also included three other sessions: "Computer Optics and Nanophotonics", "Image Processing and Earth Remote Sensing" and "Mathematical Modeling of Physico-Technical Processes and Systems". The whole forum brought together more than 450 scientists from United Kindom, Japan, Switzerland, Iran, Poland, Bulgaria, Finland, China, Kazakhstan and Russia, as well as representatives of global high-tech corporations, developers of modern electronics – Huawei, Nvidia, Intel, and Azimuth Photonics, and more than 60 cities in the world. 436 talks enabled discussion on a wide range of topics. The topics of the session "Data Science" were grouped into the following key directions: Data Mining (Big data, Systems and platforms, Methods); Machine Learning (Neural networks, Statistical methods, Feature-based classification, Applications); Security, Cryptography (Cryptosystems design and analysis, Mathematical and algorithmic aspects, Efficient implementations of algorithms, Network security); High Performance Computing (Parallel programming models and languages, Highperformance implementations, Complex systems simulation).

The paper reviews the current situation of the Augmented Reality and Internet of Things markets. The implementing possibilities of AR for Big Data visualization from IoT devices are considered in this paper. The review and the analysis of methods, tools, products and data system of the visualization are presented. The paper provides an overview of the programs and devices of Augmented Reality, and an overview of development environments. The paper presents the existing classifications of computerized data visualization tools and proposes new classification, which takes into account interactive visualization, the purpose of the tool, the type of software product, the availability of ready-made templates, and other characteristics. The article proposes the architecture of the system for collecting data from IoT endpoint devices based on the Heltec modules. Experiments based on the developed experimental stand were carried out with Heltec devices of both versions to determine the number of losses with increasing distance between the sending device and the receiving device. The results of measuring the power consumption of these devices are presented in two modes: in standby mode and when sending a message to the Heltec endpoint device and in standby mode and when receiving a message for the base station. These studies were conducted using various data transfer protocols (LoRa, Wi-Fi and Bluetooth). The paper presents the result of the development of a digital twin of a university building and the development of augmented reality software for receiving data from real-time data collection devices.

Morrill and Valent´ın in the paper “Computational coverage of TLG: Nonlinearity” considered an extension of the Lambek calculus enriched by a so-called “exponential” modality. This modality behaves in the “relevant” style, that is, it allows contraction and permutation, but not weakening. Morrill and Valent´ın stated an open problem whether this system is decidable. Here we show its undecidability. Our result remains valid if we consider the fragment where all division operations have one direction. We also show that the derivability problem in a restricted case, where the modality can be applied only to variables (primitive types), is decidable and belongs to the NP class.

The volume contains proceedings of the XIII International symposium on problems of redundancy in information and control systems.

The volume is to contain the proceedings of the 13th conference AGCT as well as the proceedings of the conference Geocrypt. The conferences focus on various aspects of arithmetic and algebraic geometry, number theory, coding theory and cryptography. The main topics discussed at conferences include the theory of curves over finite fields, theory of abelian varieties both over global and finite fields, theory of zeta-functions and L-functions, asymptotic problems in number theory and algebraic geometry, algorithmic aspects of the theory of curves and abelian varieties, the theory of error-correcting coding and particularly that of algebro-geometric codes, cryptographic issues related to algebraic curves and abelian varieties.

A scalable method for mining graph patterns stable under subsampling is proposed. The existing subsample stability and robustness measures are not antimonotonic according to definitions known so far. We study a broader notion of antimonotonicity for graph patterns, so that measures of subsample stability become antimonotonic. Then we propose gSOFIA for mining the most subsample-stable graph patterns. The experiments on numerous graph datasets show that gSOFIA is very efficient for discovering subsample-stable graph patterns.

The article examines the approaches of OLAP-applications for business analysis trucking company. Examples of using multi-dimensional tables to support decision-making.

In 1992, A. Hiltgen provided first constructions of provably (slightly) secure cryptographic primitives, namely feebly one-way functions. These functions are provably harder to invert than to compute, but the complexity (viewed as the circuit complexity over circuits with arbitrary binary gates) is amplified only by a constant factor (in Hiltgen’s works, the factor approaches 2). In traditional cryptography, one-way functions are the basic primitive of private-key schemes, while public-key schemes are constructed using trapdoor functions. We continue Hiltgen’s work by providing examples of feebly secure trapdoor functions where the adversary is guaranteed to spend more time than honest participants (also by a constant factor). We give both a (simpler) linear and a (better) non-linear construction.

Recent work on structure-preserving signatures studies optimality of these schemes in terms of the number of group elements needed in the verification key and the signature, and the number of pairing-product equations in the verification algorithm. While the size of keys and signatures is crucial for many applications, another important aspect to consider for performance is the time it takes to verify a given signature. By far, the most expensive operation during verification is the computation of pairings. However, the concrete number of pairings that one needs to compute is not captured by the number of pairing-product equations considered in earlier work. To fill this gap, we consider the question of what is the minimal number of pairings that one needs to compute in the verification of structure-preserving signatures. First, we prove lower bounds for schemes in the Type II setting that are secure under chosen message attacks in the generic group model, and we show that three pairings are necessary and that at most one of these pairings can be precomputed. We also extend our lower bound proof to schemes secure under random message attacks and show that in this case two pairings are still necessary. Second, we build an automated tool to search for schemes matching our lower bounds. The tool can generate automatically and exhaustively all valid structure-preserving signatures within a user-specified search space, and analyze their (bounded) security in the generic group model. Interestingly, using this tool, we find a new randomizable structure-preserving signature scheme in the Type II setting that is optimal with respect to the lower bound on the number of pairings, and also minimal with respect to the number of group operations that have to be computed during verification.

We consider certain spaces of functions on the circle, which naturally appear in harmonic analysis, and superposition operators on these spaces. We study the following question: which functions have the property that each their superposition with a homeomorphism of the circle belongs to a given space? We also study the multidimensional case.

We consider the spaces of functions on the m-dimensional torus, whose Fourier transform is p -summable. We obtain estimates for the norms of the exponential functions deformed by a C1 -smooth phase. The results generalize to the multidimensional case the one-dimensional results obtained by the author earlier in “Quantitative estimates in the Beurling—Helson theorem”, Sbornik: Mathematics, 201:12 (2010), 1811 – 1836.

We consider the spaces of function on the circle whose Fourier transform is p-summable. We obtain estimates for the norms of exponential functions deformed by a C1 -smooth phase.