<abstract xmlns="http://www.w3.org/1999/xhtml">Current climate models are complex computer programs that are typically iterated time-step by time-step to predict the next set of values of the climate-related variables. Since these iterative methods are necessarily computed only for a fixed number of iterations, they are unable to answer the natural question whether there is a limit to the rise of global temperature. In order to answer that question we propose to combine climate models with software verification techniques that can find invariant conditions for the set of program variables. In particular, we apply the constraint database approach to software verification to find that the rise in global temperature is bounded according to the common Java Climate Model that implements the Wigley/Raper Upwelling-Diffusion Energy Balance Model climate model.</abstract>

Department of Computer Science & Engineering

Estimating the maximum rise in temperature according to climate models using abstract interpretation

<abstract xmlns="http://www.w3.org/1999/xhtml">A path decomposition of a graph is a collection of its edge disjoint paths whose union is G. The pendant number Πp is the minimum number of end vertices of paths in a path decomposition of G. In this paper, we determine the pendant number of corona products and rooted products of paths and cycles and obtain some bounds for the pendant number for some specific derived graphs. Further, for any natural number n, the existence of a connected graph with pendant number n has also been established.</abstract>

A study on the pendant number of graph products

<abstract xmlns="http://www.w3.org/1999/xhtml">To reconstruct the points in three dimensional space, we need at least two images. In this paper we compared two different methods: the first uses only two images, the second one uses three. During the research we measured how camera resolution, camera angles and camera distances influence the number of reconstructed points and the dispersion of them. The paper presents that using the two-view method, we can reconstruct significantly more points than using the other one, but the dispersion of points is smaller if we use the three-view method. Taking into consideration the different camera settings, we can say that both the two- and three-view method behaves the same, and the best parameters are also the same for both methods.</abstract>

Comparing two- and three-view computer vision

<abstract xmlns="http://www.w3.org/1999/xhtml">A set of vertices in a graph is a dominating set if every vertex not in the set is adjacent to at least one vertex in the set. A dominating structure is a subgraph induced by the dominating set. Connected domination is a type of domination where the dominating structure is connected. Clique domination is a type of domination in graphs where the dominating structure is a complete subgraph. The clique domination number of a graph G denoted by γk(G) is the minimum cardinality among all the clique dominating sets of G. We present few properties of graphs admitting dominating cliques along with bounds on clique domination number in terms of order and size of the graph. A necessary and sufficient condition for the existence of dominating clique in strong product of graphs is presented. A forbidden subgraph condition necessary to imply the existence of a connected dominating set of size four also is found.</abstract>

New results on connected dominating structures in graphs

<abstract xmlns="http://www.w3.org/1999/xhtml">According to WHO estimates, 400 million people suffer from diabetes, and this number is likely to double by year 2030. Unfortunately, diabetes can have severe complications like glaucoma or retinopathy, which both can cause blindness. The main goal of our research is to provide an automated procedure that can detect retinopathy-related lesions of the retina from fundus images. This paper focuses on the segmentation of so-called white lesions of the retina that include hard and soft exudates. The established procedure consists of three main phases. The preprocessing step compensates the various luminosity patterns found in retinal images, using background and foreground pixel extraction and a data normalization operator similar to Z-transform. This is followed by a modified SLIC algorithm that provides homogeneous superpixels in the image. The final step is an ANN-based classification of pixels using fifteen features extracted from the neighborhood of the pixels taken from the equalized images and from the properties of the superpixel where the pixel belongs. The proposed methodology was tested using high-resolution fundus images originating from the IDRiD database. Pixelwise accuracy is characterized by a 54% Dice score in average, but the presence of exudates is detected with 94% precision.</abstract>

Sapientia Hungarian University of Transylvania

Automatic detection of hard and soft exudates from retinal fundus images

<abstract xmlns="http://www.w3.org/1999/xhtml">In this short survey and case study we want to present our research experience through the project developed by our team, that involves the building of a LEGO MINDSTORMS EV3 robotic arm and tracked robot car which mimics the motion of the human arm and legs. We used 3 interconnected LEGO MINDSTORMS EV3 bricks to reach the desired degrees of freedom. Using a Kinect sensor, the system detects the motion of the human user’s arm and creates the skeletal image of the arm. Coordinate geometry and different approximation methods are used to calculate the rotation angles between the bones connecting the joints. In our project the key is inverse kinematics, whitch makes use of the kinematics equations to determine the joint rotation parameters that provide a desired position for each of the robot’s end-effectors – arms and legs (wheels). The combined motion of the LEGO MINDSTORMS EV3 motors results in a complete robotic forward or backward motion and arm movement which is a perfect mimic of the human arm movement.</abstract>

Gesture-Driven LEGO robots

<abstract xmlns="http://www.w3.org/1999/xhtml">A vertex v of a given graph is said to be in a rainbow neighbourhood of G if every color class of G consists of at least one vertex from the closed neighbourhood N[v]. A maximal proper coloring of a graph G is a J-coloring if and only if every vertex of G belongs to a rainbow neighbourhood of G. In general all graphs need not have a J-coloring, even though they admit a chromatic coloring. In this paper, we characterise graphs which admit a J-coloring. We also discuss some preliminary results in respect of certain graph operations which admit a J-coloring under certain conditions.</abstract>

J-coloring of graph operations

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. 