Valery Anatolievich Sokolov
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Valery Anatolievich Sokolov has a total of 63 co-authors. Here are the top co-authors by number of shared publications:
- Егор Владимирович Кузьмин
P.G. Demidov Yaroslavl State University
12 shared publications - Dmitry Ju. Chalyy
P.G. Demidov Yaroslavl State University
5 shared publications D. A. Ryabukhin
Demidov Yaroslavl State University
4 shared publicationsEvgeny Boytsov
Yaroslavl State University, Russian Federation
3 shared publications- Nikolay Shilov
St. Petersburg Federal Research Center of the Russian Academy of Sciences
3 shared publications - Валерий Георгиевич Дурнев
Yaroslav State University
3 shared publications
Latest Publications
- 1 February 2022
- Published by Steklov Mathematical Institute in Russian Mathematical Surveys
- Vol. 77 (1) , 183-188
Boris Abramovich Trakhtenbrot
Choose from multiple DOI resolution options
- 1 February 2022
- Published by Steklov Mathematical Institute in Russian Mathematical Surveys
- Vol. 77 (1) , 183-188
Boris Abramovich Trakhtenbrot
Choose from multiple DOI resolution options
- 30 January 2022
- Published by Steklov Mathematical Institute
- Vol. 77 (1(463)) , 191-195
Борис Абрамович Трахтенброт (к столетию со дня рождения)
- 30 January 2022
- Published by Steklov Mathematical Institute
- Vol. 77 (1(463)) , 191-195
Борис Абрамович Трахтенброт (к столетию со дня рождения)
- 1 December 2021
- Published by Allerton Press in Automatic Control and Computer Sciences
- Vol. 55 (7) , 702-711
On the Existence Problem of Finite Bases of Identities in the Algebras of Recursive Functions
Raphael Robinson showed that all primitive recursive functions, depending on one argument, and only they could be obtained from two functions $$s(x) = x +
- 1 December 2021
- Published by Allerton Press in Automatic Control and Computer Sciences
- Vol. 55 (7) , 702-711
On the Existence Problem of Finite Bases of Identities in the Algebras of Recursive Functions
Raphael Robinson showed that all primitive recursive functions, depending on one argument, and only they could be obtained from two functions $$s(x) = x +
- Open Access
- 21 September 2020
- Published by P.G. Demidov Yaroslavl State University in Modeling and Analysis of Information Systems
- Vol. 27 (3) , 304-315
On the Existence Problem of Finite Bases of Identities in the Algebras of Recursive Functions
О проблеме существования конечных базисов тождеств в алгебрах рекурсивных функций
- 21 September 2020
- Published by P.G. Demidov Yaroslavl State University in Modeling and Analysis of Information Systems
- Vol. 27 (3) , 304-315
Open AccessOn the Existence Problem of Finite Bases of Identities in the Algebras of Recursive Functions
О проблеме существования конечных базисов тождеств в алгебрах рекурсивных функций
- 3 September 2020
- Published by American Society for Engineering Education
- p. 8.461.1-8.461.10
Education By Correspondence In Russia: From Roots To The Present
- 3 September 2020
- Published by American Society for Engineering Education
- p. 8.461.1-8.461.10
Education By Correspondence In Russia: From Roots To The Present
- 1 December 2019
- Published by Allerton Press in Automatic Control and Computer Sciences
- Vol. 53 (7) , 699-704
A Question-Answering System for Applicant Support Using Modern Messaging Apps
There is an increasing user interest in instant messaging applications. These applications allow us to interact with other users and include a functionalit
- 1 December 2019
- Published by Allerton Press in Automatic Control and Computer Sciences
- Vol. 53 (7) , 699-704
A Question-Answering System for Applicant Support Using Modern Messaging Apps
There is an increasing user interest in instant messaging applications. These applications allow us to interact with other users and include a functionalit
- 1 December 2019
- Published by Allerton Press in Automatic Control and Computer Sciences
- Vol. 53 (7) , 638-643
Word Embedding for Semantically Related Words: An Experimental Study
The ability to identify semantic relations between words has made a word2vec model widely used in NLP tasks. The idea of word2vec is based on a simple rule
- 1 December 2019
- Published by Allerton Press in Automatic Control and Computer Sciences
- Vol. 53 (7) , 638-643
Word Embedding for Semantically Related Words: An Experimental Study
The ability to identify semantic relations between words has made a word2vec model widely used in NLP tasks. The idea of word2vec is based on a simple rule
- Open Access
- 20 June 2019
- Published by P.G. Demidov Yaroslavl State University in Modeling and Analysis of Information Systems
- Vol. 26 (2) , 203-212
On the Way to SD-WAN Solution
В статье описываются предпосылки и некоторые этапы реализации промышленного решения по построению управляемой ячеистой оверлейной сети поверх полностью или частично неуправляемой опорной сети. Оверлейная сеть имеет (или может иметь) некоторые функции из мира программно-определяемых сетей. Мы называем это решение SD-WANLite, чтобы подчеркнуть, что это решение не является (и не будет в обозримом будущем) полным SD-WAN решением.
- 20 June 2019
- Published by P.G. Demidov Yaroslavl State University in Modeling and Analysis of Information Systems
- Vol. 26 (2) , 203-212
Open AccessOn the Way to SD-WAN Solution
В статье описываются предпосылки и некоторые этапы реализации промышленного решения по построению управляемой ячеистой оверлейной сети поверх полностью или частично неуправляемой опорной сети. Оверлейная сеть имеет (или может иметь) некоторые функции из мира программно-определяемых сетей. Мы называем это решение SD-WANLite, чтобы подчеркнуть, что это решение не является (и не будет в обозримом будущем) полным SD-WAN решением.
- Open Access
- 15 March 2019
- Published by P.G. Demidov Yaroslavl State University in Modeling and Analysis of Information Systems
- Vol. 26 (1) , 75-89-89
An Effective Algorithm for Collision Resolution in Security Policy Rules
A firewall is the main classic tool for monitoring and managing the network traffic on a local network. Its task is to compare the network traffic passing through it with the established security rules. These rules, which are often also called security policy, can be defined both before and during the operation of the firewall. Managing the security policy of large corporate networks is a complex task. In order to properly implement it, firewall filtering rules must be written and organized neatly and without errors. In addition, the process of changing or inserting new rules should be performed only after a careful analysis of the relationship between the rules being modified or inserted, as well as the rules that already exist in the security policy. In this article, the authors consider the classification of relations between security policy rules and also give the definition of all sorts of conflicts between them. In addition, the authors present a new efficient algorithm for detecting and resolving collisions in firewall rules by the example of the Floodlight SDN controller.
- 15 March 2019
- Published by P.G. Demidov Yaroslavl State University in Modeling and Analysis of Information Systems
- Vol. 26 (1) , 75-89-89
Open AccessAn Effective Algorithm for Collision Resolution in Security Policy Rules
A firewall is the main classic tool for monitoring and managing the network traffic on a local network. Its task is to compare the network traffic passing through it with the established security rules. These rules, which are often also called security policy, can be defined both before and during the operation of the firewall. Managing the security policy of large corporate networks is a complex task. In order to properly implement it, firewall filtering rules must be written and organized neatly and without errors. In addition, the process of changing or inserting new rules should be performed only after a careful analysis of the relationship between the rules being modified or inserted, as well as the rules that already exist in the security policy. In this article, the authors consider the classification of relations between security policy rules and also give the definition of all sorts of conflicts between them. In addition, the authors present a new efficient algorithm for detecting and resolving collisions in firewall rules by the example of the Floodlight SDN controller.
- Open Access
- 19 December 2018
- Published by P.G. Demidov Yaroslavl State University in Modeling and Analysis of Information Systems
- Vol. 25 (6) , 726-733
Word Embedding for Semantically Relative Words: an Experimental Study
The ability to identify semantic relations between words has made a word2vec model widely used in NLP tasks. The idea of word2vec is based on a simple rule that a higher similarity can be reached if two words have a similar context. Each word can be represented as a vector, so the closest coordinates of vectors can be interpreted as similar words. It allows to establish semantic relations (synonymy, relations of hypernymy and hyponymy and other semantic relations) by applying an automatic extraction. The extraction of semantic relations by hand is considered as a time-consuming and biased task, requiring a large amount of time and some help of experts. Unfortunately, the word2vec model provides an associative list of words which does not consist of relative words only. In this paper, we show some additional criteria that may be applicable to solve this problem. Observations and experiments with well-known characteristics, such as word frequency, a position in an associative list, might be useful for improving results for the task of extraction of semantic relations for the Russian language by using word embedding. In the experiments, the word2vec model trained on the Flibusta and pairs from Wiktionary are used as examples with semantic relationships. Semantically related words are applicable to thesauri, ontologies and intelligent systems for natural language processing.
- 19 December 2018
- Published by P.G. Demidov Yaroslavl State University in Modeling and Analysis of Information Systems
- Vol. 25 (6) , 726-733
Open AccessWord Embedding for Semantically Relative Words: an Experimental Study
The ability to identify semantic relations between words has made a word2vec model widely used in NLP tasks. The idea of word2vec is based on a simple rule that a higher similarity can be reached if two words have a similar context. Each word can be represented as a vector, so the closest coordinates of vectors can be interpreted as similar words. It allows to establish semantic relations (synonymy, relations of hypernymy and hyponymy and other semantic relations) by applying an automatic extraction. The extraction of semantic relations by hand is considered as a time-consuming and biased task, requiring a large amount of time and some help of experts. Unfortunately, the word2vec model provides an associative list of words which does not consist of relative words only. In this paper, we show some additional criteria that may be applicable to solve this problem. Observations and experiments with well-known characteristics, such as word frequency, a position in an associative list, might be useful for improving results for the task of extraction of semantic relations for the Russian language by using word embedding. In the experiments, the word2vec model trained on the Flibusta and pairs from Wiktionary are used as examples with semantic relationships. Semantically related words are applicable to thesauri, ontologies and intelligent systems for natural language processing.