Quasi-Independence, Homology and the Unity of Type: A Topological Theory of Characters

In this paper Lewontin’s notion of “quasi-independence” of characters is formalized as the assumption that a region of the phenotype space can be represented by a product space of orthogonal factors. In this picture each character corresponds to a factor of a region of the phenotype space. We consider any region of the phenotype space that has a given factorization as a “type”, i.e. as a set of phenotypes that share the same set of phenotypic characters. Using the notion of local factorizations we develop a theory of character identity based on the continuation of common factors among different regions of the phenotype space. We also consider the topological constraints on evolutionary transitions among regions with different regional factorizations, i.e. for the evolution of new types or body plans. It is shown that direct transition between different “types” is only possible if the transitional forms have all the characters that the ancestral and the derived types have and are thus compatible with the factorization of both types. Transitional forms thus have to go over a “complexity hump” where they have more quasi-independent characters than either the ancestral as well as the derived type. The only logical, but biologically unlikely, alternative is a “hopeful monster” that transforms in a single step from the ancestral type to the derived type. Topological considerations also suggest a new factor that may contribute to the evolutionary stability of “types”. It is shown that if the type is decomposable into factors which are vertex irregular (i.e. have states that are more or less preferred in a random walk), the region of phenotypes representing the type contains islands of strongly preferred states. In other words types have a statistical tendency of retaining evolutionary trajectories within their interior and thus add to the evolutionary persistence of types

Stochastic and complex dynamics in mesoscopic brain networks

The aim of this thesis is to deepen into the understanding of the mechanisms responsible for the generation of complex and stochastic dynamics, as well as emerging phenomena, in the human brain. We study typical features from the mesoscopic scale, i.e., the scale in which the dynamics is given by the activity of thousands or even millions of neurons. At this scale the synchronous activity of large neuronal populations gives rise to collective oscillations of the average voltage potential. These oscillations can easily be recorded using electroencephalography devices (EEG) or measuring the Local Field Potentials (LFPs). In Chapter 5 we show how the communication between two cortical columns (mesoscopic structures) can be mediated efficiently by a microscopic neural network. We use the synchronization of both cortical columns as a probe to ensure that an effective communication is established between the three neural structures. Our results indicate that there are certain dynamical regimes from the microscopic neural network that favor the correct communication between the cortical columns: therefore, if the LFP frequency of the neural network is of around 40Hz, the synchronization between the cortical columns is more robust compared to the situation in which the neural network oscillates at a lower frequency (10Hz). However, microscopic topological characteristics of the network also influence communication, being a small-world structure the one that best promotes the synchronization of the cortical columns. Finally, this Chapter shows how the mediation exerted by the neural network cannot be substituted by the average of its activity, that is, the dynamic properties of the microscopic neural network are essential for the proper transmission of information between all neural structures. The oscillatory brain electrical activity is largely dependent on the interplay between excitation and inhibition. In Chapter 6 we study how groups of cortical columns show complex patterns of cortical excitation and inhibition taking into account their topological features and the strength of their couplings. These cortical columns segregate between those dominated by excitation and those dominated by inhibition, affecting the synchronization properties of networks of cortical columns. In Chapter 7 we study a dynamic regime by which complex patterns of synchronization between chaotic oscillators appear spontaneously in a network. We show what conditions must a set of coupled dynamical systems fulfill in order to display heterogeneity in synchronization. Therefore, our results are related to the complex phenomenon of synchronization in the brain, which is a focus of study nowadays. Finally, in Chapter 8 we study the ability of the brain to compute and process information. The novelty here is our use of complex synchronization in the brain in order to implement basic elements of Boolean computation. In this way, we show that the partial synchronization of the oscillations in the brain establishes a code in terms of synchronization / non-synchronization (1/0, respectively), and thus all simple Boolean functions can be implemented (AND, OR, XOR, etc.). We also show that complex Boolean functions, such as a flip-flop memory, can be constructed in terms of states of dynamic synchronization of brain oscillations.L'objectiu d'aquesta Tesi és aprofundir en la comprensió dels mecanismes responsables de la generació de dinàmica complexa i estocàstica, així com de fenòmens emergents, en el cervell humà. Estudiem la fenomenologia característica de l'escala mesoscòpica, és a dir, aquella en la que la dinàmica característica ve donada per l'activitat de milers de neurones. En aquesta escala l'activitat síncrona de grans poblacions neuronals dóna lloc a un fenomen col·lectiu pel qual es produeixen oscil·lacions del seu potencial mitjà. Aquestes oscil·lacions poden ser fàcilment enregistrades mitjançant aparells d'electroencefalograma (EEG) o enregistradors de Potencials de Camp Local (LFP). En el Capítol 5 mostrem com la comunicació entre dos columnes corticals (estructures mesoscòpiques) pot ser conduïda de forma eficient per una xarxa neuronal microscòpica. De fet, emprem la sincronització de les dues columnes corticals per comprovar que s'ha establert una comunicació efectiva entre les tres estructures neuronals. Els resultats indiquen que hi ha règims dinàmics de la xarxa neuronal microscòpica que afavoreixen la correcta comunicació entre les columnes corticals: si la freqüència típica de LFP a la xarxa neuronal està al voltant dels 40Hz la sincronització entre les columnes corticals és més robusta que a una menor freqüència (10Hz). La topologia de la xarxa microscòpica també influeix en la comunicació, essent una estructura de tipus món petit (small-world) la que més afavoreix la sincronització. Finalment, la mediació de xarxa neuronal no pot ser substituïda per la mitjana de la seva activitat, és a dir, les propietats dinàmiques microscòpiques són imprescindibles per a la correcta transmissió d'informació entre totes les escales cerebrals. L'activitat elèctrica oscil·latòria cerebral ve donada en gran mesura per la interacció entre excitació i inhibició neuronal. En el Capítol 6 estudiem com grups de columnes corticals mostren patrons complexos d'excitació i inhibició segons quina sigui la seva topologia i d'acoblament. D'aquesta manera les columnes corticals se segreguen entre aquelles dominades per l'excitació i aquelles dominades per la inhibició, influint en les capacitats de sincronització de xarxes de columnes corticals. En el Capítol 7 estudiem un règim dinàmic segons el qual patrons complexos de sincronització apareixen espontàniament en xarxes d'oscil·ladors caòtics. Mostrem quines condicions s'han de donar en un conjunt de sistemes dinàmics acoblats per tal de mostrar heterogeneïtat en la sincronització, és a dir, coexistència de sincronitzacions. D'aquesta manera relacionem els nostres resultats amb el fenomen de sincronització complexa en el cervell. Finalment, en el Capítol 8 estudiem com el cervell computa i processa informació. La novetat aquí és l'ús que fem de la sincronització complexa de columnes corticals per tal d'implementar elements bàsics de computació Booleana. Mostrem com la sincronització parcial de les oscil·lacions cerebrals estableix un codi neuronal en termes de sincronització/no sincronització (1/0, respectivament) amb el qual totes les funcions Booleanes simples poden ésser implementades (AND, OR, XOR, etc). Mostrem, també, com emprant xarxes mesoscòpiques extenses les capacitats de computació creixen proporcionalment. Així funcions Booleanes complexes, com una memòria del tipus flip-flop, pot ésser construïda en termes d'estats de sincronització dinàmica d'oscil·lacions cerebrals.Postprint (published version

Contributions of Continuous Max-Flow Theory to Medical Image Processing

Discrete graph cuts and continuous max-flow theory have created a paradigm shift in many areas of medical image processing. As previous methods limited themselves to analytically solvable optimization problems or guaranteed only local optimizability to increasingly complex and non-convex functionals, current methods based now rely on describing an optimization problem in a series of general yet simple functionals with a global, but non-analytic, solution algorithms. This has been increasingly spurred on by the availability of these general-purpose algorithms in an open-source context. Thus, graph-cuts and max-flow have changed every aspect of medical image processing from reconstruction to enhancement to segmentation and registration. To wax philosophical, continuous max-flow theory in particular has the potential to bring a high degree of mathematical elegance to the field, bridging the conceptual gap between the discrete and continuous domains in which we describe different imaging problems, properties and processes. In Chapter 1, we use the notion of infinitely dense and infinitely densely connected graphs to transfer between the discrete and continuous domains, which has a certain sense of mathematical pedantry to it, but the resulting variational energy equations have a sense of elegance and charm. As any application of the principle of duality, the variational equations have an enigmatic side that can only be decoded with time and patience. The goal of this thesis is to show the contributions of max-flow theory through image enhancement and segmentation, increasing incorporation of topological considerations and increasing the role played by user knowledge and interactivity. These methods will be rigorously grounded in calculus of variations, guaranteeing fuzzy optimality and providing multiple solution approaches to addressing each individual problem

Spatio-Temporal Data Handling for Generic Mobile Geoinformation Systems

Within this thesis, a workflow for an efficient and practical handling of spatio-temporal data is presented. This workflow consists of three layered parts. The first part is the efficient management of spatio-temporal data. The second part focuses on the development of Web services for the dissemination of spatio-temporal data. The third part is a generic mobile GIS for professional users as a typical application for the spatio-temporal data management model and the related Web services

Fuzzy Sets, Fuzzy Logic and Their Applications 2020

The present book contains the 24 total articles accepted and published in the Special Issue “Fuzzy Sets, Fuzzy Logic and Their Applications, 2020” of the MDPI Mathematics journal, which covers a wide range of topics connected to the theory and applications of fuzzy sets and systems of fuzzy logic and their extensions/generalizations. These topics include, among others, elements from fuzzy graphs; fuzzy numbers; fuzzy equations; fuzzy linear spaces; intuitionistic fuzzy sets; soft sets; type-2 fuzzy sets, bipolar fuzzy sets, plithogenic sets, fuzzy decision making, fuzzy governance, fuzzy models in mathematics of finance, a philosophical treatise on the connection of the scientific reasoning with fuzzy logic, etc. It is hoped that the book will be interesting and useful for those working in the area of fuzzy sets, fuzzy systems and fuzzy logic, as well as for those with the proper mathematical background and willing to become familiar with recent advances in fuzzy mathematics, which has become prevalent in almost all sectors of the human life and activity

Isometry Invariant Shape Priors for Variational Image Segmentation

Variational methods play a fundamental role in mathematical image analysis as a bridge between models and algorithms. A major challenge is to formulate a given model as a feasible optimization problem. There has been a huge leap in that respect concerning local data models in the framework of convex relaxation. But non-local concepts such as the shape of a sought-after object are still difficult to implement. In this thesis we study mathematical representations for shapes and develop shape prior functionals for object segmentation based thereon. A particular focus is set on the isometry invariance of the functionals and the compatibility with existing convex functionals for image labelling. Optimal transport is used as a central modelling and computational tool to compute registrations between different shapes as a basis for a shape similarity measure. This point of view leads to a link between the two somewhat dual representations of a shape by the region it occupies and its outline, allowing to combine their respective strengths. Naively the computational complexity implied by the derived functionals is unfeasible. Therefore suitable hierarchical optimization methods are developed

Towards music perception by redundancy reduction and unsupervised learning in probabilistic models

PhDThe study of music perception lies at the intersection of several disciplines: perceptual psychology and cognitive science, musicology, psychoacoustics, and acoustical signal processing amongst others. Developments in perceptual theory over the last fifty years have emphasised an approach based on Shannon’s information theory and its basis in probabilistic systems, and in particular, the idea that perceptual systems in animals develop through a process of unsupervised learning in response to natural sensory stimulation, whereby the emerging computational structures are well adapted to the statistical structure of natural scenes. In turn, these ideas are being applied to problems in music perception. This thesis is an investigation of the principle of redundancy reduction through unsupervised learning, as applied to representations of sound and music. In the first part, previous work is reviewed, drawing on literature from some of the fields mentioned above, and an argument presented in support of the idea that perception in general and music perception in particular can indeed be accommodated within a framework of unsupervised learning in probabilistic models. In the second part, two related methods are applied to two different low-level representations. Firstly, linear redundancy reduction (Independent Component Analysis) is applied to acoustic waveforms of speech and music. Secondly, the related method of sparse coding is applied to a spectral representation of polyphonic music, which proves to be enough both to recognise that the individual notes are the important structural elements, and to recover a rough transcription of the music. Finally, the concepts of distance and similarity are considered, drawing in ideas about noise, phase invariance, and topological maps. Some ecologically and information theoretically motivated distance measures are suggested, and put in to practice in a novel method, using multidimensional scaling (MDS), for visualising geometrically the dependency structure in a distributed representation.Engineering and Physical Science Research Counci

Community detection in graphs

The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of the same cluster and comparatively few edges joining vertices of different clusters. Such clusters, or communities, can be considered as fairly independent compartments of a graph, playing a similar role like, e. g., the tissues or the organs in the human body. Detecting communities is of great importance in sociology, biology and computer science, disciplines where systems are often represented as graphs. This problem is very hard and not yet satisfactorily solved, despite the huge effort of a large interdisciplinary community of scientists working on it over the past few years. We will attempt a thorough exposition of the topic, from the definition of the main elements of the problem, to the presentation of most methods developed, with a special focus on techniques designed by statistical physicists, from the discussion of crucial issues like the significance of clustering and how methods should be tested and compared against each other, to the description of applications to real networks.Comment: Review article. 103 pages, 42 figures, 2 tables. Two sections expanded + minor modifications. Three figures + one table + references added. Final version published in Physics Report