A Mismatch-Based Model for Memory Reconsolidation and Extinction in Attractor Networks

OSAN, R. , TORT, A. B. L. , AMARAL, O. B. . A mismatch-based model for memory reconsolidation and extinction in attractor networks. Plos One, v. 6, p. e23113, 2011.

Exact Probability Distribution versus Entropy

The problem addressed concerns the determination of the average numberof successive attempts of guessing a word of a certain length consisting of letters withgiven probabilities of occurrence. Both first- and second-order approximations to a naturallanguage are considered. The guessing strategy used is guessing words in decreasing orderof probability. When word and alphabet sizes are large, approximations are necessary inorder to estimate the number of guesses. Several kinds of approximations are discusseddemonstrating moderate requirements regarding both memory and central processing unit(CPU) time. When considering realistic sizes of alphabets and words (100), the numberof guesses can be estimated within minutes with reasonable accuracy (a few percent) andmay therefore constitute an alternative to, e.g., various entropy expressions. For manyprobability distributions, the density of the logarithm of probability products is close to anormal distribution. For those cases, it is possible to derive an analytical expression for theaverage number of guesses. The proportion of guesses needed on average compared to thetotal number decreases almost exponentially with the word length. The leading term in anasymptotic expansion can be used to estimate the number of guesses for large word lengths.Comparisons with analytical lower bounds and entropy expressions are also provided.

Rescue of impaired fear extinction : role of dopaminergic signaling and histone acetylation

submitted by Verena Felizitas Maurer

Asymptotic and structural properties of special cases of the Wright function arising in probability theory

This analysis paper presents previously unknown properties of some special cases of the Wright function whose consideration is necessitated by our work on probability theory and the theory of stochastic processes. Specifically, we establish new asymptotic properties of the particular Wright function 1Ψ1(ρ, k; ρ, 0; x) = X∞ n=0 Γ(k + ρn) Γ(ρn) x n n! (|x| < ∞) when the parameter ρ ∈ (−1, 0)∪(0, ∞) and the argument x is real. In the probability theory applications, which are focused on studies of the Poisson-Tweedie mixtures, the parameter k is a non-negative integer. Several representations involving well-known special functions are given for certain particular values of ρ. The asymptotics of 1Ψ1(ρ, k; ρ, 0; x) are obtained under numerous assumptions on the behavior of the arguments k and x when the parameter ρ is both positive and negative. We also provide some integral representations and structural properties involving the ‘reduced’ Wright function 0Ψ1(−−; ρ, 0; x) with ρ ∈ (−1, 0) ∪ (0, ∞), which might be useful for the derivation of new properties of members of the power-variance family of distributions. Some of these imply a reflection principle that connects the functions 0Ψ1(−−;±ρ, 0; ·) and certain Bessel functions. Several asymptotic relationships for both particular cases of this function are also given. A few of these follow under additional constraints from probability theory results which, although previously available, were unknown to analysts.

Analysis on the connotation of probability in the artificial intelligence algorithm for economic decision making.

This paper analyzes the inner relations between classical sub-scheme probability and statistic probability, subjective probability and objective probability, prior probability and posterior probability, transition probability and probability of utility, and further analysis the goal, method, and its practical economic purpose which represent by these various probability from the perspective of mathematics, so as to deeply understand there connotation and its relation with economic decision making, thus will pave the route for scientific predication and decision making.

A Mismatch-Based Model for Memory Reconsolidation and Extinction in Attractor Networks

OSAN, R. , TORT, A. B. L. , AMARAL, O. B. . A mismatch-based model for memory reconsolidation and extinction in attractor networks. Plos One, v. 6, p. e23113, 2011.

Finite time extinction for nonlinear fractional evolution equations and related properties

The finite time extinction phenomenon (the solution reaches an equilibrium after a finite time) is peculiar to certain nonlinear problems whose solutions exhibit an asymptotic behavior entirely different from the typical behavior of solutions associated to linear problems. The main goal of this work is twofold. Firstly, we extend some of the results known in the literature to the case in which the ordinary time derivative is considered jointly with a fractional time differentiation. Secondly, we consider the limit case when only the fractional derivative remains. The latter is the most extraordinary case, since we prove that the finite time extinction phenomenon still appears, even with a non-smooth profile near the extinction time. Some concrete examples of quasi-linear partial differential operators are proposed. Our results can also be applied in the framework of suitable nonlinear Volterra integro-differential equations.

Community- and population-level effects of chytridiomycosis in a Neotropical amphibian community

As the number of fungal pathogen outbreaks become more frequent worldwide across taxa, so have the number of species extirpations and communities persisting with the pathogen. This phenomenon raises questions, such as: “what leads to host extinction during an outbreak?” and “how are hosts persisting once the pathogen establishes?.” But the data on host populations and communities across life stages before and after pathogen arrival rarely exist to answer these questions. Over the past three to four decades, the amphibian-killing fungus Batrachochytrim dendrobatidis (Bd) spread in a wave-like manner across Central America, leading to rapid species extirpations and population declines. I collected data on tadpole and adult amphibians in El Copé, Panama before, during, and after the Bd outbreak to answer these questions. I used Bayesian statistical approaches to account for imperfect host and pathogen detection of marked and unmarked individuals. In the tadpole community, within 11 months of Bds arrival, density and occupancy rapidly declined. Species losses were phylogenetically correlated, with glass frogs disappearing first, and tree frogs and poison-dart frogs remaining. I found that tadpole communities resembled one another more strongly after the outbreak than they did before Bd invasion. I found no tadpoles within 22 months of the outbreak and limited signs of recovery within 10 years. In contrast, at the same site, for a population of male glass frogs, Espadarana prosopleon, I found that 10 years post-outbreak, the population was consistently half its historic abundance, and that the lack of recruits to the population explained why the population had not rebounded, rather than high pathogen-induced mortality. And finally, examining the entire amphibian community, I found high pathogen prevalence, low infection intensities, and high survival rates of uninfected and infected hosts. Bd transmission risk, i.e., the probability a susceptible host becomes infected, did not relate to host density, pathogen prevalence, or infection intensity– Bd transmission risk was uniform across the study area. My results are especially relevant to conservation biologists aiming to predict the future impacts of Bd outbreaks, those trying to manage persisting populations, and those interested in reintroducing species back into wild amphibian communities.

Finite time extinction for nonlinear fractional evolution equations and related properties.

The finite time extinction phenomenon (the solution reaches an equilibrium after a finite time) is peculiar to certain nonlinear problems whose solutions exhibit an asymptotic behavior entirely different from the typical behavior of solutions associated to linear problems. The main goal of this work is twofold. Firstly, we extend some of the results known in the literature to the case in which the ordinary time derivative is considered jointly with a fractional time differentiation. Secondly, we consider the limit case when only the fractional derivative remains. The latter is the most extraordinary case, since we prove that the finite time extinction phenomenon still appears, even with a non-smooth profile near the extinction time. Some concrete examples of quasi-linear partial differential operators are proposed. Our results can also be applied in the framework of suitable nonlinear Volterra integro-differential equations.

Model Probability in Self-organising Maps

Growing models have been widely used for clustering or topology learning. Traditionally these models work on stationary environments, grow incrementally and adapt their nodes to a given distribution based on global parameters. In this paper, we present an enhanced unsupervised self-organising network for the modelling of visual objects. We first develop a framework for building non-rigid shapes using the growth mechanism of the self-organising maps, and then we define an optimal number of nodes without overfitting or underfitting the network based on the knowledge obtained from information-theoretic considerations. We present experimental results for hands and we quantitatively evaluate the matching capabilities of the proposed method with the topographic product.

Probability and Common-Sense: Tandem Towards Robust Robotic Object Recognition in Ambient Assisted Living

The suitable operation of mobile robots when providing Ambient Assisted Living (AAL) services calls for robust object recognition capabilities. Probabilistic Graphical Models (PGMs) have become the de-facto choice in recognition systems aiming to e ciently exploit contextual relations among objects, also dealing with the uncertainty inherent to the robot workspace. However, these models can perform in an inco herent way when operating in a long-term fashion out of the laboratory, e.g. while recognizing objects in peculiar con gurations or belonging to new types. In this work we propose a recognition system that resorts to PGMs and common-sense knowledge, represented in the form of an ontology, to detect those inconsistencies and learn from them. The utilization of the ontology carries additional advantages, e.g. the possibility to verbalize the robot's knowledge. A primary demonstration of the system capabilities has been carried out with very promising results.