OpenRaiser/Intern-Atlas huggingface dataset:
Delay-Aware Scheduling over mmWave/Sub-6 Dual Interfaces: A Reinforcement Learning Approach
Venue: arXiv cs.NI 2020
Year: 2020

We consider a transmitter with mmWave/sub6 dual interfaces. Due to the intermittency of mmWave channel, the transmitter must schedule packets wisely across the interfaces to minimize the average delay by observing the system state. We usethe well-known dynamic programming methods and Q-learning to find the optimal scheduling policy and investigate the influenceof observing CSI on the optimal policy under different levels of knowledge of the environment. We find that only when the channel state transition model is not available, the instantaneousCSI can help in reducing system delay
Information-theoretic analysis for transfer learning
Venue: arXiv cs.LG 2020
Year: 2020

Transfer learning, or domain adaptation, is concerned with machine learning problems in which training and testing data come from possibly different distributions (denoted as $μ$ and $μ'$, respectively). In this work, we give an information-theoretic analysis on the generalization error and the excess risk of transfer learning algorithms, following a line of work initiated by Russo and Zhou. Our results suggest, perhaps as expected, that the Kullback-Leibler (KL) divergence $D(mu||mu')$ plays an important role in characterizing the generalization error in the settings of domain adaptation. Specifically, we provide generalization error upper bounds for general transfer learning algorithms and extend the results to a specific empirical risk minimization (ERM) algorithm where data from both distributions are available in the training phase. We further apply the method to iterative, noisy gradient descent algorithms, and obtain upper bounds which can be easily calculated, only using parameters from the learning algorithms. A few illustrative examples are provided to demonstrate the usefulness of the results. In particular, our bound is tighter in specific classification problems than the bound derived using Rademacher complexity.
Anomaly Detection in Cloud Components
Venue: arXiv cs.SE 2020
Year: 2020

Cloud platforms, under the hood, consist of a complex inter-connected stack of hardware and software components. Each of these components can fail which may lead to an outage. Our goal is to improve the quality of Cloud services through early detection of such failures by analyzing resource utilization metrics. We tested Gated-Recurrent-Unit-based autoencoder with a likelihood function to detect anomalies in various multi-dimensional time series and achieved high performance.
Corpus of Chinese Dynastic Histories: Gender Analysis over Two Millennia
Venue: arXiv cs.CL 2020
Year: 2020

Chinese dynastic histories form a large continuous linguistic space of approximately 2000 years, from the 3rd century BCE to the 18th century CE. The histories are documented in Classical (Literary) Chinese in a corpus of over 20 million characters, suitable for the computational analysis of historical lexicon and semantic change. However, there is no freely available open-source corpus of these histories, making Classical Chinese low-resource. This project introduces a new open-source corpus of twenty-four dynastic histories covered by Creative Commons license. An original list of Classical Chinese gender-specific terms was developed as a case study for analyzing the historical linguistic use of male and female terms. The study demonstrates considerable stability in the usage of these terms, with dominance of male terms. Exploration of word meanings uses keyword analysis of focus corpora created for genderspecific terms. This method yields meaningful semantic representations that can be used for future studies of diachronic semantics.
A Semantically Enriched Dataset based on Biomedical NER for the COVID19 Open Research Dataset Challenge
Venue: arXiv cs.DL 2020
Year: 2020

Research into COVID-19 is a big challenge and highly relevant at the moment. New tools are required to assist medical experts in their research with relevant and valuable information. The COVID-19 Open Research Dataset Challenge (CORD-19) is a "call to action" for computer scientists to develop these innovative tools. Many of these applications are empowered by entity information, i. e. knowing which entities are used within a sentence. For this paper, we have developed a pipeline upon the latest Named Entity Recognition tools for Chemicals, Diseases, Genes and Species. We apply our pipeline to the COVID-19 research challenge and share the resulting entity mentions with the community.
Designing Just-in-Time Detection for Gamified Fitness Frameworks
Venue: arXiv cs.HC 2020
Year: 2020

This paper presents our findings from a multi-year effort to detect motion events early using inertial sensors in real-world settings. We believe early event detection is the next step in advancing motion tracking, and can enable just-in-time interventions, particularly for mHealth applications. Our system targets strength training workouts in the fitness domain, where users perform well-defined movements for each exercise, while wearing an inertial sensor. We collect data for 20 exercises across 12 users over 26 months. We propose an algorithm to detect repetitions before they end, to allow a user to visualize movement derived metrics in real-time. We further develop a gamified approach to display this information to the user and encourage them to perform consistent movements. Participants in a feasibility study find the gamified feedback useful in improving their form. Our system can detect repetition events as early as 500 ms before it ends, which is 2x faster and more accurate than state-of-the-art trackers. We believe our approach will open exciting avenues for tracking, detection, and gamification for fitness frameworks.
MMFashion: An Open-Source Toolbox for Visual Fashion Analysis
Venue: arXiv cs.CV 2020
Year: 2020

We present MMFashion, a comprehensive, flexible and user-friendly open-source visual fashion analysis toolbox based on PyTorch. This toolbox supports a wide spectrum of fashion analysis tasks, including Fashion Attribute Prediction, Fashion Recognition and Retrieval, Fashion Landmark Detection, Fashion Parsing and Segmentation and Fashion Compatibility and Recommendation. It covers almost all the mainstream tasks in fashion analysis community. MMFashion has several appealing properties. Firstly, MMFashion follows the principle of modular design. The framework is decomposed into different components so that it is easily extensible for diverse customized modules. In addition, detailed documentations, demo scripts and off-the-shelf models are available, which ease the burden of layman users to leverage the recent advances in deep learning-based fashion analysis. Our proposed MMFashion is currently the most complete platform for visual fashion analysis in deep learning era, with more functionalities to be added. This toolbox and the benchmark could serve the flourishing research community by providing a flexible toolkit to deploy existing models and develop new ideas and approaches. We welcome all contributions to this still-growing efforts towards open science: https://github.com/open-mmlab/mmfashion.
Grammatical gender associations outweigh topical gender bias in crosslinguistic word embeddings
Venue: arXiv cs.CL 2020
Year: 2020

Recent research has demonstrated that vector space models of semantics can reflect undesirable biases in human culture. Our investigation of crosslinguistic word embeddings reveals that topical gender bias interacts with, and is surpassed in magnitude by, the effect of grammatical gender associations, and both may be attenuated by corpus lemmatization. This finding has implications for downstream applications such as machine translation.
Generative Tweening: Long-term Inbetweening of 3D Human Motions
Venue: arXiv cs.CV 2020
Year: 2020

The ability to generate complex and realistic human body animations at scale, while following specific artistic constraints, has been a fundamental goal for the game and animation industry for decades. Popular techniques include key-framing, physics-based simulation, and database methods via motion graphs. Recently, motion generators based on deep learning have been introduced. Although these learning models can automatically generate highly intricate stylized motions of arbitrary length, they still lack user control. To this end, we introduce the problem of long-term inbetweening, which involves automatically synthesizing complex motions over a long time interval given very sparse keyframes by users. We identify a number of challenges related to this problem, including maintaining biomechanical and keyframe constraints, preserving natural motions, and designing the entire motion sequence holistically while considering all constraints. We introduce a biomechanically constrained generative adversarial network that performs long-term inbetweening of human motions, conditioned on keyframe constraints. This network uses a novel two-stage approach where it first predicts local motion in the form of joint angles, and then predicts global motion, i.e. the global path that the character follows. Since there are typically a number of possible motions that could satisfy the given user constraints, we also enable our network to generate a variety of outputs with a scheme that we call Motion DNA. This approach allows the user to manipulate and influence the output content by feeding seed motions (DNA) to the network. Trained with 79 classes of captured motion data, our network performs robustly on a variety of highly complex motion styles.
Halting SARS-CoV-2 by Targeting High-Contact Individuals
Venue: arXiv cs.SI 2020
Year: 2020

Network scientists have proposed that infectious diseases involving person-to-person transmission may be effectively halted by targeting interventions at a minority of highly connected individuals. Can this strategy be effective in combating a virus partly transmitted in close-range contact, as many believe SARS-CoV-2 to be? Effectiveness critically depends on high between-person variability in the number of close-range contacts. We analyze population survey data showing that indeed the distribution of close-range contacts across individuals is characterized by a small fraction of individuals reporting very high frequencies. Strikingly, we find that the average duration of contact is mostly invariant in the number of contacts, reinforcing the criticality of hubs. We simulate a population embedded in a network with empirically observed contact frequencies. Simulations show that targeting hubs robustly improves containment.
Novel Backoff Mechanism for Mitigation of Congestion in DSRC Broadcast
Venue: arXiv cs.NI 2020
Year: 2020

Due to the recent re-allocation of the 5.9 GHz band by the US Federal Communications Commission (FCC), it will be inevitable that dedicated short-range communications (DSRC) and cellular vehicle-to-everything (C-V2X), two representative technologies for V2X, have to address coexistence. Especially, the distributed nature of DSRC makes it not trivial to control congestions due to an asynchronous structure, which makes it inefficient to disseminate a controlling signal. To this end, we propose a method to "lighten" a distributed V2X networking. Technically, it is to allocate the backoff counter according to the level of an accident risk to which a vehicle is temporarily exposed. We provide an analysis framework based on a spatiotemporal analysis. The numerical results show the improvement in the successful delivery of basic safety messages (BSMs).
Reconstructing Maps from Text
Venue: arXiv cs.CL 2020
Year: 2020

Previous research has demonstrated that Distributional Semantic Models (DSMs) are capable of reconstructing maps from news corpora (Louwerse & Zwaan, 2009) and novels (Louwerse & Benesh, 2012). The capacity for reproducing maps is surprising since DSMs notoriously lack perceptual grounding (De Vega et al., 2012). In this paper we investigate the statistical sources required in language to infer maps, and resulting constraints placed on mechanisms of semantic representation. Study 1 brings word co-occurrence under experimental control to demonstrate that direct co-occurrence in language is necessary for traditional DSMs to successfully reproduce maps. Study 2 presents an instance-based DSM that is capable of reconstructing maps independent of the frequency of co-occurrence of city names.
Patch based Colour Transfer using SIFT Flow
Venue: arXiv cs.CV 2020
Year: 2020

We propose a new colour transfer method with Optimal Transport (OT) to transfer the colour of a sourceimage to match the colour of a target image of the same scene that may exhibit large motion changes betweenimages. By definition OT does not take into account any available information about correspondences whencomputing the optimal solution. To tackle this problem we propose to encode overlapping neighborhoodsof pixels using both their colour and spatial correspondences estimated using motion estimation. We solvethe high dimensional problem in 1D space using an iterative projection approach. We further introducesmoothing as part of the iterative algorithms for solving optimal transport namely Iterative DistributionTransport (IDT) and its variant the Sliced Wasserstein Distance (SWD). Experiments show quantitative andqualitative improvements over previous state of the art colour transfer methods.
Large-scale empirical validation of Bayesian Network structure learning algorithms with noisy data
Venue: arXiv cs.LG 2020
Year: 2020

Numerous Bayesian Network (BN) structure learning algorithms have been proposed in the literature over the past few decades. Each publication makes an empirical or theoretical case for the algorithm proposed in that publication and results across studies are often inconsistent in their claims about which algorithm is 'best'. This is partly because there is no agreed evaluation approach to determine their effectiveness. Moreover, each algorithm is based on a set of assumptions, such as complete data and causal sufficiency, and tend to be evaluated with data that conforms to these assumptions, however unrealistic these assumptions may be in the real world. As a result, it is widely accepted that synthetic performance overestimates real performance, although to what degree this may happen remains unknown. This paper investigates the performance of 15 structure learning algorithms. We propose a methodology that applies the algorithms to data that incorporates synthetic noise, in an effort to better understand the performance of structure learning algorithms when applied to real data. Each algorithm is tested over multiple case studies, sample sizes, types of noise, and assessed with multiple evaluation criteria. This work involved approximately 10,000 graphs with a total structure learning runtime of seven months. It provides the first large-scale empirical validation of BN structure learning algorithms under different assumptions of data noise. The results suggest that traditional synthetic performance may overestimate real-world performance by anywhere between 10% and more than 50%. They also show that while score-based learning is generally superior to constraint-based learning, a higher fitting score does not necessarily imply a more accurate causal graph. To facilitate comparisons with future studies, we have made all data, raw results, graphs and BN models freely available online.
Uncovering Spatiotemporal and Semantic Aspects of Tourists Mobility Using Social Sensing
Venue: arXiv cs.SI 2020
Year: 2020

Tourism favors more economic activities, employment, revenues and plays a significant role in development; thus, the improvement of this activity is a strategic task. In this work, we show how social sensing can be used to understand the key characteristics of the behavior of tourists and residents. We observe distinct behavioral patterns in those classes, considering the spatial and temporal dimensions, where cultural and regional aspects might play an important role. Besides, we investigate how tourists move and the factors that influence their movements in London, New York, Rio de Janeiro and Tokyo. In addition, we propose a new approach based on a topic model that enables the automatic identification of mobility pattern themes, ultimately leading to a better understanding of users' profiles. The applicability of our results is broad, helping to provide better applications and services in the tourism segment.
DALock: Distribution Aware Password Throttling
Venue: arXiv cs.CR 2020
Year: 2020

Large-scale online password guessing attacks are wide-spread and continuously qualified as one of the top cyber-security risks. The common method for mitigating the risk of online cracking is to lock out the user after a fixed number ($K$) of consecutive incorrect login attempts. Selecting the value of $K$ induces a classic security-usability trade-off. When $K$ is too large a hacker can (quickly) break into a significant fraction of user accounts, but when $K$ is too low we will start to annoy honest users by locking them out after a few mistakes. Motivated by the observation that honest user mistakes typically look quite different than the password guesses of an online attacker, we introduce DALock a {\em distribution aware} password lockout mechanism to reduce user annoyance while minimizing user risk. As the name suggests, DALock is designed to be aware of the frequency and popularity of the password used for login attacks while standard throttling mechanisms (e.g., $K$-strikes) are oblivious to the password distribution. In particular, DALock maintains an extra "hit count" in addition to "strike count" for each user which is based on (estimates of) the cumulative probability of {\em all} login attempts for that particular account. We empirically evaluate DALock with an extensive battery of simulations using real world password datasets. In comparison with the traditional $K$-strikes mechanism we find that DALock offers a superior security/usability trade-off. For example, in one of our simulations we are able to reduce the success rate of an attacker to $0.05\%$ (compared to $1\%$ for the $10$-strikes mechanism) whilst simultaneously reducing the unwanted lockout rate for accounts that are not under attack to just $0.08\%$ (compared to $4\%$ for the $3$-strikes mechanism).
GROVE: A Cost-Efficient Green Radio over Ethernet Architecture for Next Generation Radio Access Network
Venue: arXiv cs.NI 2020
Year: 2020

Centralized/Cloud Radio Access Network (C-RAN) comes into prominence to reduce the rising energy consumptions and maintenance difficulties of the next-generation networks. However, C-RAN has strict delay requirements, and it needs large fronthaul bandwidth. Function splitting and Radio over Ethernet are two promising approaches to reduce these drawbacks of the C-RAN architecture. Meanwhile, the usage of renewable energy sources (RESs) in a C-RAN boosts the energy-efficiency potential of this network. In this paper, we propose a novel model, which is called Green Radio OVer Ethernet (GROVE), that merges these three approaches to maximize the benefits of C-RAN while maintaining the economic feasibility of this architecture. We briefly explain this model and formulate an operational expenditure minimization problem by considering the several restrictions due to the network design and the service provisioning. Then we linearize the quadratic routing decision constraints in the problem to solve it with a mixed-integer linear programming (MILP) solver. Results show that it is cost-effective to choose routing, function splitting, and RES decisions together. Our solution surpasses classical disjoint approaches for all studied cases. Besides, we provide a network scalability analysis to determine the MILP solver's limits for larger network topologies.
NXNSAttack: Recursive DNS Inefficiencies and Vulnerabilities
Venue: arXiv cs.CR 2020
Year: 2020

This paper exposes a new vulnerability and introduces a corresponding attack, the NoneXistent Name Server Attack (NXNSAttack), that disrupts and may paralyze the DNS system, making it difficult or impossible for Internet users to access websites, web e-mail, online video chats, or any other online resource. The NXNSAttack generates a storm of packets between DNS resolvers and DNS authoritative name servers. The storm is produced by the response of resolvers to unrestricted referral response messages of authoritative name servers. The attack is significantly more destructive than NXDomain attacks (e.g., the Mirai attack): i) It reaches an amplification factor of more than 1620x on the number of packets exchanged by the recursive resolver. ii) In addition to the negative cache, the attack also saturates the 'NS' section of the resolver caches. To mitigate the attack impact, we propose an enhancement to the recursive resolver algorithm, MaxFetch(k), that prevents unnecessary proactive fetches. We implemented the MaxFetch(1) mitigation enhancement on a BIND resolver and tested it on real-world DNS query datasets. Our results show that MaxFetch(1) degrades neither the recursive resolver throughput nor its latency. Following the discovery of the attack, a responsible disclosure procedure was carried out, and several DNS vendors and public providers have issued a CVE and patched their systems.
Out-of-Core GPU Gradient Boosting
Venue: arXiv cs.LG 2020
Year: 2020

GPU-based algorithms have greatly accelerated many machine learning methods; however, GPU memory is typically smaller than main memory, limiting the size of training data. In this paper, we describe an out-of-core GPU gradient boosting algorithm implemented in the XGBoost library. We show that much larger datasets can fit on a given GPU, without degrading model accuracy or training time. To the best of our knowledge, this is the first out-of-core GPU implementation of gradient boosting. Similar approaches can be applied to other machine learning algorithms
A New Validity Index for Fuzzy-Possibilistic C-Means Clustering
Venue: arXiv cs.LG 2020
Year: 2020

In some complicated datasets, due to the presence of noisy data points and outliers, cluster validity indices can give conflicting results in determining the optimal number of clusters. This paper presents a new validity index for fuzzy-possibilistic c-means clustering called Fuzzy-Possibilistic (FP) index, which works well in the presence of clusters that vary in shape and density. Moreover, FPCM like most of the clustering algorithms is susceptible to some initial parameters. In this regard, in addition to the number of clusters, FPCM requires a priori selection of the degree of fuzziness and the degree of typicality. Therefore, we presented an efficient procedure for determining their optimal values. The proposed approach has been evaluated using several synthetic and real-world datasets. Final computational results demonstrate the capabilities and reliability of the proposed approach compared with several well-known fuzzy validity indices in the literature. Furthermore, to clarify the ability of the proposed method in real applications, the proposed method is implemented in microarray gene expression data clustering and medical image segmentation.