Miracle-dz/UniFAR-FTUs huggingface dataset:
Machine Learning for Predicting the Bz Magnetic Field Component From Upstream in Situ Observations of Solar Coronal Mass Ejections

Predicting the Bz magnetic field embedded within interplanetary coronal mass ejections (ICMEs), also known as the Bz problem, is a key challenge in space weather forecasting. We study the hypothesis that upstream in situ measurements of the sheath region and the first few hours of the magnetic obstacle provide sufficient information for predicting the downstream Bz component. To do so, we develop a predictive tool based on machine learning that is trained and tested on 348 ICMEs from Wind, STEREO‐A, and STEREO‐B measurements. We train the machine learning models to predict the minimum value of the Bz component and the maximum value of the total magnetic field Bt in the magnetic obstacle. To validate the tool, we let the ICMEs sweep over the spacecraft and assess how continually feeding in situ measurements into the tool improves the Bz prediction. We specifically find that the predictive tool can predict the minimum value of the Bz component in the magnetic obstacle with a mean absolute error of 3.12 nT and a Pearson correlation coefficient of 0.71 when the sheath region and the first 4 hr of the magnetic obstacle are observed. While the underlying hypothesis is unlikely to solve the Bz problem, the tool shows promise for ICMEs that have a recognizable magnetic flux rope signature. Transitioning the tool to operations could lead to improved space weather forecasting.
End-to-end Malaria Diagnosis and 3D Cell Rendering with Deep Learning

Malaria is a parasitic infection that poses a significant burden on global health. It kills one child every 30 seconds and over one million people annually. If diagnosed in a timely manner, however, most people can be effectively treated with antimalarial therapy. Several deaths due to malaria are byproducts of disparities in the social determinants of health; the current gold standard for diagnosing malaria requires microscopes, reagents, and other equipment that most patients of low socioeconomic brackets do not have access to. In this paper, we propose a convolutional neural network (CNN) architecture that allows for rapid automated diagnosis of malaria (achieving a high classification accuracy of 98%), as well as a deep neural network (DNN) based three-dimensional (3D) modeling algorithm that renders 3D models of parasitic cells in augmented reality (AR). This creates an opportunity to optimize the current workflow for malaria diagnosis and demonstrates potential for deep learning models to improve telemedicine practices and patient health literacy on a global scale.
Research on Third-Party Libraries in Android Apps: A Taxonomy and Systematic Literature Review

Third-party libraries (TPLs) have been widely used in mobile apps, which play an essential part in the entire Android ecosystem. However, TPL is a double-edged sword. On the one hand, it can ease the development of mobile apps. On the other hand, it also brings security risks such as privacy leaks or increased attack surfaces (e.g., by introducing over-privileged permissions) to mobile apps. Although there are already many studies for characterizing third-party libraries, including automated detection, security and privacy analysis of TPLs, TPL attributes analysis, etc., what strikes us odd is that there is no systematic study to summarize those studies’ endeavors. To this end, we conduct the first systematic literature review on Android TPL-related research. Following a well-defined systematic literature review protocol, we collected 74 primary research papers closely related to Android third-party library from 2012 to 2020. After carefully examining these studies, we designed a taxonomy of TPL-related research studies and conducted a systematic study to summarize current solutions, limitations, challenges and possible implications of new research directions related to third-party library analysis. We hope that these contributions can give readers a clear overview of existing TPL-related studies and inspire them to go beyond the current status quo by advancing the discipline with innovative approaches.
Reconciling high resolution climate datasets using KrigR

There is an increasing need for high spatial and temporal resolution climate data for the wide community of researchers interested in climate change and its consequences. Currently, there is a large mismatch between the spatial resolutions of global climate model and reanalysis datasets (at best around 0.25° and 0.1° respectively) and the resolutions needed by many end-users of these datasets, which are typically on the scale of 30 arcseconds (∼900 m). This need for improved spatial resolution in climate datasets has motivated several groups to statistically downscale various combinations of observational or reanalysis datasets. However, the variety of downscaling methods and inputs used makes it difficult to reconcile the resultant differences between these high-resolution datasets. Here we make use of the KrigR R-package to statistically downscale the world-leading ERA5(-Land) reanalysis data using kriging. We show that kriging can accurately recover spatial heterogeneity of climate data given strong relationships with co-variates; that by preserving the uncertainty associated with the statistical downscaling, one can investigate and account for confidence in high-resolution climate data; and that the statistical uncertainty provided by KrigR can explain much of the difference between widely used high resolution climate datasets (CHELSA, TerraClimate, and WorldClim2) depending on variable, timescale, and region. This demonstrates the advantages of using KrigR to generate customized high spatial and/or temporal resolution climate data.
Improving Similar Language Translation With Transfer Learning

We investigate transfer learning based on pre-trained neural machine translation models to translate between (low-resource) similar languages. This work is part of our contribution to the WMT 2021 Similar Languages Translation Shared Task where we submitted models for different language pairs, including French-Bambara, Spanish-Catalan, and Spanish-Portuguese in both directions. Our models for Catalan-Spanish (82.79 BLEU)and Portuguese-Spanish (87.11 BLEU) rank top 1 in the official shared task evaluation, and we are the only team to submit models for the French-Bambara pairs.
Modified Double DQN: addressing stability

Inspired by double q learning algorithm, the double DQN algorithm was originally proposed in order to address the overestimation issue in the original DQN algorithm. The double DQN has successfully shown both theoretically and empirically the importance of decoupling in terms of action evaluation and selection in computation of targets values; although, all the benefits were acquired with only a simple adaption to DQN algorithm, minimal possible change as it was mentioned by the authors. Nevertheless, there seems a roll-back in the proposed algorithm of Double-DQN since the parameters of policy network are emerged again in the target value function which were initially withdrawn by DQN with the hope of tackling the serious issue of moving targets and the instability caused by it (i.e., by moving targets) in the process of learning. Therefore, in this paper three modifications to the Double-DQN algorithm are proposed with the hope of maintaining the performance in the terms of both stability and overestimation. These modifications are focused on the logic of decoupling the best action selection and evaluation in the target value function and the logic of tackling the moving targets issue. Each of these modifications have their own pros and cons compared to the others. The mentioned pros and cons mainly refer to the execution time required for the corresponding algorithm and the stability provided by the corresponding algorithm. Also, in terms of overestimation, none of the modifications seem to underperform compared to the original Double-DQN if not outperform it. With the intention of evaluating the efficacy of the proposed modifications, multiple empirical experiments along with theoretical experiments were conducted. The results obtained are represented and discussed in this article. Keywords— Stability, Overestimation, Deep Reinforcement Learning, DQN, Double Q-learning, Double-DQN
Ecosystem for Closed Timelike Curves: An Energy Conditions Perspective

In this article, we explore the relationship between the existence of closed timelike curves and energy conditions that occur in the Kerr-Newman spacetime. To quantify the dependence, we define a correlation index between energy conditions and closed timelike curves. Based on the inputs from Hawking's chronology protection conjecture, we analyze two popular variants of Kerr-Newman spacetime: Non-commutative and Rastall Kerr-Newman spacetimes. These two models provide complementary scenarios that aid in analyzing Hawking's statements regarding the correlation of closed timelike curves and energy conditions from a local and a global perspective. We report the results outlining the possible role played by violations of energy conditions in eliminating the closed timelike curves in two contrasting situations, namely in spacetimes with and without curvature singularities.
SP EULER: Semantics-preserving Euler Diagrams

Creating comprehensible visualizations of highly overlapping set-typed data is a challenging task due to its complexity. To facilitate insights into set connectivity and to leverage semantic relations between intersections, we propose a fast two-step layout technique for Euler diagrams that are both well-matched and well-formed. Our method conforms to established form guidelines for Euler diagrams regarding semantics, aesthetics, and readability. First, we establish an initial ordering of the data, which we then use to incrementally create a planar, connected, and monotone dual graph representation. In the next step, the graph is transformed into a circular layout that maintains the semantics and yields simple Euler diagrams with smooth curves. When the data cannot be represented by simple diagrams, our algorithm always falls back to a solution that is not well-formed but still well-matched, whereas previous methods often fail to produce expected results. We show the usefulness of our method for visualizing set-typed data using examples from text analysis and infographics. Furthermore, we discuss the characteristics of our approach and evaluate our method against state-of-the-art methods.
Master Graduation Thesis: A Lightweight and Distributed Container-based Framework

Edge/Fog computing is a novel computing paradigm that provides resource-limited Internet of Things (IoT) devices with scalable computing and storage resources. Compared to cloud computing, edge/fog servers have fewer resources, but they can be accessed with higher bandwidth and less communication latency. Thus, integrating edge/fog and cloud infrastructures can support the execution of diverse latency-sensitive and computation-intensive IoT applications. Although some frameworks attempt to provide such integration, there are still several challenges to be addressed, such as dynamic scheduling of different IoT applications, scalability mechanisms, multi-platform support, and supporting different interaction models. To overcome these challenges, we propose a lightweight and distributed container-based framework, called FogBus2. It provides a mechanism for scheduling heterogeneous IoT applications and implements several scheduling policies. Also, it proposes an optimized genetic algorithm to obtain fast convergence to well-suited solutions. Besides, it offers a scalability mechanism to ensure efficient responsiveness when either the number of IoT devices increases or the resources become overburdened. Also, the dynamic resource discovery mechanism of FogBus2 assists new entities to quickly join the system. We have also developed two IoT applications, called Conway's Game of Life and Video Optical Character Recognition to demonstrate the effectiveness of FogBus2 for handling real-time and non-real-time IoT applications. Experimental results show FogBus2's scheduling policy improves the response time of IoT applications by 53\% compared to other policies. Also, the scalability mechanism can reduce up to 48\% of the queuing waiting time compared to frameworks that do not support scalability.
Knowledge Graph Augmented Political Perspective Detection in News Media

Identifying political perspective in news media has become an important task due to the rapid growth of political commentary and the increasingly polarized ideologies. Previous approaches only focus on leveraging the semantic information and leaves out the rich social and political context that helps individuals understand political stances. In this paper, we propose a perspective detection method that incorporates external knowledge of real-world politics. Speciﬁcally, we construct a contemporary political knowledge graph with 1,071 entities and 10,703 triples. We then build a heterogeneous information network for each news document that jointly models article semantics and external knowledge in knowledge graphs. Finally, we apply gated relational graph convolutional networks and conduct political perspective detection as graph-level classiﬁcation. Extensive experiments show that our method achieves the best performance and out-performs state-of-the-art methods by 5.49%. Numerous ablation studies further bear out the necessity of external knowledge and the effectiveness of our graph-based approach.
Unifying Heterogeneous Electronic Health Records Systems via Text-Based Code Embedding

Substantial increase in the use of Electronic Health Records (EHRs) has opened new frontiers for predictive healthcare. However, while EHR systems are nearly ubiquitous, they lack a unified code system for representing medical concepts. Heterogeneous formats of EHR present a substantial barrier for the training and deployment of state-of-the-art deep learning models at scale. To overcome this problem, we introduce Description-based Embedding, DescEmb, a code-agnostic description-based representation learning framework for predictive modeling on EHR. DescEmb takes advantage of the flexibility of neural language understanding models while maintaining a neutral approach that can be combined with prior frameworks for task-specific representation learning or predictive modeling. We tested our model's capacity on various experiments including prediction tasks, transfer learning and pooled learning. DescEmb shows higher performance in overall experiments compared to code-based approach, opening the door to a text-based approach in predictive healthcare research that is not constrained by EHR structure nor special domain knowledge.
BIGRoC: Boosting Image Generation via a Robust Classifier

The interest of the machine learning community in image synthesis has grown significantly in recent years, with the introduction of a wide range of deep generative models and means for training them. In this work, we propose a general model-agnostic technique for improving the image quality and the distribution fidelity of generated images obtained by any generative model. Our method, termed BIGRoC (Boosting Image Generation via a Robust Classifier), is based on a post-processing procedure via the guidance of a given robust classifier and without a need for additional training of the generative model. Given a synthesized image, we propose to update it through projected gradient steps over the robust classifier to refine its recognition. We demonstrate this post-processing algorithm on various image synthesis methods and show a significant quantitative and qualitative improvement on CIFAR-10 and ImageNet. Surprisingly, although BIGRoC is the first model agnostic among refinement approaches and requires much less information, it outperforms competitive methods. Specifically, BIGRoC improves the image synthesis best performing diffusion model on ImageNet 128x128 by 14.81%, attaining an FID score of 2.53, and on 256x256 by 7.87%, achieving an FID of 3.63. Moreover, we conduct an opinion survey, according to which humans significantly prefer our method's outputs.
Quasi-inner automorphisms of Drinfeld modular groups

Let $A$ be the set of elements in an algebraic function field $K$ over ${\mathbb F}_q$ which are integral outside a fixed place $\infty$. Let $G=GL_2(A)$ be a {\it Drinfeld modular group}. The normalizer of $G$ in $GL_2(K)$, where $K$ is the quotient field of $A$, gives rise to automorphisms of $G$, which we refer to as {\it quasi-inner}. Modulo the inner automorphisms of $G$ they form a group $Quinn(G)$ which is isomorphic to ${\mathrm Cl}(A)_2$, the $2$-torsion in the ideal class group ${\mathrm Cl}(A)$. The group $Quinn(G)$ acts on all kinds of objects associated with $G$. For example, it acts freely on the cusps and elliptic points of $G$. If ${\mathcal T}$ is the associated Bruhat-Tits tree the elements of $Quinn(G)$ induce non-trivial automorphisms of the quotient graph $G\setminus{\mathcal T}$, generalizing an earlier result of Serre. It is known that the ends of $G\setminus{\mathcal T}$ are in one-one correspondence with the cusps of $G$. Consequently $Quinn(G)$ acts freely on the ends. In addition $Quinn(G)$ acts transitively on those ends which are in one-one correspondence with the vertices of $G\setminus{\mathcal T}$ whose stabilizers are isomorphic to $GL_2({\mathbb F}_q)$.
Membership Inference Attacks on Lottery Ticket Networks

The vulnerability of the Lottery Ticket Hypothesis has not been studied from the purview of Membership Inference Attacks. Through this work, we are the first to empirically show that the lottery ticket networks are equally vulnerable to membership inference attacks. A Membership Inference Attack (MIA) is the process of determining whether a data sample belongs to a training set of a trained model or not. Membership Inference Attacks could leak critical information about the training data that can be used for targeted attacks. Recent deep learning models often have very large memory footprints and a high computational cost associated with training and drawing inferences. Lottery Ticket Hypothesis is used to prune the networks to find smaller sub-networks that at least match the performance of the original model in terms of test accuracy in a similar number of iterations. We used CIFAR-10, CIFAR-100, and ImageNet datasets to perform image classification tasks and observe that the attack accuracies are similar. We also see that the attack accuracy varies directly according to the number of classes in the dataset and the sparsity of the network. We demonstrate that these attacks are transferable across models with high accuracy.
Quantum State Tomography as a Bilevel Problem, Utilizing I-Q Plane Data

It is natural to ask how to utilize ac-tual measurements, such as the so-called IQ-plane data obtained in the dispersive readout of transmon qubits, in the estimation of the state of a quantum system. We formulate the joint problem of discrimination and quantum state tomography as a bilevel optimization problem and show how to solve it. The use of the joint problem can improve the sample complexity (or the reconstruction error for a ﬁxed number of measurements) compared with traditional techniques that decompose the problem into the discrimination and state tomography based on the estimated expectation values of certain projective measurement operators.
Safe Vessel Navigation Visually Aided by Autonomous Unmanned Aerial Vehicles in Congested Harbors and Waterways

In the maritime sector, safe vessel navigation is of great importance, particularly in congested harbors and waterways. The focus of this work is to estimate the distance between an object of interest and potential obstacles using a companion UAV. The proposed approach fuses global positioning system (GPS) data with long-range aerial images. First, we employ semantic segmentation deep neural networks (DNNs) for discriminating the vessel of interest, water, and potential solid objects using raw image data. The network is trained with both real and images generated and automatically labeled from a realistic AirSim simulation environment. Then, the distances between the extracted vessel and non-water obstacle blobs are computed using a novel ground sample distance (GSD) estimation algorithm. To the best of our knowledge, this work is the first attempt to detect and estimate distances to unknown objects from long-range visual data captured with conventional RGB cameras and auxiliary absolute positioning systems (e.g. GPS). The simulation results illustrate the accuracy and efficacy of the proposed method for visually aided navigation of vessels assisted by unmanned aerial vehicles (UAVs).
Multilingual Compositional Wikidata Questions

Semantic parsing allows humans to leverage vast knowledge resources through nat-ural interaction. However, parsers are mostly designed for and evaluated on English resources, such as CFQ (Keysers et al., 2020), the current standard benchmark based on English data generated from grammar rules and oriented towards Freebase, an outdated knowledge base. We propose a method for creating a multi-lingual, parallel dataset of question-query pairs, grounded in Wikidata, and introduce such a dataset called Compositional Wikidata Questions (CWQ). We utilize this data to train and evaluate semantic parsers for Hebrew, Kannada, Chinese and English, to better understand the current strengths and weaknesses of multilingual semantic parsing. Experiments on zero-shot cross-lingual transfer demonstrate that models fail to generate valid queries even with pretrained multilingual encoders. Our methodology, dataset and results will facilitate future research on semantic parsing in more realistic and diverse settings than has been possible with existing resources.
A Streamwise Gan Vocoder for Wideband Speech Coding at Very Low Bit Rate

Recently, GAN vocoders have seen rapid progress in speech synthesis, starting to outperform autoregressive models in perceptual quality with much higher generation speed. However, autoregressive vocoders are still the common choice for neural generation of speech signals coded at very low bit rates. In this paper, we present a GAN vocoder which is able to generate wideband speech waveforms from parameters coded at 1.6 kbit/s. The proposed model is a modified version of the StyleMelGAN vocoder that can run in frame-by-frame manner, making it suitable for streaming applications. The experimental results show that the proposed model significantly outperforms prior autoregressive vocoders like LPC-Net for very low bit rate speech coding, with computational complexity of about 5 GMACs, providing a new state of the art in this domain. Moreover, this streamwise adversarial vocoder delivers quality competitive to advanced speech codecs such as EVS at 5.9 kbit/s on clean speech, which motivates further usage of feedforward fully-convolutional models for low bit rate speech coding.