Miracle-dz/UniFAR-FTUs huggingface dataset:
Rethinking Activity Awareness: The Design, Evaluation & Implication of Integrating Activity Awareness into Mobile Messaging

Nowadays, different types of context information are integrated into mobile messaging to increase expressiveness and awareness, including mobile device setting, location, activity, and heart rate. Due to low recognition accuracy, sometimes users cannot accurately infer others’ status through activity awareness. Recently, activity recognition technology has advanced. However, the user behaviors of activity awareness with improved technology have not been studied. In this study, we design ActAware, a mobile instant messaging application that integrates activity awareness based on improved activity recognition technology, i.e., improved recognition accuracy and the addition of activity transition notification. We conduct a field study to explore user behaviors and found that activity awareness allows users to speculate on the reasons for chat interruption, plan communication, speculate on whether the chat partner is departing/arriving, and deepen the understanding of living patterns. Compared with disclosing other types of context information, users have fewer privacy concerns about disclosing activity information in ActAware. Based on these findings, we provide design recommendations for mobile messaging to better support activity awareness.
Distortion-Aware Brushing for Interactive Cluster Analysis in Multidimensional Projections

Brushing is an everyday interaction in 2D scatterplots, which allows users to select and filter data points within a continuous, enclosed region and conduct further analysis on the points. However, such conventional brushing cannot be directly applied to Multidimensional Projections (MDP), as they hardly escape from False and Missing Neighbors distortions that make the relative positions of the points unreliable. To alleviate this problem, we introduce Distortion-aware brushing, a novel brushing technique for MDP. While users perform brushing, Distortion-aware brushing resolves distortions around currently brushed points by dynamically relocating points in the projection; the points whose data are close to the brushed data in the multidimensional (MD) space go near the corresponding brushed points in the projection, and the opposites move away. Hence, users can overcome distortions and readily extract out clustered data in the MD space using the technique. We demonstrate the effectiveness and applicability of Distortion-aware brushing through usage scenarios with two datasets. Finally, by conducting user studies with 30 participants, we verified that Distortion-aware brushing significantly outperforms previous brushing techniques in precisely separating clusters in the MD space, and works robustly regardless of the types or the amount of distortions in MDP.
Hierarchical Neural Network Approaches for Long Document Classification

Text classification algorithms investigate the intricate relationships between words or phrases and attempt to deduce the document’s interpretation. In the last few years, these algorithms have progressed tremendously. Transformer architecture and sentence encoders have proven to give superior results on natural language processing tasks. But a major limitation of these architectures is their applicability for text no longer than a few hundred words. In this paper, we explore hierarchical transfer learning approaches for long document classification. We employ pre-trained Universal Sentence Encoder (USE) and Bidirectional Encoder Representations from Transformers (BERT) in a hierarchical setup to capture better representations efficiently. Our proposed models are conceptually simple where we divide the input data into chunks and then pass this through base models of BERT and USE. Then output representation for each chunk is then propagated through a shallow neural network comprising of LSTMs or CNNs for classifying the text data. These extensions are evaluated on 6 benchmark datasets. We show that USE + CNN/LSTM performs better than its stand-alone baseline. Whereas the BERT + CNN/LSTM performs on par with its stand-alone counterpart. However, the hierarchical BERT models are still desirable as it avoids the quadratic complexity of the attention mechanism in BERT. Along with the hierarchical approaches, this work also provides a comparison of different deep learning algorithms like USE, BERT, HAN, Longformer, and BigBird for long document classification. The Longformer approach consistently performs well on most of the datasets.
Label Dependent Attention Model for Disease Risk Prediction Using Multimodal Electronic Health Records

Disease risk prediction has attracted increasing attention in the field of modern healthcare, especially with the latest advances in artificial intelligence (AI). Electronic health records (EHRs), which contain heterogeneous patient information, are widely used in disease risk prediction tasks. One challenge of applying AI models for risk prediction lies in generating interpretable evidence to support the prediction results while retaining the prediction ability. In order to address this problem, we propose the method of jointly embedding words and labels whereby attention modules learn the weights of words from medical notes according to their relevance to the names of risk prediction labels. This approach boosts interpretability by employing an attention mechanism and including the names of prediction tasks in the model. However, its application is only limited to the handling of textual inputs such as medical notes. In this paper, we propose a label dependent attention model LDAM to 1) improve the interpretability by exploiting Clinical-BERT (a biomedical language model pre-trained on a large clinical corpus) to encode biomedically meaningful features and labels jointly; 2) extend the idea of joint embedding to the processing of timeseries data, and develop a multi-modal learning framework for integrating heterogeneous information from medical notes and time-series health status indicators. To demonstrate our method, we apply LDAM to the MIMIC-III dataset to predict different disease risks. We evaluate our method both quantitatively and qualitatively. Specifically, the predictive power of LDAM will be shown, and case studies will be carried out to illustrate its interpretability.
Feedforward Quantum Control and Coherence Protection of Single Electron Spin in Diamond using Deep Learning

Measurement-based realtime control is an important strategy in quantum information processing, which is applied in ﬁelds from qubit readout to error corrections. However, the time cost of quantum measurement inevitably induces a latency in the control process and limits its performance. Here we introduce the deep learning approach to relax this restriction by predicting and compensating the latency-induced control error. We experimentally implement feedforward quantum control of a single-spin system of nitrogen-vacancy (NV) center in diamond to protect the coherence of the electron spin. The new approach enhances the decoherence time as well as the the spectrum resolution of Ramsey interferometry about three times comparing with conventional scheme. This enables resolving optically indistinguishable NV centers from their magnetic spectrum with a frequency diﬀerence less than 20 kHz. A theoretical model is proposed to explain the improvement, where we show that the low-frequency magnetic noise is perfectly reduced. This scheme could be applied in general measurement schemes and extended to other quantum control systems.
ArCovidVac: Analyzing Arabic Tweets About COVID-19 Vaccination

The emergence of the COVID-19 pandemic and the first global infodemic have changed our lives in many different ways. We relied on social media to get the latest information about COVID-19 pandemic and at the same time to disseminate information. The content in social media consisted not only health related advice, plans, and informative news from policymakers, but also contains conspiracies and rumors. It became important to identify such information as soon as they are posted to make an actionable decision (e.g., debunking rumors, or taking certain measures for traveling). To address this challenge, we develop and publicly release the first largest manually annotated Arabic tweet dataset, ArCovidVac, for COVID-19 vaccination campaign, covering many countries in the Arab region. The dataset is enriched with different layers of annotation, including, (i) Informativeness more vs. less importance of the tweets); (ii) fine-grained tweet content types (e.g., advice, rumors, restriction, authenticate news/information); and (iii) stance towards vaccination (pro-vaccination, neutral, anti-vaccination). Further, we performed in-depth analysis of the data, exploring the popularity of different vaccines, trending hashtags, topics, and presence of offensiveness in the tweets. We studied the data for individual types of tweets and temporal changes in stance towards vaccine. We benchmarked the ArCovidVac dataset using transformer architectures for informativeness, content types, and stance detection.
Evaluating Inexact Unlearning Requires Revisiting Forgetting

Existing works in inexact machine unlearning focus on achieving indistinguishability from models retrained after removing the deletion set. We argue that indistinguishability is unnecessary, infeasible to measure, and its practical relaxations can be insufﬁcient. We redeﬁne the goal of unlearning as forgetting all information speciﬁc to the deletion set while maintaining high utility and resource efﬁciency. Motivated by the practical application of removing mis-labelled and biased data from models, we introduce a novel test to measure the degree of forgetting called Interclass Con-fusion (IC). It allows us to analyze two aspects of forgetting: (i) memorization and (ii) property generalization. Despite being a black-box test, IC can investigate whether information from the deletion set was erased until the early layers of the network. We empirically show that two simple unlearning methods, exact-unlearning and catastrophic-forgetting the ﬁnal k layers of a network, scale well to large deletion sets unlike prior unlearning methods. k controls the forgetting-efﬁciency tradeoff at similar utility. Overall, we believe our formulation of unlearning and the IC test will guide the design of better unlearning algorithms.
Discovery of Three Candidate Magnetar-powered Fast X-Ray Transients from Chandra Archival Data

It was proposed that a remnant stable magnetar could be formed in a binary neutron-star merger, leading to a fast X-ray transient (FXT) that can last for thousands of seconds. Recently, Xue et al. suggested that CDF-S XT2 was exactly such a kind of source. If confirmed, such emission can be used to search for electromagnetic counterparts to gravitational wave events from binary neutron-star mergers that have short gamma-ray bursts and the corresponding afterglows seen off-axis and thus too weak to be detected. Here we report the discovery of three new FXTs, XRT 170901, XRT 030511, and XRT 110919, from a preliminary search over Chandra archival data. Similar to CDF-S XT2, these new FXTs had a very fast rise (less than a few tens of seconds) and a plateau of X-ray flux of ∼1.0 × 10−12 erg s−1 cm−2 lasting for 1–2 ks, followed by a steep decay. Their optical/IR counterparts, if present, are very weak, arguing against a stellar flare origin for these FXTs. For XRT 170901, we identified a faint host galaxy with the source at the outskirts, very similar to CDF-S XT2. Therefore, our newly discovered FXTs are also strong candidates for magnetar-powered X-ray transients resulting from binary neutron star mergers.
Emojis as anchors to detect Arabic offensive language and hate speech

Abstract We introduce a generic, language-independent method to collect a large percentage of offensive and hate tweets regardless of their topics or genres. We harness the extralinguistic information embedded in the emojis to collect a large number of offensive tweets. We apply the proposed method on Arabic tweets and compare it with English tweets—analyzing key cultural differences. We observed a constant usage of these emojis to represent offensiveness throughout different timespans on Twitter. We manually annotate and publicly release the largest Arabic dataset for offensive, fine-grained hate speech, vulgar, and violence content. Furthermore, we benchmark the dataset for detecting offensiveness and hate speech using different transformer architectures and perform in-depth linguistic analysis. We evaluate our models on external datasets—a Twitter dataset collected using a completely different method, and a multi-platform dataset containing comments from Twitter, YouTube, and Facebook, for assessing generalization capability. Competitive results on these datasets suggest that the data collected using our method capture universal characteristics of offensive language. Our findings also highlight the common words used in offensive communications, common targets for hate speech, specific patterns in violence tweets, and pinpoint common classification errors that can be attributed to limitations of NLP models. We observe that even state-of-the-art transformer models may fail to take into account culture, background, and context or understand nuances present in real-world data such as sarcasm.
Taking sides: Public Opinion over the Israel-Palestine Conflict in 2021

The Israel-Palestine Conflict, one of the most enduring conflicts in history, dates back to the start of 20th century, with the establishment of the British Mandate in Palestine and has deeply rooted complex issues in politics, demography, religion, and other aspects, making it harder to attain resolve. To understand the conflict in 2021, we devise an observational study to aggregate stance held by English-speaking countries. We collect Twitter data using popular hashtags around and specific to the conflict portraying opinions neutral or partial to the two parties. We use different tools and methods to classify tweets into pro-Palestinian, pro-Israel, or neutral. This paper further describes the implementation of data mining methodologies to obtain insights and reason the stance held by citizens around the conflict.
Skyrmions-based logic gates in one single nanotrack completely reconstructed via chirality barrier

Abstract Logic gates based on magnetic elements are promising candidates for logic-in-memory applications with non-volatile data retention, near-zero leakage and scalability. In such spin-based logic devices, however, the multi-strip structure and fewer functions are obstacles to improving integration and reducing energy consumption. Here we propose a skyrmions-based single-nanotrack logic family including AND, OR, NOT, NAND, NOR, XOR and XNOR that can be implemented and reconstructed by building and switching the Dzyaloshinskii–Moriya interaction (DMI) chirality barrier on a racetrack memory. Besides the pinning effect of the DMI chirality barrier on skyrmions, the annihilation, fusion and shunting of two skyrmions with opposite chirality are also achieved and demonstrated via local reversal of the DMI, which are necessary for the design of an engineer programmable logic nanotrack, transistor and complementary racetrack memory.
Semantic Decoupled Representation Learning for Remote Sensing Image Change Detection

Self-supervised learning (SSL) has recently been introduced to remote sensing (RS) to learn in-domain transferable representations. Here, we propose a semantic decoupled representation learning for RS image change detection (CD). Typically, the object of interest (e.g., building) is relatively small compared to the vast background. Different from existing methods expressing an image into one representation vector that may be dominated by irrelevant land-covers, we disentangle representations of different semantic regions by leveraging the semantic mask. We additionally force the model to distinguish different semantic representations, which benefits the recognition of objects of interest in the downstream CD task. We construct a dataset of bitemporal images with semantic masks in an effort-less manner for pre-training. Experiments on two CD datasets show our model outperforms ImageNet, indomain supervised pre-training, and several recent SSL methods.
Cut Query Algorithms with Star Contraction

We study the complexity of determining the edge connectivity of a simple graph with cut queries. We show that (i) there is a bounded-error randomized algorithm that computes edge connectivity with $O(n)$ cut queries, and (ii) there is a bounded-error quantum algorithm that computes edge connectivity with $\tilde{O}(\sqrt{}$n) cut queries. To prove these results we introduce a new technique, called star contraction, to randomly contract edges of a graph while preserving non-trivial minimum cuts. In star contraction vertices randomly contract an edge incident on a small set of randomly chosen “center” vertices. In contrast to the related 2-out contraction technique of Ghaffari, Nowicki, and Thorup [SODA’20], star contraction only contracts vertex-disjoint star subgraphs, which allows it to be efficiently implemented via cut queries. The $O(n)$ bound from item (i) was not known even for the simpler problem of connectivity, and it improves the $O(n\log^{3}n)$ upper bound by Rubinstein, Schramm, and Weinberg [ITCS’18]. The bound is tight under the reasonable conjecture that the randomized communication complexity of connectivity is $\Omega(n\log n)$, an open question since the seminal work of Babai, Frankl, and Simon [FOCS’86]. The bound also excludes using edge connectivity on simple graphs to prove a superlinear randomized query lower bound for minimizing a symmetric submodular function. The quantum algorithm from item (ii) gives a nearlyquadratic separation with the randomized complexity, and addresses an open question of Lee, Santha, and Zhang [SODA’21]. The algorithm can alternatively be viewed as computing the edge connectivity of a simple graph with $\tilde{O}(\sqrt{}$n) matrix-vector multiplication queries to its adjacency matrix. Finally, we demonstrate the use of star contraction outside of the cut query setting by designing a one-pass semi-streaming algorithm for computing edge connectivity in the complete vertex arrival setting. This contrasts with the edge arrival setting where two passes are required.
A new approach to evaluating legibility: Comparing legibility frameworks using framework-independent robot motion trajectories

Robots that share an environment with humans may communicate their intent using a variety of different channels. Movement is one of these channels and, particularly in manipulation tasks, intent communication via movement is called legibility. It alters a robot's trajectory to make it intent expressive. Here we propose a novel evaluation method that improves the data efficiency of collected experimental data when benchmarking approaches generating such legible behavior. The primary novelty of the proposed method is that it uses trajectories that were generated independently of the framework being tested. This makes evaluation easier, enables N-way comparisons between approaches, and allows easier comparison across papers. We demonstrate the efficiency of the new evaluation method by comparing 10 legibility frameworks in 2 scenarios. The paper, thus, provides readers with (1) a novel approach to investigate and/or benchmark legibility, (2) an overview of existing frameworks, (3) an evaluation of 10 legibility frameworks (from 6 papers), and (4) evidence that viewing angle and trajectory progression matter when users evaluate the legibility of a motion.
Scalable Vega: Optimizing Declarative Visualization Languages

While many visualization specification languages are user-friendly, they tend to have one critical drawback: they are designed for small data on the client-side and, as a result, perform poorly at scale. We propose a system that takes declarative visualization specifications as input and automatically optimizes the resulting visualization execution plans by offloading computational-intensive operations to a separate database management system (DBMS). Our demo will enable users to write their own Vega specifications (or import existing ones), view the optimized plans from our system, and even modify these plans and compare their performance via a dedicated performance dashboard.
Snooker Statistics and Zipf’s Law

Zipf’s law is well known in linguistics: the frequency of a word is inversely proportional to its rank. This is a special case of a more general power law, a common phenomenon in many kinds of real-world statistical data. Here, it is shown that snooker statistics also follow such a mathematical pattern, but with varying parameter values. Two types of rankings (prize money earned and centuries scored), and three different time frames (all-time, decade, and year) are considered. The results indicate that the power law parameter values depend on the type of ranking used, as well as the time frame considered. Furthermore, in some cases, the resulting parameter values vary significantly over time, for which a plausible explanation is provided. Finally, it is shown how individual rankings can be described somewhat more accurately using a log-normal distribution, but that the overall conclusions derived from the power law analysis remain valid.
Temporal Relation Extraction with a Graph-Based Deep Biaffine Attention Model

Temporal information extraction plays a critical role in natural language understanding. Previous systems have incorporated advanced neural language models and have successfully enhanced the accuracy of temporal information extraction tasks. However, these systems have two major shortcomings. First, they fail to make use of the two-sided nature of temporal relations in prediction. Second, they involve non-parallelizable pipelines in inference process that bring little performance gain. To this end, we propose a novel temporal information extraction model based on deep biaffine attention to extract temporal relationships between events in unstructured text efficiently and accurately. Our model is performant because we perform relation extraction tasks directly instead of considering event annotation as a prerequisite of relation extraction. Moreover, our architecture uses Multilayer Perceptrons (MLP) with biaffine attention to predict arcs and relation labels separately, improving relation detecting accuracy by exploiting the two-sided nature of temporal relationships. We experimentally demonstrate that our model achieves state-of-the-art performance in temporal relation extraction.
Theoretically and Computationally Convenient Geometries on Full-Rank Correlation Matrices

In contrast to SPD matrices, few tools exist to perform Riemannian statistics on the open elliptope of full-rank correlation matrices. The quotient-affine metric was recently built as the quotient of the affine-invariant metric by the congruence action of positive diagonal matrices. The space of SPD matrices had always been thought of as a Riemannian homogeneous space. In contrast, we view in this work SPD matrices as a Lie group and the affine-invariant metric as a left-invariant metric. This unexpected new viewpoint allows us to generalize the construction of the quotient-affine metric and to show that the main Riemannian operations can be computed numerically. However, the uniqueness of the Riemannian logarithm or the Fr{\'e}chet mean are not ensured, which is bad for computing on the elliptope. Hence, we define three new families of Riemannian metrics on full-rank correlation matrices which provide Hadamard structures, including two flat. Thus the Riemannian logarithm and the Fr{\'e}chet mean are unique. We also define a nilpotent group structure for which the affine logarithm and the group mean are unique. We provide the main Riemannian/group operations of these four structures in closed form.