Miracle-dz/UniFAR-FTUs huggingface dataset:
Resonances in 
e+e−
 annihilation near 2.2 GeV

Author(s): Lees, JP; Poireau, V; Tisserand, V; Grauges, E; Palano, A; Eigen, G; Brown, DN; Kolomensky, YG; Fritsch, M; Koch, H; Schroeder, T; Cheaib, R; Hearty, C; Mattison, TS; McKenna, JA; So, RY; Blinov, VE; Buzykaev, AR; Druzhinin, VP; Golubev, VB; Kozyrev, EA; Kravchenko, EA; Onuchin, AP; Serednyakov, SI; Skovpen, YI; Solodov, EP; Todyshev, KY; Lankford, AJ; Dey, B; Gary, JW; Long, O; Eisner, AM; Lockman, WS; Panduro Vazquez, W; Chao, DS; Cheng, CH; Echenard, B; Flood, KT; Hitlin, DG; Kim, J; Li, Y; Miyashita, TS; Ongmongkolkul, P; Porter, FC; Rohrken, M; Huard, Z; Meadows, BT; Pushpawela, BG; Sokoloff, MD; Sun, L; Smith, JG; Wagner, SR; Bernard, D; Verderi, M; Bettoni, D; Bozzi, C; Calabrese, R; Cibinetto, G; Fioravanti, E; Garzia, I; Luppi, E; Santoro, V; Calcaterra, A; De Sangro, R; Finocchiaro, G; Martellotti, S; Patteri, P; Peruzzi, IM; Piccolo, M; Rotondo, M; Zallo, A; Passaggio, S; Patrignani, C; Shuve, BJ; Lacker, HM; Bhuyan, B; Mallik, U; Chen, C; Cochran, J; Prell, S; Gritsan, AV; Arnaud, N; Davier, M; Le Diberder, F; Lutz, AM | Abstract: © 2020 authors. Published by the American Physical Society. Published by the American Physical Society under the terms of the "https://creativecommons.org/licenses/by/4.0/" Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article's title, journal citation, and DOI. Using the initial-state radiation method, the e+e-→KSKL cross section from 1.98 to 2.54 GeV is measured in a data sample of 469 fb-1 collected with the BABAR detector. The results are used in conjunction with previous BABAR results for the e+e-→K+K-, e+e-→π+π-, e+e-→π+π-η, and e+e-→ωππ cross sections to investigate the nature of the resonance structure recently observed by the BESIII experiment in the e+e-→K+K- cross section.
Security in Process: Visually Supported Triage Analysis in Industrial Process Data

Operation technology networks, i.e. hard- and software used for monitoring and controlling physical/industrial processes, have been considered immune to cyber attacks for a long time. A recent increase of attacks in these networks proves this assumption wrong. Several technical constraints lead to approaches to detect attacks on industrial processes using available sensor data. This setting differs fundamentally from anomaly detection in IT-network traffic and requires new visualization approaches adapted to the common periodical behavior in OT-network data. We present a tailored visualization system that utilizes inherent features of measurements from industrial processes to full capacity to provide insight into the data and support triage analysis by laymen and experts. The novel combination of spiral plots with results from anomaly detection was implemented in an interactive system. The capabilities of our system are demonstrated using sensor and actuator data from a real-world water treatment process with introduced attacks. Exemplary analysis strategies are presented. Finally, we evaluate effectiveness and usability of our system and perform an expert evaluation.
A radio parallax to the black hole X-ray binary MAXI J1820+070

Using the Very Long Baseline Array and the European Very Long Baseline Interferometry Network, we have made a precise measurement of the radio parallax of the black hole X-ray binary MAXI J1820+070, providing a model-independent distance to the source. Our parallax measurement of (0.348 ± 0.033) mas for MAXI J1820+070 translates to a distance of (2.96 ± 0.33) kpc. This distance implies that the source reached (15 ± 3) per cent of the Eddington luminosity at the peak of its outburst. Further, we use this distance to refine previous estimates of the jet inclination angle, jet velocity, and the mass of the black hole in MAXI J1820+070 to be (63 ± 3)°, (0.89 ± 0.09) c, and (9.2 ± 1.3) M⊙, respectively.
Introducing MANtIS: a novel Multi-Domain Information Seeking Dialogues Dataset

Conversational search is an approach to information retrieval (IR), where users engage in a dialogue with an agent in order to satisfy their information needs. Previous conceptual work described properties and actions a good agent should exhibit. Unlike them, we present a novel conceptual model defined in terms of conversational goals, which enables us to reason about current research practices in conversational search. Based on the literature, we elicit how existing tasks and test collections from the fields of IR, natural language processing (NLP) and dialogue systems (DS) fit into this model. We describe a set of characteristics that an ideal conversational search dataset should have. Lastly, we introduce MANtIS (the code and dataset are available at this https URL), a large-scale dataset containing multi-domain and grounded information seeking dialogues that fulfill all of our dataset desiderata. We provide baseline results for the conversation response ranking and user intent prediction tasks.
LOFAR view of NGC 3998, a sputtering AGN

Low-power radio sources dominate the radio sky. They tend to be small in size and dominated by their cores, but the origin of their properties and the evolution of their radio plasma are not well constrained. Interestingly, there is mounting evidence that low-power radio sources can significantly affect their surrounding gaseous medium and may therefore be more relevant for galaxy evolution than previously thought. In this paper, we present low radio frequency observations obtained with LOFAR at 147 MHz of the radio source hosted by NGC 3998. This is a rare example of a low-power source that is extremely dominated by its core, but that has two large-scale lobes of low surface brightness. We combine the new 147 MHz image with available 1400 MHz data to derive the spectral index over the source. Despite the low surface brightness, reminiscent of remnant structures, the lobes show an optically thin synchrotron spectral index (∼0.6). We interpret this as being due to rapid decollimation of the jets close to the core, to high turbulence of the plasma flow, and to entrainment of thermal gas. This could be the result of intermittent activity of the central active galactic nucleus, or, more likely, temporary disruption of the jet due to the interaction of the jet with the rich circumnuclear interstellar matter. Both would result in sputtering energy injection from the core, which would keep the lobes fed, albeit at a low rate. We discuss these results in connection with the properties of low-power radio sources in general. Our findings show that amorphous low surface brightness lobes should not be interpreted by default as remnant structures. Large deep surveys (in particular the LOFAR 150 MHz LoTSS and the recently started 1400 MHz Apertif survey) will identify a growing number of objects similar to NGC 3998 where these ideas can be further tested.
Feature Losses for Adversarial Robustness

Deep learning has made tremendous advances in computer vision tasks such as image classification. However, recent studies have shown that deep learning models are vulnerable to specifically crafted adversarial inputs that are quasi-imperceptible to humans. In this work, we propose a novel approach to defending adversarial attacks. We employ an input processing technique based on denoising autoencoders as a defense. It has been shown that the input perturbations grow and accumulate as noise in feature maps while propagating through a convolutional neural network (CNN). We exploit the noisy feature maps by using an additional subnetwork to extract image feature maps and train an auto-encoder on perceptual losses of these feature maps. This technique achieves close to state-of-the-art results on defending MNIST and CIFAR10 datasets, but more importantly, shows a new way of employing a defense that cannot be trivially trained end-to-end by the attacker. Empirical results demonstrate the effectiveness of this approach on the MNIST and CIFAR10 datasets on simple as well as iterative LP attacks. Our method can be applied as a preprocessing technique to any off the shelf CNN.
A hierarchical loss and its problems when classifying non-hierarchically

Failing to distinguish between a sheepdog and a skyscraper should be worse and penalized more than failing to distinguish between a sheepdog and a poodle; after all, sheepdogs and poodles are both breeds of dogs. However, existing metrics of failure (so-called “loss” or “win”) used in textual or visual classification/recognition via neural networks seldom leverage a-priori information, such as a sheepdog being more similar to a poodle than to a skyscraper. We define a metric that, inter alia, can penalize failure to distinguish between a sheepdog and a skyscraper more than failure to distinguish between a sheepdog and a poodle. Unlike previously employed possibilities, this metric is based on an ultrametric tree associated with any given tree organization into a semantically meaningful hierarchy of a classifier’s classes. An ultrametric tree is a tree with a so-called ultrametric distance metric such that all leaves are at the same distance from the root. Unfortunately, extensive numerical experiments indicate that the standard practice of training neural networks via stochastic gradient descent with random starting points often drives down the hierarchical loss nearly as much when minimizing the standard cross-entropy loss as when trying to minimize the hierarchical loss directly. Thus, this hierarchical loss is unreliable as an objective for plain, randomly started stochastic gradient descent to minimize; the main value of the hierarchical loss may be merely as a meaningful metric of success of a classifier.
Throughput Maximization for Full-Duplex UAV Aided Small Cell Wireless Systems

This letter investigates full-duplex unmanned aerial vehicle (UAV) aided small cell wireless systems, where the UAV serving as the base station (BS) is designed to transmit data to the downlink users and receive data from the uplink users simultaneously. To maximize the total system capacity, including uplink and downlink capacity, the UAV trajectory, downlink/uplink user scheduling, and uplink user transmit power are alternately optimized. The resulting optimization problem is mixed-integer and non-convex, which is challenging to solve. To address it, the block coordinate descent method and successive convex approximation techniques are leveraged. Simulation results demonstrate the significant capacity gain can be achieved by our design compared with the other designs.
Debris Disks in Multiplanet Systems: Are Our Inferences Compromised by Unseen Planets?

Resolved debris disk features (e.g., warps, offsets, edges and gaps, azimuthal asymmetries, radially thickened rings, scale heights) contain valuable information about the underlying planetary systems, such as the posited planet’s mass, semimajor axis, and other orbital parameters. Most existing models assume a single planet is sculpting the disk feature, but recent observations of mature planetary systems (e.g., by radial velocity surveys or Kepler) have revealed that many planets reside in multiplanet systems. Here we investigate if/how planet properties inferred from single-planet models are compromised when multiple planets reside in the system. For each disk feature, we build a two-planet model that includes a planet b with fixed parameters and a planet c with a full range of possible parameters. We investigate these two-planet systems and summarize the configurations for which assuming a single planet (i.e., planet b) leads to significantly flawed inferences of that planet’s properties. We find that although disk features are usually primarily dominated by a single planet, when using single-planet models, we are at risk of misinterpreting planet properties by orders of magnitude in extreme cases. Specifically, we are at high risk of misinterpreting planet properties from disk warps; at moderate risk from disk edges and gaps, radially thickened rings, and scale height features; and at low risk from host star–disk center offsets and azimuthal asymmetries. We summarize situations where we can infer the need to use a multiplanet model instead of a single-planet one from disk morphology dissimilarities.
A Finite-Time Analysis of Q-Learning with Neural Network Function Approximation

Q-learning with neural network function approximation (neural Q-learning for short) is among the most prevalent deep reinforcement learning algorithms. Despite its empirical success, the non-asymptotic convergence rate of neural Q-learning remains virtually unknown. In this paper, we present a finite-time analysis of a neural Q-learning algorithm, where the data are generated from a Markov decision process and the action-value function is approximated by a deep ReLU neural network. We prove that neural Q-learning finds the optimal policy with $O(1/\sqrt{T})$ convergence rate if the neural function approximator is sufficiently overparameterized, where $T$ is the number of iterations. To our best knowledge, our result is the first finite-time analysis of neural Q-learning under non-i.i. d. data assumption.
Turning a chiral skyrmion inside out

The stability of two-dimensional chiral skyrmions in a tilted magnetic field is studied. It is shown that by changing the direction and magnitude of the field, one can continuously transform a chiral skyrmion into a skyrmion with opposite polarity and vorticity. This turned inside out skyrmion can be considered as an antiparticle for an ordinary axisymmetric skyrmion. For any tilt angle of the magnetic field, there is a range of its absolute values where two types of skyrmions may coexist. In a tilted field the potentials for interskyrmion interactions are characterized by the presence of local minima suggesting an attractive interaction between the particles. The potentials of interparticle interactions also have so-called fusion channels allowing either the annihilation of two particles or the emergence of a another particle. The presented results are general for a wide class of magnetic crystals with both easy-plane and easy-axis anisotropies.
AVID: Learning Multi-Stage Tasks via Pixel-Level Translation of Human Videos

Robotic reinforcement learning (RL) holds the promise of enabling robots to learn complex behaviors through experience. However, realizing this promise for long-horizon tasks in the real world requires mechanisms to reduce human burden in terms of defining the task and scaffolding the learning process. In this paper, we study how these challenges can be alleviated with an automated robotic learning framework, in which multi-stage tasks are defined simply by providing videos of a human demonstrator and then learned autonomously by the robot from raw image observations. A central challenge in imitating human videos is the difference in appearance between the human and robot, which typically requires manual correspondence. We instead take an automated approach and perform pixel-level image translation via CycleGAN to convert the human demonstration into a video of a robot, which can then be used to construct a reward function for a model-based RL algorithm. The robot then learns the task one stage at a time, automatically learning how to reset each stage to retry it multiple times without human-provided resets. This makes the learning process largely automatic, from intuitive task specification via a video to automated training with minimal human intervention. We demonstrate that our approach is capable of learning complex tasks, such as operating a coffee machine, directly from raw image observations, requiring only 20 minutes to provide human demonstrations and about 180 minutes of robot interaction.
Peering into the formation history of β Pictoris b with VLTI/GRAVITY long-baseline interferometry

Context. β Pictoris is arguably one of the most studied stellar systems outside of our own. Some 30 yr of observations have revealed a highly-structured circumstellar disk, with rings, belts, and a giant planet: β Pictoris b. However very little is known about how this system came into being. Aims. Our objective is to estimate the C/O ratio in the atmosphere of β Pictoris b and obtain an estimate of the dynamical mass of the planet, as well as to refine its orbital parameters using high-precision astrometry. Methods. We used the GRAVITY instrument with the four 8.2 m telescopes of the Very Large Telescope Interferometer to obtain K-band spectro-interferometric data on β Pic b. We extracted a medium resolution (R = 500) K-band spectrum of the planet and a high-precision astrometric position. We estimated the planetary C/O ratio using two different approaches (forward modeling and free retrieval) from two different codes (ExoREM and petitRADTRANS, respectively). Finally, we used a simplified model of two formation scenarios (gravitational collapse and core-accretion) to determine which can best explain the measured C/O ratio. Results. Our new astrometry disfavors a circular orbit for β Pic b (e = 0.15−0.04+0.05). Combined with previous results and with HIPPARCOS/Gaia measurements, this astrometry points to a planet mass of M = 12.7 ± 2.2 MJup. This value is compatible with the mass derived with the free-retrieval code petitRADTRANS using spectral data only. The forward modeling and free-retrieval approches yield very similar results regarding the atmosphere of β Pic b. In particular, the C/O ratios derived with the two codes are identical (0.43 ± 0.05 vs. 0.43−0.03+0.04). We argue that if the stellar C/O in β Pic is Solar, then this combination of a very high mass and a low C/O ratio for the planet suggests a formation through core-accretion, with strong planetesimal enrichment.
Good acyclic orientations of 4‐regular 4‐connected graphs

An st $st$ ‐ordering of a graph G=(V,E) $G=(V,E)$ is an ordering v1,v2,…,vn ${v}_{1},{v}_{2},\ldots ,{v}_{n}$ of its vertex set such that s=v1,t=vn $s={v}_{1},t={v}_{n}$ and every vertex vi ${v}_{i}$ with i=2,3,…,n−1 $i=2,3,\ldots ,n-1$ has both a lower numbered and a higher numbered neighbor. Such orderings have played an important role in algorithms for planarity testing. It is well‐known that every 2‐connected graph has an st $st$ ‐ordering for every choice of distinct vertices s,t $s,t$ . An st $st$ ‐ordering of a graph G $G$ corresponds directly to a so‐called bipolar orientation of G $G$ , that is, an acyclic orientation D $D$ of G $G$ in which s $s$ is the unique source and t $t$ is the unique sink. Clearly every bipolar orientation of a graph has an out‐branching rooted at the source vertex and an in‐branching rooted at the sink vertex. In this paper, we study graphs which admit a bipolar orientation that contains an out‐branching and in‐branching which are arc‐disjoint (such an orientation is called good). A 2T‐graph is a graph whose edge set can be decomposed into two edge‐disjoint spanning trees. Clearly a graph has a good orientation if and only if it contains a spanning 2T‐graph with a good orientation, implying that 2T‐graphs play a central role. It is a well‐known result due to Tutte and Nash‐Williams, respectively, that every 4‐edge‐connected graph contains a spanning 2T‐graph. Vertex‐minimal 2T‐graphs with at least two vertices, also known as generic circuits, play an important role in rigidity theory for graphs. Recently with Bessy and Huang we proved that every generic circuit has a good orientation. In fact, we may specify the roots of the two branchings arbitrarily as long as they are distinct. Using this, several results on good orientations of 2T‐graphs were obtained. It is an open problem whether there exists a polynomial algorithm for deciding whether a given 2T‐graph has a good orientation. Complex constructions of 2T‐graphs with no good orientation were given in work by Bang‐Jensen, Bessy, Huang and Kriesell (2021) indicating that the problem might be very difficult. In this paper, we focus on so‐called quartics which are 2T‐graphs where every vertex has degree 3 or 4. We identify a sufficient condition for a quartic to have a good orientation, give a polynomial algorithm to recognize quartics satisfying the condition and a polynomial algorithm to produce a good orientation when this condition is met. As a consequence of these results we prove that every 4‐regular and 4‐connected graph has a good orientation, where, as for generic circuits, we may specify the roots of the two branchings arbitrarily as long as they are distinct. We also provide evidence that even for quartics it may be difficult to find a characterization of those instances which have a good orientation. We also show that every graph on n≥8 $n\ge 8$ vertices and of minimum degree at least ⌊n∕2⌋ $\lfloor n\unicode{x02215}2\rfloor $ has a good orientation. Finally we pose a number of open problems.
Desempenho do teste rápido imunocromatográfico (TRI) para o diagnóstico da leishmaniose visceral canina: comparação com outros métodos sorológicos em cães suspeitos de Cuiabá, Mato Grosso, Brasil

O teste rapido imunocromatografico (TRI) para leishmaniose visceral canina (LVC) foi testado em caes suspeitos da area urbana de Cuiaba. O desempenho do teste foi comparado com RIFI e ELISA e, como padrao ouro, o teste parasitologico direto (TPD). A amostra com 45 caes foi selecionada pelo Centro de Controle de Zoonoses, sendo 23 (51,1%) machos, 34 (75,5%) sem raca definida e com idade estimada inferior a tres anos. De acordo com os dados clinicos e os exames laboratoriais, 10 (26,3%) caes foram classificados como expostos, outros 10 (26,3%) como infectados e 18 (47,4%) como doentes. O TRI alcancou os melhores resultados quanto a sensibilidade, 62%, elevada especificidade, 87% e para os valores preditivos positivo e negativo: 83,30% e 81,48%, respectivamente, consolidado pelo coeficiente Kappa igual a 0,50, de concordância moderada. Os resultados confirmaram TRI como um bom preditor de doenca e infeccao para LVC.
Oleamide potentiates benzodiazepine-sensitive gamma-aminobutyric acid receptor activity but does not alter minimum alveolar anesthetic concentration.

UNLABELLED A naturally occurring brain lipid, cis-9,10-octadeceamide--oleamide (OA), is found in increased concentrations in the cerebrospinal fluid of sleep-deprived cats, which suggests that it may be an endogenous sleep-inducing substance. We studied the effects of this fatty-acid derivative on the function of cloned gamma-aminobutyric acid (GABA(A)) receptors expressed in Xenopus oocytes. Oocytes were injected with cRNA synthesized in vitro to express simple GABA(A) receptors (alpha1beta1, alpha3beta1, alpha5beta1, and alpha1beta2 subunit combinations) and receptors in which the GABA-induced chloride currents were potentiated in the presence of benzodiazepines (alpha1beta1gamma2s and alpha1beta2gamma2s subunit combinations). OA only produced significant potentiation of the peak Cl- current when applied with GABA to benzodiazepine-sensitive GABA(A) receptors. The peak currents of the simple GABA(A) receptors in the presence of OA were either unaffected or slightly inhibited by OA, but the overall mean currents were not significantly altered. Oleic acid was also capable of potentiating benzodiazepine-sensitive GABA(A) receptor function. The function of other ligand-gated ion channels, such as the N-methyl-D-aspartate receptor (NR1 + NR2A or 2C) and the 5-HT3 receptor expressed in Xenopus oocytes, were unaffected by OA. Sprague-Dawley rats receiving intraperitoneal injections of oleamide (10, 20, or 100 mg/kg) showed no change in the minimum alveolar anesthetic concentration (MAC) of desflurane required to abolish movement in response to noxious (tail clamp) stimulation (control MAC 6.48% +/- 1.28% atm; 100 mg/kg OA MAC 7.05% +/- 0.42% atm). These results reinforce the view that oleyl compounds may be natural modulators of inhibitory ion channel function, but that these effects contribute little to the central nervous system depression produced by volatile anesthetics as measured by MAC. IMPLICATIONS The putative sleep-inducing substance, oleamide, potentiates benzodiazepine-sensitive gamma-aminobutyric acid receptor function but does not alter desflurane minimum alveolar anesthetic concentration in rats.