OpenRaiser/Intern-Atlas huggingface dataset:
Handling Bidirectional Control Flow: Technical Report
Venue: arXiv cs.PL 2020
Year: 2020

Pressed by the difficulty of writing asynchronous, event-driven code, mainstream languages have recently been building in support for a variety of advanced control-flow features. Meanwhile, experimental language designs have suggested effect handlers as a unifying solution to programmer-defined control effects, subsuming exceptions, generators, and async--await. Despite these trends, complex control flow---in particular, control flow exhibiting a bidirectional pattern---remains challenging to manage. We introduce bidirectional algebraic effects, a new programming abstraction that supports bidirectional control transfer in a more natural way. Handlers of bidirectional effects can raise further effects to transfer control back to the site where the initiating effect was raised, and can use themselves to handle their own effects. We present applications of this expressive power, which falls out naturally as we push toward the unification of effectful programming with object-oriented programming. We pin down the mechanism and the unification formally using a core language that generalizes to effect operations and effect handlers. The usual propagation semantics of control effects such as exceptions conflicts with modular reasoning in the presence of effect polymorphism---it breaks parametricity. Bidirectionality exacerbates the problem. Hence, we set out to show the core language, which builds on the existing tunneling semantics for algebraic effects, is not only type-safe (no effects go unhandled), but also abstraction-safe (no effects are accidentally handled). We devise a step-indexed logical-relations model, and construct its parametricity and soundness proofs. These core results are fully mechanized in Coq. Preliminary experiments show that as a first-class language feature, bidirectional handlers can be implemented efficiently.
Multi-Agent Reinforcement Learning in NOMA-aided UAV Networks for Cellular Offloading
Venue: arXiv cs.LG 2020
Year: 2020

A novel framework is proposed for cellular offloading with the aid of multiple unmanned aerial vehicles (UAVs), while the non-orthogonal multiple access (NOMA) technique is employed at each UAV to further improve the spectrum efficiency of the wireless network. The optimization problem of joint three-dimensional (3D) trajectory design and power allocation is formulated for maximizing the throughput. Since ground mobile users are considered as roaming continuously, the UAVs need to be re-deployed timely based on the movement of users. In an effort to solve this pertinent dynamic problem, a K-means based clustering algorithm is first adopted for periodically partitioning users. Afterward, a mutual deep Q-network (MDQN) algorithm is proposed to jointly determine the optimal 3D trajectory and power allocation of UAVs. In contrast to the conventional DQN algorithm, the MDQN algorithm enables the experience of multi-agent to be input into a shared neural network to shorten the training time with the assistance of state abstraction. Numerical results demonstrate that: 1) the proposed MDQN algorithm is capable of converging under minor constraints and has a faster convergence rate than the conventional DQN algorithm in the multi-agent case; 2) The achievable sum rate of the NOMA enhanced UAV network is 23% superior to the case of orthogonal multiple access (OMA); 3) By designing the optimal 3D trajectory of UAVs with the aid of the MDON algorithm, the sum rate of the network enjoys 142% and 56% gains than that of invoking the circular trajectory and the 2D trajectory, respectively.
GROWN: Local Data Compression in Real-Time To Support Energy Efficiency in WBAN
Venue: arXiv cs.NI 2020
Year: 2020

The evolution of wireless technologies has enabled the creation of networks for several purposes as health care monitoring. The Wireless Body Area Networks (WBANs) enable continuous and real-time monitoring of physiological signals, but that monitoring leads to an excessive data transmission usage, and drastically affects the power consumption of the devices. Although there are approaches for reducing energy consumption, many of them do not consider information redundancy to reduce the power consumption. This paper proposes a hybrid approach of local data compression, called GROWN, to decrease information redundancy during data transmission and reduce the energy consumption. Our approach combines local data compression methods found in WSN. We have evaluated GROWN by experimentation, and the results show a decrease in energy consumption of the devices and an increase in network lifetime.
Sky Highway Design for Dense Traffic
Venue: arXiv cs.RO 2020
Year: 2020

The number of Unmanned Aerial Vehicles (UAVs) continues to explode. Within the total spectrum of Unmanned Aircraft System (UAS) operations, Urban Air Mobility (UAM) is also on the way. Dense air traffic is getting ever closer to us. Current research either focuses on traffic network design and route design for safety purpose or swarm control in open airspace to contain large volume of UAVs. In order to achieve a tradeoff between safety and volumes of UAVs, a sky highway with its basic operation for Vertical Take-Off and Landing (VTOL) UAV is proposed, where traffic network, route and swarm control design are all considered. In the sky highway, each UAV will have its route, and an airway like a highway road can allow many UAVs to perform free flight. The geometrical structure of the proposed sky highway with corresponding flight modes to support dense traffic is studied one by one. The effectiveness of the proposed sky highway is shown by the given demonstration.
D2RL: Deep Dense Architectures in Reinforcement Learning
Venue: arXiv cs.LG 2020
Year: 2020

While improvements in deep learning architectures have played a crucial role in improving the state of supervised and unsupervised learning in computer vision and natural language processing, neural network architecture choices for reinforcement learning remain relatively under-explored. We take inspiration from successful architectural choices in computer vision and generative modelling, and investigate the use of deeper networks and dense connections for reinforcement learning on a variety of simulated robotic learning benchmark environments. Our findings reveal that current methods benefit significantly from dense connections and deeper networks, across a suite of manipulation and locomotion tasks, for both proprioceptive and image-based observations. We hope that our results can serve as a strong baseline and further motivate future research into neural network architectures for reinforcement learning. The project website with code is at this link https://sites.google.com/view/d2rl/home.
MaskNet: A Fully-Convolutional Network to Estimate Inlier Points
Venue: arXiv cs.CV 2020
Year: 2020

Point clouds have grown in importance in the way computers perceive the world. From LIDAR sensors in autonomous cars and drones to the time of flight and stereo vision systems in our phones, point clouds are everywhere. Despite their ubiquity, point clouds in the real world are often missing points because of sensor limitations or occlusions, or contain extraneous points from sensor noise or artifacts. These problems challenge algorithms that require computing correspondences between a pair of point clouds. Therefore, this paper presents a fully-convolutional neural network that identifies which points in one point cloud are most similar (inliers) to the points in another. We show improvements in learning-based and classical point cloud registration approaches when retrofitted with our network. We demonstrate these improvements on synthetic and real-world datasets. Finally, our network produces impressive results on test datasets that were unseen during training, thus exhibiting generalizability. Code and videos are available at https://github.com/vinits5/masknet
Optimal Transmit Power and Flying Location for UAV Covert Wireless Communications
Venue: arXiv cs.IT 2020
Year: 2020

This paper jointly optimizes the flying location and wireless communication transmit power for an unmanned aerial vehicle (UAV) conducting covert operations. This is motivated by application scenarios such as military ground surveillance from airborne platforms, where it is vital for a UAV's signal transmission to be undetectable by those within the surveillance region. Specifically, we maximize the communication quality to a legitimate ground receiver outside the surveillance region, subject to: a covertness constraint, a maximum transmit power constraint, and a physical location constraint determined by the required surveillance quality. We provide an explicit solution to the optimization problem for one of the most practical constraint combinations. For other constraint combinations, we determine feasible regions for flight, that can then be searched to establish the UAV's optimal location. In many cases, the 2-dimensional optimal location is achieved by a 1-dimensional search. We discuss two heuristic approaches to UAV placement, and show that in some cases they are able to achieve close to optimal, but that in other cases significant gains can be achieved by employing our developed solutions.
Rotation Invariant Aerial Image Retrieval with Group Convolutional Metric Learning
Venue: arXiv cs.CV 2020
Year: 2020

Remote sensing image retrieval (RSIR) is the process of ranking database images depending on the degree of similarity compared to the query image. As the complexity of RSIR increases due to the diversity in shooting range, angle, and location of remote sensors, there is an increasing demand for methods to address these issues and improve retrieval performance. In this work, we introduce a novel method for retrieving aerial images by merging group convolution with attention mechanism and metric learning, resulting in robustness to rotational variations. For refinement and emphasis on important features, we applied channel attention in each group convolution stage. By utilizing the characteristics of group convolution and channel-wise attention, it is possible to acknowledge the equality among rotated but identically located images. The training procedure has two main steps: (i) training the network with Aerial Image Dataset (AID) for classification, (ii) fine-tuning the network with triplet-loss for retrieval with Google Earth South Korea and NWPU-RESISC45 datasets. Results show that the proposed method performance exceeds other state-of-the-art retrieval methods in both rotated and original environments. Furthermore, we utilize class activation maps (CAM) to visualize the distinct difference of main features between our method and baseline, resulting in better adaptability in rotated environments.
Double-Uncertainty Weighted Method for Semi-supervised Learning
Venue: arXiv cs.CV 2020
Year: 2020

Though deep learning has achieved advanced performance recently, it remains a challenging task in the field of medical imaging, as obtaining reliable labeled training data is time-consuming and expensive. In this paper, we propose a double-uncertainty weighted method for semi-supervised segmentation based on the teacher-student model. The teacher model provides guidance for the student model by penalizing their inconsistent prediction on both labeled and unlabeled data. We train the teacher model using Bayesian deep learning to obtain double-uncertainty, i.e. segmentation uncertainty and feature uncertainty. It is the first to extend segmentation uncertainty estimation to feature uncertainty, which reveals the capability to capture information among channels. A learnable uncertainty consistency loss is designed for the unsupervised learning process in an interactive manner between prediction and uncertainty. With no ground-truth for supervision, it can still incentivize more accurate teacher's predictions and facilitate the model to reduce uncertain estimations. Furthermore, our proposed double-uncertainty serves as a weight on each inconsistency penalty to balance and harmonize supervised and unsupervised training processes. We validate the proposed feature uncertainty and loss function through qualitative and quantitative analyses. Experimental results show that our method outperforms the state-of-the-art uncertainty-based semi-supervised methods on two public medical datasets.
Evolutionary Algorithm and Multifactorial Evolutionary Algorithm on Clustered Shortest-Path Tree problem
Venue: arXiv cs.NE 2020
Year: 2020

In literature, Clustered Shortest-Path Tree Problem (CluSPT) is an NP-hard problem. Previous studies often search for an optimal solution in relatively large space. To enhance the performance of the search process, two approaches are proposed: the first approach seeks for solutions as a set of edges. From the original graph, we generate a new graph whose vertex set's cardinality is much smaller than that of the original one. Consequently, an effective Evolutionary Algorithm (EA) is proposed for solving CluSPT. The second approach looks for vertex-based solutions. The search space of the CluSPT is transformed into 2 nested search spaces (NSS). With every candidate in the high-level optimization, the search engine in the lower level will find a corresponding candidate to combine with it to create the best solution for CluSPT. Accordingly, Nested Local Search EA (N-LSEA) is introduced to search for the optimal solution on the NSS. When solving this model in lower level by N-LSEA, variety of similar tasks are handled. Thus, Multifactorial Evolutionary Algorithm applied in order to enhance the implicit genetic transfer across these optimizations. Proposed algorithms are conducted on a series of datasets and the obtained results demonstrate superior efficiency in comparison to previous scientific works.
Synthesizing the Unseen for Zero-shot Object Detection
Venue: arXiv cs.CV 2020
Year: 2020

The existing zero-shot detection approaches project visual features to the semantic domain for seen objects, hoping to map unseen objects to their corresponding semantics during inference. However, since the unseen objects are never visualized during training, the detection model is skewed towards seen content, thereby labeling unseen as background or a seen class. In this work, we propose to synthesize visual features for unseen classes, so that the model learns both seen and unseen objects in the visual domain. Consequently, the major challenge becomes, how to accurately synthesize unseen objects merely using their class semantics? Towards this ambitious goal, we propose a novel generative model that uses class-semantics to not only generate the features but also to discriminatively separate them. Further, using a unified model, we ensure the synthesized features have high diversity that represents the intra-class differences and variable localization precision in the detected bounding boxes. We test our approach on three object detection benchmarks, PASCAL VOC, MSCOCO, and ILSVRC detection, under both conventional and generalized settings, showing impressive gains over the state-of-the-art methods. Our codes are available at https://github.com/nasir6/zero_shot_detection.
A Privacy-Preserving Data Inference Framework for Internet of Health Things Networks
Venue: arXiv cs.CR 2020
Year: 2020

Privacy protection in electronic healthcare applications is an important consideration due to the sensitive nature of personal health data. Internet of Health Things (IoHT) networks have privacy requirements within a healthcare setting. However, these networks have unique challenges and security requirements (integrity, authentication, privacy and availability) must also be balanced with the need to maintain efficiency in order to conserve battery power, which can be a significant limitation in IoHT devices and networks. Data are usually transferred without undergoing filtering or optimization, and this traffic can overload sensors and cause rapid battery consumption when interacting with IoHT networks. This consequently poses restrictions on the practical implementation of these devices. As a solution to address the issues, this paper proposes a privacy-preserving two-tier data inference framework, this can conserve battery consumption by reducing the data size required to transmit through inferring the sensed data and can also protect the sensitive data from leakage to adversaries. Results from experimental evaluations on privacy show the validity of the proposed scheme as well as significant data savings without compromising the accuracy of the data transmission, which contributes to energy efficiency of IoHT sensor devices.
6G in the Sky: On-Demand Intelligence at the Edge of 3D Networks
Venue: arXiv cs.NI 2020
Year: 2020

6G will exploit satellite, aerial and terrestrial platforms jointly to improve radio access capability and to unlock the support of on-demand edge cloud services in the three dimensional space (3D) by incorporating Mobile Edge Computing (MEC) functionalities on aerial platforms and low orbit satellites. This will extend the MEC support to devices and network elements in the sky and will forge a space borne MEC enabling intelligent personalized and distributed on demand services. 3D end users will experience the impression of being surrounded by a distributed computer fulfilling their requests in apparently zero latency. In this paper, we consider an architecture providing communication, computation, and caching (C3) services on demand, anytime and everywhere in 3D space, building on the integration of conventional ground (terrestrial) base stations and flying (non-terrestrial) nodes. Given the complexity of the overall network, the C3 resources and the management of the aerial devices need to be jointly orchestrated via AI-based algorithms, exploiting virtualized networks functions dynamically deployed in a distributed manner across terrestrial and non-terrestrial nodes.
Aerodynamic Data Predictions Based on Multi-task Learning
Venue: arXiv cs.LG 2020
Year: 2020

The quality of datasets is one of the key factors that affect the accuracy of aerodynamic data models. For example, in the uniformly sampled Burgers' dataset, the insufficient high-speed data is overwhelmed by massive low-speed data. Predicting high-speed data is more difficult than predicting low-speed data, owing to that the number of high-speed data is limited, i.e. the quality of the Burgers' dataset is not satisfactory. To improve the quality of datasets, traditional methods usually employ the data resampling technology to produce enough data for the insufficient parts in the original datasets before modeling, which increases computational costs. Recently, the mixtures of experts have been used in natural language processing to deal with different parts of sentences, which provides a solution for eliminating the need for data resampling in aerodynamic data modeling. Motivated by this, we propose the multi-task learning (MTL), a datasets quality-adaptive learning scheme, which combines task allocation and aerodynamic characteristics learning together to disperse the pressure of the entire learning task. The task allocation divides a whole learning task into several independent subtasks, while the aerodynamic characteristics learning learns these subtasks simultaneously to achieve better precision. Two experiments with poor quality datasets are conducted to verify the data quality-adaptivity of the MTL to datasets. The results show than the MTL is more accurate than FCNs and GANs in poor quality datasets.
Softer Pruning, Incremental Regularization
Venue: arXiv cs.CV 2020
Year: 2020

Network pruning is widely used to compress Deep Neural Networks (DNNs). The Soft Filter Pruning (SFP) method zeroizes the pruned filters during training while updating them in the next training epoch. Thus the trained information of the pruned filters is completely dropped. To utilize the trained pruned filters, we proposed a SofteR Filter Pruning (SRFP) method and its variant, Asymptotic SofteR Filter Pruning (ASRFP), simply decaying the pruned weights with a monotonic decreasing parameter. Our methods perform well across various networks, datasets and pruning rates, also transferable to weight pruning. On ILSVRC-2012, ASRFP prunes 40% of the parameters on ResNet-34 with 1.63% top-1 and 0.68% top-5 accuracy improvement. In theory, SRFP and ASRFP are an incremental regularization of the pruned filters. Besides, We note that SRFP and ASRFP pursue better results while slowing down the speed of convergence.
6TiSCH++ with Bluetooth 5 and Concurrent Transmissions
Venue: arXiv cs.NI 2020
Year: 2020

Targeting dependable communications for industrial Internet of Things applications, IETF 6TiSCH provides mechanisms for efficient scheduling, routing, and forwarding of IPv6 traffic across low-power mesh networks. Yet, despite an overwhelming body of literature covering both centralized and distributed scheduling schemes for 6TiSCH, an effective control solution for large-scale multi-hop mesh networks remains an open challenge. This paper addresses this with a novel approach that eliminates much of the routing and link-layer overhead incurred by centralized schedulers, and provides a robust mechanism for data dissemination synchronization within 6TiSCH. Specifically, we leverage the physical layer (PHY) switching capabilities of modern low-power wireless platforms to build on recent work demonstrating the viability of Concurrent Transmission (CT)-based flooding protocols across the Bluetooth 5 (BT 5) PHYs. By switching the PHY and MAC layer at runtime, we inject a BT 5-based CT flood within a standard IEEE 802.15.4 TSCH slotframe, thereby providing a reliable, low-latency scheme for 6TiSCH control messaging. We present an analytical model and experimental evaluation showing how our solution not only exploits the BT 5 high data-rate PHY layers for rapid data dissemination, but can also provide reliable 6TiSCH association and synchronization even under external radio interference. We further discuss how the proposed technique can be used to address other open challenges within the standard.
Machine Learning Evaluation of the Echo-Chamber Effect in Medical Forums
Venue: arXiv cs.LG 2020
Year: 2020

We propose the Echo-Chamber Effect assessment of an online forum. Sentiments perceived by the forum readers are at the core of the analysis; a complete message is the unit of the study. We build 14 models and apply those to represent discussions gathered from an online medical forum. We use four multi-class sentiment classification applications and two Machine Learning algorithms to evaluate prowess of the assessment models.
EPTAS for $k$-means Clustering of Affine Subspaces
Venue: arXiv cs.DS 2020
Year: 2020

We consider a generalization of the fundamental $k$-means clustering for data with incomplete or corrupted entries. When data objects are represented by points in $\mathbb{R}^d$, a data point is said to be incomplete when some of its entries are missing or unspecified. An incomplete data point with at most $Δ$ unspecified entries corresponds to an axis-parallel affine subspace of dimension at most $Δ$, called a $Δ$-point. Thus we seek a partition of $n$ input $Δ$-points into $k$ clusters minimizing the $k$-means objective. For $Δ=0$, when all coordinates of each point are specified, this is the usual $k$-means clustering. We give an algorithm that finds an $(1+ ε)$-approximate solution in time $f(k,ε, Δ) \cdot n^2 \cdot d$ for some function $f$ of $k,ε$, and $Δ$ only.