Search

Un-manned aerial vehicle (UAVs) have the potential to change the landscape of wide-area wireless connectivity by bringing them to areas where connectivity was sparing or non-existent (e.g. rural areas) or has been compromised due to disasters. While Google's Project Loon and Facebook's Project Aquila are examples of high-altitude, long-endurance UAV-based connectivity efforts in this direction, the telecom operators (e.g. AT&T and Verizon) have been exploring low-altitude UAV-based LTE solutions for on-demand deployments. Understandably, these projects are in their early stages and face formidable challenges in their realization and deployment. The goal of this document is to expose the reader to both the challenges as well as the potential offered by these unconventional connectivity solutions. We aim to explore the end-to-end design of such UAV-based connectivity networks particularly in the context of low-altitude UAV networks providing LTE connectivity. Specifically, we aim to highlight the challenges that span across multiple layers (access, core network, and backhaul) in an inter-twined manner as well as the richness and complexity of the design space itself. To help interested readers navigate this complex design space towards a solution, we also articulate the overview of one such end-to-end design, namely SkyLiTE-- a self-organizing network of low-altitude UAVs that provide optimized LTE connectivity in a desired region.

In this paper, we present Velocity, a decentralized market deployed on Ethereum for trading a custom type of derivative option. To enable the smart contract to work, we also implement a price fetching tool called PriceGeth. We present this as a case study, noting challenges in development of the system that might be of independent interest to whose working on smart contract implementations. We also apply recent academic results on the security of the Solidity smart contract language in validating our codes security. Finally, we discuss more generally the use of smart contracts in modelling financial derivatives., Comment: 15 pages, 1st Workshop on Trusted Smart Contracts In Association with Financial Cryptography 17 April 07, 2017

Qubits strongly coupled to a photonic crystal give rise to many exotic physical scenarios, beginning with single and multi-excitation qubit-photon dressed bound states comprising induced spatially localized photonic modes, centered around the qubits, and the qubits themselves. The localization of these states changes with qubit detuning from the band-edge, offering an avenue of in situ control of bound state interaction. Here, we present experimental results from a device with two qubits coupled to a superconducting microwave photonic crystal and realize tunable on-site and inter-bound state interactions. We observe a fourth-order two photon virtual process between bound states indicating strong coupling between the photonic crystal and qubits. Due to their localization-dependent interaction, these states offer the ability to create one-dimensional chains of bound states with tunable and potentially long-range interactions that preserve the qubits' spatial organization, a key criterion for realization of certain quantum many-body models. The widely tunable, strong and robust interactions demonstrated with this system are promising benchmarks towards realizing larger, more complex systems of bound states.

The problem of detecting an odd arm from a set of K arms of a multi-armed bandit, with fixed confidence, is studied in a sequential decision-making scenario. Each arm's signal follows a distribution from a vector exponential family. All arms have the same parameters except the odd arm. The actual parameters of the odd and non-odd arms are unknown to the decision maker. Further, the decision maker incurs a cost for switching from one arm to another. This is a sequential decision making problem where the decision maker gets only a limited view of the true state of nature at each stage, but can control his view by choosing the arm to observe at each stage. Of interest are policies that satisfy a given constraint on the probability of false detection. An information-theoretic lower bound on the total cost (expected time for a reliable decision plus total switching cost) is first identified, and a variation on a sequential policy based on the generalised likelihood ratio statistic is then studied. Thanks to the vector exponential family assumption, the signal processing in this policy at each stage turns out to be very simple, in that the associated conjugate prior enables easy updates of the posterior distribution of the model parameters. The policy, with a suitable threshold, is shown to satisfy the given constraint on the probability of false detection. Further, the proposed policy is asymptotically optimal in terms of the total cost among all policies that satisfy the constraint on the probability of false detection.

The growing market for smart home IoT devices promises new conveniences for consumers while presenting new challenges for preserving privacy within the home. Many smart home devices have always-on sensors that capture users' offline activities in their living spaces and transmit information about these activities on the Internet. In this paper, we demonstrate that an ISP or other network observer can infer privacy sensitive in-home activities by analyzing Internet traffic from smart homes containing commercially-available IoT devices even when the devices use encryption. We evaluate several strategies for mitigating the privacy risks associated with smart home device traffic, including blocking, tunneling, and rate-shaping. Our experiments show that traffic shaping can effectively and practically mitigate many privacy risks associated with smart home IoT devices. We find that 40KB/s extra bandwidth usage is enough to protect user activities from a passive network adversary. This bandwidth cost is well within the Internet speed limits and data caps for many smart homes., Comment: 16 pages, 9 figures. This article draws heavily from arXiv:1705.06805 and arXiv:1705.06809

We consider the problem of designing a revenue-optimal mechanism in the two-item, single-buyer, unit-demand setting when the buyer's valuations, $(z_1, z_2)$, are uniformly distributed in an arbitrary rectangle $[c,c+b_1]\times[c,c+b_2]$ in the positive quadrant. We provide a complete and explicit solution for arbitrary nonnegative values of $(c,b_1,b_2)$. We identify five simple structures, each with at most five (possibly stochastic) menu items, and prove that the optimal mechanism has one of the five structures. We also characterize the optimal mechanism as a function of $b_1, b_2$, and $c$. When $c$ is low, the optimal mechanism is a posted price mechanism with an exclusion region; when $c$ is high, it is a posted price mechanism without an exclusion region. Our results are the first to show the existence of optimal mechanisms with no exclusion region, to the best of our knowledge.

The ground state of the frustrated A-site magnetic spinel CoAl2O4 has been a controversial issue whether it is a collinear antiferromagnetic ordering or a spiral spin - liquid state, as the ratio of the two competing interactions, J2/J1 lies close to the boundary between these two ground states. Here, we address the magnetic ground state in CoAl2O4 with different amount of Co2+/Al3+ site disorder from the study of magnetoelectric effect and Monte Carlo simulations. CoAl2O4 with low site disorder exhibits linear magnetoelectric effect below the magnetic ordering temperature. With increasing disorder, the magnetoelectric effect is suppressed and the sample with 14% disorder exhibits a spin glass behavior without the magnetoelectric effect. Monte Carlo simulations support the experimental findings and suggest that the site disorder suppresses long - range antiferromagnetic order and induces a spin glass state. Since the linear magnetoelectric effect requires a long - range magnetic ordering, we suggest that the ground state of CoAl2O4 with low site disorder is a collinear antiferromagnet., Comment: 38 pages, 14 figures

The aim of this work is to establish that two recently published projection theorems, one dealing with a parametric generalization of relative entropy and another dealing with R\'{e}nyi divergence, are equivalent under a correspondence on the space of probability measures. Further, we demonstrate that the associated "Pythagorean" theorems are equivalent under this correspondence. Finally, we apply Eguchi's method of obtaining Riemannian metrics from general divergence functions to show that the geometry arising from the above divergences are equivalent under the aforementioned correspondence., Comment: 13 pages

In this work, we tackle the problem of hidden community detection. We consider Belief Propagation (BP) applied to the problem of detecting a hidden Erd\H{o}s-R\'enyi (ER) graph embedded in a larger and sparser ER graph, in the presence of side-information. We derive two related algorithms based on BP to perform subgraph detection in the presence of two kinds of side-information. The first variant of side-information consists of a set of nodes, called cues, known to be from the subgraph. The second variant of side-information consists of a set of nodes that are cues with a given probability. It was shown in past works that BP without side-information fails to detect the subgraph correctly when an effective signal-to-noise ratio (SNR) parameter falls below a threshold. In contrast, in the presence of non-trivial side-information, we show that the BP algorithm achieves asymptotically zero error for any value of the SNR parameter. We validate our results through simulations on synthetic datasets as well as on a few real world networks.

This paper is about allocation of an infinitely divisible good to several rational and strategic agents. The allocation is done by a social planner who has limited information because the agents' valuation functions are taken to be private information known only to the respective agents. We allow only a scalar signal, called a bid, from each agent to the social planner. Yang and Hajek [Jour. on Selected Areas in Comm., 2007] as well as Johari and Tsitsiklis [Jour. of Oper. Res., 2009] proposed a scalar strategy Vickrey-Clarke-Groves (SSVCG) mechanism with efficient Nash equilibria. We consider a setting where the social planner desires minimal budget surplus. Example situations include fair sharing of Internet resources and auctioning of certain public goods where revenue maximization is not a consideration. Under the SSVCG framework, we propose a mechanism that is efficient and comes close to budget balance by returning much of the payments back to the agents in the form of rebates. We identify a design criterion for {\em almost budget balance}, impose feasibility and voluntary participation constraints, simplify the constraints, and arrive at a convex optimization problem to identify the parameters of the rebate functions. The convex optimization problem has a linear objective function and a continuum of linear constraints. We propose a solution method that involves a finite number of constraints, and identify the number of samples sufficient for a good approximation., Comment: Accepted for publication in the European Journal of Operational Research (EJOR)

We consider the design of a revenue-optimal mechanism when two items are available to be sold to a single buyer whose valuation is uniformly distributed over an arbitrary rectangle $[c_1,c_1+b_1]\times[c_2,c_2+b_2]$ in the positive quadrant. We provide an explicit, complete solution for arbitrary nonnegative values of $(c_1,c_2,b_1,b_2)$. We identify eight simple structures, each with at most $4$ (possibly stochastic) menu items, and prove that the optimal mechanism has one of these eight structures. We also characterize the optimal mechanism as a function of $(c_1,c_2,b_1,b_2)$. The structures indicate that the optimal mechanism involves (a) an interplay of individual sale and a bundle sale when $c_1$ and $c_2$ are low, (b) a bundle sale when $c_1$ and $c_2$ are high, and (c) an individual sale when one of them is high and the other is low. To the best of our knowledge, our results are the first to show the existence of optimal mechanisms with no exclusion region. We further conjecture, based on promising preliminary results, that our methodology can be extended to a wider class of distributions., Comment: A preliminary version of the manuscript was published in Proceedings of the 12th Conference on Web and Internet Economics (WINE), 2016, Montreal, Canada

Third-party services form an integral part of the mobile ecosystem: they allow app developers to add features such as performance analytics and social network integration, and to monetize their apps by enabling user tracking and targeted ad delivery. At present users, researchers, and regulators all have at best limited understanding of this third-party ecosystem. In this paper we seek to shrink this gap. Using data from users of our ICSI Haystack app we gain a rich view of the mobile ecosystem: we identify and characterize domains associated with mobile advertising and user tracking, thereby taking an important step towards greater transparency. We furthermore outline our steps towards a public catalog and census of analytics services, their behavior, their personal data collection processes, and their use across mobile apps.

Distributed and iterative network utility maximization algorithms, such as the primal-dual algorithms or the network-user decomposition algorithms, often involve trajectories where the iterates may be infeasible, convergence to the optimal points of relaxed problems different from the original, or convergence to local maxima. In this paper, we highlight the three issues with iterative algorithms. We then propose a distributed and iterative algorithm that does not suffer from the three issues. In particular, we assert the feasibility of the algorithm's iterates at all times, convergence to the global maximum of the given problem (rather than to global maximum of a relaxed problem), and avoidance of any associated spurious rest points of the dynamics. A benchmark algorithm due to Kelly, Maulloo and Tan (1998) [Rate control for communication networks: shadow prices, proportional fairness and stability, Journal of the Operational Research Society, 49(3), 237-252] involves fast user updates coupled with slow network updates in the form of additive-increase multiplicative-decrease of suggested user flows. The proposed algorithm may be viewed as one with fast user updates and fast network updates that keeps the iterates feasible at all times. Simulations suggest that the convergence rate of the ordinary differential equation (ODE) tracked by our proposed algorithm's iterates is comparable to that of the ODE for the aforementioned benchmark algorithm., Comment: Submitted to Performance Evaluation

The paper considers the minimization of a separable convex function subject to linear ascending constraints. The problem arises as the core optimization in several resource allocation scenarios, and is a special case of an optimization of a separable convex function over the bases of a polymatroid with a certain structure. The paper presents a survey of state-of-the-art algorithms that solve this optimization problem. The algorithms are applicable to the class of separable convex objective functions that need not be smooth or strictly convex. When the objective function is a so-called $d$-separable function, a simpler linear time algorithm solves the problem.

Condensed matter physics has been driven forward by significant experimental and theoretical progress in the study and understanding of equilibrium phase transitions based on symmetry and topology. However, nonequilibrium phase transitions have remained a challenge, in part due to their complexity in theoretical descriptions and the additional experimental difficulties in systematically controlling systems out of equilibrium. Here, we study a one-dimensional chain of 72 microwave cavities, each coupled to a superconducting qubit, and coherently drive the system into a nonequilibrium steady state. We find experimental evidence for a dissipative phase transition in the system in which the steady state changes dramatically as the mean photon number is increased. Near the boundary between the two observed phases, the system demonstrates bistability, with characteristic switching times as long as 60 ms -- far longer than any of the intrinsic rates known for the system. This experiment demonstrates the power of circuit QED systems for studying nonequilibrium condensed matter physics and paves the way for future experiments exploring nonequilbrium physics with many-body quantum optics.

We present combined experimental and theoretical studies on the magnetic properties of a solid solution between yttrium orthoferrite and yttrium orthochromite systems, YFe$_{1-x}$Cr$_x$O$_3$ (0 $\leq$ x $\leq$ 1) where Fe$^{3+}$ and Cr$^{3+}$ ions are distributed randomly at the same crystallographic site (4b). We found that all the compositions exhibit weak ferromagnetism below the N\'eel temperature that decreases non-linearly with increasing $x$, while certain intermediate compositions ($x = 0.4,0.5$) show a compensation point and magnetization reversal. This unusual behavior is explained based on a simple model comprising the isotropic superexchange and the antisymmetric Dzyaloshinskii-Moriya interactions. This model explains the magnetization behavior in the entire range of doping and temperature including the magnetization reversal which results from an interplay of various DM interactions such as, Fe-O-Fe, Cr-O-Cr and Fe-O-Cr., Comment: 7 pages, 8 figures

Despite our growing reliance on mobile phones for a wide range of daily tasks, their operation remains largely opaque. A number of previous studies have addressed elements of this problem in a partial fashion, trading off analytic comprehensiveness and deployment scale. We overcome the barriers to large-scale deployment (e.g., requiring rooted devices) and comprehensiveness of previous efforts by taking a novel approach that leverages the VPN API on mobile devices to design Haystack, an in-situ mobile measurement platform that operates exclusively on the device, providing full access to the device's network traffic and local context without requiring root access. We present the design of Haystack and its implementation in an Android app that we deploy via standard distribution channels. Using data collected from 450 users of the app, we exemplify the advantages of Haystack over the state of the art and demonstrate its seamless experience even under demanding conditions. We also demonstrate its utility to users and researchers in characterizing mobile traffic and privacy risks., Comment: 13 pages incl. figures

We have synthesized a new crystallographically ordered quaternary Heusler alloy, MnNiCuSb. The crystal structure of the alloy has been determined by Rietveld refinement of the powder x-ray diffraction data. This alloy crystallizes in the LiMgPdSb type structure with F-43m space group. MnNiCuSb is a ferromagnet with a high TC ~ 690K and magnetic moment of 3.85MuB/f.u. Besides this we have also studied two other off-stoichiometric compositions; one Cu rich and the other Ni rich (MnNi0.9Cu1.1Sb and MnNi1.1Cu0.9Sb) which are also ferromagnets. It must be stressed that MnNiCuSb is one of the very few known, non-Fe containing quaternary Heusler alloys with 1: 1: 1: 1 composition., Comment: 10 pages, 4 figures

We consider the problem of detecting an odd process among a group of Poisson point processes, all having the same rate except the odd process. The actual rates of the odd and non-odd processes are unknown to the decision maker. We consider a time-slotted sequential detection scenario where, at the beginning of each slot, the decision maker can choose which process to observe during that time slot. We are interested in policies that satisfy a given constraint on the probability of false detection. We propose a generalised likelihood ratio based sequential policy which, via suitable thresholding, can be made to satisfy the given constraint on the probability of false detection. Further, we show that the proposed policy is asymptotically optimal in terms of the conditional expected stopping time among all policies that satisfy the constraint on the probability of false detection. The asymptotic is as the probability of false detection is driven to zero. We apply our results to a particular visual search experiment studied recently by neuroscientists. Our model suggests a neuronal dissimilarity index for the visual search task. The neuronal dissimilarity index, when applied to visual search data from the particular experiment, correlates strongly with the behavioural data. However, the new dissimilarity index performs worse than some previously proposed neuronal dissimilarity indices. We explain why this may be attributed to the experiment conditons., Comment: 24 pages, 4 figures. Submitted to IEEE Transactions on Information Theory. A new analytical proof replaces the previous proof of Proposition 3, which was based on numerical computations

We report the occurrence of both \emph{ab} and \emph{bc} cycloidal ordering of Mn-spins at different temperatures and their possible coexistence at low temperatures in the polycrystalline mixed rare-earth compounds, \emph{R}$_{0.5}$Dy$_{0.5}$MnO$_3$ (\emph{R} = Eu and Gd), which exhibit extraordinary magnetoelectric properties. While the polarization of Gd$_{0.5}$Dy$_{0.5}$MnO$_3$ is comparable to TbMnO$_3$, the compound Eu$_{0.5}$Dy$_{0.5}$MnO$_3$ shows high value of polarization. However, both of them show giant magnetic tunability and exhibit large magnetocapacitance whose sign changes across the two cycloidal ordering temperatures. Intriguingly, the electric polarization can be reversed upon ramping up or ramping down the magnetic field, which has not been observed for any of the \emph{R}MnO$_3$ system. Most strikingly, these compounds show non-volatile ferroelectric memory effect even in the paraelectric and paramagnetic region (T$_C$ $\leq$ T $\leq$ 80 K). We attribute these remarkable properties to the coexistence of \emph{ab} and \emph{bc} cycloidal ordered phases., Comment: Five figures