Lower bounds in differential privacy

This is a paper about private data analysis, in which a trusted curator holding a confidential database responds to real vector-valued queries. A common approach to ensuring privacy for the database elements is to add appropriately generated random noise to the answers, releasing only these {\em noisy} responses. In this paper, we investigate various lower bounds on the noise required to maintain different kind of privacy guarantees.Comment: Corrected some minor errors and typos. To appear in Theory of Cryptography Conference (TCC) 201

The Limit of Public Policy: Endogenous Preferences

In designing public policy it is not enough to consider the possible reaction of individuals to the chosen policy.Public policy may also affect the formation of preferences and norms in a society.The endogenous evolution of preferences, in addition to introducing a conceptual difficulty in evaluating policies, may also eventually affect actual behavior.In order to demonstrate the implications of endogenous preferences on the design of optimal public policy, we present a model in which a subsidy policy is set to encourage contributions towards a public good.However this policy triggers an endogenous preference change that results in a lower level of contribution towards the public good despite the explicit monetary incentives to raise that level.public policy

Measuring impact of academic research in computer and information science on society

Academic research in computer & information science (CIS) has contributed immensely to all aspects of society. As academic research today is substantially supported by various government sources, recent political changes have created ambivalence amongst academics about the future of research funding. With uncertainty looming, it is important to develop a framework to extract and measure the information relating to impact of CIS research on society to justify public funding, and demonstrate the actual contribution and impact of CIS research outside academia. A new method combining discourse analysis and text mining of a collection of over 1000 pages of impact case study documents written in free-text format for the Research Excellence Framework (REF) 2014 was developed in order to identify the most commonly used categories or headings for reporting impact of CIS research by UK Universities (UKU). According to the research reported in REF2014, UKU acquired 83 patents in various areas of CIS, created 64 spin-offs, generated £857.5 million in different financial forms, created substantial employment, reached over 6 billion users worldwide and has helped save over £1 billion Pounds due to improved processes etc. to various sectors internationally, between 2008 and 2013

Proposing "b-Parity" - a New Approximate Quantum Number in Inclusive b-jet Production - as an Efficient Probe of New Flavor Physics

We consider the inclusive reaction \ell^+ \ell^- -> nb +X (n = number of b-jets) in lepton colliders for which we propose a useful approximately conserved quantum number b_P=(-1)^n that we call b-Parity (b_P). We make the observation that the Standard Model (SM) is essentially b_P-even since SM b_P-violating signals are necessarily CKM suppressed. In contrast new flavor physics can produce b_P=-1 signals whose only significant SM background is due to b-jet misidentification. Thus, we show that b-jet counting, which relies primarily on b-tagging, becomes a very simple and sensitive probe of new flavor physics (i.e., of b_P-violation).Comment: 5 pages using revtex, 2 figures embadded in the text using epsfig. As will appear in Phys.Rev.Lett.. Considerable improvement was made in the background calculation as compared to version 1, by including purity parameters, QCD effects and 4-jets processe

A study of the Hartree-Fock model space for light deformed nuclei

Effects of altering truncated basis space used in Hartree Fock model for light deformed nucle

A TQFT associated to the LMO invariant of three-dimensional manifolds

We construct a Topological Quantum Field Theory (in the sense of Atiyah) associated to the universal finite-type invariant of 3-dimensional manifolds, as a functor from the category of 3-dimensional manifolds with parametrized boundary, satisfying some additional conditions, to an algebraic-combinatorial category. It is built together with its truncations with respect to a natural grading, and we prove that these TQFTs are non-degenerate and anomaly-free. The TQFT(s) induce(s) a (series of) representation(s) of a subgroup ${\cal L}_g$ of the Mapping Class Group that contains the Torelli group. The N=1 truncation produces a TQFT for the Casson-Walker-Lescop invariant.Comment: 28 pages, 13 postscript figures. Version 2 (Section 1 has been considerably shorten, and section 3 has been slightly shorten, since they will constitute a separate paper. Section 4, which contained only announce of results, has been suprimated; it will appear in detail elsewhere. Consequently some statements have been re-numbered. No mathematical changes have been made.

Conflict-Free Coloring Made Stronger

In FOCS 2002, Even et al. showed that any set of $n$ discs in the plane can be Conflict-Free colored with a total of at most $O(\log n)$ colors. That is, it can be colored with $O(\log n)$ colors such that for any (covered) point $p$ there is some disc whose color is distinct from all other colors of discs containing $p$. They also showed that this bound is asymptotically tight. In this paper we prove the following stronger results: \begin{enumerate} \item [(i)] Any set of $n$ discs in the plane can be colored with a total of at most $O(k \log n)$ colors such that (a) for any point $p$ that is covered by at least $k$ discs, there are at least $k$ distinct discs each of which is colored by a color distinct from all other discs containing $p$ and (b) for any point $p$ covered by at most $k$ discs, all discs covering $p$ are colored distinctively. We call such a coloring a {\em $k$-Strong Conflict-Free} coloring. We extend this result to pseudo-discs and arbitrary regions with linear union-complexity. \item [(ii)] More generally, for families of $n$ simple closed Jordan regions with union-complexity bounded by $O(n^{1+\alpha})$, we prove that there exists a $k$-Strong Conflict-Free coloring with at most $O(k n^\alpha)$ colors. \item [(iii)] We prove that any set of $n$ axis-parallel rectangles can be $k$-Strong Conflict-Free colored with at most $O(k \log^2 n)$ colors. \item [(iv)] We provide a general framework for $k$-Strong Conflict-Free coloring arbitrary hypergraphs. This framework relates the notion of $k$-Strong Conflict-Free coloring and the recently studied notion of $k$-colorful coloring. \end{enumerate} All of our proofs are constructive. That is, there exist polynomial time algorithms for computing such colorings