<abstract xmlns="http://www.w3.org/1999/xhtml"> In this paper authors propose algorithms for constructing so called automaton COM(L) and prove that this automaton coincides, up to re-denoting states, with Conway’s universal automaton. We give some algorithms of constructing this automaton and consider some examples.</abstract>

Some more algorithms for Conway’s universal automaton

<abstract xmlns="http://www.w3.org/1999/xhtml"> H. G. Landau has characterized those integer-sequences S = (s1, s2, . . . , sn) which can arise as score-vectors in an ordinary round-robin tournament among n contestants [17]. If s1 ≤ s2 ≤ · · · ≤ sn, the relevant conditions are expressed simply by the inequalities:</abstract>

On linear programming duality and Landau’s characterization of tournament

<abstract xmlns="http://www.w3.org/1999/xhtml"> In health care databases, there are tireless and antagonistic interests between data mining research and privacy preservation, the more you try to hide sensitive private information, the less valuable it is for analysis. In this paper, we give an outlook on data anonymization problems by case studies. We give a summary on the state-of-the-art health care data anonymization issues including legal environment and expectations, the most common attacking strategies on privacy, and the proposed metrics for evaluating usefulness and privacy preservation for anonymization. Finally, we summarize the strength and the shortcomings of different approaches and techniques from the literature based on these evaluations.</abstract>

Survey on privacy preserving data mining techniques in health care databases

<abstract xmlns="http://www.w3.org/1999/xhtml"> 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 xmlns="http://www.w3.org/1999/xhtml"> Several behavioral game theory models aim at explaining why “smarter“ people win more frequently in simultaneous zero-sum games, a phanomenon, which is not explained by the Nash equilibrium concept. We use a computational model and a numerical simulation based on Markov chains to describe player behavior and predict payoffs.</abstract>

A computational model of outguessing in two-player non-cooperative games

<abstract xmlns="http://www.w3.org/1999/xhtml"> 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 xmlns="http://www.w3.org/1999/xhtml"> It is an empirical fact that coloring the nodes of a graph can be used to speed up clique search algorithms. In directed graphs transitive subtournaments can play the role of cliques. In order to speed up algorithms to locate large transitive tournaments we propose a scheme for coloring the nodes of a directed graph. The main result of the paper is that in practically interesting situations determining the optimal number of colors in the proposed coloring is an NP-hard problem. A possible conclusion to draw from this result is that for practical transitive tournament search algorithms we have to develop approximate greedy coloring algorithms.</abstract>

Coloring the nodes of a directed graph

<abstract xmlns="http://www.w3.org/1999/xhtml"> Let H be an r-uniform hypergraph with r ≥ 2 and let α(H) be its vertex independence number. In the paper bounds of α(H) are given for different uniform hypergraphs: if H has no isolated vertex, then in terms of the degrees, and for triangle-free linear H in terms of the order and average degree.</abstract>

University of Kashmir Department of Mathematics Srinagar, India

Nanjing University Department of Mathematics Nanjing, China

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

On vertex independence number of uniform hypergraphs

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. 