Intellectual Communications and Contemporarly Technologies Alternatives of the Science Libraries

(Summary of: Varbanova-Dencheva, K. Intellectual communications and contemporarly technologies. Alternatives of the science libraries. Sofia, Marin Drinov academic publishing house. 2003, 114p. ) The new technologies and the globalization are the factors which have brought essential changes in human society and its environment. The unceasing dynamic changes imposed new strategies for survival and prosperity of institutions and people in the new conditions. The spheres with greatest potential for achieving competition priority are compatible to the fastness of research results implementation in each field of human activity. The extended knowledge requires narrower specialization as well as interdisciplinarity to solve the arising problems. The new research fields and trends are a synthesis of science and high technologies determined by the new discoveries. The present study aims at finding answers to the questions about the place of science library in the dynamic restructuring of research environment. The necessity of transformation of the scientific library’s genetically set functions from a guardian of the achieved knowledge to an active participant in the creation of new knowledge is a natural consequence of the processes and tendencies of the social medium. The priorities of Europe and USA for intensive creation of knowledge economics are at the first place and this requires intensification of that research an integral part of which are the new communications realized at a new technological level.

Subdifferentials of Performance Functions and Calculus of Coderivatives of Set-Valued Mappings

The paper contains calculus rules for coderivatives of compositions, sums and intersections of set-valued mappings. The types of coderivatives considered correspond to Dini-Hadamard and limiting Dini-Hadamard subdifferentials in Gˆateaux differentiable spaces, Fréchet and limiting Fréchet subdifferentials in Asplund spaces and approximate subdifferentials in arbitrary Banach spaces. The key element of the unified approach to obtaining various calculus rules for various types of derivatives presented in the paper are simple formulas for subdifferentials of marginal, or performance functions.

Approximation of Univariate Set-Valued Functions - an Overview

2000 Mathematics Subject Classification: 26E25, 41A35, 41A36, 47H04, 54C65.

Vector Combinatorial Problems in a Space of Combinations with Linear Fractional Functions of Criteria

The paper considers vector discrete optimization problem with linear fractional functions of criteria on a feasible set that has combinatorial properties of combinations. Structural properties of a feasible solution domain and of Pareto–optimal (efficient), weakly efficient, strictly efficient solution sets are examined. A relation between vector optimization problems on a combinatorial set of combinations and on a continuous feasible set is determined. One possible approach is proposed in order to solve a multicriteria combinatorial problem with linear- fractional functions of criteria on a set of combinations.

Algebraic Computations with Hausdorff Continuous Functions

The paper has been presented at the 12th International Conference on Applications of Computer Algebra, Varna, Bulgaria, June, 2006.

Functionally Countable Spaces and Baire Functions

The concept of the distinguished sets is applied to the investigation of the functionally countable spaces. It is proved that every Baire function on a functionally countable space has a countable image. This is a positive answer to a question of R. Levy and W. D. Rice.

On the Quality of Decision Functions in Pattern Recognition

The problem of decision functions quality in pattern recognition is considered. An overview of the approaches to the solution of this problem is given. Within the Bayesian framework, we suggest an approach based on the Bayesian interval estimates of quality on a finite set of events.

Decomposition of Boolean Functions – Recognizing a Good Solution by Traces

The problem of sequent two-block decomposition of a Boolean function is regarded in case when a good solution does exist. The problem consists mainly in finding an appropriate weak partition on the set of arguments of the considered Boolean function, which should be decomposable at that partition. A new fast heuristic combinatorial algorithm is offered for solving this task. At first the randomized search for traces of such a partition is fulfilled. The recognized traces are represented by some "triads" - the simplest weak partitions corresponding to non-trivial decompositions. After that the whole sought-for partition is restored from the discovered trace by building a track initialized by the trace and leading to the solution. The results of computer experiments testify the high practical efficiency of the algorithm.

Implementation of a Heuristic Method of Decomposition of Partial Boolean Functions

An original heuristic algorithm of sequential two-block decomposition of partial Boolean functions is researched. The key combinatorial task is considered: finding of suitable partition on the set of arguments, i. e. such one, on which the function is separable. The search for suitable partition is essentially accelerated by preliminary detection of its traces. Within the framework of the experimental system the efficiency of the algorithm is evaluated, the boundaries of its practical application are determined.

Finite Symmetric Functions with Non-Trivial Arity Gap

Given an n-ary k-valued function f, gap(f) denotes the essential arity gap of f which is the minimal number of essential variables in f which become fictive when identifying any two distinct essential variables in f. In the present paper we study the properties of the symmetric function with non-trivial arity gap (2 ≤ gap(f)). We prove several results concerning decomposition of the symmetric functions with non-trivial arity gap with its minors or subfunctions. We show that all non-empty sets of essential variables in symmetric functions with non-trivial arity gap are separable. ACM Computing Classification System (1998): G.2.0.

On the Residuum of Concave Univalent Functions

2000 Mathematics Subject Classification: 30C25, 30C45.

Averaging operators and set-valued maps

MSC 2010: 54C35, 54C60.