Formalization of Structural Constraints of Relationships in Model „Entity-Relationship”

The basic conceptions of the model „entity-relationship” as entities, relationships, structural constraints of the relationships (index cardinality, participation degree, and structural constraints of kind (min, max)) are considered and formalized in terms of relations theory. For the binary relations two operators (min and max) are introduced; structural constraints are determined in terms of the operators; the main theorem about compatibility of these operators’ values on the source relation and inversion to it is given here.

Towards the Problems of an Evaluation of Data Uncertainty in Decision Support Systems

The question of forming aim-oriented description of an object domain of decision support process is outlined. Two main problems of an estimation and evaluation of data and knowledge uncertainty in decision support systems – straight and reverse, are formulated. Three conditions being the formalized criteria of aimoriented constructing of input, internal and output spaces of some decision support system are proposed. Definitions of appeared and hidden data uncertainties on some measuring scale are given.

Three-Dimensional Operational Calculi for Nonlocal Evolution Boundary Value Problems

Иван Христов Димовски, Юлиан Цанков Цанков - Построени са директни операционни смятания за функции u(x, y, t), непрекъснати в област от вида D = [0, a] × [0, b] × [0, ∞). Наред с класическата дюамелова конволюция, построението използва и две некласически конволюции за операторите ∂2x и ∂2y. Тези три едномерни конволюции се комбинират в една тримерна конволюция u ∗ v в C(D). Вместо подхода на Я. Микусински, основаващ се на конволюционни частни, се развива алтернативен подход с използване на мултипликаторните частни на конволюционната алгебра (C(D), ∗).

Large Distinct Part Sizes in a Random Integer Partition

A partition of a positive integer n is a way of writing it as the sum of positive integers without regard to order; the summands are called parts. The number of partitions of n, usually denoted by p(n), is determined asymptotically by the famous partition formula of Hardy and Ramanujan [5]. We shall introduce the uniform probability measure P on the set of all partitions of n assuming that the probability 1/p(n) is assigned to each n-partition. The symbols E and V ar will be further used to denote the expectation and variance with respect to the measure P . Thus, each conceivable numerical characteristic of the parts in a partition can be regarded as a random variable.

Inequalities and Asymptotic Formulae for the Three Parametric Mittag-Leffler Functions

MSC 2010: 33E12, 30A10, 30D15, 30E15