980 resultados para INFINITE-DIMENSIONAL MANIFOLDS
Resumo:
The generative topographic mapping (GTM) model was introduced by Bishop et al. (1998, Neural Comput. 10(1), 215-234) as a probabilistic re- formulation of the self-organizing map (SOM). It offers a number of advantages compared with the standard SOM, and has already been used in a variety of applications. In this paper we report on several extensions of the GTM, including an incremental version of the EM algorithm for estimating the model parameters, the use of local subspace models, extensions to mixed discrete and continuous data, semi-linear models which permit the use of high-dimensional manifolds whilst avoiding computational intractability, Bayesian inference applied to hyper-parameters, and an alternative framework for the GTM based on Gaussian processes. All of these developments directly exploit the probabilistic structure of the GTM, thereby allowing the underlying modelling assumptions to be made explicit. They also highlight the advantages of adopting a consistent probabilistic framework for the formulation of pattern recognition algorithms.
Resumo:
* The authors thank the “Swiss National Science Foundation” for its support.
Resumo:
Let E be an infinite dimensional separable space and for e ∈ E and X a nonempty compact convex subset of E, let qX(e) be the metric antiprojection of e on X. Let n ≥ 2 be an arbitrary integer. It is shown that for a typical (in the sence of the Baire category) compact convex set X ⊂ E the metric antiprojection qX(e) has cardinality at least n for every e in a dense subset of E.
Resumo:
MSC 2010: 30C60
Resumo:
Недю И. Попиванов, Тодор П. Попов, Рудолф Шерер - Разглеждат се четиримерни гранични задачи за нехомогенното вълново уравнение. Те са предложени от М. Протер като многомерни аналози на задачата на Дарбу в равнината. Известно е, че единственото обобщено решение може да има силна степенна особеност само в една гранична точка. Тази сингулярност е изолирана във върха на характеристичния конус и не се разпространява по конуса. Друг аспект на проблема е, че задачата не е фредхолмова, тъй като има безкрайномерно коядро. Предишни резултати сочат, че решението може да има най-много експоненциален ръст, но оставят открит въпроса дали наистина съществуват такива решения. Показваме, че отговора на този въпрос е положителен и строим обобщено решение на задачата на Протер с експоноциална особеност.
Resumo:
2000 Mathematics Subject Classification: Primary 47B47, 47B10; Secondary 47A30.
Resumo:
2000 Mathematics Subject Classification: Primary: 47B47, 47B10; secondary 47A30.
Resumo:
2000 Mathematics Subject Classification: 53B05, 53B99.
Resumo:
The dynamics of a population undergoing selection is a central topic in evolutionary biology. This question is particularly intriguing in the case where selective forces act in opposing directions at two population scales. For example, a fast-replicating virus strain outcompetes slower-replicating strains at the within-host scale. However, if the fast-replicating strain causes host morbidity and is less frequently transmitted, it can be outcompeted by slower-replicating strains at the between-host scale. Here we consider a stochastic ball-and-urn process which models this type of phenomenon. We prove the weak convergence of this process under two natural scalings. The first scaling leads to a deterministic nonlinear integro-partial differential equation on the interval $[0,1]$ with dependence on a single parameter, $\lambda$. We show that the fixed points of this differential equation are Beta distributions and that their stability depends on $\lambda$ and the behavior of the initial data around $1$. The second scaling leads to a measure-valued Fleming-Viot process, an infinite dimensional stochastic process that is frequently associated with a population genetics.
Resumo:
Strategic supply chain optimization (SCO) problems are often modelled as a two-stage optimization problem, in which the first-stage variables represent decisions on the development of the supply chain and the second-stage variables represent decisions on the operations of the supply chain. When uncertainty is explicitly considered, the problem becomes an intractable infinite-dimensional optimization problem, which is usually solved approximately via a scenario or a robust approach. This paper proposes a novel synergy of the scenario and robust approaches for strategic SCO under uncertainty. Two formulations are developed, namely, naïve robust scenario formulation and affinely adjustable robust scenario formulation. It is shown that both formulations can be reformulated into tractable deterministic optimization problems if the uncertainty is bounded with the infinity-norm, and the uncertain equality constraints can be reformulated into deterministic constraints without assumption of the uncertainty region. Case studies of a classical farm planning problem and an energy and bioproduct SCO problem demonstrate the advantages of the proposed formulations over the classical scenario formulation. The proposed formulations not only can generate solutions with guaranteed feasibility or indicate infeasibility of a problem, but also can achieve optimal expected economic performance with smaller numbers of scenarios.
Resumo:
We say that a (countably dimensional) topological vector space X is orbital if there is T∈L(X) and a vector x∈X such that X is the linear span of the orbit {Tnx:n=0,1,…}. We say that X is strongly orbital if, additionally, x can be chosen to be a hypercyclic vector for T. Of course, X can be orbital only if the algebraic dimension of X is finite or infinite countable. We characterize orbital and strongly orbital metrizable locally convex spaces. We also show that every countably dimensional metrizable locally convex space X does not have the invariant subset property. That is, there is T∈L(X) such that every non-zero x∈X is a hypercyclic vector for T. Finally, assuming the Continuum Hypothesis, we construct a complete strongly orbital locally convex space.
As a byproduct of our constructions, we determine the number of isomorphism classes in the set of dense countably dimensional subspaces of any given separable infinite dimensional Fréchet space X. For instance, in X=ℓ2×ω, there are exactly 3 pairwise non-isomorphic (as topological vector spaces) dense countably dimensional subspaces.
Resumo:
Recently, Bès, Martin, and Sanders [11] provided examples of disjoint hypercyclic operators which fail to satisfy the Disjoint Hypercyclicity Criterion. However, their operators also fail to be disjoint weakly mixing. We show that every separable, infinite dimensional Banach space admits operators T1,T2,…,TN with N⩾2 which are disjoint weakly mixing, and still fail to satisfy the Disjoint Hypercyclicity Criterion, answering a question posed in [11]. Moreover, we provide examples of disjoint hypercyclic operators T1, T2 whose corresponding set of disjoint hypercyclic vectors is nowhere dense, answering another question posed in [11]. In fact, we explicitly describe their set of disjoint hypercyclic vectors. Those same disjoint hypercyclic operators fail to be disjoint topologically transitive. Lastly, we create examples of two families of d-hypercyclic operators which fail to have any d-hypercyclic vectors in common.
Resumo:
For a topological vector space (X, τ ), we consider the family LCT (X, τ ) of all locally convex topologies defined on X, which give rise to the same continuous linear functionals as the original topology τ . We prove that for an infinite-dimensional reflexive Banach space (X, τ ), the cardinality of LCT (X, τ ) is at least c.
Resumo:
International audience
Resumo:
Doutoramento em Gestão