AMS measurements of cosmogenic and supernova-ejected radionuclides in deep-sea sediment cores

Samples of two deep-sea sediment cores from the Indian Ocean are analyzed with accelerator mass spectrometry (AMS) to search for traces of recent supernova activity around 2 Myr ago. Here, long-lived radionuclides, which are synthesized in massive stars and ejected in supernova explosions, namely 26Al, 53Mn and 60Fe, are extracted from the sediment samples. The cosmogenic isotope 10Be, which is mainly produced in the Earths atmosphere, is analyzed for dating purposes of the marine sediment cores. The first AMS measurement results for 10Be and 26Al are presented, which represent for the first time a detailed study in the time period of 1.7-3.1 Myr with high time resolution. Our first results do not support a significant extraterrestrial signal of 26Al above terrestrial background. However, there is evidence that, like 10Be, 26Al might be a valuable isotope for dating of deep-sea sediment cores for the past few million years.Comment: 5 pages, 2 figures, Proceedings of the Heavy Ion Accelerator Symposium on Fundamental and Applied Science, 2013, will be published by the EPJ Web of conference

Gap junction reduction in cardiomyocytes following transforming growth factor- beta treatment and Trypanosoma cruzi infection

Gap junction connexin-43 (Cx43) molecules are responsible for electrical impulse conduction in the heart and are affected by transforming growth factor-beta (TGF-beta). This cytokine increases during Trypanosoma cruzi infection, modulating fibrosis and the parasite cell cycle. We studied Cx43 expression in cardiomyocytes exposed or not to TGF-beta T. cruzi, or SB-431542, an inhibitor of TGF-beta receptor type I (ALK-5). Cx43 expression was also examined in hearts with dilated cardiopathy from chronic Chagas disease patients, in which TGF-beta signalling had been shown previously to be highly activated. We demonstrated that TGF-beta treatment induced disorganised gap junctions in non-infected cardiomyocytes, leading to a punctate, diffuse and non-uniform Cx43 staining. A similar pattern was detected in T. cruzi-infected cardiomyocytes concomitant with high TGF-beta secretion. Both results were reversed if the cells were incubated with SB-431542. Similar tests were performed using human chronic chagasic patients and we confirmed a down-regulation of Cx43 expression, an altered distribution of plaques in the heart and a significant reduction in the number and length of Cx43 plaques, which correlated negatively with cardiomegaly. We conclude that elevated TGF-beta levels during T. cruzi infection promote heart fibrosis and disorganise gap junctions, possibly contributing to abnormal impulse conduction and arrhythmia that characterise severe cardiopathy in Chagas disease

A Characterization of Visibility Graphs for Pseudo-Polygons

In this paper, we give a characterization of the visibility graphs of pseudo-polygons. We first identify some key combinatorial properties of pseudo-polygons, and we then give a set of five necessary conditions based off our identified properties. We then prove that these necessary conditions are also sufficient via a reduction to a characterization of vertex-edge visibility graphs given by O'Rourke and Streinu

Adenoviral vectors for highly selective gene expression in central serotonergic neurons reveal quantal characteristics of serotonin release in the rat brain

<p>Abstract</p> <p>Background</p> <p>5-hydroxytryptamine (5 HT, serotonin) is one of the key neuromodulators in mammalian brain, but many fundamental properties of serotonergic neurones and 5 HT release remain unknown. The objective of this study was to generate an adenoviral vector system for selective targeting of serotonergic neurones and apply it to study quantal characteristics of 5 HT release in the rat brain.</p> <p>Results</p> <p>We have generated adenoviral vectors which incorporate a 3.6 kb fragment of the rat tryptophan hydroxylase-2 (TPH-2) gene which selectively (97% co-localisation with TPH-2) target raphe serotonergic neurones. In order to enhance the level of expression a two-step transcriptional amplification strategy was employed. This allowed direct visualization of serotonergic neurones by EGFP fluorescence. Using these vectors we have performed initial characterization of EGFP-expressing serotonergic neurones in rat organotypic brain slice cultures. Fluorescent serotonergic neurones were identified and studied using patch clamp and confocal Ca²⁺imaging and had features consistent with those previously reported using post-hoc identification approaches. Fine processes of serotonergic neurones could also be visualized in un-fixed tissue and morphometric analysis suggested two putative types of axonal varicosities. We used micro-amperometry to analyse the quantal characteristics of 5 HT release and found that central 5 HT exocytosis occurs predominantly in quanta of ~28000 molecules from varicosities and ~34000 molecules from cell bodies. In addition, in somata, we observed a minority of large release events discharging on average ~800000 molecules.</p> <p>Conclusion</p> <p>For the first time quantal release of 5 HT from somato-dendritic compartments and axonal varicosities in mammalian brain has been demonstrated directly and characterised. Release from somato-dendritic and axonal compartments might have different physiological functions. Novel vectors generated in this study open a host of new experimental opportunities and will greatly facilitate further studies of the central serotonergic system.</p

Thresholded Covering Algorithms for Robust and Max-Min Optimization

The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should you anticipatorily buy today, so that the worst-case cost (summed over both days) is minimized? Feige et al. and Khandekar et al. considered the k-robust model where the possible outcomes tomorrow are given by all demand-subsets of size k, and gave algorithms for the set cover problem, and the Steiner tree and facility location problems in this model, respectively. In this paper, we give the following simple and intuitive template for k-robust problems: "having built some anticipatory solution, if there exists a single demand whose augmentation cost is larger than some threshold, augment the anticipatory solution to cover this demand as well, and repeat". In this paper we show that this template gives us improved approximation algorithms for k-robust Steiner tree and set cover, and the first approximation algorithms for k-robust Steiner forest, minimum-cut and multicut. All our approximation ratios (except for multicut) are almost best possible. As a by-product of our techniques, we also get algorithms for max-min problems of the form: "given a covering problem instance, which k of the elements are costliest to cover?".Comment: 24 page

Pricing Multi-Unit Markets

We study the power and limitations of posted prices in multi-unit markets, where agents arrive sequentially in an arbitrary order. We prove upper and lower bounds on the largest fraction of the optimal social welfare that can be guaranteed with posted prices, under a range of assumptions about the designer's information and agents' valuations. Our results provide insights about the relative power of uniform and non-uniform prices, the relative difficulty of different valuation classes, and the implications of different informational assumptions. Among other results, we prove constant-factor guarantees for agents with (symmetric) subadditive valuations, even in an incomplete-information setting and with uniform prices

Proving Computational Ability

We extend the notion of a proof of knowledge to a proof of the ability to perform some compu-tational task

Computing Stable Coalitions: Approximation Algorithms for Reward Sharing

Consider a setting where selfish agents are to be assigned to coalitions or projects from a fixed set P. Each project k is characterized by a valuation function; v_k(S) is the value generated by a set S of agents working on project k. We study the following classic problem in this setting: "how should the agents divide the value that they collectively create?". One traditional approach in cooperative game theory is to study core stability with the implicit assumption that there are infinite copies of one project, and agents can partition themselves into any number of coalitions. In contrast, we consider a model with a finite number of non-identical projects; this makes computing both high-welfare solutions and core payments highly non-trivial. The main contribution of this paper is a black-box mechanism that reduces the problem of computing a near-optimal core stable solution to the purely algorithmic problem of welfare maximization; we apply this to compute an approximately core stable solution that extracts one-fourth of the optimal social welfare for the class of subadditive valuations. We also show much stronger results for several popular sub-classes: anonymous, fractionally subadditive, and submodular valuations, as well as provide new approximation algorithms for welfare maximization with anonymous functions. Finally, we establish a connection between our setting and the well-studied simultaneous auctions with item bidding; we adapt our results to compute approximate pure Nash equilibria for these auctions.Comment: Under Revie

Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems

The reoptimization issue studied in this paper can be described as follows: given an instance I of some problem Π, an optimal solution OPT for Π in I and an instance I′ resulting from a local perturbation of I that consists of insertions or removals of a small number of data, we wish to use OPT in order to solve Π in I', either optimally or by guaranteeing an approximation ratio better than that guaranteed by an ex nihilo computation and with running time better than that needed for such a computation. We use this setting in order to study weighted versions of several representatives of a broad class of problems known in the literature as maximum induced hereditary subgraph problems. The main problems studied are max independent set, max k-colorable subgraph and max split subgraph under vertex insertions and deletion

Distance and the pattern of intra-European trade

Given an undirected graph G = (V, E) and subset of terminals T ⊆ V, the element-connectivity κ ′ G (u, v) of two terminals u, v ∈ T is the maximum number of u-v paths that are pairwise disjoint in both edges and non-terminals V \ T (the paths need not be disjoint in terminals). Element-connectivity is more general than edge-connectivity and less general than vertex-connectivity. Hind and Oellermann [21] gave a graph reduction step that preserves the global element-connectivity of the graph. We show that this step also preserves local connectivity, that is, all the pairwise element-connectivities of the terminals. We give two applications of this reduction step to connectivity and network design problems. • Given a graph G and disjoint terminal sets T1, T2,..., Tm, we seek a maximum number of elementdisjoint Steiner forests where each forest connects each Ti. We prove that if each Ti is k element k connected then there exist Ω( log hlog m) element-disjoint Steiner forests, where h = | i Ti|. If G is planar (or more generally, has fixed genus), we show that there exist Ω(k) Steiner forests. Our proofs are constructive, giving poly-time algorithms to find these forests; these are the first non-trivial algorithms for packing element-disjoint Steiner Forests. • We give a very short and intuitive proof of a spider-decomposition theorem of Chuzhoy and Khanna [12] in the context of the single-sink k-vertex-connectivity problem; this yields a simple and alternative analysis of an O(k log n) approximation. Our results highlight the effectiveness of the element-connectivity reduction step; we believe it will find more applications in the future