Verica Bakeva

Prof. Verica Bakeva

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
18 August 2025 in Physical Review E
Verified
Journal Article
Open access
PJPetar Jolakoski
Petar Jolakoski
LBLasko Basnarkov
Lasko Basnarkov
Ljupco KocarevLjupco Kocarev
Ljupco Kocarev
APAleksandra Popovska-Mitrovikj
Aleksandra Popovska-Mitrovikj
VBVerica Bakeva
Verica Bakeva
Trifce SandevTrifce Sandev
Trifce Sandev
We study a generalized Langevin equation framework that incorporates stochastic resetting of a truncation power-law memory kernel. The inclusion of stochastic resetting enables the emergence of resonance phenomena even in parameter regimes where conventional settings (without resetting) do not exhibit such behavior. Specifically, we explore the response of the system to an external field under three scenarios: (i) a free particle, (ii) a particle in a harmonic potential, and (iii) the effect of truncation in the memory kernel. In each case, the primary focus is on understanding how the resetting mechanism interacts with standard parameters to induce stochastic resonance. In addition, we explore the effect of resetting on the dielectric loss.

16 April 2024 in Applied Mathematics and Computation
Verified
Journal Article
Closed access
Stefan MirchevskiStefan Mirchevski
Stefan Mirchevski
VBVerica Bakeva
Verica Bakeva

1 January 2015
Verified
Book Chapter
Closed access
PDF file
VBVerica Bakeva
Verica Bakeva
VDVesna Dimitrova
Vesna Dimitrova
MKMile Kostadinoski
Mile Kostadinoski

19 May 2023 in IEEE Access
Verified
Journal Article
Open access
APAleksandra Popovska-Mitrovikj
Aleksandra Popovska-Mitrovikj
DMDaniela Mechkaroska
Daniela Mechkaroska
VBVerica Bakeva
Verica Bakeva
The concept of cryptcoding arises from the need to obtain secure and accurate transmission. This has led to an intensive development of coding theory and cryptography as scientific fields dealing with these problems. To ensure efficient and secure data transmission at the same time, the concept of cryptcoding is being developed, in which the coding and encryption processes are merged into one process. Cryptcodes provide correction of a certain number of errors in the transmitted message and data confidentiality, using only one algorithm. In this paper, we consider cryptcodes based on quasigroups, proposed elsewhere. Also, Burst-Cut-Decoding, Burst-4-Sets-Cut-Decoding, FastB-Cut-Decoding and FastB-4-Sets-Cut-Decoding algorithms for transmission of messages through burst channels have been defined and investigated elsewhere. Here, we investigate performances of these algorithms for transmission of images through burst channels. We made experiments for different channel parameters and compared the results obtained with different decoding algorithms of these cryptcodes. In all experiments, we considered the bit-error probability and the differences between the transmitted and decoded images. From the results presented in this paper we can conclude that Fast algorithms improve the performances of these cryptcodes for transmission of images over a burst channel. The best results are obtained by FastB-4-Sets-Cut-Decoding algorithm. In addition, to enhance the quality of the decoded images, we examined the application of a filter for visual correction of unsuccessfully decoded pixels using the surrounding pixels. The considered cryptcodes and presented results can be useful for application in satellite digital video broadcasting (DVB-S) coding and encryption schemes.

8 July 2023
Verified
Book Chapter
Closed access
PDF file
SMSmile Markovski
Smile Markovski
VBVerica Bakeva
Verica Bakeva
VDVesna Dimitrova
Vesna Dimitrova
Aleksandra MilevaAleksandra Mileva
Aleksandra Mileva
APAleksandra Popovska-Mitrovikj
Aleksandra Popovska-Mitrovikj
Hristina Mihajloska TrpcheskaHristina Mihajloska Trpcheska
Hristina Mihajloska Trpcheska

1 January 2026 in Journal of Applied Mathematics
Verified
Journal Article
Open access
Stefan MirchevskiStefan Mirchevski
Stefan Mirchevski
APAleksandra Popovska-Mitrovikj
Aleksandra Popovska-Mitrovikj
VBVerica Bakeva
Verica Bakeva
In this paper, a new generalized cost function construction for a single‐server multiphase queueing system with a Poisson input stream, hypoexponential‐ k customer service time, and FIFO discipline is presented. A proposed relationship between service parameters in k phases is based on a geometric progression with rate α , 0 < α < 1. In this way, an approach with a constantly decreasing speed of servicing customers through the phases is introduced. Several auxiliary lemmas about the performance measures of the proposed model are proved. Then, an explicit form of the cost function is obtained in such a construction, expressed as a function of the traffic intensity ρ . Also, an analysis of the cost function is made, and a theorem for the existence and uniqueness of the absolute minimum of the cost function is proved. Furthermore, a sensitivity analysis of the optimal solutions with different changes in the cost values, input stream parameter, and progression rate α is additionally made.