Spontaneous Symmetry Breaking through Mixing

We discuss a model, in which the negative mass square needed in the Higgs mechanism is generated by mixing with a heavy scalar. We have two scalar doublets in the standard model. Phenomenological properties of the heavy new scalar are discussed. The heavy scalar can be detected by the LHC.Comment: 4 page

Dynamic Windows Scheduling with Reallocation

We consider the Windows Scheduling problem. The problem is a restricted version of Unit-Fractions Bin Packing, and it is also called Inventory Replenishment in the context of Supply Chain. In brief, the problem is to schedule the use of communication channels to clients. Each client ci is characterized by an active cycle and a window wi. During the period of time that any given client ci is active, there must be at least one transmission from ci scheduled in any wi consecutive time slots, but at most one transmission can be carried out in each channel per time slot. The goal is to minimize the number of channels used. We extend previous online models, where decisions are permanent, assuming that clients may be reallocated at some cost. We assume that such cost is a constant amount paid per reallocation. That is, we aim to minimize also the number of reallocations. We present three online reallocation algorithms for Windows Scheduling. We evaluate experimentally these protocols showing that, in practice, all three achieve constant amortized reallocations with close to optimal channel usage. Our simulations also expose interesting trade-offs between reallocations and channel usage. We introduce a new objective function for WS with reallocations, that can be also applied to models where reallocations are not possible. We analyze this metric for one of the algorithms which, to the best of our knowledge, is the first online WS protocol with theoretical guarantees that applies to scenarios where clients may leave and the analysis is against current load rather than peak load. Using previous results, we also observe bounds on channel usage for one of the algorithms.Comment: 6 figure

An atom fiber for guiding cold neutral atoms

We present an omnidirectional matter wave guide on an atom chip. The rotational symmetry of the guide is maintained by a combination of two current carrying wires and a bias field pointing perpendicular to the chip surface. We demonstrate guiding of thermal atoms around more than two complete turns along a spiral shaped 25mm long curved path (curve radii down to 200$\mu$m) at various atom--surface distances (35-450$\mu$m). An extension of the scheme for the guiding of Bose-Einstein condensates is outlined

Trapping and manipulating neutral atoms with electrostatic fields

We report on experiments with cold thermal $^7$Li atoms confined in combined magnetic and electric potentials. A novel type of three-dimensional trap was formed by modulating a magnetic guide using electrostatic fields. We observed atoms trapped in a string of up to six individual such traps, a controlled transport of an atomic cloud over a distance of 400$\mu$m, and a dynamic splitting of a single trap into a double well potential. Applications for quantum information processing are discussed.Comment: 4 pages, 4 figure

Probabilistic Guarantees for Safe Deep Reinforcement Learning

Deep reinforcement learning has been successfully applied to many control tasks, but the application of such agents in safety-critical scenarios has been limited due to safety concerns. Rigorous testing of these controllers is challenging, particularly when they operate in probabilistic environments due to, for example, hardware faults or noisy sensors. We propose MOSAIC, an algorithm for measuring the safety of deep reinforcement learning agents in stochastic settings. Our approach is based on the iterative construction of a formal abstraction of a controller's execution in an environment, and leverages probabilistic model checking of Markov decision processes to produce probabilistic guarantees on safe behaviour over a finite time horizon. It produces bounds on the probability of safe operation of the controller for different initial configurations and identifies regions where correct behaviour can be guaranteed. We implement and evaluate our approach on agents trained for several benchmark control problems

LP-based Covering Games with Low Price of Anarchy

We present a new class of vertex cover and set cover games. The price of anarchy bounds match the best known constant factor approximation guarantees for the centralized optimization problems for linear and also for submodular costs -- in contrast to all previously studied covering games, where the price of anarchy cannot be bounded by a constant (e.g. [6, 7, 11, 5, 2]). In particular, we describe a vertex cover game with a price of anarchy of 2. The rules of the games capture the structure of the linear programming relaxations of the underlying optimization problems, and our bounds are established by analyzing these relaxations. Furthermore, for linear costs we exhibit linear time best response dynamics that converge to these almost optimal Nash equilibria. These dynamics mimic the classical greedy approximation algorithm of Bar-Yehuda and Even [3]

Selectivity estimation on set containment search

© Springer Nature Switzerland AG 2019. In this paper, we study the problem of selectivity estimation on set containment search. Given a query record Q and a record dataset S, we aim to accurately and efficiently estimate the selectivity of set containment search of query Q over S. The problem has many important applications in commercial fields and scientific studies. To the best of our knowledge, this is the first work to study this important problem. We first extend existing distinct value estimating techniques to solve this problem and develop an inverted list and G-KMV sketch based approach IL-GKMV. We analyse that the performance of IL-GKMV degrades with the increase of vocabulary size. Motivated by limitations of existing techniques and the inherent challenges of the problem, we resort to developing effective and efficient sampling approaches and propose an ordered trie structure based sampling approach named OT-Sampling. OT-Sampling partitions records based on element frequency and occurrence patterns and is significantly more accurate compared with simple random sampling method and IL-GKMV. To further enhance performance, a divide-and-conquer based sampling approach, DC-Sampling, is presented with an inclusion/exclusion prefix to explore the pruning opportunities. We theoretically analyse the proposed techniques regarding various accuracy estimators. Our comprehensive experiments on 6 real datasets verify the effectiveness and efficiency of our proposed techniques

Information Gathering in Ad-Hoc Radio Networks with Tree Topology

We study the problem of information gathering in ad-hoc radio networks without collision detection, focussing on the case when the network forms a tree, with edges directed towards the root. Initially, each node has a piece of information that we refer to as a rumor. Our goal is to design protocols that deliver all rumors to the root of the tree as quickly as possible. The protocol must complete this task within its allotted time even though the actual tree topology is unknown when the computation starts. In the deterministic case, assuming that the nodes are labeled with small integers, we give an O(n)-time protocol that uses unbounded messages, and an O(n log n)-time protocol using bounded messages, where any message can include only one rumor. We also consider fire-and-forward protocols, in which a node can only transmit its own rumor or the rumor received in the previous step. We give a deterministic fire-and- forward protocol with running time O(n^1.5), and we show that it is asymptotically optimal. We then study randomized algorithms where the nodes are not labelled. In this model, we give an O(n log n)-time protocol and we prove that this bound is asymptotically optimal

Top-quark rare decay t→cht\to c h in R-parity-violating SUSY

The flavor-changing top-quark decay $t\to c h$, where $h$ is the lightest CP-even Higgs boson in the minimal supersymmetric standard model, is examined in the R-parity-violating supersymmetric model. Within the existing bounds on the relevant R-parity-violating couplings, the branching fraction for $t\to c h$ can be as large as about $10^{-5}$ in some part of the parameter space.Comment: version to appear in Phys. Lett.

Line Defects in Molybdenum Disulfide Layers

Layered molecular materials and especially MoS2 are already accepted as promising candidates for nanoelectronics. In contrast to the bulk material, the observed electron mobility in single-layer MoS2 is unexpectedly low. Here we reveal the occurrence of intrinsic defects in MoS2 layers, known as inversion domains, where the layer changes its direction through a line defect. The line defects are observed experimentally by atomic resolution TEM. The structures were modeled and the stability and electronic properties of the defects were calculated using quantum-mechanical calculations based on the Density-Functional Tight-Binding method. The results of these calculations indicate the occurrence of new states within the band gap of the semiconducting MoS2. The most stable non-stoichiometric defect structures are observed experimentally, one of which contains metallic Mo-Mo bonds and another one bridging S atoms