Development, degeneration and neural network of the bodily self

The question addressed by this dissertation is how the human brain builds a coherent representation of the body, and how this representation is used to recognize its own body. Recent approaches by neuroimaging and TMS revealed hints for a distinct brain representation of human body, as compared with other stimulus categories. Neuropsychological studies demonstrated that body-parts and self body-parts recognition are separate processes sub-served by two different, even if possibly overlapping, networks within the brain. Bodily self-recognition is one aspect of our ability to distinguish between self and others and the self/other distinction is a crucial aspect of social behaviour. This is the reason why I have conducted a series of experiment on subjects with everyday difficulties in social and emotional behaviour, such as patients with autism spectrum disorders (ASD) and patients with Parkinson’s disease (PD). More specifically, I studied the implicit self body/face recognition (Chapter 6) and the influence of emotional body postures on bodily self-processing in TD children as well as in ASD children (Chapter 7). I found that the bodily self-recognition is present in TD and in ASD children and that emotional body postures modulate self and others’ body processing. Subsequently, I compared implicit and explicit bodily self-recognition in a neuro-degenerative pathology, such as in PD patients, and I found a selective deficit in implicit but not in explicit self-recognition (Chapter 8). This finding suggests that implicit and explicit bodily self-recognition are separate processes subtended by different mechanisms that can be selectively impaired. If the bodily self is crucial for self/other distinction, the space around the body (personal space) represents the space of interaction and communication with others. When, I studied this space in autism, I found that personal space regulation is impaired in ASD children (Chapter 9).

DISTRIBUTED APPROACH FOR SOLVING OPTIMAL POWER FLOW PROBLEMS IN THREE-PHASE UNBALANCED DISTRIBUTION NETWORK

The objective of this report is to study distributed (decentralized) three phase optimal power flow (OPF) problem in unbalanced power distribution networks. A full three phase representation of the distribution networks is considered to account for the highly unbalance state of the distribution networks. All distribution network’s series/shunt components, and load types/combinations had been modeled on commercial version of General Algebraic Modeling System (GAMS), the high-level modeling system for mathematical programming and optimization. The OPF problem has been successfully implemented and solved in a centralized approach and distributed approach, where the objective is to minimize the active power losses in the entire system. The study was implemented on the IEEE-37 Node Test Feeder. A detailed discussion of all problem sides and aspects starting from the basics has been provided in this study. Full simulation results have been provided at the end of the report.

Semantic Representation of Synaesthesia

Synaesthesia has multifaceted consequences for both subjective experience and cognitive performance. Here, I broach the issue of how synaesthesia is represented in semantic memory. I hypothesize that, for example, in grapheme colour synaesthesia, colour is represented as an additional feature in the semantic network that enables the formation of associations that are not present in non-synaesthetes. Thus, synaesthesia provokes richer memory representations which enable learning opportunities that are not present in non-synaesthetes, provides additional memory cues, and may trigger creative ideas.

Bifurcation and singularity analysis of a molecular network for the induction of long-term memory.

Withdrawal reflexes of the mollusk Aplysia exhibit sensitization, a simple form of long-term memory (LTM). Sensitization is due, in part, to long-term facilitation (LTF) of sensorimotor neuron synapses. LTF is induced by the modulatory actions of serotonin (5-HT). Pettigrew et al. developed a computational model of the nonlinear intracellular signaling and gene network that underlies the induction of 5-HT-induced LTF. The model simulated empirical observations that repeated applications of 5-HT induce persistent activation of protein kinase A (PKA) and that this persistent activation requires a suprathreshold exposure of 5-HT. This study extends the analysis of the Pettigrew model by applying bifurcation analysis, singularity theory, and numerical simulation. Using singularity theory, classification diagrams of parameter space were constructed, identifying regions with qualitatively different steady-state behaviors. The graphical representation of these regions illustrates the robustness of these regions to changes in model parameters. Because persistent protein kinase A (PKA) activity correlates with Aplysia LTM, the analysis focuses on a positive feedback loop in the model that tends to maintain PKA activity. In this loop, PKA phosphorylates a transcription factor (TF-1), thereby increasing the expression of an ubiquitin hydrolase (Ap-Uch). Ap-Uch then acts to increase PKA activity, closing the loop. This positive feedback loop manifests multiple, coexisting steady states, or multiplicity, which provides a mechanism for a bistable switch in PKA activity. After the removal of 5-HT, the PKA activity either returns to its basal level (reversible switch) or remains at a high level (irreversible switch). Such an irreversible switch might be a mechanism that contributes to the persistence of LTM. The classification diagrams also identify parameters and processes that might be manipulated, perhaps pharmacologically, to enhance the induction of memory. Rational drug design, to affect complex processes such as memory formation, can benefit from this type of analysis.

Neural representation and clinically relevant moderators of individualised self-criticism in healthy subjects

Many people routinely criticise themselves. While self-criticism is largely unproblematic for most individuals, depressed patients exhibit excessive self-critical thinking, which leads to strong negative affects. We used functional magnetic resonance imaging in healthy subjects (N = 20) to investigate neural correlates and possible psychological moderators of self-critical processing. Stimuli consisted of individually selected adjectives of personally negative content and were contrasted with neutral and negative non-self-referential adjectives. We found that confrontation with self-critical material yielded neural activity in regions involved in emotions (anterior insula/hippocampus-amygdala formation) and in anterior and posterior cortical midline structures, which are associated with self-referential and autobiographical memory processing. Furthermore, contrasts revealed an extended network of bilateral frontal brain areas. We suggest that the co-activation of superior and inferior lateral frontal brain regions reflects the recruitment of a frontal top-down pathway, representing cognitive reappraisal strategies for dealing with evoked negative affects. In addition, activation of right superior frontal areas was positively associated with neuroticism and negatively associated with cognitive reappraisal. Although these findings may not be specific to negative stimuli, they support a role for clinically relevant personality traits in successful regulation of emotion during confrontation with self-critical material.

Feature selection in the reconstruction of complex network representations of spectral data

Complex networks have been extensively used in the last decade to characterize and analyze complex systems, and they have been recently proposed as a novel instrument for the analysis of spectra extracted from biological samples. Yet, the high number of measurements composing spectra, and the consequent high computational cost, make a direct network analysis unfeasible. We here present a comparative analysis of three customary feature selection algorithms, including the binning of spectral data and the use of information theory metrics. Such algorithms are compared by assessing the score obtained in a classification task, where healthy subjects and people suffering from different types of cancers should be discriminated. Results indicate that a feature selection strategy based on Mutual Information outperforms the more classical data binning, while allowing a reduction of the dimensionality of the data set in two orders of magnitude

Topology of a percolating soil pore network.

A connectivity function defined by the 3D-Euler number, is a topological indicator and can be related to hydraulic properties (Vogel and Roth, 2001). This study aims to develop connectivity Euler indexes as indicators of the ability of soils for fluid percolation. The starting point was a 3D grey image acquired by X-ray computed tomography of a soil at bulk density of 1.2 mg cm-3. This image was used in the simulation of 40000 particles following a directed random walk algorithms with 7 binarization thresholds. These data consisted of 7 files containing the simulated end points of the 40000 random walks, obtained in Ruiz-Ramos et al. (2010). MATLAB software was used for computing the frequency matrix of the number of particles arriving at every end point of the random walks and their 3D representation.

Decision boundary for discrete Bayesian network classifiers

Bayesian network classifiers are a powerful machine learning tool. In order to evaluate the expressive power of these models, we compute families of polynomials that sign-represent decision functions induced by Bayesian network classifiers. We prove that those families are linear combinations of products of Lagrange basis polynomials. In absence of V-structures in the predictor sub-graph, we are also able to prove that this family of polynomials does in- deed characterize the specific classifier considered. We then use this representation to bound the number of decision functions representable by Bayesian network classifiers with a given structure and we compare these bounds to the ones obtained using Vapnik-Chervonenkis dimension.

Rule Representation in Distributed Environments with Accepting Networks of Splicing Processors.

This paper presents the model named Accepting Networks of Evolutionary Processors as NP-problem solver inspired in the biological DNA operations. A processor has a rules set, splicing rules in this model,an object multiset and a filters set. Rules can be applied in parallel since there exists a large number of copies of objects in the multiset. Processors can form a graph in order to solve a given problem. This paper shows the network configuration in order to solve the SAT problem using linear resources and time. A rule representation arquitecture in distributed environments can be easily implemented using these networks of processors, such as decision support systems, as shown in the paper.

Decision boundary for discrete Bayesian network classifiers

Bayesian network classifiers are a powerful machine learning tool. In order to evaluate the expressive power of these models, we compute families of polynomials that sign-represent decision functions induced by Bayesian network classifiers. We prove that those families are linear combinations of products of Lagrange basis polynomials. In absence of V-structures in the predictor sub-graph, we are also able to prove that this family of polynomials does in- deed characterize the specific classifier considered. We then use this representation to bound the number of decision functions representable by Bayesian network classifiers with a given structure and we compare these bounds to the ones obtained using Vapnik-Chervonenkis dimension.

Learning Bayesian networks from data by the incremental compilation of new network polynomials

Probabilistic graphical models are a huge research field in artificial intelligence nowadays. The scope of this work is the study of directed graphical models for the representation of discrete distributions. Two of the main research topics related to this area focus on performing inference over graphical models and on learning graphical models from data. Traditionally, the inference process and the learning process have been treated separately, but given that the learned models structure marks the inference complexity, this kind of strategies will sometimes produce very inefficient models. With the purpose of learning thinner models, in this master thesis we propose a new model for the representation of network polynomials, which we call polynomial trees. Polynomial trees are a complementary representation for Bayesian networks that allows an efficient evaluation of the inference complexity and provides a framework for exact inference. We also propose a set of methods for the incremental compilation of polynomial trees and an algorithm for learning polynomial trees from data using a greedy score+search method that includes the inference complexity as a penalization in the scoring function.

Decision boundary for discrete Bayesian network classifiers

Bayesian network classifiers are a powerful machine learning tool. In order to evaluate the expressive power of these models, we compute families of polynomials that sign-represent decision functions induced by Bayesian network classifiers. We prove that those families are linear combinations of products of Lagrange basis polynomials. In absence of V -structures in the predictor sub-graph, we are also able to prove that this family of polynomials does indeed characterize the specific classifier considered. We then use this representation to bound the number of decision functions representable by Bayesian network classifiers with a given structure.

Multiple feature points representation in target localization of wireless visual sensor networks

This paper discusses the target localization problem in wireless visual sensor networks. Additive noises and measurement errors will affect the accuracy of target localization when the visual nodes are equipped with low-resolution cameras. In the goal of improving the accuracy of target localization without prior knowledge of the target, each node extracts multiple feature points from images to represent the target at the sensor node level. A statistical method is presented to match the most correlated feature point pair for merging the position information of different sensor nodes at the base station. Besides, in the case that more than one target exists in the field of interest, a scheme for locating multiple targets is provided. Simulation results show that, our proposed method has desirable performance in improving the accuracy of locating single target or multiple targets. Results also show that the proposed method has a better trade-off between camera node usage and localization accuracy.

The representation of the world in national Arab news agencies: an exploration of (trans)national networks in the official Arab media

The purpose of this paper is to draw a map of the representation of the world and of Arab states as reflected by the countries of the region. To do so, we have analysed the news (4,093 news randomly collected on February and August 2005) produced by the governments of the Arab states through their national news agencies. Several regional and world maps had been constructed to show the official Arab representation of the World, the Arab countries conflict agenda, the persistence of colonial ties (with the European metropolis) and the emergence of new relationships (Asian countries). The representation of the world that appeared in the analysis focuses its interest on the USA, the war in Iraq, the Israel-Palestine conflict, the United Kingdom, France, and Iran. The Arab regional powers organise the flow of information (Saudi Arabia and Egypt) and the colonial past determines the current structure of communication (French-speaking bloc and English-speaking bloc).

3D Maps Representation Using GNG

Current RGB-D sensors provide a big amount of valuable information for mobile robotics tasks like 3D map reconstruction, but the storage and processing of the incremental data provided by the different sensors through time quickly become unmanageable. In this work, we focus on 3D maps representation and propose the use of the Growing Neural Gas (GNG) network as a model to represent 3D input data. GNG method is able to represent the input data with a desired amount of neurons or resolution while preserving the topology of the input space. Experiments show how GNG method yields a better input space adaptation than other state-of-the-art 3D map representation methods.