Anton Anikin

Dr. Anton Anikin

Software Engineering, Volgograd State Technical University, Volgograd, Volgogradskaya Oblast’, Russia
orcid

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2020 in Cognitive Systems Research
Verified
Journal Article
Closed access
OSOleg Sychev
Oleg Sychev
Anton AnikinAnton Anikin
Anton Anikin
APArtem Aleksandrovich Prokudin
Artem Aleksandrovich Prokudin

28 December 2016 in BMC Genomics
Verified
Journal Article
Open access
PDF file
ERElena Romanova
Elena Romanova
VAVladimir V. Aleoshin
Vladimir V. Aleoshin
RKRavil M. Kamaltynov
Ravil M. Kamaltynov
KMKirill Mikhailov
Kirill Mikhailov
MLMaria Logacheva
Maria Logacheva
DSDmitry Sherbakov
Dmitry Sherbakov
Amphipods (Crustacea) of Lake Baikal are a very numerous and diverse group of invertebrates generally believed to have originated by adaptive radiation. The evolutionary history and phylogenetic relationships in Baikalian amphipods still remain poorly understood. Sequencing of mitochondrial genomes is a relatively feasible way for obtaining a set of gene sequences suitable for robust phylogenetic inferences. The architecture of mitochondrial genomes also may provide additional information on the mechanisms of evolution of amphipods in Lake Baikal. Three complete and four nearly complete mitochondrial genomes of Baikalian amphipods were obtained by high-throughput sequencing using the Illumina platform. A phylogenetic inference based on the nucleotide sequences of all mitochondrial protein coding genes revealed the Baikalian species to be a monophyletic group relative to the nearest non-Baikalian species with a completely sequenced mitochondrial genome - Gammarus duebeni. The phylogeny of Baikalian amphipods also suggests that the shallow-water species Eulimnogammarus has likely evolved from a deep-water ancestor, however many other species have to be added to the analysis to test this hypothesis. The gene order in all mitochondrial genomes of studied Baikalian amphipods differs from the pancrustacean ground pattern. Mitochondrial genomes of four species possess 23 tRNA genes, and in three genomes the extra tRNA gene copies have likely undergone remolding. Widely varying lengths of putative control regions and other intergenic spacers are typical for the mitochondrial genomes of Baikalian amphipods. The mitochondrial genomes of Baikalian amphipods display varying organization suggesting an intense rearrangement process during their evolution. Comparison of complete mitochondrial genomes is a potent approach for studying the amphipod evolution in Lake Baikal.

9 November 2021 in Education Sciences
Verified
Journal Article
Open access
PDF file
OSOleg Sychev
Oleg Sychev
NPNikita Penskoy
Nikita Penskoy
Anton AnikinAnton Anikin
Anton Anikin
MDMikhail E. Denisov
Mikhail E. Denisov
APArtem Aleksandrovich Prokudin
Artem Aleksandrovich Prokudin
Intelligent tutoring systems have become increasingly common in assisting students but are often aimed at isolated subject-domain tasks without creating a scaffolding system from lower- to higher-level cognitive skills, with low-level skills often neglected. We designed and developed an intelligent tutoring system, CompPrehension, which aims to improve the comprehension level of Bloom’s taxonomy. The system features plug-in-based architecture, easily adding new subject domains and learning strategies. It uses formal models and software reasoners to solve the problems and judge the answers, and generates explanatory feedback about the broken domain rules and follow-up questions to stimulate the students’ thinking. We developed two subject domain models: an Expressions domain for teaching the expression order of evaluation, and a Control Flow Statements domain for code-tracing tasks. The chief novelty of our research is that the developed models are capable of automatic problem classification, determining the knowledge required to solve them and so the pedagogical conditions to use the problem without human participation. More than 100 undergraduate first-year Computer Science students took part in evaluating the system. The results in both subject domains show medium but statistically significant learning gains after using the system for a few days; students with worse previous knowledge gained more. In the Control Flow Statements domain, the number of completed questions correlates positively with the post-test grades and learning gains. The students’ survey showed a slightly positive perception of the system.

21 December 2020 in Optimization Methods and Software
Verified
Journal Article
Closed access
Anton AnikinAnton Anikin
Anton Anikin
AGAlexander Gasnikov
Alexander Gasnikov
AGAlexander Gornov
Alexander Gornov
DKDmitry Kamzolov
Dmitry Kamzolov
YMYury Maximov
Yury Maximov
YNYurii Nesterov
Yurii Nesterov
Over the last two decades, the PageRank problem has received increased interest from the academic community as an efficient tool to estimate web-page importance in information retrieval. Despite numerous developments, the design of efficient optimization algorithms for the PageRank problem is still a challenge. This paper proposes three new algorithms with a linear time complexity for solving the problem over a bounded-degree graph. The idea behind them is to set up the PageRank as a convex minimization problem over a unit simplex, and then solve it using iterative methods with small iteration complexity. Our theoretical results are supported by an extensive empirical justification using real-world and simulated data.

11 September 2018 in Optimization Methods and Software
Verified
Journal Article
Closed access
SGSergey Guminov
Sergey Guminov
AGAlexander Gasnikov
Alexander Gasnikov
Anton AnikinAnton Anikin
Anton Anikin
AGAlexander Gornov
Alexander Gornov
In the late sixties, N. Shor and B. Polyak independently proposed optimal first-order methods for solving non-smooth convex optimization problems. In 1982 A. Nemirovski proposed optimal first-order methods for solving smooth convex optimization problems, which utilized auxiliary line search. In 1985 A. Nemirovski and Yu. Nesterov proposed a parametric family of optimal first-order methods for solving convex optimization problems with intermediate smoothness. In 2013 Yu. Nesterov proposed a universal gradient method which combined all good properties of the previous methods, except the possibility of using auxiliary line search. One can typically observe that in practice auxiliary line search improves performance for many tasks. In this paper, we propose the apparently first such method of non-smooth convex optimization allowing the use of the line search procedure. Moreover, it is based on the universal gradient method, which does not require any a priori information about the actual degree of smoothness of the problem. Numerical experiments demonstrate that the proposed method is, in some cases, considerably faster than Nesterov's universal gradient method.

19 December 2016
Verified
Conference Paper
Closed access
MKMarina Kultsova
Marina Kultsova
RRRoman Rudnev
Roman Rudnev
Anton AnikinAnton Anikin
Anton Anikin
IZIrina Zhukova
Irina Zhukova
In this paper a concept of intelligent support of decision making in waste management using knowledge-based approach is presented, which is a promising way to increase efficiency of waste management system in the cities. Analysis of the domain of waste management shows that the appropriate support of decision making can be implemented using contemporary technologies of artificial intelligent such as rule-based reasoning and ontology. In the paper a general scheme of the integration of this reasoning mechanism and ontology is suggested, as well the problems of domain knowledge representation are considered. Implementation of a prototype of intelligent decision support system in waste management using rule-based reasoning and ontology is described.