Oleg S. Kushnir
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Oleg S. Kushnir has a total of 105 co-authors. Here are the top co-authors by number of shared publications:
- Roman Y. Shopa
National Centre for Nuclear Research
8 shared publications - Vasyl Yo. Stadnyk
Physics Faculty, Ivan Franko National University of Lviv 1 , Lviv 79005
8 shared publications - Andriy Franiv
Physics Faculty, Ivan Franko National University of Lviv, Kyrylo and Mephodiy str. 8a, Lviv, 79005, Ukraine
5 shared publications L. O. Lokot
Lviv National University
5 shared publications- P. A. Shchepanskyi
Ivan Franko National University of Lviv
5 shared publications - Ruslan S. Brezvin
Ivan Franko National University of Lviv
5 shared publications
Latest Publications
- Open Access
- 17 May 2026
- Published by Lviv Polytechnic National University in Computer systems and network
- Vol. 19, 43-63
Analysis of Repetitiveness Parameters for Natural Language and Random Texts
This article highlights a new approach to the analysis of text documents by clarifying the quantitative patterns of their repetitiveness. For this aim, software was developed for analyzing the repetitiveness characteristic $v(t)$ and a number of calculation modes were suggested. The behavior of the $v(t)$ function for natural language texts was clarified in all the calculation modes and the resources of this approach for identifying ‘excessive’ repetitions of fragments in text documents were clarified. It was found that the function $v(t)$ allows for reliable detection of such repetitions, and the sensitivity of the method exceeds the capabilities of any other method known from the literature. The differences in the Аналіз параметрів повторюваності для природномовних і рандомних текстів 63 repetitiveness $v(t)$ and its aggregate parameters $v_0$ and $\Delta v$ are clarified for natural language texts, program code texts, and Simon and Markov random texts generated by the simplest natural language models. The relevance of our study is related to the problem of recognizing texts written in natural or artificial languages, which reveal syntax and semantics, from uninformative random sequences of linguistic signs as symbolic time series constructed by stochastic mechanisms. It is established that the repetitiveness $v(t)$ in the program codes shows saturation, and the corresponding value,$v_0 \sim$ 0.6, for the main calculation mode ‘symbols’ exceeds significantly the repetitiveness in natural languages. The repetitiveness for the random Yule–Simon growth model differs significantly from the repetitiveness in natural language texts, while the question of the existence of a saturation $v(t)$ region for the Simon texts remains open. The repetitiveness function $v(t)$ for the random texts built on Markov chains shows a tendency to increase. With increasing order N of the Markov texts, the average $v_0$ values found in the closing region of these texts reach the limiting values, which are noticeably higher than the saturated repetitiveness in the natural language texts. Finally, the repetitiveness $v_0$ in these texts correlates with the parameter of average clustering of words, which is associated with the scale and strength of short-range correlations. Therefore, a higher repetitiveness in a text accompanied by some other features can serve as indirect evidence of its semantic load and a presence of syntax.- 17 May 2026
- Published by Lviv Polytechnic National University in Computer systems and network
- Vol. 19, 43-63
Open AccessAnalysis of Repetitiveness Parameters for Natural Language and Random Texts
This article highlights a new approach to the analysis of text documents by clarifying the quantitative patterns of their repetitiveness. For this aim, software was developed for analyzing the repetitiveness characteristic $v(t)$ and a number of calculation modes were suggested. The behavior of the $v(t)$ function for natural language texts was clarified in all the calculation modes and the resources of this approach for identifying ‘excessive’ repetitions of fragments in text documents were clarified. It was found that the function $v(t)$ allows for reliable detection of such repetitions, and the sensitivity of the method exceeds the capabilities of any other method known from the literature. The differences in the Аналіз параметрів повторюваності для природномовних і рандомних текстів 63 repetitiveness $v(t)$ and its aggregate parameters $v_0$ and $\Delta v$ are clarified for natural language texts, program code texts, and Simon and Markov random texts generated by the simplest natural language models. The relevance of our study is related to the problem of recognizing texts written in natural or artificial languages, which reveal syntax and semantics, from uninformative random sequences of linguistic signs as symbolic time series constructed by stochastic mechanisms. It is established that the repetitiveness $v(t)$ in the program codes shows saturation, and the corresponding value,$v_0 \sim$ 0.6, for the main calculation mode ‘symbols’ exceeds significantly the repetitiveness in natural languages. The repetitiveness for the random Yule–Simon growth model differs significantly from the repetitiveness in natural language texts, while the question of the existence of a saturation $v(t)$ region for the Simon texts remains open. The repetitiveness function $v(t)$ for the random texts built on Markov chains shows a tendency to increase. With increasing order N of the Markov texts, the average $v_0$ values found in the closing region of these texts reach the limiting values, which are noticeably higher than the saturated repetitiveness in the natural language texts. Finally, the repetitiveness $v_0$ in these texts correlates with the parameter of average clustering of words, which is associated with the scale and strength of short-range correlations. Therefore, a higher repetitiveness in a text accompanied by some other features can serve as indirect evidence of its semantic load and a presence of syntax. - 14 April 2026
- Published by Institute of Physical Optics in Ukrainian Journal of Physical Optics
- Vol. 27 (2) , 02134-02144
EFFECT OF YTTRIUM DOPING ON THE ELECTRONIC ENERGY STRUCTURE AND OPTICAL PROPERTIES OF GaAs
- 14 April 2026
- Published by Institute of Physical Optics in Ukrainian Journal of Physical Optics
- Vol. 27 (2) , 02134-02144
EFFECT OF YTTRIUM DOPING ON THE ELECTRONIC ENERGY STRUCTURE AND OPTICAL PROPERTIES OF GaAs
- Open Access
- 1 January 2025
- Published by Lviv Polytechnic National University in Ukrainian Journal of Information Technology
- Vol. 7 (2) , 82-92
STUDIES OF REPETITIVENESS FOR THE SIMPLEST RANDOM NATURAL LANGUAGE MODELS
The article addresses a currently important problem of natural language processing, the development of methods for assessing repetitiveness in textual documents and the empirical clarification of the resources of these methods for analyzing the presence of semantic load in texts. So far, the approaches based on the laws of statistical linguistics such as Zipf’s, Pareto’s and Heaps’ laws have been mainly used for this aim, as well as the analysis of word-clustering phenomena and long-term correlations of word tokens. We have developed software for quantitative analysis of the repetitiveness in texts, using the Ukkonen’s suffix-tree algorithm. We suggest analyzing the averaged repetitiveness parameter v0 and the corresponding standard deviation Δv. It is empirically proven that the algorithm implemented with our software exhibits an approximately linear time complexity, O (LlogL) (with L denoting the symbolic-series length), which corresponds to theoretical predictions. The texts analyzed for the repetitiveness have benn natural texts in English and a number of other alphabetic (non-hieroglyphic) languages, as well as random Miller’s monkey texts and natural texts randomized gradually at the linguistic levels of symbols, words and sentences. It is confirmed that, outside the initial section of natural texts, where the repetition function fluctuates, this function exhibits a saturation phenomenon, with a saturated value v0 ≈ 0.5. The texts based on the Miller’s random model are studied in detail. It is found that the behavior of the repetitiveness function and the parameters v0 and Δv of these texts are influenced primarily by a size of the alphabet and a preset distribution of relative frequencies of the alphabet symbols. It is proved that the average repetition v0 for these texts is related to the Shannon information entropy in its simplest representation. We have ascertained that the repetitiveness for the “bag of words” model correlates with the parameter of the average semantic load of a text. Finally, we suggest employing the repetition parameters v0 and Δv for recognizing semantically filled natural texts against semantically empty, stochastic symbolic time series.
- 1 January 2025
- Published by Lviv Polytechnic National University in Ukrainian Journal of Information Technology
- Vol. 7 (2) , 82-92
Open AccessSTUDIES OF REPETITIVENESS FOR THE SIMPLEST RANDOM NATURAL LANGUAGE MODELS
The article addresses a currently important problem of natural language processing, the development of methods for assessing repetitiveness in textual documents and the empirical clarification of the resources of these methods for analyzing the presence of semantic load in texts. So far, the approaches based on the laws of statistical linguistics such as Zipf’s, Pareto’s and Heaps’ laws have been mainly used for this aim, as well as the analysis of word-clustering phenomena and long-term correlations of word tokens. We have developed software for quantitative analysis of the repetitiveness in texts, using the Ukkonen’s suffix-tree algorithm. We suggest analyzing the averaged repetitiveness parameter v0 and the corresponding standard deviation Δv. It is empirically proven that the algorithm implemented with our software exhibits an approximately linear time complexity, O (LlogL) (with L denoting the symbolic-series length), which corresponds to theoretical predictions. The texts analyzed for the repetitiveness have benn natural texts in English and a number of other alphabetic (non-hieroglyphic) languages, as well as random Miller’s monkey texts and natural texts randomized gradually at the linguistic levels of symbols, words and sentences. It is confirmed that, outside the initial section of natural texts, where the repetition function fluctuates, this function exhibits a saturation phenomenon, with a saturated value v0 ≈ 0.5. The texts based on the Miller’s random model are studied in detail. It is found that the behavior of the repetitiveness function and the parameters v0 and Δv of these texts are influenced primarily by a size of the alphabet and a preset distribution of relative frequencies of the alphabet symbols. It is proved that the average repetition v0 for these texts is related to the Shannon information entropy in its simplest representation. We have ascertained that the repetitiveness for the “bag of words” model correlates with the parameter of the average semantic load of a text. Finally, we suggest employing the repetition parameters v0 and Δv for recognizing semantically filled natural texts against semantically empty, stochastic symbolic time series.
- 9 December 2024
- Published by Lviv Polytechnic National University in Computational Problems of Electrical Engineering
- Vol. 14 (1) , 1-5
Launching mvps for it startups: python/django/postgresql in location-tracking applications
In this study, we develop and evaluate performance of a location-tracking application built using a Python/Django/PostgreSQL stack. Through rigorous experimentation and its analysis, we scrutinize the efficiency of WebSocket connections in facilitating real-time commun¬ication and data retrieval. By comparing our findings with the previous research results available on an ASP.NET stack, we contribute to understanding of the technologies for stack selection and the strategies used for optimization of the location-tracking applications. Our results offer valuable guidance for the developers striving to create robust and scalable solutions in this burgeoning domain.
- 9 December 2024
- Published by Lviv Polytechnic National University in Computational Problems of Electrical Engineering
- Vol. 14 (1) , 1-5
Launching mvps for it startups: python/django/postgresql in location-tracking applications
In this study, we develop and evaluate performance of a location-tracking application built using a Python/Django/PostgreSQL stack. Through rigorous experimentation and its analysis, we scrutinize the efficiency of WebSocket connections in facilitating real-time commun¬ication and data retrieval. By comparing our findings with the previous research results available on an ASP.NET stack, we contribute to understanding of the technologies for stack selection and the strategies used for optimization of the location-tracking applications. Our results offer valuable guidance for the developers striving to create robust and scalable solutions in this burgeoning domain.
- 1 December 2023
- Published by Yukhnovskii Institute for Condensed Matter Physics in Condensed Matter Physics
- Vol. 26 (4)
Nonlinear background corrections to dielectric permittivity of ferroics and multiferroics
- 1 December 2023
- Published by Yukhnovskii Institute for Condensed Matter Physics in Condensed Matter Physics
- Vol. 26 (4)
Nonlinear background corrections to dielectric permittivity of ferroics and multiferroics
- 1 September 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 44-50
Conciseness of Ukrainian, Russian and English: Application to Translation Studies
We study the amount of information contained in symbolic sequences, using a single-character entropy associated with the frequencies of characters that comprise the alphabet of a coding system. This enables comparing degrees of laconism inherent to the Ukrainian, Russian and English languages. The approach of information entropy is applied to examine explicitation hypothesis known from Translation Studies.
- 1 September 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 44-50
Conciseness of Ukrainian, Russian and English: Application to Translation Studies
We study the amount of information contained in symbolic sequences, using a single-character entropy associated with the frequencies of characters that comprise the alphabet of a coding system. This enables comparing degrees of laconism inherent to the Ukrainian, Russian and English languages. The approach of information entropy is applied to examine explicitation hypothesis known from Translation Studies.
- 1 September 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 316-320
Temperature and Pressure Changes of the Refractive Properties of LiNH4SO4 Crystal in $\beta$ ModificationWe have obtained a crystal of LiNH 4 SO 4 in $\mathbf{\beta}$ modification of good optical quality. Birefringence properties of the crystal under the action of uniaxial pressures in the wavelengths range 300–800 nm at room temperature are investigated. The character of the influence of uniaxial pressures applied along mutually perpendicular directions is defined. Studies of the temperature dependences of birefringence for 500 nm wavelength have shown that the second-order phase transition takes place at temperature 461 K, and that birefringence curves for $X$ and $Z$ directions cross at 489 K. The temperature dependence of the angle between the optical axes was obtained experimentally and compared with the calculated from the refractive indices.- 1 September 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 316-320
Temperature and Pressure Changes of the Refractive Properties of LiNH4SO4 Crystal in $\beta$ ModificationWe have obtained a crystal of LiNH 4 SO 4 in $\mathbf{\beta}$ modification of good optical quality. Birefringence properties of the crystal under the action of uniaxial pressures in the wavelengths range 300–800 nm at room temperature are investigated. The character of the influence of uniaxial pressures applied along mutually perpendicular directions is defined. Studies of the temperature dependences of birefringence for 500 nm wavelength have shown that the second-order phase transition takes place at temperature 461 K, and that birefringence curves for $X$ and $Z$ directions cross at 489 K. The temperature dependence of the angle between the optical axes was obtained experimentally and compared with the calculated from the refractive indices.- 1 September 2019
- Published by Elsevier in Optical Materials
- Vol. 95
Relationships among optical and structural characteristics of ABSO4 crystals
- 1 September 2019
- Published by Elsevier in Optical Materials
- Vol. 95
Relationships among optical and structural characteristics of ABSO4 crystals
- 1 January 2018
- Published by Institute of Physical Optics in Ukrainian Journal of Physical Optics
- Vol. 19 (3) , 141-149
Structure and refractive properties of LiNaSO4 single crystals
- 1 January 2018
- Published by Institute of Physical Optics in Ukrainian Journal of Physical Optics
- Vol. 19 (3) , 141-149
Structure and refractive properties of LiNaSO4 single crystals