Random Geometric Graphs

We analyse graphs in which each vertex is assigned random coordinates in a geometric space of arbitrary dimensionality and only edges between adjacent points are present. The critical connectivity is found numerically by examining the size of the largest cluster. We derive an analytical expression for the cluster coefficient which shows that the graphs are distinctly different from standard random graphs, even for infinite dimensionality. Insights relevant for graph bi-partitioning are included.Comment: 16 pages, 10 figures. Minor changes. Added reference

Hubble Space Telescope Imaging of the Active Dwarf Galaxy RGG 118

RGG 118 (SDSS 1523+1145) is a nearby ($z=0.0243$), dwarf disk galaxy ($M_{\ast}\approx2\times10^{9} M_{\odot}$) found to host an active $\sim50,000$ solar mass black hole at its core (Baldassare et al. 2015). RGG 118 is one of a growing collective sample of dwarf galaxies known to contain active galactic nuclei -- a group which, until recently, contained only a handful of objects. Here, we report on new \textit{Hubble Space Telescope} Wide Field Camera 3 UVIS and IR imaging of RGG 118, with the main goal of analyzing its structure. Using 2-D parametric modeling, we find that the morphology of RGG 118 is best described by an outer spiral disk, inner component consistent with a pseudobulge, and central PSF. The luminosity of the PSF is consistent with the central point source being dominated by the AGN. We measure the luminosity and mass of the "pseudobulge" and confirm that the central black hole in RGG 118 is under-massive with respect to the $M_{BH}-M_{\rm bulge}$ and $M_{BH}-L_{\rm bulge}$ relations. This result is consistent with a picture in which black holes in disk-dominated galaxies grow primarily through secular processes.Comment: Accepted to Astrophysical Journal. 11 pages, 8 figure

Visibly Pushdown Modular Games

Games on recursive game graphs can be used to reason about the control flow of sequential programs with recursion. In games over recursive game graphs, the most natural notion of strategy is the modular strategy, i.e., a strategy that is local to a module and is oblivious to previous module invocations, and thus does not depend on the context of invocation. In this work, we study for the first time modular strategies with respect to winning conditions that can be expressed by a pushdown automaton. We show that such games are undecidable in general, and become decidable for visibly pushdown automata specifications. Our solution relies on a reduction to modular games with finite-state automata winning conditions, which are known in the literature. We carefully characterize the computational complexity of the considered decision problem. In particular, we show that modular games with a universal Buchi or co Buchi visibly pushdown winning condition are EXPTIME-complete, and when the winning condition is given by a CARET or NWTL temporal logic formula the problem is 2EXPTIME-complete, and it remains 2EXPTIME-hard even for simple fragments of these logics. As a further contribution, we present a different solution for modular games with finite-state automata winning condition that runs faster than known solutions for large specifications and many exits.Comment: In Proceedings GandALF 2014, arXiv:1408.556

Fast multipole networks

Two prerequisites for robotic multiagent systems are mobility and communication. Fast multipole networks (FMNs) enable both ends within a unified framework. FMNs can be organized very efficiently in a distributed way from local information and are ideally suited for motion planning using artificial potentials. We compare FMNs to conventional communication topologies, and find that FMNs offer competitive communication performance (including higher network efficiency per edge at marginal energy cost) in addition to advantages for mobility

Characterization of nuclear polyadenylated RNA-binding proteins in Saccharomyces cerevisiae.

To study the functions of heterogeneous nuclear ribonucleoproteins (hnRNPs), we have characterized nuclear polyadenylated RNA-binding (Nab) proteins from Saccharomyces cerevisiae. Nab1p, Nab2p, and Nab3p were isolated by a method which uses UV light to cross-link proteins directly bound to poly(A)+ RNA in vivo. We have previously characterized Nab2p, and demonstrated that it is structurally related to human hnRNPs. Here we report that Nab1p is identical to the Np13p/Nop3p protein recently implicated in both nucleocytoplasmic protein shuttling and pre-rRNA processing, and characterize a new nuclear polyadenylated RNA-binding protein, Nab3p. The intranuclear distributions of the Nab proteins were analyzed by three-dimensional immunofluorescence optical microscopy. All three Nab proteins are predominantly localized within the nucleoplasm in a pattern similar to the distribution of hnRNPs in human cells. The NAB3 gene is essential for cell viability and encodes an acidic ribonucleoprotein. Loss of Nab3p by growth of a GAL::nab3 mutant strain in glucose results in a decrease in the amount of mature ACT1, CYH2, and TPI1 mRNAs, a concomitant accumulation of unspliced ACT1 pre-mRNA, and an increase in the ratio of unspliced CYH2 pre-mRNA to mRNA. These results suggest that the Nab proteins may be required for packaging pre-mRNAs into ribonucleoprotein structures amenable to efficient nuclear RNA processing

Genomic organization of nucleolin gene in carp fish: Evidence for several genes

http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-97602006000200017&lng=es&nrm=isoThe protein nucleolin, functionally involved in the main steps of ribosome biogenesis, is codified by a single copy gene in mammals. Here we report that at least three different genes codify for this protein in carp fish (Cyprinus carpio). This is the first description of the genomic organization of nucleolin in a teleost. The carp nucleolin gene includes 8.8 kb and contains 16 exons. Promoter cis regulatory elements are similar to constitutive genes, i.e., a putative TATA box, three G/C boxes, and three pyrimidine-rich boxes. As in other species, carp nucleolin gene introns host three snoRNA codifying sequences: U23 from the H/ACA family and two C/D box snoRNAs, U20 and U82. Both U20 and U82 span a complementary sequence with carp 18S rRNA. Additionally, we identified two cDNAs coding for nucleolin, confirming the existence of several nucleolin genes in carp. Amino acidderived sequence from carp cDNAs differ from mammal protein because they span additional acidic domains at the amino end, whose functional significance remains unclear. We performed amino acid sequence comparison and phylogenetic analyses showing that the three isoforms of carp nucleolin, which we describe herein, cluster in two groups. cNUC1 probably diverges from cNUC2 and cNUC3 as result of ancestral fish-specific genome duplication, indeed C. carpio is a tetraploid fish

Hamiltonian cycles in faulty random geometric networks

In this paper we analyze the Hamiltonian properties of faulty random networks. This consideration is of interest when considering wireless broadcast networks. A random geometric network is a graph whose vertices correspond to points uniformly and independently distributed in the unit square, and whose edges connect any pair of vertices if their distance is below some specified bound. A faulty random geometric network is a random geometric network whose vertices or edges fail at random. Algorithms to find Hamiltonian cycles in faulty random geometric networks are presented.Postprint (published version