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.

Types of Addresses and Levels of use in the TCP/IP Protocol Stack

The publication comments on certain moments of the method of teaching the types of addresses and their use in the TCP/IP protocol stack.

Fractional Integration of the Product of Bessel Functions of the First Kind

Dedicated to 75th birthday of Prof. A.M. Mathai, Mathematical Subject Classification 2010:26A33, 33C10, 33C20, 33C50, 33C60, 26A09

Taylor Spectrum and Characteristic Functions of Commuting 2-Contractions

2000 Mathematics Subject Classification: 47A10, 47A13.

The Deformed Trigonometric Functions of two Variables

MSC 2010: 33B10, 33E20

Subclasses of Starlike Functions of Complex Order Involving Generalized Hypergeometric Functions

MSC2010: 30C45, 33C45

Alternative Characterization of the Class k-UCV and Related Classes of Univalent Functions

In this paper an alternative characterization of the class of functions called k -uniformly convex is found. Various relations concerning connections with other classes of univalent functions are given. Moreover a new class of univalent functions, analogous to the ’Mocanu class’ of functions, is introduced. Some results concerning this class are derived.

Generalized Problem of Sratlikeness for Products of P-Valent Starlike Functions

∗ Partially supported by grant No. 433/94 NSF of the Ministry of Education and Science of the Republic of Bulgaria 1991 Mathematics Subject Classification:30C45

Method of Elimination Data Sources Conflicts in Information System

Use of modern object-oriented methods of designing of information systems (IS) both descriptions of interrelations IS and automated with its help business-processes of the enterprises leads to necessity of construction uniform complete IS on the basis of set of local models of such system. As a result of use of such approach there are the contradictions caused by inconsistency of actions of separate developers IS with each other and that is much more important, inconsistency of the points of view of separate users IS. Besides similar contradictions arise while in service IS at the enterprise because of constant change separate business- processes of the enterprise. It is necessary to note also, that now overwhelming majority IS is developed and maintained as set of separate functional modules. Each of such modules can function as independent IS. However the problem of integration of separate functional modules in uniform system can lead to a lot of problems. Among these problems it is possible to specify, for example, presence in modules of functions which are not used by the enterprise to destination, to complexity of information and program integration of modules of various manufacturers, etc. In most cases these contradictions and the reasons, their caused, are consequence of primary representation IS as equilibrium steady system. In work [1] representation IS as dynamic multistable system which is capable to carry out following actions has been considered:

On Root Arrangements of Polynomial-Like Functions and their Derivatives

2000 Mathematics Subject Classification: 12D10.