<abstract xmlns="http://www.w3.org/1999/xhtml">The paper presents some of our recent results in the field of computer emulation for supporting and enhancing the educational processes. The ATmega 328P micro-controller emulator has been developed as a set of emuStudio emulation platform extension modules (plug-ins). The platform is used at the Department of Computers and Informatics as a studying and teaching support tool. Within the Assembler course, currently, the Intel 8080 architecture and language is briefly described as a preliminary preparation material for the study of Intel x86 architecture, and the Intel 8080 emuStudio emulator module is used here. The aim of this work is to explore the possibility to enrich the course by introducing a more up-to-date and relevant technology and the ATmega is the heart of Arduino – a popular hardware and software prototyping platform. We consider the options to make the process of studying the assembly language principles more attractive for students and using the ATmega AVR architecture, which is broadly deployed in embedded systems, seems to be one of them.</abstract>

Development of ATmega 328P micro-controller emulator for educational purposes

<abstract xmlns="http://www.w3.org/1999/xhtml">The Multiplayer Online Battle Arena (MOBA) game is a popular type for its competition between players. Due to the high complexity, balance is the most important factor to secure a fair competitive environment. The common way to achieve dynamic data balance is by constant updates. The traditional method of finding unbalanced factors is mostly based on professional tournaments, a small minority of all the games and not real time. We develop an evaluation system for the DOTA2 based on big data with clustering analysis, neural networks, and a small-scale data collection as a sample. We then provide an ideal matching system based on the Elo rating system and an evaluation system to encourage players to try more different heroes for a diversified game environment and more data supply, which makes for a virtuous circle in the evaluation system.</abstract>

Improved balance in multiplayer online battle arena games

<abstract xmlns="http://www.w3.org/1999/xhtml">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 xmlns="http://www.w3.org/1999/xhtml">This paper initiates a study on a new coloring regime which sets conditions in respect of the degrees deg(<italic>v</italic>) and deg(u) where, <italic>v</italic>, u ∈ V(G) and vu ∈ E(G). This new coloring regime is called, <italic>”degree tolerant coloring”</italic>. The degree tolerant chromatic number is defined. A number of interesting introductory results are presented. Amongst others, new Nordhaus-Gaddum type bounds are provided.</abstract>

Degree tolerant coloring of graph

<abstract xmlns="http://www.w3.org/1999/xhtml">In this paper we will be taking a look at type inference and its uses for binding-time analysis, dynamic typing and better error messages. We will propose a new binding-time analysis algorithm ℬ, which is a modification of an already existing algorithm by Gomard [4], and discuss the speed difference.</abstract>

Enhanced type inference for binding-time analysis

<abstract xmlns="http://www.w3.org/1999/xhtml">The degree set of a k-partite graph is the set of distinct degrees of its vertices. We prove that every set of non-negative integers is a degree set of some k-partite graph.</abstract>

On degree sets in k-partite graphs

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

Sapientia Hungarian University of Transylvania

Faculty of Mathematics and Computer Science

Comparing epidemiological models with the help of visualization dashboards

<abstract xmlns="http://www.w3.org/1999/xhtml">The concept of the statistical complexity is studied to characterize the classical kicked top model which plays important role in the qbit systems and the chaotic properties of the entanglement. This allow us to understand this driven dynamical system by the probability distribution in phase space to make distinguish among the regular, random and structural complexity on finite simulation. We present the dependence of the kicked top and kicked rotor model through the strength excitation in the framework of statistical complexity.</abstract>

Statistical complexity of the kicked top model considering chaos

<abstract xmlns="http://www.w3.org/1999/xhtml">Suppressed fuzzy c-means clustering was proposed as an attempt to combine the better properties of hard and fuzzy c-means clustering, namely the quicker convergence of the former and the finer partition quality of the latter. In the meantime, it became much more than that. Its competitive behavior was revealed, based on which it received two generalization schemes. It was found a close relative of the so-called fuzzy c-means algorithm with generalized improved partition, which could improve its popularity due to the existence of an objective function it optimizes. Using certain suppression rules, it was found more accurate and efficient than the conventional fuzzy c-means in several, mostly image processing applications. This paper reviews the most relevant extensions and generalizations added to the theory of fuzzy c-means clustering models with suppressed partitions, and summarizes the practical advances these algorithms can offer.</abstract>

University Research, Innovation and Service Center

A review on suppressed fuzzy c-means clustering models

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. 