OpenRaiser/Intern-Atlas huggingface dataset:
Toward Automated Virtual Assembly for Prefabricated Construction: Construction Sequencing through Simulated BIM
Venue: arXiv cs.AI 2020
Year: 2020

To adhere to the stringent time and budget requirements of construction projects, contractors are utilizing prefabricated construction methods to expedite the construction process. Prefabricated construction methods require an adequate schedule and understanding by the contractors and constructors to be successful. The specificity of prefabricated construction often leads to inefficient scheduling and costly rework time. The designer, contractor, and constructors must have a strong understanding of the assembly process to experience the full benefits of the method. At the root of understanding the assembly process is visualizing how the process is intended to be performed. Currently, a virtual construction model is used to explain and better visualize the construction process. However, creating a virtual construction model is currently time consuming and requires experienced personnel. The proposed simulation of the virtual assembly will increase the automation of virtual construction modeling by implementing the data available in a building information modeling (BIM) model. This paper presents various factors (i.e., formalization of construction sequence based on the level of development (LOD)) that needs to be addressed for the development of automated virtual assembly. Two case studies are presented to demonstrate these factors.
CoCoPIE: Making Mobile AI Sweet As PIE --Compression-Compilation Co-Design Goes a Long Way
Venue: arXiv cs.LG 2020
Year: 2020

Assuming hardware is the major constraint for enabling real-time mobile intelligence, the industry has mainly dedicated their efforts to developing specialized hardware accelerators for machine learning and inference. This article challenges the assumption. By drawing on a recent real-time AI optimization framework CoCoPIE, it maintains that with effective compression-compiler co-design, it is possible to enable real-time artificial intelligence on mainstream end devices without special hardware. CoCoPIE is a software framework that holds numerous records on mobile AI: the first framework that supports all main kinds of DNNs, from CNNs to RNNs, transformer, language models, and so on; the fastest DNN pruning and acceleration framework, up to 180X faster compared with current DNN pruning on other frameworks such as TensorFlow-Lite; making many representative AI applications able to run in real-time on off-the-shelf mobile devices that have been previously regarded possible only with special hardware support; making off-the-shelf mobile devices outperform a number of representative ASIC and FPGA solutions in terms of energy efficiency and/or performance.
Scrutinizer: A Mixed-Initiative Approach to Large-Scale, Data-Driven Claim Verification
Venue: arXiv cs.DB 2020
Year: 2020

Organizations such as the International Energy Agency (IEA) spend significant amounts of time and money to manually fact check text documents summarizing data. The goal of the Scrutinizer system is to reduce verification overheads by supporting human fact checkers in translating text claims into SQL queries on an associated database. Scrutinizer coordinates teams of human fact checkers. It reduces verification time by proposing queries or query fragments to the users. Those proposals are based on claim text classifiers, that gradually improve during the verification of a large document. In addition, Scrutinizer uses tentative execution of query candidates to narrow down the set of alternatives. The verification process is controlled by a cost-based optimizer. It optimizes the interaction with users and prioritizes claim verifications. For the latter, it considers expected verification overheads as well as the expected claim utility as training samples for the classifiers. We evaluate the Scrutinizer system using simulations and a user study, based on actual claims and data and using professional fact checkers employed by IEA. Our experiments consistently demonstrate significant savings in verification time, without reducing result accuracy.
Solving Portfolio Optimization Problems Using MOEA/D and Levy Flight
Venue: arXiv cs.NE 2020
Year: 2020

Portfolio optimization is a financial task which requires the allocation of capital on a set of financial assets to achieve a better trade-off between return and risk. To solve this problem, recent studies applied multi-objective evolutionary algorithms (MOEAs) for its natural bi-objective structure. This paper presents a method injecting a distribution-based mutation method named Lévy Flight into a decomposition based MOEA named MOEA/D. The proposed algorithm is compared with three MOEA/D-like algorithms, NSGA-II, and other distribution-based mutation methods on five portfolio optimization benchmarks sized from 31 to 225 in OR library without constraints, assessing with six metrics. Numerical results and statistical test indicate that this method can outperform comparison methods in most cases. We analyze how Levy Flight contributes to this improvement by promoting global search early in the optimization. We explain this improvement by considering the interaction between mutation method and the property of the problem.
Learning hierarchical relationships for object-goal navigation
Venue: arXiv cs.RO 2020
Year: 2020

Direct search for objects as part of navigation poses a challenge for small items. Utilizing context in the form of object-object relationships enable hierarchical search for targets efficiently. Most of the current approaches tend to directly incorporate sensory input into a reward-based learning approach, without learning about object relationships in the natural environment, and thus generalize poorly across domains. We present Memory-utilized Joint hierarchical Object Learning for Navigation in Indoor Rooms (MJOLNIR), a target-driven navigation algorithm, which considers the inherent relationship between target objects, and the more salient contextual objects occurring in its surrounding. Extensive experiments conducted across multiple environment settings show an $82.9\%$ and $93.5\%$ gain over existing state-of-the-art navigation methods in terms of the success rate (SR), and success weighted by path length (SPL), respectively. We also show that our model learns to converge much faster than other algorithms, without suffering from the well-known overfitting problem. Additional details regarding the supplementary material and code are available at https://sites.google.com/eng.ucsd.edu/mjolnir.
On the Computation and Approximation of Outage Probability in Satellite Networks with Smart Gateway Diversity
Venue: arXiv cs.NI 2020
Year: 2020

The utilization of extremely high frequency (EHF) bands can achieve very high throughput in satellite networks (SatNets). Nevertheless, the severe rain attenuation at EHF bands imposes strict limitations on the system availability. Smart gateway diversity (SGD) is considered indispensable in order to guarantee the required availability with reasonable cost. In this context, we examine a load-sharing SGD (LS-SGD) architecture, which has been recently proposed in the literature. For this diversity scheme, we define the system outage probability (SOP) using a rigorous probabilistic analysis based on the Poisson binomial distribution (PBD), and taking into consideration the traffic demand as well as the gateway (GW) capacity. Furthermore, we provide several methods for the exact and approximate calculation of SOP. As concerns the exact computation of SOP, a closed-form expression and an efficient algorithm based on a recursive formula are given, both with quadratic worst-case complexity in the number of GWs. Finally, the proposed approximation methods include well-known probability distributions (binomial, Poisson, normal) and a Chernoff bound. According to the numerical results, binomial and Poisson distributions are by far the most accurate approximation methods.
StarNet: towards Weakly Supervised Few-Shot Object Detection
Venue: arXiv cs.CV 2020
Year: 2020

Few-shot detection and classification have advanced significantly in recent years. Yet, detection approaches require strong annotation (bounding boxes) both for pre-training and for adaptation to novel classes, and classification approaches rarely provide localization of objects in the scene. In this paper, we introduce StarNet - a few-shot model featuring an end-to-end differentiable non-parametric star-model detection and classification head. Through this head, the backbone is meta-trained using only image-level labels to produce good features for jointly localizing and classifying previously unseen categories of few-shot test tasks using a star-model that geometrically matches between the query and support images (to find corresponding object instances). Being a few-shot detector, StarNet does not require any bounding box annotations, neither during pre-training nor for novel classes adaptation. It can thus be applied to the previously unexplored and challenging task of Weakly Supervised Few-Shot Object Detection (WS-FSOD), where it attains significant improvements over the baselines. In addition, StarNet shows significant gains on few-shot classification benchmarks that are less cropped around the objects (where object localization is key).
Leveraging Foreign Language Labeled Data for Aspect-Based Opinion Mining
Venue: arXiv cs.CL 2020
Year: 2020

Aspect-based opinion mining is the task of identifying sentiment at the aspect level in opinionated text, which consists of two subtasks: aspect category extraction and sentiment polarity classification. While aspect category extraction aims to detect and categorize opinion targets such as product features, sentiment polarity classification assigns a sentiment label, i.e. positive, negative, or neutral, to each identified aspect. Supervised learning methods have been shown to deliver better accuracy for this task but they require labeled data, which is costly to obtain, especially for resource-poor languages like Vietnamese. To address this problem, we present a supervised aspect-based opinion mining method that utilizes labeled data from a foreign language (English in this case), which is translated to Vietnamese by an automated translation tool (Google Translate). Because aspects and opinions in different languages may be expressed by different words, we propose using word embeddings, in addition to other features, to reduce the vocabulary difference between the original and translated texts, thus improving the effectiveness of aspect category extraction and sentiment polarity classification processes. We also introduce an annotated corpus of aspect categories and sentiment polarities extracted from restaurant reviews in Vietnamese, and conduct a series of experiments on the corpus. Experimental results demonstrate the effectiveness of the proposed approach.
ADW: Blockchain-enabled Small-scale Farm Digitization
Venue: arXiv cs.DC 2020
Year: 2020

Farm records hold the static, temporal, and longitudinal details of the farms. For small-scale farming, the ability to accurately capture these records plays a critical role in formalizing and digitizing the agriculture industry. Reliable exchange of these record through a trusted platform could unlock critical and valuable insights to different stakeholders across the value chain in agriculture eco-system. Lately, there has been increasing attention on digitization of small scale farming with the objective of providing farm-level transparency, accountability, visibility, access to farm loans, etc. using these farm records. However, most solutions proposed so far have the shortcoming of providing detailed, reliable and trusted small-scale farm digitization information in real time. To address these challenges, we present a system, called Agribusiness Digital Wallet (ADW), which leverages blockchain to formalize the interactions and enable seamless data flow in small-scale farming ecosystem. Utilizing instrumentation of farm tractors, we demonstrate the ability to utilize farm activities to create trusted electronic field records (EFR) with automated valuable insights. Using ADW, we processed several thousands of small-scale farm-level activity events for which we also performed automated farm boundary detection of a number of farms in different geographies.
Multistage Curvilinear Coordinate Transform Based Document Image Dewarping using a Novel Quality Estimator
Venue: arXiv cs.CV 2020
Year: 2020

The present work demonstrates a fast and improved technique for dewarping nonlinearly warped document images. The images are first dewarped at the page-level by estimating optimum inverse projections using curvilinear homography. The quality of the process is then estimated by evaluating a set of metrics related to the characteristics of the text lines and rectilinear objects for measuring parallelism, orthogonality, etc. These are designed specifically to estimate the quality of the dewarping process without the need of any ground truth. If the quality is estimated to be unsatisfactory, the page-level dewarping process is repeated with finer approximations. This is followed by a line-level dewarping process that makes granular corrections to the warps in individual text-lines. The methodology has been tested on the CBDAR 2007 / IUPR 2011 document image dewarping dataset and is seen to yield the best OCR accuracy in the shortest amount of time, till date. The usefulness of the methodology has also been evaluated on the DocUNet 2018 dataset with some minor tweaks, and is seen to produce comparable results.
Collaborative Spectrum Sensing in Tactical Wireless Networks
Venue: arXiv cs.NI 2020
Year: 2020

In this paper, we propose an algorithm for channel sensing, collaboration, and transmission for networks of Tactical Communication Systems that are facing intrusions from hostile Jammers. Members of the network begin by scanning the spectrum for Jammers, sharing this information with neighboring nodes, and merging their respective sets of observation data into a decision vector containing the believed occupancy of each channel. A user can then use this vector to find a vacant channel for its transmission. We introduce the concept of nodes sharing these vectors with their peers, who then merge them into super-decision vectors, allowing each node to better identify and select transmission channels. We consider fading scenarios that substantially limit the reliability of the users' observations, unless they cooperate to increase the trustworthiness of their sensing data. We propose a pseudo-random channel selection algorithm that strikes a balance between sensing reliability with the number of channels being sensed. Simulation results show that the proposed system improves the network's overall knowledge of the spectrum and the rate of Jammer-free transmissions while limiting added computational complexity to the nodes of the network, despite the Jammers' unpredictable nature.
Adversarial Encoder-Multi-Task-Decoder for Multi-Stage Processes
Venue: arXiv cs.LG 2020
Year: 2020

In multi-stage processes, decisions occur in an ordered sequence of stages. Early stages usually have more observations with general information (easier/cheaper to collect), while later stages have fewer observations but more specific data. This situation can be represented by a dual funnel structure, in which the sample size decreases from one stage to the other while the information increases. Training classifiers in this scenario is challenging since information in the early stages may not contain distinct patterns to learn (underfitting). In contrast, the small sample size in later stages can cause overfitting. We address both cases by introducing a framework that combines adversarial autoencoders (AAE), multi-task learning (MTL), and multi-label semi-supervised learning (MLSSL). We improve the decoder of the AAE with an MTL component so it can jointly reconstruct the original input and use feature nets to predict the features for the next stages. We also introduce a sequence constraint in the output of an MLSSL classifier to guarantee the sequential pattern in the predictions. Using real-world data from different domains (selection process, medical diagnosis), we show that our approach outperforms other state-of-the-art methods.
Self-Constructing Graph Convolutional Networks for Semantic Labeling
Venue: arXiv cs.CV 2020
Year: 2020

Graph Neural Networks (GNNs) have received increasing attention in many fields. However, due to the lack of prior graphs, their use for semantic labeling has been limited. Here, we propose a novel architecture called the Self-Constructing Graph (SCG), which makes use of learnable latent variables to generate embeddings and to self-construct the underlying graphs directly from the input features without relying on manually built prior knowledge graphs. SCG can automatically obtain optimized non-local context graphs from complex-shaped objects in aerial imagery. We optimize SCG via an adaptive diagonal enhancement method and a variational lower bound that consists of a customized graph reconstruction term and a Kullback-Leibler divergence regularization term. We demonstrate the effectiveness and flexibility of the proposed SCG on the publicly available ISPRS Vaihingen dataset and our model SCG-Net achieves competitive results in terms of F1-score with much fewer parameters and at a lower computational cost compared to related pure-CNN based work. Our code will be made public soon.
Joint Trajectory and Resource Allocation Design for Energy-Efficient Secure UAV Communication Systems
Venue: arXiv cs.IT 2020
Year: 2020

In this paper, we study the trajectory and resource allocation design for downlink energy-efficient secure unmanned aerial vehicle (UAV) communication systems, where an information UAV assisted by a multi-antenna jammer UAV serves multiple ground users in the existence of multiple ground eavesdroppers. The resource allocation strategy and the trajectory of the information UAV, and the jamming policy of the jammer UAV are jointly optimized for maximizing the system energy efficiency. The joint design is formulated as a non-convex optimization problem taking into account the quality of service (QoS) requirement, the security constraint, and the imperfect channel state information (CSI) of the eavesdroppers. The formulated problem is generally intractable. As a compromise approach, the problem is divided into two subproblems which facilitates the design of a low-complexity suboptimal algorithm based on alternating optimization approach. Simulation results illustrate that the proposed algorithm converges within a small number of iterations and demonstrate some interesting insights: (1) the introduction of a jammer UAV facilitates a highly flexible trajectory design of the information UAV which is critical to improving the system energy efficiency; (2) by exploiting the spatial degrees of freedom brought by the multi-antenna jammer UAV, our proposed design can focus the artificial noise on eavesdroppers offering a strong security mean to the system.
Joint Power Allocation and Precoding for Network Coding based Cooperative Multicast Systems
Venue: arXiv cs.IT 2020
Year: 2020

In this letter, we propose two power allocation schemes based on the statistical channel state information (CSI) and instantaneous s->r CSI at transmitters respectively for a 2-N-2 cooperative multicast system with non-regenerative network coding.Then the isolated precoder and the distributed precoder are respectively applied to the schemes to further improve the system performance by achieving the full diversity gain. Finally, we demonstrate that joint instantaneous s->r CSI based power allocation and distributed precoder design achieve the best performance.
Power Allocation in the High SNR Regime for A Multicast Cell with Regenerative Network Coding
Venue: arXiv cs.IT 2020
Year: 2020

This letter focuses on power allocation schemes for a basic multicast cell with wireless regenerative network coding (RNC). In RNC, mixed signals received from the two sources are jointly decoded by the relay where decoded symbols are superposed in either the complex field (RCNC) or Galois field (RGNC) before being retransmitted. We deduce the optimal statistical channels state information (CSI) based power allocation and give a comparison between the two RNCs. When instantaneous CSI is available at each transmitter, we propose a suboptimal power allocation for RCNC, which achieves better performance.
Gated Texture CNN for Efficient and Configurable Image Denoising
Venue: arXiv cs.CV 2020
Year: 2020

Convolutional neural network (CNN)-based image denoising methods typically estimate the noise component contained in a noisy input image and restore a clean image by subtracting the estimated noise from the input. However, previous denoising methods tend to remove high-frequency information (e.g., textures) from the input. It caused by intermediate feature maps of CNN contains texture information. A straightforward approach to this problem is stacking numerous layers, which leads to a high computational cost. To achieve high performance and computational efficiency, we propose a gated texture CNN (GTCNN), which is designed to carefully exclude the texture information from each intermediate feature map of the CNN by incorporating gating mechanisms. Our GTCNN achieves state-of-the-art performance with 4.8 times fewer parameters than previous state-of-the-art methods. Furthermore, the GTCNN allows us to interactively control the texture strength in the output image without any additional modules, training, or computational costs.
Design of an MISO-SWIPT-Aided Code-Index Modulated Multi-Carrier M-DCSK System for e-Health IoT
Venue: arXiv cs.NI 2020
Year: 2020

Code index modulated multi-carrier M-ary differential chaos shift keying (CIM-MC-M-DCSK) system not only inherits low-power and low-complexity advantages of the conventional DCSK system, but also significantly increases the transmission rate. This feature is of particular importance to Internet of Things (IoT) with trillions of low-cost devices. In particular, for e-health IoT applications, an efficient transmission scheme is designed to solve the challenge of the limited battery capacity for numerous user equipments served by one base station. In this paper, a new multiple-input-single-output simultaneous wireless information and power transfer (MISO-SWIPT) scheme for CIM-MC-M-DCSK system is proposed by utilizing orthogonal characteristic of chaotic signals with different initial values. The proposed system adopts power splitting mode, which is very promising for simultaneously providing energy and transmitting information of the user equipments without any external power supply. In particular, the new system can achieve desirable anti-multipath-fading capability without using channel estimator. Moreover, the analytical bit-error-rate expression of the proposed system is derived over multipath Rayleigh fading channels. Furthermore, the spectral efficiency and energy efficiency of the proposed system are analyzed. Simulation results not only validate the analytical expressions, but also demonstrate the superiority of the proposed system.