Facultatea de Matematică şi Informatică
http://dspace.usm.md:8080/xmlui/handle/123456789/12
2019-03-24T13:00:30ZTHE CONVEXITY IN THE COMPLEX OF MULTI-ARY RELATIONS
http://dspace.usm.md:8080/xmlui/handle/123456789/1975
THE CONVEXITY IN THE COMPLEX OF MULTI-ARY RELATIONS
Braguţă, Galina; Cataranciuc, Sergiu
For a complex of multi-ary relations [12] it is defined the concept of (k,m)-chain which is a generalization of the concept of chain known from the graph theory. Using (k,m)- chains it is introduced the concept of the distance function and it is proved that this function generate a convexity in the complex of multi-ary relations. It is operating with the concepts of convexity and convex hull, axiomatically defined by F.Levi [29] and we describe the iterative procedure to construct a convex hull for a subset of elements from the complex of multi-ary relations. [ABSTRACT FROM AUTHOR]
2015-01-01T00:00:00ZPARALLEL ALGORITHM TO FIND BAYES-NASH SOLUTION
http://dspace.usm.md:8080/xmlui/handle/123456789/1909
PARALLEL ALGORITHM TO FIND BAYES-NASH SOLUTION
Hancu, Boris; Gladei, Anatolie
We propose to use the new methodology for solving the com-
plete and perfect information bimatrix game. To solve the ga-
mes of these type we construct the incomplete and imperfect
information game generated by the informational extended stra-
tegies. Then we construct associated Bayesian game with non-
informational extended strategies. For a HPC cluster computing
system with shared and distributed memory, we constuct a paral-
lel algorithm for computing Bayes-Nash solutions to the bimatrix
informational extended games. The complexity and time perfor-
mance analysis of the algorithm are provided.
2018-01-01T00:00:00ZON NONTRIVIAL COVERS AND PARTITIONS OF GRAPHS BY CONVEX SETS
http://dspace.usm.md:8080/xmlui/handle/123456789/1908
ON NONTRIVIAL COVERS AND PARTITIONS OF GRAPHS BY CONVEX SETS
Buzatu, Radu; Cataranciuc, Sergiu
In this paper we prove that it is NP-complete to decide whet-
her a graph can be partitioned into nontrivial convex sets. We
show that it can be verified in polynomial time whether a graph
can be covered by nontrivial convex sets. Also, we propose a re-
cursive formula that establishes the maximum nontrivial convex
cover number of a tree.
2018-01-01T00:00:00ZSECURITATEA REȚELELOR INFORMATICE
http://dspace.usm.md:8080/xmlui/handle/123456789/1819
SECURITATEA REȚELELOR INFORMATICE
Bragaru, Tudor; Malcoci, Viorel; Galaicu, Valeriu
n condiţiile utilizării în masă a reţelelor informatice şi desfăşurării diverselor activităţi profesionale mediate de
reţele şi dispozitivele mobile conectate, conştientizarea şi contracararea riscurilor devine foarte importantă atât pentru mediul de afaceri, mediul social, cât şi pentru cel personal, privat. Lucrarea prezintă o privire de sinteză asupra cerinţelor de securitate, metodelor de atac/ameninţărilor, riscurilo-r, vulnerabilităţilor şi tehnicilor de atenuare şi prevenire a
riscurilor informatice preponderent pentru reţele corporative.; În terms of mass use of computer networks and the deployment of various professional activities mediated by networks
and connected mobile devices, risk awareness and counseling becomes very important, both for the business environment,
the social environment and for the private and private ones. The paper presents a summary of security requirements,attack/threats, risks, vulnerabilities, and mitigation and prevention techniques predominantly for corporate networks.
2017-01-01T00:00:00Z