Miracle-dz/UniFAR-FTUs huggingface dataset:
Continuous quantum error correction for evolution under time-dependent Hamiltonians

We develop a protocol for continuous operation of a quantum error correcting code for protection of coherent evolution due to an encoded Hamiltonian against environmental errors, using the three qubit bit flip code and bit flip errors as a canonical example. To detect errors in real time, we filter the output signals from continuous measurement of the error syndrome operators and use a double thresholding protocol for error diagnosis, while correction of errors is done as in the conventional operation. We optimize our continuous operation protocol for evolution under quantum memory and under quantum annealing, by maximizing the fidelity between the target and actual logical states at a specified final time. In the case of quantum memory we show that our continuous operation protocol yields a logical error rate that is slightly larger than the one obtained from using the optimal Wonham filter for error diagnosis. The advantage of our protocol is that it can be simpler to implement. For quantum annealing, we show that our continuous quantum error correction protocol can significantly reduce the final logical state infidelity when the continuous measurements are sufficiently strong relative to the strength of the time-dependent Hamiltonian, and that it can also significantly reduces the run time relative to that of a classical encoding. These results suggest that a continuous implementation is suitable for quantum error correction in the presence of encoded time-dependent Hamiltonians, opening the possibility of many applications in quantum simulation and quantum annealing.
Utilizing Deep Learning to Identify Drug Use on Twitter Data

The collection and examination of social media has become a useful mechanism for studying the mental activity and behavior tendencies of users. Through the analysis of collected Twitter data, models were developed for classifying drug-related tweets. Using topic pertaining keywords, such as slang and methods of drug consumption, a set of tweets was generated. Potential candidates were then preprocessed resulting in a dataset of 3,696,150 rows. The classification power of multiple methods was compared including support vector machines (SVM), XGBoost, and convolutional neural network (CNN) based classifiers. Rather than simple feature or attribute analysis, a deep learning approach was implemented to screen and analyze the tweets' semantic meaning. The two CNN-based classifiers presented the best result when compared against other methodologies. The first was trained with 2,661 manually labeled samples, while the other included synthetically generated tweets culminating in 12,142 samples. The accuracy scores were 76.35% and 82.31%, with an AUC of 0.90 and 0.91. Additionally, association rule mining showed that commonly mentioned drugs had a level of correspondence with frequently used illicit substances, proving the practical usefulness of the system. Lastly, the synthetically generated set provided increased scores, improving the classification capability and proving the worth of this methodology.
Covid-19 Tweeting in English: Gender Differences

At the start of 2020, COVID-19 became the most urgent threat to global public health. Uniquely in recent times, governments have imposed partly voluntary, partly compulsory restrictions on the population to slow the spread of the virus. In this context, public attitudes and behaviors are vitally important for reducing the death rate. Analyzing tweets about the disease may therefore give insights into public reactions that may help guide public information campaigns. This article analyses 3,038,026 English tweets about COVID-19 from March 10 to 23, 2020. It focuses on one relevant aspect of public reaction: gender differences. The results show that females are more likely to tweet about the virus in the context of family, social distancing and healthcare whereas males are more likely to tweet about sports cancellations, the global spread of the virus and political reactions. Thus, women seem to be taking a disproportionate share of the responsibility for directly keeping the population safe. The detailed results may be useful to inform public information announcements and to help understand the spread of the virus. For example, failure to impose a sporting bans whilst encouraging social distancing may send mixed messages to males.
NVMe and PCIe SSD Monitoring in Hyperscale Data Centers

With low latency, high throughput and enterprise-grade reliability, SSDs have become the de-facto choice for storage in the data center. As a result, SSDs are used in all online data stores in LinkedIn. These apps persist and serve critical user data and have millisecond latencies. For the hosts serving these applications, SSD faults are the single largest cause of failure. Frequent SSD failures result in significant downtime for critical applications. They also generate a significant downstream RCA (Root Cause Analysis) load for systems operations teams. A lack of insight into the runtime characteristics of these drives results in limited ability to provide accurate RCAs for such issues and hinders the ability to provide credible, long term fixes to such issues. In this paper we describe the system developed at LinkedIn to facilitate the real-time monitoring of SSDs and the insights we gained into failure characteristics. We describe how we used that insight to perform predictive maintenance and present the resulting reduction of man-hours spent on maintenance.
AutoFIS: Automatic Feature Interaction Selection in Factorization Models for Click-Through Rate Prediction

Learning feature interactions is crucial for click-through rate (CTR) prediction in recommender systems. In most existing deep learning models, feature interactions are either manually designed or simply enumerated. However, enumerating all feature interactions brings large memory and computation cost. Even worse, useless interactions may introduce noise and complicate the training process. In this work, we propose a two-stage algorithm called Automatic Feature Interaction Selection (AutoFIS). AutoFIS can automatically identify important feature interactions for factorization models with computational cost just equivalent to training the target model to convergence. In the search stage, instead of searching over a discrete set of candidate feature interactions, we relax the choices to be continuous by introducing the architecture parameters. By implementing a regularized optimizer over the architecture parameters, the model can automatically identify and remove the redundant feature interactions during the training process of the model. In the re-train stage, we keep the architecture parameters serving as an attention unit to further boost the performance. Offline experiments on three large-scale datasets (two public benchmarks, one private) demonstrate that AutoFIS can significantly improve various FM based models. AutoFIS has been deployed onto the training platform of Huawei App Store recommendation service, where a 10-day online A/B test demonstrated that AutoFIS improved the DeepFM model by 20.3% and 20.1% in terms of CTR and CVR respectively.
Learning to Play Soccer by Reinforcement and Applying Sim-to-Real to Compete in the Real World

This work presents an application of Reinforcement Learning (RL) for the complete control of real soccer robots of the IEEE Very Small Size Soccer (VSSS), a traditional league in the Latin American Robotics Competition (LARC). In the VSSS league, two teams of three small robots play against each other. We propose a simulated environment in which continuous or discrete control policies can be trained, and a Sim-to-Real method to allow using the obtained policies to control a robot in the real world. The results show that the learned policies display a broad repertoire of behaviors that are difficult to specify by hand. This approach, called VSSS-RL, was able to beat the human-designed policy for the striker of the team ranked 3rd place in the 2018 LARC, in 1-vs-1 matches.
Aerial Imagery based LIDAR Localization for Autonomous Vehicles

This paper presents a localization technique using aerial imagery maps and LIDAR based ground reflectivity for autonomous vehicles in urban environments. Traditional localization techniques using LIDAR reflectivity rely on high definition reflectivity maps generated from a mapping vehicle. The cost and effort required to maintain such prior maps are generally very high because it requires a fleet of expensive mapping vehicles. In this work we propose a localization technique where the vehicle localizes using aerial/satellite imagery, eradicating the need to develop and maintain complex high-definition maps. The proposed technique has been tested on a real world dataset collected from a test track in Ann Arbor, Michigan. This research concludes that aerial imagery based maps provides real-time localization performance similar to state-of-the-art LIDAR based maps for autonomous vehicles in urban environments at reduced costs.
Cloud Identification from All-sky Camera Data with Machine Learning

Most ground-based observatories are equipped with wide-angle all-sky cameras to monitor the night sky conditions. Such camera systems can be used to provide an early warning of incoming clouds that can pose a danger to the telescope equipment through precipitation, as well as for sky quality monitoring. We investigate the use of different machine-learning approaches for automating the identification of mostly opaque clouds in all-sky camera data as a cloud warning system. In a deep-learning approach, we train a residual neural network (ResNet) on pre-labeled camera images. Our second approach extracts relevant and localized image features from camera images and uses these data to train a gradient-boosted tree-based model (lightGBM). We train both model approaches on a set of roughly 2000 images taken by the all-sky camera located at Lowell Observatory’s Discovery Channel Telescope, in which the presence of clouds has been labeled manually. The ResNet approach reaches an accuracy of 85% in detecting clouds in a given region of an image, but requires a significant amount of computing resources. Our lightGBM approach achieves an accuracy of 95% with a training sample of ∼1000 images and rather modest computing resources. Based on different performance metrics, we recommend the latter feature-based approach for automated cloud detection. Code that was built for this work is available online.
Which papers cited which tweets? An empirical analysis based on Scopus data

Many altmetric studies analyze which papers were mentioned how often in specific altmetrics sources. In order to study the potential policy relevance of tweets from another perspective, we investigate which tweets were cited in papers. If many tweets were cited in publications, this might demonstrate that tweets have substantial and useful content. Overall, a rather low number of tweets (n=5506) were cited by less than 3000 papers. Most tweets do not seem to be cited because of any cognitive influence they might have had on studies; they rather were study objects. Most of the papers citing tweets are from the subject areas Social Sciences, Arts and Humanities, and Computer Sciences. Most of the papers cited only one tweet. Up to 55 tweets cited in a single paper were found. This research-in-progress does not support a high policy-relevance of tweets. However, a content analysis of the tweets and/or papers might lead to a more detailed conclusion.
Towards Patient Record Summarization Through Joint Phenotype Learning in HIV Patients

Identifying a patient's key problems over time is a common task for providers at the point care, yet a complex and time-consuming activity given current electric health records. To enable a problem-oriented summarizer to identify a patient's comprehensive list of problems and their salience, we propose an unsupervised phenotyping approach that jointly learns a large number of phenotypes/problems across structured and unstructured data. To identify the appropriate granularity of the learned phenotypes, the model is trained on a target patient population of the same clinic. To enable the content organization of a problem-oriented summarizer, the model identifies phenotype relatedness as well. The model leverages a correlated-mixed membership approach with variational inference applied to heterogenous clinical data. In this paper, we focus our experiments on assessing the learned phenotypes and their relatedness as learned from a specific patient population. We ground our experiments in phenotyping patients from an HIV clinic in a large urban care institution (n=7,523), where patients have voluminous, longitudinal documentation, and where providers would benefit from summaries of these patient's medical histories, whether about their HIV or any comorbidities. We find that the learned phenotypes and their relatedness are clinically valid when assessed qualitatively by clinical experts, and that the model surpasses baseline in inferring phenotype-relatedness when comparing to existing expert-curated condition groupings.
Probabilistic forecasting approaches for extreme NO2 episodes: a comparison of models

High concentration episodes for NO$_2$ are increasingly dealt with by authorities through traffic restrictions which are activated when air quality deteriorates beyond certain thresholds. Foreseeing the probability that pollutant concentrations reach those thresholds becomes thus a necessity. Probabilistic forecasting is a family of techniques that allow for the prediction of the expected distribution function instead of a single value. In the case of NO$_2$, it allows for the calculation of future chances of exceeding thresholds and to detect pollution peaks. We thoroughly compared 10 state of the art probabilistic predictive models, using them to predict the distribution of NO$_2$ concentrations in a urban location for a set of forecasting horizons (up to 60 hours). Quantile gradient boosted trees shows the best performance, yielding the best results for both the expected value and the forecast full distribution. Furthermore, we show how this approach can be used to detect pollution peaks.
Qualitative analysis of Biology exams in primary school conducted in 2008.

Prirodoslovna pismenost definira se kao sposobnost koristenja prirodoslovnog znanja, prepoznavanja pitanja i izvođenja zakljucaka temeljenih na dokazima radi razumijevanja i lakseg donosenja odluka o prirodnom svijetu i promjenama koje u njemu izaziva ljudska aktivnost. Osnovni cilj biologije kao prirodoslovne discipline je razvijati kod ucenika prirodoslovnu pismenost i uz nju specificnu biolosku pismenost u okviru razvoja bioloske kompetencije. U skladu s dokumentima Vlade i MZOS-a donesena je Strategija vanjskog vrednovanja obrazovnih postignuca ucenika osmih razreda. Na osnovu strategije nacionalnih ispita postavljen je cilj nacionalnih ispita: provjeriti obrazovna postignuca misleci time na sposobnosti rjesavanja problemskih interdisciplinarnih zadataka i kompetencije u ucenju istraživanjem i otkrivanjem, te donosenju zakljucaka na temelju istraživanja.
Connecting heterogeneous quantum networks by hybrid entanglement swapping

A hybrid entanglement swapping protocol enables the connection of quantum nodes with different optical encodings. Recent advances in quantum technologies are rapidly stimulating the building of quantum networks. With the parallel development of multiple physical platforms and different types of encodings, a challenge for present and future networks is to uphold a heterogeneous structure for full functionality and therefore support modular systems that are not necessarily compatible with one another. Central to this endeavor is the capability to distribute and interconnect optical entangled states relying on different discrete and continuous quantum variables. Here, we report an entanglement swapping protocol connecting such entangled states. We generate single-photon entanglement and hybrid entanglement between particle- and wave-like optical qubits and then demonstrate the heralded creation of hybrid entanglement at a distance by using a specific Bell-state measurement. This ability opens up the prospect of connecting heterogeneous nodes of a network, with the promise of increased integration and novel functionalities.
Bayesian Sparsification Methods for Deep Complex-valued Networks

With continual miniaturization ever more applications of deep learning can be found in embedded systems, where it is common to encounter data with natural complex domain representation. To this end we extend Sparse Variational Dropout to complex-valued neural networks and verify the proposed Bayesian technique by conducting a large numerical study of the performance-compression trade-off of C-valued networks on two tasks: image recognition on MNIST-like and CIFAR10 datasets and music transcription on MusicNet. We replicate the state-of-the-art result by Trabelsi et al. [2018] on MusicNet with a complex-valued network compressed by 50-100x at a small performance penalty.
DCDLearn: Multi-order Deep Cross-distance Learning for Vehicle Re-Identification

Vehicle re-identification (Re-ID) has become a popular research topic owing to its practicability in intelligent transportation systems. Vehicle Re-ID suffers the numerous challenges caused by drastic variation in illumination, occlusions, background, resolutions, viewing angles, and so on. To address it, this paper formulates a multi-order deep cross-distance learning (\textbf{DCDLearn}) model for vehicle re-identification, where an efficient one-view CycleGAN model is developed to alleviate exhaustive and enumerative cross-camera matching problem in previous works and smooth the domain discrepancy of cross cameras. Specially, we treat the transferred images and the reconstructed images generated by one-view CycleGAN as multi-order augmented data for deep cross-distance learning, where the cross distances of multi-order image set with distinct identities are learned by optimizing an objective function with multi-order augmented triplet loss and center loss to achieve the camera-invariance and identity-consistency. Extensive experiments on three vehicle Re-ID datasets demonstrate that the proposed method achieves significant improvement over the state-of-the-arts, especially for the small scale dataset.
Adaptive Conditional Neural Movement Primitives via Representation Sharing Between Supervised and Reinforcement Learning

Learning by Demonstration provides a sample efficient way to equip robots with complex sensorimotor skills in supervised manner. Several movement primitive representations can be used for flexible motor representation and learning. A recent state-of-the art approach is Conditional Neural Movement Primitives (CNMP) that can learn non-linear relations between environment parameters and complex multi-modal trajectories from a few expert demonstrations by forming powerful latent space representations. In this study, to improve the applicability of CNMP to changing tasks and/or environments, we couple it with a reinforcement learning agent that exploits the formed representations by the original CNMP network, and learns to generate synthetic demonstrations for further learning. This enables the CNMP network to generalize to new environments by adapting its internal representations. In the current implementation, the reinforcement learning agent is triggered when a failure in task execution is detected, and the CNMP is trained with the newly discovered demonstration (trajectory), which shares essential characteristics with the original demonstrations due to the representation sharing. As a result, the overall system increases its capacity and handle situations in scenarios where the initial CNMP network can not produce a useful trajectory. To show the validity of our proposed model, we compare our approach with original CNMP work and other movement primitives approaches. Furthermore, we presents the experimental results from the implementation of the proposed model on real robotics setups, which indicate the applicability of our approach as an effective adaptive learning by demonstration system.
On consistency and sparsity for high-dimensional functional time series with application to autoregressions

Modelling a large collection of functional time series arises in a broad spectral of real applications. Under such a scenario, not only the number of functional variables can be diverging with, or even larger than the number of temporally dependent functional observations, but each function itself is an infinite-dimensional object, posing a challenging task. In this paper, a standard three-step procedure is proposed to address such large-scale problems. To provide theoretical guarantees for the three-step procedure, we focus on multivariate stationary processes and propose a novel {\it functional stability measure} based on their spectral properties. Such stability measure facilitates the development of some useful concentration bounds on sample (auto)covariance functions, which serve as a fundamental tool for further consistency analysis, e.g., for deriving rates of convergence on the regularized estimates in high-dimensional settings. As {\it functional principal component analysis} (FPCA) is one of the key dimension reduction techniques in the first step, we also investigate the consistency properties of the relevant estimated terms under a FPCA framework. To illustrate with an important application, we consider vector functional autoregressive models and develop a regularization approach to estimate autoregressive coefficient functions under the sparsity constraint. Using our derived convergence results, we investigate the theoretical properties of the regularized estimate under high-dimensional scaling. Finally, the finite-sample performance of the proposed method is examined through both simulations and a public financial dataset.
Detailed Abundances in the Galactic Center: Evidence of a Metal-rich Alpha-enhanced Stellar Population

We present a detailed study of the composition of 20 M giants in the Galactic center with 15 of them confirmed to be in the nuclear star cluster. As a control sample we have also observed 7 M giants in the Milky Way disk with similar stellar parameters. All 27 stars are observed using the NIRSPEC spectrograph on the KECK II telescope in the K-band at a resolving power of R = 23,000. We report the first silicon abundance trends versus [Fe/H] for stars in the Galactic center. While finding a disk/bulge-like trend at subsolar metallicities, we find that [Si/Fe] is enhanced at supersolar metallicities. We speculate on possible enrichment scenarios to explain such a trend. However, the sample size is modest and the result needs to be confirmed by additional measurements of silicon and other α-elements. We also derive a new distribution of [Fe/H] and find the most metal-rich stars at [Fe/H] = +0.5 dex, confirming our earlier conclusions that the Galactic center hosts no stars with extreme chemical compositions.
Tigrinya Neural Machine Translation with Transfer Learning for Humanitarian Response

We report our experiments in building a domain-specific Tigrinya-to-English neural machine translation system. We use transfer learning from other Ge'ez script languages and report an improvement of 1.3 BLEU points over a classic neural baseline. We publish our development pipeline as an open-source library and also provide a demonstration application.