OpenRaiser/Intern-Atlas huggingface dataset:
Can Predominant Credible Information Suppress Misinformation in Crises? Empirical Studies of Tweets Related to Prevention Measures during COVID-19
Venue: arXiv cs.SI 2021
Year: 2021

During COVID-19, misinformation on social media affects the adoption of appropriate prevention behaviors. It is urgent to suppress the misinformation to prevent negative public health consequences. Although an array of studies has proposed misinformation suppression strategies, few have investigated the role of predominant credible information during crises. None has examined its effect quantitatively using longitudinal social media data. Therefore, this research investigates the temporal correlations between credible information and misinformation, and whether predominant credible information can suppress misinformation for two prevention measures (i.e. topics), i.e. wearing masks and social distancing using tweets collected from February 15 to June 30, 2020. We trained Support Vector Machine classifiers to retrieve relevant tweets and classify tweets containing credible information and misinformation for each topic. Based on cross-correlation analyses of credible and misinformation time series for both topics, we find that the previously predominant credible information can lead to the decrease of misinformation (i.e. suppression) with a time lag. The research findings provide empirical evidence for suppressing misinformation with credible information in complex online environments and suggest practical strategies for future information management during crises and emergencies.
Cloud Computing Concept and Roots
Venue: arXiv cs.DC 2021
Year: 2021

Cloud computing is a particular implementation of distributed computing. It inherited many properties of distributed computing such as scalability, reliability and distribution transparency. The transparency middle layer abstracts the underlying platform away from the end user. Virtualization technology is the foundation of Cloud computing. Virtual machine provides abstraction of the physical server resources and securely isolates different users in multi-tenant environment. To the Cloud services consumer, all the computing power and resources are accessed through high speed internet access by client platforms. This eliminates the cost to build and maintain local data center. Resource pooling and rapid elasticity are the main characters of Cloud computing. The scalability of Cloud computing comes from resources which can span multiple data centers and geographic regions. There is virtually no limitation on the amount of resources available from Cloud. New processing and storage resources can be added into the Cloud resource pool seamlessly.
Inferring spatial relations from textual descriptions of images
Venue: arXiv cs.AI 2021
Year: 2021

Generating an image from its textual description requires both a certain level of language understanding and common sense knowledge about the spatial relations of the physical entities being described. In this work, we focus on inferring the spatial relation between entities, a key step in the process of composing scenes based on text. More specifically, given a caption containing a mention to a subject and the location and size of the bounding box of that subject, our goal is to predict the location and size of an object mentioned in the caption. Previous work did not use the caption text information, but a manually provided relation holding between the subject and the object. In fact, the used evaluation datasets contain manually annotated ontological triplets but no captions, making the exercise unrealistic: a manual step was required; and systems did not leverage the richer information in captions. Here we present a system that uses the full caption, and Relations in Captions (REC-COCO), a dataset derived from MS-COCO which allows to evaluate spatial relation inference from captions directly. Our experiments show that: (1) it is possible to infer the size and location of an object with respect to a given subject directly from the caption; (2) the use of full text allows to place the object better than using a manually annotated relation. Our work paves the way for systems that, given a caption, decide which entities need to be depicted and their respective location and sizes, in order to then generate the final image.
Optimized Energy Efficient Virtualization and Content Caching in 5G Networks
Venue: arXiv cs.NI 2021
Year: 2021

Network function virtualization (NFV) and content caching are two promising technologies that hold great potential for network operators and designers. This paper optimizes the deployment of NFV and content caching in 5G networks and focuses on the associated power consumption savings. In addition, it introduces an approach to combine content caching with NFV in one integrated architecture for energy aware 5G networks. A mixed integer linear programming (MILP) model has been developed to minimize the total power consumption by jointly optimizing the cache size, virtual machine (VM) workload, and the locations of both cache nodes and VMs. The results were investigated under the impact of core network virtual machines (CNVMs) inter-traffic. The result show that the optical line terminal (OLT) access network nodes are the optimum location for content caching and for hosting VMs during busy times of the day whilst IP over WDM core network nodes are the optimum locations for caching and VM placement during off-peak time. Furthermore, the results reveal that a virtualization-only approach is better than a caching-only approach for video streaming services where the virtualization-only approach compared to caching-only approach, achieves a maximum power saving of 7% (average 5%) when no CNVMs inter-traffic is considered and 6% (average 4%) with CNVMs inter-traffic at 10% of the total backhaul traffic. On the other hand, the integrated approach has a maximum power saving of 15% (average 9%) with and without CNVMs inter-traffic compared to the virtualization-only approach, and it achieves a maximum power saving of 21% (average 13%) without CNVMs inter-traffic and 20% (average 12%) when CNVMs inter-traffic is considered compared with the caching-only approach. In order to validate the MILP models and achieve real-time operation in our approaches, a heuristic was developed.
Measuring and Improving Consistency in Pretrained Language Models
Venue: arXiv cs.CL 2021
Year: 2021

Consistency of a model -- that is, the invariance of its behavior under meaning-preserving alternations in its input -- is a highly desirable property in natural language processing. In this paper we study the question: Are Pretrained Language Models (PLMs) consistent with respect to factual knowledge? To this end, we create ParaRel, a high-quality resource of cloze-style query English paraphrases. It contains a total of 328 paraphrases for 38 relations. Using ParaRel, we show that the consistency of all PLMs we experiment with is poor -- though with high variance between relations. Our analysis of the representational spaces of PLMs suggests that they have a poor structure and are currently not suitable for representing knowledge robustly. Finally, we propose a method for improving model consistency and experimentally demonstrate its effectiveness.
SJ_AJ@DravidianLangTech-EACL2021: Task-Adaptive Pre-Training of Multilingual BERT models for Offensive Language Identification
Venue: arXiv cs.CL 2021
Year: 2021

In this paper we present our submission for the EACL 2021-Shared Task on Offensive Language Identification in Dravidian languages. Our final system is an ensemble of mBERT and XLM-RoBERTa models which leverage task-adaptive pre-training of multilingual BERT models with a masked language modeling objective. Our system was ranked 1st for Kannada, 2nd for Malayalam and 3rd for Tamil.
Moment Generating Function of the AoI in Multi-Source Systems with Computation-Intensive Status Updates
Venue: arXiv cs.IT 2021
Year: 2021

We consider a multi-source status update system in which status updates are transmitted as packets containing the measured value of the monitored process and a time stamp representing the time when the sample was generated. The packets of each source are generated according to the Poisson process and the packets are served according to an exponentially distributed service time. We assume that the received status update packets needs further processing before being used (hence, computation-intensive). This is mathematically modeled by introducing an additional server at the sink node. The sink server serves the packets according to an exponentially distributed service time. We introduce two packet management policies, namely, i) a preemptive policy and ii) a blocking policy and derive the moment generating function (MGF) of the AoI of each source under both policies. In the preemptive policy, a new arriving packet preempts any possible packet that is currently under service regardless of the packet's source index. In the blocking policy, when a server is busy at the arrival instant of a packet the arriving packet is blocked and cleared. We assume that the same preemptive/blocking policy is employed in both transmitter and sink servers. Numerical results are provided to assess the results.
Deep Music Information Dynamics
Venue: arXiv cs.SD 2021
Year: 2021

Music comprises of a set of complex simultaneous events organized in time. In this paper we introduce a novel framework that we call Deep Musical Information Dynamics, which combines two parallel streams - a low rate latent representation stream that is assumed to capture the dynamics of a thought process contrasted with a higher rate information dynamics derived from the musical data itself. Motivated by rate-distortion theories of human cognition we propose a framework for exploring possible relations between imaginary anticipations existing in the listener's mind and information dynamics of the musical surface itself. This model is demonstrated for the case of symbolic (MIDI) data, as accounting for acoustic surface would require many more layers to capture instrument properties and performance expressive inflections. The mathematical framework is based on variational encoding that first establishes a high rate representation of the musical observations, which is then reduced using a bit-allocation method into a parallel low rate data stream. The combined loss considered here includes both the information rate in terms of time evolution for each stream, and the fidelity of encoding measured in terms of mutual information between the high and low rate representations. In the simulations presented in the paper we are able to juxtapose aspects of latent/imaginary surprisal versus surprisal of the music surface in a manner that is quantifiable and computationally tractable. The set of computational tools is discussed in the paper, suggesting that a trade off between compression and prediction are an important factor in the analysis and design of time-based music generative models.
Real-time Prediction for Mechanical Ventilation in COVID-19 Patients using A Multi-task Gaussian Process Multi-objective Self-attention Network
Venue: arXiv cs.LG 2021
Year: 2021

We propose a robust in-time predictor for in-hospital COVID-19 patient's probability of requiring mechanical ventilation. A challenge in the risk prediction for COVID-19 patients lies in the great variability and irregular sampling of patient's vitals and labs observed in the clinical setting. Existing methods have strong limitations in handling time-dependent features' complex dynamics, either oversimplifying temporal data with summary statistics that lose information or over-engineering features that lead to less robust outcomes. We propose a novel in-time risk trajectory predictive model to handle the irregular sampling rate in the data, which follows the dynamics of risk of performing mechanical ventilation for individual patients. The model incorporates the Multi-task Gaussian Process using observed values to learn the posterior joint multi-variant conditional probability and infer the missing values on a unified time grid. The temporal imputed data is fed into a multi-objective self-attention network for the prediction task. A novel positional encoding layer is proposed and added to the network for producing in-time predictions. The positional layer outputs a risk score at each user-defined time point during the entire hospital stay of an inpatient. We frame the prediction task into a multi-objective learning framework, and the risk scores at all time points are optimized altogether, which adds robustness and consistency to the risk score trajectory prediction. Our experimental evaluation on a large database with nationwide in-hospital patients with COVID-19 also demonstrates that it improved the state-of-the-art performance in terms of AUC (Area Under the receiver operating characteristic Curve) and AUPRC (Area Under the Precision-Recall Curve) performance metrics, especially at early times after hospital admission.
A comparative study of Bot Detection techniques methods with an application related to Covid-19 discourse on Twitter
Venue: arXiv cs.SI 2021
Year: 2021

Bot Detection is an essential asset in a period where Online Social Networks(OSN) is a part of our lives. This task becomes more relevant in crises, as the Covid-19 pandemic, where there is an incipient risk of proliferation of social bots, producing a possible source of misinformation. In order to address this issue, it has been compared different methods to detect automatically social bots on Twitter using Data Selection. The techniques utilized to elaborate the bot detection models include the utilization of features as the tweets metadata or the Digital Fingerprint of the Twitter accounts. In addition, it was analyzed the presence of bots in tweets from different periods of the first months of the Covid-19 pandemic, using the bot detection technique which best fits the scope of the task. Moreover, this work includes also analysis over aspects regarding the discourse of bots and humans, such as sentiment or hashtag utilization.
Temporal CSI Correlation in Mixed RF/FSO Cooperative Relaying Systems Under Joint Effects of HPA Nonlinearities and IQ Imbalance
Venue: arXiv cs.IT 2021
Year: 2021

In this paper, we present the performance analysis of mixed RF/FSO system with multiple relays. To select the best relay, we adopt partial relay selection with outdated CSI wherein we investigate the effect of the temporal correlation of the channels. Unlike the vast majority of work, we introduce the impairments to the relays and the destination and we compare the performance against conventional RF relaying systems. We further derive the expressions of the outage probability and the ergodic capacity as well as the bounds to unpack engineering insights into the system robustness.
Disaggregation for Energy Efficient Fog in Future 6G Networks
Venue: arXiv cs.NI 2021
Year: 2021

We study the benefits of adopting server disaggregation in the fog computing tier by evaluating energy efficient placement of interactive apps in a future fog 6G network. Using a mixed integer linear programming (MILP) model, we compare the adoption of traditional server (TS) and disaggregated server (DS) architectures in a fog network comprising of selected fog computing sites in the metro and access networks. Relative to the use of TSs, our results show that the adoption of DS improves the energy efficiency of the fog network and enables up to 18% reduction in total fog computing power consumption. More instances of interactive fog apps are provisioned in a fog network that is implemented over a network topology with high delay penalty. This ensures that minimal delay is experienced by distributed users. Our result also shows that the proximity of fog computing sites such as metro-central offices and radio cell sites to geo-distributed users of interactive fog applications make them important edge locations for provisioning moderately delay sensitive fog apps. However, fog applications with more stringent delay thresholds require in situ processing at directly connected radio cell sites or at the location of the requesting users. Finally, we propose a heuristic for energy efficient and delay aware placement of interactive fog apps in a fog network which replicates the trends observed during comprehensive analysis of the exact results obtained by solving the MILP model formulated in this paper. Our results and proposed MILP and heuristic provide a good reference and tool for fog network design and deployment.
Soliciting Stakeholders' Fairness Notions in Child Maltreatment Predictive Systems
Venue: arXiv cs.HC 2021
Year: 2021

Recent work in fair machine learning has proposed dozens of technical definitions of algorithmic fairness and methods for enforcing these definitions. However, we still lack an understanding of how to develop machine learning systems with fairness criteria that reflect relevant stakeholders' nuanced viewpoints in real-world contexts. To address this gap, we propose a framework for eliciting stakeholders' subjective fairness notions. Combining a user interface that allows stakeholders to examine the data and the algorithm's predictions with an interview protocol to probe stakeholders' thoughts while they are interacting with the interface, we can identify stakeholders' fairness beliefs and principles. We conduct a user study to evaluate our framework in the setting of a child maltreatment predictive system. Our evaluations show that the framework allows stakeholders to comprehensively convey their fairness viewpoints. We also discuss how our results can inform the design of predictive systems.
MPC path-planner for autonomous driving solved by genetic algorithm technique
Venue: arXiv cs.RO 2021
Year: 2021

Autonomous vehicle's technology is expected to be disruptive for automotive industry in next years. This paper proposes a novel real-time trajectory planner based on a Nonlinear Model Predictive Control (NMPC) algorithm. A nonlinear single track vehicle model with Pacejka's lateral tyre formulas has been implemented. The numerical solution of the NMPC problem is obtained by means of the implementation of a novel genetic algorithm strategy. Numerical results are discussed through simulations that shown a reasonable behavior of the proposed strategy in presence of static or moving obstacles as well as in a wide rage of road friction conditions. Moreover a real-time implementation is made possible by the reported computational time analysis.
Kinova Gen3-Lite manipulator inverse kinematics: optimal polynomial solution
Venue: arXiv cs.RO 2021
Year: 2021

A polynomial solution to the inverse kinematic problem of the Kinova Gen3 Lite robot is proposed in this paper. This serial robot is based on a 6R kinematic chain and is not wrist-partitioned. We first start from the forward kinematics equation providing the position and orientation of the end-effector, finally, the univariate polynomial equation is given as a function of the first joint variable $θ_{1}$. The remaining joint variables are computed by back substitution. Thus, an unique set of joint position is obtain for each root of the univariate equation. Numerical examples, simulated in ROS (Robot Operating System), are given to validate the results, which are compared to the coordinates obtained with MoveIt! and with the actual robot. A procedure to choose an optimum posture of the robot is also proposed.
Joint Active and Passive Beamforming Design for IRS-Assisted Multi-User MIMO Systems: A VAMP-Based Approach
Venue: arXiv cs.IT 2021
Year: 2021

This paper tackles the problem of joint active and passive beamforming optimization for an intelligent reflective surface (IRS)-assisted multi-user downlink multiple-input multiple-output (MIMO) communication system. We aim to maximize spectral efficiency of the users by minimizing the mean square error (MSE) of the received symbol. For this, a joint optimization problem is formulated under the minimum mean square error (MMSE) criterion. First, block coordinate descent (BCD) is used to decouple the joint optimization into two sub-optimization problems to separately find the optimal active precoder at the base station (BS) and the optimal matrix of phase shifters for the IRS. While the MMSE active precoder is obtained in a closed form, the optimal phase shifters are found iteratively using a modified version (also introduced in this paper) of the vector approximate message passing (VAMP) algorithm. We solve the joint optimization problem for two different models for IRS phase shifts. First, we determine the optimal phase matrix under a unimodular constraint on the reflection coefficients, and then under the constraint when the IRS reflection coefficients are modeled by a reactive load, thereby validating the robustness of the proposed solution. Numerical results are presented to illustrate the performance of the proposed method using multiple channel configurations. The results validate the superiority of the proposed solution as it achieves higher throughput compared to state-of-the-art techniques.
NBSearch: Semantic Search and Visual Exploration of Computational Notebooks
Venue: arXiv cs.HC 2021
Year: 2021

Code search is an important and frequent activity for developers using computational notebooks (e.g., Jupyter). The flexibility of notebooks brings challenges for effective code search, where classic search interfaces for traditional software code may be limited. In this paper, we propose, NBSearch, a novel system that supports semantic code search in notebook collections and interactive visual exploration of search results. NBSearch leverages advanced machine learning models to enable natural language search queries and intuitive visualizations to present complicated intra- and inter-notebook relationships in the returned results. We developed NBSearch through an iterative participatory design process with two experts from a large software company. We evaluated the models with a series of experiments and the whole system with a controlled user study. The results indicate the feasibility of our analytical pipeline and the effectiveness of NBSearch to support code search in large notebook collections.
Hardware-efficient Residual Networks for FPGAs
Venue: arXiv cs.CV 2021
Year: 2021

Residual networks (ResNets) employ skip connections in their networks -- reusing activations from previous layers -- to improve training convergence, but these skip connections create challenges for hardware implementations of ResNets. The hardware must either wait for skip connections to be processed before processing more incoming data or buffer them elsewhere. Without skip connections, ResNets would be more hardware-efficient. Thus, we present the teacher-student learning method to gradually prune away all of a ResNet's skip connections, constructing a network we call NonResNet. We show that when implemented for FPGAs, NonResNet decreases ResNet's BRAM utilization by 9% and LUT utilization by 3% and increases throughput by 5%.