OpenRaiser/Intern-Atlas huggingface dataset:
Attract More Miners to Join in Blochchain Construction for Internet of Things
Venue: arXiv cs.CR 2020
Year: 2020

The world-changing blockchain technique provides a novel method to establish a secure, trusted and decentralized system for solving the security and personal privacy problems in Industrial Internet of Things (IIoT) applications. The mining process in blockchain requires miners to solve a proof-of-work puzzle, which requires high computational power. However, the lightweight IIoT devices cannot directly participate in the mining process due to the limitation of power and computational resources. The edge computing service makes it possible for IIoT applications to build a blockchain network, in which IIoT devices purchase computational resources from edge servers and thus can offload their computational tasks. The amount of computational resource purchased by IIoT devices depends on how many profits they can get in the mining process, and will directly affect the security of the blockchain network. In this paper, we investigate the incentive mechanism for the blockchain platform to attract IIoT devices to purchase more computational power from edge servers to participate in the mining process, thereby building a more secure blockchain network. We model the interaction between the blockchain platform and IIoT devices as a two-stage Stackelberg game, where the blockchain platform act as the leader, and IIoT devices act as followers. We analyze the existence and uniqueness of the Stackelberg equilibrium, and propose an efficient algorithm to compute the Stackelberg equilibrium point. Furthermore, we evaluate the performance of our algorithm through extensive simulations, and analyze the strategies of blockchain platform and IIoT devices under different situations.
Broad Area Search and Detection of Surface-to-Air Missile Sites Using Spatial Fusion of Component Object Detections from Deep Neural Networks
Venue: arXiv cs.CV 2020
Year: 2020

Here we demonstrate how Deep Neural Network (DNN) detections of multiple constitutive or component objects that are part of a larger, more complex, and encompassing feature can be spatially fused to improve the search, detection, and retrieval (ranking) of the larger complex feature. First, scores computed from a spatial clustering algorithm are normalized to a reference space so that they are independent of image resolution and DNN input chip size. Then, multi-scale DNN detections from various component objects are fused to improve the detection and retrieval of DNN detections of a larger complex feature. We demonstrate the utility of this approach for broad area search and detection of Surface-to-Air Missile (SAM) sites that have a very low occurrence rate (only 16 sites) over a ~90,000 km^2 study area in SE China. The results demonstrate that spatial fusion of multi-scale component-object DNN detections can reduce the detection error rate of SAM Sites by $>$85% while still maintaining a 100% recall. The novel spatial fusion approach demonstrated here can be easily extended to a wide variety of other challenging object search and detection problems in large-scale remote sensing image datasets.
Microfabricated Neuroaccelerometer: Integrating Sensing and Reservoir Computing in MEMS
Venue: arXiv cs.ET 2020
Year: 2020

This study presents the design, fabrication, and test of a micro accelerometer with intrinsic processing capabilities, that integrates the functions of sensing and computing in the same MEMS. The device consists of an inertial mass electrostatically coupled to an oscillating beam through a gap of 8 μm. The motion of the inertial mass modulates an AC electrostatic field that drives the beam in its non-linear regime. This non-linearity is used to implement machine learning in the mechanical domain, using reservoir computing with delayed feedback to process the acceleration information provided by the inertial mass. The device is microfabricated on a silicon-on-insulator substrate using conventional MEMS processes. Dynamic characterization showed good accelerometer functionalities, with an inertial mass sensitivity on the order of 100 mV/g from 250 to 1300 Hz and a natural frequency of 1.7 kHz. In order to test the device computing capabilities, two different machine learning benchmarks were implemented, with the inputs fed to the device as accelerations. The neuromorphic MEMS accelerometer was able to accurately emulate non-linear autoregressive moving average models and compute the parity of random bit streams. These results were obtained in a test system with a non-trivial transfer function, showing a robustness that is well-suited to anticipated applications.
Multi-Agent Reinforcement Learning for Problems with Combined Individual and Team Reward
Venue: arXiv cs.MA 2020
Year: 2020

Many cooperative multi-agent problems require agents to learn individual tasks while contributing to the collective success of the group. This is a challenging task for current state-of-the-art multi-agent reinforcement algorithms that are designed to either maximize the global reward of the team or the individual local rewards. The problem is exacerbated when either of the rewards is sparse leading to unstable learning. To address this problem, we present Decomposed Multi-Agent Deep Deterministic Policy Gradient (DE-MADDPG): a novel cooperative multi-agent reinforcement learning framework that simultaneously learns to maximize the global and local rewards. We evaluate our solution on the challenging defensive escort team problem and show that our solution achieves a significantly better and more stable performance than the direct adaptation of the MADDPG algorithm.
Joint Optimization of Spectrum and Energy Efficiency Considering the C-V2X Security: A Deep Reinforcement Learning Approach
Venue: arXiv cs.NI 2020
Year: 2020

Cellular vehicle-to-everything (C-V2X) communication, as a part of 5G wireless communication, has been considered one of the most significant techniques for Smart City. Vehicles platooning is an application of Smart City that improves traffic capacity and safety by C-V2X. However, different from vehicles platooning travelling on highways, C-V2X could be more easily eavesdropped and the spectrum resource could be limited when they converge at an intersection. Satisfying the secrecy rate of C-V2X, how to increase the spectrum efficiency (SE) and energy efficiency (EE) in the platooning network is a big challenge. In this paper, to solve this problem, we propose a Security-Aware Approach to Enhancing SE and EE Based on Deep Reinforcement Learning, named SEED. The SEED formulates an objective optimization function considering both SE and EE, and the secrecy rate of C-V2X is treated as a critical constraint of this function. The optimization problem is transformed into the spectrum and transmission power selections of V2V and V2I links using deep Q network (DQN). The heuristic result of SE and EE is obtained by the DQN policy based on rewards. Finally, we simulate the traffic and communication environments using Python. The evaluation results demonstrate that the SEED outperforms the DQN-wopa algorithm and the baseline algorithm by 31.83 % and 68.40 % in efficiency. Source code for the SEED is available at https://github.com/BandaidZ/OptimizationofSEandEEBasedonDRL.
Modeling Cross-view Interaction Consistency for Paired Egocentric Interaction Recognition
Venue: arXiv cs.CV 2020
Year: 2020

With the development of Augmented Reality (AR), egocentric action recognition (EAR) plays important role in accurately understanding demands from the user. However, EAR is designed to help recognize human-machine interaction in single egocentric view, thus difficult to capture interactions between two face-to-face AR users. Paired egocentric interaction recognition (PEIR) is the task to collaboratively recognize the interactions between two persons with the videos in their corresponding views. Unfortunately, existing PEIR methods always directly use linear decision function to fuse the features extracted from two corresponding egocentric videos, which ignore consistency of interaction in paired egocentric videos. The consistency of interactions in paired videos, and features extracted from them are correlated to each other. On top of that, we propose to build the relevance between two views using biliear pooling, which capture the consistency of two views in feature-level. Specifically, each neuron in the feature maps from one view connects to the neurons from another view, which guarantee the compact consistency between two views. Then all possible paired neurons are used for PEIR for the inside consistent information of them. To be efficient, we use compact bilinear pooling with Count Sketch to avoid directly computing outer product in bilinear. Experimental results on dataset PEV shows the superiority of the proposed methods on the task PEIR.
Felix: Flexible Text Editing Through Tagging and Insertion
Venue: arXiv cs.CL 2020
Year: 2020

We present Felix --- a flexible text-editing approach for generation, designed to derive the maximum benefit from the ideas of decoding with bi-directional contexts and self-supervised pre-training. In contrast to conventional sequence-to-sequence (seq2seq) models, Felix is efficient in low-resource settings and fast at inference time, while being capable of modeling flexible input-output transformations. We achieve this by decomposing the text-editing task into two sub-tasks: tagging to decide on the subset of input tokens and their order in the output text and insertion to in-fill the missing tokens in the output not present in the input. The tagging model employs a novel Pointer mechanism, while the insertion model is based on a Masked Language Model. Both of these models are chosen to be non-autoregressive to guarantee faster inference. Felix performs favourably when compared to recent text-editing methods and strong seq2seq baselines when evaluated on four NLG tasks: Sentence Fusion, Machine Translation Automatic Post-Editing, Summarization, and Text Simplification.
Parameterized Algorithms for Red-Blue Weighted Vertex Cover on Trees
Venue: arXiv cs.DS 2020
Year: 2020

\textproc{Weighted Vertex Cover} is a variation of an extensively studied NP-complete problem, \textproc{Vertex Cover}, in which we are given a graph, $G = (V,E,w)$, where function $w:V \rightarrow \mathbb{Q}^{+}$ and a parameter $k$. The objective is to determine if there exists a vertex cover, $S$, such that $\sum_{v \in S}w(v) \leq k$. In our work, we first study the hardness of \textproc{Weighted Vertex Cover} and then examine this problem under parameterization by $l$ and $k$, where $l$ is the number of vertices with fractional weights. Then, we study the \textproc{Red-Blue Weighted Vertex Cover} problem on trees in detail. In this problem, we are given a tree, $T=(V,E,w)$, where function $w:V \rightarrow \mathbb{Q}^{+}$, a function $c:V \rightarrow \{R,B\}$ and two parameters $k$ and $k_R$. We have to determine if there exists a vertex cover, $S$, such that $\sum_{v \in S}w(v) \leq k$ and $\sum_{\substack{v \in S\\ c(v) = R}}w(v) \leq k_R$. We tackle this problem by applying different reduction techniques and meaningful parameterizations. We also study some restrictive versions of this problem.
ShadowTutor: Distributed Partial Distillation for Mobile Video DNN Inference
Venue: arXiv cs.DC 2020
Year: 2020

Following the recent success of deep neural networks (DNN) on video computer vision tasks, performing DNN inferences on videos that originate from mobile devices has gained practical significance. As such, previous approaches developed methods to offload DNN inference computations for images to cloud servers to manage the resource constraints of mobile devices. However, when it comes to video data, communicating information of every frame consumes excessive network bandwidth and renders the entire system susceptible to adverse network conditions such as congestion. Thus, in this work, we seek to exploit the temporal coherence between nearby frames of a video stream to mitigate network pressure. That is, we propose ShadowTutor, a distributed video DNN inference framework that reduces the number of network transmissions through intermittent knowledge distillation to a student model. Moreover, we update only a subset of the student's parameters, which we call partial distillation, to reduce the data size of each network transmission. Specifically, the server runs a large and general teacher model, and the mobile device only runs an extremely small but specialized student model. On sparsely selected key frames, the server partially trains the student model by targeting the teacher's response and sends the updated part to the mobile device. We investigate the effectiveness of ShadowTutor with HD video semantic segmentation. Evaluations show that network data transfer is reduced by 95% on average. Moreover, the throughput of the system is improved by over three times and shows robustness to changes in network bandwidth.
Towards Fine-Grained Billing For Cloud Networking
Venue: arXiv cs.NI 2020
Year: 2020

We revisit multi-tenant network virtualization in data centers, and make the case for tenant-specific virtual switches. In particular, tenant-specific virtual switches allow cloud providers to extend fine-grained billing (known, e.g., from serverless architectures) to the network, accounting not only for IO, but also CPU or energy. We sketch an architecture and present economical motivation and recent technological enablers. We also find that virtual switches today do not offer sufficient multi-tenancy and can introduce artificial performance bottlenecks, e.g., in load balancers. We conclude by discussing additional use cases for tentant-specific switches.
Generating Chinese Poetry from Images via Concrete and Abstract Information
Venue: arXiv cs.CL 2020
Year: 2020

In recent years, the automatic generation of classical Chinese poetry has made great progress. Besides focusing on improving the quality of the generated poetry, there is a new topic about generating poetry from an image. However, the existing methods for this topic still have the problem of topic drift and semantic inconsistency, and the image-poem pairs dataset is hard to be built when training these models. In this paper, we extract and integrate the Concrete and Abstract information from images to address those issues. We proposed an infilling-based Chinese poetry generation model which can infill the Concrete keywords into each line of poems in an explicit way, and an abstract information embedding to integrate the Abstract information into generated poems. In addition, we use non-parallel data during training and construct separate image datasets and poem datasets to train the different components in our framework. Both automatic and human evaluation results show that our approach can generate poems which have better consistency with images without losing the quality.
A Comprehensive Analysis of Correlated Source Compression Using Edge Computing in Distributed Systems
Venue: arXiv cs.IT 2020
Year: 2020

This paper examines the theory pertaining to lossless compression of correlated sources located at the edge of a network. Importantly, communication between nodes is prohibited. In particular, a method that combines correlated source coding and matrix partitioning is explained. This technique is then made more flexible, by restricting the method to operate on two distinct groups of nodes. As a result, this new method allows for more freedom in compression performance, with consequent trade-off in node integrity validation. Specifically, it provides 2-3 times the compression savings when using a Hamming(7,4) with 4 nodes. It also decreases the complexity with regard to managing the nodes as they join/leave the network, while retaining the range within which the information can be losslessly decoded.
Dataset Cleaning -- A Cross Validation Methodology for Large Facial Datasets using Face Recognition
Venue: arXiv cs.CV 2020
Year: 2020

In recent years, large "in the wild" face datasets have been released in an attempt to facilitate progress in tasks such as face detection, face recognition, and other tasks. Most of these datasets are acquired from webpages with automatic procedures. As a consequence, noisy data are often found. Furthermore, in these large face datasets, the annotation of identities is important as they are used for training face recognition algorithms. But due to the automatic way of gathering these datasets and due to their large size, many identities folder contain mislabeled samples which deteriorates the quality of the datasets. In this work, it is presented a semi-automatic method for cleaning the noisy large face datasets with the use of face recognition. This methodology is applied to clean the CelebA dataset and show its effectiveness. Furthermore, the list with the mislabelled samples in the CelebA dataset is made available.
Cross-Lingual Adaptation Using Universal Dependencies
Venue: arXiv cs.CL 2020
Year: 2020

We describe a cross-lingual adaptation method based on syntactic parse trees obtained from the Universal Dependencies (UD), which are consistent across languages, to develop classifiers in low-resource languages. The idea of UD parsing is to capture similarities as well as idiosyncrasies among typologically different languages. In this paper, we show that models trained using UD parse trees for complex NLP tasks can characterize very different languages. We study two tasks of paraphrase identification and semantic relation extraction as case studies. Based on UD parse trees, we develop several models using tree kernels and show that these models trained on the English dataset can correctly classify data of other languages e.g. French, Farsi, and Arabic. The proposed approach opens up avenues for exploiting UD parsing in solving similar cross-lingual tasks, which is very useful for languages that no labeled data is available for them.
Prob2Vec: Mathematical Semantic Embedding for Problem Retrieval in Adaptive Tutoring
Venue: arXiv cs.CY 2020
Year: 2020

We propose a new application of embedding techniques for problem retrieval in adaptive tutoring. The objective is to retrieve problems whose mathematical concepts are similar. There are two challenges: First, like sentences, problems helpful to tutoring are never exactly the same in terms of the underlying concepts. Instead, good problems mix concepts in innovative ways, while still displaying continuity in their relationships. Second, it is difficult for humans to determine a similarity score that is consistent across a large enough training set. We propose a hierarchical problem embedding algorithm, called Prob2Vec, that consists of abstraction and embedding steps. Prob2Vec achieves 96.88\% accuracy on a problem similarity test, in contrast to 75\% from directly applying state-of-the-art sentence embedding methods. It is interesting that Prob2Vec is able to distinguish very fine-grained differences among problems, an ability humans need time and effort to acquire. In addition, the sub-problem of concept labeling with imbalanced training data set is interesting in its own right. It is a multi-label problem suffering from dimensionality explosion, which we propose ways to ameliorate. We propose the novel negative pre-training algorithm that dramatically reduces false negative and positive ratios for classification, using an imbalanced training data set.
Re-Training StyleGAN -- A First Step Towards Building Large, Scalable Synthetic Facial Datasets
Venue: arXiv cs.NE 2020
Year: 2020

StyleGAN is a state-of-art generative adversarial network architecture that generates random 2D high-quality synthetic facial data samples. In this paper, we recap the StyleGAN architecture and training methodology and present our experiences of retraining it on a number of alternative public datasets. Practical issues and challenges arising from the retraining process are discussed. Tests and validation results are presented and a comparative analysis of several different re-trained StyleGAN weightings is provided 1. The role of this tool in building large, scalable datasets of synthetic facial data is also discussed.
Model-based Asynchronous Hyperparameter and Neural Architecture Search
Venue: arXiv cs.LG 2020
Year: 2020

We introduce a model-based asynchronous multi-fidelity method for hyperparameter and neural architecture search that combines the strengths of asynchronous Hyperband and Gaussian process-based Bayesian optimization. At the heart of our method is a probabilistic model that can simultaneously reason across hyperparameters and resource levels, and supports decision-making in the presence of pending evaluations. We demonstrate the effectiveness of our method on a wide range of challenging benchmarks, for tabular data, image classification and language modelling, and report substantial speed-ups over current state-of-the-art methods. Our new methods, along with asynchronous baselines, are implemented in a distributed framework which will be open sourced along with this publication.
Distributional Reinforcement Learning with Ensembles
Venue: arXiv cs.LG 2020
Year: 2020

It is well known that ensemble methods often provide enhanced performance in reinforcement learning. In this paper, we explore this concept further by using group-aided training within the distributional reinforcement learning paradigm. Specifically, we propose an extension to categorical reinforcement learning, where distributional learning targets are implicitly based on the total information gathered by an ensemble. We empirically show that this may lead to much more robust initial learning, a stronger individual performance level, and good efficiency on a per-sample basis.
The DAO Induction Attack Against the RPL-based Internet of Things
Venue: arXiv cs.CR 2020
Year: 2020

RPL is the emerging routing standard for low power and lossy networks (LLNs). LLN is a key component of the Internet of Things (IoT), hence its security is imperative for the age of IoT. In this work, we present the DAO induction attack, a novel attack against RPL. In this attack, a malicious insider or a compromised node periodically increments its DTSN number. Each such increment can trigger/induce a large number of control message transmissions in the network. We show that this degrades the network performance in terms of end-to-end latency, packet loss ratio, and power consumption. To mitigate, we propose a lightweight solution to detect the DAO induction attack. Our solution imposes nearly no overhead on IoT devices, which is important as these devices are typically constrained in terms of power, memory and processing.
EQL -- an extremely easy to learn knowledge graph query language, achieving highspeed and precise search
Venue: arXiv cs.DB 2020
Year: 2020

EQL, also named as Extremely Simple Query Language, can be widely used in the field of knowledge graph, precise search, strong artificial intelligence, database, smart speaker ,patent search and other fields. EQL adopt the principle of minimalism in design and pursues simplicity and easy to learn so that everyone can master it quickly. EQL language and lambda calculus are interconvertible, that reveals the mathematical nature of EQL language, and lays a solid foundation for rigor and logical integrity of EQL language. The EQL language and a comprehensive knowledge graph system with the world's commonsense can together form the foundation of strong AI in the future, and make up for the current lack of understanding of world's commonsense by current AI system. EQL language can be used not only by humans, but also as a basic language for data query and data exchange between robots.