77,445 research outputs found

    Dynamic Set Intersection

    Full text link
    Consider the problem of maintaining a family FF of dynamic sets subject to insertions, deletions, and set-intersection reporting queries: given S,SFS,S'\in F, report every member of SSS\cap S' in any order. We show that in the word RAM model, where ww is the word size, given a cap dd on the maximum size of any set, we can support set intersection queries in O(dw/log2w)O(\frac{d}{w/\log^2 w}) expected time, and updates in O(logw)O(\log w) expected time. Using this algorithm we can list all tt triangles of a graph G=(V,E)G=(V,E) in O(m+mαw/log2w+t)O(m+\frac{m\alpha}{w/\log^2 w} +t) expected time, where m=Em=|E| and α\alpha is the arboricity of GG. This improves a 30-year old triangle enumeration algorithm of Chiba and Nishizeki running in O(mα)O(m \alpha) time. We provide an incremental data structure on FF that supports intersection {\em witness} queries, where we only need to find {\em one} eSSe\in S\cap S'. Both queries and insertions take O\paren{\sqrt \frac{N}{w/\log^2 w}} expected time, where N=SFSN=\sum_{S\in F} |S|. Finally, we provide time/space tradeoffs for the fully dynamic set intersection reporting problem. Using MM words of space, each update costs O(MlogN)O(\sqrt {M \log N}) expected time, each reporting query costs O(NlogNMop+1)O(\frac{N\sqrt{\log N}}{\sqrt M}\sqrt{op+1}) expected time where opop is the size of the output, and each witness query costs O(NlogNM+logN)O(\frac{N\sqrt{\log N}}{\sqrt M} + \log N) expected time.Comment: Accepted to WADS 201

    Explicit Solution of the Time Domain Volume Integral Equation Using a Stable Predictor-Corrector Scheme

    Get PDF
    An explicit marching-on-in-time (MOT) scheme for solving the time domain volume integral equation is presented. The proposed method achieves its stability by employing, at each time step, a corrector scheme, which updates/corrects fields computed by the explicit predictor scheme. The proposedmethod is computationally more efficient when compared to the existing filtering techniques used for the stabilization of explicit MOT schemes. Numerical results presented in this paper demonstrate that the proposed method maintains its stability even when applied to the analysis of electromagnetic wave interactions with electrically large structures meshed using approximately half a million discretization elements

    A molecular target for viral killer toxin: TOK1 potassium channels.

    Get PDF
    Killer strains of S. cerevisiae harbor double-stranded RNA viruses and secrete protein toxins that kill virus-free cells. The K1 killer toxin acts on sensitive yeast cells to perturb potassium homeostasis and cause cell death. Here, the toxin is shown to activate the plasma membrane potassium channel of S. cerevisiae, TOK1. Genetic deletion of TOK1 confers toxin resistance; overexpression increases susceptibility. Cells expressing TOK1 exhibit toxin-induced potassium flux; those without the gene do not. K1 toxin acts in the absence of other viral or yeast products: toxin synthesized from a cDNA increases open probability of single TOK1 channels (via reversible destabilization of closed states) whether channels are studied in yeast cells or X. laevis oocytes

    Colored Non-Crossing Euclidean Steiner Forest

    Full text link
    Given a set of kk-colored points in the plane, we consider the problem of finding kk trees such that each tree connects all points of one color class, no two trees cross, and the total edge length of the trees is minimized. For k=1k=1, this is the well-known Euclidean Steiner tree problem. For general kk, a kρk\rho-approximation algorithm is known, where ρ1.21\rho \le 1.21 is the Steiner ratio. We present a PTAS for k=2k=2, a (5/3+ε)(5/3+\varepsilon)-approximation algorithm for k=3k=3, and two approximation algorithms for general~kk, with ratios O(nlogk)O(\sqrt n \log k) and k+εk+\varepsilon

    Strain- and Adsorption-Dependent Electronic States and Transport or Localization in Graphene

    Full text link
    The chapter generalizes results on influence of uniaxial strain and adsorption on the electron states and charge transport or localization in graphene with different configurations of imperfections (point defects): resonant (neutral) adsorbed atoms either oxygen- or hydrogen-containing molecules or functional groups, vacancies or substitutional atoms, charged impurity atoms or molecules, and distortions. To observe electronic properties of graphene-admolecules system, we applied electron paramagnetic resonance technique in a broad temperature range for graphene oxides as a good basis for understanding the electrotransport properties of other active carbons. Applied technique allowed observation of possible metal-insulator transition and sorption pumping effect as well as discussion of results in relation to the granular metal model. The electronic and transport properties are calculated within the framework of the tight-binding model along with the Kubo-Greenwood quantum-mechanical formalism. Depending on electron density and type of the sites, the conductivity for correlated and ordered adsorbates is found to be enhanced in dozens of times as compared to the cases of their random distribution. In case of the uniaxially strained graphene, the presence of point defects counteracts against or contributes to the band-gap opening according to their configurations. The band-gap behaviour is found to be nonmonotonic with strain in case of a simultaneous action of defect ordering and zigzag deformation. The amount of localized charge carriers (spins) is found to be correlated with the content of adsorbed centres responsible for the formation of potential barriers and, in turn, for the localization effects. Physical and chemical states of graphene edges, especially at a uniaxial strain along one of them, play a crucial role in electrical transport phenomena in graphene-based materials.Comment: 16 pages, 10 figure

    Knuthian Drawings of Series-Parallel Flowcharts

    Full text link
    Inspired by a classic paper by Knuth, we revisit the problem of drawing flowcharts of loop-free algorithms, that is, degree-three series-parallel digraphs. Our drawing algorithms show that it is possible to produce Knuthian drawings of degree-three series-parallel digraphs with good aspect ratios and small numbers of edge bends.Comment: Full versio
    corecore