Miracle-dz/UniFAR-FTUs huggingface dataset:
Architecture and Its Vulnerabilities in Smart-Lighting Systems

Industry 4.0 embodies one of the significant technological changes of this decade. Cyber-physical systems and the Internet Of Things are two central technologies in this change that embed or connect with sensors and actuators and interact with the physical environment. However, such systems-of-systems undergo additional restrictions in an endeavor to maintain reliability and security when building and interconnecting components to a heterogeneous, multi-domain \textit{Smart-*} systems architecture. This paper presents an application-specific, layer-based approach to an offline security analysis inspired by design science that merges preceding expertise from relevant domains. With the example of a Smart-lighting system, we create a dedicated unified taxonomy for the use case and analyze its distributed Smart-* architecture by multiple layer-based models. We derive potential attacks from the system specifications in an iterative and incremental process and discuss resulting threats and vulnerabilities. Finally, we suggest immediate countermeasures for the latter potential multiple-domain security concerns.
Adversarial Training with Contrastive Learning in NLP

For years, adversarial training has been extensively studied in natural language processing (NLP) settings. The main goal is to make models robust so that similar inputs derive in semantically similar outcomes, which is not a trivial problem since there is no objective measure of semantic similarity in language. Previous works use an external pre-trained NLP model to tackle this challenge, introducing an extra training stage with huge memory consumption during training. However, the recent popular approach of contrastive learning in language processing hints a convenient way of obtaining such similarity restrictions. The main advantage of the contrastive learning approach is that it aims for similar data points to be mapped close to each other and further from different ones in the representation space. In this work, we propose adversarial training with contrastive learning (ATCL) to adversarially train a language processing task using the benefits of contrastive learning. The core idea is to make linear perturbations in the embedding space of the input via fast gradient methods (FGM) and train the model to keep the original and perturbed representations close via contrastive learning. In NLP experiments, we applied ATCL to language modeling and neural machine translation tasks. The results show not only an improvement in the quantitative (perplexity and BLEU) scores when compared to the baselines, but ATCL also achieves good qualitative results in the semantic level for both tasks without using a pre-trained model.
Knowledge Graph Question Answering via SPARQL Silhouette Generation

Knowledge Graph Question Answering (KGQA) has become a prominent area in natural language processing due to the emergence of large-scale Knowledge Graphs (KGs). Recently Neural Machine Translation based approaches are gaining momentum that translates natural language queries to structured query languages thereby solving the KGQA task. However, most of these methods struggle with out-of-vocabulary words where test entities and relations are not seen during training time. In this work, we propose a modular two-stage neural architecture to solve the KGQA task. The first stage generates a sketch of the target SPARQL called SPARQL silhouette for the input question. This comprises of (1) Noise simulator to facilitate out-of-vocabulary words and to reduce vocabulary size (2) seq2seq model for text to SPARQL silhouette generation. The second stage is a Neural Graph Search Module. SPARQL silhouette generated in the first stage is distilled in the second stage by substituting precise relation in the predicted structure. We simulate ideal and realistic scenarios by designing a noise simulator. Experimental results show that the quality of generated SPARQL silhouette in the first stage is outstanding for the ideal scenarios but for realistic scenarios (i.e. noisy linker), the quality of the resulting SPARQL silhouette drops drastically. However, our neural graph search module recovers it considerably. We show that our method can achieve reasonable performance improving the state-of-art by a margin of 3.72% F1 for the LC-QuAD-1 dataset. We believe, our proposed approach is novel and will lead to dynamic KGQA solutions that are suited for practical applications.
A long-lived compact jet in the black hole X-ray binary candidate AT2019wey

AT2019wey is a transient discovered by the Asteroid Terrestrial-impact Last Alert System (ATLAS) survey in December of 2019. Follow-up optical, radio, and X-ray observations led to classification of this source as a Galactic black hole X-ray binary. We carried out one-epoch 6.7 GHz European VLBI (Very Long Baseline Interferometry) Network (EVN) and two-epoch multiple-frequency (1.6, 4.5, 6.7 GHz) Very Long Baseline Array (VLBA) observations within a year after its discovery. These observations reveal a fading and flat-spectrum radio source with no discernible motion. These features suggest the detection of a compact jet. The source appears resolved at milliarcsecond scales, and the source angular size versus frequency trend is consistent with scatter broadening. This allows us to constrain the lower limit of the source distance to 6 kpc, if the scattering medium is in a Galactic spiral arm. For a source location larger than 3 kpc, the estimated upper limit of the peculiar velocity, relative to the local standard of rest, suggests the asymmetric natal kick may have occurred during the black hole formation stage.
Neural Networks with Inputs Based on Domain of Dependence and A Converging Sequence for Solving Conservation Laws, Part I: 1D Riemann Problems

Recent research works for solving partial differential equations (PDEs) with deep neural networks (DNNs) have demonstrated that spatiotemporal function approximators defined by auto-differentiation are effective for approximating nonlinear problems, e.g. the Burger's equation, heat conduction equations, Allen-Cahn and other reaction-diffusion equations, and Navier-Stokes equation. Meanwhile, researchers apply automatic differentiation in physics-informed neural network (PINN) to solve nonlinear hyperbolic systems based on conservation laws with highly discontinuous transition, such as Riemann problem, by inverse problem formulation in data-driven approach. However, it remains a challenge for forward methods using DNNs without knowing part of the solution to resolve discontinuities in nonlinear conservation laws. In this study, we incorporate 1st order numerical schemes into DNNs to set up the loss functional approximator instead of auto-differentiation from traditional deep learning framework, e.g. TensorFlow package, which improves the effectiveness of capturing discontinuities in Riemann problems. In particular, the 2-Coarse-Grid neural network (2CGNN) and 2-Diffusion-Coefficient neural network (2DCNN) are introduced in this work. We use 2 solutions of a conservation law from a converging sequence, computed from a low-cost numerical scheme, and in a domain of dependence of a space-time grid point as the input for a neural network to predict its high-fidelity solution at the grid point. Despite smeared input solutions, they output sharp approximations to solutions containing shocks and contacts and are efficient to use once trained.
Spectral and Energy Efficiency of Multicell Massive MIMO With Variable-Resolution ADCs Over Correlated Rayleigh Fading Channels

This paper analyzes the performance of multicell massive multiple-input and multiple-output (MIMO) systems with variable-resolution analog-to-digital converters (ADCs). In such an architecture, each ADC uses arbitrary quantization resolution to save power and hardware cost. Along this direction, we first introduce a quantization-aware channel estimator based on additive quantization noise model (AQNM) and linear minimum mean-squared error (LMMSE) estimate theory. Afterwards, by leveraging on the estimated channel state information (CSI), we derive the asymptotic expressions of achievable uplink spectral efficiency (SE) over spatially correlated Rayleigh fading channels for maximal ratio combining (MRC), quantization-aware multicell minimum mean-squared error (QA-M-MMSE) combining, and quantization-aware single-cell MMSE (QA-S-MMSE) combining, respectively. During the derivations, we consider the effect of quantization errors and resort to random matrix theory to achieve the asymptotic results. Finally, simulation results demonstrate that our theoretical analyses are correct and that the proposed quantization-aware estimator and combiners are more beneficial than the quantization-unaware counterparts. Besides, based on a generic power consumption model, it is shown that low-resolution ADCs can obtain the best tradeoff between SE and energy efficiency (EE) under multicell scenarios.
Asymmetrical Uplink and Downlink Transceivers in Massive MIMO Systems

Even if massive multiple-input multiple-output (MIMO) can theoretically bring huge benefits, it incurs substantial hardware complexity and expensive hardware costs. To address these issues while maintaining the system performance simultaneously, we develop an asymmetrical transceiver architecture for massive MIMO systems in this paper by releasing the shackles on radio frequency (RF) chains. Specifically, we first develop the architecture for the asymmetrical transceiver where the number of receive RF chains is different from that of the transmit RF chains. Due to this unequal number of RF chains, channel inconsistency appears. To overcome the channel inconsistency and thus fully harness the system's downlink data transmission capability, we propose two uplink-to-downlink channel transfer algorithms. The cost and power consumption models for the asymmetrical transceiver are also developed and the uplink signal-to-noise loss due to the channel inconsistency is investigated. Through analyzing system spectral, cost, and energy efficiency, we demonstrate that the proposed asymmetrical transceiver-based massive MIMO system can achieve excellent downlink spectral efficiency while maintaining a reasonable energy efficiency.
Polytopes and machine learning

We introduce machine learning methodology to the study of lattice polytopes. With supervised learning techniques, we predict standard properties such as volume, dual volume, reflexivity, etc, with accuracies up to 100%. We focus on 2d polygons and 3d polytopes with Pl\"ucker coordinates as input, which out-perform the usual vertex representation.
Grouping Search Results with Product Graphs in E-commerce Platforms

Showing relevant search results to the user is the primary challenge for any search system. Walmart e-commerce provides an omnichannel search platform to its customers to search from millions of products. This search platform takes a textual query as input and shows relevant items from the catalog. One of the primary challenges is that this queries are complex to understand as it contains multiple intent in many cases. This paper proposes a framework to group search results into multiple ranked lists intending to provide better user intent. The framework is to create a product graph having relations between product entities and utilize it to group search results into a series of stacks where each stack provides a group of items based on a precise intent. As an example, for a query"milk,"the results can be grouped into multiple stacks of"white milk","low-fat milk","almond milk","flavored milk". We measure the impact of our algorithm by evaluating how it improves the user experience both in terms of search quality relevance and user behavioral signals like Add-To-Cart.
Towards Ubiquitous Indoor Positioning: Comparing Systems across Heterogeneous Datasets

The evaluation of Indoor Positioning Systems (IPSs) mostly relies on local deployments in the researchers' or partners' facilities. The complexity of preparing comprehensive experiments, collecting data, and considering multiple scenarios usually limits the evaluation area and, therefore, the assessment of the proposed systems. The requirements and features of controlled experiments cannot be generalized since the use of the same sensors or anchors density cannot be guaranteed. The dawn of datasets is pushing IPS evaluation to a similar level as machine-learning models, where new proposals are evaluated over many heterogeneous datasets. This paper proposes a way to evaluate IPSs in multiple scenarios, that is validated with three use cases. The results prove that the proposed aggregation of the evaluation metric values is a useful tool for high-level comparison of IPSs.
Scenario adaptive disruption prediction study for next generation burning-plasma tokamaks

Next generation High Performance (HP) tokamaks risk damage from unmitigated disruptions at high current and power. Achieving reliable disruption prediction for a device’s HP operation based on its Low Performance (LP) data is a key to its success. In this letter, through explorative data analysis and dedicated numerical experiments on multiple existing tokamaks, we demonstrate how the operational regimes of tokamaks can affect the power of a trained disruption predictor. First, our results suggest data-driven disruption predictors trained on abundant LP discharges work poorly on the HP regime of the same tokamak, which is a consequence of the distinct distributions of the tightly correlated signals related to disruptions in these two regimes. Second, we find that matching operational parameters among tokamaks strongly improves cross-machine accuracy which implies our model learns from the underlying scalings of dimensionless physics parameters like q 95, β p and confirms the importance of these parameters in disruption physics and cross machine domain matching from the data-driven perspective. Finally, our results show in the absence of HP data from the target devices, the best predictivity of the HP regime for the target machine can be achieved by combining LP data from the target with HP data from other machines. These results provide a possible disruption predictor development strategy for next generation tokamaks, such as ITER and SPARC, and highlight the importance of developing baseline scenario discharges of future tokamaks on existing machines to collect more relevant disruptive data.
Vector-Valued Control Variates

Control variates are variance reduction tools for Monte Carlo estimators. They can provide significant variance reduction, but usually require a large number of samples, which can be prohibitive when sampling or evaluating the integrand is computationally expensive. Furthermore, there are many scenarios where we need to compute multiple related integrals simultaneously or sequentially, which can further exacerbate computational costs. In this paper, we propose vector-valued control variates, an extension of control variates which can be used to reduce the variance of multiple Monte Carlo estimators jointly. This allows for the transfer of information across integration tasks, and hence reduces the need for a large number of samples. We focus on control variates based on kernel interpolants and our novel construction is obtained through a generalised Stein identity and the development of novel matrix-valued Stein reproducing kernels. We demonstrate our methodology on a range of problems including multifidelity modelling, Bayesian inference for dynamical systems, and model evidence computation through thermodynamic integration.
Fundamental Machine Learning Routines as Quantum Algorithms on a Superconducting Quantum Computer

The Harrow-Hassidim-Lloyd algorithm is intended for solving the system of linear equations on quantum devices. The exponential advantage of the algorithm comes with four caveats. We present a numerical study of the performance of the algorithm when these caveats are not perfectly matched. We observe that, between diagonal and non-diagonal matrices, the algorithm performs with higher success probability for the diagonal matrices. At the same time, it fails to perform well on lower or higher density sparse Hermitian matrices. Again, Quantum Support Vector Machine algorithm is a promising algorithm for classification problem. We have found out that it works better with binary classification problem than multi-label classification problem. And there are many opportunities left for improving the performance.
Stellar Spins in the Pleiades, Praesepe, and M35 Open Clusters

We analyze spectroscopic and photometric data to determine the projected inclinations of stars in three open clusters: the Pleiades, Praesepe, and M35. We determine the sini values of 42, 35, and 67 stars in each cluster, respectively, and from their distributions we find that isotropic spins and moderate alignment are both consistent with the Pleiades and Praesepe data. While it is difficult to distinguish between these scenarios for a single cluster, an ensemble of such distributions may facilitate a distinction. The M35 inclination distribution is most consistent with a superposition of isotropic and anisotropic spins, the source of which could be systematic error or a physical grouping of aligned stars. We also study internal cluster kinematics using radial velocities and proper motions. Our kinematics analysis reveals significant plane-of-sky rotation in Praesepe, with a mean velocity of 0.132 ± 0.022 km s−1 in a clockwise direction.
PC2-PU: Patch Correlation and Position Correction for Effective Point Cloud Upsampling

Point cloud upsampling is to densify a sparse point set acquired from 3D sensors, providing a denser representation for underlying surface. However, existing methods perform upsampling on a single patch, ignoring the coherence and relation of the entire surface, thus limiting the upsampled capability. Also, they mainly focus on a clean input, thus the performance is severely compromised when handling scenarios with extra noises. In this paper, we present a novel method for more effective point cloud upsampling, achieving a more robust and improved performance. To this end, we incorporate two thorough considerations. i) Instead of upsampling each small patch independently as previous works, we take adjacent patches as input and introduce a Patch Correlation Unit to explore the shape correspondence between them for effective upsampling. ii) We propose a Position Correction Unit to mitigate the effects of outliers and noisy points. It contains a distance-aware encoder to dynamically adjust the generated points to be close to the underlying surface. Extensive experiments demonstrate that our proposed method surpasses previous upsampling methods on both clean and noisy inputs.
"Don't Downvote A$$$$$$s!!": An Exploration of Reddit's Advice Communities

Advice forums are a crowdsourced way to reinforce cultural norms and moral behavior. Sites like Reddit contain massive amounts of natural language human interaction, with rules and norms unique to each individual subreddit community. To explore this data, we created a dataset with top 1000 posts from each of two such forums, r/AmItheAsshole and r/relationships, and extracted natural language features including sentiment, similarity, word frequency, and demographics using both algorithmic and manual methods. Further, we developed a method to extract demographic information from the subreddits, examined how the post authors' self-disclosures reflect the unique communities in which their posts are shared, and discussed how the authors' language use choices might be related to broader social patterns. We observed some differences between the subreddits in terms of word frequency, demographics disclosure, and gendered language. In general, both subreddits had more female posters than male, and posters tended to use more words about their opposite gender than the same. Gender-diverse posters were uncommon. Implications for future research include a more careful, inclusive focus on identity and disclosure and how that interacts with advice-seeking behavior in online communities.
Pauli Radius of the Proton

Using a procedure based on interpolation via continued fractions supplemented by statistical sampling, we analyze proton magnetic form factor data obtained via electron+proton scattering on Q 2 ∈ [0.027, 0.55] GeV2 with the goal of determining the proton magnetic radius. The approach avoids assumptions about the function form used for data interpolation and ensuing extrapolation onto Q 2 ≃ 0 for extraction of the form factor slope. In this way, we find r M = 0.817(27) fm. Regarding the difference between proton electric and magnetic radii calculated in this way, extant data are seen to be compatible with the possibility that the slopes of the proton Dirac and Pauli form factors, F 1,2(Q 2), are not truly independent observables; to wit, the difference F′1(0)−F′2(0)/κp=[1+κp]/[4mp2] , viz., the proton Foldy term.
Perspective-taking and Pragmatics for Generating Empathetic Responses Focused on Emotion Causes

Empathy is a complex cognitive ability based on the reasoning of others’ affective states. In order to better understand others and express stronger empathy in dialogues, we argue that two issues must be tackled at the same time: (i) identifying which word is the cause for the other’s emotion from his or her utterance and (ii) reflecting those specific words in the response generation. However, previous approaches for recognizing emotion cause words in text require sub-utterance level annotations, which can be demanding. Taking inspiration from social cognition, we leverage a generative estimator to infer emotion cause words from utterances with no word-level label. Also, we introduce a novel method based on pragmatics to make dialogue models focus on targeted words in the input during generation. Our method is applicable to any dialogue models with no additional training on the fly. We show our approach improves multiple best-performing dialogue agents on generating more focused empathetic responses in terms of both automatic and human evaluation.
Accelerated Stochastic Gradient for Nonnegative Tensor Completion and Parallel Implementation

We consider the problem of nonnegative tensor completion. We adopt the alternating optimization framework and solve each nonnegative matrix completion problem via a stochastic variation of the accelerated gradient algorithm. We experimentally test the effectiveness and the efficiency of our algorithm using both real-world and synthetic data. We develop a shared-memory implementation of our algorithm using the multithreaded API OpenMP, which attains significant speedup. We believe that our approach is a very competitive candidate for the solution of very large nonnegative tensor completion problems.
Description of Corner Cases in Automated Driving: Goals and Challenges

Scaling the distribution of automated vehicles requires handling various unexpected and possibly dangerous situations, termed corner cases (CC). Since many modules of automated driving systems are based on machine learning (ML), CC are an essential part of the data for their development. However, there is only a limited amount of CC data in large-scale data collections, which makes them challenging in the context of ML. With a better understanding of CC, offline applications, e.g., dataset analysis, and online methods, e.g., improved performance of automated driving systems, can be improved. While there are knowledge-based descriptions and taxonomies for CC, there is little research on machine-interpretable descriptions. In this extended abstract, we will give a brief overview of the challenges and goals of such a description.