Finding One Common Item, Privately

Private set intersection (PSI) allows two parties, who each hold a set of items, to learn which items they have in common, without revealing anything about their other items. Some applications of PSI would be better served by revealing only one common item, rather than the entire set of all common items. In this work we develop simple special-purpose protocols for privately finding one common item (FOCI) from the intersection of two sets. The protocols differ in how that item is chosen --- e.g., uniformly at random from the intersection; the best item in the intersection according to one party\u27s ranking; or the best item in the intersection according to the sum of both party\u27s scores. All of our protocols are proven secure against semi-honest adversaries, under the Decisional Diffie-Hellman (DDH) assumption and assuming a random oracle. All of our protocols leak a small amount of information (e.g., the cardinality of the intersection), which we precisely quantify

Tight lower bounds for certain parameterized NP-hard problems

Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by proving a general result, namely that the parameterized weighted satisfiability problem on depth-t circuits cannot be solved in time no(k) poly(m), where n is the circuit input length, m is the circuit size, and k is the parameter, unless the (t − 1)-st level W [t − 1] of the W-hierarchy collapses to FPT. By refining this technique, we prove that a group of parameterized NP-hard problems, including weighted sat, dominating set, hitting set, set cover, and feature set, cannot be solved in time no(k) poly(m), where n is the size of the universal set from which the k elements are to be selected and m is the instance size, unless the first level W [1] of the W-hierarchy collapses to FPT. We also prove that another group of parameterized problems which includes weighted q-sat (for any fixed q ≥ 2), clique, and independent set, cannot be solved in time no(k) unless all search problems in the syntactic class SNP, introduced by Papadimitriou and Yannakakis, are solvable in subexponential time. Note that all these parameterized problems have trivial algorithms of running time either n k poly(m) or O(n k).

An improvement in MATSim computing time for large-scale travel behaviour microsimulation

Abstract: Coupling activity-based models with dynamic traffic assignment appears to form a promising approach to investigating travel demand. However, such an integrated framework is generally time-consuming, especially for large-scale scenarios. This paper attempts to improve the performance of these kinds of integrated frameworks through some simple adjustments using MATSim as an example. We focus on two specific areas of the model—replanning and time stepping. In the first case we adjust the scoring system for agents to use in assessing their travel plans to include only agents with low plan scores, rather than selecting agents at random, as is the case in the current model. Secondly, we vary the model time step to account for network loading in the execution module of MATSim. The city of Baoding, China is used as a case study. The performance of the proposed methods was assessed through comparison between the improved and original MATSim, calibrated using Cadyts. The results suggest that the first solution can significantly decrease the computing time at the cost of slight increase of model error, but the second solution makes the improved MATSim outperform the original one, both in terms of computing time and model accuracy; Integrating all new proposed methods takes still less computing time and obtains relatively accurate outcomes, compared with those only incorporating one new method

Role of synthesis method on microstructure and mechanical properties of graphene/carbon nanotube toughened Al2O3 nanocomposites

Copyright © 2015 Elsevier. NOTICE: this is the author’s version of a work that was accepted for publication in Ceramics International. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Ceramics International (2015), DOI: 10.1016/j.ceramint.2015.04.054The effects of hot-pressing (HP) and spark plasma sintering (SPS) methods on the grain size, microstructural features, and mechanical behaviour of graphene nanoplatelet/carbon nanotubes (GNTs) reinforced Al2O3 nanocomposites were comprehensively studied. Different graphene nanoplatelet to carbon nanotube ratios were selected as the overall reinforcement content of composites prepared using HP and SPS. Highly densified samples (>98%) were obtained at 1650 °C under 40 MPa in Ar atmosphere, with dwell times of 1 h and 10 min for HP and SPS respectively. Both types of sample showed a mixture of inter- and transgranular fracture behaviour. A 50% grain size reduction was observed for samples prepared by HP compared to SPS samples. Both types of samples achieved a high flexural strength and fracture toughness of >400 MPa and 5.5 MPa m1/2, whilst SPS samples peaked at relatively lower GNT contents than those for the HP samples. Based on analyses of the morphology, grain sizes and fracture mode, similar toughening mechanisms for both types of sample were observed, involving the complex characteristics of the combined GNT fillers.University of Exeter - scholarshipEngineering and Physical Sciences Research Council (EPSRC)Sunchon National University, South Korea - BK21+programm

The evolutionary dynamics of variant antigen genes in Babesia reveal a history of genomic innovation underlying host-parasite interaction

Babesia spp. are tick-borne, intraerythrocytic hemoparasites that use antigenic variation to resist host immunity, through sequential modification of the parasite-derived variant erythrocyte surface antigen (VESA) expressed on the infected red blood cell surface. We identified the genomic processes driving antigenic diversity in genes encoding VESA (ves1) through comparative analysis within and between three Babesia species, (B. bigemina, B. divergens and B. bovis). Ves1 structure diverges rapidly after speciation, notably through the evolution of shortened forms (ves2) from 5′ ends of canonical ves1 genes. Phylogenetic analyses show that ves1 genes are transposed between loci routinely, whereas ves2 genes are not. Similarly, analysis of sequence mosaicism shows that recombination drives variation in ves1 sequences, but less so for ves2, indicating the adoption of different mechanisms for variation of the two families. Proteomic analysis of the B. bigemina PR isolate shows that two dominant VESA1 proteins are expressed in the population, whereas numerous VESA2 proteins are co-expressed, consistent with differential transcriptional regulation of each family. Hence, VESA2 proteins are abundant and previously unrecognized elements of Babesia biology, with evolutionary dynamics consistently different to those of VESA1, suggesting that their functions are distinct

DNAJC21 Mutations Link a Cancer-Prone Bone Marrow Failure Syndrome to Corruption in 60S Ribosome Subunit Maturation

This work was funded by The Medical Research Council UK (MR/K000292/1), Children with Cancer UK (2013/144), Barts and The London Charity (845/1796), and Leukaemia Lymphoma Research/Bloodwise (14032)

Reduction of Cosmological Data for the Detection of Time-varying Dark Energy Density

We present a method for reducing cosmological data to constraints on the amplitudes of modes of the dark energy density as a function of redshift. The modes are chosen so that (1) one of them has constant density and (2) the others are non-zero only if there is time-variation in the dark energy density and (3) the amplitude errors for the time-varying modes are uncorrelated with each other. We apply our method to various combinations of three-year WMAP data, baryon acoustic oscillation data, the 'Gold' supernova data set, and the Supernova Legacy Survey data set. We find no significant evidence for a time-varying dark energy density or for non-zero mean curvature. Although by some measure the limits on four of the time-varying mode amplitudes are quite tight, they are consistent with the expectation that the dark energy density does not vary on timescales shorter than a Hubble time. Since we do not expect detectable time variation in these modes, our results should be viewed as a systematic error test which the data have passed. We discuss a procedure to identify modes with maximal signal-to-noise ratio.Comment: 13 pages, 12 figures; Version accepted for publication by JCAP; Updated with three-year WMAP data; added discussion on systematic error detectio

A space hurricane over the Earth’s polar ionosphere

In Earth’s low atmosphere, hurricanes are destructive due to their great size, strong spiral winds with shears, and intense rain/precipitation. However, disturbances resembling hurricanes have not been detected in Earth’s upper atmosphere. Here, we report a long-lasting space hurricane in the polar ionosphere and magnetosphere during low solar and otherwise low geomagnetic activity. This hurricane shows strong circular horizontal plasma flow with shears, a nearly zero-flow center, and a coincident cyclone-shaped aurora caused by strong electron precipitation associated with intense upward magnetic field-aligned currents. Near the center, precipitating electrons were substantially accelerated to ~10 keV. The hurricane imparted large energy and momentum deposition into the ionosphere despite otherwise extremely quiet conditions. The observations and simulations reveal that the space hurricane is generated by steady high-latitude lobe magnetic reconnection and current continuity during a several hour period of northward interplanetary magnetic field and very low solar wind density and speed