### Book

## Proceedings of 2nd International Conference on Computer Applications & Information Security (ICCAIS)

The 2nd International Conference on Computer Applications & Information Security (ICCAIS’ 2019) is inviting authors to submit original contributions in the event research area. ICCAIS’ 2019 is a selective single-track conference, covering all aspects of Networking and Information Security, Computer Applications, Electrical Engineering & Computer Science, Network Management, Network Function Virtualization, Software Defined Networks, Network Applications and Convergence of IT and Telecom Networks. The core track is accompanied by a series of workshops and poster sessions.

Papers accepted and presented at ICCAIS’ 2019 will be published open access on the conference Web site and will be submitted for possible inclusion in IEEE Xplore Digital Library. Authors of selected papers accepted for publication in ICCAIS’ 2019 proceedings will be invited to submit an extended version of their papers to the conference related journals.

Co-authorship networks represent a graph, in which vertices are authors, and edges represent research papers written in co-authorship. Every paper could generate several edges in such a graph, if a number of coauthors is greater than two. Co-authorship networks play important role in understanding the structure of research collaborations usually resulted in joint research papers. Moreover, when analyzing university ranking and research staff publishing activity, coauthorship network may help identifying both, efficient research communities and also people, who lack proper collaborators while having poor research results. Our paper is devoted to the visualization and interpretation of the former sets using as an example co-authorship network of National Research University Higher School of Economics (HSE), Moscow, Russia, while we also discuss the possible solutions for recommending collaborators for the latter set of researchers with low academic profile. Our paper is a case study for our university, which can be extended to larger co-authorship networks using research indexing services.

The progress of deep learning models in image and video processing leads to new artificial intelligence applications in Fashion industry. We consider the application of Generative Adversarial Networks and Neural Style Transfer for Digital Fashion presented as Virtual fashion for trying new clothes. Our model generate humans in clothes with respect to different fashion preferences, color layouts and fashion style. We propose that the virtual fashion industry will be highly impacted by accuracy of generating personalized human model taking into account different aspects of product and human preferences. We compare our model with state-of-art VITON model and show that using new perceptual loss in deep neural network architecture lead to better qualitative results in generating humans in clothes.

We present a model for freight train time prediction based on station network analysis and specific feature engineering. We discuss the first pipeline to improve the freight flight duration prediction in Russia. While every freight company use only reference book made by RZD (Russian Railways) based on railroad distances with accuracy measured in days, we argue that one could predict the flight duration with error less than twenty hours while decreasing error to twelve hours for certain type of freight trains.

This book constitutes the post-conference proceedings of the 8th International Conference on Analysis of Images, Social Networks and Texts, AIST 2019, held in Kazan, Russia, in July 2019.

The 27 full and 8 short papers were carefully reviewed and selected from 134 submissions (of which 21 papers were automatically rejected without being reviewed). The papers are organized in topical sections on general topics of data analysis; natural language processing; social network analysis; analysis of images and video; optimization problems on graphs and network structures; and analysis of dynamic behavior through event data.

It is our great pleasure to welcome you to The Web Conference 2019. The Web Conference is the premier venue focused on understanding the current state and the evolution of the Web through the lens of computer science, computational social science, economics, policy, and many other disciplines. The 2019 edition of the conference is a reflection point as we celebrate the 30th anniversary of the Web.

Over the past 60 years, the topic of social inequality has been one of the key to educational research. Since the 90's years of the last century, thanks to the advent of international monitoring, the main focus is on comparisons of different countries in terms of educational opportunities, as well as academic and social segregation in schools. At the same time, it is known that even within countries, especially those with a great geographical extent, differences in access to educational resources and in learning outcomes can be very large.

Our work complements the existing discussion on spatial inequality in education. In this paper, we analyze the hierarchical structure of the educational system in countries with a moderate level of centralization, when access to resources can vary at three levels: between schools in a municipality, between municipalities in regions and between regions. We analyze the variation of school ICT-resources, teachers’ characteristics, and students’ outcomes in Russian language, mathematics and computer science on between- and within-regional levels. For these aims, we operate a unique dataset of nearly 40 000 Russian schools.

Our results show the existing gap between Russian schools, municipalities, and regions in access to educational resources and educational results. The uneven distribution of resources between territories, as a result of unbalanced decentralized policy, creates a situation of “double penalty” or “double bonus” for students.

The number of space objects will grow several times in a few years due to the planned launches of constellations of thousands microsatellites. It leads to a significant increase in the threat of satellite collisions. Spacecraft must undertake collision avoidance maneuvers to mitigate the risk. According to publicly available information, conjunction events are now manually handled by operators on the Earth. The manual maneuver planning requires qualified personnel and will be impractical for constellations of thousands satellites. In this paper we propose a new modular autonomous collision avoidance system called "Space Navigator". It is based on a novel maneuver optimization approach that combines domain knowledge with Reinforcement Learning methods.

Heaps are well-studied fundamental data structures, having myriads of applications, both theoretical and practical. We consider the problem of designing a heap with an “optimal” extract-min operation. Assuming an arbitrary linear ordering of keys, a heap with n elements typically takes O(log n) time to extract the min-imum. Extracting all elements faster is impossible as this would violate the Ω(n log n) bound for comparison-based sorting. It is known, however, that is takes only O(n + k log k) time to sort just k smallest elements out of n given, which prompts that there might be a faster heap, whose extract-min performance depends on the number of elements extracted so far. In this paper we show that is indeed the case. We present a version of heap that performs insert in O(1) time and takes only O(log ∗ n + log k) time to carry out the k-th extraction (where log ∗ denotes the iterated logarithm). All the above bounds are worst-case.

The article examines the problems of defining the term computer simulations of scientific experiments. The first part analyzes the original method for classifying variations of terms proposed by Duran as the most successful for demonstrating significant existing contradictions among philosophers regarding the place and role of computer simulations in the philosophy of science. In the second part of the article, the term itself is formulated by the author through the identification of the main features of computer simulations as a result of studying the nature of experimental data as transferring traces of an experiment from a graphematical space to a representative one. Following the concept of transposition, the author derives a relevant term from the essence of computer simulations revealed by him, claiming a new epistemological significance for such kind of scientific experiments for the philosophy of science.

Abstract

Relativisation involves dependencies which, although unbounded, are constrained with respect to certain island domains. The Lambek calculus **L** can provide a very rudimentary account of relativisation limited to unbounded peripheral extraction; the Lambek calculus with bracket modalities **Lb** can further condition this account according to island domains. However in naïve parsing/theorem-proving by backward chaining sequent proof search for **Lb** the bracketed island domains, which can be indefinitely nested, have to be specified in the linguistic input. In realistic parsing word order is given but such hierarchical bracketing structure cannot be assumed to be given. In this paper we show how parsing can be realised which induces the bracketing structure in backward chaining sequent proof search with **Lb**.

We assess and compare computer science skills among final-year computer science undergraduates (seniors) in four major economic and political powers that produce approximately half of the science, technology, engineering, and mathematics graduates in the world. We find that seniors in the United States substantially outperform seniors in China, India, and Russia by 0.76–0.88 SDs and score comparably with seniors in elite institutions in these countries. Seniors in elite institutions in the United States further outperform seniors in elite institutions in China, India, and Russia by ∼0.85 SDs. The skills advantage of the United States is not because it has a large proportion of high-scoring international students. Finally, males score consistently but only moderately higher (0.16–0.41 SDs) than females within all four countries.

---

This proceedings publication is a compilation of selected contributions from the “Third International Conference on the Dynamics of Information Systems” which took place at the University of Florida, Gainesville, February 16–18, 2011. The purpose of this conference was to bring together scientists and engineers from industry, government, and academia in order to exchange new discoveries and results in a broad range of topics relevant to the theory and practice of dynamics of information systems. Dynamics of Information Systems: Mathematical Foundation presents state-of-the art research and is intended for graduate students and researchers interested in some of the most recent discoveries in information theory and dynamical systems. Scientists in other disciplines may also benefit from the applications of new developments to their own area of study.

Let G be a semisimple algebraic group whose decomposition into the product of simple components does not contain simple groups of type A, and P⊆G be a parabolic subgroup. Extending the results of Popov [7], we enumerate all triples (G, P, n) such that (a) there exists an open G-orbit on the multiple flag variety G/P × G/P × . . . × G/P (n factors), (b) the number of G-orbits on the multiple flag variety is finite.

I give the explicit formula for the (set-theoretical) system of Resultants of m+1 homogeneous polynomials in n+1 variables