Abstract Nonstationary fractional-order systems represent a new class of dynamic characterized by time-varying parameters as well memory effect and hereditary properties. Differential game described system linear nonstationary differential equations fractional order is treated in the paper. The involves two players, one which tries to bring system’s trajectory terminal set, whereas other strive...

objectives: to implement goal-directed subsidies policy in framework of the its law is being seriously followed by state. implementing this policy as it has been defined in the law could be a deep surgery of economy with big negative consequences both in demand and supply sides if its theoretical foundation is wrong. hence, this paper aims to evaluate the theoretical sufficiency of neoclassical...

This document contains a selection of open problems provided by participants of the data mining PhD reading seminar at the IT University of Copenhagen in fall 2009. It is not intended to showcase the “most significant” open problems in the field, but merely problems found interesting by the participants. In particular, the theoretical angle of the seminar is reflected. 1 Frequent itemsets — a r...

In the present dissertation we investigate structural and algorithmic aspects of the frequency assignment problem in mobile telephone networks. This problem is of particular interest for the graph theory because of its close relationship to graph coloring. The frequency assignment problem includes the characteristic features of T-coloring, list coloring, and set coloring, and belongs thereby to...

Let us suppose we are given an isometric hull φ. Recent interest in lines has centered on constructing linear, Poncelet, trivial systems. We show that Ψπ is naturally onto. Every student is aware that every stochastically bijective, Atiyah–Eudoxus vector is almost nonnegative. In contrast, we wish to extend the results of [3] to almost everywhere negative isomorphisms.

This thesis is situated in the field of combinatorial optimization. More specifically, we focus on solution methods for solving a number of graphtheoretical optimization problems. First we give a short introduction to the field of integer programming and state of the art solution techniques. The remainder of this thesis can be roughly split into two parts. The first part is dedicated to the pro...

Concepts of constructive combinatorial problem and, in particular, of extreme combinatorial problem (ECP) are deened. It is announced a sequential principle of construction of the constructive combinatorial problems' solution. This principle leads to necessity to consider ECP as system of independence with weighted elements. Auxiliary sets, which are connected to the solution of optimization pr...

The Isomorphism of Polynomial (IP) [27], which is the main concern of this paper, originally corresponds to the problem of recovering the secret key of a C∗ scheme [26]. Besides, the security of various other schemes (e.g. signature, authentication [27], traitor tracing [5], etc. . . ) also depends on the practical hardness of IP. Due to its numerous applications, the Isomorphism of Polynomial ...

Prior to discovery of the tubercle bacillus interest in the nature of tuberculosis was focused largely on the types of human constitution most susceptible or resistant to the disease. For a generation after discovery of the bacillus, infection was considered so nearly universal that it was thought to be a minor factor in the pathogenesis of tuberculosis, the resistance of the host being the maj...