Este un fapt bine cunoscut că Teoria Grafurilor se regăsește într-o mulțime de aplicații în diverse sfere ale activității umane: construcții și sociologie, electrotehnică și geografie, etc. Implementarea tehnologiilor ...

At the moment it is obvious that the systems need more and more autonomy, and here is the point where the need for intelligent agents first appears. By the time agents were needed in many application, there have appeared ...

Wick’s theorem for chronological products or its generalized version are used for the calculation of the scattering matrix in each order of perturbation theory. The procedure is reduced to calculation of the vacuum expectation ...

The aim of our work is revitalizing the folkloric texts of Republic of Moldova from the second half of the 20th century, furthermore actualizing the folkloric texts that are in Cyrillic writing for their future use in ...

Cloud computing means the convergence of two major trends in today’s IT: efficiency - where the power of modern computers is more efficiently used through a high scaling of hardware, software and business agility resources ...

A tiling W of the sphere with disks is called k-isohedral with respect to a discrete isometry group G if G maps the tiling W onto itself and the disks of W fall into k transitivity classes under the action of the group G.

In this work necessary and sufficient conditions that isotope of n-IP-loop (n ∈ N∗, n > 3) is also n-IP-loop are proved. Definition of n-ary Moufang loop is given, example of such loop is constructed.

Given a permutational wreath product sequence of cyclic groups of order 2 we research a commutator width of such groups and some properties of its commutator subgroup. The paper presents a construction of commutator subgroup ...

They say formula F is weak-expressible by formulas of the system Σ in the logic L if F can be obtained from unary formulas of L and from formulas of Σ by applying the rule of weak substitution (which allows to pass from ...

Firstly, a reminder that a lattice is a set S of elements; it is partially ordered, closed in relation to two lattice operations: the reunion a + b and the intersection a • b of any two elements a and b from set S. (The ...