Risk-models and criteria of information confrontation in social networks
Abstract—On the basis of logical-probabilistic approach proposed risk model successful attacks on social media on the Internet in terms of information warfare. We formulated and investigated the criterion of decision-making framework to achieve the goals of information warfare. Proposed algorithmic foundations of the developed criteria in Hadoop cluster.
The need for transmission and storage of large amounts of scientific data in the project space radio telescope ”Radioastron” required us to organize a reliable communication channel between the tracking station in Pushchino and treatment centers in Moscow. Network management data requires us to an integrated approach and covers the organization secure access to manage network devices, timely replacement of equipment and software upgrades, backups, as well as documentation of the network infrastructure. The reliability of the channel is highly dependent on continuous monitoring of network and server equipment and communication lines.
The article presents the development of the ontology for a multi-agent subsystem analysing user posts in social networks in order to identify security threats to society. The testing of multi-agent subsystem using the developed ontology is described.
What is hybrid warfare? And what role does information play in today's conflicts? In the context of the technological/information revolution of the last two decades—which has greatly amplified the danger posed by nonmilitary means of political struggle—Hybrid Conflicts and Information Warfare addresses these questions from the perspectives of both Western and Russian experts. Incorporating both theory and contemporary realities, including the case of the Islamic State, the authors offer a unique dialogue on the nature of conflict in the second decade of the twenty-first century.
The report discusses methods and software tools for the creation of information-analytical system (IAS) monitoring of dangerous celestial bodies and planning Asteroid-comet hazard (ACH). The article provides a description of the structure of the system and its functional components to enable rapid assessment of potential threats and forecast the effects of a collision dangerous space objects to the Earth. The result of the system is the integrated analytical information about the possible risks for the decision to reduce the possible damage and to identify effective measures for emergency management of cosmic origin.
A general model of socio-semantic network is presented in terms of state-transitions systems. We provide some examples and indicate research directions, which seem to us the most important from the application point of view.
Comparative analysis of network and real-life identity explores two hypotheses: 1) aspects of identity, its different parameters may have diverse profiles for the network and the reality conditions; 2) they may also indicate gender and age differences. The study is held on the sample of 42 participants, aged from 15 to 25, who were interviewed. Gender and age differences were found referring to the social identity in the network and the reality, and for superficial identity in the network condition, as well as differences for individual and relational identity in the network and the reality conditions. Variability of the factor structure was found for the network condition in comparison with the aspects of identity in reality.
A model for organizing cargo transportation between two node stations connected by a railway line which contains a certain number of intermediate stations is considered. The movement of cargo is in one direction. Such a situation may occur, for example, if one of the node stations is located in a region which produce raw material for manufacturing industry located in another region, and there is another node station. The organization of freight traﬃc is performed by means of a number of technologies. These technologies determine the rules for taking on cargo at the initial node station, the rules of interaction between neighboring stations, as well as the rule of distribution of cargo to the ﬁnal node stations. The process of cargo transportation is followed by the set rule of control. For such a model, one must determine possible modes of cargo transportation and describe their properties. This model is described by a ﬁnite-dimensional system of diﬀerential equations with nonlocal linear restrictions. The class of the solution satisfying nonlocal linear restrictions is extremely narrow. It results in the need for the “correct” extension of solutions of a system of diﬀerential equations to a class of quasi-solutions having the distinctive feature of gaps in a countable number of points. It was possible numerically using the Runge–Kutta method of the fourth order to build these quasi-solutions and determine their rate of growth. Let us note that in the technical plan the main complexity consisted in obtaining quasi-solutions satisfying the nonlocal linear restrictions. Furthermore, we investigated the dependence of quasi-solutions and, in particular, sizes of gaps (jumps) of solutions on a number of parameters of the model characterizing a rule of control, technologies for transportation of cargo and intensity of giving of cargo on a node station.
Event logs collected by modern information and technical systems usually contain enough data for automated process models discovery. A variety of algorithms was developed for process models discovery, conformance checking, log to model alignment, comparison of process models, etc., nevertheless a quick analysis of ad-hoc selected parts of a journal still have not get a full-fledged implementation. This paper describes an ROLAP-based method of multidimensional event logs storage for process mining. The result of the analysis of the journal is visualized as directed graph representing the union of all possible event sequences, ranked by their occurrence probability. Our implementation allows the analyst to discover process models for sublogs defined by ad-hoc selection of criteria and value of occurrence probability
The geographic information system (GIS) is based on the first and only Russian Imperial Census of 1897 and the First All-Union Census of the Soviet Union of 1926. The GIS features vector data (shapefiles) of allprovinces of the two states. For the 1897 census, there is information about linguistic, religious, and social estate groups. The part based on the 1926 census features nationality. Both shapefiles include information on gender, rural and urban population. The GIS allows for producing any necessary maps for individual studies of the period which require the administrative boundaries and demographic information.
It is well-known that the class of sets that can be computed by polynomial size circuits is equal to the class of sets that are polynomial time reducible to a sparse set. It is widely believed, but unfortunately up to now unproven, that there are sets in EXPNP, or even in EXP that are not computable by polynomial size circuits and hence are not reducible to a sparse set. In this paper we study this question in a more restricted setting: what is the computational complexity of sparse sets that are selfreducible? It follows from earlier work of Lozano and Torán (in: Mathematical systems theory, 1991) that EXPNP does not have sparse selfreducible hard sets. We define a natural version of selfreduction, tree-selfreducibility, and show that NEXP does not have sparse tree-selfreducible hard sets. We also construct an oracle relative to which all of EXP is reducible to a sparse tree-selfreducible set. These lower bounds are corollaries of more general results about the computational complexity of sparse sets that are selfreducible, and can be interpreted as super-polynomial circuit lower bounds for NEXP.