7,824 research outputs found

    The Trained Man of Science in the War

    Get PDF
    n/

    Dynamic communicability predicts infectiousness

    Get PDF
    Using real, time-dependent social interaction data, we look at correlations between some recently proposed dynamic centrality measures and summaries from large-scale epidemic simulations. The evolving network arises from email exchanges. The centrality measures, which are relatively inexpensive to compute, assign rankings to individual nodes based on their ability to broadcast information over the dynamic topology. We compare these with node rankings based on infectiousness that arise when a full stochastic SI simulation is performed over the dynamic network. More precisely, we look at the proportion of the network that a node is able to infect over a fixed time period, and the length of time that it takes for a node to infect half the network.We find that the dynamic centrality measures are an excellent, and inexpensive, proxy for the full simulation-based measures

    Solving the time-dependent Schr\"odinger equation with absorbing boundary conditions and source terms in Mathematica 6.0

    Full text link
    In recent decades a lot of research has been done on the numerical solution of the time-dependent Schr\"odinger equation. On the one hand, some of the proposed numerical methods do not need any kind of matrix inversion, but source terms cannot be easily implemented into this schemes; on the other, some methods involving matrix inversion can implement source terms in a natural way, but are not easy to implement into some computational software programs widely used by non-experts in programming (e.g. Mathematica). We present a simple method to solve the time-dependent Schr\"odinger equation by using a standard Crank-Nicholson method together with a Cayley's form for the finite-difference representation of evolution operator. Here, such standard numerical scheme has been simplified by inverting analytically the matrix of the evolution operator in position representation. The analytical inversion of the N x N matrix let us easily and fully implement the numerical method, with or without source terms, into Mathematica or even into any numerical computing language or computational software used for scientific computing.Comment: 15 pages, 7 figure

    MUSTANG: 90 GHz Science with the Green Bank Telescope

    Full text link
    MUSTANG is a 90 GHz bolometer camera built for use as a facility instrument on the 100 m Robert C. Byrd Green Bank radio telescope (GBT). MUSTANG has an 8 by 8 focal plane array of transition edge sensor bolometers read out using time-domain multiplexed SQUID electronics. As a continuum instrument on a large single dish MUSTANG has a combination of high resolution (8") and good sensitivity to extended emission which make it very competitive for a wide range of galactic and extragalactic science. Commissioning finished in January 2008 and some of the first science data have been collected.Comment: 9 Pages, 5 figures, Presented at the SPIE conference on astronomical instrumentation in 200

    Modeling the plasma near-wakes

    Full text link
    Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/76834/1/AIAA-7721-514.pd

    Guaranteed clustering and biclustering via semidefinite programming

    Get PDF
    Identifying clusters of similar objects in data plays a significant role in a wide range of applications. As a model problem for clustering, we consider the densest k-disjoint-clique problem, whose goal is to identify the collection of k disjoint cliques of a given weighted complete graph maximizing the sum of the densities of the complete subgraphs induced by these cliques. In this paper, we establish conditions ensuring exact recovery of the densest k cliques of a given graph from the optimal solution of a particular semidefinite program. In particular, the semidefinite relaxation is exact for input graphs corresponding to data consisting of k large, distinct clusters and a smaller number of outliers. This approach also yields a semidefinite relaxation for the biclustering problem with similar recovery guarantees. Given a set of objects and a set of features exhibited by these objects, biclustering seeks to simultaneously group the objects and features according to their expression levels. This problem may be posed as partitioning the nodes of a weighted bipartite complete graph such that the sum of the densities of the resulting bipartite complete subgraphs is maximized. As in our analysis of the densest k-disjoint-clique problem, we show that the correct partition of the objects and features can be recovered from the optimal solution of a semidefinite program in the case that the given data consists of several disjoint sets of objects exhibiting similar features. Empirical evidence from numerical experiments supporting these theoretical guarantees is also provided

    Interplay of chiral and helical states in a Quantum Spin Hall Insulator lateral junction

    Full text link
    We study the electronic transport across an electrostatically-gated lateral junction in a HgTe quantum well, a canonical 2D topological insulator, with and without applied magnetic field. We control carrier density inside and outside a junction region independently and hence tune the number and nature of 1D edge modes propagating in each of those regions. Outside the 2D gap, magnetic field drives the system to the quantum Hall regime, and chiral states propagate at the edge. In this regime, we observe fractional plateaus which reflect the equilibration between 1D chiral modes across the junction. As carrier density approaches zero in the central region and at moderate fields, we observe oscillations in resistance that we attribute to Fabry-Perot interference in the helical states, enabled by the broken time reversal symmetry. At higher fields, those oscillations disappear, in agreement with the expected absence of helical states when band inversion is lifted.Comment: 5 pages, 4 figures, supp. ma
    • …
    corecore