OpenRaiser/Intern-Atlas huggingface dataset:
A Template and Suggestions for Writing Easy-to-Read Research Articles
Venue: arXiv cs.GL 2019
Year: 2019

The number of research papers written has been growing at least linearly -- if not exponentially -- in recent years. In proportion, the amount of time a reader allocates per paper has been decreasing. While an accessible paper will be appreciated by a large audience, hard-to-read papers may remain obscure for a long time regardless of scientific merit. Unfortunately, there is still insufficient emphasis on good written and oral communication skills in technical disciplines, especially in engineering. As an academic, I have realised over the years that I keep telling my students the same things over and over again when they write papers, reports, presentations, and theses. This article contains some of those suggestions and serves as a limited template for organising research articles. I have adopted a very practical and personal approach and don't claim that this is a formal contribution to the scientific communication literature. However, I hope that this article will not only make my life a bit easier but also help other graduate students and academic supervisors.
AirFace: Lightweight and Efficient Model for Face Recognition
Venue: arXiv cs.CV 2019
Year: 2019

With the development of convolutional neural network, significant progress has been made in computer vision tasks. However, the commonly used loss function softmax loss and highly efficient network architecture for common visual tasks are not as effective for face recognition. In this paper, we propose a novel loss function named Li-ArcFace based on ArcFace. Li-ArcFace takes the value of the angle through linear function as the target logit rather than through cosine function, which has better convergence and performance on low dimensional embedding feature learning for face recognition. In terms of network architecture, we improved the the perfomance of MobileFaceNet by increasing the network depth, width and adding attention module. Besides, we found some useful training tricks for face recognition. With all the above results, we won the second place in the deepglint-light challenge of LFR2019.
Hidden Covariate Shift: A Minimal Assumption For Domain Adaptation
Venue: arXiv cs.LG 2019
Year: 2019

Unsupervised Domain Adaptation aims to learn a model on a source domain with labeled data in order to perform well on unlabeled data of a target domain. Current approaches focus on learning \textit{Domain Invariant Representations}. It relies on the assumption that such representations are well-suited for learning the supervised task in the target domain. We rather believe that a better and minimal assumption for performing Domain Adaptation is the \textit{Hidden Covariate Shift} hypothesis. Such approach consists in learning a representation of the data such that the label distribution conditioned on this representation is domain invariant. From the Hidden Covariate Shift assumption, we derive an optimization procedure which learns to match an estimated joint distribution on the target domain and a re-weighted joint distribution on the source domain. The re-weighting is done in the representation space and is learned during the optimization procedure. We show on synthetic data and real world data that our approach deals with both \textit{Target Shift} and \textit{Concept Drift}. We report state-of-the-art performances on Amazon Reviews dataset \cite{blitzer2007biographies} demonstrating the viability of this approach.
Meta Learning for Task-Driven Video Summarization
Venue: arXiv cs.CV 2019
Year: 2019

Existing video summarization approaches mainly concentrate on sequential or structural characteristic of video data. However, they do not pay enough attention to the video summarization task itself. In this paper, we propose a meta learning method for performing task-driven video summarization, denoted by MetaL-TDVS, to explicitly explore the video summarization mechanism among summarizing processes on different videos. Particularly, MetaL-TDVS aims to excavate the latent mechanism for summarizing video by reformulating video summarization as a meta learning problem and promote generalization ability of the trained model. MetaL-TDVS regards summarizing each video as a single task to make better use of the experience and knowledge learned from processes of summarizing other videos to summarize new ones. Furthermore, MetaL-TDVS updates models via a two-fold back propagation which forces the model optimized on one video to obtain high accuracy on another video in every training step. Extensive experiments on benchmark datasets demonstrate the superiority and better generalization ability of MetaL-TDVS against several state-of-the-art methods.
ScaleTrotter: Illustrative Visual Travels Across Negative Scales
Venue: arXiv cs.GR 2019
Year: 2019

We present ScaleTrotter, a conceptual framework for an interactive, multi-scale visualization of biological mesoscale data and, specifically, genome data. ScaleTrotter allows viewers to smoothly transition from the nucleus of a cell to the atomistic composition of the DNA, while bridging several orders of magnitude in scale. The challenges in creating an interactive visualization of genome data are fundamentally different in several ways from those in other domains like astronomy that require a multi-scale representation as well. First, genome data has intertwined scale levels---the DNA is an extremely long, connected molecule that manifests itself at all scale levels. Second, elements of the DNA do not disappear as one zooms out---instead the scale levels at which they are observed group these elements differently. Third, we have detailed information and thus geometry for the entire dataset and for all scale levels, posing a challenge for interactive visual exploration. Finally, the conceptual scale levels for genome data are close in scale space, requiring us to find ways to visually embed a smaller scale into a coarser one. We address these challenges by creating a new multi-scale visualization concept. We use a scale-dependent camera model that controls the visual embedding of the scales into their respective parents, the rendering of a subset of the scale hierarchy, and the location, size, and scope of the view. In traversing the scales, ScaleTrotter is roaming between 2D and 3D visual representations that are depicted in integrated visuals. We discuss, specifically, how this form of multi-scale visualization follows from the specific characteristics of the genome data and describe its implementation. Finally, we discuss the implications of our work to the general illustrative depiction of multi-scale data.
Performance Evaluation of the LoRa Protocol in the context of Smart Meter
Venue: arXiv cs.NI 2019
Year: 2019

In recent years, the use of Low Power Wide Area Network (LPWAN) is increasing for the Internet of Things (IoT) applications. In order to demonstrate the application of LPWAN technologies for a realistic smart metering scenario, we set-up and implement a widely used LPWAN protocol which is called LoRaWAN. In this study, the LoRaWAN is implemented by using Multitech devices (end-node and gateway) and the performance of the network is evaluated for different physical (e.g. location, distance etc.) and link parameters (e.g. data rate, transmission power etc.), under the European regulations. To evaluate the performance of the networks, we collected uplink packets in different indoor and outdoor scenarios at various locations. Our results show that LoRaWAN is easy to setup, configurable, scalable, and it performs well for real-time smart metering applications. Moreover, it is necessary to evaluate the physical conditions for the selection of the available system parameters for deploying a robust LoRaWAN network.
A View on Edge caching Applications
Venue: arXiv cs.NI 2019
Year: 2019

Devices with the ability to connect to the internet are growing in numbers day by day thus creating the need for a new way of manag-ing the way the produced traffic travels through data networks. Smart Cities, Vehicular Content Networks, Healthcare and Virtual Reality Videos are a few examples that require high volume data while maintaining low latency. Edge caching practices are a prom-ising solution in such cases in order meet the requirements of low latency in high volume traffic. This paper is a survey on four indic-ative areas, Smart Cities, Vehicular Content Networks, Healthcare and Virtual Reality Videos that make use of edge caching.
Precomputing Datalog evaluation plans in large-scale scenarios
Venue: arXiv cs.AI 2019
Year: 2019

With the more and more growing demand for semantic Web services over large databases, an efficient evaluation of Datalog queries is arousing a renewed interest among researchers and industry experts. In this scenario, to reduce memory consumption and possibly optimize execution times, the paper proposes novel techniques to determine an optimal indexing schema for the underlying database together with suitable body-orderings for the Datalog rules. The new approach is compared with the standard execution plans implemented in DLV over widely used ontological benchmarks. The results confirm that the memory usage can be significantly reduced without paying any cost in efficiency. This paper is under consideration in Theory and Practice of Logic Programming (TPLP).
A Pub/Sub SDN-Integrated Framework for IoT Traffic Orchestration
Venue: arXiv cs.NI 2019
Year: 2019

The Internet of Things (IoT) is advancing and the adoption of internet-connected devices in everyday use is constantly growing. This increase not only affects the traffic from other sources in the network, but also the communication quality requirements, like Quality of Service (QoS), for the IoT devices and applications. With the rise of dynamic network management and dynamic network programming technologies like Software-Defined Networking (SDN), traffic management and communication quality requirements can be tailored to fit niche use cases and characteristics. We propose a publish/subscribe QoS-aware framework (PSIoT-SDN) that orchestrates IoT traffic and mediates the allocation of network resources between IoT data aggregators and pub/sub consumers. The PSIoT framework allows edge-level QoS control using the features of publish/ subscribe orchestrator at IoT aggregators and, in addition, allows network-level QoS control by incorporating SDN features coupled with a bandwidth allocation model for networkwide IoT traffic management. The integration of the framework with SDN allows it to dynamically react to bandwidth sharing enabled by the SDN controller, resulting in better bandwidth distribution and higher link utilization for IoT traffic.
Exploring Perceptions of Veganism
Venue: arXiv cs.CY 2019
Year: 2019

This project examined perceptions of the vegan lifestyle using surveys and social media to explore barriers to choosing veganism. A survey of 510 individuals indicated that non-vegans did not believe veganism was as healthy or difficult as vegans. In a second analysis, Instagram posts using #vegan suggest content is aimed primarily at the female vegan community. Finally, sentiment analysis of roughly 5 million Twitter posts mentioning 'vegan' found veganism to be portrayed in a more positive light compared to other topics. Results suggest non-vegans' lack of interest in veganism is driven by non-belief in the health benefits of the diet.
Artistic Domain Generalisation Methods are Limited by their Deep Representations
Venue: arXiv cs.CV 2019
Year: 2019

The cross-depiction problem refers to the task of recognising visual objects regardless of their depictions; whether photographed, painted, sketched, {\em etc}. In the past, some researchers considered cross-depiction to be domain adaptation (DA). More recent work considers cross-depiction as domain generalisation (DG), in which algorithms extend recognition from one set of domains (such as photographs and coloured artwork) to another (such as sketches). We show that fixing the last layer of AlexNet to random values provides a performance comparable to state of the art DA and DG algorithms, when tested over the PACS benchmark. With support from background literature, our results lead us to conclude that texture alone is insufficient to support generalisation; rather, higher-order representations such as structure and shape are necessary.
No More Chasing Waterfalls: A Measurement Study of the Header Bidding Ad-Ecosystem
Venue: arXiv cs.CY 2019
Year: 2019

In recent years, Header Bidding (HB) has gained popularity among web publishers, challenging the status quo in the ad ecosystem. Contrary to the traditional waterfall standard, HB aims to give back to publishers control of their ad inventory, increase transparency, fairness and competition among advertisers, resulting in higher ad-slot prices. Although promising, little is known about how this ad protocol works: What are HB's possible implementations, who are the major players, and what is its network and UX overhead? To address these questions, we design and implement HBDetector: a novel methodology to detect HB auctions on a website at real time. By crawling 35,000 top Alexa websites, we collect and analyze a dataset of 800k auctions. We find that: (i) 14.28% of top websites utilize HB. (ii) Publishers prefer to collaborate with a few Demand Partners who also dominate the waterfall market. (iii) HB latency can be significantly higher (up to 3x in median case) than waterfall.
A new and consistent well model for one-phase flow in anisotropic porous media using a distributed source model
Venue: arXiv cs.CE 2019
Year: 2019

A new well model for one-phase flow in anisotropic porous media is introduced, where the mass exchange between well and a porous medium is modeled by spatially distributed source terms over a small neighborhood region. To this end, we first present a compact derivation of the exact analytical solution for an arbitrarily oriented, infinite well cylinder in an infinite porous medium with anisotropic permeability tensor in R3 , for constant well pressure and a given injection rate, using a conformal map. The analytical solution motivates the choice of a kernel function to distribute the sources. The presented model is independent from the discretization method and the choice of computational grids. In numerical experiments, the new well model is shown to be consistent and robust with respect to rotation of the well axis, rotation of the permeability tensor, and different anisotropy ratios. Finally, a comparison with a Peaceman-type well model suggests that the new scheme leads to an increased accuracy for injection (and production) rates for arbitrarily-oriented pressure-controlled wells.
Towards Dynamic Simulation Guided Optimal Design of Tumbling Microrobots
Venue: arXiv cs.RO 2019
Year: 2019

Design of robots at the small scale is a trial-and-error based process, which is costly and time-consuming. There are no good dynamic simulation tools to predict the motion or performance of a microrobot as it moves against a substrate. At smaller length scales, the influence of adhesion and friction, which scales with surface area, becomes more pronounced. Thus, rigid body dynamic simulators, which implicitly assume that contact between two bodies can be modeled as point contact are not suitable. In this paper, we present techniques for simulating the motion of microrobots where there can be intermittent and non-point contact between the robot and the substrate. We use this simulator to study the motion of microrobots of different shapes and select shapes that are most promising for performing a given task.
Influence Flowers of Academic Entities
Venue: arXiv cs.HC 2019
Year: 2019

We present the Influence Flower, a new visual metaphor for the influence profile of academic entities, including people, projects, institutions, conferences, and journals. While many tools quantify influence, we aim to expose the flow of influence between entities. The Influence Flower is an ego-centric graph, with a query entity placed in the centre. The petals are styled to reflect the strength of influence to and from other entities of the same or different type. For example, one can break down the incoming and outgoing influences of a research lab by research topics. The Influence Flower uses a recent snapshot of Microsoft Academic Graph, consisting of 212million authors, their 176 million publications, and 1.2 billion citations. An interactive web app, Influence Map, is constructed around this central metaphor for searching and curating visualisations. We also propose a visual comparison method that highlights change in influence patterns over time. We demonstrate through several case studies that the Influence Flower supports data-driven inquiries about the following: researchers' careers over time; paper(s) and projects, including those with delayed recognition; the interdisciplinary profile of a research institution; and the shifting topical trends in conferences. We also use this tool on influence data beyond academic citations, by contrasting the academic and Twitter activities of a researcher.
English-Czech Systems in WMT19: Document-Level Transformer
Venue: arXiv cs.CL 2019
Year: 2019

We describe our NMT systems submitted to the WMT19 shared task in English-Czech news translation. Our systems are based on the Transformer model implemented in either Tensor2Tensor (T2T) or Marian framework. We aimed at improving the adequacy and coherence of translated documents by enlarging the context of the source and target. Instead of translating each sentence independently, we split the document into possibly overlapping multi-sentence segments. In case of the T2T implementation, this "document-level"-trained system achieves a $+0.6$ BLEU improvement ($p<0.05$) relative to the same system applied on isolated sentences. To assess the potential effect document-level models might have on lexical coherence, we performed a semi-automatic analysis, which revealed only a few sentences improved in this aspect. Thus, we cannot draw any conclusions from this weak evidence.
Multi-Kernel Capsule Network for Schizophrenia Identification
Venue: arXiv cs.LG 2019
Year: 2019

Objective: Schizophrenia seriously affects the quality of life. To date, both simple (linear discriminant analysis) and complex (deep neural network) machine learning methods have been utilized to identify schizophrenia based on functional connectivity features. The existing simple methods need two separate steps (i.e., feature extraction and classification) to achieve the identification, which disables simultaneous tuning for the best feature extraction and classifier training. The complex methods integrate two steps and can be simultaneously tuned to achieve optimal performance, but these methods require a much larger amount of data for model training. Methods: To overcome the aforementioned drawbacks, we proposed a multi-kernel capsule network (MKCapsnet), which was developed by considering the brain anatomical structure. Kernels were set to match with partition sizes of brain anatomical structure in order to capture interregional connectivities at the varying scales. With the inspiration of widely-used dropout strategy in deep learning, we developed vector dropout in the capsule layer to prevent overfitting of the model. Results: The comparison results showed that the proposed method outperformed the state-of-the-art methods. Besides, we compared performances using different parameters and illustrated the routing process to reveal characteristics of the proposed method. Conclusion: MKCapsnet is promising for schizophrenia identification. Significance: Our study not only proposed a multi-kernel capsule network but also provided useful information in the parameter setting, which is informative for further studies using a capsule network for neurophysiological signal classification.
Intelligent Reflecting Surface Assisted Secrecy Communication: Is Artificial Noise Helpful or Not?
Venue: arXiv cs.IT 2019
Year: 2019

In this letter, we investigate whether the use of artificial noise (AN) is helpful to enhance the secrecy rate of an intelligent reflecting surface (IRS) assisted wireless communication system. Specifically, an IRS is deployed nearby a single-antenna receiver to assist in the transmission from a multi-antenna transmitter, in the presence of multiple single-antenna eavesdroppers. Aiming to maximize the achievable secrecy rate, a design problem for jointly optimizing transmit beamforming with AN or jamming and IRS reflect beamforming is formulated, which is however difficult to solve due to its non-convexity and coupled variables. We thus propose an efficient algorithm based on alternating optimization to solve the problem sub-optimally. Simulation results show that incorporating AN in transmit beamforming is beneficial under the new setup with IRS reflect beamforming. In particular, it is unveiled that the IRS-aided design without AN even performs worse than the AN-aided design without IRS as the number of eavesdroppers near the IRS increases.
LEAF-QA: Locate, Encode & Attend for Figure Question Answering
Venue: arXiv cs.CV 2019
Year: 2019

We introduce LEAF-QA, a comprehensive dataset of $250,000$ densely annotated figures/charts, constructed from real-world open data sources, along with ~2 million question-answer (QA) pairs querying the structure and semantics of these charts. LEAF-QA highlights the problem of multimodal QA, which is notably different from conventional visual QA (VQA), and has recently gained interest in the community. Furthermore, LEAF-QA is significantly more complex than previous attempts at chart QA, viz. FigureQA and DVQA, which present only limited variations in chart data. LEAF-QA being constructed from real-world sources, requires a novel architecture to enable question answering. To this end, LEAF-Net, a deep architecture involving chart element localization, question and answer encoding in terms of chart elements, and an attention network is proposed. Different experiments are conducted to demonstrate the challenges of QA on LEAF-QA. The proposed architecture, LEAF-Net also considerably advances the current state-of-the-art on FigureQA and DVQA.
Deep Retrieval-Based Dialogue Systems: A Short Review
Venue: arXiv cs.CL 2019
Year: 2019

Building dialogue systems that naturally converse with humans is being an attractive and an active research domain. Multiple systems are being designed everyday and several datasets are being available. For this reason, it is being hard to keep an up-to-date state-of-the-art. In this work, we present the latest and most relevant retrieval-based dialogue systems and the available datasets used to build and evaluate them. We discuss their limitations and provide insights and guidelines for future work.
Zero-shot transfer for implicit discourse relation classification
Venue: arXiv cs.CL 2019
Year: 2019

Automatically classifying the relation between sentences in a discourse is a challenging task, in particular when there is no overt expression of the relation. It becomes even more challenging by the fact that annotated training data exists only for a small number of languages, such as English and Chinese. We present a new system using zero-shot transfer learning for implicit discourse relation classification, where the only resource used for the target language is unannotated parallel text. This system is evaluated on the discourse-annotated TED-MDB parallel corpus, where it obtains good results for all seven languages using only English training data.