195 resultados para Bulgarian philology.
Resumo:
In this paper we examine discrete functions that depend on their variables in a particular way, namely the H-functions. The results obtained in this work make the “construction” of these functions possible. H-functions are generalized, as well as their matrix representation by Latin hypercubes.
Resumo:
This work was partially supported by the Bulgarian National Science Fund under Contract No MM 1405. Part of the results were announced at the Fifth International Workshop on Optimal Codes and Related Topics (OCRT), White Lagoon, June 2007, Bulgaria
Resumo:
We give the necessary and sufficient conditions for the extendability of ternary linear codes of dimension k ≥ 5 with minimum distance d ≡ 1 or 2 (mod 3) from a geometrical point of view.
Resumo:
Partially supported by the Bulgarian Science Fund contract with TU Varna, No 487.
Resumo:
This paper introduces an encoding of knowledge representation statements as regular languages and proposes a two-phase approach to processing of explicitly declared conceptual information. The idea is presented for the simple conceptual graphs where conceptual pattern search is implemented by the so called projection operation. Projection calculations are organised into off-line preprocessing and run-time computations. This enables fast run-time treatment of NP-complete problems, given that the intermediate results of the off-line phase are kept in suitable data structures. The experiments with randomly-generated, middle-size knowledge bases support the claim that the suggested approach radically improves the run-time conceptual pattern search.
Resumo:
This article presents the principal results of the doctoral thesis “Semantic-oriented Architecture and Models for Personalized and Adaptive Access to the Knowledge in Multimedia Digital Library” by Desislava Ivanova Paneva-Marinova (Institute of Mathematics and Informatics), successfully defended before the Specialised Academic Council for Informatics and Mathematical Modelling on 27 October, 2008.
Resumo:
This work was partially supported by the Bulgarian National Science Fund under Grant I–618/96.
Resumo:
We consider the question whether the assumption of convexity of the set involved in Clarke-Ledyaev inequality can be relaxed. In the case when the point is outside the convex hull of the set we show that Clarke-Ledyaev type inequality holds if and only if there is certain geometrical relation between the point and the set.
Resumo:
*Supported by the Grants AV ˇCR 101-97-02, 101-90-03, GA ˇCR 201-98-1449, and by the Grant of the Faculty of Civil Engineering of the Czech Technical University No. 2003.
Resumo:
A boundary-value problems for almost nonlinear singularly perturbed systems of ordinary differential equations are considered. An asymptotic solution is constructed under some assumption and using boundary functions and generalized inverse matrix and projectors.
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).
Resumo:
*Supported in part by GAˇ CR 201-98-1449 and AV 101 9003. This paper is based on a part of the author’s MSc thesis written under the supervison of Professor V. Zizler.
Resumo:
A γ-space with a strictly positive measure is separable. An example of a non-separable γ−space with c.c.c. is given. A P−space with c.c.c. is countable and discrete.
Resumo:
We solve the functional equation f(x^m + y) = f(x)^m + f(y) in the realm of polynomials with integer coefficients.
Resumo:
The present paper contains results characterizing relatively compact subsets of the space of the closed subsets of a metrizable space, equipped with various hypertopologies. We investigate the hyperspace topologies that admit a representation as weak topologies generated by families of gap functionals defined on closed sets, as well as hit-and-miss topologies and proximal-hit and-miss topologies.