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

Most typical data mining techniques are developed based on training the batch data which makes the task of mining the data stream represent a significant challenge. On the other hand, providing a mechanism to perform data mining operations without revealing the patient’s identity has increasing importance in the data mining field. In this work, a classification model with differential privacy is proposed for mining the medical data stream using Adaptive Random Forest (ARF). The experimental results of applying the proposed model on four medical datasets show that ARF mostly has a more stable performance over the other six techniques.
</abstract>

Differential privacy based classification model for mining medical data stream using adaptive random forest

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

This paper furthers the study on the confluence number of a graph. In particular results for certain derivative graphs such as the line graph of trees, cactus graphs, linear Jaco graphs and novel graph operations are reported.
</abstract>

Visiting Faculty at CHRIST (Deemed to be a University)

Confluence number of certain derivative graphs

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

Data stream processing has been gaining attention in the past decade. Apache Flink is an open-source distributed stream processing engine that is able to process a large amount of data in real time with low latency. Computations are distributed among a cluster of nodes. Currently, provisioning the appropriate amount of cloud resources must be done manually ahead of time. A dynamically varying workload may exceed the capacity of the cluster, or leave resources underutilized. In our paper, we describe an architecture that enables the automatic scaling of Flink jobs on Kubernetes based on custom metrics, and describe a simple scaling policy. We also measure the e ects of state size and target parallelism on the duration of the scaling operation, which must be considered when designing an autoscaling policy, so that the Flink job respects a Service Level Agreement.
</abstract>

ELTE Eötvös Loránd University Budapest

Towards autoscaling of Apache Flink jobs

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

The development of computer-generated ecosystem simulations are becoming more common due to the greater computational capabilities of machines. Because natural ecosystems are very complex, simplifications are required for implementation. This simulation environment o er a global view of the system and generate a lot of data to process and analyse, which are difficult or impossible to do in nature. 3D simulations, besides of the scientific advantages in experiments, can be used for presentation, educational and entertainment purposes too. In our simulated framework (Animal Farm) we have implemented a few basic animal behaviors and mechanics to observe in 3D. All animals are controlled by an individual logic model, which determines the next action of the animal, based on their needs and surrounding environment.
</abstract>

Animal Farm—a complex artificial life 3D framework

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

Let S = (G, σ) be a signed graph of order n and size m and let x1, x2, ..., xn be the eigenvalues of S. The energy of S is defined as <inline-formula>
<alternatives>
<inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_ausi-2021-0005_eq_001.png"></inline-graphic>
<math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mi>ɛ</mi><mrow><mo>(</mo><mi>S</mi><mo>)</mo></mrow><mo>=</mo><munderover><mo>∑</mo><mrow><mi>j</mi><mo>=</mo><mn>1</mn></mrow><mi>n</mi></munderover><mrow><mrow><mo>|</mo> <mrow><msub><mrow><mi>x</mi></mrow><mi>j</mi></msub></mrow> <mo>|</mo></mrow></mrow></mrow></math>
<tex-math>\varepsilon \left( S \right) = \sum\limits_{j = 1}^n {\left| {{x_j}} \right|}</tex-math>
</alternatives>
</inline-formula>. A connected signed graph is said to be bicyclic if m=n + 1. In this paper, we determine the bicyclic signed graphs with first 20 minimal energies for all n ≥ 30 and with first 16 minimal energies for all 17 ≤ n ≤ 29.
</abstract>

On ordering of minimal energies in bicyclic signed graphs

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

The fractional chromatic number of a graph is defined as the optimum of a rather unwieldy linear program. (Setting up the program requires generating all independent sets of the given graph.) Using combinatorial arguments we construct a more manageable linear program whose optimum value provides an upper estimate for the fractional chromatic number. In order to assess the feasibility of the proposal and in order to check the accuracy of the estimates we carry out numerical experiments.
</abstract>

Estimating the fractional chromatic number of a graph

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

This paper is based on research results achieved by a collaboration between Ericsson Hungary Ltd. and the Large Scale Testing Research Lab of Eötvös Loránd University, Budapest. We present design issues and empirical observations on extending an existing industrial toolset with a new intermediate language1.
Context: The industry partner’s toolset is using C/C++ as an intermediate language, providing good execution performance, but “somewhat long” build times, o ering a sub-optimal experience for users.
Objective: In cooperation with our industry partner our task was to perform an experiment with Java as a different intermediate language and evaluate results, to see if this could improve build times.
Method: We extended the mentioned toolset to use Java as an intermediate language.
Results: Our measurements show that using Java as an intermediate language improves build times significantly. We also found that, while the runtime performance of C/C++ is better in some situations, Java, at least in our testing scenarios, can be a viable alternative to improve developer productivity.
Our contribution is unique in the sense that both ways of building and execution can use the same source code as input, written in the same language, generate intermediate codes with the same high-level structure, compile into executables that are configured using the same files, run on the same machine, show the same behaviour and generate the same logs.
Conclusions: We created an alternative build pipeline that might enhance the productivity of our industry partner’s test developers by reducing the length of builds during their daily work.
</abstract>

Improving productivity in large scale testing at the compiler level by changing the intermediate language from C++ to Java

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

The integration of Wireless Sensor Networks (WSN) and cloud computing brings several advantages. However, one of the main problems with the existing cloud solutions is the latency involved in accessing, storing, and processing data. This limits the use of cloud computing for various types of applications (for instance, patient health monitoring) that require real-time access and processing of data. To address the latency problem, we proposed a fog-assisted Link Aware and Energy E cient Protocol for Wireless Body Area Networks (Fog-LAEEBA). The proposed solution is based on the already developed state-of-the-art protocol called LAEEBA. We implement, test, evaluate and compare the results of Fog-LAEEBA in terms of stability period, end-to-end delay, throughput, residual energy, and path-loss. For the stability period all nodes in the LAEEBA protocol die after 7445 rounds, while in our case the last node dies after 9000 rounds. For the same number of rounds, the end-to-end delay is 2 seconds for LAEEBA and 1.25 seconds for Fog-LAEEBA. In terms of throughput, our proposed solution increases the number of packets received by the sink node from 1.5 packets to 1.8 packets. The residual energy of the nodes in Fog-LAEEBA is also less than the LAEEBA protocol. Finally, our proposed solution improves the path loss by 24 percent.
</abstract>

CECOS University of IT and Emerging Sciences

Fog-LAEEBA: Fog-assisted Link aware and energy efficient protocol for wireless body area network

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. 