Search results for " Program"
showing 10 items of 3075 documents
Cyclic and lift closures for k…21-avoiding permutations
2011
We prove that the cyclic closure of the permutation class avoiding the pattern k(k-1)...21 is finitely based. The minimal length of a minimal permutation is 2k-1 and these basis permutations are enumerated by (2k-1).c"k where c"k is the kth Catalan number. We also define lift operations and give similar results. Finally, we consider the toric closure of a class and we propose some open problems.
The Linear Ordering Polytope
2010
So far we developed a general integer programming approach for solving the LOP. It was based on the canonical IP formulation with equations and 3-dicycle inequalities which was then strengthened by generating mod-k-inequalities as cutting planes. In this chapter we will add further ingredients by looking for problem- specific inequalities. To this end we will study the convex hull of feasible solutions of the LOP: the so-called linear ordering polytope.
A note on lower bounds of norms of averaging operators
2000
For any natural number n we obtain some examples of continuous onto maps $\phi : S\,\,\longrightarrow\, \,T$ for which Ditor's set $\Delta _\phi ^2(2, 2)$ is empty but every averaging operator for $\phi $ has norm greater or equal to 2n + 1.
The node-depth encoding
2008
The node-depth encoding has elements from direct and indirect encoding for trees which encodes trees by storing the depth of nodes in a list. Node-depth encoding applies specific search operators that is a typical characteristic for direct encodings. An investigation into the bias of the initialization process and the mutation operators of the node-depth encoding shows that the initialization process has a bias to solutions with small depths and diameters, and a bias towards stars. This investigation, also, shows that the mutation operators are unbiased. The performance of node-depth encoding is investigated for the bounded-diameter minimum spanning tree problem. The results are presented f…
Operators on PIP-Spaces and Indexed PIP-Spaces
2009
As already mentioned, the basic idea of pip-spaces is that vectors should not be considered individually, but only in terms of the subspaces V r (r Є F), the building blocks of the structure. Correspondingly, an operator on a pipspace should be defined in terms of assaying subspaces only, with the proviso that only continuous or bounded operators are allowed. Thus an operator is a coherent collection of continuous operators. We recall that in a nondegenerate pip-space, every assaying subspace V r carries its Mackey topology \(\tau (V_r , V \bar{r})\) and thus its dual is \(V \bar{r}\). This applies in particular to \(V^{\#}\) and V itself. For simplicity, a continuous linear map between two…
Browder's theorems through localized SVEP
2005
A bounded linear operator T ∈ L(X) on aBanach space X is said to satisfy “Browder’s theorem” if the Browder spectrum coincides with the Weyl spectrum. T ∈ L(X) is said to satisfy “a-Browder’s theorem” if the upper semi-Browder spectrum coincides with the approximate point Weyl spectrum. In this note we give several characterizations of operators satisfying these theorems. Most of these characterizations are obtained by using a localized version of the single-valued extension property of T. In the last part we shall give some characterizations of operators for which “Weyl’s theorem” holds.
Packing a Trunk
2003
We report on a project with a German car manufacturer. The task is to compute (approximate) solutions to a specific large-scale packing problem. Given a polyhedral model of a car trunk, the aim is to pack as many identical boxes of size 4 × 2 × 1 units as possible into the interior of the trunk. This measure is important for car manufacturers, because it is a standard in the European Union.
Spectral Asymptotics for $$\mathcal {P}\mathcal {T}$$ Symmetric Operators
2019
\(\mathcal {P}\mathcal {T}\)-symmetry has been proposed as an alternative to self-adjointness in quantum physics, see Bender et al. (J Math Phys 40(5):2201–2229, 1999), Bender and Mannheim (Phys Lett A 374(15–16):1616–1620, 2010). Thus for instance, if we consider a Schrodinger operator on Rn, $$\displaystyle P=-h^2\Delta +V(x), $$ the usual assumption of self-adjointness (implying that the potential V is real valued) can be replaced by that of \(\mathcal {P}\mathcal {T}\)-symmetry: $$\displaystyle V\circ \iota =\overline {V}, $$ where ι : Rn →Rn is an isometry with ι2 = 1≠ι. If we introduce the parity operator \(\mathcal {P}_\iota u(x)=u(\iota (x))\) and the time reversal operator \(\mathc…
XPL the Extensible Presentation Language
2009
The last decade has witnessed a growing interest in the development of web interfaces enabling both multiple ways to access contents and, at the same time, fruition by multiple modalities of interaction (point-and-click, contents reading, voice commands, gestures, etc.). In this paper we describe a framework aimed at streamlining the design process of multi-channel, multimodal interfaces enabling full reuse of software components. This framework is called the eXtensible Presentation architecture and Language (XPL), a presentation language based on design pattern paradigm that keeps separated the presentation layer from the underlying programming logic. The language supplies a methodology to…
Educación XX1 : revista de la Facultad de Educación
2018
La siguiente investigación pretende analizar en qué medida los recursos educativos, en este caso los libros de texto, contribuyen a la alfabetización visual del alumnado de Educación Primaria en Ciencias Sociales. Este tipo de alfabetización es un aspecto fundamental en cualquier etapa educativa tal y como ha venido confirmando la investigación hasta fechas muy recientes. Para ello se han seleccionado los manuales más utilizados en un determinado espacio geográfico desde 2006 y se han analizado siguiendo un método de investigación que combina procedimientos cuantitativos (ex post-facto) y cualitativos (análisis mediante categorías conceptuales) aplicándolos sobre las actividades relacionada…