nils-herrmann/clean_scirepeval huggingface dataset:
Novel 
B
-decay signatures of light scalars at high energy facilities

We study the phenomenology of light scalars of masses m1 and m2 coupling to heavy flavor-violating 
vector bosons of mass mV. For m1;2 
≲ few GeV, this scenario triggers the rare B meson decays 
B0s 
→ 3μþ3μ−, B0 → 3μþ3μ−, Bþ → Kþ3μþ3μ−, and B0s 
→ K03μþ3μ−; the last two being the most 
important ones for m1 ∼ m2. None of these signals have been studied experimentally; therefore, we propose 
analyses to test these channels at the LHCb. We demonstrate that the reach of this facility extends to 
branching ratios as small as 6.0 × 10−9, 1.6 × 10−9, 5.9 × 10−9, and 1.8 × 10−8 for the aforementioned 
channels, respectively. For m1;2 ≫ Oð1Þ GeV, we show that slightly modified versions of current 
multilepton and multitau searches at the LHC can probe wide regions of the parameter space of this 
scenario. Altogether, the potential of the searches we propose outperform other constraints such as those 
from meson mixing.
The Aemulus Project IV: Emulating Halo Bias

Models of the spatial distribution of dark matter halos must achieve new levels of precision and accuracy in order to satisfy the requirements of upcoming experiments. In this work, we present a halo bias emulator for modeling the clustering of halos on large scales. It incorporates the cosmological dependence of the bias beyond the mapping of halo mass to peak height. The emulator makes substantial improvements in accuracy compared to the widely used Tinker et al. (2010) model. Halos in this work are defined using an overdensity criteria of 200 relative to the mean background density. Halo catalogs are produced for 40 N-body simulations as part of the Aemulus project at snapshots from z=3 to z=0. The emulator is trained over the mass range $6\times10^{12}-7\times10^{15}\ h^{-1}M_{\odot}$. Using an additional suite of 35 simulations, we determine that the precision of the emulator is redshift dependent, achieving sub-percent levels for a majority of the redshift range. Two additional simulation suites are used to test the ability of the emulator to extrapolate to higher and lower masses. Our high-resolution simulation suite is used to develop an extrapolation scheme in which the emulator asymptotes to the Tinker et al. (2010) model at low mass, achieving ~3% accuracy down to $10^{11}\ h^{-1}M_{\odot}$. Finally, we present a method to propagate emulator modeling uncertainty into an error budget. Our emulator is made publicly available at \url{this https URL}.
Degeneracy in Self-Calibration Revisited and a Deep Learning Solution for Uncalibrated SLAM

Self-calibration of camera intrinsics and radial distortion has a long history of research in the computer vision community. However, it remains rare to see real applications of such techniques to modern Simultaneous Localization And Mapping (SLAM) systems, especially in driving scenarios. In this paper, we revisit the geometric approach to this problem, and provide a theoretical proof that explicitly shows the ambiguity between radial distortion and scene depth when two-view geometry is used to self-calibrate the radial distortion. In view of such geometric degeneracy, we propose a learning approach that trains a convolutional neural network (CNN) on a large amount of synthetic data. We demonstrate the utility of our proposed method by applying it as a checkerboard-free calibration tool for SLAM, achieving comparable or superior performance to previous learning and hand-crafted methods.
Scaling of percolation transitions on Erdös-Rényi networks under centrality-based attacks.

The study of network robustness focuses on the way the overall functionality of a network is affected as some of its constituent parts fail. Failures can occur at random or be part of an intentional attack and, in general, networks behave differently against different removal strategies. Although much effort has been put on this topic, there is no unified framework to study the problem. While random failures have been mostly studied under percolation theory, targeted attacks have been recently restated in terms of network dismantling. In this work, we link these two approaches by performing a finite-size scaling analysis to four dismantling strategies over Erdös-Rényi networks: initial and recalculated high degree removal and initial and recalculated high betweenness removal. We find that the critical exponents associated with the initial attacks are consistent with the ones corresponding to random percolation. For recalculated high degree, the exponents seem to deviate from mean field, but the evidence is not conclusive. Finally, recalculated betweenness produces a very abrupt transition with a hump in the cluster size distribution near the critical point, resembling some explosive percolation processes.
Decoding a Complex Visualization in a Science Museum – An Empirical Study

This study describes a detailed analysis of museum visitors' decoding process as they used a visualization designed to support exploration of a large, complex dataset. Quantitative and qualitative analyses revealed that it took, on average, 43 seconds for visitors to decode enough of the visualization to see patterns and relationships in the underlying data represented, and 54 seconds to arrive at their first correct data interpretation. Furthermore, visitors decoded throughout and not only upon initial use of the visualization. The study analyzed think-aloud data to identify issues visitors had mapping the visual representations to their intended referents, examine why they occurred, and consider if and how these decoding issues were resolved. The paper also describes how multiple visual encodings both helped and hindered decoding and concludes with implications on the design and adaptation of visualizations for informal science learning venues.
Wasserstein Robust Reinforcement Learning

Reinforcement learning algorithms, though successful, tend to over-fit to training environments hampering their application to the real-world. This paper proposes $\text{W}\text{R}^{2}\text{L}$ -- a robust reinforcement learning algorithm with significant robust performance on low and high-dimensional control tasks. Our method formalises robust reinforcement learning as a novel min-max game with a Wasserstein constraint for a correct and convergent solver. Apart from the formulation, we also propose an efficient and scalable solver following a novel zero-order optimisation method that we believe can be useful to numerical optimisation in general. We empirically demonstrate significant gains compared to standard and robust state-of-the-art algorithms on high-dimensional MuJuCo environments.
Learning over inherently distributed data

The recent decades have seen a surge of interests in distributed computing. Existing work focus primarily on either distributed computing platforms, data query tools, or, algorithms to divide big data and conquer at individual machines etc. It is, however, increasingly often that the data of interest are inherently distributed, i.e., data are stored at multiple distributed sites due to diverse collection channels, business operations etc. We propose to enable learning and inference in such a setting via a general framework based on the distortion minimizing local transformations. This framework only requires a small amount of local signatures to be shared among distributed sites, eliminating the need of having to transmitting big data. Computation can be done very efficiently via parallel local computation. The error incurred due to distributed computing vanishes when increasing the size of local signatures. As the shared data need not be in their original form, data privacy may also be preserved. Experiments on linear (logistic) regression and Random Forests have shown promise of this approach. This framework is expected to apply to a general class of tools in learning and inference with the continuity property.
Deep Learning Training on the Edge with Low-Precision Posits

Recently, the posit numerical format has shown promise for DNN data representation and compute with ultra-low precision ([5..8]-bit). However, majority of studies focus only on DNN inference. In this work, we propose DNN training using posits and compare with the floating point training. We evaluate on both MNIST and Fashion MNIST corpuses, where 16-bit posits outperform 16-bit floating point for end-to-end DNN training.
Multi-Agent Adversarial Inverse Reinforcement Learning

Reinforcement learning agents are prone to undesired behaviors due to reward mis-specification. Finding a set of reward functions to properly guide agent behaviors is particularly challenging in multi-agent scenarios. Inverse reinforcement learning provides a framework to automatically acquire suitable reward functions from expert demonstrations. Its extension to multi-agent settings, however, is difficult due to the more complex notions of rational behaviors. In this paper, we propose MA-AIRL, a new framework for multi-agent inverse reinforcement learning, which is effective and scalable for Markov games with high-dimensional state-action space and unknown dynamics. We derive our algorithm based on a new solution concept and maximum pseudolikelihood estimation within an adversarial reward learning framework. In the experiments, we demonstrate that MA-AIRL can recover reward functions that are highly correlated with ground truth ones, and significantly outperforms prior methods in terms of policy imitation.
Temporal Coding in Spiking Neural Networks with Alpha Synaptic Function

We propose a spiking neural network model that encodes information in the relative timing of individual neuron spikes and performs classification using the first output neuron to spike. This temporal coding scheme allows the supervised training of the network with backpropagation, using locally exact derivatives of the postsynaptic with respect to presynaptic spike times. The network uses a biologically-inspired alpha synaptic transfer function and trainable synchronisation pulses as temporal references. We successfully train the network on the MNIST dataset encoded in time. Our spiking neural network outperforms comparable spiking models and achieves similar accuracy to a fully connected conventional network. During training, our network displays a speed-accuracy trade-off, with either slow and highly-accurate or very fast but less accurate classification. The results demonstrate the computational power of spiking networks with biological characteristics that encode information in the timing of individual neurons. Our code is publicly available.
Toward Physically Unclonable Functions From Plasmonics-Enhanced Silicon Disc Resonators

The omnipresent digitalization trend has enabled a number of related malicious activities, ranging from data theft to disruption of businesses, counterfeiting of devices, and identity fraud, among others. Hence, it is essential to implement security schemes and to ensure the reliability and trustworthiness of electronic circuits. Toward this end, the concept of physically unclonable functions (PUFs) has been established at the beginning of the 21st century. However, most PUFs have eventually, at least partially, fallen short of their promises, which are unpredictability, unclonability, uniqueness, reproducibility, and tamper resilience. That is because most PUFs directly utilize the underlying microelectronics, but that intrinsic randomness can be limited and may thus be predicted, especially by machine learning. Optical PUFs, in contrast, are still considered as promising—they can derive strong, hard-to-predict randomness independently from microelectronics, by using some kind of “optical token.” Here, we propose a novel concept for plasmonics-enhanced optical PUFs, or peo-PUFs in short. For the first time, we leverage two highly nonlinear phenomena in conjunction by construction: first, light propagation in a silicon disk resonator, and second, surface plasmons arising from nanoparticles arranged randomly on top of the resonator. We elaborate on the physical phenomena, provide simulation results, and conduct a security analysis of peo-PUFs for secure key generation and authentication. This study highlights the good potential of peo-PUFs, and our future work is to focus on fabrication and characterization of such PUFs.
The Best of Both Modes: Separately Leveraging RGB and Depth for Unseen Object Instance Segmentation

In order to function in unstructured environments, robots need the ability to recognize unseen novel objects. We take a step in this direction by tackling the problem of segmenting unseen object instances in tabletop environments. However, the type of large-scale real-world dataset required for this task typically does not exist for most robotic settings, which motivates the use of synthetic data. We propose a novel method that separately leverages synthetic RGB and synthetic depth for unseen object instance segmentation. Our method is comprised of two stages where the first stage operates only on depth to produce rough initial masks, and the second stage refines these masks with RGB. Surprisingly, our framework is able to learn from synthetic RGB-D data where the RGB is non-photorealistic. To train our method, we introduce a large-scale synthetic dataset of random objects on tabletops. We show that our method, trained on this dataset, can produce sharp and accurate masks, outperforming state-of-the-art methods on unseen object instance segmentation. We also show that our method can segment unseen objects for robot grasping. Code, models and video can be found at this https URL.
SenseFitting: Sense Level Semantic Specialization of Word Embeddings for Word Sense Disambiguation

We introduce a neural network-based system of Word Sense Disambiguation (WSD) for German that is based on SenseFitting, a novel method for optimizing WSD. We outperform knowledge-based WSD methods by up to 25% F1-score and produce a new state-of-the-art on the German sense-annotated dataset WebCAGe. Our method uses three feature vectors consisting of a) sense, b) gloss, and c) relational vectors to represent target senses and to compare them with the vector centroids of sample contexts. Utilizing widely available word embeddings and lexical resources, we are able to compensate for the lower resource availability of German. SenseFitting builds upon the recently introduced semantic specialization procedure Attract-Repel, and leverages sense level semantic constraints from lexical-semantic networks (e.g. GermaNet) or online social dictionaries (e.g. Wiktionary) to produce high-quality sense embeddings from pre-trained word embeddings. We evaluate our sense embeddings with a new SimLex-999 based similarity dataset, called SimSense, that we developed for this work. We achieve results that outperform current lemma-based specialization methods for German, making them comparable to results achieved for English.
Effective impedance over ordered fields

In this paper, we study properties of effective impedance of finite electrical networks and calculate the effective impedance of a finite ladder network over an ordered field. Moreover, we consider two particular examples of infinite ladder networks (Feynman's network or LC-network and CL-network, both with zero on infinity) as networks over the ordered Levi-Civita field. We show, that effective impedances of finite LC-networks converge to the limit in order topology of Levi-Civita field, but the effective impedances of finite CL-networks do not converge in the same topology.
Quasi-stellar object redshift estimates from optical, near-infrared, and ultraviolet colours

A simple estimate of the photometric redshift would prove invaluable to forthcoming continuum surveys on the next generation of large radio telescopes, as well as mitigating the existing bias towards the most optically bright sources. While there is a well-known correlation between the near-infrared K-band magnitude and redshift for galaxies, we find the K − z relation to break down for samples dominated by quasi-stellar objects. We hypothesise that this is due to the additional contribution to the near-infrared flux by the active galactic nucleus, and, as such, the K-band magnitude can only provide a lower limit to the redshift in the case of active galactic nuclei, which will dominate the radio surveys. From a large optical dataset, we find a tight relationship between the rest-frame (U − K)/(W2 − FUV) colour ratio and spectroscopic redshift over a sample of 17 000 sources, spanning z ≈ 0.1−5. Using the observed-frame ratios of (U − K)/(W2 − FUV) for redshifts of z ≲ 1, (I − W2)/(W3 − U) for 1 ≲ z ≲ 3, and (I − W2.5)/(W4 − R) for z ≳ 3, where W2.5 is the λ = 8.0 μm magnitude and the appropriate redshift ranges are estimated from the W2 (4.5 μm) magnitude, we find this to be a robust photometric redshift estimator for quasars. We suggest that the rest-frame U − K colour traces the excess flux from the AGN over this wide range of redshifts, although the W2 − FUV colour is required to break the degeneracy.
EnclaveDom: Privilege Separation for Large-TCB Applications in Trusted Execution Environments

Trusted executions environments (TEEs) such as Intel(R) SGX provide hardware-isolated execution areas in memory, called enclaves. By running only the most trusted application components in the enclave, TEEs enable developers to minimize the TCB of their applications thereby helping to protect sensitive application data. However, porting existing applications to TEEs often requires considerable refactoring efforts, as TEEs provide a restricted interface to standard OS features. To ease development efforts, TEE application developers often choose to run their unmodified application in a library OS container that provides a full in-enclave OS interface. Yet, this large-TCB development approach now leaves sensitive in-enclave data exposed to potential bugs or vulnerabilities in third-party code imported into the application. Importantly, because the TEE libOS and the application run in the same enclave address space, even the libOS management data structures (e.g. file descriptor table) may be vulnerable to attack, where in traditional OSes these data structures may be protected via privilege isolation. 
We present EnclaveDom, a privilege separation system for large-TCB TEE applications that partitions an enclave into tagged memory regions, and enforces per-region access rules at the granularity of individual in-enclave functions. EnclaveDom is implemented on Intel SGX using Memory Protection Keys (MPK) for memory tagging. To evaluate the security and performance impact of EnclaveDom, we integrated EnclaveDom with the Graphene-SGX library OS. While no product or component can be absolutely secure, our prototype helps protect internal libOS management data structures against tampering by application-level code. At every libOS system call, EnclaveDom then only grants access to those internal data structures which the syscall needs to perform its task.
A Temporal Clustering Algorithm for Achieving the Trade-off between the User Experience and the Equipment Economy in the Context of IoT

We present here the Temporal Clustering Algorithm (TCA), an incremental learning algorithm applicable to problems of anticipatory computing in the context of the Internet of Things. This algorithm was tested in a specific prediction scenario of consumption of an electric water dispenser typically used in tropical countries, in which the ambient temperature is around 30-degree Celsius. In this context, the user typically wants to drinking iced water therefore uses the cooler function of the dispenser. Real and synthetic water consumption data was used to test a forecasting capacity on how much energy can be saved by predicting the pattern of use of the equipment. In addition to using a small constant amount of memory, which allows the algorithm to be implemented at the lowest cost, while using microcontrollers with a small amount of memory (less than 1Kbyte) available on the market. The algorithm can also be configured according to user preference, prioritizing comfort, keeping the water at the desired temperature longer, or prioritizing energy savings. The main result is that the TCA achieved energy savings of up to 40% compared to the conventional mode of operation of the dispenser with an average success rate higher than 90% in its times of use.
GIT stability of Hénon maps

In this paper we study the locus of generalized degree $d$ Henon maps in the parameter space $\operatorname{Rat}_d^N$ of degree $d$ rational maps $\mathbb{P}^N\to\mathbb{P}^N$ modulo the conjugation action of $\operatorname{SL}_{N+1}$. We show that Henon maps are in the GIT unstable locus if $N\ge3$ or $d\ge3$, and that they are semistable, but not stable, in the remaining case of $N=d=2$. We also give a general classification of all unstable maps in $\operatorname{Rat}_2^2$.
Robust autocalibrated structured low‐rank EPI ghost correction

We propose and evaluate a new structured low‐rank method for echo‐planar imaging (EPI) ghost correction called Robust Autocalibrated LORAKS (RAC‐LORAKS). The method can be used to suppress EPI ghosts arising from the differences between different readout gradient polarities and/or the differences between different shots. It does not require conventional EPI navigator signals, and is robust to imperfect autocalibration data.
Distributed Streaming Analytics on Large-scale Oceanographic Data using Apache Spark

Real-world data from diverse domains require real-time scalable analysis. Large-scale data processing frameworks or engines such as Hadoop fall short when results are needed on-the-fly. Apache Spark's streaming library is increasingly becoming a popular choice as it can stream and analyze a significant amount of data. In this paper, we analyze large-scale geo-temporal data collected from the USGODAE (United States Global Ocean Data Assimilation Experiment) data catalog, and showcase and assess the ability of Spark stream processing. We measure the latency of streaming and monitor scalability by adding and removing nodes in the middle of a streaming job. We also verify the fault tolerance by stopping nodes in the middle of a job and making sure that the job is rescheduled and completed on other nodes. We design a full-stack application that automates data collection, data processing and visualizing the results. We also use Google Maps API to visualize results by color coding the world map with values from various analytics.
PrecoderNet: Hybrid Beamforming for Millimeter Wave Systems With Deep Reinforcement Learning

In this letter, we investigate the hybrid beamforming for millimeter wave massive multiple-input multiple-output (MIMO) system based on deep reinforcement learning (DRL). Imperfect channel state information (CSI) is assumed to be available at the base station (BS). To achieve high spectral efficiency with low time consumption, we propose a novel DRL-based method called PrecoderNet to design the digital precoder and analog combiner. The DRL agent takes the digital beamformer and analog combiner of the previous learning iteration as state, and these matrices of current learning iteration as action. Simulation results demonstrate that the PrecoderNet performs well in spectral efficiency, bit error rate (BER), as well as time consumption, and is robust to the CSI imperfection.