Miracle-dz/UniFAR-FTUs huggingface dataset:
Efficient Real-Time Radial Distortion Correction for UAVs

In this paper we present a novel algorithm for onboard radial distortion correction for unmanned aerial vehicles (UAVs) equipped with an inertial measurement unit (IMU), that runs in real-time. This approach makes calibration procedures redundant, thus allowing for exchange of optics extemporaneously. By utilizing the IMU data, the cameras can be aligned with the gravity direction. This allows us to work with fewer degrees of freedom, and opens up for further intrinsic calibration. We propose a fast and robust minimal solver for simultaneously estimating the focal length, radial distortion profile and motion parameters from homographies. The proposed solver is tested on both synthetic and real data, and perform better or on par with state-of-the-art methods relying on pre-calibration procedures. Code available at: https://github.com/marcusvaltonen/HomLib.1
The effects of asymmetric dark matter on stellar evolution – I. Spin-dependent scattering

Most of the dark matter (DM) search over the last few decades has focused on WIMPs, but the viable parameter space is quickly shrinking. Asymmetric Dark Matter (ADM) is a WIMP-like DM candidate with slightly smaller masses and no present day annihilation, meaning that stars can capture and build up large quantities. The captured ADM can transport energy through a significant volume of the star. We investigate the effects of spin-dependent ADM energy transport on stellar structure and evolution in stars with $0.9 \leq M_{\star}/\mathrm{M}_{\odot} \leq 5.0$ in varying DM environments. We wrote a MESA module that calculates the capture of DM and the subsequent energy transport within the star. We fix the DM mass to 5 GeV and the cross section to $10^{-37}$ cm${^2}$, and study varying environments by scaling the DM capture rate. For stars with radiative cores ($M_{\star} \lesssim 1.3\ \mathrm{M}_{\odot}$), the presence of ADM flattens the temperature and burning profiles in the core and increases MS lifetimes ($X_c > 10^{-3}$) by up to $\sim 20\%$. We find that strict requirements on energy conservation are crucial to the simulation of ADM's effects on these stars. In higher-mass stars, ADM energy transport shuts off core convection, limiting available fuel and shortening MS lifetimes by up to $\sim 40\%$. This may translate to changes in the luminosity and effective temperature of the MS turnoff in population isochrones. The tip of the red giant branch may occur at lower luminosities. The effects are largest in DM environments with high densities and/or low velocity dispersions, making dwarf and early forming galaxies most likely to display the effects.
On the small-time local controllability of a KdV system for critical lengths

This paper is devoted to the local null-controllability of the nonlinear KdV equation equipped the Dirichlet boundary conditions using the Neumann boundary control on the right. Rosier proved that this KdV system is small-time locally controllable for all non-critical lengths and that the uncontrollable space of the linearized system is of finite dimension when the length is critical. Concerning critical lengths, Coron and Cr\'{e}peau showed that the same result holds when the uncontrollable space of the linearized system is of dimension 1, and later Cerpa, and then Cerpa and Cr\'epeau established that the local controllability holds at a finite time for all other critical lengths. In this paper, we prove that, for a class of critical lengths, the nonlinear KdV system is {\it not} small-time locally controllable.
Convolutional Recurrent Residual U-Net Embedded with Attention Mechanism and Focal Tversky Loss Function for Cancerous Nuclei Detection

Since the beginning of this decade, CNN has been a very successful tool in the field of Computer Vision tasks.The invention of CNN was inspired from neuroscience and it shares a lot of anatomical similarities with our visual system.Inspired by the anatomyof humanvisual system, wearguethat the existing U-Net architecture can be improvedin many ways. As human visual system uses attention mechanism, we have used attention concatenation in place of normalconcatenation.Although, CNN is purely feed-forward in nature but anatomical evidences show that our brain contains recurrent synapses and they often outnumber feed-forward and top-down connections. Thisfact inspiresus to userecurrent convolution connectionsin place of normalconvolution blocksin U-Net.Thispaper also addressesthe class imbalance issuein the field of medical image analysis. The paperresolvestheproblem of class imbalanceswith the help of state-of-the-art loss functions.Weargue thatourproposed architecturecan be trained end to end with a few training data and it outperforms the other variantsof U-Net.
Direct Numerical Simulation of a Turbulent Boundary Layer on a Flat Plate Using Synthetic Turbulence Generation.

The turbulent boundary layer over a flat plate is computed by direct numerical simulation (DNS) of the incompressible Navier-Stokes equations as a test bed for a synthetic turbulence generator (STG) inflow boundary condition. The inlet momentum thickness Reynolds number is approximately $1,000$. The study provides validation of the ability of the STG to develop accurate turbulence in 5 to 7 boundary layer thicknesses downstream of the boundary condition. Moreover, the grid resolution required for both the development region and the downstream flow is investigated when using a stabilized finite element method.
The Hα Dots Survey. II. A Second List of Faint Emission-line Objects

We present the second catalog of serendipitously discovered compact extragalactic emission-line sources—Hα Dots. These objects have been discovered in searches of moderately deep narrow-band images acquired for the ALFALFA Hα project. In addition to cataloging 119 new Hα Dots, we also present follow-up spectral data for the full sample. These spectra allow us to confirm the nature of these objects as true extragalactic emission-line objects, to classify them in terms of activity type (star-forming or AGN), and to identify the emission line via which they were discovered. We tabulate photometric and spectroscopic data for the all objects, and we present an overview of the properties of the full Hα Dot sample. The Hα Dots represent a broad range of star-forming and active galaxies detected via several different emission lines over a wide range of redshifts. The sample includes Hα-detected blue compact dwarf galaxies at low redshift, [O iii]-detected Seyfert 2 and Green Pea-like galaxies at intermediate redshifts, and QSOs detected via one of several UV emission lines, including Lyα. Despite the heterogeneous appearance of the resulting catalog of objects, we show that our selection method leads to well-defined samples of specific classes of emission-line objects with properties that allow for statistical studies of each class.
Domain walls and M2-branes partition functions: M-theory and ABJM Theory.

We study the BPS counting functions (free energies) of the M-string configurations. We consider separated M5-branes along with M2-branes stretched between them, with M5-branes acting as domain walls interpolating different configurations of M2-branes. We find recursive structure in the free energies of these configurations. The M-string degrees of freedom on the domain walls are interpreted in terms of a pair of interacting supersymmetric WZW models. We also compute the elliptic genus of the M-string in a toy model of the ABJM theory and compare it with the M-theory computation.
Jump Models with Delay—Option Pricing and Logarithmic Euler–Maruyama Scheme

In this paper, we obtain the existence, uniqueness, and positivity of the solution to delayed stochastic differential equations with jumps. This equation is then applied to model the price movement of the risky asset in a financial market and the Black–Scholes formula for the price of European option is obtained together with the hedging portfolios. The option price is evaluated analytically at the last delayed period by using the Fourier transformation technique. However, in general, there is no analytical expression for the option price. To evaluate the price numerically, we then use the Monte-Carlo method. To this end, we need to simulate the delayed stochastic differential equations with jumps. We propose a logarithmic Euler–Maruyama scheme to approximate the equation and prove that all the approximations remain positive and the rate of convergence of the scheme is proved to be 0.5.
False Discovery Rate Computation: Illustrations and Modifications

False discovery rates (FDR) are an essential component of statistical inference, representing the propensity for an observed result to be mistaken. FDR estimates should accompany observed results to help the user contextualize the relevance and potential impact of findings. This paper introduces a new user-friendly R package for computing FDRs and adjusting p-values for FDR control. These tools respect the critical difference between the adjusted p-value and the estimated FDR for a particular finding, which are sometimes numerically identical but are often confused in practice. Newly augmented methods for estimating the null proportion of findings - an important part of the FDR estimation procedure - are proposed and evaluated. The package is broad, encompassing a variety of methods for FDR estimation and FDR control, and includes plotting functions for easy display of results. Through extensive illustrations, we strongly encourage wider reporting of false discovery rates for observed findings.
Streaming Submodular Maximization with Fairness Constraints

We study the problem of extracting a small subset of representative items from a large data stream. Following the convention in many data mining and machine learning applications such as data summarization, recommender systems, and social network analysis, the problem is formulated as maximizing a monotone submodular function subject to a cardinality constraint -- i.e., the size of the selected subset is restricted to be smaller than or equal to an input integer $k$. In this paper, we consider the problem with additional \emph{fairness constraints}, which takes into account the group membership of data items and limits the number of items selected from each group to a given number. We propose efficient algorithms for this fairness-aware variant of the streaming submodular maximization problem. In particular, we first provide a $(\frac{1}{2}-\varepsilon)$-approximation algorithm that requires $O(\frac{1}{\varepsilon} \cdot \log \frac{k}{\varepsilon})$ passes over the stream for any constant $ \varepsilon>0 $. In addition, we design a single-pass streaming algorithm that has the same $(\frac{1}{2}-\varepsilon)$ approximation ratio when unlimited buffer size and post-processing time is permitted.
Long-distance tiny face detection based on enhanced YOLOv3 for unmanned system

Remote tiny face detection applied in unmanned system is a challeng-ing work. The detector cannot obtain sufficient context semantic information due to the relatively long distance. The received poor fine-grained features make the face detection less accurate and robust. To solve the problem of long-distance detection of tiny faces, we propose an enhanced network model (YOLOv3-C) based on the YOLOv3 algorithm for unmanned platform. In this model, we bring in multi-scale features from feature pyramid networks and make the features fu-sion to adjust prediction feature map of the output, which improves the sensitivity of the entire algorithm for tiny target faces. The enhanced model improves the accuracy of tiny face detection in the cases of long-distance and high-density crowds. The experimental evaluation results demonstrated the superior perfor-mance of the proposed YOLOv3-C in comparison with other relevant detectors in remote tiny face detection. It is worth mentioning that our proposed method achieves comparable performance with the state of the art YOLOv4[1] in the tiny face detection tasks.
Evaluation of the Topological Agreement of Network Alignments

Aligning protein interaction networks (PPI) of two or more organisms consists of finding a mapping of the nodes (proteins) of the networks that captures important structural and functional associations (similarity). It is a well studied but difficult problem. It is provably NP-hard in some instances thus computationally very demanding. The problem comes in several versions: global versus local alignment; pairwise versus multiple alignment; one-to-one versus many-to-many alignment. Heuristics to address the various instances of the problem abound and they achieve some degree of success when their performance is measured in terms of node and/or edges conservation. However, as the evolutionary distance between the organisms being considered increases the results tend to degrade. Moreover, poor performance is achieved when the considered networks have remarkably different sizes in the number of nodes and/or edges. Here we address the challenge of analyzing and comparing different approaches to global network alignment, when a one-to-one mapping is sought. We consider and propose various measures to evaluate the agreement between alignments obtained by existing approaches. We show that some such measures indicate an agreement that is often about the same than what would be obtained by chance. That tends to occur even when the mappings exhibit a good performance based on standard measures.
Nitrogen stable isotope values of large-bodied consumers reflect urbanization of coastal catchments

Anthropogenic nitrogen inputs to aquatic ecosystems can detrimentally affect ecosystem function; therefore, we need methods that identify nitrogen sources consistently among catchments. Nitrogen sources may be distinguished with stable isotope values (δ15N). This study tested if the isotopic values of biota and inorganic oxides of nitrogen (NO3 + NO2, hereafter NOx) within estuaries were predictably influenced by anthropogenic land use in catchments distributed across a coastline. The δ15N values of NOx, autotrophs and consumers (fish) were measured. Increased catchment urbanization was reflected in higher δ15N values of larger-bodied fish consumers but not smaller-bodied consumers, autotrophs or NOx, which may reflect the timeaveraging effect of longer tissue equilibration times in the larger fish. The proportion of the catchment subject to intensive agriculture did not relate to isotopic values of estuarine biota or NOx. The lack of relationships between intensive agriculture and δ15N in the estuaries studied may result from the mixing of nitrogen sources within the catchments studied, non-uniformity in biogeochemical transformations of nitrogen during transport from agricultural sources to estuaries, or insufficiencies of broad land-use data for describing impacts of agriculture on nitrogen isotopic pools. The δ15N values of consumers with slow tissue turnover appear most useful for identifying the incorporation of urban nutrient inputs into estuarine food webs at catchment scales.
LaND: Learning to Navigate From Disengagements

Consistently testing autonomous mobile robots in real world scenarios is a necessary aspect of developing autonomous navigation systems. Each time the human safety monitor disengages the robot's autonomy system due to the robot performing an undesirable maneuver, the autonomy developers gain insight into how to improve the autonomy system. However, we believe that these disengagements not only show where the system fails, which is useful for troubleshooting, but also provide a direct learning signal by which the robot can learn to navigate. We present a reinforcement learning approach for learning to navigate from disengagements, or LaND. LaND learns a neural network model that predicts which actions lead to disengagements given the current sensory observation, and then at test time plans and executes actions that avoid disengagements. Our results demonstrate LaND can successfully learn to navigate in diverse, real world sidewalk environments, outperforming both imitation learning and reinforcement learning approaches. Videos, code, and other material are available on our website https://sites.google. com/view/sidewalk-learning.
Deep Learning Superpixel Semantic Segmentation with Transparent Initialization and Sparse Encoder

Even though deep learning greatly improves the performance of semantic segmentation, its success mainly lies on object central areas but without accurate edges. As superpixel is a popular and effective auxiliary to preserve object edges, in this paper, we jointly learn semantic segmentation with trainable superpixels. We achieve it by adding fully-connected layers with transparent initialization and an efficient logit uniformization with a sparse encoder. Specifically, the proposed transparent initialization reserves the effects of learned parameters from pretrained networks, one for semantic segmentation and the other for superpixel, by a linear data recovery. This avoids a significant loss increase by using the pretrained networks, which otherwise can be caused by an inappropriate parameter initialization on the added layers. Meanwhile, consistent assignments to all pixels in each superpixel can be guaranteed by the logit uniformization with a sparse encoder. This sparse encoder with sparse matrix operations substantially improves the training efficiency by reducing the large computational complexity arising from indexing pixels by superpixels. We demonstrate the effectiveness of our proposal by transparent initialization and sparse encoder on semantic segmentation on PASCAL VOC 2012 dataset with enhanced labeling on the object edges. Moreover, the proposed transparent initialization can also be used to jointly finetune multiple or a deeper pretrained network on other tasks.
Uncertainty-Aware Semantic Augmentation for Neural Machine Translation

As a sequence-to-sequence generation task, neural machine translation (NMT) naturally contains intrinsic uncertainty, where a single sentence in one language has multiple valid counterparts in the other. However, the dominant methods for NMT only observe one of them from the parallel corpora for the model training but have to deal with adequate variations under the same meaning at inference. This leads to a discrepancy of the data distribution between the training and the inference phases. To address this problem, we propose uncertainty-aware semantic augmentation, which explicitly captures the universal semantic information among multiple semantically-equivalent source sentences and enhances the hidden representations with this information for better translations. Extensive experiments on various translation tasks reveal that our approach significantly outperforms the strong baselines and the existing methods.
Energy Data Visualizations on Smartphones for Triggering Behavioral Change: Novel Vs. Conventional

This paper conveys the importance of using suitable data visualizations for electrical energy consumption and the effect it carries on reducing said consumption. Data visualization tools construct an important pillar in energy micro-moments, i.e., the concept of providing the right information at the right time in the right way for a specific power consumer. Such behavioral change can be triggered with the help of good recommendations and suitable visualizations to convey the right message. A questionnaire is built as a mobile application to evaluate different groups of conventional and novel visualizations. Conventional charts are restricted to bar, line and stacked area charts, while novel visualizations contain heatmap, spiral and appliance-level stacked bar charts. Significant findings gathered from participants’ responses indicate that they are slightly inclined towards conventional charts. However, their understanding of the novel charts is better by 8% when the analysis questions are investigated. Finally, a question is answered on whether a group of visualizations should be discarded completely, or some modifications can be applied.
Deep-Masking Generative Network: A Unified Framework for Background Restoration From Superimposed Images

Restoring the clean background from the superimposed images containing a noisy layer is the common crux of a classical category of tasks on image restoration such as image reflection removal, image deraining and image dehazing. These tasks are typically formulated and tackled individually due to diverse and complicated appearance patterns of noise layers within the image. In this work we present the Deep-Masking Generative Network (DMGN), which is a unified framework for background restoration from the superimposed images and is able to cope with different types of noise. Our proposed DMGN follows a coarse-to-fine generative process: a coarse background image and a noise image are first generated in parallel, then the noise image is further leveraged to refine the background image to achieve a higher-quality background image. In particular, we design the novel Residual Deep-Masking Cell as the core operating unit for our DMGN to enhance the effective information and suppress the negative information during image generation via learning a gating mask to control the information flow. By iteratively employing this Residual Deep-Masking Cell, our proposed DMGN is able to generate both high-quality background image and noisy image progressively. Furthermore, we propose a two-pronged strategy to effectively leverage the generated noise image as contrasting cues to facilitate the refinement of the background image. Extensive experiments across three typical tasks for image background restoration, including image reflection removal, image rain steak removal and image dehazing, show that our DMGN consistently outperforms state-of-the-art methods specifically designed for each single task.
Analyzing HPC Support Tickets: Experience and Recommendations

High performance computing (HPC) user support teams are the first line of defense against large-scale problems, as they are often the first to learn of problems reported by users. Developing tools to better assist support teams in solving user problems and tracking issue trends is critical for maintaining system health. Our work examines the Los Alamos National Laboratory HPC Consult Team's user support ticketing system and develops proof of concept tools to automate tasks such as category assignment and similar ticket recommendation. We also generate new categories for reporting and discuss ideas to improve future ticketing systems.
Sensitivity Analysis of Submodular Function Maximization

We study the recently introduced idea of worst-case sensitivity for monotone submodular maximization with cardinality constraint $k$, which captures the degree to which the output argument changes on deletion of an element in the input. We find that for large classes of algorithms that non-trivial sensitivity of $o(k)$ is not possible, even with bounded curvature, and that these results also hold in the distributed framework. However, we also show that in the regime $k = \Omega(n)$ that we can obtain $O(1)$ sensitivity for sufficiently low curvature.