Search

The Beryllium Electron capture in Superconducting Tunnel junctions (BeEST) experiment searches for evidence of heavy neutrino mass eigenstates in the nuclear electron capture decay of $^7$Be by precisely measuring the recoil energy of the $^7$Li daughter. In Phase-III, the BeEST experiment has been scaled from a single superconducting tunnel junction (STJ) sensor to a 36-pixel array to increase sensitivity and mitigate gamma-induced backgrounds. Phase-III also uses a new continuous data acquisition system that greatly increases the flexibility for signal processing and data cleaning. We have developed procedures for signal processing and spectral fitting that are sufficiently robust to be automated for large data sets. This article presents the optimized procedures before unblinding the majority of the Phase-III data set to search for physics beyond the standard model.

We measure the energy-differential cross sections for collisional excitation of the soft X-ray electric-dipole K$\alpha$ ($x+y+w$) emission from He-like oxygen (O VII), using an electron beam ion trap. Values near their excitation thresholds were extracted from the observed emissivity by rapidly cycling the energy of the exciting electron beam. This allows us to subtract time-dependent contributions of the forbidden $z$-line emission to the multiplet. We develop a time-dependent collisional-radiative model to further demonstrate the method and predict all spectral features. We then compare the extracted $x+y+w$ cross-sections with calculations based on distorted-wave and R-matrix methods from the literature and our own predictions using the Flexible Atomic Code (FAC). All R-matrix results are validated by our measurements of direct and resonant excitation, supporting the use of such state-of-the-art codes for astrophysical and plasma physics diagnostics., Comment: 12 pages, 5 figures, 3 Tables, submitted

Despite their high relative abundance in our Universe, neutrinos are the least understood fundamental particles of nature. They also provide a unique system to study quantum coherence and the wavelike nature of particles in fundamental systems due to their extremely weak interaction probabilities. In fact, the quantum properties of neutrinos emitted in experimentally relevant sources are virtually unknown and the spatial extent of the neutrino wavepacket is only loosely constrained by reactor neutrino oscillation data with a spread of 13 orders of magnitude. Here, we present the first direct limits of this quantity through a new experimental concept to extract the energy width, $\sigma_{\textrm{N},E}$, of the recoil daughter nucleus emitted in the nuclear electron capture (EC) decay of $^7$Be. The final state in the EC decay process contains a recoiling $^7$Li nucleus and an electron neutrino ($\nu_e$) which are entangled at their creation. The $^7$Li energy spectrum is measured to high precision by directly embedding $^7$Be radioisotopes into a high resolution superconducting tunnel junction that is operated as a cryogenic sensor. The lower limit on the spatial uncertainty of the recoil daughter was found to be $\sigma_{\textrm{N}, x} \geq 6.2$\,pm, which implies the final-state system is localized at a scale more than a thousand times larger than the nucleus itself. From this measurement, the first direct lower limits on the spatial extent of the neutrino wavepacket were extracted using two different theoretical methods. These results have wide-reaching implications in several areas including the nature of spatial localization at sub-atomic scales, interpretation of neutrino physics data, and the potential reach of future large-scale experiments., Comment: 20 pages, 3 figures, v3 corrects and updates one of the wavepacket width calculations

Let ${\mathcal W}_n$ denote any of the three families of classical Weyl groups: the symmetric groups ${\mathcal S}_n$, the hyperoctahedral groups (signed permutation groups) ${\mathcal S}^B_n$, or the even-signed permutation groups ${\mathcal S}^D_n$. In this paper we give an uniform construction of a Hamilton cycle for the restriction to involutions on these three families of groups with respect to a inverse-closed connecting set of involutions. This Hamilton cycle is optimal with respect to the Hamming distance only for the symmetric group ${\mathcal S}_n$. We also recall an optimal algorithm for a Gray code for type $B$ involutions. A modification of this algorithm would provide a Gray Code for type $D$ involutions with Hamming distance two, which would be optimal. We give such a construction for ${\mathcal S}^D_4$ and ${\mathcal S}^D_5$.

In recent years many novel applications have appeared that promote the provision of services and activities in a collaborative manner. The key idea behind such systems is to take advantage of idle or underused capacities of existing resources, in order to provide improved services that assist people in their daily tasks, with additional functionality, enhanced efficiency, and/or reduced cost. Particularly in the domain of urban transportation, many researchers have put forward novel ideas, which are then implemented and evaluated through prototypes that usually draw upon AI methods and tools. However, such proposals also bring up multiple non-technical issues that need to be identified and addressed adequately if such systems are ever meant to be applied to the real world. While, in practice, legal and ethical aspects related to such AI-based systems are seldomly considered in the beginning of the research and development process, we argue that they not only restrict design decisions, but can also help guiding them. In this manuscript, we set out from a prototype of a taxi coordination service that mediates between individual (and autonomous) taxis and potential customers. After representing key aspects of its operation in a semi-structured manner, we analyse its viability from the viewpoint of current legal restrictions and constraints, so as to identify additional non-functional requirements as well as options to address them. Then, we go one step ahead, and actually modify the existing prototype to incorporate the previously identified recommendations. Performing experiments with this improved system helps us identify the most adequate option among several legally admissible alternatives.

Agreement Technologies refer to a novel paradigm for the construction of distributed intelligent systems, where autonomous software agents negotiate to reach agreements on behalf of their human users. Smart Cities are a key application domain for Agreement Technologies. While several proofs of concept and prototypes exist, such systems are still far from ready for being deployed in the real-world. In this paper we focus on a novel method for managing elements of smart road infrastructures of the future, namely the case of auction-based road intersections. We show that, even though the key technological elements for such methods are already available, there are multiple non-technical issues that need to be tackled before they can be applied in practice. For this purpose, we analyse legal and ethical implications of auction-based road intersections in the context of international regulations and from the standpoint of the Spanish legislation. From this exercise, we extract a set of required modifications, of both technical and legal nature, which need to be addressed so as to pave the way for the potential real-world deployment of such systems in a future that may not be too far away.

Hydrogen-like light muonic ions, in which one negative muon replaces all the electrons, are extremely sensitive probes of nuclear structure, because the large muon mass increases tremendously the wave function overlap with the nucleus. Using pulsed laser spectroscopy we have measured three 2S-2P transitions in the muonic helium-3 ion ($\mu^3$He$^+$), an ion formed by a negative muon and bare helium-3 nucleus. This allowed us to extract the Lamb shift $E(2P_{1/2}-2S_{1/2})= 1258.598(48)^{\rm exp}(3)^{\rm theo}$ meV, the 2P fine structure splitting $E_{\rm FS}^{\rm exp} = 144.958(114)$ meV, and the 2S-hyperfine splitting (HFS) $E_{\rm HFS}^{\rm exp} = -166.495(104)^{\rm exp}(3)^{\rm theo}$ meV in $\mu^3$He$^+$. Comparing these measurements to theory we determine the rms charge radius of the helion ($^3$He nucleus) to be $r_h$ = 1.97007(94) fm. This radius represents a benchmark for few nucleon theories and opens the way for precision tests in $^3$He atoms and $^3$He-ions. This radius is in good agreement with the value from elastic electron scattering, but a factor 15 more accurate. Combining our Lamb shift measurement with our earlier one in $\mu^4$He$^+$ we obtain $r_h^2-r_\alpha^2 = 1.0636(6)^{\rm exp}(30)^{\rm theo}$ fm$^2$ to be compared to results from the isotope shift measurements in regular He atoms, which are however affected by long-standing tensions. By comparing $E_{\rm HFS}^{\rm exp}$ with theory we also obtain the two-photon-exchange contribution (including higher orders) which is another important benchmark for ab-initio few-nucleon theories aiming at understanding the magnetic and current structure of light nuclei., Comment: 8 pages, 5 figures

With the emergence of the Node.js ecosystem, JavaScript has become a widely-used programming language for implementing server-side web applications. In this paper, we present the first empirical study of static code analysis tools for detecting vulnerabilities in Node.js code. To conduct a comprehensive tool evaluation, we created the largest known curated dataset of Node.js code vulnerabilities. We characterized and annotated a set of 957 vulnerabilities by analyzing information contained in npm advisory reports. We tested nine different tools and found that many important vulnerabilities appearing in the OWASP Top-10 are not detected by any tool. The three best performing tools combined only detect up to 57.6% of all vulnerabilities in the dataset, but at a very low precision of 0.11%. Our curated dataset offers a new benchmark to help characterize existing Node.js code vulnerabilities and foster the development of better vulnerability detection tools for Node.js code.

Phononic crystals (PCs) are periodic structures obtained by the spatial arrangement of materials with contrasting properties, which can be designed to efficiently manipulate mechanical waves. Plate structures can be modeled using the Mindlin-Reissner plate theory and have been extensively used to analyze the dispersion relations of PCs. Although the analysis of the propagating characteristics of PCs may be sufficient for simple elastic structures, analyzing the evanescent wave behavior becomes fundamental if the PC contains viscoelastic components. Another complication is that increasingly intricate material distributions in the unit cell of PCs with hierarchical configuration may render the calculation of the complex band structure (i.e., considering both propagating and evanescent waves) prohibitive due to excessive computational workload. In this work, we propose a new extended plane wave expansion formulation to compute the complex band structure of thick PC plates with arbitrary material distribution using the Mindlin-Reissner plate theory containing constituents with a viscoelastic behavior approximated by a Kelvin-Voigt model. We apply the method to investigate the evanescent behavior of periodic hierarchically structured plates for either (i) a hard purely elastic matrix with soft viscoelastic inclusions or (ii) a soft viscoelastic matrix with hard purely elastic inclusions. Our results show that for (i), an increase in the hierarchical order leads to a weight reduction with relatively preserved attenuation characteristics, including attenuation peaks due to locally resonant modes that present a decrease in attenuation upon increasing viscosity levels. For (ii), changing the hierarchical order implies in opening band gaps in distinct frequency ranges, with an overall attenuation improved by an increase in the viscosity levels.

Computer Science course instructors routinely have to create comprehensive test suites to assess programming assignments. The creation of such test suites is typically not trivial as it involves selecting a limited number of tests from a set of (semi-)randomly generated ones. Manual strategies for test selection do not scale when considering large testing inputs needed, for instance, for the assessment of algorithms exercises. To facilitate this process, we present TestSelector, a new framework for automatic selection of optimal test suites for student projects. The key advantage of TestSelector over existing approaches is that it is easily extensible with arbitrarily complex code coverage measures, not requiring these measures to be encoded into the logic of an exact constraint solver. We demonstrate the flexibility of TestSelector by extending it with support for a range of classical code coverage measures and using it to select test suites for a number of real-world algorithms projects, further showing that the selected test suites outperform randomly selected ones in finding bugs in students' code., Comment: 19 pages