Learning flexible sensori-motor mappings in a complex network

Given the complex structure of the brain, how can synaptic plasticity explain the learning and forgetting of associations when these are continuously changing? We address this question by studying different reinforcement learning rules in a multilayer network in order to reproduce monkey behavior in a visuomotor association task. Our model can only reproduce the learning performance of the monkey if the synaptic modifications depend on the pre- and postsynaptic activity, and if the intrinsic level of stochasticity is low. This favored learning rule is based on reward modulated Hebbian synaptic plasticity and shows the interesting feature that the learning performance does not substantially degrade when adding layers to the network, even for a complex problem.

Dimension Distortion by Sobolev Mappings in Foliated Metric Spaces

We quantify the extent to which a supercritical Sobolev mapping can increase the dimension of subsets of its domain, in the setting of metric measure spaces supporting a Poincaré inequality. We show that the set of mappings that distort the dimensions of sets by the maximum possible amount is a prevalent subset of the relevant function space. For foliations of a metric space X defined by a David–Semmes regular mapping Π : X → W, we quantitatively estimate, in terms of Hausdorff dimension in W, the size of the set of leaves of the foliation that are mapped onto sets of higher dimension. We discuss key examples of such foliations, including foliations of the Heisenberg group by left and right cosets of horizontal subgroups.

Transformative deliberative moments among ex-combattants in Colombia

This dissertation presents the concept of Deliberative Transformative Moment and the instrument to identify it, in a further attempt to bridge the gap between deliberation theory and practice. A transformative moment in the deliberative process occurs when the level of deliberation is either lifted from low to high or drops from high to low. In order to identify such a moment, one has to look at the context and dynamics of the group discussion. This broadening of the unit of analysis is a big difference from other existing instruments to measure the level of deliberation, such as the Deliberative Quality Index –DQI, which focuses primarily on the individual speech acts. Consistent with the theoretical framework of consociational and deliberation approaches, the observed discussions took place among two deeply divided groups, Colombian ex-combatants from both the extreme left and the extreme right. Moving beyond a pure Habermasian perspective, this study finds that besides pure rational arguments, there are some contexts in which personal stories, jokes and self-interests, acting as justification of arguments, have either a positive or a negative impact on deliberative transformative moments. Although this research has a strongly qualitative orientation, reliability tests scored high, giving it strength as a reliable and valid research method that shedding some light on the sort of speech acts that enhance deliberation and those that detract from it.

On the road. Der Pilgerweg der Gerechtigkeit und des Friedens als transformative Herausforderung

Am Leitfaden der Geschichte der Emmaus-Jünger (Lk 24,13-35) wird die Botschaft der Ökumenischen Weltversammlung von Busan von 2013 in ihrer Verbindung von geistlicher Transformation der Glaubenden und politischer Transformation durch die Glaubenden am Beispiel der Nachhaltigkeitsthematik ausgelegt.

A high-resolution soil erosion risk map of Switzerland as strategic policy support system

Soil erosion models and soil erosion risk maps are often used as indicators to assess potential soil erosion in order to assist policy decisions. This paper shows the scientific basis of the soil erosion risk map of Switzerland and its application in policy and practice. Linking a USLE/RUSLE-based model approach (AVErosion) founded on multiple flow algorithms and the unit contributing area concept with an extremely precise and high-resolution digital terrain model (2 m × 2 m grid) using GIS allows for a realistic assessment of the potential soil erosion risk, on single plots, i.e. uniform and comprehensive for the agricultural area of Switzerland (862,579 ha in the valley area and the lower mountain regions). The national or small-scale soil erosion prognosis has thus reached a level heretofore possible only in smaller catchment areas or single plots. Validation was carried out using soil loss data from soil erosion damage mappings in the field from long-term monitoring in different test areas. 45% of the evaluated agricultural area of Switzerland was classified as low potential erosion risk, 12% as moderate potential erosion risk, and 43% as high potential erosion risk. However, many of the areas classified as high potential erosion risk are located at the transition from valley to mountain zone, where many areas are used as permanent grassland, which drastically lowers their current erosion risk. The present soil erosion risk map serves on the one hand to identify and prioritise the high-erosion risk areas, and on the other hand to promote awareness amongst farmers and authorities. It was published on the internet and will be made available to the authorities in digital form. It is intended as a tool for simplifying and standardising enforcement of the legal framework for soil erosion prevention in Switzerland. The work therefore provides a successful example of cooperation between science, policy and practice.

A Calculus of Evolving Objects

The demands of developing modern, highly dynamic applications have led to an increasing interest in dynamic programming languages and mechanisms. Not only applications must evolve over time, but the object models themselves may need to be adapted to the requirements of different run-time contexts. Class-based models and prototype-based models, for example, may need to co-exist to meet the demands of dynamically evolving applications. Multi-dimensional dispatch, fine-grained and dynamic software composition, and run-time evolution of behaviour are further examples of diverse mechanisms which may need to co-exist in a dynamically evolving run-time environment How can we model the semantics of these highly dynamic features, yet still offer some reasonable safety guarantees? To this end we present an original calculus in which objects can adapt their behaviour at run-time to changing contexts. Both objects and environments are represented by first-class mappings between variables and values. Message sends are dynamically resolved to method calls. Variables may be dynamically bound, making it possible to model a variety of dynamic mechanisms within the same calculus. Despite the highly dynamic nature of the calculus, safety properties are assured by a type assignment system.

A Calculus of Evolving Objects

The demands of developing modern, highly dynamic applications have led to an increasing interest in dynamic programming languages and mechanisms. Not only must applications evolve over time, but the object models themselves may need to be adapted to the requirements of different run-time contexts. Class-based models and prototype-based models, for example, may need to co-exist to meet the demands of dynamically evolving applications. Multi-dimensional dispatch, fine-grained and dynamic software composition, and run-time evolution of behaviour are further examples of diverse mechanisms which may need to co-exist in a dynamically evolving run-time environment. How can we model the semantics of these highly dynamic features, yet still offer some reasonable safety guarantees? To this end we present an original calculus in which objects can adapt their behaviour at run-time. Both objects and environments are represented by first-class mappings between variables and values. Message sends are dynamically resolved to method calls. Variables may be dynamically bound, making it possible to model a variety of dynamic mechanisms within the same calculus. Despite the highly dynamic nature of the calculus, safety properties are assured by a type assignment system.