7 resultados para local-to-zero analysis
em Bulgarian Digital Mathematics Library at IMI-BAS
Resumo:
The paper presents an approach to extraction of facts from texts of documents. This approach is based on using knowledge about the subject domain, specialized dictionary and the schemes of facts that describe fact structures taking into consideration both semantic and syntactic compatibility of elements of facts. Actually extracted facts combine into one structure the dictionary lexical objects found in the text and match them against concepts of subject domain ontology.
Resumo:
We prove that if f is a real valued lower semicontinuous function on a Banach space X and if there exists a C^1, real valued Lipschitz continuous function on X with bounded support and which is not identically equal to zero, then f is Lipschitz continuous of constant K provided all lower subgradients of f are bounded by K. As an application, we give a regularity result of viscosity supersolutions (or subsolutions) of Hamilton-Jacobi equations in infinite dimensions which satisfy a coercive condition. This last result slightly improves some earlier work by G. Barles and H. Ishii.
Resumo:
We are concerned with two-level optimization problems called strongweak Stackelberg problems, generalizing the class of Stackelberg problems in the strong and weak sense. In order to handle the fact that the considered two-level optimization problems may fail to have a solution under mild assumptions, we consider a regularization involving ε-approximate optimal solutions in the lower level problems. We prove the existence of optimal solutions for such regularized problems and present some approximation results when the parameter ǫ goes to zero. Finally, as an example, we consider an optimization problem associated to a best bound given in [2] for a system of nondifferentiable convex inequalities.
Resumo:
We discuss several approaches to similarity preserving coding of symbol sequences and possible connections of their distributed versions to metric embeddings. Interpreting sequence representation methods with embeddings can help develop an approach to their analysis and may lead to discovering useful properties.
Resumo:
Some basic types of archiving programs are described in the paper in addition to their advantages and disadvantages with respect to the analysis of security in archiving. Analysis and appraisal are performed on the results obtained during the described experiments.
Resumo:
2000 Mathematics Subject Classification: 60G48, 60G20, 60G15, 60G17. JEL Classification: G10
Resumo:
ACM Computing Classification System (1998): D.0, D.2.11.