Faculty of Computer Science and Engineering
Permanent URI for this communityhttps://repository.ukim.mk/handle/20.500.12188/5
The Faculty of Computer Science and Engineering (FCSE) within UKIM is the largest and most prestigious faculty in the field of computer science and technologies in Macedonia, and among the largest
faculties in that field in the region.
The FCSE teaching staff consists of 50 professors and 30 associates. These include many “best in field” personnel, such as the most referenced scientists in Macedonia and the most influential professors in the ICT industry in the Republic of Macedonia.
Browse
414 results
Search Results
- Some of the metrics are blocked by yourconsent settings
Item type:Publication, Benchmarking Sentence Encoders in Associating Indicators With Sustainable Development Goals and Targets(Institute of Electrical and Electronics Engineers (IEEE), 2025); ; The United Nations’ 2030 Agenda for Sustainable Development balances the economic, environmental, and social dimension of sustainable development in 17 Sustainable Development Goals (SDGs), monitored through a well-defined set of targets and global indicators. Although essential for humanity’s future well-being, this monitoring is still challenging due to the variable quality of the statistical data of global indicators compiled at the national level and the diversity of indicators used to monitor sustainable development at the subnational level. Associating indicators other than the global ones with the SDGs/targets may help not only to expand the statistical data, but to better align the efforts toward sustainable development taken at (sub)national level. This article presents a model-agnostic framework for associating such indicators with the SDGs and targets by comparing their textual descriptions in a common representation space. While removing the dependence on the quantity and quality of the statistical data of the indicators, it provides human experts with data-driven suggestions on the complex and not always obvious associations between the indicators and the SDGs/targets. A comprehensive domain-specific benchmarking of a diverse sentence encoder portfolio was performed first, followed by fine-tuning of the best ones on a newly created dataset. Five sets of indicators used at the (sub)national level of governance (around 800 indicators in total) were used for the evaluation. Finally, the influence of 40 factors on the results was analyzed using explainable artificial intelligence (xAI) methods. The results show that 1) certain sentence encoders are better suited to solving the task than others (potentially due to their diverse pre-training datasets), 2) the fine-tuning not only improves the predictive performance over the baselines but also reduces the sensitivity to changes in indicator description length (performance drops even by up to 17% for baseline m... - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Evaluating Trustworthiness in AI: Risks, Metrics, and Applications Across Industries(MDPI AG, 2025-07-04) - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Multiword Discourse Markers Across Languages: A Linguistic and Computational Perspective(Wiley, 2025-04-22) - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Pressure Related Ocular Parameters in Caucasian Patients with Primary Open-Angle Glaucoma(Savvy Science Publisher, 2021-06-02); - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Corrigendum on “On a general decay stability of stochastic Cohen-Grossberg neural networks with time-varying delays” [Applied Mathematics and Computation 219 (2012) 2289–2302](Elsevier BV, 2013-01); Janković, SvetlanaIn Lemma 2, as well as in Theorems 1 and 3 which proofs are based on Lemma 2, it is necessary to suppose for δ< 1 that functions a and b from C ([t 0,∞); R n) are increasing and decreasing, respectively, and that γ∗= γ (t 0). The proof of Lemma 2 in the paper holds only for δ⩾ 1 and must be similarly completed for δ< 1: since y (t)< kz (t) on [t 0, t 1) and y (t 1)= kz (t 1), k= const> 1, it follows straightforwardly that‖ y (t 1)‖< kz (t 1) δ γ∗ and D+(y (t 1)− kz (t 1))< 0, which completes the proof. - Some of the metrics are blocked by yourconsent settings
Item type:Publication, On some stability problems of impulsive stochastic Cohen–Grossberg neural networks with mixed time delays(Elsevier BV, 2014-07); Janković, SvetlanaThis paper covers the topic of both the pth moment ( ) and almost sure stability of impulsive stochastic Cohen–Grossberg neural networks with mixed time delays. We partially use a known result on exponential stability of impulsive stochastic functional differential systems, based on the Razumikhin type technique, and extend it to the case of stochastic neural networks using the Lyapunov function method and a Gronwall type inequality. Additionally, we consider the stability with respect to a general decay function which includes exponential, but also more general lower rate decay functions as the polynomial and the logarithmic ones. This fact gives us the opportunity to study general decay almost sure stability, even when the exponential one cannot be discussed. Suitable examples which support the theory are also presented. - Some of the metrics are blocked by yourconsent settings
Item type:Publication, AI Agents in Finance and Fintech: A Scientific Review of Agent-Based Systems, Applications, and Future Horizons(Tech Science Press, 2026) - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Election candidates fuzzy multi-agent recommender system(SAGE Publications, 2013-01); Dukovska, Snezana CerepnalkovskaIn this paper we propose fuzzy multi-agent recommender system for candidates in state elections that is intended to serve to voters as a filter for excess of information on Internet and other media on their election candidates. The recommender system we propose should guide voters to the candidates that suit their preferences, and help them make a choice of a representative by accessing relevant information. For this system we have enrolled computing with words (CW) methodology which main concepts are graduation (linguistic variables) and granulation (a fuzzy set of points drawn together by similarity). Our proposed recommender system is appropriate for application in developing countries, because of its simplicity and its low cost. It can also serve as foundation for future development and sophistication, taking into consideration both technical and political aspects. - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Automatic Recognition of Emotions from Speech(Digital Information Research Foundation, 2019-12-01); This paper presents an approach to recognition of human emotions from speech. Seven emotions are recognized: anger, fear, sadness, happiness, boredom, disgust and neutral. The approach is applied on a speech database, which consists of simulated and annotated utterances. First, numerical features are extracted from the sound database by using audio feature extractor. Next, the extracted features are standardized. Then, feature selection methods are used to select the most relevant features. Finally, a classification model is trained to recognize the emotions. Three classification algorithms are tested, with SVM yielding the highest accuracy of 89% and 82% using the 10 fold cross-validation and Leave-OneSpeaker-Out techniques, respectively. “Sadness” is the emotion which is recognized with highest accuracy. - Some of the metrics are blocked by yourconsent settings
Item type:Publication, P–427 Maternal and fetal thrombophilia mutations and the ANXA5 M2 haplotype are more prevalent in first trimester miscarriages of euploid embryos(Oxford University Press (OUP), 2021-07-01)