Radoslav Mavrevski
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Radoslav Mavrevski has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Ivan Trenchev
University of Library Studies and Information Technologies
4 shared publications Metodi Traykov
South-West University "Neofit Rilski" New Bulgarian University
4 shared publications- Metodi Traykov
New Bulgarian University
3 shared publications Iavn Trenchev
South-West University Blagoevgrad Bulgaria
2 shared publicationsIvan Trenchev
South-West University "Neofit Rilski" University of Library Studies and Information Technologies Sofia
2 shared publications- Metodi Traykov
Department of Electrical Engineering, Electronics and Automatics, Faculty of Engineering, University Center for Advanced Bioinformatics Research, South-West University “Neofit Rilski”, 66 Ivan Mihaylov Str., 2700 Blagoevgrad, Bulgaria
2 shared publications
Latest Publications
- 14 March 2025
- Published by Springer Nature
- p. 216-228
Innovative Approaches for the Mental Development and Education of Children with Autism Through Mixed Reality
- 14 March 2025
- Published by Springer Nature
- p. 216-228
Innovative Approaches for the Mental Development and Education of Children with Autism Through Mixed Reality
- 3 November 2022
- Published by Springer Nature
- p. 92-101
Bioinformatics: Model Selection and Scientific Visualization
- 3 November 2022
- Published by Springer Nature
- p. 92-101
Bioinformatics: Model Selection and Scientific Visualization
- Open Access
- 1 April 2020
- Published by Institute of Advanced Engineering and Science in International Journal of Electrical and Computer Engineering (IJECE)
- Vol. 10 (2) , 2054-2059
Finding the shortest path in a graph and its visualization using C# and WPF
The shortest path problem is a classic problem in mathematics and computer science with applications in Economics (sequential decision making, analysis of social networks, etc.). The presented work is an example of realizing and applying of Dijkstra's algorithm to find the shortest path between two vertices in a connected, undirected graph, which is often a solved problem at a time annual International Olympiad in Informatics. For this purpose, are used the technologies, .NET 4.0, Visual Studio 2010, and WPF for the graphical user interface. The implemented program allows drawing an undirected graph, visualizing the shortest path between two vertices and finding its value. This software is a valuable tool for the study of Dijkstra's algorithm and is a great pedagogic instrument. All figures of path visualization included in this paper are actual screenshots of our visualization program.
- 1 April 2020
- Published by Institute of Advanced Engineering and Science in International Journal of Electrical and Computer Engineering (IJECE)
- Vol. 10 (2) , 2054-2059
Open AccessFinding the shortest path in a graph and its visualization using C# and WPF
The shortest path problem is a classic problem in mathematics and computer science with applications in Economics (sequential decision making, analysis of social networks, etc.). The presented work is an example of realizing and applying of Dijkstra's algorithm to find the shortest path between two vertices in a connected, undirected graph, which is often a solved problem at a time annual International Olympiad in Informatics. For this purpose, are used the technologies, .NET 4.0, Visual Studio 2010, and WPF for the graphical user interface. The implemented program allows drawing an undirected graph, visualizing the shortest path between two vertices and finding its value. This software is a valuable tool for the study of Dijkstra's algorithm and is a great pedagogic instrument. All figures of path visualization included in this paper are actual screenshots of our visualization program.
- Open Access
- 1 October 2019
- Published by Institute of Advanced Engineering and Science in International Journal of Electrical and Computer Engineering (IJECE)
- Vol. 9 (5) , 4417-4422
Modeling of digital converter for GSM signals with MATLAB
In this study will simulate steady state of Digital Down Convertor (DDC) for GSM signal with a narrow frequency range. The MATLAB model that is described in this article simulates the work of the TIGC4016 Quad Digital Down Converter. This converter is used for digital mixing (down conversion) of signals, narrow band low-pass filtering and decimation. To implementation of the model, we use high sample-rate (69,333 MSPS) bandpass signal. The result contains low sample-rate (270.83 KSPS) baseband signal, thus facilitating the demodulation process.
- 1 October 2019
- Published by Institute of Advanced Engineering and Science in International Journal of Electrical and Computer Engineering (IJECE)
- Vol. 9 (5) , 4417-4422
Open AccessModeling of digital converter for GSM signals with MATLAB
In this study will simulate steady state of Digital Down Convertor (DDC) for GSM signal with a narrow frequency range. The MATLAB model that is described in this article simulates the work of the TIGC4016 Quad Digital Down Converter. This converter is used for digital mixing (down conversion) of signals, narrow band low-pass filtering and decimation. To implementation of the model, we use high sample-rate (69,333 MSPS) bandpass signal. The result contains low sample-rate (270.83 KSPS) baseband signal, thus facilitating the demodulation process.
- Open Access
- 14 June 2019
- Published by International Association of Online Engineering (IAOE) in International Journal of Online and Biomedical Engineering (iJOE)
- Vol. 15 (09) , 44-57
Multitasking in Embedded System Designs
It is common knowledge in Information Technology (IT) that an embedded system is based on microprocessor and is built to control a function or a range of functions. Although, it is not designed to be programmed by the end user in the same way that a PC is, it is designed to perform one particular task with choices and different options [1-5]. Multitasking is a method by which multiple tasks, also known as processes, share common processing resources, such as CPU. The main aim of this paper is analysis of the design of the embedded systems and a focus on mid-level abstractions for concurrent programs.
- 14 June 2019
- Published by International Association of Online Engineering (IAOE) in International Journal of Online and Biomedical Engineering (iJOE)
- Vol. 15 (09) , 44-57
Open AccessMultitasking in Embedded System Designs
It is common knowledge in Information Technology (IT) that an embedded system is based on microprocessor and is built to control a function or a range of functions. Although, it is not designed to be programmed by the end user in the same way that a PC is, it is designed to perform one particular task with choices and different options [1-5]. Multitasking is a method by which multiple tasks, also known as processes, share common processing resources, such as CPU. The main aim of this paper is analysis of the design of the embedded systems and a focus on mid-level abstractions for concurrent programs.
- Open Access
- 14 May 2019
- Published by International Association of Online Engineering (IAOE) in International Journal of Online and Biomedical Engineering (iJOE)
- Vol. 15 (08) , 120-134
Interactive Approach to Learning of Sorting Algorithms
Today we live in a society of high technologies, advanced information and com-munication systems in every field, including education. So, in modern education, teachers make full use of the possibilities of modern Information and Communi-cation Technologies (ICT). In this case, the attitude of the teachers towards the use of computers, to achieve the educational goals, is very important. To have the technologies sustained and significant effect, students in secondary and higher schools need to understand how to use them. The goal of this article is to help of students in secondary and higher schools to acquire enough practical program-ming skills and to learn the sorting algorithms, i.e. the article considers basic sort-ing algorithms. We developed and describe here software with name “Visual sorting” that shows visual, the execution of the basic sorting algorithms: Bubble sort; Selection sort; Insertion sort; Merge sort. Also, our software provides inter-active tracking of the performance (step by step) of different sorting algorithms.
- 14 May 2019
- Published by International Association of Online Engineering (IAOE) in International Journal of Online and Biomedical Engineering (iJOE)
- Vol. 15 (08) , 120-134
Open AccessInteractive Approach to Learning of Sorting Algorithms
Today we live in a society of high technologies, advanced information and com-munication systems in every field, including education. So, in modern education, teachers make full use of the possibilities of modern Information and Communi-cation Technologies (ICT). In this case, the attitude of the teachers towards the use of computers, to achieve the educational goals, is very important. To have the technologies sustained and significant effect, students in secondary and higher schools need to understand how to use them. The goal of this article is to help of students in secondary and higher schools to acquire enough practical program-ming skills and to learn the sorting algorithms, i.e. the article considers basic sort-ing algorithms. We developed and describe here software with name “Visual sorting” that shows visual, the execution of the basic sorting algorithms: Bubble sort; Selection sort; Insertion sort; Merge sort. Also, our software provides inter-active tracking of the performance (step by step) of different sorting algorithms.
- Open Access
- 1 January 2019
- Published by National Research Nuclear University MEPhI (Moscow Engineering Physics Institute) in Scientific Visualization
- Vol. 11 (1)
Visualization software for Hydrophobic-polar protein folding model
The simplest and most used models of protein folding is the Hydrophobic-Polar (HP) model. The HP model labeling the amino acids as Hydrophilic (H) or Polar/ydrophilic (P). The folding of amino acids sequence is configured as self-avoiding walks on the 2D or 3D lattice, where the optimal conformation has maximum number of contacts between H amino acids (H-H contacts) that are not adjustment in amino acid sequence. In this paper, we develop and present software for visualization of HP protein folding problem under the HP model on the 2D square lattice. For the development of HP folding visualization software, we used MS Visual Studio, .NET Framework 2.0 and C# language. If we have HP sequence and folding results for this sequence, obtained by optimization software as CPLEX or GUROBI, then using the 2D visualization software we can visualize the obtained results in square lattice. This visualization software is a valuable tool for the study of HP folding and is a great pedagogic instrument. All figures of HP folding included in this paper are actual screenshots of our visualization program.
- 1 January 2019
- Published by National Research Nuclear University MEPhI (Moscow Engineering Physics Institute) in Scientific Visualization
- Vol. 11 (1)
Open AccessVisualization software for Hydrophobic-polar protein folding model
The simplest and most used models of protein folding is the Hydrophobic-Polar (HP) model. The HP model labeling the amino acids as Hydrophilic (H) or Polar/ydrophilic (P). The folding of amino acids sequence is configured as self-avoiding walks on the 2D or 3D lattice, where the optimal conformation has maximum number of contacts between H amino acids (H-H contacts) that are not adjustment in amino acid sequence. In this paper, we develop and present software for visualization of HP protein folding problem under the HP model on the 2D square lattice. For the development of HP folding visualization software, we used MS Visual Studio, .NET Framework 2.0 and C# language. If we have HP sequence and folding results for this sequence, obtained by optimization software as CPLEX or GUROBI, then using the 2D visualization software we can visualize the obtained results in square lattice. This visualization software is a valuable tool for the study of HP folding and is a great pedagogic instrument. All figures of HP folding included in this paper are actual screenshots of our visualization program.
- Open Access
- 9 January 2018
- Published by EDP Sciences in ITM Web of Conferences
- Vol. 16, 02006
Performance comparison of model selection criteria by generated experimental data
In Bioinformatics and other areas the model selection is a process of choosing a model from set of candidate models of different classes which will provide the best balance between goodness of fitting of the data and complexity of the model. There are many criteria for evaluation of mathematical models for data fitting. The main objectives of this study are: (1) to fitting artificial experimental data with different models with increasing complexity; (2) to test whether two known criteria as Akaike’s information criterion (AIC) and Bayesian information criterion (BIC) can correctly identify the model, used to generate the artificial data and (3) to assess and compare empirically the performance of AIC and BIC.
- 9 January 2018
- Published by EDP Sciences in ITM Web of Conferences
- Vol. 16, 02006
Open AccessPerformance comparison of model selection criteria by generated experimental data
In Bioinformatics and other areas the model selection is a process of choosing a model from set of candidate models of different classes which will provide the best balance between goodness of fitting of the data and complexity of the model. There are many criteria for evaluation of mathematical models for data fitting. The main objectives of this study are: (1) to fitting artificial experimental data with different models with increasing complexity; (2) to test whether two known criteria as Akaike’s information criterion (AIC) and Bayesian information criterion (BIC) can correctly identify the model, used to generate the artificial data and (3) to assess and compare empirically the performance of AIC and BIC.
- 1 January 2018
- Vol. 20 (1) , 169-184
Curve fitting problem: torque-velocity relationship with polynomials and Boltzmann sigmoid functions
Purpose The aim of this study was to investigate the curve fitting and model selection problem of the torque-velocity relationship of elbow flexors and extensors in untrained females The second goal was to determine the optimal models in different function classes and the best, among the optimal ones Lastly, test the best models to predict the torque were tested Methods Using the polynomials (second - fourth degree) and Boltzmann sigmoid functions, and a different presentation of data points (averages, a point cloud, etc ), we determined the optimal models by both error criteria minimum residual sum of squares and minimum of the maximal absolute residue To assess the best models, we applied Akaike and Bayesian information criteria, Hausdorff distance and the minimum of the smallest maximal absolute residue and the predictive torque-velocity relationships of the best models with torque values, calculated beyond the experimental velocity interval Results The application of different error and model selection criteria showed that the best models in the majority of cases were polynomials of fourth degree, with some exceptions from second and third degree The criteria values for the optimal Boltzmann sigmoids were very close to those of the best polynomial models However, the predicted torque-velocity relationships had physiological behavior only in Boltzmann's sigmoid functions, and their parameters had a clear interpretation Conclusion The results obtained suggest that the Boltzmann sigmoid functions are suitable for modeling and predicting of the torque-velocity relationship of elbow flexors and extensors in untrained females, as compared to polynomials, and their curves are physiologically relevant.
- 1 January 2018
- Vol. 20 (1) , 169-184
Curve fitting problem: torque-velocity relationship with polynomials and Boltzmann sigmoid functions
Purpose The aim of this study was to investigate the curve fitting and model selection problem of the torque-velocity relationship of elbow flexors and extensors in untrained females The second goal was to determine the optimal models in different function classes and the best, among the optimal ones Lastly, test the best models to predict the torque were tested Methods Using the polynomials (second - fourth degree) and Boltzmann sigmoid functions, and a different presentation of data points (averages, a point cloud, etc ), we determined the optimal models by both error criteria minimum residual sum of squares and minimum of the maximal absolute residue To assess the best models, we applied Akaike and Bayesian information criteria, Hausdorff distance and the minimum of the smallest maximal absolute residue and the predictive torque-velocity relationships of the best models with torque values, calculated beyond the experimental velocity interval Results The application of different error and model selection criteria showed that the best models in the majority of cases were polynomials of fourth degree, with some exceptions from second and third degree The criteria values for the optimal Boltzmann sigmoids were very close to those of the best polynomial models However, the predicted torque-velocity relationships had physiological behavior only in Boltzmann's sigmoid functions, and their parameters had a clear interpretation Conclusion The results obtained suggest that the Boltzmann sigmoid functions are suitable for modeling and predicting of the torque-velocity relationship of elbow flexors and extensors in untrained females, as compared to polynomials, and their curves are physiologically relevant.