<abstract xmlns="http://www.w3.org/1999/xhtml">

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 xmlns="http://www.w3.org/1999/xhtml">

For a graph G with n vertices, average distance µ(G) is the ratio of sum of the lengths of the shortest paths between all pairs of vertices to the number of edges in a complete graph on n vertices. In this paper, we introduce average distance colouring and find the average distance colouring number of certain classes of graphs.
</abstract>

Average distance colouring of graphs

<abstract xmlns="http://www.w3.org/1999/xhtml">

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>

Dokuz Eylul University Maritime Faculty Buca Izmir

Computing closeness for some graphs

<abstract xmlns="http://www.w3.org/1999/xhtml">

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 xmlns="http://www.w3.org/1999/xhtml">

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>

Sapientia Hungarian University of Transylvania

Methods for the graph realization problem

<abstract xmlns="http://www.w3.org/1999/xhtml">

The aim of this paper is to obtain some relationships between eccentricity-based topological indices as the eccentric connectivity, connective eccentricity, total eccentricity, second Zagreb eccentricity, first Zagreb eccentricity connectivity, first eccentricity connectivity and first Zagreb eccentricity connectivity of a simple connected graph.
</abstract>

The eccentricity-based topological indices

<abstract xmlns="http://www.w3.org/1999/xhtml">

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>

University of Medicine and Pharmacy Iaşi

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

<abstract xmlns="http://www.w3.org/1999/xhtml">

As technology advances, most people use social media sites like Twitter, Facebook, and Flickr to share information and communicate with others. The volume of free-text data is growing daily due to the widespread use of these social media platforms. These platforms contain a substantial amount of unstructured information. Patient opinions expressed on social media platforms play a significant role in healthcare improvement and impact health-related policymaking. In this research, we introduce a machine learning approach for the optimal identification of healthcare-related features. This approach is based on a novel synthetic method. Additionally, we employ an entropy-based technique to classify free-text comments from hospital data into positive, negative or neutral. The experimental results and evaluations show 85%, 82.3%, 78.2% and 87% accuracy between ratings of health care. We observed that there is a minor association between our technique, expert opinion and patient interviews. Through the use of machine learning techniques, we achieve an accuracy level that suggests we are capable of providing an accurate and reasonable assessment of the ideal healthcare center for a patient. Our proposed novel framework predicts the healthcare experience at hospitals based on patient reviews posted on social media. This innovative approach outperforms traditional methods, such as surveys and expert opinions.
</abstract>

University Institute of Information Technology

Enhancing healthcare services recommendation through sentiment analysis

<abstract xmlns="http://www.w3.org/1999/xhtml">

With the development and expansion of the Internet of Things, computing at the edge is becoming increasingly important, especially for applications where real-time response is important. In this paper, we made a systematic review of the literature on analytics at the edge. We extracted data from 40 selected primary relevant studies from the complete set of 419 papers retrieved from scientific databases. In our analysis of the full text of every primary study we investigated: temporal distribution of primary studies, publication types, domain and application areas of the primary papers, used machine learning and deep learning methods. We also elaborated on the main themes of the primary studies and recommended some possible interesting future research possibilities.
</abstract>

Applications of edge analytics: a systematic review

<abstract xmlns="http://www.w3.org/1999/xhtml">

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>

Department of Electrical Engineering and Information Technology

George Emil Palade, University of Medicine, Pharmacy, Science, and Technology of Targu Mures

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

<abstract xmlns="http://www.w3.org/1999/xhtml">

The so-called fuzzy-possibilistic c-means (FPCM) algorithm was introduced as an early mixed-partition method aiming to eliminate some adverse effects present in the behavior of the fuzzy c-means (FCM) and the possibilistic c-means (PCM) algorithms. A great advantage of FPCM was the low number of its parameters, as it eliminated the possibilistic penalty terms used by PCM. Unfortunately, FPCM in its original formulation also has a weak point: the strength of the possibilistic term is in inverse proportion with the number of clustered data items, which makes FPCM act like FCM when clustering large sets of data. This paper proposes a modification of the FPCM algorithm by introducing an extra coefficient into the possibilistic term that allows us to control the strength of the possibilistic effect within the mixture model. The modified clustering model will be referred to as generalized FPCM, since a certain value of the extra parameter reduces it to the original FPCM, or in other words, FPCM is a special case of the proposed algorithm. The proposed method is evaluated using noise-free and noisy data as well.
</abstract>

Doctoral School of Applied Mathematics and Applied Informatics

A generalized fuzzy-possibilistic c-means clustering algorithm

AHEAD OF PRINT

Volume 15 (2023): Issue 2 (December 2023)

Volume 15 (2023): Issue 1 (August 2023)

Volume 14 (2022): Issue 2 (December 2022)

Volume 14 (2022): Issue 1 (August 2022)

Volume 13 (2021): Issue 2 (December 2021)

Volume 13 (2021): Issue 1 (June 2021)

Volume 12 (2020): Issue 2 (December 2020)

Volume 12 (2020): Issue 1 (July 2020)

Volume 11 (2019): Issue 2 (December 2019)

Volume 11 (2019): Issue 1 (August 2019)

Volume 10 (2018): Issue 2 (December 2018)

Volume 10 (2018): Issue 1 (August 2018)

Volume 9 (2017): Issue 2 (December 2017)

Volume 9 (2017): Issue 1 (July 2017)

Volume 8 (2016): Issue 2 (December 2016)

Volume 8 (2016): Issue 1 (June 2016)

Volume 7 (2015): Issue 2 (December 2015)

Volume 7 (2015): Issue 1 (June 2015)

Volume 6 (2014): Issue 2 (December 2014)

Volume 6 (2014): Issue 1 (June 2014)

Volume 5 (2013): Issue 2 (December 2013)

Volume 5 (2013): Issue 1 (July 2013)

Acta Universitatis Sapientiae, Informatica

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 self-contained, including the purpose of the research, the basic definitions, the antecedents of the research, the presentation of the state-of-the-art and novel contributions. The articles must contain sufficient references to give the reader a broad view of the studied subject.  Articles must follow the technical requirements described in the Information for Authors. Please note, that if an article fails to do so, it will be rejected without peer-review.  The corresponding author is responsible for obtaining the permission of coauthors and of the authorities or institutions, if needed, for publication, the Editorial Board is disclaiming any responsibility.  The papers have to be prepared carefully, and must include the relevant keywords. References should be listed alphabetically based on the Instruction for Authors given at the address www.acta.sapientia.ro/acta-info/informatica-main.htm.  Why subscribe and read  The journal publishes papers in all fields of Computer Science, so it can satisfy a lot of interests; the online version is very attractive with the hyperlinks.  Why submit  The issues appear regularly 2 times per year, the waiting time is not too long, the online version contains hyperlinks.  Rejection Rate   56%   Archiving  Sciendo archives the contents of this journal in Portico - digital long-term preservation service of scholarly books, journals and collections.  Plagiarism Policy  The editorial board is participating in a growing community of Similarity Check System's users in order to ensure that the content published is original and trustworthy. Similarity Check is a medium that allows for comprehensive manuscripts screening, aimed to eliminate plagiarism and provide a high standard and quality peer-review process.  Article Processing Charge (APC)  The journal does not have article processing charges (APCs) nor article submission charges. 