OpenRaiser/Intern-Atlas huggingface dataset:
Authentication and Handover Challenges and Methods for Drone Swarms
Venue: arXiv cs.CR 2022
Year: 2022

Drones are begin used for various purposes such as border security, surveillance, cargo delivery, visual shows and it is not possible to overcome such intensive tasks with a single drone. In order to expedite performing such tasks, drone swarms are employed. The number of drones in a swarm can be high depending on the assigned duty. The current solution to authenticate a single drone using a 5G new radio (NR) network requires the execution of two steps. The first step covers the authentication between a drone and the 5G core network, and the second step is the authentication between the drone and the drone control station. It is not feasible to authenticate each drone in a swarm with the current solution without causing a significant latency. Authentication keys between a base station (BS) and a user equipment (UE) must be shared with the new BS while performing handover. The drone swarms are heavily mobile and require several handovers from BS to a new BS. Sharing authentication keys for each drone as explained in 5G NR is not scalable for the drone swarms. Also, the drones can be used as a UE or a radio access node on board unmanned aerial vehicle (UxNB). A UxNB may provide service to a drone swarm in a rural area or emergency. The number of handovers may increase and the process of sharing authentication keys between UxNB to new UxNB may be vulnerable to eavesdropping due to the wireless connectivity. In this work, we present a method where the time and the number of the communication for the authentication of a new drone joining the swarm are less than 5G NR. In addition, group-based handover solutions for the scenarios in which the base stations are terrestrial or mobile are proposed to overcome the scalability and latency issues in the 5G NR.
On Protocols for Monotone Feasible Interpolation
Venue: arXiv cs.CC 2022
Year: 2022

Feasible interpolation is a general technique for proving proof complexity lower bounds. The monotone version of the technique converts, in its basic variant, lower bounds for monotone Boolean circuits separating two NP-sets to proof complexity lower bounds. In a generalized version of the technique, dag-like communication protocols are used instead of monotone Boolean circuits. We study three kinds of protocols and compare their strength. Our results establish the following relationships in the sense of polynomial reducibility: Protocols with equality are at least as strong as protocols with inequality and protocols with equality have the same strength as protocols with a conjunction of two inequalities. Exponential lower bounds for protocols with inequality are known. Obtaining lower bounds for protocols with equality would immediately imply lower bounds for resolution with parities (R(LIN)).
IBAC: An Intelligent Dynamic Bandwidth Channel Access Avoiding Outside Warning Range Problem
Venue: arXiv cs.NI 2022
Year: 2022

IEEE 802.11ax uses the concept of primary and secondary channels, leading to the Dynamic Bandwidth Channel Access (DBCA) mechanism. By applying DBCA, a wireless station can select a wider channel bandwidth, such as 40/80/160 MHz, by applying the channel bonding feature. However, during channel bonding, inappropriate bandwidth selection can cause collisions. Therefore, to avoid collisions, a well-developed media access control (MAC) protocol is crucial to effectively utilize the channel bonding mechanism. In this paper, we address a collision scenario, called Outside Warning Range Problem (OWRP), that may occur during DBCA when a wireless station interferes with another wireless station after channel bonding is performed. Therefore, we propose a MAC layer mechanism, Intelligent Bonding Avoiding Collision (IBAC), that adapts the channel bonding level in DBCA in order to avoid the OWRP. We first design a theoretical model based on Markov chains for DBCA while avoiding the OWRP. Based on this model, we design a Thompson sampling based Bayesian approach to select the best possible channel bonding level intelligently. We analyze the performance of the IBAC through simulations where it is observed that, comparing to other competing mechanisms, the proposed approach can enhance the network performance significantly while avoiding the OWRP.
Task Allocation on Networks with Execution Uncertainty
Venue: arXiv cs.GT 2022
Year: 2022

We study a single task allocation problem where each worker connects to some other workers to form a network and the task requester only connects to some of the workers. The goal is to design an allocation mechanism such that each worker is incentivized to invite her neighbours to join the allocation, although they are competing for the task. Moreover, the performance of each worker is uncertain, which is modelled as the quality level of her task execution. The literature has proposed solutions to tackle the uncertainty problem by paying them after verifying their execution. Here, we extend the problem to the network setting. The challenge is that the requester relies on the workers to invite each other to find the best worker, and the performance of each worker is also unknown to the task requester. In this paper, we propose a new mechanism to solve the two challenges at the same time. The mechanism guarantees that inviting more workers and reporting/performing according to her true ability is a dominant strategy for each worker. We believe that the new solution can be widely applied in the digital economy powered by social connections such as crowdsourcing and contests.
A new approach to evaluating legibility: Comparing legibility frameworks using framework-independent robot motion trajectories
Venue: arXiv cs.RO 2022
Year: 2022

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.
Ensemble Transformer for Efficient and Accurate Ranking Tasks: an Application to Question Answering Systems
Venue: arXiv cs.CL 2022
Year: 2022

Large transformer models can highly improve Answer Sentence Selection (AS2) tasks, but their high computational costs prevent their use in many real-world applications. In this paper, we explore the following research question: How can we make the AS2 models more accurate without significantly increasing their model complexity? To address the question, we propose a Multiple Heads Student architecture (named CERBERUS), an efficient neural network designed to distill an ensemble of large transformers into a single smaller model. CERBERUS consists of two components: a stack of transformer layers that is used to encode inputs, and a set of ranking heads; unlike traditional distillation technique, each of them is trained by distilling a different large transformer architecture in a way that preserves the diversity of the ensemble members. The resulting model captures the knowledge of heterogeneous transformer models by using just a few extra parameters. We show the effectiveness of CERBERUS on three English datasets for AS2; our proposed approach outperforms all single-model distillations we consider, rivaling the state-of-the-art large AS2 models that have 2.7x more parameters and run 2.5x slower. Code for our model is available at https://github.com/amazon-research/wqa-cerberus
A Novel Multi-Task Learning Method for Symbolic Music Emotion Recognition
Venue: arXiv cs.SD 2022
Year: 2022

Symbolic Music Emotion Recognition(SMER) is to predict music emotion from symbolic data, such as MIDI and MusicXML. Previous work mainly focused on learning better representation via (mask) language model pre-training but ignored the intrinsic structure of the music, which is extremely important to the emotional expression of music. In this paper, we present a simple multi-task framework for SMER, which incorporates the emotion recognition task with other emotion-related auxiliary tasks derived from the intrinsic structure of the music. The results show that our multi-task framework can be adapted to different models. Moreover, the labels of auxiliary tasks are easy to be obtained, which means our multi-task methods do not require manually annotated labels other than emotion. Conducting on two publicly available datasets (EMOPIA and VGMIDI), the experiments show that our methods perform better in SMER task. Specifically, accuracy has been increased by 4.17 absolute point to 67.58 in EMOPIA dataset, and 1.97 absolute point to 55.85 in VGMIDI dataset. Ablation studies also show the effectiveness of multi-task methods designed in this paper.
Calipers: A Criticality-aware Framework for Modeling Processor Performance
Venue: arXiv cs.PF 2022
Year: 2022

Computer architecture design space is vast and complex. Tools are needed to explore new ideas and gain insights quickly, with low efforts and at a desired accuracy. We propose Calipers, a criticality-based framework to model key abstractions of complex architectures and a program's execution using dynamic event-dependence graphs. By applying graph algorithms, Calipers can track instruction and event dependencies, compute critical paths, and analyze architecture bottlenecks. By manipulating the graph, Calipers enables architects to investigate a wide range of Instruction Set Architecture (ISA) and microarchitecture design choices/"what-if" scenarios during both early- and late-stage design space exploration without recompiling and rerunning the program. Calipers can model in-order and out-of-order microarchitectures, structural hazards, and different types of ISAs, and can evaluate multiple ideas in a single run. Modeling algorithms are described in detail. We apply Calipers to explore and gain insights in complex microarchitectural and ISA ideas for RISC and EDGE processors, at lower effort than cycle-accurate simulators and with comparable accuracy. For example, among a variety of investigations presented in the paper, experiments show that targeting only a fraction of critical loads can help realize most benefits of value prediction.
How are Diverse End-user Human-centric Issues Discussed on GitHub?
Venue: arXiv cs.SE 2022
Year: 2022

Many software systems fail to meet the needs of the diverse end-users in society and are prone to pose problems, such as accessibility and usability issues. Some of these problems (partially) stem from the failure to consider the characteristics, limitations, and abilities of diverse end-users during software development. We refer to this class of problems as human-centric issues. Despite their importance, there is a limited understanding of the types of human-centric issues encountered by developers. In-depth knowledge of these human-centric issues is needed to design software systems that better meet their diverse end-users' needs. This paper aims to provide insights for the software development and research communities on which human-centric issues are a topic of discussion for developers on GitHub. We conducted an empirical study by extracting and manually analysing 1,691 issue comments from 12 diverse projects, ranging from small to large-scale projects, including projects designed for challenged end-users, e.g., visually impaired and dyslexic users. Our analysis shows that eight categories of human-centric issues are discussed by developers. These include Inclusiveness, Privacy & Security, Compatibility, Location & Language, Preference, Satisfaction, Emotional Aspects, and Accessibility. Guided by our findings, we highlight some implications and possible future paths to further understand and incorporate human-centric issues in software development to be able to design software that meets the needs of diverse end users in society.
Cross-Centroid Ripple Pattern for Facial Expression Recognition
Venue: arXiv cs.CV 2022
Year: 2022

In this paper, we propose a new feature descriptor Cross-Centroid Ripple Pattern (CRIP) for facial expression recognition. CRIP encodes the transitional pattern of a facial expression by incorporating cross-centroid relationship between two ripples located at radius r1 and r2 respectively. These ripples are generated by dividing the local neighborhood region into subregions. Thus, CRIP has ability to preserve macro and micro structural variations in an extensive region, which enables it to deal with side views and spontaneous expressions. Furthermore, gradient information between cross centroid ripples provides strenght to captures prominent edge features in active patches: eyes, nose and mouth, that define the disparities between different facial expressions. Cross centroid information also provides robustness to irregular illumination. Moreover, CRIP utilizes the averaging behavior of pixels at subregions that yields robustness to deal with noisy conditions. The performance of proposed descriptor is evaluated on seven comprehensive expression datasets consisting of challenging conditions such as age, pose, ethnicity and illumination variations. The experimental results show that our descriptor consistently achieved better accuracy rate as compared to existing state-of-art approaches.
Multi-Sparse-Domain Collaborative Recommendation via Enhanced Comprehensive Aspect Preference Learning
Venue: arXiv cs.IR 2022
Year: 2022

Cross-domain recommendation (CDR) has been attracting increasing attention of researchers for its ability to alleviate the data sparsity problem in recommender systems. However, the existing single-target or dual-target CDR methods often suffer from two drawbacks, the assumption of at least one rich domain and the heavy dependence on domain-invariant preference, which are impractical in real world where sparsity is ubiquitous and might degrade the user preference learning. To overcome these issues, we propose a Multi-Sparse-Domain Collaborative Recommendation (MSDCR) model for multi-target cross-domain recommendation. Unlike traditional CDR methods, MSDCR treats the multiple relevant domains as all sparse and can simultaneously improve the recommendation performance in each domain. We propose a Multi-Domain Separation Network (MDSN) and a Gated Aspect Preference Enhancement (GAPE) module for MSDCR to enhance a user's domain-specific aspect preferences in a domain by transferring the complementary aspect preferences in other domains, during which the uniqueness of the domain-specific preference can be preserved through the adversarial training offered by MDSN and the complementarity can be adaptively determined by GAPE. Meanwhile, we propose a Multi-Domain Adaptation Network (MDAN) for MSDCR to capture a user's domain-invariant aspect preference. With the integration of the enhanced domain-specific aspect preference and the domain-invariant aspect preference, MSDCR can reach a comprehensive understanding of a user's preference in each sparse domain. At last, the extensive experiments conducted on real datasets demonstrate the remarkable superiority of MSDCR over the state-of-the-art single-domain recommendation models and CDR models.
Computer Simulation-Based Learning: Student Self-Efficacy During COVID-19 Outbreak
Venue: arXiv cs.CY 2022
Year: 2022

Due to the COVID-19 as a pandemic, the government has forced the nationwide shutdown of several activities, including educational activities. It has resulted in gigantic migration of universities with education over the internet serving as the educational platform. Hand-on-based learning becomes a new challenge. This paper aims to investigate the effect of computer simulation-based learning on student self-efficacy in an electric circuit analysis course. For the 17 participants included in this study, the students have overcome their existing achievements indicated by a long-term average score. Computer simulation-based learning provides positive results on student self-efficacy. Students also perceived a valuable learning experience.
On the c-differential spectrum of power functions over finite fields
Venue: arXiv cs.IT 2022
Year: 2022

Recently, a new concept called multiplicative differential was introduced by Ellingsen et al. Inspired by this pioneering work, power functions with low c-differential uniformity were constructed. Wang et al. defined the c-differential spectrum of a power function [27]. In this paper, we present some properties of the c-differential spectrum of a power function. Then we apply these properties to investigate the c-differential spectra of some power functions. A new class of APcN function is also obtained.
An Improved Reinforcement Learning Algorithm for Learning to Branch
Venue: arXiv cs.LG 2022
Year: 2022

Most combinatorial optimization problems can be formulated as mixed integer linear programming (MILP), in which branch-and-bound (B\&B) is a general and widely used method. Recently, learning to branch has become a hot research topic in the intersection of machine learning and combinatorial optimization. In this paper, we propose a novel reinforcement learning-based B\&B algorithm. Similar to offline reinforcement learning, we initially train on the demonstration data to accelerate learning massively. With the improvement of the training effect, the agent starts to interact with the environment with its learned policy gradually. It is critical to improve the performance of the algorithm by determining the mixing ratio between demonstration and self-generated data. Thus, we propose a prioritized storage mechanism to control this ratio automatically. In order to improve the robustness of the training process, a superior network is additionally introduced based on Double DQN, which always serves as a Q-network with competitive performance. We evaluate the performance of the proposed algorithm over three public research benchmarks and compare it against strong baselines, including three classical heuristics and one state-of-the-art imitation learning-based branching algorithm. The results show that the proposed algorithm achieves the best performance among compared algorithms and possesses the potential to improve B\&B algorithm performance continuously.
Generalizable Neuro-symbolic Systems for Commonsense Question Answering
Venue: arXiv cs.CL 2022
Year: 2022

This chapter illustrates how suitable neuro-symbolic models for language understanding can enable domain generalizability and robustness in downstream tasks. Different methods for integrating neural language models and knowledge graphs are discussed. The situations in which this combination is most appropriate are characterized, including quantitative evaluation and qualitative error analysis on a variety of commonsense question answering benchmark datasets.
On Multiple-Antenna Techniques for Physical-Layer Range Security in the Terahertz Band
Venue: arXiv cs.IT 2022
Year: 2022

Terahertz (THz) communications have naturally promising physical layer security (PLS) performance in the angular domain due to the high directivity feature brought by the ultra-massive multiple-antenna techniques. However, traditional multiple-antenna techniques fail to combat eavesdroppers residing in the THz beam sector, even when the communication distances of legitimate users and eavesdroppers are different. This THz range security challenge motivates us to study new multiple-antenna techniques to provide THz range and angular security. In this paper, we first conduct a theoretical analysis of the secrecy capacity of the multiple antenna channel under the range security scenario. Based on this, the frequency diverse array, as a candidate multiple-antenna technique, is proven ineffective in addressing the range security problem. Then, motivated by the theoretical analysis, a novel widely-spaced array and beamforming design for THz range security are proposed, which realize communications in the near-field regions. A non-constrained optimum approaching (NCOA) algorithm is developed to achieve the optimal secrecy rate. Simulation results illustrate that under the range security scenario where the eavesdropper is inside the beam sector, our proposed widely-spaced antenna communication scheme can ensure a 6 bps/Hz secrecy rate when the transmit power is 10 dBm and the propagation distance is 10 m.
Detecting danger in gridworlds using Gromov's Link Condition
Venue: arXiv cs.AI 2022
Year: 2022

Gridworlds have been long-utilised in AI research, particularly in reinforcement learning, as they provide simple yet scalable models for many real-world applications such as robot navigation, emergent behaviour, and operations research. We initiate a study of gridworlds using the mathematical framework of reconfigurable systems and state complexes due to Abrams, Ghrist & Peterson. State complexes represent all possible configurations of a system as a single geometric space, thus making them conducive to study using geometric, topological, or combinatorial methods. The main contribution of this work is a modification to the original Abrams, Ghrist & Peterson setup which we introduce to capture agent braiding and thereby more naturally represent the topology of gridworlds. With this modification, the state complexes may exhibit geometric defects (failure of Gromov's Link Condition). Serendipitously, we discover these failures occur exactly where undesirable or dangerous states appear in the gridworld. Our results therefore provide a novel method for seeking guaranteed safety limitations in discrete task environments with single or multiple agents, and offer useful safety information (in geometric and topological forms) for incorporation in or analysis of machine learning systems. More broadly, our work introduces tools from geometric group theory and combinatorics to the AI community and demonstrates a proof-of-concept for this geometric viewpoint of the task domain through the example of simple gridworld environments.
MuLVE, A Multi-Language Vocabulary Evaluation Data Set
Venue: arXiv cs.CL 2022
Year: 2022

Vocabulary learning is vital to foreign language learning. Correct and adequate feedback is essential to successful and satisfying vocabulary training. However, many vocabulary and language evaluation systems perform on simple rules and do not account for real-life user learning data. This work introduces Multi-Language Vocabulary Evaluation Data Set (MuLVE), a data set consisting of vocabulary cards and real-life user answers, labeled indicating whether the user answer is correct or incorrect. The data source is user learning data from the Phase6 vocabulary trainer. The data set contains vocabulary questions in German and English, Spanish, and French as target language and is available in four different variations regarding pre-processing and deduplication. We experiment to fine-tune pre-trained BERT language models on the downstream task of vocabulary evaluation with the proposed MuLVE data set. The results provide outstanding results of > 95.5 accuracy and F2-score. The data set is available on the European Language Grid.