Skip to main content

INTEGRACION DE MODELOS BIOINFORMATICOS, COGNITIVOS Y DE ANATOMIA COMPUTACIONAL PARA LA MEJORA DEL DIAGNOSTICO DE ENFERMEDADES NEURODEGENERATIVAS

TIN2016-80347-R

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Call Proyectos I+D+i Retos de Investigación
Call year 2016
State Plan 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSIDAD DE ZARAGOZA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 28
Encontrada(s) 1 página(s)

Repositorio Digital de la UPF
Publication Artículo científico (JournalArticle)

Scaling of sensory information in large neural populations shows signatures of information-limiting correlations

  • Kafashan, MohammadMehdi
  • Jaffe, Anna W.
  • Chettih, Selmaan N.
  • Nogueira, Ramon
  • Arandía Romero, Iñigo
  • Harvey, Christopher D.
  • Moreno Bote, Rubén
  • Drugowitsch, Jan
How is information distributed across large neuronal populations within a given brain area? Information may be distributed roughly evenly across neuronal populations, so that total information scales linearly with the number of recorded neurons. Alternatively, the neural code might be highly redundant, meaning that total information saturates. Here we investigate how sensory information about the direction of a moving visual stimulus is distributed across hundreds of simultaneously recorded neurons in mouse primary visual cortex. We show that information scales sublinearly due to correlated noise in these populations. We compartmentalized noise correlations into information-limiting and nonlimiting components, then extrapolate to predict how information grows with even larger neural populations. We predict that tens of thousands of neurons encode 95% of the information about visual stimulus direction, much less than the number of neurons in primary visual cortex. These findings suggest that the brain uses a widely distributed, but nonetheless redundant code that supports recovering most sensory information from smaller subpopulations., We would like to thank Alexandre Pouget, Peter Latham, and members of the HMS Neurobiology Department for useful discussions and feedback on the work, and Rachel Wilson and Richard Born for comments on early versions of the manuscript. The work was supported by a scholar award from the James S. McDonnell Foundation (grant# 220020462 to J.D.), grants from the NIH (R01MH115554 to J.D.; R01MH107620 to C.D.H.; R01NS089521 to C.D.H.; R01NS108410 to C.D.H.; F31EY031562 to A.W.J.), the NSF’s NeuroNex program (DBI-1707398. to R.N.), MINECO (Spain; BFU2017-85936-P to R.M.-B.), the Howard Hughes Medical Institute (HHMI, ref 55008742 to R.M.-B.), the ICREA Academia (2016 to R.M.-B.), the Government of Aragon (Spain; ISAAC lab, cod T33 17D to I.A.-R.), the Spanish Ministry of Economy and Competitiveness (TIN2016-80347-R to I.A.-R.), the Gatsby Charitable Foundation (to R.N.), and an NSF Graduate Research Fellowship (to A.W.J.).
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Machine learning classifier for identification of damaging missense mutations exclusive to human mitochondrial DNA-encoded polypeptides

  • Martín Navarro, Antonio
  • Gaudioso Simón, Andrés
  • Álvarez Jarreta, Jorge
  • Montoya, Julio
  • Mayordomo, Elvira
  • Ruiz Pesini, Eduardo
Background: Several methods have been developed to predict the pathogenicity of missense mutations but none has been specifically designed for classification of variants in mtDNA-encoded polypeptides. Moreover, there is not available curated dataset of neutral and damaging mtDNA missense variants to test the accuracy of predictors. Because mtDNA sequencing of patients suffering mitochondrial diseases is revealing many missense mutations, it is needed to prioritize candidate substitutions for further confirmation. Predictors can be useful as screening tools but their performance must be improved. Results: We have developed a SVM classifier (Mitoclass.1) specific for mtDNA missense variants. Training and validation of the model was executed with 2,835 mtDNA damaging and neutral amino acid substitutions, previously curated by a set of rigorous pathogenicity criteria with high specificity. Each instance is described by a set of three attributes based on evolutionary conservation in Eukaryota of wildtype and mutant amino acids as well as coevolution and a novel evolutionary analysis of specific substitutions belonging to the same domain of mitochondrial polypeptides. Our classifier has performed better than other web-available tested predictors. We checked performance of three broadly used predictors with the total mutations of our curated dataset. PolyPhen-2 showed the best results for a screening proposal with a good sensitivity. Nevertheless, the number of false positive predictions was too high. Our method has an improved sensitivity and better specificity in relation to PolyPhen-2. We also publish predictions for the complete set of 24,201 possible missense variants in the 13 human mtDNA-encoded polypeptides. Conclusions: Mitoclass.1 allows a better selection of candidate damaging missense variants from mtDNA. A careful search of discriminatory attributes and a training step based on a curated dataset of amino acid substitutions belonging exclusively to human mtDNA genes allows an improved performance. Mitoclass.1 accuracy could be improved in the future when more mtDNA missense substitutions will be available for updating the attributes and retraining the model.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Netlang: A software for the linguistic analysis of corpora by means of complex networks

  • Barceló-Coblijn, L.
  • Serna Salazar, D.
  • Isaza, G.
  • Castillo Ossa, L.F.
  • González Bedia, M.
To date there is no software that directly connects the linguistic analysis of a conversation to a network program. Networks programs are able to extract statistical information from data basis with information about systems of interacting elements. Language has also been conceived and studied as a complex system. However, most proposals do not analyze language according to linguistic theory, but use instead computational systems that should save time at the price of leaving aside many crucial aspects for linguistic theory. Some approaches to network studies on language do apply precise linguistic analyses, made by a linguist. The problem until now has been the lack of interface between the analysis of a sentence and its integration into the network that could be managed by a linguist and that could save the analysis of any language. Previous works have used old software that was not created for these purposes and that often produced problems with some idiosyncrasies of the target language. The desired interface should be able to deal with the syntactic peculiarities of a particular language, the options of linguistic theory preferred by the user and the preservation of morpho-syntactic information (lexical categories and syntactic relations between items). Netlang is the first program able to do that. Recently, a new kind of linguistic analysis has been developed, which is able to extract a complexity pattern from the speaker’s linguistic production which is depicted as a network where words are inside nodes, and these nodes connect each other by means of edges or links (the information inside the edge can be syntactic, semantic, etc.). The Netlang software has become the bridge between rough linguistic data and the network program. Netlang has integrated and improved the functions of programs used in the past, namely the DGA annotator and two scripts (ToXML.pl and Xml2Pairs.py) used for transforming and pruning data. Netlang allows the researcher to make accurate linguistic analysis by means of syntactic dependency relations between words, while tracking record of the nature of such syntactic relationships (subject, object, etc). The Netlang software is presented as a new tool that solve many problems detected in the past. The most important improvement is that Netlang integrates three past applications into one program, and is able to produce a series of file formats that can be read by a network program. Through the Netlang software, the linguistic network analysis based on syntactic analyses, characterized for its low cost and the completely non-invasive procedure aims to evolve into a sufficiently fine grained tool for clinical diagnosis in potential cases of language disorders.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Rhythms of the Collective Brain: Metastable Synchronization and Cross-Scale Interactions in Connected Multitudes

  • Aguilera, M.
Crowd behaviour challenges our fundamental understanding of social phenomena. Involving complex interactions between multiple temporal and spatial scales of activity, its governing mechanisms defy conventional analysis. Using 1.5 million Twitter messages from the 15M movement in Spain as an example of multitudinous self-organization, we describe the coordination dynamics of the system measuring phase-locking statistics at different frequencies using wavelet transforms, identifying 8 frequency bands of entrained oscillations between 15 geographical nodes. Then we apply maximum entropy inference methods to describe Ising models capturing transient synchrony in our data at each frequency band. The models show that (1) all frequency bands of the system operate near critical points of their parameter space and (2) while fast frequencies present only a few metastable states displaying all-or-none synchronization, slow frequencies present a diversity of metastable states of partial synchronization. Furthermore, describing the state at each frequency band using the energy of the corresponding Ising model, we compute transfer entropy to characterize cross-scale interactions between frequency bands, showing (1) a cascade of upward information flows in which each frequency band influences its contiguous slower bands and (2) downward information flows where slow frequencies modulate distant fast frequencies.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Adaptive and cooperative model of knowledge management in MOOCs

  • Sein-Echaluce, María Luisa
  • Fidalgo-Blanco, Ángel
  • García-Peñalvo, Francisco J.
One of the characteristics of Massive Open Online Courses (MOOC) is the heterogeneity of their participants’ profiles and, for the most traditional MOOC model, this is an important cause of the low completion rate. The MOOC model presents two apparent antagonistic concepts, globalization and diversity. MOOCs represent globalization (participants have to be adapted to the course) and their participants represent diversity. The authors of this paper argue that both concepts complement each other; that is, a MOOC can adapt the contents and navigation to the diversity of participants; and in turn the participants themselves can increase and improve the contents of the MOOC, through heterogeneous cooperation, to encourage massive learning. To proof it, this paper presents a new model, called ahMOOC, combining the hybrid-MOOC (hMOOC) and the adaptive MOOC (aMOOC). The hMOOC allows integrating characteristics of xMOOCs (based on formal e-training) with cMOOCs (based on informal and cooperative e-training). The aMOOC offers different learning strategies adapted to different learning objectives, profiles, learning styles, etc. of participants. The ahMOOCs continues having a lower dropout rate (such as hMOOC) than the traditional MOOCs. The qualitative analysis show the capacity of participants, with heterogeneous profiles, to create, in a cooperative and massive way, useful knowledge to improve the course and, later, to apply it in their specific work context. The study also shows that participants have a good perception on the capabilities of the ahMOOC to adapt the learning process to their profiles and preferences.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Adaptation to criticality through organizational invariance in embodied agents

  • Aguilera, M.
  • González Bedia, M.
Many biological and cognitive systems do not operate deep within one or other regime of activity. Instead, they are poised at critical points located at phase transitions in their parameter space. The pervasiveness of criticality suggests that there may be general principles inducing this behaviour, yet there is no well-founded theory for understanding how criticality is generated at a wide span of levels and contexts. In order to explore how criticality might emerge from general adaptive mechanisms, we propose a simple learning rule that maintains an internal organizational structure from a specific family of systems at criticality. We implement the mechanism in artificial embodied agents controlled by a neural network maintaining a correlation structure randomly sampled from an Ising model at critical temperature. Agents are evaluated in two classical reinforcement learning scenarios: the Mountain Car and the Acrobot double pendulum. In both cases the neural controller appears to reach a point of criticality, which coincides with a transition point between two regimes of the agent''s behaviour. These results suggest that adaptation to criticality could be used as a general adaptive mechanism in some circumstances, providing an alternative explanation for the pervasive presence of criticality in biological and cognitive systems.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Exploring Criticality as a Generic Adaptive Mechanism

  • Aguilera, M.
  • Bedia, M.G.
The activity of many biological and cognitive systems is not poised deep within a specific regime of activity. Instead, they operate near points of critical behavior located at the boundary between different phases. Certain authors link some of the properties of criticality with the ability of living systems to generate autonomous or intrinsically generated behavior. However, these claims remain highly speculative. In this paper, we intend to explore the connection between criticality and autonomous behavior through conceptual models that show how embodied agents may adapt themselves toward critical points. We propose to exploit maximum entropy models and their formal descriptions of indicators of criticality to present a learning model that drives generic agents toward critical points. Specifically, we derive such a learning model in an embodied Boltzmann machine by implementing a gradient ascent rule that maximizes the heat capacity of the controller in order to make the network maximally sensitive to external perturbations. We test and corroborate the model by implementing an embodied agent in the Mountain Car benchmark test, which is controlled by a Boltzmann machine that adjusts its weights according to the model. We find that the neural controller reaches an apparent point of criticality, which coincides with a transition point of the behavior of the agent between two regimes of behavior, maximizing the synergistic information between its sensors and the combination of hidden and motor neurons. Finally, we discuss the potential of our learning model to answer questions about the connection between criticality and the capabilities of living systems to autonomously generate intrinsic constraints on their behavior. We suggest that these "critical agents" are able to acquire flexible behavioral patterns that are useful for the development of successful strategies in different contexts.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Effective Hausdorff Dimension in General Metric Spaces

  • Mayordomo, E.
We introduce the concept of effective dimension for a wide class of metric spaces whose metric is not necessarily based on a measure. Effective dimension was defined by Lutz (Inf. Comput., 187(1), 49–79, 2003) for Cantor space and has also been extended to Euclidean space. Lutz effectivization uses gambling, in particular the concept of gale and supergale, our extension of Hausdorff dimension to other metric spaces is also based on a supergale characterization of dimension, which in practice avoids an extra quantifier present in the classical definition of dimension that is based on Hausdorff measure and therefore allows effectivization for small time-bounds. We present here the concept of constructive dimension and its characterization in terms of Kolmogorov complexity, for which we extend the concept of Kolmogorov complexity to any metric space defining the Kolmogorov complexity of a point at a certain precision. Further research directions are indicated.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Integrated information in the thermodynamic limit

  • Aguilera, M.
  • Di Paolo E.A.
The capacity to integrate information is a prominent feature of biological, neural, and cognitive processes. Integrated Information Theory (IIT) provides mathematical tools for quantifying the level of integration in a system, but its computational cost generally precludes applications beyond relatively small models. In consequence, it is not yet well understood how integration scales up with the size of a system or with different temporal scales of activity, nor how a system maintains integration as it interacts with its environment. After revising some assumptions of the theory, we show for the first time how modified measures of information integration scale when a neural network becomes very large. Using kinetic Ising models and mean-field approximations, we show that information integration diverges in the thermodynamic limit at certain critical points. Moreover, by comparing different divergent tendencies of blocks that make up a system at these critical points, we can use information integration to delimit the boundary between an integrated unit and its environment. Finally, we present a model that adaptively maintains its integration despite changes in its environment by generating a critical surface where its integrity is preserved. We argue that the exploration of integrated information for these limit cases helps in addressing a variety of poorly understood questions about the organization of biological, neural, and cognitive systems.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

PDE-constrained LDDMM via geodesic shooting and inexact Gauss-Newton-Krylov optimization using the incremental adjoint Jacobi equations

  • Hernandez, M.
The class of non-rigid registration methods proposed in the framework of PDE-constrained large deformation diffeomorphic metric mapping is a particularly interesting family of physically meaningful diffeomorphic registration methods. Inexact Gauss-Newton-Krylov optimization has shown an excellent numerical accuracy and an extraordinarily fast convergence rate in this framework. However, the Galerkin representation of the non-stationary velocity fields does not provide proper geodesic paths. In this work, we propose a method for PDE-constrained LDDMM parameterized in the space of initial velocity fields under the EPDiff equation. The derivation of the gradient and the Hessian-vector products are performed on the final velocity field and transported backward using the adjoint and the incremental adjoint Jacobi equations. This way, we avoid the complex dependence on the initial velocity field in the computations. We also avoid the computation of the adjoint equation and its incremental counterpart that has been recently identified as a subtle problem in PDE-constrained LDDMM. The proposed method provides geodesics in the framework of PDE-constrained LDDMM, and it shows performance competing with benchmark PDE-constrained LDDMM and EPDiff-LDDMM methods.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Scaling behaviour and critical phase transitions in integrated information theory

  • Aguilera, Miguel
Integrated Information Theory proposes a measure of conscious activity (Phi), characterised as the irreducibility of a dynamical system to the sum of its components. Due to its computational cost, current versions of the theory (IIT 3.0) are difficult to apply to systems larger than a dozen units, and, in general, it is not well known how integrated information scales as systems grow larger in size. In this article, we propose to study the scaling behaviour of integrated information in a simple model of a critical phase transition: an infinite-range kinetic Ising model. In this model, we assume a homogeneous distribution of couplings to simplify the computation of integrated information. This simplified model allows us to critically review some of the design assumptions behind the measure and connect its properties with well-known phenomena in phase transitions in statistical mechanics. As a result, we point to some aspects of the mathematical definitions of IIT that 3.0 fail to capture critical phase transitions and propose a reformulation of the assumptions made by integrated information measures.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

A minimal turing test: reciprocal sensorimotor contingencies for interaction detection

  • Barone, Pamela
  • González Bedia, Manuel
  • Gomila, Antoni
In the classical Turing test, participants are challenged to tell whether they are interacting with another human being or with a machine. The way the interaction takes place is not direct, but a distant conversation through computer screen messages. Basic forms of interaction are face-to-face and embodied, context-dependent and based on the detection of reciprocal sensorimotor contingencies. Our idea is that interaction detection requires the integration of proprioceptive and interoceptive patterns with sensorimotor patterns, within quite short time lapses, so that they appear as mutually contingent, as reciprocal. In other words, the experience of interaction takes place when sensorimotor patterns are contingent upon one’s own movements, and vice versa. I react to your movement, you react to mine. When I notice both components, I come to experience an interaction. Therefore, we designed a “minimal” Turing test to investigate how much information is required to detect these reciprocal sensorimotor contingencies. Using a new version of the perceptual crossing paradigm, we tested whether participants resorted to interaction detection to tell apart human from machine agents in repeated encounters with these agents. In two studies, we presented participants with movements of a human agent, either online or offline, and movements of a computerized oscillatory agent in three different blocks. In each block, either auditory or audiovisual feedback was provided along each trial. Analysis of participants’ explicit responses and of the implicit information subsumed in the dynamics of their series will reveal evidence that participants use the reciprocal sensorimotor contingencies within short time windows. For a machine to pass this minimal Turing test, it should be able to generate this sort of reciprocal contingencies.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Asymptotic divergences and strong dichotomy

  • Huang, Xiang
  • Lutz, Jack H.
  • Mayordomo, Elvira
  • Stull, Donald M.
The Schnorr-Stimm dichotomy theorem [31] concerns finite-state gamblers that bet on infinite sequences of symbols taken from a finite alphabet S. The theorem asserts that, for any such sequence S, the following two things are true. (1) If S is not normal in the sense of Borel (meaning that every two strings of equal length appear with equal asymptotic frequency in S), then there is a finite-state gambler that wins money at an infinitely-often exponential rate betting on S. (2) If S is normal, then any finite-state gambler betting on S loses money at an exponential rate betting on S. In this paper we use the Kullback-Leibler divergence to formulate the lower asymptotic divergence div(S||a) of a probability measure a on S from a sequence S over S and the upper asymptotic divergence Div(S||a) of a from S in such a way that a sequence S is a-normal (meaning that every string w has asymptotic frequency a(w) in S) if and only if Div(S||a) = 0. We also use the Kullback-Leibler divergence to quantify the total risk RiskG(w) that a finite-state gambler G takes when betting along a prefix w of S. Our main theorem is a strong dichotomy theorem that uses the above notions to quantify the exponential rates of winning and losing on the two sides of the Schnorr-Stimm dichotomy theorem (with the latter routinely extended from normality to a-normality). Modulo asymptotic caveats in the paper, our strong dichotomy theorem says that the following two things hold for prefixes w of S. (10) The infinitely-often exponential rate of winning in 1 is 2Div(S||a)|w| . (20) The exponential rate of loss in 2 is 2-RiskG(w) . We also use (10) to show that 1 - Div(S||a)/c, where c = log(1/mina¿S a(a)), is an upper bound on the finite-state a-dimension of S and prove the dual fact that 1 - div(S||a)/c is an upper bound on the finite-state strong a-dimension of S.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Asymptotic Divergences and Strong Dichotomy

  • Huang, Xiang
  • Lutz, Jack H
  • Mayordomo, Elvira
  • Stull, Donald M
—The Schnorr-Stimm dichotomy theorem [31] concerns finite-state gamblers that bet on infinite sequences of symbols taken from a finite alphabet Σ. The theorem asserts that, or any such sequence S, the following two things are true. (1) If S is not normal in the sense of Borel (meaning that every two strings of equal length appear with equal asymptotic frequency in S), then there is a finite-state gambler that wins money at an infinitely-often exponential rate betting on S. (2) If S is normal, then any finite-state gambler loses money at an exponential rate betting on S. In this paper we use the Kullback-Leibler divergence to formulate the lower asymptotic divergence div(S||α) of a probability measure α on Σ from a sequence S over Σ and the upper asymptotic divergence Div(S||α) of α from S in such a way that a sequence S is α-normal (meaning that every string w has asymptotic frequency α(w) in S) if and only if Div(S||α) = 0. We also use the Kullback-Leibler divergence to quantify the total risk RiskG(w) that a finite-state gambler G takes when betting along a prefix w of S. Our main theorem is a strong dichotomy theorem that uses the above notions to quantify the exponential rates of winning and losing on the two sides of the Schnorr-Stimm dichotomy theorem (with the latter routinely extended from normality to αnormality). Modulo asymptotic caveats in the paper, our strong dichotomy theorem says that the following two things hold for prefixes w of S. (10 ) The infinitely-often exponential rate of winning in 1 is 2 Div(S||α)|w| . (20 ) The exponential rate of loss in 2 is 2 − RiskG(w) . We also use (10 ) to show that 1 − Div(S||α)/c, where c = log(1/mina∈Σ α(a)), is an upper bound on the finite-state αdimension of S and prove the dual fact that 1 − div(S||α)/c is an upper bound on the finite-state strong α-dimension of S.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Combining the Band-Limited Parameterization and Semi-Lagrangian Runge–Kutta Integration for Efficient PDE-Constrained LDDMM

  • Hernandez, M.
The family of PDE-constrained Large Deformation Diffeomorphic Metric Mapping (LDDMM) methods is emerging as a particularly interesting approach for physically meaningful diffeomorphic transformations. The original combination of Gauss–Newton–Krylov optimization and Runge–Kutta integration shows excellent numerical accuracy and fast convergence rate. However, its most significant limitation is the huge computational complexity, hindering its extensive use in Computational Anatomy applied studies. This limitation has been treated independently by the problem formulation in the space of band-limited vector fields and semi-Lagrangian integration. The purpose of this work is to combine both in three variants of band-limited PDE-constrained LDDMM for further increasing their computational efficiency. The accuracy of the resulting methods is evaluated extensively. For all the variants, the proposed combined approach shows a significant increment of the computational efficiency. In addition, the variant based on the deformation state equation is positioned consistently as the best performing method across all the evaluation frameworks in terms of accuracy and efficiency.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Computing absolutely normal numbers in nearly linear time

  • Lutz, Jack H
  • Mayordomo, Elvira
A real number x is absolutely normal if, for every base b ≥ 2, every two equally long strings of digits appear with equal asymptotic frequency in the base-b expansion of x. This paper presents an explicit algorithm that generates the binary expansion of an absolutely normal number x, with the nth bit of x appearing after npolylog(n) computation steps. This speed is achieved by simultaneously computing and diagonalizing against a martingale that incorporates Lempel-Ziv parsing algorithms in all bases.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Contribución de congreso (ConferenceOutput)

Extending the Reach of the Point-To-Set Principle

  • Lutz, Jack H
  • Lutz, Neil
  • Mayordomo Cámara, Elvira
The point-to-set principle of J. Lutz and N. Lutz (2018) has recently enabled the theory of computing to be used to answer open questions about fractal geometry in Euclidean spaces Rn. These are classical questions, meaning that their statements do not involve computation or related aspects of logic. In this paper we extend the reach of the point-to-set principle from Euclidean spaces to arbitrary separable metric spaces X. We first extend two fractal dimensions – computability-theoretic versions of classical Hausdorff and packing dimensions that assign dimensions dim(x) and Dim(x) to individual points x ∈ X – to arbitrary separable metric spaces and to arbitrary gauge families. Our first two main results then extend the point-to-set principle to arbitrary separable metric spaces and to a large class of gauge families. We demonstrate the power of our extended point-to-set principle by using it to prove new theorems about classical fractal dimensions in hyperspaces. (For a concrete computational example, the stages E0, E1, E2, . . . used to construct a self-similar fractal E in the plane are elements of the hyperspace of the plane, and they converge to E in the hyperspace.) Our third main result, proven via our extended point-to-set principle, states that, under a wide variety of gauge families, the classical packing dimension agrees with the classical upper Minkowski dimension on all hyperspaces of compact sets. We use this theorem to give, for all sets E that are analytic, i.e., Σ1 1, a tight bound on the packing dimension of the hyperspace of E in terms of the packing dimension of E itself.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Una generalización del teorema de proyección de Marstrand

  • Mayordomo Cámara, Elvira
Marstrand cuantificó la dimensión de Hausdorff de (casi todas) las proyecciones ortogonales de un conjunto analítico. Recientemente este resultado ha sido generalizado por Lutz y Stull para algunos casos no analíticos, utilizando en su demostración la dimensión efectiva y el principio de punto a conjunto. La dimensión efectiva tiene sus raíces en la computabilidad y la teoría de la información y en este artículo introducimos sus principales ideas a través de la demostración de Lutz y Stull.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

A phylogenetic study of covid-19 data from Aragon and Catalonia over a year: learning bioinformatics during a world pandemic

  • Peña, F
  • García Díaz, A.
  • Gómez González, A.
  • Martín Marcos, A.
  • Romeo, A.
  • Sánchez Aquilué, J. M.
  • Vallés, A.
  • Mayordomo, E.
Presentamos aquí un análisis de variabilidad durante un año del virus SARS-CoV-2 en el área de Aragón, comparándolo con la vecina Cataluña y centrándonos en la variante del Reino Unido. La investigación se realizó dentro de un curso de Bioinformática. Se extrajeron tanto una evaluación detallada sobre el valor de esta metodología como conclusiones novedosas de la investigación.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

VoxelMorph based Normalization in the Prediction of Stable VS Progressive MCI Conversion with Convolutional Neural Networks

  • Sierra Tome, Daniel
  • Júlvez, Ubaldo Ramón
  • Hernández, Mónica
  • Mayordomo, Elvira
El presente trabajo tiene como objetivo estudiar el efecto de la normalización en el sistema de clasificación de Spasov2019 [2] para el problema de deterioro cognitivo leve estable vs progresivo (sMCI vs pMCI), cuando esta normalización proviene de un algoritmo de deep-learning. Se ha elegido VoxelMorph [8], por ser uno de los algoritmos más utilizados como benchmark desde la introducción del deep-learning en el registro deformable de imágenes médicas. Se realizará una comparativa entre los métodos de registro difeomorfo tradicionales y VoxelMorph para este problema.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Extending the reach of the point-to-set principle

  • Lutz, Jack H.
  • Lutz, Neil
  • Mayordomo, Elvira
The point-to-set principle of J. Lutz and N. Lutz (2018) has recently enabled the theory of computing to be used to answer open questions about fractal geometry in Euclidean spaces [Rn]. These are classical questions, meaning that their statements do not involve computation or related aspects of logic. In this paper we extend the reach of the point-to-set principle from Euclidean spaces to arbitrary separable metric spaces X. We first extend two algorithmic dimensions—computability-theoretic versions of classical Hausdorff and packing dimensions that assign dimensions [dim(x)] and [Dim(x)] to individual points [x E X] —to arbitrary separable metric spaces and to arbitrary gauge families. Our first two main results then extend the point-to-set principle to arbitrary separable metric spaces and to a large class of gauge families. We demonstrate the power of our extended point-to-set principle by using it to prove new theorems about classical fractal dimensions in hyperspaces.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Analysis of the influence of diffeomorphic normalization in the prediction of stable VS progressive MCI conversion with convolutional neural networks

  • Ramón-Júlvez, Ubaldo
  • Hernández, Mónica
  • Mayordomo, Elvira
  • ADNI
We study the effect of the selection of diffeomorphic normalization in the performance of Spasov''s deep-learning system for the problem of progressive MCI vs stable MCI discrimination. We considered different degrees of normalization (no, affine and non-rigid normalization) and two diffeomorphic registration methods (ANTS and BL PDE-LDDMM) with different image similarity metrics (SSD, NCC, and lNCC) yielding qualitatively different deformation models and quantitatively different degrees of registration accuracy. BL PDE-LDDMM NCC achieved the best performing accuracy with median values of 89%. Surprisingly, the accuracy of no and affine normalization was also among the highest, indicating that the deep-learning system is powerful enough to learn accurate models for pMCI vs sMCI discrimination without the need for normalization. However, the best sensitivity values were obtained by BL PDE-LDDMM SSD and NCC with median values of 97% and 94% while the sensitivity of the remaining methods stayed under 88%.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Contribución de congreso (ConferenceOutput)

Evolution of GWAS results through ADNI cohorts

  • Marin, Belen
  • Alquezar-Baeta, Carlos
  • Hernandez, Monica
  • Mayordomo Cámara, Elvira
Genome Wide Association Studies (GWAS) of Alzheimer's disease with quantitative phenotype is an active field of research that has pointed out a number of SNPs potentially related to the disease. Some initiatives such as Alzheimer's Disease Neuroimaging Initiative (ADNI) have been established in order to proof whether anatomical or biological markers (from magnetic resonance imaging (MRI) or positron emission tomography (PET)), genetic information, and clinical and neuropsychological assessments can be combined to measure the progression of mild cognitive impairment (MCI) and early Alzheimer's disease (AD). In the last decade, ADNI database has been progressively augmented, including a considerable number of patients yielding to the subsequent projects and cohorts ADNI1, ADNIGO, and ADNI2. Although some GWAS have been carried out with subpopulations of ADNI1, to the best of our knowledge, these works have not been replicated with the whole ADNI1 or the subsequent cohorts. In this work, we intend to study which SNPs are consistently preserved through ADNI cohorts in GWAS.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Efficient momentum conservation constrained PDE-LDDMM with Gauss–Newton–Krylov optimization, Semi-Lagrangian Runge–Kutta solvers, and the band-limited parameterization

  • Hernandez, M.
This paper proposes three efficient variants of Jacobi EPDiff PDE-LDDMM, where efficiency is achieved through Semi-Lagrangian Runge–Kutta integration and the band-limited parameterization. During Gauss–Newton–Krylov optimization, the method computes the gradient and the Hessian-vector product on the final time sample, and transports these magnitudes towards the initial time using the adjoint Jacobi equations and their incremental counterparts. Then, the optimization is performed on the initial time sample. The proposed methods have effectively achieved a considerable reduction of the computational complexity at a competitive accuracy. These variants constitute a contribution to the efficient computation of diffeomorphisms belonging to geodesics, suitable for statistical shape analysis or the construction of transversal and longitudinal models of shape variability using Principal Geodesic Analysis and Geodesic Regression in spaces of diffeomorphisms.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Scaling of sensory information in large neural populations shows signatures of information-limiting correlations

  • Kafashan, M
  • Jaffe, AW
  • Chettih, SN
  • Nogueira, R
  • Arandia-Romero, I
  • Harvey, CD
  • Moreno-Bote, R
  • Drugowitsch, J
How is information distributed across large neuronal populations within a given brain area? Information may be distributed roughly evenly across neuronal populations, so that total information scales linearly with the number of recorded neurons. Alternatively, the neural code might be highly redundant, meaning that total information saturates. Here we investigate how sensory information about the direction of a moving visual stimulus is distributed across hundreds of simultaneously recorded neurons in mouse primary visual cortex. We show that information scales sublinearly due to correlated noise in these populations. We compartmentalized noise correlations into information-limiting and nonlimiting components, then extrapolate to predict how information grows with even larger neural populations. We predict that tens of thousands of neurons encode 95% of the information about visual stimulus direction, much less than the number of neurons in primary visual cortex. These findings suggest that the brain uses a widely distributed, but nonetheless redundant code that supports recovering most sensory information from smaller subpopulations. Information regarding a sensory stimulus is distributed in activity of neuronal populations. Here the authors show stimulus information scales sub-linearly with the number of neurons in mouse visual cortex due to correlated noise and may saturate in far fewer numbers of neurons than the total in V1.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Placebo From an Enactive Perspective

  • R. Arandia I.
  • Di Paolo E.A.
Due to their complexity and variability, placebo effects remain controversial. We suggest this is also due to a set of problematic assumptions (dualism, reductionism, individualism, passivity). We critically assess current explanations and empirical evidence and propose an alternative theoretical framework—the enactive approach to life and mind—based on recent developments in embodied cognitive science. We review core enactive concepts such as autonomy, agency, and sense-making. Following these ideas, we propose a move from binary distinctions (e.g., conscious vs. non-conscious) to the more workable categories of reflective and pre-reflective activity. We introduce an ontology of individuation, following the work of Gilbert Simondon, that allow us to see placebo interventions not as originating causal chains, but as modulators and triggers in the regulation of tensions between ongoing embodied and interpersonal processes. We describe these interrelated processes involving looping effects through three intertwined dimensions of embodiment: organic, sensorimotor, and intersubjective. Finally, we defend the need to investigate therapeutic interactions in terms of participatory sense-making, going beyond the identification of individual social traits (e.g., empathy, trust) that contribute to placebo effects. We discuss resonances and differences between the enactive proposal, popular explanations such as expectations and conditioning, and other approaches based on meaning responses and phenomenological/ecological ideas.
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Scaling of sensory information in large neural populations shows signatures of information-limiting correlations

  • Kafashan, MohammadMehdi
  • Jaffe, Anna W.
  • Chettih, Selmaan N.
  • Nogueira, Ramon
  • Arandía Romero, Iñigo
  • Harvey, Christopher D.
  • Moreno Bote, Rubén
  • Drugowitsch, Jan
How is information distributed across large neuronal populations within a given brain area? Information may be distributed roughly evenly across neuronal populations, so that total information scales linearly with the number of recorded neurons. Alternatively, the neural code might be highly redundant, meaning that total information saturates. Here we investigate how sensory information about the direction of a moving visual stimulus is distributed across hundreds of simultaneously recorded neurons in mouse primary visual cortex. We show that information scales sublinearly due to correlated noise in these populations. We compartmentalized noise correlations into information-limiting and nonlimiting components, then extrapolate to predict how information grows with even larger neural populations. We predict that tens of thousands of neurons encode 95% of the information about visual stimulus direction, much less than the number of neurons in primary visual cortex. These findings suggest that the brain uses a widely distributed, but nonetheless redundant code that supports recovering most sensory information from smaller subpopulations., We would like to thank Alexandre Pouget, Peter Latham, and members of the HMS Neurobiology Department for useful discussions and feedback on the work, and Rachel Wilson and Richard Born for comments on early versions of the manuscript. The work was supported by a scholar award from the James S. McDonnell Foundation (grant# 220020462 to J.D.), grants from the NIH (R01MH115554 to J.D.; R01MH107620 to C.D.H.; R01NS089521 to C.D.H.; R01NS108410 to C.D.H.; F31EY031562 to A.W.J.), the NSF’s NeuroNex program (DBI-1707398. to R.N.), MINECO (Spain; BFU2017-85936-P to R.M.-B.), the Howard Hughes Medical Institute (HHMI, ref 55008742 to R.M.-B.), the ICREA Academia (2016 to R.M.-B.), the Government of Aragon (Spain; ISAAC lab, cod T33 17D to I.A.-R.), the Spanish Ministry of Economy and Competitiveness (TIN2016-80347-R to I.A.-R.), the Gatsby Charitable Foundation (to R.N.), and an NSF Graduate Research Fellowship (to A.W.J.).
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

How children develop their ability to combine words, a network-based approach

  • Barceló-Coblijn, Lluís|||0000-0002-8765-6314
  • Irurtzun, Aritz
  • Real Puigdollers, Cristina|||0000-0001-5340-0196
  • López Navarro, Emilio
  • Gomila, Antoni|||0000-0001-7325-961X
A new way to study and represent early syntactic development is introduced that offers a promising avenue to improve on standard cumulative approaches to language learning. The analysis is inspired by complex network theory and explores an important issue in psycholinguistics: how children combine words syntactically. To this end, the article exploits the longitudinal data of multiple individual studies stored and publicly available in the CHILDES database. This analysis proves useful in two regards: in coincidence with previous approaches to syntactic development, it reveals a similar linear-nonlinear pattern of syntactic development (a combination of linear periods interrupted by abrupt transitions) in typical children regardless the language they are acquiring. It also provides a straightforward objective measure of syntactic impairment in atypically developing children. A striking difference between typical and atypical children lies in the connectivity of functional words, which suddenly become hubs but only in typical development. Our technique offers a formal measure of impairment with respect to typical syntactic development, which goes beyond the standard notion of retardation in development, for the Down syndrome condition.