OpenRaiser/Intern-Atlas huggingface dataset:
Using Network Embeddings for Improving Network Alignment
Venue: arXiv cs.SI 2020
Year: 2020

Network (or Graph) Alignment Algorithms aims to reveal structural similarities among graphs. In particular Local Network Alignment Algorithms (LNAs) finds local regions of similarity among two or more networks. Such algorithms are in general based on a set of seed nodes that are used to grow an alignment. Almost all LNAs algorithms use as seed nodes a set of vertices based on context information (e.g. a set of biologically related in biological network alignment) and this may cause a bias or a data-circularity problem. More recently, we demonstrated that the use of topological information in the choice of seed nodes may improve the quality of the alignments. We used some common approaches based on global alignment algorithms for capturing topological similarity among nodes. In parallel, it has been demonstrated that the use of network embedding methods (or representation learning), may capture the structural similarity among nodes better than other methods. Therefore we propose to use network embeddings to learn structural similarity among nodes and to use such similarity to improve LNA extendings our previous algorithms. We define a framework for LNA.
R-MNet: A Perceptual Adversarial Network for Image Inpainting
Venue: arXiv cs.CV 2020
Year: 2020

Facial image inpainting is a problem that is widely studied, and in recent years the introduction of Generative Adversarial Networks, has led to improvements in the field. Unfortunately some issues persists, in particular when blending the missing pixels with the visible ones. We address the problem by proposing a Wasserstein GAN combined with a new reverse mask operator, namely Reverse Masking Network (R-MNet), a perceptual adversarial network for image inpainting. The reverse mask operator transfers the reverse masked image to the end of the encoder-decoder network leaving only valid pixels to be inpainted. Additionally, we propose a new loss function computed in feature space to target only valid pixels combined with adversarial training. These then capture data distributions and generate images similar to those in the training data with achieved realism (realistic and coherent) on the output images. We evaluate our method on publicly available dataset, and compare with state-of-the-art methods. We show that our method is able to generalize to high-resolution inpainting task, and further show more realistic outputs that are plausible to the human visual system when compared with the state-of-the-art methods.
Quantifying Success in Science: An Overview
Venue: arXiv cs.DL 2020
Year: 2020

Quantifying success in science plays a key role in guiding funding allocations, recruitment decisions, and rewards. Recently, a significant amount of progresses have been made towards quantifying success in science. This lack of detailed analysis and summary continues a practical issue. The literature reports the factors influencing scholarly impact and evaluation methods and indices aimed at overcoming this crucial weakness. We focus on categorizing and reviewing the current development on evaluation indices of scholarly impact, including paper impact, scholar impact, and journal impact. Besides, we summarize the issues of existing evaluation methods and indices, investigate the open issues and challenges, and provide possible solutions, including the pattern of collaboration impact, unified evaluation standards, implicit success factor mining, dynamic academic network embedding, and scholarly impact inflation. This paper should help the researchers obtaining a broader understanding of quantifying success in science, and identifying some potential research directions.
PIS: A Multi-dimensional Routing Protocol for Socially-aware Networking
Venue: arXiv cs.SI 2020
Year: 2020

Socially-aware networking is an emerging paradigm for intermittently connected networks consisting of mobile users with social relationships and characteristics. In this setting, humans are the main carriers of mobile devices. Hence, their connections, social features, and behaviors can be exploited to improve the performance of data forwarding protocols. In this paper, we first explore the impact of three social features, namely physical proximity, user interests, and social relationship on users' daily routines. Then, we propose a multi-dimensional routing protocol called Proximity-Interest-Social (PIS) protocol in which the three different social dimensions are integrated into a unified distance function in order to select optimal intermediate data carriers. PIS protocol utilizes a time slot management mechanism to discover users' movement similarities in different time periods during a day. We compare the performance of PIS to Epidemic, PROPHET, and SimBet routing protocols using SIGCOMM09 and INFOCOM06 data sets. The experiment results show that PIS outperforms other benchmark routing protocols with the highest data delivery ratio with a low communication overhead.
SENSEI: Aligning Video Streaming Quality with Dynamic User Sensitivity
Venue: arXiv cs.NI 2020
Year: 2020

This paper aims to improve video streaming by leveraging a simple observation: users are more sensitive to low quality in certain parts of a video than in others. For instance, rebuffering during key moments of a sports video (e.g., before a goal is scored) is more annoying than rebuffering during normal gameplay. Such dynamic quality sensitivity, however, is rarely captured by current approaches, which predict QoE (quality-of-experience) using one-size-fits-all heuristics that are too simplistic to understand the nuances of video content. Instead of proposing yet another heuristic, we take a different approach: we run a separate crowdsourcing experiment for each video to derive users' quality sensitivity at different parts of the video. Of course, the cost of doing this at scale can be prohibitive, but we show that careful experiment design combined with a suite of pruning techniques can make the cost negligible compared to how much content providers invest in content generation and distribution. Our ability to accurately profile time-varying user sensitivity inspires a new approach: dynamically aligning higher (lower) quality with higher (lower) sensitivity periods. We present a new video streaming system called SENSEI that incorporates dynamic quality sensitivity into existing quality adaptation algorithms. We apply SENSEI to two state-of-the-art adaptation algorithms. SENSEI can take seemingly unusual actions: e.g., lowering bitrate (or initiating a rebuffering event) even when bandwidth is sufficient so that it can maintain a higher bitrate without rebuffering when quality sensitivity becomes higher in the near future. Compared to state-of-the-art approaches, SENSEI improves QoE by 15.1% or achieves the same QoE with 26.8% less bandwidth on average.
Reinforced Wasserstein Training for Severity-Aware Semantic Segmentation in Autonomous Driving
Venue: arXiv cs.CV 2020
Year: 2020

Semantic segmentation is important for many real-world systems, e.g., autonomous vehicles, which predict the class of each pixel. Recently, deep networks achieved significant progress w.r.t. the mean Intersection-over Union (mIoU) with the cross-entropy loss. However, the cross-entropy loss can essentially ignore the difference of severity for an autonomous car with different wrong prediction mistakes. For example, predicting the car to the road is much more servery than recognize it as the bus. Targeting for this difficulty, we develop a Wasserstein training framework to explore the inter-class correlation by defining its ground metric as misclassification severity. The ground metric of Wasserstein distance can be pre-defined following the experience on a specific task. From the optimization perspective, we further propose to set the ground metric as an increasing function of the pre-defined ground metric. Furthermore, an adaptively learning scheme of the ground matrix is proposed to utilize the high-fidelity CARLA simulator. Specifically, we follow a reinforcement alternative learning scheme. The experiments on both CamVid and Cityscapes datasets evidenced the effectiveness of our Wasserstein loss. The SegNet, ENet, FCN and Deeplab networks can be adapted following a plug-in manner. We achieve significant improvements on the predefined important classes, and much longer continuous playtime in our simulator.
Social Engagement versus Learning Engagement -- An Exploratory Study of FutureLearn Learners
Venue: arXiv cs.CY 2020
Year: 2020

Massive Open Online Courses (MOOCs) continue to see increasing enrolment, but only a small percent of enrolees completes the MOOCs. Whilst a lot of research has focused on predicting completion, there is little research analysing the ostensible contradiction between the MOOC's popularity and the apparent disengagement of learners. Specifically, it is important to analyse engagement not just in learning, but also from a social perspective. This is especially crucial, as MOOCs offer a growing amount of activities, which can be classified as social interactions. Thus, this study is particularly concerned with how learners interact with peers, along with their study progression in MOOCs. Additionally, unlike most existing studies that are mainly focused on learning outcomes, this study adopts a fine-grained temporal approach to exploring how learners progress within a MOOC. The study was conducted on the less explored FutureLearn platform, which employs a social constructivist approach and promotes collaborative learning. The preliminary results suggest potential interesting fine-grained predictive models for learner behaviour, involving weekly monitoring of social, non-social behaviour of active students (further classified as completers and non-completers).
BREEDS: Benchmarks for Subpopulation Shift
Venue: arXiv cs.CV 2020
Year: 2020

We develop a methodology for assessing the robustness of models to subpopulation shift---specifically, their ability to generalize to novel data subpopulations that were not observed during training. Our approach leverages the class structure underlying existing datasets to control the data subpopulations that comprise the training and test distributions. This enables us to synthesize realistic distribution shifts whose sources can be precisely controlled and characterized, within existing large-scale datasets. Applying this methodology to the ImageNet dataset, we create a suite of subpopulation shift benchmarks of varying granularity. We then validate that the corresponding shifts are tractable by obtaining human baselines for them. Finally, we utilize these benchmarks to measure the sensitivity of standard model architectures as well as the effectiveness of off-the-shelf train-time robustness interventions. Code and data available at https://github.com/MadryLab/BREEDS-Benchmarks .
Demo: Slicing-Enabled Private 4G/5G Network for Industrial Wireless Applications
Venue: arXiv cs.NI 2020
Year: 2020

Private deployments of 4G and 5G networks in industrial environments are beneficial from various aspects. Private 4G/5G networks typically face the challenge of supporting heterogeneous industrial applications. This technology demonstration highlights the importance of network slicing in private 4G/5G networks. It shows that network slicing is crucial for performance guarantees in multi-service co-existence scenarios. With network slicing, our private 4G/5G network successfully supports closed-loop control, event-driven control and video streaming applications.
Channel Leakage, Information-Theoretic Limitations of Obfuscation, and Optimal Privacy Mask Design for Streaming Data
Venue: arXiv cs.IT 2020
Year: 2020

In this paper, we first introduce the notion of channel leakage as the minimum mutual information between the channel input and channel output. As its name indicates, channel leakage quantifies the minimum information leakage to the malicious receiver. In a broad sense, it can be viewed as a dual concept of channel capacity, which characterizes the maximum information transmission to the targeted receiver. We obtain explicit formulas of channel leakage for the white Gaussian case, the colored Gaussian case, and the fading case. We then utilize this notion to investigate the fundamental limitations of obfuscation in terms of privacy-distortion tradeoffs (as well as privacy-power tradeoffs) for streaming data; particularly, we derive analytical tradeoff equations for the stationary case, the non-stationary case, and the finite-time case. Our results also indicate explicitly how to design the privacy masks in an optimal way.
Visual Imitation Made Easy
Venue: arXiv cs.RO 2020
Year: 2020

Visual imitation learning provides a framework for learning complex manipulation behaviors by leveraging human demonstrations. However, current interfaces for imitation such as kinesthetic teaching or teleoperation prohibitively restrict our ability to efficiently collect large-scale data in the wild. Obtaining such diverse demonstration data is paramount for the generalization of learned skills to novel scenarios. In this work, we present an alternate interface for imitation that simplifies the data collection process while allowing for easy transfer to robots. We use commercially available reacher-grabber assistive tools both as a data collection device and as the robot's end-effector. To extract action information from these visual demonstrations, we use off-the-shelf Structure from Motion (SfM) techniques in addition to training a finger detection network. We experimentally evaluate on two challenging tasks: non-prehensile pushing and prehensile stacking, with 1000 diverse demonstrations for each task. For both tasks, we use standard behavior cloning to learn executable policies from the previously collected offline demonstrations. To improve learning performance, we employ a variety of data augmentations and provide an extensive analysis of its effects. Finally, we demonstrate the utility of our interface by evaluating on real robotic scenarios with previously unseen objects and achieve a 87% success rate on pushing and a 62% success rate on stacking. Robot videos are available at https://dhiraj100892.github.io/Visual-Imitation-Made-Easy.
Little Motion, Big Results: Using Motion Magnification to Reveal Subtle Tremors in Infants
Venue: arXiv cs.CV 2020
Year: 2020

Detecting tremors is challenging for both humans and machines. Infants exposed to opioids during pregnancy often show signs and symptoms of withdrawal after birth, which are easy to miss with the human eye. The constellation of clinical features, termed as Neonatal Abstinence Syndrome (NAS), include tremors, seizures, irritability, etc. The current standard of care uses Finnegan Neonatal Abstinence Syndrome Scoring System (FNASS), based on subjective evaluations. Monitoring with FNASS requires highly skilled nursing staff, making continuous monitoring difficult. In this paper we propose an automated tremor detection system using amplified motion signals. We demonstrate its applicability on bedside video of infant exhibiting signs of NAS. Further, we test different modes of deep convolutional network based motion magnification, and identify that dynamic mode works best in the clinical setting, being invariant to common orientational changes. We propose a strategy for discharge and follow up for NAS patients, using motion magnification to supplement the existing protocols. Overall our study suggests methods for bridging the gap in current practices, training and resource utilization.
Analysis of Agricultural Policy Recommendations using Multi-Agent Systems
Venue: arXiv cs.CY 2020
Year: 2020

Despite agriculture being the primary source of livelihood for more than half of India's population, several socio-economic policies are implemented in the Indian agricultural sector without paying enough attention to the possible outcomes of the policies. The negative impact of some policies can be seen in the huge distress suffered by farmers as documented by several studies and reported in the media on a regular basis. In this paper, we model a specific troubled agricultural sub-system in India as a Multi-Agent System and use it to analyse the impact of some policies. Ideally, we should be able to model the entire system, including all the external dependencies from other systems - for example availability of labour or water may depend on other sources of employment, water rights and so on - but for our purpose, we start with a fairly basic model not taking into account such external effects. As per our knowledge there are no available models which considers factors like water levels, availability of information and market simulation in the Indian context. So, we plugged in various entities into the model to make it sufficiently close to observed realities, at least in some selected regions of India. We evaluate some policy options to get an understanding of changes that may happen once such policies are implemented. Then we recommended some policies based on the result of the simulation.
Data Privacy in IoT Equipped Future Smart Homes
Venue: arXiv cs.CY 2020
Year: 2020

Smart devices are becoming inseparable from daily lives and are improving fast for providing intelligent services and remote monitoring and control. In order to provide personalized and customized services more personal data collection is required. Consequently, intelligent services are becoming intensely personal and they raise concerns regarding data privacy and security. In this paper data privacy requirements in a smart home environment equipped with "Internet of Things" are described and privacy challenges for data and models are addressed.
On the number of useful objects in P systems with active membranes
Venue: arXiv cs.FL 2020
Year: 2020

In this paper we investigate the number of objects actually used in the terminating computations of a certain variant of polarizationless P systems with active membranes. The P systems we consider here have no in-communication rules and have no different rules triggered by the same object to manipulate the same membrane. We show that if we consider such a P system $Π$ and its terminating computation $\cal C$, then we can compute the result of $\cal C$ by setting a polynomial upper bound on the content of each region in $\cal C$.
Trust-Based Cloud Machine Learning Model Selection For Industrial IoT and Smart City Services
Venue: arXiv cs.LG 2020
Year: 2020

With Machine Learning (ML) services now used in a number of mission-critical human-facing domains, ensuring the integrity and trustworthiness of ML models becomes all-important. In this work, we consider the paradigm where cloud service providers collect big data from resource-constrained devices for building ML-based prediction models that are then sent back to be run locally on the intermittently-connected resource-constrained devices. Our proposed solution comprises an intelligent polynomial-time heuristic that maximizes the level of trust of ML models by selecting and switching between a subset of the ML models from a superset of models in order to maximize the trustworthiness while respecting the given reconfiguration budget/rate and reducing the cloud communication overhead. We evaluate the performance of our proposed heuristic using two case studies. First, we consider Industrial IoT (IIoT) services, and as a proxy for this setting, we use the turbofan engine degradation simulation dataset to predict the remaining useful life of an engine. Our results in this setting show that the trust level of the selected models is 0.49% to 3.17% less compared to the results obtained using Integer Linear Programming (ILP). Second, we consider Smart Cities services, and as a proxy of this setting, we use an experimental transportation dataset to predict the number of cars. Our results show that the selected model's trust level is 0.7% to 2.53% less compared to the results obtained using ILP. We also show that our proposed heuristic achieves an optimal competitive ratio in a polynomial-time approximation scheme for the problem.
Effects of Voice-Based Synthetic Assistant on Performance of Emergency Care Provider in Training
Venue: arXiv cs.CY 2020
Year: 2020

As part of a perennial project, our team is actively engaged in developing new synthetic assistant (SA) technologies to assist in training combat medics and medical first responders. It is critical that medical first responders are well trained to deal with emergencies more effectively. This would require real-time monitoring and feedback for each trainee. Therefore, we introduced a voice-based SA to augment the training process of medical first responders and enhance their performance in the field. The potential benefits of SAs include a reduction in training costs and enhanced monitoring mechanisms. Despite the increased usage of voice-based personal assistants (PAs) in day-to-day life, the associated effects are commonly neglected for a study of human factors. Therefore, this paper focuses on performance analysis of the developed voice-based SA in emergency care provider training for a selected emergency treatment scenario. The research discussed in this paper follows design science in developing proposed technology; at length, we discussed architecture and development and presented working results of voice-based SA. The empirical testing was conducted on two groups as user studies using statistical analysis tools, one trained with conventional methods and the other with the help of SA. The statistical results demonstrated the amplification in training efficacy and performance of medical responders powered by SA. Furthermore, the paper also discusses the accuracy and time of task execution (t) and concludes with the guidelines for resolving the identified problems.
Enhanced Secrecy Rate Maximization for Directional Modulation Networks via IRS
Venue: arXiv cs.IT 2020
Year: 2020

Intelligent reflecting surface (IRS) is of low-cost and energy-efficiency and will be a promising technology for the future wireless communications like sixth generation. To address the problem of conventional directional modulation (DM) that Alice only transmits single confidential bit stream (CBS) to Bob with multiple antennas in a line-of-sight channel, IRS is proposed to create friendly multipaths for DM such that two CBSs can be transmitted from Alice to Bob. This will significantly enhance the secrecy rate (SR) of DM. To maximize the SR (Max-SR), a general non-convex optimization problem is formulated with the unit-modulus constraint of IRS phase-shift matrix (PSM), and the general alternating iterative (GAI) algorithm is proposed to jointly obtain the transmit beamforming vectors (TBVs) and PSM by alternately optimizing one and fixing another. To reduce its high complexity, a low-complexity iterative algorithm for Max-SR is proposed by placing the constraint of null-space (NS) on the TBVs, called NS projection (NSP). Here, each CBS is transmitted separately in the NSs of other CBS and AN channels. Simulation results show that the SRs of the proposed GAI and NSP can approximately double that of IRS-based DM with single CBS for massive IRS in the high signal-to-noise ratio region.