62 resultados para Spaces of Generalized Functions


Relevância:

100.00% 100.00%

Publicador:

Resumo:

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.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

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.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: Primary 26A33, 30C45; Secondary 33A35

Relevância:

100.00% 100.00%

Publicador:

Resumo:

AMS Subj. Classification: 11M41, 11M26, 11S40

Relevância:

100.00% 100.00%

Publicador:

Resumo:

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

Relevância:

100.00% 100.00%

Publicador:

Resumo:

MSC 2010: 46F30, 46F10

Relevância:

100.00% 100.00%

Publicador:

Resumo:

In this paper we investigate the Boolean functions with maximum essential arity gap. Additionally we propose a simpler proof of an important theorem proved by M. Couceiro and E. Lehtonen in [3]. They use Zhegalkin’s polynomials as normal forms for Boolean functions and describe the functions with essential arity gap equals 2. We use to instead Full Conjunctive Normal Forms of these polynomials which allows us to simplify the proofs and to obtain several combinatorial results concerning the Boolean functions with a given arity gap. The Full Conjunctive Normal Forms are also sum of conjunctions, in which all variables occur.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

∗Participant in Workshop in Linear Analysis and Probability, Texas A & M University, College Station, Texas, 2000. Research partially supported by the Edmund Landau Center for Research in Mathematical Analysis and related areas, sponsored by Minerva Foundation (Germany).

Relevância:

100.00% 100.00%

Publicador:

Resumo:

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.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

∗ The present article was originally submitted for the second volume of Murcia Seminar on Functional Analysis (1989). Unfortunately it has been not possible to continue with Murcia Seminar publication anymore. For historical reasons the present vesion correspond with the original one.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

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.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

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.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

In the presented work the problem of generalized natural environment model of emergency monitoring is presented. The approach, based on using CASE-based technologies is proposed for methodology development in solving this problem. Usage of CASE-based technology and knowledge databases allow for quick and interactive monitoring of current natural environment state and allow to develop adequate model for just-in- time possible emergency modeling.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: Primary 30C45, Secondary 26A33, 30C80

Relevância:

100.00% 100.00%

Publicador:

Resumo:

2000 Math. Subject Classification: 30C45