Abstract: The article discusses the process of creating and developing a library and museum as part of the educational and scientific material base of the Cabinet of Geography at the Department of Geography and Ethnography of Imperial Kazan University. From the annual reports on the activities of the Department it can be seen that the acquisition of the Library with new editions, and the Ethnographic Museum with collections, was systematic. These processes were interconnected and aimed at creating a high-quality integrated material base for the development of the educational and scientific process. The article emphasizes that the leading role in the processes of forming the library and museum belonged to the head of the Department of Geography and Ethnography, Petr Ivanovich Krotov and Bruno Friedrichovich Adler. Peter Krotov created the Cabinet of Geography. Bruno Adler improved and developed not only the Cabinet of Geography itself, but also ethnographic science in the Volga Region and Russia as a whole. For example, having academic ties with Russian and foreign scientists, Bruno Adler received many publications and subjects for the Cabinet of Geography as a gift. This allowed for the year to increase several times, both the library and the museum under the Cabinet of Geography. The scientifically organized cabinet, which has comprehensive collections and professional literature, has become a quality source base for the development of ethnographic science at Kazan University.

Abstract: IGeographical aspects of "not geographical" data in information systems are considered. It is shown, that practically all widespread schemes of metadata suppose job with the geographical coordinates reflecting geographical aspect of an information content of described object. The situation varies at the context description which geographical aspect can be presented only place names more often. Necessity of expansion of schemes of data is proved. Geographical services of electronic libraries (search, cataloguing, navigation) are discussed. As illustrations the structure of a server program complex is resulted, graphic user interfaces are shown.

Abstract:

This article presents elements of the linguistic knowledge graph “Turklang”, developed at the Institute of Applied Semiotics of the Academy of Sciences of Tatarstan and used as a basis for creating a number of linguistic resources and tools: the portal “Turkic Morpheme”, the electronic corpus of the Tatar language “Tugan Tel”, morphoanalyzer. Creating an educational environment requires subject-oriented knowledge graphs, for which methods of general and open graphs are not suitable. This paper describes linguistic knowledge graphs, which reflect, on the one hand, potential capabilities of Turkic languages, and on the other hand, examples of actual use in texts. Peculiarity of these knowledge graphs is that they contain linguistic units of different linguistic levels, and concepts corresponding to meanings of these linguistic units, which are built into the thesaurus of concepts. Structure of this knowledge graph allows to formulate the content of a training course, build an individual educational trajectory, as well as create tests and tools of automated answer grading as part of knowledge control when teaching Turkic languages. This makes it possible to subsequently develop, based on these graphs, training programs taking into account the structural and functional features of the Turkic languages, and also contributes to the implementation of individual goals of students.

Abstract:

A study of two graphs of scientific cooperation based on co-authorship and citation according to the all-Russian mathematical portal was conducted Math-Net.Ru. A citation-based scientific collaboration graph is a directed graph without loops and multiple edges, whose vertices are the authors of publications, and arcs connect them when there is at least one publication of the first author that cites the publication of the second author. A co-authorship graph is an undirected graph in which the vertices are the authors, and the edges record the co-authorship of two authors in at least one article. The customary study of the main characteristics of both graphs is carried out: diameter and average distance, connectivity components and clustering. In both graphs, we observe a similar connectivity structure – the presence of a giant component and a large number of small components. The similarity and difference of scientific cooperation through co-authorship and citation is noted.

Abstract: We consider a distributed network whose topology is described by an undirected graph. The network itself can change its topology, using special “commands” provided by its nodes. The work proposes an extremely local atomic transformation acb of a change the end c of the edge ac, “moving” along the edge cb from vertex c to vertex b. As a result of this operation, the edge ac is removed, and the edge ab is added. Such a transformation is performed by a “command” from a common vertex c of two adjacent edges ac and cb. It is shown that from any tree you can get any other tree with the same set of vertices using only atomic transformations. If the degrees of the tree vertices are bounded by the number d (d 3), then the transformation does not violate this restriction. As an example of the purpose of such a transformation, the problems of maximizing and minimizing the Wiener index of a tree with a limited degree of vertices without changing the set of its vertices are considered. The Wiener index is the sum of pairwise distances between the vertices of a graph. The maximum Wiener index has a linear tree (a tree with two leaf vertices). For a root tree with a minimum Wiener index, its type and method for calculating the number of vertices in the branches of the neighbors of the root are determined. Two distributed algorithms are proposed: transforming a tree into a linear tree and transforming a linear tree into a tree with a minimum Wiener index. It is proved that both algorithms have complexity no higher than 2n–2, where n is the number of tree vertices. We also consider the transformation of arbitrary undirected graphs, in which there can be cycles, multiple edges and loops, without restricting the degree of the vertices. It is shown that any connected graph with n vertices can be transformed into any other connected graph with k vertices and the same number of edges in no more than 2(n+k)–2.

Abstract: Exponential size growth of such graphs as social networks, Internet graphs, etc. requires new approaches to their visualization. Along with node-link diagram representations, adjacency matrices and various hybrid representations are increasingly used for large graphs visualizations. This survey discusses new approaches to the visualization of large graphs using adjacency matrices and gives examples of applications where these approaches are used. We describe various types of patterns arising when adjacency matrices corresponding to modern networks are ordered, and algorithms making it possible to reveal these patterns. In particular, the use of matrix ordering methods in conjunction with algorithms looking for such graph patterns as stars, false stars, chains, near-cliques, full cliques, bipartite cores and near-bipartite cores enable users to create understandable visualizations of graphs with millions of vertices and edges. Examples of hybrid visualizations using node-link diagrams for representing sparse parts of a graph and adjacency matrices for representing dense parts are also given. The hybrid methods are used to visualize co-authorship networks, deep neural networks, to compare networks of the human brain connectivity, etc.

Abstract:

According to the portal Math-Net.Ru a graph of journal citation is constructed. To increase the reliability of the model, the citation time interval was chosen from 2010 to 2021, when the distribution of citation articles stabilized at the level of 3500-4500 citations per year. The structure of link aging is studied and it is shown that their half-life is equal to 8 years. Therefore, the publication date of the cited articles was limited to 2002. For the constructed citation graph, the main properties, such as a small diameter and a high density, are obtained, indicating a high level of scientific communication in the Math-Net.Ru. The absence of the “Matthew effect” as a pronounced advantage in quoting established journals in relation to less well-known ones is shown. Adequacy of the journal citation graph Math-Net.Ru as a model of scientific communication confirmed by comparing the ranking of journals in the citation graph with their SCIENCE INDEX rating in eLIBRARY.RU. A direct moderate relationship between the two rankings is shown. A number of meaningful conclusions are drawn from the analysis of the citation graph.

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 modern information space contains a lot of data, but they are often poorly structured, difficult to find and not always correct. This creates additional difficulties during researches, so digital spaces of scientific knowledge are currently being formed, in particular, based on knowledge graphs.

To ensure the quality of information, such graphs are often filled with data manually, which is time-consuming. Therefore, the creation of a tool that provides the ability to automate process of filling a graph with data, as well as ensures data quality, will simplify and speed up the process of forming digital spaces of scientific knowledge.

Methods for automating the filling of the graph with data are proposed, including parallel control of their integrity. Based on the proposed methods, a software module has been developed, the mechanisms of its functioning and its architecture are described.

Abstract:

Currently, Russian institutions are almost completely disconnected from Western information resources and services related to the publication of scientific journals. In such conditions, the task of replacing the departed services, reorientation to domestic scientific journals, Russian online library resources has become particularly actual. In the largest bibliographic database the eLibrary.ru, focused on Russian-language scientific publications, collected information about almost 15 thousand Russian-language journals. In the eLibrary.ru there is an analytical system "Russian Science Citation Index" that processes metadata of articles from more than 5 thousand Russian scientific journals. Is the eLibrary.ru ready to serve as a national bibliographic database? For what reason "white lists" of journals appear in Russian organizations?

The main problem of the RSCI is the quality of the constructed ratings of scientific journals. The methods of calculating ratings over the past years have caused certain criticisms. The paper provides an example of a rating of journals from the section "Mathematics" built in the RSCI. Journals that are little known among professional mathematicians were in the first positions. Serious deformations in the ratings of the eLibrary.ru undermine the confidence of scientists in the assessments of the credibility of Russian journals proposed by the eLibrary.ru. The reaction of some universities and scientific organizations is quite expected: organizations are beginning to introduce their own criteria for the success of the publication activities of employees associated with the publication of articles in journals from the so-called "white lists". The white list of journals is compiled, as a rule, by the expert councils of the organization specifically for each discipline and scientific direction. Scientometric indicators may be taken into account when compiling white lists, but they are not the primary criterion for the selection of journals. White lists can now become a reasonable addition to the ratings of bibliographic databases.

Abstract:

The century before last saw revolutionary changes in the transmission of information. For the functioning of the optical telegraph, which appeared in the late 18th century, cumbersome towers were necessary for the line of sight of semaphore signals. A hundred years later, the length of telegraph lines was hundreds of thousands of kilometers. At the turn of the century, the first experiments with the use of wireless telegraph began. This is reflected in numerous brochures, books, periodicals of that time. After another hundred years, many of these materials have become publicly available thanks to the development of the Internet and electronic libraries; they are intensively viewed and posted online. The rapid growth in the number of digital libraries and their content made this paper possible. Its goal is to trace the evolution of technologies and processes of information transfer reflected in literature, using a wide variety of electronic libraries - from the ambitious projects of the Library of Congress or Google Books with their millions of digitized books to modest private collections. dedicated to local topics. Materials from more than 20 electronic libraries have been used.

Abstract:

The tool for building ratings of scientific journals is one of the popular services of bibliographic databases. The task of building a rating is usually divided into two main subtasks: determining the reference group of journals and calculating the rating indicator for journals of this reference group. Practice shows that for the correct comparison of journals, a necessary condition is to limit the reference group to exclusively journals of a certain subject. In the case of methodological errors made at the stage of selecting a reference group, the values of the journal index in the rating may differ greatly from the expected ones.

For example, in the ranking of journals in the Russian Science Citation Index (RSCI) according to the two-year impact factor in the thematic area “Mathematics”, classical fundamental mathematical journals, contrary to expectations, do not reach the first positions of the rating. The first positions were taken by journals for which mathematics is not the dominant profile discipline. Analysis of statistical data on the subject of published articles and citations in journals that occupy leading positions in the RSCI rating shows that the multidisciplinary nature of these journals significantly influenced the rating indicators.

The noted misunderstanding leads to the idea that in this case, not all the articles of the journal should have been involved in the calculation of the rating, but only those related to this thematic area. At the same time, the existing scheme of thematic classification of directions also raises questions. The "bottom-up" classification, which is gaining popularity and works on a representative array of articles, seems to be more promising. Here thematic clusters are isolated on the basis of the concept of proximity of articles, interpreted as the proximity of their bibliographic links. And further, the thematic affiliation of the article is not assigned by the volitional decision of the author or the editorial board, but is strictly formally calculated on the basis of its bibliographic list.

Abstract: Universal access to the knowledge contained in the comprehensive printed record of mankind is a goal that can be achieved within a decade. With appropriate public policies and the development and deployment of standards, not addressed in this paper as they are the subject of a separate processes, most of this knowledge could be provided free at the point of use while increasing the return to copyright holders over the life of copyright protected publications. With proper attention to the representation of contextual knowledge in print images and the interchange of raw forms of this data, national governments can ensure the emergence of the first integrated and comprehensive resource representing the print literature of the world. Human creativity and capabilities will be unleashed without regard to barriers previously imposed by limited access to information, barriers that effectively kept everyone, no matter how privileged, from having full access to universal print heritage and supported dramatic differences between a very few who had significant access and the overwhelming majority that had virtually none.

Abstract: Динамический геоинформационный WWW-сайт природных и социальных условий Тюменской области ( в дальнейшем WWW-сайт) предназначен для комплексной оперативной информационной поддержки общественности, научных исследований, процессов проектирования освоения газоконденсатных месторождений и магистральных газопроводов, процессов управления региональных органов власти по направлениям АРХЕОЛОГИЯ, ЭТНОГРАФИЯ, СОЦИАЛЬНАЯ ЭКОНОМИКА, БИОРАЗНООБРАЗИЕ, ЛАНДШАФТЫ, ЗАГРЯЗНЕНИЕ Тюменской области.
WWW-сайт в глобальных сетях Internet/Intranet проектируется на основе корпоративного интегрированного геоинформационного банка данных. Банк данных должен представлять конечному пользователю возможность удаленного ввода, просмотра, модификации и обработки материалов наблюдений/исследований, манипулирования корпоративными картографическими данными с представлением параметрических сведений о геообъекте в виде HTML-документов /графиков/ таблиц/, производить прикладные тематические вычисления с созданием ситуационных карт.
Реализация проекта ориентирована на технологию Microsoft (SQL_Server, Internet Information Server, Visual Studio,) и технологию ESRI Mapobjects специализированной обработки электронных карт-схем масштаба 1:7500000. В перспективе использование на картах масштабов 1:1000000 и 1:100000 ESRI SDE, MapInfo SpatialWare.

Abstract: The problem of sorting data is analyzed, the order relation between which is described as the adjacency relation of vertices on an arbitrary graph. Subtasks and issues related to the ‘neighborhood‘ of the problem are highlighted; their solution is the level of ‘immersion‘ in the solution of the general problem. Algorithms for solving individual subtasks for graphs of a special kind are discussed, as well as various approaches to solving the sorting problem in the general case. A sorting task of this type was proposed at the ISI-Junior School Programming Cup in July 2019 (Innopolis).

Abstract: The article describes the experience of usage of new mobile map platform «CarryMap» in preparation for the detailed geostructural mapping and geochemical study of the Olon-Obod gold ore cluster (Southern Mongolia). The authors accumulated all types of geological information into a single ArcGIS project. The project contains raster maps, vector maps, and digital geological information. We converted this project in CMF2 and placed on mobile iOS & Android devices.

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 article describes the method of developing information-reference systems on history of mathematics. The main principles of this method are following. Information is grouped around persons, at that detailed biographical data is classified by chronological view, geographical view, etc. Bibliographical list of person includes either publication by this scientist or publications about this scientist. А connection between scientific activities of researcher with formal description of object domain where this researcher worked is clearly shown. This description includes the information model of the reference book, subsystem's realization features of the information system, and also main types of user information requests which are required for full-featured work with the system.

Abstract: This paper gives a brief review of available lexicographical resources and databases representing verbal vocabulary. The verb, being one of the most complicated, semantically intricate and grammatically sophisticated parts of speech, is characterized by multiplicity of senses and forms. Semantic structure of any verb is a complex of ontological and relational meaning components that may find a formal expression on different levels of the linguistic structure. Fixing verbs in electronic lexicographical resources, researchers come from different methodological orientations, and prioritize different aspects of the organization of the semantics of verbal vocabulary.

Abstract: An approach to automatically generating questions for tests or quizzes using the DBPedia knowledge graph is presented here. The selected knowledge graph has about 5 million entities. DBpedia SPARQL endpoint the ability to make queries to the semantic network using the SPARQL language. The algorithm, the basic queries to the knowledge graph for constructing questions, a non-standard approach to the search for entities are presented in this article.

Abstract:

Starting from spring 2022 a national system for evaluating the effectiveness of scientific research and development is being created using the database of leading Russian journals Russian Science Citation Index (RSCI). The article represents some results of the analysis of the RSCI normalized rating published in December 2022. Using the journal citation graph constructed from the data Math-Net.Ru on the example of thematic group OECD 101.Mathematics we show that in the case of a large number of self-citations of the journals, a relationship between the normalized rating and the number of references is found, and the relationship with self-citation is somewhat stronger than without self-citation. Analysis of the distribution of the journals by thematic groups shows that using a single attribute, such as the OECD, as a criterion does not allow forming a group as a community of journals with a single strongly connected component in the citation graph. We conclude that the research methods of journal citation graphs are a good basis for a comparative analysis of the characteristics of journals and their ranking, which means they can be used as tools for further development and improvement of journal ratings.

Abstract: The geoportal is a mapping web site; it can be described as specialized software and technologies for spatial data processing. Geoportal's main task is to provide the user with the tools and services of storing and cataloguing, publications and download the spatial (geographic) data, search and filter by metadata, interactive web visualization, direct access to geodata based web mapping services. Geoportal developed in ICM SB RAS with appropriate set of its components and services, has become a GIS platform for creating a number of applied GIS web applications. The article deals with the experience of design and development of these systems.

Abstract:

The problem of presenting scientific results of academic institute in a digital environment is considered. A new look at the knowledge space of a scientific institute constitutes a natural stage in the development of WEB technologies. The data structure inherent in previous studies allows you to organize search and navigation through them using a knowledge graph, like a version of the semantic library LibMeta. The knowledge graph gives a more complete and high-quality idea of the knowledge space, often removing the cognitive load in the perception of complex structures and data connections.

Abstract: This article is devoted to some aspects of development a system for managing of graphic documents collections. We describe the administrate and user interfaces of worked system, existing and new image features and their usage in different methods for search and classification, faced problems and solutions to solve them.

Abstract:

Modern scientometric systems and citation systems use various mechanisms of thematic search and thematic filtering of information. In most cases, a full-text approach is used for thematic analysis of articles and journals, which has a number of limitations. The use of algorithms based on graph analysis, both independently and in conjunction with full-text algorithms, eliminates these limitations and improves the completeness and accuracy of subject search. The algorithm developed by the authors and presented in this work uses the co-authorship graph to analyze the thematic proximity of journals. The algorithm is insensitive to the language of the journal and selects similar journals in different languages, which is difficult to implement for algorithms based on the analysis of full-text information. The algorithm was tested in the scientometric system IAS ISTINA. In the interface developed for these purposes, the user can select one journal that is close to him on the subject, and the system will automatically generate a selection of journals that may be of interest to the user both in terms of studying the materials available in them and in terms of publishing his own articles. In the future, the developed algorithm can be adapted to search for similar conferences, collections of publications and scientific projects. The presence of such a tool will increase the publication activity of young employees, increase the citation rate of articles and the citation rate between journals. The results of the algorithm for determining thematic proximity between journals, collections, conferences and scientific projects can also be used to build rules in models of differentiating access to data based on domain ontologies.