Mironela Pirnau

Dr. Mironela Pirnau


Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 February 2024 in Axioms
Verified
Journal Article
Open access
PDF file
CBCecilia Bolea
Cecilia Bolea
MPMironela Pirnau
Mironela Pirnau
Silviu Ioan BejinariuSilviu Ioan Bejinariu
Silviu Ioan Bejinariu
VAVasile Apopei
Vasile Apopei
Daniela GifuDaniela Gifu
Daniela Gifu
HTHoria-Nicolai Teodorescu
Horia-Nicolai Teodorescu
The article extends the theoretical and applicative analysis of Zipf’s law. We are concerned with a set of properties of Zipf’s law that derive directly from the power law expression and from the discrete nature of the objects to which the law is applied, when the objects are words, lemmas, and the like. We also search for variations of Zipf’s law that can help explain the noisy results empirically reported in the literature and the departures of the empirically obtained nonlinear graph from the theoretical linear one, with the variants analyzed differing from Mandelbrot and lognormal distributions. A problem of interest that we deal with is that of mixtures of populations obeying Zipf’s law. The last problem has relevance in the analysis of texts with words with various etymologies. Computational aspects are also addressed.

31 January 2024 in Electronics
Verified
Journal Article
Open access
PDF file
MPMironela Pirnau
Mironela Pirnau
MBMihai Alexandru Botezatu
Mihai Alexandru Botezatu
IPIustin Priescu
Iustin Priescu
HAHosszu Alexandra
Hosszu Alexandra
Alexandru TăbușcăAlexandru Tăbușcă
Alexandru Tăbușcă
Ionica OncioiuIonica Oncioiu
Ionica Oncioiu
Researchers from different fields have studied the effects of the COVID-19 pandemic and published their results in peer-reviewed journals indexed in international databases such as Web of Science (WoS), Scopus, PubMed. Focusing on efficient methods for navigating the extensive literature on COVID-19 pandemic research, our study conducts a content analysis of the top 1000 cited papers in WoS that delve into the subject by using elements of natural language processing (NLP). Knowing that in WoS, a scientific paper is described by the group Paper = {Abstract, Keyword, Title}; we obtained via NLP methods the word dictionaries with their frequencies of use and the word cloud for the 100 most used words, and we investigated if there is a degree of similarity between the titles of the papers and their abstracts, respectively. Using the Python packages NLTK, TextBlob, VADER, we computed sentiment scores for paper titles and abstracts, analyzed the results, and then, using Azure Machine Learning-Sentiment analysis, extended the range of comparison of sentiment scores. Our proposed analysis method can be applied to any research topic or theme from papers, articles, or projects in various fields of specialization to create a minimal dictionary of terms based on frequency of use, with visual representation by word cloud. Complementing the content analysis in our research with sentiment and similarity analysis highlights the different or similar treatment of the topics addressed in the research, as well as the opinions and feelings conveyed by the authors in relation to the researched issue.

18 April 2026 in Electronics
Verified
Journal Article
Open access
PDF file
MPMironela Pirnau
Mironela Pirnau
IPIustin Priescu
Iustin Priescu
MBMihai-Alexandru Botezatu
Mihai-Alexandru Botezatu
CPCatalina Mihaela Priescu
Catalina Mihaela Priescu
DJDaniela Joita
Daniela Joita
This paper investigates the feasibility of using Large Language Models (LLMs) for the structural analysis of flow-based network data. This analysis is carried out in the presence of a structural difference between the multidimensional numerical space of IoT features and the symbolic space in which LLMs operate. The primary objective was the development of a formal framework that enables the controlled transformation of numerical data into linguistically analyzable semantic representations, without resorting to classification or machine learning mechanisms. We propose the Semantic Flow Encoding (SFE) mechanism, a deterministic method for robust discretization and behavioral abstraction that converts the numerical characteristics of Internet of Things (IoT) flows into structural semantic descriptions using the Canadian Institute for Cybersecurity Internet of Things Device Identification and Anomaly Detection (CIC IoT-DIAD) 2024 dataset. Through formal informational measures, it is demonstrated that the existence of an intrinsic structural difference between benign and DDoS traffic in the analyzed dataset. In the validation stage, we evaluated whether these informational differences are reflected at the level of linguistic abstraction through controlled inference experiments in IBM WatsonX. The present paper suggests that LLMs may support semantic auditing of distributional structure when guided by a formal encoding layer. In this manner, a reproducible framework for integrating numerical security data into language-model-based analysis is suggested.

30 August 2024
Verified
Book Chapter
Closed access
PDF file
MPMironela Pirnau
Mironela Pirnau
IPIustin Priescu
Iustin Priescu
DJDaniela Joita
Daniela Joita
CPCatalina Mihaela Priescu
Catalina Mihaela Priescu

3 July 2026 in Preprints.org
Verified
Preprint
Open access
PDF file
Daniela GifuDaniela Gifu
Daniela Gifu
MPMironela Pirnau
Mironela Pirnau
CBCecilia Bolea
Cecilia Bolea
Silviu Ioan BejinariuSilviu Ioan Bejinariu
Silviu Ioan Bejinariu
VAVasile Apopei
Vasile Apopei
There is an intimate theoretical relationship between Zipf’s law and the expected number of hapax legomena, dis-legomena, and n-legomena in general, as established in recent papers. The relationship was confirmed by the empirical analysis for very large texts. However, the known theoretical relationship was established under the assumption of very large vocabularies and very large texts, where the dimension of the vocabularies used does not limit the maximal rank value and thus the hapax legomena, or the dis-legomena etc. (n-legomena for small n values). In addition, the theoretical results were established under the hypothesis that the probabilities of the words are context-independent, which is not satisfied for small vocabularies and small texts, as typically used in fake news and in other classes of small texts over the Internet. We provide a theoretical analysis under rectified hypotheses, prove several results under relaxed hypotheses, and show examples of practical results.