Search results for " Programming"

Abductive Reasoning and Linguistic Meaning

2006

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…

The Semantics of Musical Topoi

2015

The article introduces an empirical approach to studying music’s extrinsic meanings, based on the idea of musical topos as a set of musical entities that is delimited and furnished with meaning by extramusical associations in a listener population. The proposed methodology involves free, associative responses as well as responses on semantic variables addressing the imagery. After deriving potential topical structures for a given musical domain from the quantitative results, the structures are substantiated by using them to guide a rule-based, qualitative analysis of the free responses. The approach allows a view to the topical organization of a musical domain in which the identity of each …

Teaching types with a cognitively effective worked example format

2015

AbstractTeaching functional programming as a second programming paradigm is often difficult as students can have strong preconceptions about programming. When most of these preconceived ideas fail to be confirmed, functional programming may be seen as an unnecessarily difficult topic. A typical topic that causes such difficulties is the language of types employed by many modern functional languages. In this paper, we focus on addressing this difficulty through the use of step-by-step calculations of type expressions. The outcome of the study is an elaboration of a worked example format and a methodical approach for teaching types to beginner functional programmers.

Therapeutic metaphors and personal meanings in group poetry therapy for people with schizophrenia

2021

This article concerns the therapeutic potential of metaphor in group poetry therapy, concentrating on the poetry therapy process of people diagnosed with schizophrenia. The data was collected in a one-year poetry therapy group. The main questions were: (1) What kind of therapeutic potential can metaphors offer in group poetry therapy? (2) What are the personal meanings and evaluations that the participants give to the therapy process and its effects on their lives? (3) What are the most significant elements in poetry therapy from the viewpoint of the client? The analysis was based on the Grounded theory method. The results showed that the most significant therapeutic factors of the process …

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…