Miracle-dz/UniFAR-FTUs huggingface dataset:
FliT: a library for simple and efficient persistent algorithms

Non-volatile random access memory (NVRAM) offers byte-addressable persistence at speeds comparable to DRAM. However, with caches remaining volatile, automatic cache evictions can reorder updates to memory, potentially leaving persistent memory in an inconsistent state upon a system crash. Flush and fence instructions can be used to force ordering among updates, but are expensive. This has motivated significant work studying how to write correct and efficient persistent programs for NVRAM. In this paper, we present FliT, a C++ library that facilitates writing efficient persistent code. Using the library's default mode makes any linearizable data structure durable with minimal changes to the code. FliT avoids many redundant flush instructions by using a novel algorithm to track dirty cache lines. It also allows for extra optimizations, but achieves good performance even in its default setting. To describe the FliT library's capabilities and guarantees, we define a persistent programming interface, called the P-V Interface, which FliT implements. The P-V Interface captures the expected behavior of code in which some instructions' effects are persisted and some are not. We show that the interface captures the desired semantics of many practical algorithms in the literature. We apply the FliT library to four different persistent data structures, and show that across several workloads, persistence implementations, and data structure sizes, the FliT library always improves operation throughput, by at least 2.1X over a naive implementation in all but one workload.
What Matters in Learning from Offline Human Demonstrations for Robot Manipulation

Imitating human demonstrations is a promising approach to endow robots with various manipulation capabilities. While recent advances have been made in imitation learning and batch (offline) reinforcement learning, a lack of open-source human datasets and reproducible learning methods make assessing the state of the field difficult. In this paper, we conduct an extensive study of six offline learning algorithms for robot manipulation on five simulated and three real-world multi-stage manipulation tasks of varying complexity, and with datasets of varying quality. Our study analyzes the most critical challenges when learning from offline human data for manipulation. Based on the study, we derive a series of lessons including the sensitivity to different algorithmic design choices, the dependence on the quality of the demonstrations, and the variability based on the stopping criteria due to the different objectives in training and evaluation. We also highlight opportunities for learning from human datasets, such as the ability to learn proficient policies on challenging, multi-stage tasks beyond the scope of current reinforcement learning methods, and the ability to easily scale to natural, real-world manipulation scenarios where only raw sensory signals are available. We have open-sourced our datasets and all algorithm implementations to facilitate future research and fair comparisons in learning from human demonstration data. Codebase, datasets, trained models, and more available at https://arise-initiative.github. io/robomimic-web/
Short lived isotopes in neutron activation analysis applied to archaeological and environmental studies

The application of instrumental neutron activation analysis, principally employing short-lived isotopes, to archaeological and environmental studies is described. Techniques for the production and measurement of short-lived isotopes using a reactor facility are discussed and evaluated for a variety of sample matrices by the estimation of elemental detection limits. Cyclic activation analysis, ideally suited for the measurement of isotopes with tau½ < 60s, is considered and optimised with respect to the 'signal-to-noise' ratio of a radionuclide of interest. The potential of the technique, in the low energy photon region (< 250 keV), is demonstrated by determination of elemental sensitivities in a variety of biological materials. In an environmental study of Oxford City-Centre, the analysis of air particulates provides results for 8 time-varying elemental concentrations. Correlations are drawn between these elements, traffic flow, filter obscuration and meteorological data, also the concentrations of 5 hydrocarbons measured by gas chromatography. The suitability of thermal, epithermal and reactor neutrons is investigated for the measurement of bulk, minor and trace elements in soils. The most appropriate method is then applied to the study of variations in elemental concentration with soil depth, for the purpose of locating buried soils of archaeological significance. These results are compared with additional physical measurements performed on the soils, such as loss on ignition and particle size determination. The technique of cluster analysis is described and employed to aid interpretation of the multi-elemental results obtained. A method is devised, employing cyclic activation, for the estimation of fluorine, through the 20F isotope (tau½ ~ 11s), in a bone matrix. Corrections are applied to eliminate the interference from a fast neutron reaction of sodium. The technique is proven to be multi-elemental, more than 10 elements per biological matrix being detected. Finally, the method is discussed in relation to its potential application for the dating of ancient bone, where the multi-elemental capability is an advantage.
Solution Enumeration by Optimality in Answer Set Programming

Given a combinatorial search problem, it may be highly useful to enumerate its (all) solutions besides just finding one solution, or showing that none exists. The same can be stated about optimal solutions if an objective function is provided. This work goes beyond the bare enumeration of optimal solutions and addresses the computational task of solution enumeration by optimality (SEO). This task is studied in the context of answer set programming (ASP) where (optimal) solutions of a problem are captured with the answer sets of a logic program encoding the problem. Existing answer set solvers already support the enumeration of all (optimal) answer sets. However, in this work, we generalize the enumeration of optimal answer sets beyond strictly optimal ones, giving rise to the idea of answer set enumeration in the order of optimality (ASEO). This approach is applicable up to the best k answer sets or in an unlimited setting, which amounts to a process of sorting answer sets based on the objective function. As the main contribution of this work, we present the first general algorithms for the aforementioned tasks of answer set enumeration. Moreover, we illustrate the potential use cases of ASEO. First, we study how efficiently access to the next-best solutions can be achieved in a number of optimization problems that have been formalized and solved in ASP. Second, we show that ASEO provides us with an effective sampling technique for Bayesian networks.
Segmentation-free Heart Pathology Detection Using Deep Learning

Cardiovascular (CV) diseases are the leading cause of death in the world, and auscultation is typically an essential part of a cardiovascular examination. The ability to diagnose a patient based on their heart sounds is a rather difficult skill to master. Thus, many approaches for automated heart auscultation have been explored. However, most of the previously proposed methods involve a segmentation step, the performance of which drops significantly for high pulse rates or noisy signals. In this work, we propose a novel segmentation-free heart sound classification method. Specifically, we apply discrete wavelet transform to denoise the signal, followed by feature extraction and feature reduction. Then, Support Vector Machines and Deep Neural Networks are utilised for classification. On the PASCAL heart sound dataset our approach showed superior performance compared to others, achieving 81% and 96% precision on normal and murmur classes, respectively. In addition, for the first time, the data were further explored under a user-independent setting, where the proposed method achieved 92% and 86% precision on normal and murmur, demonstrating the potential of enabling automatic murmur detection for practical use.
Testing density functional theory in a quantum Ising chain

By using the quantum Ising chain as a test bed and treating the spin polarization along the external transverse field as the"generalized density", we examine the performance of different levels of density functional approximations parallel to those widely used for interacting electrons, such as local density approximation (LDA) and generalized gradient approximation (GGA). We show that by adding the lowest-order and nearest-neighbor density variation correction to the simple LDA, a semi-local energy functional in the spirit of GGA is almost exact over a wide range of inhomogeneous density distribution. In addition, the LDA and GGA error structures bear a high level of resemblance to the quantum phase diagram of the system. These results provide insights into the triumph and failure of these approximations in a general context.
Efficient Majority Voting in Digital Hardware

In recent years, machine learning methods became increasingly important for a manifold number of applications. However, they often suffer from high computational requirements impairing their efficient use in real-time systems, even when employing dedicated hardware accelerators. Ensemble learning methods are especially suitable for hardware acceleration since they can be constructed from individual learners of low complexity and thus offer large parallelization potential. For classification, the outputs of these learners are typically combined by majority voting, which often represents the bottleneck of a hardware accelerator for ensemble inference. In this brief, we present a novel architecture that allows obtaining a majority decision in a number of clock cycles that is logarithmic in the number of inputs. We show, that for the example application of handwritten digit recognition a random forest processing engine employing this majority decision architecture implemented on an FPGA allows the classification of more than seven million images per second, resulting in a speed-up factor of more than 29 compared to the fastest state-of-the-art implementation considered.
Real-time Geo-localization Using Satellite Imagery and Topography for Unmanned Aerial Vehicles

The capabilities of autonomous flight with unmanned aerial vehicles (UAVs) have significantly increased in recent times. However, basic problems such as fast and robust geo-localization in GPS-denied environments still remain unsolved. Existing research has primarily concentrated on improving the accuracy of localization at the cost of long and varying computation time in various situations, which often necessitates the use of powerful ground station machines. In order to make image-based geo-localization online and pragmatic for lightweight embedded systems on UAVs, we propose a framework that is reliable in changing scenes, flexible about computing resource allocation and adaptable to common camera placements. The framework is comprised of two stages: offline database preparation and online inference. At the first stage, color images and depth maps are rendered as seen from potential vehicle poses quantized over the satellite and topography maps of anticipated flying areas. A database is then populated with the global and local descriptors of the rendered images. At the second stage, for each captured real-world query image, top global matches are retrieved from the database and the vehicle pose is further refined via local descriptor matching. We present field experiments of image-based localization on two different UAV platforms to validate our results.
Photometry and Kinematics of Self-gravitating Eccentric Nuclear Disks

The Andromeda galaxy hosts an elongated nucleus with (at least) two distinct brightness peaks. The double nucleus can be explained by the projection of a thick, apsidally aligned eccentric nuclear disk of stars in orbit about the central black hole. Several nearby early-type galaxies have similar asymmetric nuclear features, indicating the possible presence of eccentric nuclear disks. We create simulated photometric (surface density) and kinematic (line-of-sight velocity) maps of eccentric nuclear disks using N-body simulations. We image our simulations from various lines of sight in order to classify them as double nuclei, offset nuclei, and centered nuclei. We explore the effects of mass segregation on the photometric maps, finding that heavier stars are concentrated in the brighter peak. The average line-of-sight velocity values are lower in an eccentric nuclear disk than for a circular ring about the supermassive black hole. The velocity dispersion values are higher and peak at the position of the supermassive black hole, which does not typically match the peak in photometry.
EVGen: Adversarial Networks for Learning Electric Vehicle Charging Loads and Hidden Representations

The nexus between transportation, the power grid, and consumer behavior is more pronounced than ever before as the race to decarbonize the transportation sector intensifies. Electrification in the transportation sector has led to technology shifts and rapid deployment of electric vehicles (EVs). The potential increase in stochastic and spatially heterogeneous charging load presents a unique challenge that is not well studied, and will have significant impacts on grid operations, emissions, and system reliability if not managed effectively. Realistic scenario generators can help operators prepare, and machine learning can be leveraged to this end. In this work, we develop generative adversarial networks (GANs) to learn distributions of electric vehicle (EV) charging sessions and disentangled representations. We show that this model structure successfully parameterizes unlabeled temporal and power patterns without supervision and is able to generate synthetic data conditioned on these parameters. We benchmark the generation capability of this model with Gaussian Mixture Models (GMMs), and empirically show that our proposed model framework is better at capturing charging distributions and temporal dynamics.
BeatNet: CRNN and Particle Filtering for Online Joint Beat, Downbeat and Meter Tracking

The online estimation of rhythmic information, such as beat positions, downbeat positions, and meter, is critical for many real-time music applications. Musical rhythm comprises complex hierarchical relationships across time, rendering its analysis intrinsically challenging and at times subjective. Furthermore, systems which attempt to estimate rhythmic information in real-time must be causal and must produce estimates quickly and efficiently. In this work, we introduce an online system for joint beat, downbeat, and meter tracking, which utilizes causal convolutional and recurrent layers, followed by a pair of sequential Monte Carlo particle filters applied during inference. The proposed system does not need to be primed with a time signature in order to perform downbeat tracking, and is instead able to estimate meter and adjust the predictions over time. Additionally, we propose an information gate strategy to significantly decrease the computational cost of particle filtering during the inference step, making the system much faster than previous sampling-based methods. Experiments on the GTZAN dataset, which is unseen during training, show that the system outperforms various online beat and downbeat tracking systems and achieves comparable performance to a baseline offline joint method.
The miniJPAS survey: Photometric redshift catalogue

MiniJPAS is a ~1 deg^2 imaging survey of the AEGIS field in 60 bands, performed to demonstrate the scientific potential of the upcoming JPAS survey. Full coverage of the 3800-9100 \AA range with 54 narrow and 6 broad optical filters allow for extremely accurate photo-z, which applied over 1000s of deg^2 will enable new applications of the photo-z technique such as measurement of baryonic acoustic oscillations. In this paper we describe the method used to obtain the photo-z included in the publicly available miniJPAS catalogue, and characterise the photo-z performance. We build 100 \AA resolution photo-spectra from the PSF-corrected forced-aperture photometry. Systematic offsets in the photometry are corrected by applying magnitude shifts obtained through iterative fitting with stellar population synthesis models. We compute photo-z with a customised version of LePhare, using a set of templates optimised for the J-PAS filter-set. We analyse the accuracy of miniJPAS photo-z and their dependence on multiple quantities using a subsample of 5,266 galaxies with spectroscopic redshifts from SDSS and DEEP, that we find to be representative of the whole r<23 miniJPAS sample. Formal uncertainties for the photo-z that are calculated with the \delta\chi^2 method underestimate the actual redshift errors. The odds parameter has the stronger correlation with |Dz|, and accurately reproduces the probability of a redshift outlier (|Dz|>0.03) irrespective of the magnitude, redshift, or spectral type of the sources. We show that the two main summary statistics characterising the photo-z accuracy for a population of galaxies (snmad and \eta) can be predicted by the distribution of odds in such population, and use this to estimate them for the whole miniJPAS sample. At r<23 there are 17,500 galaxies/deg^2 with valid photo-z estimates, of which 4,200 are expected to have |Dz|<0.003 (abridged).
The Asymptotic Frequency of Stochastic Oscillators

We study stochastic perturbations of ODE with stable limit cycles -- referred to as stochastic oscillators -- and investigate the response of the asymptotic (in time) frequency of oscillations to changing noise amplitude. Unlike previous studies, we do not restrict our attention to the small noise limit, and account for the fact that large deviation events may push the system out of its oscillatory regime. To do so, we consider stochastic oscillators conditioned on their remaining in an oscillatory regime for all time. This leads us to use the theory of quasi-ergodic measures, and to define quasi-asymptotic frequencies as conditional, long-time average frequencies. We show that quasi-asymptotic frequencies always exist, though they may or may not be observable in practice. Our discussion recovers previous results on stochastic oscillators in the literature. In particular, existing results imply that the asymptotic frequency of a stochastic oscillator depends quadratically on the noise amplitude. We describe scenarios where this prediction holds, though we also show that it is not true in general -- even for small noise.
OSCAR-Net: Object-centric Scene Graph Attention for Image Attribution

Images tell powerful stories but cannot always be trusted. Matching images back to trusted sources (attribution) enables users to make a more informed judgment of the images they encounter online. We propose a robust image hashing algorithm to perform such matching. Our hash is sensitive to manipulation of subtle, salient visual details that can substantially change the story told by an image. Yet the hash is invariant to benign transformations (changes in quality, codecs, sizes, shapes, etc.) experienced by images during online redistribution. Our key contribution is OSCAR-Net 1 (Object-centric Scene Graph Attention for Image Attribution Network); a robust image hashing model inspired by recent successes of Transformers in the visual domain. OSCAR-Net constructs a scene graph representation that attends to fine-grained changes of every object’s visual appearance and their spatial relationships. The network is trained via contrastive learning on a dataset of original and manipulated images yielding a state of the art image hash for content fingerprinting that scales to millions of images.
Spatial-Temporal Deep Intention Destination Networks for Online Travel Planning

Nowadays, artificial neural networks are widely used for users’ online travel planning. Personalized travel planning has many real applications and is affected by various factors, such as transportation type, intention destination estimation, budget limit and crowdness prediction. Among those factors, users’ intention destination prediction is an essential task in online travel platforms. The reason is that, the user may be interested in the travel plan only when the plan matches his real intention destination. Therefore, in this paper, we focus on predicting users’ intention destinations in online travel platforms. In detail, we act as online travel platforms (such as Fliggy and Airbnb) to recommend travel plans for users, and the plan consists of various vacation items including hotel package, scenic packages and so on. Predicting the actual intention destination in travel planning is challenging. Firstly, users’ intention destination is highly related to their travel status (e.g., planning for a trip or finishing a trip). Secondly, users’ actions (e.g. clicking, searching) over different product types (e.g. train tickets, visa application) have different indications in destination prediction. Thirdly, users may mostly visit the travel platforms just before public holidays, and thus user behaviors in online travel platforms are more sparse, low-frequency and long-period. Therefore, we propose a Deep Multi-Sequences fused neural Networks (DMSN) to predict intention destinations from fused multi-behavior sequences. Real datasets are used to evaluate the performance of our proposed DMSN models. Experimental results indicate that the proposed DMSN models can achieve high intention destination prediction accuracy.
Bayesian $L_{\frac{1}{2}}$ regression

It is well known that bridge regression enjoys superior theoretical properties than traditional LASSO. However, the current latent variable representation of its Bayesian counterpart, based on the exponential power prior, is computationally expensive in higher dimensions. In this paper, we show that the exponential power prior has a closed-form scale mixture of normal decomposition for α = ( 2) γ , γ ∈ N+. We develop a partially collapsed Gibbs sampling scheme, which outperforms existing Markov chain Monte Carlo strategies, we also study theoretical properties under this prior when p > n. In addition, we introduce a non-separable bridge penalty function inspired by the fully Bayesian formulation and a novel, efficient, coordinate-descent algorithm. We prove the algorithm’s convergence and show that the local minimizer from our optimization algorithm has an oracle property. Finally, simulation studies were carried out to illustrate the performance of the new algorithms.
Mixture of Linear Models Co-supervised by Deep Neural Networks

ABSTRACT Deep neural networks (DNN) have been demonstrated to achieve unparalleled prediction accuracy in a wide range of applications. Despite its strong performance, in certain areas, the usage of DNN has met resistance because of its black-box nature. In this article, we propose a new method to estimate a mixture of linear models (MLM) for regression or classification that is relatively easy to interpret. We use DNN as a proxy of the optimal prediction function such that MLM can be effectively estimated. We propose visualization methods and quantitative approaches to interpret the predictor by MLM. Experiments show that the new method allows us to tradeoff interpretability and accuracy. The MLM estimated under the guidance of a trained DNN fills the gap between a highly explainable linear statistical model and a highly accurate but difficult to interpret predictor. Supplementary materials for this article are available online.