<abstract>
<title style='display:none'>Abstract</title>
In this article the concept of domination in signed graphs is examined from an alternate perspective and a new definition of the same is introduced. A vertex subset D of a signed graph S is a dominating set, if for each vertex v not in D there exists a vertex u ∈ D such that the sign of the edge uv is positive. The domination number γ (S) of S is the minimum cardinality among all the dominating sets of S. We obtain certain bounds of γ (S) and present a necessary and su cient condition for a dominating set to be a minimal dominating set. Further, we characterise the signed graphs having small and large values for domination number.
</abstract>

On domination in signed graphs

<abstract><title style='display:none'>Abstract</title>In 2020, due to the COVID − 19 pandemic, various epidemiological models appeared in major studies [16, 22, 21], which differ in terms of complexity, type, etc. In accordance with the hypothesis, a complex model is more accurate and gives more reliable results than a simpler one because it takes into consideration more parameters.In this paper we study three different epidemiological models: a SIR, a SEIR and a SEIR − type model. Our aim is to set up differential equation models, which rely on similar parameters, however, the systems of equation and number of parameters deviate from each other. A visualization dashboard is implemented through this study, and thus, we are able not only to study the models but also to make users understand the differences between the complexity of epidemiological models, and ultimately, to share a more specific overview about these that are defined by differential equations [24].In order to validate our results, we make a comparison between the three models and the empirical data from Northern Italy and Wuhan, based on the infectious cases of COVID-19. To validate our results, we calculate the values of the parameters using the Least Square optimization algorithm.</abstract>

Comparing epidemiological models with the help of visualization dashboards

<abstract><title style='display:none'>Abstract</title>Nowadays users leave numerous comments on different social networks, news portals, and forums. Some of the comments are toxic or abusive. Due to numbers of comments, it is unfeasible to manually moderate them, so most of the systems use some kind of automatic discovery of toxicity using machine learning models. In this work, we performed a systematic review of the state-of-the-art in toxic comment classification using machine learning methods. We extracted data from 31 selected primary relevant studies. First, we have investigated when and where the papers were published and their maturity level. In our analysis of every primary study we investigated: data set used, evaluation metric, used machine learning methods, classes of toxicity, and comment language. We finish our work with comprehensive list of gaps in current research and suggestions for future research themes related to online toxic comment classification problem.</abstract>

Machine learning methods for toxic comment classification: a systematic review

<abstract><title style='display:none'>Abstract</title> In this paper we present the elaborated computer strategies which we developed to a less-known dice game, Perudo. Moreover, the related analysis is presented, with the results of our machine players against human players. The main contribution of our paper is a strategy which involves bluffing. An important goal of this work is the remembrance to John v. Neumann; with our means we pay a tribute to the activity of the ”founding father”; on the occasion of his 110th birthday.</abstract>

Bluffing computer? Computer strategies to the Perudo game

<abstract><title style='display:none'>Abstract</title>This paper examines how ISO/IEC 9126-1 and ISO/IEC 25010 quality models can be applied to software testing products in industrial environment. We present a set of code smells for test systems written in TTCN-3 and their categorization according to quality model standards. We demonstrate our measurements on industrial and ETSI projects, and provide a method for estimating their effects on product risks in current projects.</abstract>

Test software quality issues and connections to international standards

<abstract><title style='display:none'>Abstract</title>A tournament is an orientation of a complete simple graph. The score of a vertex in a tournament is the outdegree of the vertex. In this paper, we obtain various results on the scores in tournaments.</abstract>

On scores in tournaments

<abstract>
<title style='display:none'>Abstract</title>
After recent improvements brought the incremental compilation of large industrial test suites down to a few seconds, the first semantic checking of a project became one of the longest-running processes. As multi-core systems are now the standard, we derived a parallelisation using software engineering laws to improve the performance of semantic checking.
Our measurements show that even an outdated laptop is fast enough for daily use. The performance improvements came without performance regressions, and we can’t expect additional massive benefits even from infinitely scaling Cloud resources.
Companies should utilise cheaper machines that still o er enough performance for longer. This approach can help businesses increase profits, reduce electronic waste and promote sustainability while maintaining high-quality software development practices.
</abstract>

Parallelising semantic checking in an IDE: A way toward improving profits and sustainability, while maintaining high-quality software development

<abstract>
<title style='display:none'>Abstract</title>
We propose a formal approach based on Bigraphical Reactive Systems (BRS) to provide a formal modeling of multi-viewpoint ontology alignment by composition systems’ structure using bigraphs their dynamic behaviors using bigraphical reaction rules. In the first phase of this approach, we address the modeling of the static structure the dynamic behavior of multi-viewpoint ontology alignment systems. We show how bigraphs enable the description of the di erent multi-view point ontology entities. Furthermore, we define a set of bigraphical reaction rules to model the dynamic nature of the alignment. We introduce composition strategies to describe multi-viewpoint ontology alignment systems’ behaviors. Then, we present a case study on which we illustrate the application of our proposed approach. Finally, we combine the logical reflection of Maude language the hierarchical structure of the BRS to provide an executable formal model for multi-viewpoint ontology alignment by composition systems.
</abstract>

Formal modeling of multi-viewpoint ontology alignment by mappings composition

<abstract>
<title style='display:none'>Abstract</title>
The graph realization problem seeks an answer to how and under what conditions a graph can be constructed if we know the degrees of its vertices. The problem was widely studied by many authors and in many ways, but there are still new ideas and solutions. In this sense, the paper presents the known necessary and su cient conditions for realization with the description in pseudocode of the corresponding algorithms. Two cases to solve the realization problem are treated: finding one solution, and finding all solutions. In this latter case a parallel approach is presented too, and how to exclude isomorphic graphs from solutions. We are also discussing algorithms using binary integer programming and flow networks.
In the case of a bigraphical list with equal out- and in-degree sequences a modified Edmonds–Karp algorithm is presented such that the resulting graph will be always symmetric without containing loops. This algorithm solves the problem of graph realization in the case of undirected graphs using flow networks.
</abstract>

Methods for the graph realization problem

<abstract>
<title style='display:none'>Abstract</title>
Colposcopy imaging is pivotal in cervical cancer diagnosis, a major health concern for women. The computational challenge lies in accurate lesion recognition. A significant hindrance for many existing machine learning solutions is the scarcity of comprehensive training datasets.
To reduce this gap, we present AnnoCerv: a comprehensive dataset tailored for feature-driven and image-based colposcopy analysis. Distinctively, AnnoCerv include detailed segmentations, expert-backed colposcopic annotations and Swede scores, and a wide image variety including acetic acid, iodine, and green-filtered captures. This rich dataset supports the training of models for classifying and segmenting low-grade squamous intraepithelial lesions, detecting high-grade lesions, aiding colposcopy-guided biopsies, and predicting Swede scores – a crucial metric for medical assessments and treatment strategies.
To further assist researchers, our release includes code that demonstrates data handling and processing and exemplifies a simple feature extraction and classification technique.
</abstract>

AnnoCerv: A new dataset for feature-driven and image-based automated colposcopy analysis

<abstract>
<title style='display:none'>Abstract</title>
The paper examines the potential of artificial intelligence (AI) in parsing text and conducting sentiment analysis to identify early markers of mental health and neurodegenerative disorders. Through the analysis of textual data, we investigate whether AI can provide a noninvasive, continuous, and objective complement to traditional diagnostic practices.
<italic>Background</italic>: the early detection of mental health (such as depression, anxiety, psychotic disorders, Alzheimer’s disease and dementia) and neurodegenerative disorders (like Parkinson’s disease) remains a critical challenge in clinical practice. Traditional diagnostic methods rely on clinical evaluations that may be subjective and episodic. Recent advancements in AI and natural language processing (NLP) have opened new avenues for precognitive health assessments, suggesting that variations in language and expressed sentiments in written text can serve as potential biomarkers for these conditions.
<italic>Materials and Methods</italic>: the research used a dataset comprising various forms of textual data, including anonymized social media interactions, transcripts from patient interviews, and electronic health records. NLP algorithms were deployed to parse the text, and machine learning models were trained to identify language patterns and sentiment changes. The study also incorporated a sentiment analysis to gauge emotional expression, a key component of mental health diagnostics.
<italic>Results</italic>: the AI models were able to identify language use patterns and sentiment shifts that correlated with clinically validated instances of mental health symptoms and neurodegenerative conditions. Notably, the models detected an increased use of negative a ect words, a higher frequency of first-person singular pronouns, and a decrease in future tense in individuals with depression. For neurode-generative conditions, there was a notable decline in language complexity and semantic coherence over time.
<italic>Conclusions</italic>: the implemented pipeline of AI-parsed text and sentiment analysis appears to be a promising tool for the early detection and ongoing monitoring of mental health and neurodegenerative disorders. However, these methods are supplementary and cannot replace the nuanced clinical evaluation process. Future research must refine the AI algorithms to account for linguistic diversity and context, while also addressing ethical considerations regarding data use and privacy. The integration of AI tools in clinical settings necessitates a multidisciplinary approach, ensuring that technological advancements align with patient-centered care and ethical standards.
</abstract>

Precognition of mental health and neurogenerative disorders using AI-parsed text and sentiment analysis

<abstract>
<title style='display:none'>Abstract</title>
The analysis of networks involves several crucial parameters. In this paper, we consider the closeness parameter, which is based on the total distance between every pair of vertices. Initially, we delve into a discussion about the applicability of the closeness parameter to Mycielski graphs. Our findings are categorized based on the underlying graph’s diameter. The formula for calculating the closeness of a Mycielski graph is derived for graphs with a diameter of less than or equal to 4. Furthermore, we establish a sharp lower bound for the closeness of a Mycielski graph when the diameter of the underlying graph is greater than 4. To achieve this, the closeness of the Mycielski transformation of a path graph plays an important role. Additionally, leveraging the obtained results, we examine the closeness of a special planar construction composed of path and cycle graphs, as well as its Mycielski transformation.
</abstract>

Computing closeness for some graphs

<abstract><title style='display:none'>Abstract</title>In this paper we introduce a new, high-quality, dataset of images containing fruits. We also present the results of some numerical experiment for training a neural network to detect fruits. We discuss the reason why we chose to use fruits in this project by proposing a few applications that could use such classifier.</abstract>

Fruit recognition from images using deep learning

<abstract><title style='display:none'>Abstract</title>Several hundreds of thousand humans are diagnosed with brain cancer every year, and the majority dies within the next two years. The chances of survival could be easiest improved by early diagnosis. This is why there is a strong need for reliable algorithms that can detect the presence of gliomas in their early stage. While an automatic tumor detection algorithm can support a mass screening system, the precise segmentation of the tumor can assist medical staff at therapy planning and patient monitoring. This paper presents a random forest based procedure trained to segment gliomas in multispectral volumetric MRI records. Beside the four observed features, the proposed solution uses 100 further features extracted via morphological operations and Gabor wavelet filtering. A neighborhood-based post-processing was designed to regularize and improve the output of the classifier. The proposed algorithm was trained and tested separately with the 54 low-grade and 220 high-grade tumor volumes of the MICCAI BRATS 2016 training database. For both data sets, the achieved accuracy is characterized by an overall mean Dice score &gt; 83%, sensitivity &gt; 85%, and specificity &gt; 98%. The proposed method is likely to detect all gliomas larger than 10 mL.</abstract>

Low and high grade glioma segmentation in multispectral brain MRI data

<abstract><title style='display:none'>Abstract</title> For a graph G with vertex set V(G) = {v1, v2, . . . , vn}, the extended double cover G* is a bipartite graph with bipartition (X, Y), X = {x1, x2, . . . , xn} and Y = {y1, y2, . . . , yn}, where two vertices xi and yj are adjacent if and only if i = j or vi adjacent to vj in G. The double graph D[G] of G is a graph obtained by taking two copies of G and joining each vertex in one copy with the neighbors of corresponding vertex in another copy. In this paper we study energy and Laplacian energy of the graphs G* and D[G], L-spectra of Gk* the k-th iterated extended double cover of G. We obtain a formula for the number of spanning trees of G*. We also obtain some new families of equienergetic and L-equienergetic graphs.</abstract>

Eötvös Loránd University Faculty of Informatics Budapest

Energy, Laplacian energy of double graphs and new families of equienergetic graphs

<abstract><title style='display:none'>Abstract</title>Behavioural biometrics provides an extra layer of security for user authentication mechanisms. Among behavioural biometrics, mouse dynamics provides a non-intrusive layer of security. In this paper we propose a novel convolutional neural network for extracting the features from the time series of users’ mouse movements. The effect of two preprocessing methods on the performance of the proposed architecture were evaluated. Different training types of the model, namely transfer learning and training from scratch, were investigated. Results for both authentication and identification systems are reported. The Balabit public data set was used for performance evaluation, however for transfer learning we used the DFL data set. Comprehensive experimental evaluations suggest that our model performed better than other deep learning models. In addition, transfer learning contributed to the better performance of both identification and authentication systems.</abstract>

Mouse dynamics based user recognition using deep learning

<abstract><title style='display:none'>Abstract</title>Time-series are ordered sequences of discrete-time data. Due to their temporal dimension, anomaly detection techniques used in time-series have to take into consideration time correlations and other time-related particularities. Generally, in order to evaluate the quality of an anomaly detection technique, the confusion matrix and its derived metrics such as precision and recall are used. These metrics, however, do not take this temporal dimension into consideration. In this paper, we propose three metrics that can be used to evaluate the quality of a classification, while accounting for the temporal dimension found in time-series data.</abstract>

Evaluation metrics for anomaly detection algorithms in time-series

Open Access License

Referee Form

Instructions for Authors

Peer Review Process

Publication Ethics

Copyright Agreement

Acta Universitatis Sapientiae, Informatica

The Journal of Sapientia Hungarian University of Transylvania

Acta Universitatis Sapientiae Informatica publishes peer-reviewed, high-quality original papers and surveys in English, in all areas of Computer Science and allied fields. The papers must be...

Impact Factor

Five Year Impact Factor

MNiSW

Acta Universitatis Sapientiae Informatica publishes peer-reviewed, high-quality original papers and surveys in English, in all areas of Computer Science and...

Acta Universitatis Sapientiae, Informatica

The Journal of Sapientia Hungarian University of Transylvania

Todos los volúmenes y ediciones en esta revista