Search results for "computer program"

TREC: A tool kit for programming cognitive experiments in Applesoft BASIC

1987

David Marr: A Theory for Cerebral Neocortex

1986

This paper is an important contribution to the understanding of the visual system, it contains a part of those ideas which have become the commonly accepted basis of current research. Although some of these principles already had a history in 1970, Marr clearly deserves the credit for their sharp formulation and for a series of attempts leading to a formalization of the problems. His way of dividing the approach into the levels of computational theory, of the algorithm and of the implementation clarified the problems. His creed that human visual processing is modular, and that different types of information, which are encoded in the image can be decoded independently by modules, has been ge…

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.

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.

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…

A model of internal and external competition in a High Speed Rail line

2015

This paper is a contribution to evaluate structural and behavioral changes in railway passenger markets. The novel elements of our analysis are the following: (i) the consideration of inter-modal and intra-modal competition, (ii) the presence of public and private operators, and (iii) endogenous service frequency. After calibrating the model using actual data from two Spanish High Speed Rail lines, simulation exercises allow us to conclude the following. Privatization, whether entry occurs or not, would prompt an increase in prices and a reduction in the number of train services, eventually leading to welfare decreases, as compared with a regime where the incumbent rail operator remained pu…

Determining a Random Schrödinger Operator : Both Potential and Source are Random

2020

We study an inverse scattering problem associated with a Schr\"odinger system where both the potential and source terms are random and unknown. The well-posedness of the forward scattering problem is first established in a proper sense. We then derive two unique recovery results in determining the rough strengths of the random source and the random potential, by using the corresponding far-field data. The first recovery result shows that a single realization of the passive scattering measurements uniquely recovers the rough strength of the random source. The second one shows that, by a single realization of the backscattering data, the rough strength of the random potential can be recovered…