ATAndrey Terekhov

Andrey Terekhov

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Andrey Terekhov has a total of 16 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • A Simple Way to Improve Road Safety by Avoiding Dangerous Sections of the Route

    by A. M. Gershteyn, A. N. Terekhov

    A method of improving road traffic safety that implies constructing a route bypassing obstacles identified on a road map (graph) is considered on the example of Moscow, Russia. The obstacles are the edges of the road graph containing a statistically significant number of road traffic accidents (RTA). To check the routing efficiency, the indicator proposed by the authors earlier—the relative risk ratio—is used that equals the ratio of the number of RTA along the route with the obstacles taken into account to the number of RTA counted along the original route constructed without the obstacles taken into account. Avoiding obstacles is shown to help reduce the relative risk ratio by 9–31% (depending on the length of the original route) by increasing the average length of the route by 6–11% and increasing the average number of traversable vertices of the road graph by 6-28%.


  • Open Access

    Bypassing dangerous sections of the route as a way to improve traffic safety (using St. Petersburg as an example)

    by Arkady Gershteyn, Andrej Terekhov

    На примере г. Санкт-Петербурга рассмотрен способ повышения безопасности дорожного движения, заключающийся в построении маршрута, обходящего препятствия, выявленные на дорожной карте (графе). Препятствиями служат ребра дорожного графа, содержащие статистически достоверно большое число дорожно-транспортных происшествий (ДТП). Для проверки эффективности маршрутизации используется показатель — относительный риск ДТП, равный отношению числа ДТП вдоль маршрута, учитывающего препятствия, к числу ДТП, подсчитанных вдоль исходного, построенного без учета препятствий маршрута. Показано, что обход препятствий позволяет снизить относительный риск ДТП на 14,5–36 % (в зависимости от длины исходного маршрута) за счет увеличения средней длины маршрута на 8–10 % и увеличения среднего числа проходимых вершин дорожного графа на 3–12 %.


  • A Simple Way to Improve Road Safety by Avoiding Dangerous Sections of the Route

    by Gershteyn A. M., Terekhov A. N.

    A simple routing algorithm to improve vehicle safety on a road network has been proposed. If the road network is represented by a graph with edges and nodes, it is sufficient to mark edges with highest incidence (top 800) of severe Traffic Accidents (TA) by adding to the attribute of the edge some penalty and the routing algorithm (Dijkstra or Bellman-Ford) will try to avoid these edges automatically. To estimate safety gain, a Relative Risk Ratio RRR = (TAs along route which avoids TA hotspots/TAs along original route) introduced in [1] was used. Computer simulation was performed for Moscow, Russian Federation. It is shown that for the same start and end points of the route, an average RRR gets smaller by 9...31 % depending on original route length. It is also shown that the cost for improving vehicle safety is an increase in the route length (by 6...11 %) and an increase in the number of nodes in the route (by 6...28 %).


  • Open Access

    Routing Algorithm for Vehicles that Avoids Severe Traffic Accident Hotspots on the Road Network (Using the City of Springfield, Massachusetts as a Case Study)

    by Arkadiy Gershtein, Andrey Terekhov

    В работе [1] найдены статистически значимые кластеры дорожно-транспортных происшествий (ДТП), которые можно интерпретировать как участки повышенной опасности ДТП (УПО). В данной работе, продолжающей исследования, проведенные в [1], рассмотрен простой способ обхода УПО при маршрутизации транспорта по критерию общей длины пути, заключающийся в том, что атрибуту длины каждой грани дорожного графа, ведущей к УПО, присваивается очень большое число, что делает эту грань практически непроходимой для алгоритма маршрутизации. Численные расчеты, для которых используется дорожная карта Спрингфилда (Массачусетс) и данные об УПО в Спрингфилде, показывают, что для маршрутов, чьи начальные и конечные пункты совпадают, маршрутизация с обходом УПО увеличивает протяженность маршрута относительно первоначальной, вычисленной без учета УПО. В пределе среднее отношение длин обоих маршрутов стремится для Спрингфилда к 1,04. Для проверки эффективности маршрутизации введен новый показатель — относительный риск ДТП, равный отношению числа ДТП вдоль маршрута, учитывающего УПО, к числу ДТП, подсчитанных вдоль исходного, построенного без учета УПО маршрута. Показано, что при использовании алгоритма обхода кластеров ДТП для маршрутов длиной более 4 км. средний относительный риск ДТП снижается на величину порядка 16 % при увеличении длины маршрута в среднем на 8%.


  • Open Access

    DBSCAN clustering method is applied to identify severe Traffic Accident (TA) hotpots on roads

    by Arkadiy Gershtein, Andrey Terekhov

    DBSCAN clustering method is applied to identify severe Traffic Accident (TA) hotpots on roads. The research examines severe TA, defined as those that led to human damage (injury or death), in the city of Newton, MA and in the entire state of Massachusetts, USA from 2013 to 2018. DBSCAN algorithm was also applied to network-constrained uniformly distributed over road network data to locate threshold in number of points per cluster so that all more populated clusters identified in real data can be treated as statistically significant. For DBSCAN algorithm two types of distance metrics, Euclidean and over Network, were compared. It is found that both distances are equivalent on scale of 10 meters, which justifies hybrid approach to clustering: using Network distance only to generate uniformly distributed points needed for Monte-Carlo simulations. All clustering can be performed using Euclidean distances which is much faster and more memory efficient. Subsequent years analysis demonstrates the extend that hotspots identified are stable and occur consecutively for several years and hence may possess predictive value.


  • IT Education in St. Petersburg State University

    by Terekhov Andrey, Mariia Platonova

  • Interactive Near Duplicate Search in Software Documentation

    by D. V. Luciv, D. V. Koznov, A. A. Shelikhovskii, K. Yu. Romanovsky, G. A. Chernishev, A. N. Terekhov, D. A. Grigoriev, A. N. Smirnova, D. V. Borovkov, A. I. Vasenina

    Various software features such as classes, methods, requirements, and tests often have similar functionality. This can lead to emergence of duplicates in their descriptive documentation....


  • Open Access

    Interactive Duplicate Search in Software Documentation

    by D. V. Luciv, D. V. Koznov, A. A. Shelikhovskii, K. Yu. Romanovsky, G. A. Chernishev, A. N. Terekhov, D. A. Grigoriev, A. N. Smirnova, D. V. Borovkov, A. I. Vasenina

    Various software features such as classes, methods, requirements, and tests often have similar functionality. This can lead to emergence of duplicates in their descriptive documentation. Uncontrolled duplicates created via copy/paste hinder the process of documentation maintenance. Therefore, the task of duplicate detection in software documentation is of importance. Solving it makes planned reuse possible, as well as creating and using templates for unification and automatic generation of documentation. In this paper, we present an interactive process for duplicate detection that involves the user in order to conduct meaningful search. It includes a new formal definition of a near duplicate, a pattern-based, and the proof of its completeness. Moreover, we demonstrate the results of experimenting on a collection of documents of several industrial projects.

  • Detecting Near Duplicates in Software Documentation

    by D. V. Luciv, D. V. Koznov, G. A. Chernishev, A. N. Terekhov, K. Yu. Romanovsky, D. A. Grigoriev

    Contemporary software documentation is as complicated as the software itself. During its lifecycle, the documentation accumulates a lot of “near duplicate” fragments, i.e. chunks of text that...


  • Open Access

    Detecting Near Duplicates in Software Documentation

    by D. V. Luciv, D. V. Koznov, G. A. Chernishev, A. N. Terekhov

    Contemporary software documentation is as complicated as the software itself. During its lifecycle, the documentation accumulates a lot of near duplicate fragments, i.e. chunks of text that were copied from a single source and were later modified in different ways. Such near duplicates decrease documentation quality and thus hamper its further utilization. At the same time, they are hard to detect manually due to their fuzzy nature. In this paper we give a formal definition of near duplicates and present an algorithm for their detection in software documents. This algorithm is based on the exact software clone detection approach: the software clone detection tool Clone Miner was adapted to detect exact duplicates in documents. Then, our algorithm uses these exact duplicates to construct near ones. We evaluate the proposed algorithm using the documentation of 19 open source and commercial projects. Our evaluation is very comprehensive - it covers various documentation types: design and requirement specifications, programming guides and API documentation, user manuals. Overall, the evaluation shows that all kinds of software documentation contain a significant number of both exact and near duplicates. Next, we report on the performed manual analysis of the detected near duplicates for the Linux Kernel Documentation. We present both quantative and qualitative results of this analysis, demonstrate algorithm strengths and weaknesses, and discuss the benefits of duplicate management in software documents.