965 resultados para algebraic preservation theorem
Resumo:
In this paper we generalize the algebraic density property to not necessarily smooth affine varieties relative to some closed subvariety containing the singular locus. This property implies the remarkable approximation results for holomorphic automorphisms of the Andersén–Lempert theory. We show that an affine toric variety X satisfies this algebraic density property relative to a closed T-invariant subvariety Y if and only if X∖Y≠TX∖Y≠T. For toric surfaces we are able to classify those which possess a strong version of the algebraic density property (relative to the singular locus). The main ingredient in this classification is our proof of an equivariant version of Brunella's famous classification of complete algebraic vector fields in the affine plane.
Resumo:
The Self-OrganizingMap (SOM) is a neural network model that performs an ordered projection of a high dimensional input space in a low-dimensional topological structure. The process in which such mapping is formed is defined by the SOM algorithm, which is a competitive, unsupervised and nonparametric method, since it does not make any assumption about the input data distribution. The feature maps provided by this algorithm have been successfully applied for vector quantization, clustering and high dimensional data visualization processes. However, the initialization of the network topology and the selection of the SOM training parameters are two difficult tasks caused by the unknown distribution of the input signals. A misconfiguration of these parameters can generate a feature map of low-quality, so it is necessary to have some measure of the degree of adaptation of the SOM network to the input data model. The topologypreservation is the most common concept used to implement this measure. Several qualitative and quantitative methods have been proposed for measuring the degree of SOM topologypreservation, particularly using Kohonen's model. In this work, two methods for measuring the topologypreservation of the Growing Cell Structures (GCSs) model are proposed: the topographic function and the topology preserving map
Resumo:
Inoculum sources and Preservation in Soils of Phytophthora parasitica from Cherry Tomato in Continental Crop Areas in Southeast Spain
Resumo:
This paper performs a further generalization of the notion of independence in constraint logic programs to the context of constraint logic programs with dynamic scheduling. The complexity of this new environment made necessary to first formally define the relationship between independence and search space preservation in the context of CLP languages. In particular, we show that search space preservation is, in the context of CLP languages, not only a sufficient but also a necessary condition for ensuring that both the intended solutions and the number of transitions performed do not change. These results are then extended to dynamically scheduled languages and used as the basis for the extension of the concepts of independence. We also propose several a priori sufficient conditions for independence and also give correctness and efficiency results for parallel execution of constraint logic programs based on the proposed notions of independence.