Miracle-dz/UniFAR-FTUs huggingface dataset:
Minimum Symbol-Error Probability Symbol-Level Precoding With Intelligent Reflecting Surface

Recently, the use of intelligent reflecting surface (IRS) has gained considerable attention in wireless communications. By intelligently adjusting the passive reflection angle, IRS is able to assist the base station (BS) to extend the coverage and improve spectral efficiency. This letter considers a joint symbol-level precoding (SLP) and IRS reflecting design to minimize the symbol-error probability (SEP) of the intended users in an IRS-aided multiuser MISO downlink. We formulate the SEP minimization problems to pursue uniformly good performance for all users for both QAM and PSK constellations. The resulting problem is non-convex and we resort to alternating minimization to obtain a stationary solution. Simulation results demonstrate that under the aid of IRS our proposed design indeed enhances the bit-error rate performance. In particular, the performance improvement is significant when the number of IRS elements is large.
Scalable Algorithms for the Sparse Ridge Regression

Sparse regression and variable selection for large-scale data have been rapidly developed in the past decades. This work focuses on sparse ridge regression, which enforces the sparsity by use of the L0 norm. We first prove that the continuous relaxation of the mixed integer second order conic (MISOC) reformulation using perspective formulation is equivalent to that of the convex integer formulation proposed in recent work. We also show that the convex hull of the constraint system of MISOC formulation is equal to its continuous relaxation. Based upon these two formulations (i.e., the MISOC formulation and convex integer formulation), we analyze two scalable algorithms, the greedy and randomized algorithms, for sparse ridge regression with desirable theoretical properties. The proposed algorithms are proved to yield near-optimal solutions under mild conditions. We further propose to integrate the greedy algorithm with the randomized algorithm, which can greedily search the features from the nonzero subset identified by the continuous relaxation of the MISOC formulation. The merits of the proposed methods are illustrated through numerical examples in comparison with several existing ones.
Occlum: Secure and Efficient Multitasking Inside a Single Enclave of Intel SGX

Intel Software Guard Extensions (SGX) enables user-level code to create private memory regions called enclaves, whose code and data are protected by the CPU from software and hardware attacks outside the enclaves. Recent work introduces library operating systems (LibOSes) to SGX so that legacy applications can run inside enclaves with few or even no modifications. As virtually any non-trivial application demands multiple processes, it is essential for LibOSes to support multitasking. However, none of the existing SGX LibOSes support multitasking both securely and efficiently. This paper presents Occlum, a system that enables secure and efficient multitasking on SGX. We implement the LibOS processes as SFI-Isolated Processes (SIPs). SFI is a software instrumentation technique for sandboxing untrusted modules (called domains). We design a novel SFI scheme named MPX-based, Multi-Domain SFI (MMDSFI) and leverage MMDSFI to enforce the isolation of SIPs. We also design an independent verifier to ensure the security guarantees of MMDSFI. With SIPs safely sharing the single address space of an enclave, the LibOS can implement multitasking efficiently. The Occlum LibOS outperforms the state-of-the-art SGX LibOS on multitasking-heavy workloads by up to 6,600x on micro-benchmarks and up to 500x on application benchmarks.
Kinematic unrest of low mass galaxy groups

In an effort to better understand the formation of galaxy groups, we examine the kinematics of a large sample of spectroscopically confirmed X-ray galaxy groups in the Cosmic Evolution Survey with a high sampling of galaxy group members up to z = 1. We compare our results with predictions from the cosmological hydrodynamical simulation of HORIZON-AGN. Using a phase-space analysis of dynamics of groups with halo masses of M200c ∼ 1012.6 − 1014.50 M⊙, we show that the brightest group galaxies (BGG) in low mass galaxy groups (M200c < 2 × 1013 M⊙) have larger proper motions relative to the group velocity dispersion than high mass groups. The dispersion in the ratio of the BGG proper velocity to the velocity dispersion of the group, σBGG/σgroup, is on average 1.48 ± 0.13 for low mass groups and 1.01 ± 0.09 for high mass groups. A comparative analysis of the HORIZON-AGN simulation reveals a similar increase in the spread of peculiar velocities of BGGs with decreasing group mass, though consistency in the amplitude, shape, and mode of the BGG peculiar velocity distribution is only achieved for high mass groups. The groups hosting a BGG with a large peculiar velocity are more likely to be offset from the Lx − σv relation; this is probably because the peculiar motion of the BGG is influenced by the accretion of new members.
An interpretable neural network model through piecewise linear approximation

Most existing interpretable methods explain a black-box model in a post-hoc manner, which uses simpler models or data analysis techniques to interpret the predictions after the model is learned. However, they (a) may derive contradictory explanations on the same predictions given different methods and data samples, and (b) focus on using simpler models to provide higher descriptive accuracy at the sacrifice of prediction accuracy. To address these issues, we propose a hybrid interpretable model that combines a piecewise linear component and a nonlinear component. The first component describes the explicit feature contributions by piecewise linear approximation to increase the expressiveness of the model. The other component uses a multi-layer perceptron to capture feature interactions and implicit nonlinearity, and increase the prediction performance. Different from the post-hoc approaches, the interpretability is obtained once the model is learned in the form of feature shapes. We also provide a variant to explore higher-order interactions among features to demonstrate that the proposed model is flexible for adaptation. Experiments demonstrate that the proposed model can achieve good interpretability by describing feature shapes while maintaining state-of-the-art accuracy.
JVS-MuSiC: Japanese multispeaker singing-voice corpus

Thanks to developments in machine learning techniques, it has become possible to synthesize high-quality singing voices of a single singer. An open multispeaker singing-voice corpus would further accelerate the research in singing-voice synthesis. However, conventional singing-voice corpora only consist of the singing voices of a single singer. We designed a Japanese multispeaker singing-voice corpus called "JVS-MuSiC" with the aim to analyze and synthesize a variety of voices. The corpus consists of 100 singers' recordings of the same song, Katatsumuri, which is a Japanese children's song. It also includes another song that is different for each singer. In this paper, we describe the design of the corpus and experimental analyses using JVS-MuSiC. We investigated the relationship between 1) the similarity of singing voices and perceptual oneness of unison singing voices and between 2) the similarity of singing voices and that of speech. The results suggest that 1) there is a positive and moderate correlation between singing-voice similarity and the oneness of unison and that 2) the correlation between singing-voice similarity and speech similarity is weak. This corpus is freely available online.
From Pick-Up Artists to Incels: A Data-Driven Sketch of the Manosphere

Over the past few years, a number of "fringe" online communities have been orchestrating harassment campaigns and spreading extremist ideologies on the Web. In this paper, we present a large-scale characterization of the Manosphere, a conglomerate of predominantly Web-based misogynist movements roughly focused on men's issues. We do so by gathering and analyzing 38M posts obtained from 7 forums and 57 subreddits. We find that milder and older communities, such as Pick Up Artists and Men's Rights Activists, are giving way to more extremist communities like Incels and Men Going Their Own Way, with a substantial migration of active users. We also show that the Manosphere is characterized by a volume of hateful speech appreciably higher than other Web communities, including those, such as Gab, known to be hateful. Overall, we paint a comprehensive picture of the evolution of the Manosphere, highlighting the relevance of studying these communities using computational social science methods.
Peer-to-Peer Trading in Electricity Networks: An Overview

Peer-to-peer trading is a next-generation energy management technique that economically benefits proactive consumers (prosumers) transacting their energy as goods and services. At the same time, peer-to-peer energy trading is also expected to help the grid by reducing peak demand, lowering reserve requirements, and curtailing network loss. However, large-scale deployment of peer-to-peer trading in electricity networks poses a number of challenges in modeling transactions in both the virtual and physical layers of the network. As such, this article provides a comprehensive review of the state-of-the-art in research on peer-to-peer energy trading techniques. By doing so, we provide an overview of the key features of peer-to-peer trading and its benefits of relevance to the grid and prosumers. Then, we systematically classify the existing research in terms of the challenges that the studies address in the virtual and the physical layers. We then further identify and discuss those technical approaches that have been extensively used to address the challenges in peer-to-peer transactions. Finally, the paper is concluded with potential future research directions.
Multi-Agent Motion Planning for Dense and Dynamic Environments via Deep Reinforcement Learning

This letter introduces a hybrid algorithm of deep reinforcement learning (RL) and Force-based motion planning (FMP) to solve distributed motion planning problem in dense and dynamic environments. Individually, RL and FMP algorithms each have their own limitations. FMP is not able to produce time-optimal paths and existing RL solutions are not able to produce collision-free paths in dense environments. Therefore, we first tried improving the performance of recent RL approaches by introducing a new reward function that not only eliminates the requirement of a pre supervised learning (SL) step but also decreases the chance of collision in crowded environments. That improved things, but there were still a lot of failure cases. So, we developed a hybrid approach to leverage the simpler FMP approach in stuck, simple and high-risk cases, and continue using RL for normal cases in which FMP can’t produce optimal path. Also, we extend GA3C-CADRL algorithm to 3D environment. Simulation results show that the proposed algorithm outperforms both deep RL and FMP algorithms and produces up to 50<inline-formula><tex-math notation="LaTeX">$\%$</tex-math></inline-formula> more successful scenarios than deep RL and up to 75<inline-formula><tex-math notation="LaTeX">$\%$</tex-math></inline-formula> less extra time to reach goal than FMP.
A Tail Dependence-Based MST and Their Topological Indicators in Modeling Systemic Risk in the European Insurance Sector

In the present work, we analyze the dynamics of indirect connections between insurance companies that result from market price channels. In our analysis, we assume that the stock quotations of insurance companies reflect market sentiments, which constitute a very important systemic risk factor. Interlinkages between insurers and their dynamics have a direct impact on systemic risk contagion in the insurance sector. Herein, we propose a new hybrid approach to the analysis of interlinkages dynamics based on combining the copula-DCC-GARCH model and minimum spanning trees (MST). Using the copula-DCC-GARCH model, we determine the tail dependence coefficients. Then, for each analyzed period we construct MST based on these coefficients. The dynamics are analyzed by means of the time series of selected topological indicators of the MSTs in the years 2005–2019. The contribution to systemic risk of each institution is determined by analyzing the deltaCoVaR time series using the copula-DCC-GARCH model. Our empirical results show the usefulness of the proposed approach to the analysis of systemic risk (SR) in the insurance sector. The times series obtained from the proposed hybrid approach reflect the phenomena occurring in the market. We check whether the analyzed MST topological indicators can be considered as systemic risk predictors.
Monitoring the optical quality of the FACT Cherenkov Telescope

In gamma ray astronomy muon events have a distinct feature of casting ring-like images on the sensor plane, thus forming a well known signal class for Cherenkov telescopes. These ring-like images can then be used to deduce the optical point spread function (PSF) which is an important measure of the optical quality of the imaging-reflector. In this thesis the observed 'fuzziness' of muon rings is used as a measure to infer the PSF. However to have a good estimate for this 'fuzziness' parameter, the reconstruction of the ring center and ring radius itself needs to be accurate, so different methods of ring feature extraction are studied. To check for the accuracy of the methods a simulation and analysis is performed. Measuring the evolution of the PSF over time allows to identify its effects and take them into account for the reconstruction of gamma-rays postliminary. As a further benefit of the methods presented here no additional observations are needed to measure the PSF nor any human activity on site is required. The accuracy of the method, and the PSF of FACT vs. time are presented.
Capturing Evolution in Word Usage: Just Add More Clusters?

The way the words are used evolves through time, mirroring cultural or technological evolution of society. Semantic change detection is the task of detecting and analysing word evolution in textual data, even in short periods of time. In this paper we focus on a new set of methods relying on contextualised embeddings, a type of semantic modelling that revolutionised the NLP field recently. We leverage the ability of the transformer-based BERT model to generate contextualised embeddings capable of detecting semantic change of words across time. Several approaches are compared in a common setting in order to establish strengths and weaknesses for each of them. We also propose several ideas for improvements, managing to drastically improve the performance of existing approaches.
Understanding Electricity-Theft Behavior via Multi-Source Data

Electricity theft, the behavior that involves users conducting illegal operations on electrical meters to avoid individual electricity bills, is a common phenomenon in the developing countries. Considering its harmfulness to both power grids and the public, several mechanized methods have been developed to automatically recognize electricity-theft behaviors. However, these methods, which mainly assess users’ electricity usage records, can be insufficient due to the diversity of theft tactics and the irregularity of user behaviors. In this paper, we propose to recognize electricity-theft behavior via multi-source data. In addition to users’ electricity usage records, we analyze user behaviors by means of regional factors (non-technical loss) and climatic factors (temperature) in the corresponding transformer area. By conducting analytical experiments, we unearth several interesting patterns: for instance, electricity thieves are likely to consume much more electrical power than normal users, especially under extremely high or low temperatures. Motivated by these empirical observations, we further design a novel hierarchical framework for identifying electricity thieves. Experimental results based on a real-world dataset demonstrate that our proposed model can achieve the best performance in electricity-theft detection (e.g., at least +3.0% in terms of F0.5) compared with several baselines. Last but not least, our work has been applied by the State Grid of China and used to successfully catch electricity thieves in Hangzhou with a precision of 15% (an improvement from 0% attained by several other models the company employed) during monthly on-site investigation.
MixTConv: Mixed Temporal Convolutional Kernels for Efficient Action Recogntion

To efficiently extract spatiotemporal features of video for action recognition, most state-of-the-art methods integrate 1D temporal convolution into a conventional 2D CNN backbone. However, they all exploit 1D temporal convolution of fixed kernel size (i.e., 3) in the network building block, thus have suboptimal temporal modeling capability to handle both long-term and short-term actions. To address this problem, we first investigate the impacts of different kernel sizes for the 1D temporal convolutional filters. Then, we propose a simple yet efficient operation called Mixed Temporal Convolution (MixTConv), which consists of multiple depthwise 1D convolutional filters with different kernel sizes. By plugging MixTConv into the conventional 2D CNN backbone ResNet-50, we further propose an efficient and effective network architecture named MSTNet for action recognition, and achieve state-of-the-art results on multiple benchmarks.
Asymptotic normality of a linear threshold estimator in fixed dimension with near-optimal rate

Linear thresholding models postulate that the conditional distribution of a response variable in terms of covariates differs on the two sides of a (typically unknown) hyperplane in the covariate space. A key goal in such models is to learn about this separating hyperplane. Exact likelihood or least square methods to estimate the thresholding parameter involve an indicator function which make them difficult to optimize and are, therefore, often tackled by using a surrogate loss that uses a smooth approximation to the indicator. In this note, we demonstrate that the resulting estimator is asymptotically normal with a near optimal rate of convergence: $n^{-1}$ up to a log factor, in a classification thresholding model. This is substantially faster than the currently established convergence rates of smoothed estimators for similar models in the statistics and econometrics literatures.
Distributionally Robust Bayesian Quadrature Optimization

Bayesian quadrature optimization (BQO) maximizes the expectation of an expensive black-box integrand taken over a known probability distribution. In this work, we study BQO under distributional uncertainty in which the underlying probability distribution is unknown except for a limited set of its i.i. d. samples. A standard BQO approach maximizes the Monte Carlo estimate of the true expected objective given the fixed sample set. Though Monte Carlo estimate is unbiased, it has high variance given a small set of samples; thus can result in a spurious objective function. We adopt the distributionally robust optimization perspective to this problem by maximizing the expected objective under the most adversarial distribution. In particular, we propose a novel posterior sampling based algorithm, namely distributionally robust BQO (DRBQO) for this purpose. We demonstrate the empirical effectiveness of our proposed framework in synthetic and real-world problems, and characterize its theoretical convergence via Bayesian regret.
Search for multimessenger signals in NOvA coincident with LIGO/Virgo detections

Using the NOvA neutrino detectors, a broad search has been performed for any signal coincident with 28 gravitational wave events detected by the LIGO/Virgo Collaboration between September 2015 and July 2019. For all of these events, NOvA is sensitive to possible arrival of neutrinos and cosmic rays of GeV and higher energies. For five (seven) events in the NOvA Far (Near) Detector, timely public alerts from the LIGO/Virgo Collaboration allowed recording of MeV-scale events. No signal candidates were found.
Developing and Validating an Interactive Training Tool for Inferring 2D Cross-Sections of Complex 3D Structures

Understanding 2D cross-sections of 3D structures is a crucial skill in many disciplines, from geology to medical imaging. Cross-section inference in the context of 3D structures requires a complex set of spatial/visualization skills including mental rotation, spatial structure understanding, and viewpoint projection. Prior studies show that experts differ from novices in these, and other, skill dimensions. Building on a previously developed model that hierarchically characterizes the specific spatial sub-skills needed for this task, we have developed the first domain-agnostic, computer-based training tool for cross-section understanding of complex 3D structures. We demonstrate, in an evaluation with 60 participants, that this interactive tool is effective for increasing cross-section inference skills for a variety of structures, from simple primitive ones to more complex biological structures.
The displacement field associated with the freezing of a melt and its role in determining crystal growth kinetics

Significance We demonstrate that an accurate estimation of the displacements associated with the transformation of liquid into crystal is necessary to explain the striking variations in the temperature dependence of the addition rate of liquid atoms to the growing crystal interface during freezing. An assignment algorithm, adapted from operations theory, is shown to provide a good estimate of these atomic displacements. As the assignment algorithm requires only initial and target locations, it is applicable to all forms of structural transformations. In resolving a fundamental feature of the kinetics of freezing, a phenomenon of central importance to material fabrication, this paper also provides the tools to open lines of research into the kinetics of structural transformation. The atomic displacements associated with the freezing of metals and salts are calculated by treating crystal growth as an assignment problem through the use of an optimal transport algorithm. Converting these displacements into timescales based on the dynamics of the bulk liquid, we show that we can predict the activation energy for crystal growth rates, including activation energies significantly smaller than those for atomic diffusion in the liquid. The exception to this success, pure metals that freeze into face-centered cubic crystals with little to no activation energy, are discussed. The atomic displacements generated by the assignment algorithm allows us to quantify the key roles of crystal structure and liquid caging length in determining the temperature dependence of crystal growth kinetics.