Abstract: The web graph is the most popular model of real Web fragments used in Web science. The study of communities in the web graph contributes to a better understanding of the organization of the fragment of the Web and the processes occurring in it. It is proposed to allocate a communication graph in a web graph containing only those vertices (and arcs between them) that have counter arcs, and in it to investigate the problem of splitting into communities. By analogy with social studies, connections realized through edges in a communication graph are proposed to be called "strong" and all others "weak". Thematic communities with meaningful interpretations are built on strong connections. At the same time, weak links facilitate communication between sites that do not have common features in the field of activity, geography, subordination, etc., and basically preserve the coherence of the fragments of the Web even in the absence of strong links. Experiments conducted for a fragment of the scientific and educational Web of Russia show the possibility of meaningful interpretation of the results and the prospects of such an approach.

Abstract:

The construction of the schedule is the distribution of a discrete set of events in a given time interval, subject to the specified restrictions. The aim of the work is to describe a mathematical model of the automation of the scheduling process in an educational institution. Also the approaches to the compilation of the optimal schedule are considered. In the studied tasks a large amount of initial original information is used, which differs in its composition, and contains a large number of requirements that must be taken into account. Therefore, scheduling refers to the class of NP-complete integer programming problems, which implies that as the number of values of given variables increases, the complexity of the solution will grow exponentially. Note that the quality of the established lesson schedule directly affects the efficiency of the educational process of the university.

The article describes the process of forming the schedule of classes: at the first stage, you need to create an initial schedule based on the existing student contingent and teachers, audiences, as well as a number of additional restrictions; at the second stage, the initial schedule is optimized; at the third stage, it is allowed to adjust the received schedule by university staff.

Abstract:

Translated plagiarism has widely spread in a scientific world and posed a serious problem due to the challenges in its automatic detection. However, in the last five years some progress has been observed in this area. The authors of this paper, as well as foreign research team from several universities independently of each other proposed an approach to detect plagiarism based on citation analysis with search of initial source for analyzed suspected paper with the same or similar references. Developed methods of detection of illegal use of borrowed text successfully passed several tests. The report shows the results that we have obtained in the last four years.

Abstract:

The approaches to the development (using the contactless touchscreen game controller Microsoft Kinect) of rehabilitation games for the complete or partial restoration of the motor functions of post-stroke patients using Microsoft Kinect are outlined. Problems that have been overcome, when working with the Microsoft Kinect and elements of game mechanics to achieve the involvement of the patient in the rehabilitation and gaming process are described.

Abstract:

This paper is devoted to the design and development of a system for automating numerical similarity assessment of Android applications. The task of application similarity evaluation is reduced to the similarity evaluation of sets of control flow graphs constructed based on code from classes.dex files of applications. The similarity value was calculated based on the similarity matrix. The algorithms of graph editing and Levenshtein distance were used to compare control flow graphs. Application similarity criteria were formulated and their representation forms were investigated. Types of Android application models and methods of their construction are presented. A prototype of the system for automating the numerical evaluation of Android-applications similarity is developed. Optimization of the software solution is performed with the help of parallel programming tools. Experiments are carried out and the conclusion is made about the ability of the developed system to detect similarities between Android applications.

Abstract: This work is devoted to the description of the project of updating the technology of algorithmic language application created in the USSR in the 60s of the XX century by V. F. Turchin. The language was originally intended for various logical transformations primarily of text material. In practice, the scope was wider: machine translation, optimization and compilation of programs, proof of theorems, modeling of complex electronic circuits, solving a number of problems of artificial intelligence. The language now has a sufficient number of followers, mainly in scientific circles.The objective of the described project is to create a product that allows the use of Refal in modern mass applications and to expand the range of its potential users to the entire Internet. A survey of the community of users and developers of Refal was conducted in order to get an idea of the current state of Affairs, current implementations and ways of language development. Possible means of project implementation were considered. No information was received on similar developments under way.