Robust seismic velocity change estimation using ambient noise recordings

We consider the problem of seismic velocity change estimation using ambient noise recordings. Motivated by [23] we study how the velocity change estimation is affected by seasonal fluctuations in the noise sources. More precisely, we consider a numerical model and introduce spatio-temporal seasonal fluctuations in the noise sources. We show that indeed, as pointed out in [23], the stretching method is affected by these fluctuations and produces misleading apparent velocity variations which reduce dramatically the signal to noise ratio of the method. We also show that these apparent velocity variations can be eliminated by an adequate normalization of the cross-correlation functions. Theoretically we expect our approach to work as long as the seasonal fluctuations in the noise sources are uniform, an assumption which holds for closely located seismic stations. We illustrate with numerical simulations and real measurements that the proposed normalization significantly improves the accuracy of the velocity change estimation

Investigating the Role of Current Strength in tDCS Modulation of Working Memory Performance in Healthy Controls

Transcranial direct current stimulation (tDCS) is a brain stimulation technique that has the potential to improve working memory (WM) deficits in many clinical disorders. The aim of this study was to investigate the role of current strength on the ability of anodal tDCS to improve WM, and secondly to investigate the time course of effects. Twelve healthy participants underwent three stimulation sessions consisting of 20 min of either 1 mA anodal tDCS, 2 mA anodal tDCS, or sham tDCS to the left dorsolateral prefrontal cortex (DLPFC) localized via F3, all whilst completing a WM task. Intra-stimulation and post-stimulation WM performances were measured using the n-back and Sternberg tasks respectively. Results revealed no significant improvements in participants’ accuracy, but a significant interaction was found with respect to current strength and time for accurate reaction time. The finding provides partial support for the hypothesis, in that it appears current strength may affect aspects of WM performance. However, more research is needed, and a higher difficulty level of WM tasks is one of the suggestions discussed for future research

The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games

We analyse the computational complexity of finding Nash equilibria in simple stochastic multiplayer games. We show that restricting the search space to equilibria whose payoffs fall into a certain interval may lead to undecidability. In particular, we prove that the following problem is undecidable: Given a game G, does there exist a pure-strategy Nash equilibrium of G where player 0 wins with probability 1. Moreover, this problem remains undecidable if it is restricted to strategies with (unbounded) finite memory. However, if mixed strategies are allowed, decidability remains an open problem. One way to obtain a provably decidable variant of the problem is restricting the strategies to be positional or stationary. For the complexity of these two problems, we obtain a common lower bound of NP and upper bounds of NP and PSPACE respectively.Comment: 23 pages; revised versio

Circular Networks from Distorted Metrics

Trees have long been used as a graphical representation of species relationships. However complex evolutionary events, such as genetic reassortments or hybrid speciations which occur commonly in viruses, bacteria and plants, do not fit into this elementary framework. Alternatively, various network representations have been developed. Circular networks are a natural generalization of leaf-labeled trees interpreted as split systems, that is, collections of bipartitions over leaf labels corresponding to current species. Although such networks do not explicitly model specific evolutionary events of interest, their straightforward visualization and fast reconstruction have made them a popular exploratory tool to detect network-like evolution in genetic datasets. Standard reconstruction methods for circular networks, such as Neighbor-Net, rely on an associated metric on the species set. Such a metric is first estimated from DNA sequences, which leads to a key difficulty: distantly related sequences produce statistically unreliable estimates. This is problematic for Neighbor-Net as it is based on the popular tree reconstruction method Neighbor-Joining, whose sensitivity to distance estimation errors is well established theoretically. In the tree case, more robust reconstruction methods have been developed using the notion of a distorted metric, which captures the dependence of the error in the distance through a radius of accuracy. Here we design the first circular network reconstruction method based on distorted metrics. Our method is computationally efficient. Moreover, the analysis of its radius of accuracy highlights the important role played by the maximum incompatibility, a measure of the extent to which the network differs from a tree.Comment: Submitte

Efficiency in Multi-objective Games

In a multi-objective game, each agent individually evaluates each overall action-profile on multiple objectives. I generalize the price of anarchy to multi-objective games and provide a polynomial-time algorithm to assess it. This work asserts that policies on tobacco promote a higher economic efficiency

Sex-Dependent Changes in miRNA Expression in the Bed Nucleus of the Stria Terminalis Following Stress

Anxiety disorders disproportionately affect women compared to men, which may arise from sex differences in stress responses. MiRNAs are small non-coding RNAs known to regulate gene expression through actions on mRNAs. MiRNAs are regulated, in part, by factors such as stress and gonadal sex, and they have been implicated in the pathophysiology of multiple psychiatric disorders. Here, we assessed putative sex differences in miRNA expression in the bed nucleus of the stria terminalis (BNST) – a sexually dimorphic brain region implicated in anxiety – of adult male and female rats that had been exposed to social isolation (SI) stress throughout adolescence. To assess the translational utility of our results, we assessed if childhood trauma in humans resulted in changes in blood miRNA expression that are similar to those observed in rats. Male and female Sprague-Dawley rats underwent SI during adolescence or remained group housed (GH) and were tested for anxiety-like behavior in the elevated plus maze as adults. Small RNA sequencing was performed on tissue extracted from the BNST. Furthermore, we re-analyzed an already available small RNA sequencing data set from the Grady Trauma Project (GTP) from men and women to identify circulating miRNAs that are associated with childhood trauma exposure. Our results indicated that there were greater anxiogenic-like effects and changes in BNST miRNA expression in SI versus GH females compared to SI versus GH males. In addition, we found nine miRNAs that were regulated in both the BNST from SI compared to GH rats and in blood samples from humans exposed to childhood trauma. These studies emphasize the utility of rodent models in studying neurobiological mechanisms underlying psychiatric disorders and suggest that rodent models could be used to identify novel sex-specific pharmacotherapies for anxiety disorders

Decision Problems for Nash Equilibria in Stochastic Games

We analyse the computational complexity of finding Nash equilibria in stochastic multiplayer games with $\omega$-regular objectives. While the existence of an equilibrium whose payoff falls into a certain interval may be undecidable, we single out several decidable restrictions of the problem. First, restricting the search space to stationary, or pure stationary, equilibria results in problems that are typically contained in PSPACE and NP, respectively. Second, we show that the existence of an equilibrium with a binary payoff (i.e. an equilibrium where each player either wins or loses with probability 1) is decidable. We also establish that the existence of a Nash equilibrium with a certain binary payoff entails the existence of an equilibrium with the same payoff in pure, finite-state strategies.Comment: 22 pages, revised versio

Inapproximability Results for Approximate Nash Equilibria.

We study the problem of finding approximate Nash equilibria that satisfy certain conditions, such as providing good social welfare. In particular, we study the problem $\epsilon$-NE $\delta$-SW: find an $\epsilon$-approximate Nash equilibrium ($\epsilon$-NE) that is within $\delta$ of the best social welfare achievable by an $\epsilon$-NE. Our main result is that, if the exponential-time hypothesis (ETH) is true, then solving $\left(\frac{1}{8} - \mathrm{O}(\delta)\right)$-NE $\mathrm{O}(\delta)$-SW for an $n\times n$ bimatrix game requires $n^{\mathrm{\widetilde \Omega}(\log n)}$ time. Building on this result, we show similar conditional running time lower bounds on a number of decision problems for approximate Nash equilibria that do not involve social welfare, including maximizing or minimizing a certain player's payoff, or finding approximate equilibria contained in a given pair of supports. We show quasi-polynomial lower bounds for these problems assuming that ETH holds, where these lower bounds apply to $\epsilon$-Nash equilibria for all $\epsilon < \frac{1}{8}$. The hardness of these other decision problems has so far only been studied in the context of exact equilibria.Comment: A short (14-page) version of this paper appeared at WINE 2016. Compared to that conference version, this new version improves the conditional lower bounds, which now rely on ETH rather than RETH (Randomized ETH

Alignment-Free Phylogenetic Reconstruction

14th Annual International Conference, RECOMB 2010, Lisbon, Portugal, April 25-28, 2010. ProceedingsWe introduce the first polynomial-time phylogenetic reconstruction algorithm under a model of sequence evolution allowing insertions and deletions (or indels). Given appropriate assumptions, our algorithm requires sequence lengths growing polynomially in the number of leaf taxa. Our techniques are distance-based and largely bypass the problem of multiple alignment