Scalable Methods for Adaptively Seeding a Social Network

In recent years, social networking platforms have developed into extraordinary channels for spreading and consuming information. Along with the rise of such infrastructure, there is continuous progress on techniques for spreading information effectively through influential users. In many applications, one is restricted to select influencers from a set of users who engaged with the topic being promoted, and due to the structure of social networks, these users often rank low in terms of their influence potential. An alternative approach one can consider is an adaptive method which selects users in a manner which targets their influential neighbors. The advantage of such an approach is that it leverages the friendship paradox in social networks: while users are often not influential, they often know someone who is. Despite the various complexities in such optimization problems, we show that scalable adaptive seeding is achievable. In particular, we develop algorithms for linear influence models with provable approximation guarantees that can be gracefully parallelized. To show the effectiveness of our methods we collected data from various verticals social network users follow. For each vertical, we collected data on the users who responded to a certain post as well as their neighbors, and applied our methods on this data. Our experiments show that adaptive seeding is scalable, and importantly, that it obtains dramatic improvements over standard approaches of information dissemination.Comment: Full version of the paper appearing in WWW 201

An electronic model for self-assembled hybrid organic/perovskite semiconductors: reverse band edge electronic states ordering and spin-orbit coupling

Based on density functional theory, the electronic and optical properties of hybrid organic/perovskite crystals are thoroughly investigated. We consider the mono-crystalline 4FPEPI as material model and demonstrate the optical process is governed by three active Bloch states at the {\Gamma} point of the reduced Brillouin zone with a reverse ordering compared to tetrahedrally bonded semiconductors. Giant spin-orbit coupling effects and optical activities are subsequently inferred from symmetry analysis.Comment: 17 pages, 6 figure

The relationship between two flavors of oblivious transfer at the quantum level

Though all-or-nothing oblivious transfer and one-out-of-two oblivious transfer are equivalent in classical cryptography, we here show that due to the nature of quantum cryptography, a protocol built upon secure quantum all-or-nothing oblivious transfer cannot satisfy the rigorous definition of quantum one-out-of-two oblivious transfer.Comment: 4 pages, no figur

A Rational Approach to Cryptographic Protocols

This work initiates an analysis of several cryptographic protocols from a rational point of view using a game-theoretical approach, which allows us to represent not only the protocols but also possible misbehaviours of parties. Concretely, several concepts of two-person games and of two-party cryptographic protocols are here combined in order to model the latters as the formers. One of the main advantages of analysing a cryptographic protocol in the game-theory setting is the possibility of describing improved and stronger cryptographic solutions because possible adversarial behaviours may be taken into account directly. With those tools, protocols can be studied in a malicious model in order to find equilibrium conditions that make possible to protect honest parties against all possible strategies of adversaries

NFAT5 genes are part of the osmotic regulatory system in Atlantic salmon (Salmo salar)

Acknowledgements This study was supported by a grant from the Biotechnology and Biological Sciences Research Council (BBSRC, BB/H008063/1), UK to DGH and SAM. Funding also came from Research Council Norway for project number 241016 for DGH and EJ. This work was carried out as part of a PhD thesis funded by the Marine Alliance of Science and Technology Scotland (MASTS).Peer reviewedPublisher PD

Hydrodynamic Limit for an Hamiltonian System with Boundary Conditions and Conservative Noise

We study the hyperbolic scaling limit for a chain of N coupled anharmonic oscillators. The chain is attached to a point on the left and there is a force (tension) $\tau$ acting on the right. In order to provide good ergodic properties to the system, we perturb the Hamiltonian dynamics with random local exchanges of velocities between the particles, so that momentum and energy are locally conserved. We prove that in the macroscopic limit the distributions of the elongation, momentum and energy, converge to the solution of the Euler system of equations, in the smooth regime.Comment: New deeply revised version. 1 figure adde

Extreme Supernova Models for the Superluminous Transient ASASSN-15lh

The recent discovery of the unprecedentedly superluminous transient ASASSN-15lh (or SN 2015L) with its UV-bright secondary peak challenges all the power-input models that have been proposed for superluminous supernovae. Here we examine some of the few viable interpretations of ASASSN-15lh in the context of a stellar explosion, involving combinations of one or more power inputs. We model the lightcurve of ASASSN-15lh with a hybrid model that includes contributions from magnetar spin-down energy and hydrogen-poor circumstellar interaction. We also investigate models of pure circumstellar interaction with a massive hydrogen-deficient shell and discuss the lack of interaction features in the observed spectra. We find that, as a supernova ASASSN-15lh can be best modeled by the energetic core-collapse of a ~40 Msun star interacting with a hydrogen-poor shell of ~20 Msun. The circumstellar shell and progenitor mass are consistent with a rapidly rotating pulsational pair-instability supernova progenitor as required for strong interaction following the final supernova explosion. Additional energy injection by a magnetar with initial period of 1-2 ms and magnetic field of 0.1-1 x 10^14 G may supply the excess luminosity required to overcome the deficit in single-component models, but this requires more fine-tuning and extreme parameters for the magnetar, as well as the assumption of efficient conversion of magnetar energy into radiation. We thus favor a single-input model where the reverse shock formed in a strong SN ejecta-CSM interaction following a very powerful core-collapse SN explosion can supply the luminosity needed to reproduce the late-time UV-bright plateau.Comment: 8 pages, 3 figure

43rd Biennial Convention and Centennial Celebration The University of Kansas: March 27-29, 2015

Sigma Gamma Epsilon, the national honor society in the Earth Sciences, held its 43rd Biennial Convention on the campus of the University of Kansas March 27-29, 2015 in conjunction with its centennial celebration. Alpha Chapter, Sigma Gamma Epsilon’s first chapter, hosted the events. During the convention, Dr. Anthony Walton of the Department of Geology at KU led a half-day field excursion on the Pennsylvanian Stratigraphy of Douglas County, Kansas: Glacioeustatically Modulated Cyclic Deposition on a Remarkably Smooth Shelf. This report provides a summary of the deliberations and actions of the participants at the convention and highlights of the field trip and centennial celebration

Online Admission Control and Embedding of Service Chains

The virtualization and softwarization of modern computer networks enables the definition and fast deployment of novel network services called service chains: sequences of virtualized network functions (e.g., firewalls, caches, traffic optimizers) through which traffic is routed between source and destination. This paper attends to the problem of admitting and embedding a maximum number of service chains, i.e., a maximum number of source-destination pairs which are routed via a sequence of to-be-allocated, capacitated network functions. We consider an Online variant of this maximum Service Chain Embedding Problem, short OSCEP, where requests arrive over time, in a worst-case manner. Our main contribution is a deterministic O(log L)-competitive online algorithm, under the assumption that capacities are at least logarithmic in L. We show that this is asymptotically optimal within the class of deterministic and randomized online algorithms. We also explore lower bounds for offline approximation algorithms, and prove that the offline problem is APX-hard for unit capacities and small L > 2, and even Poly-APX-hard in general, when there is no bound on L. These approximation lower bounds may be of independent interest, as they also extend to other problems such as Virtual Circuit Routing. Finally, we present an exact algorithm based on 0-1 programming, implying that the general offline SCEP is in NP and by the above hardness results it is NP-complete for constant L.Comment: early version of SIROCCO 2015 pape

Densification and preservation of ceramic nanocrystalline character by spark plasma sintering

Spark plasma sintering is a hot pressing technique where rapid heating by dc electric pulses is used simultaneously with applied pressure. Thus, spark plasma sintering is highly suitable for rapid densification of ceramic nanoparticles and preservation of the final nanostructure. A considerable portion of the shrinkage during densification of the green compact of nanoparticles in the first and intermediate stages of sintering occurs during heating by particle rearrangement by sliding and rotation. Further densification to the final stage of sintering takes place by either plastic yield or diffusional processes. Full densification in the final stage of sintering is associated with diffusional processes only. Nanoparticle sliding and rotation during heating may also lead to grain coalescence, with much faster kinetics than normal grain growth at higher temperatures. Based on existing models for particle rearrangement and sliding, the contributions of these processes in conjunction with nanoparticle properties and process parameters were highlighted