oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Any time

2019 ( 49 )

2018 ( 89 )

2017 ( 87 )

2016 ( 111 )

Custom range...

Search Results: 1 - 10 of 32712 matches for " Daniel Cormode "
All listed articles are free for downloading (OA Articles)
Page 1 /32712
Display every page Item
Individual Privacy vs Population Privacy: Learning to Attack Anonymization
Graham Cormode
Computer Science , 2010,
Abstract: Over the last decade there have been great strides made in developing techniques to compute functions privately. In particular, Differential Privacy gives strong promises about conclusions that can be drawn about an individual. In contrast, various syntactic methods for providing privacy (criteria such as kanonymity and l-diversity) have been criticized for still allowing private information of an individual to be inferred. In this report, we consider the ability of an attacker to use data meeting privacy definitions to build an accurate classifier. We demonstrate that even under Differential Privacy, such classifiers can be used to accurately infer "private" attributes in realistic data. We compare this to similar approaches for inferencebased attacks on other forms of anonymized data. We place these attacks on the same scale, and observe that the accuracy of inference of private attributes for Differentially Private data and l-diverse data can be quite similar.
Response of graphene to femtosecond high-intensity laser irradiation
Adam Roberts,Daniel Cormode,Collin Reynolds,Ty Newhouse-Illige,Brian J. LeRoy,Arvinder S. Sandhu
Physics , 2011, DOI: 10.1063/1.3623760
Abstract: We study the response of graphene to high-intensity 10^11-10^12 Wcm^-2, 50-femtosecond laser pulse excitation. We establish that graphene has a fairly high (~3\times10^12Wcm^-2) single-shot damage threshold. Above this threshold, a single laser pulse cleanly ablates graphene, leaving microscopically defined edges. Below this threshold, we observe laser-induced defect formation that leads to degradation of the lattice over multiple exposures. We identify the lattice modification processes through in-situ Raman microscopy. The effective lifetime of CVD graphene under femtosecond near-IR irradiation and its dependence on laser intensity is determined. These results also define the limits of non-linear applications of graphene in femtosecond high-intensity regime.
Optical characterization of electron-phonon interactions at the saddle point in graphene
Adam T. Roberts,Rolf Binder,Nai H. Kwong,Dheeraj Golla,Daniel Cormode,Brian J. LeRoy,Henry O. Everitt,Arvinder Sandhu
Physics , 2013, DOI: 10.1103/PhysRevLett.112.187401
Abstract: The role of electron-phonon interactions is experimentally and theoretically investigated near the saddle point absorption peak of graphene. The differential optical transmission spectra of multiple, non-interacting layers of graphene reveals the dominant role played by electron-acoustic phonon coupling in bandstructure renormalization. Using a Born approximation for electron-phonon coupling and experimental estimates of the dynamic phonon lattice temperature, we deduce the effective acoustic deformation potential to be $D^{\rm ac}_{\rm eff} \simeq 5$eV. This value is in accord with recent theoretical predictions but differs substantially from those obtained using electrical transport measurements.
Histograms and Wavelets on Probabilistic Data
Graham Cormode,Minos Garofalakis
Computer Science , 2008,
Abstract: There is a growing realization that uncertain information is a first-class citizen in modern database management. As such, we need techniques to correctly and efficiently process uncertain data in database systems. In particular, data reduction techniques that can produce concise, accurate synopses of large probabilistic relations are crucial. Similar to their deterministic relation counterparts, such compact probabilistic data synopses can form the foundation for human understanding and interactive data exploration, probabilistic query planning and optimization, and fast approximate query processing in probabilistic database systems. In this paper, we introduce definitions and algorithms for building histogram- and wavelet-based synopses on probabilistic data. The core problem is to choose a set of histogram bucket boundaries or wavelet coefficients to optimize the accuracy of the approximate representation of a collection of probabilistic tuples under a given error metric. For a variety of different error metrics, we devise efficient algorithms that construct optimal or near optimal B-term histogram and wavelet synopses. This requires careful analysis of the structure of the probability distributions, and novel extensions of known dynamic-programming-based techniques for the deterministic domain. Our experiments show that this approach clearly outperforms simple ideas, such as building summaries for samples drawn from the data distribution, while taking equal or less time.
A Second Look at Counting Triangles in Graph Streams
Graham Cormode,Hossein Jowhari
Computer Science , 2014,
Abstract: In this paper we present improved results on the problem of counting triangles in edge streamed graphs. For graphs with $m$ edges and at least $T$ triangles, we show that an extra look over the stream yields a two-pass streaming algorithm that uses $O(\frac{m}{\epsilon^{4.5}\sqrt{T}})$ space and outputs a $(1+\epsilon)$ approximation of the number of triangles in the graph. This improves upon the two-pass streaming tester of Braverman, Ostrovsky and Vilenchik, ICALP 2013, which distinguishes between triangle-free graphs and graphs with at least $T$ triangle using $O(\frac{m}{T^{1/3}})$ space. Also, in terms of dependence on $T$, we show that more passes would not lead to a better space bound. In other words, we prove there is no constant pass streaming algorithm that distinguishes between triangle-free graphs from graphs with at least $T$ triangles using $O(\frac{m}{T^{1/2+\rho}})$ space for any constant $\rho \ge 0$.
Emergence of Superlattice Dirac Points in Graphene on Hexagonal Boron Nitride
Matthew Yankowitz,Jiamin Xue,Daniel Cormode,Javier D. Sanchez-Yamagishi,K. Watanabe,T. Taniguchi,Pablo Jarillo-Herrero,Philippe Jacquod,Brian J. LeRoy
Physics , 2012, DOI: 10.1038/nphys2272
Abstract: The Schr\"odinger equation dictates that the propagation of nearly free electrons through a weak periodic potential results in the opening of band gaps near points of the reciprocal lattice known as Brillouin zone boundaries. However, in the case of massless Dirac fermions, it has been predicted that the chirality of the charge carriers prevents the opening of a band gap and instead new Dirac points appear in the electronic structure of the material. Graphene on hexagonal boron nitride (hBN) exhibits a rotation dependent Moir\'e pattern. In this letter, we show experimentally and theoretically that this Moir\'e pattern acts as a weak periodic potential and thereby leads to the emergence of a new set of Dirac points at an energy determined by its wavelength. The new massless Dirac fermions generated at these superlattice Dirac points are characterized by a significantly reduced Fermi velocity. The local density of states near these Dirac cones exhibits hexagonal modulations indicating an anisotropic Fermi velocity.
Verifying Computations with Streaming Interactive Proofs
Graham Cormode,Justin Thaler,Ke Yi
Computer Science , 2011,
Abstract: When computation is outsourced, the data owner would like to be assured that the desired computation has been performed correctly by the service provider. In theory, proof systems can give the necessary assurance, but prior work is not sufficiently scalable or practical. In this paper, we develop new proof protocols for verifying computations which are streaming in nature: the verifier (data owner) needs only logarithmic space and a single pass over the input, and after observing the input follows a simple protocol with a prover (service provider) that takes logarithmic communication spread over a logarithmic number of rounds. These ensure that the computation is performed correctly: that the service provider has not made any errors or missed out some data. The guarantee is very strong: even if the service provider deliberately tries to cheat, there is only vanishingly small probability of doing so undetected, while a correct computation is always accepted. We first observe that some theoretical results can be modified to work with streaming verifiers, showing that there are efficient protocols for problems in the complexity classes NP and NC. Our main results then seek to bridge the gap between theory and practice by developing usable protocols for a variety of problems of central importance in streaming and database processing. All these problems require linear space in the traditional streaming model, and therefore our protocols demonstrate that adding a prover can exponentially reduce the effort needed by the verifier. Our experimental results show that our protocols are practical and scalable.
Structure-Aware Sampling: Flexible and Accurate Summarization
Edith Cohen,Graham Cormode,Nick Duffield
Computer Science , 2011,
Abstract: In processing large quantities of data, a fundamental problem is to obtain a summary which supports approximate query answering. Random sampling yields flexible summaries which naturally support subset-sum queries with unbiased estimators and well-understood confidence bounds. Classic sample-based summaries, however, are designed for arbitrary subset queries and are oblivious to the structure in the set of keys. The particular structure, such as hierarchy, order, or product space (multi-dimensional), makes range queries much more relevant for most analysis of the data. Dedicated summarization algorithms for range-sum queries have also been extensively studied. They can outperform existing sampling schemes in terms of accuracy on range queries per summary size. Their accuracy, however, rapidly degrades when, as is often the case, the query spans multiple ranges. They are also less flexible - being targeted for range sum queries alone - and are often quite costly to build and use. In this paper we propose and evaluate variance optimal sampling schemes that are structure-aware. These summaries improve over the accuracy of existing structure-oblivious sampling schemes on range queries while retaining the benefits of sample-based summaries: flexible summaries, with high accuracy on both range queries and arbitrary subset queries.
Node Classification in Social Networks
Smriti Bhagat,Graham Cormode,S. Muthukrishnan
Computer Science , 2011, DOI: 10.1007/978-1-4419-8462-3_5
Abstract: When dealing with large graphs, such as those that arise in the context of online social networks, a subset of nodes may be labeled. These labels can indicate demographic values, interest, beliefs or other characteristics of the nodes (users). A core problem is to use this information to extend the labeling so that all nodes are assigned a label (or labels). In this chapter, we survey classification techniques that have been proposed for this problem. We consider two broad categories: methods based on iterative application of traditional classifiers using graph information as features, and methods which propagate the existing labels via random walks. We adopt a common perspective on these methods to highlight the similarities between different approaches within and across the two categories. We also describe some extensions and related directions to the central problem of node classification.
Scienceography: the study of how science is written
Graham Cormode,S. Muthukrishnan,Jinyun Yan
Computer Science , 2012,
Abstract: Scientific literature has itself been the subject of much scientific study, for a variety of reasons: understanding how results are communicated, how ideas spread, and assessing the influence of areas or individuals. However, most prior work has focused on extracting and analyzing citation and stylistic patterns. In this work, we introduce the notion of 'scienceography', which focuses on the writing of science. We provide a first large scale study using data derived from the arXiv e-print repository. Crucially, our data includes the "source code" of scientific papers-the LaTEX source-which enables us to study features not present in the "final product", such as the tools used and private comments between authors. Our study identifies broad patterns and trends in two example areas-computer science and mathematics-as well as highlighting key differences in the way that science is written in these fields. Finally, we outline future directions to extend the new topic of scienceography.
Page 1 /32712
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.