Miracle-dz/UniFAR-FTUs huggingface dataset:
2M17091769+3127589: A Mass-transfer Binary with an Extreme Mass Ratio

We present the orbital solution of a peculiar double-lined spectroscopic and eclipsing binary system, 2M17091769+3127589. This solution was obtained by a simultaneous fit of both APOGEE radial velocities and TESS and ASAS-SN light curves to determine masses and radii. This system consists of an M=0.256−0.006+0.010 M ⊙, R=3.961−0.032+0.049 R ⊙ red giant and a hotter M=1.518−0.031+0.057 M ⊙, R=2.608−0.321+0.034 R ⊙ subgiant. Modeling with the MESA evolutionary codes indicates that the system likely formed 5.26 Gyrs ago, with a M = 1.2 M ⊙ primary that is now the system’s red giant and a M = 1.11 M ⊙ secondary that is now a more massive subgiant. Due to Roche-lobe overflow as the primary ascends the red giant branch, the more evolved “primary” (i.e., originally the more massive star of the pair) is now only one sixth as massive as the “secondary. ” Such a difference between the initial and the current mass ratio is one of the most extreme detected so far. Evolutionary modeling suggests the system is still engaged in mass transfer, at a rate of Ṁ∼10−9 M ⊙/yr, and it provides an example of a less evolved precursor to some of the systems that consist of white dwarfs and blue stragglers.
Chemical abundances in Seyfert galaxies – VI. Empirical abundance calibration

We derived a bi-dimensional calibration between the emission line ratios R23 = ([O ii]λ3726+ λ3729+ [O iii]λ4959+ λ5007)/Hβ, P = [([O iii]λ4959 + λ5007)/Hβ]/R23 and the oxygen abundance relative to hydrogen (O/H) in the gas phase of Seyferts 1 and 2 nuclei. In view of this, emission-line intensity ratios for a sample of objects taken from the Sloan Digital Sky Survey Data Release 7 (SDSS-DR7) measured by the MPA/JHU group and direct estimates of O/H based on Te-method, adapted for AGNs, are considered. We find no variation of R23 observed along the radii of AGNs which shows that this line ratio is a good oxygen abundance (O/H) indicator for the class of objects considered in this work. The derived O/H = f(R23, P) relation produces O/H values similar to estimations via Te-method in a wide range of metallicities (8.0 . 12+log(O/H) . 9.2). Conversely to star-forming regions in the high metallicity regime, R23 shows a positive correlation trend with O/H in AGNs. This indicates that the hardness of ionizing radiation is not affected by the metallicities in these objects or Narrow Line Regions (NLRs) are not significantly modified by changes in the Spectral Energy Distribution due to metallicity variations.
PoseFace: Pose-Invariant Features and Pose-Adaptive Loss for Face Recognition

Despite the great success achieved by deep learning methods in face recognition, severe performance drops are observed for large pose variations in unconstrained environments (e.g., in cases of surveillance and photo-tagging). To address it, current methods either deploy pose-specific models or frontalize faces by additional modules. Still, they ignore the fact that identity information should be consistent across poses and are not realizing the data imbalance between frontal and profile face images during training. In this paper, we propose an efficient PoseFace framework which utilizes the facial landmarks to disentangle the pose-invariant features and exploits a pose-adaptive loss to handle the imbalance issue adaptively. Extensive experimental results on the benchmarks of Multi-PIE, CFP, CPLFW and IJB have demonstrated the superiority of our method over the state-of-the-arts.
Non-Abelian vector dark matter and lepton g-2

The mystery of dark matter remains an unsettled problem of particle physics. On top of that, experiments show a persistent contention of the muon anomalous magnetic moment (AMM) relative to the Standard Model (SM) prediction. In this work, we consider the possibility of extending the SM with a non-Abelian gauge symmetry SU(2) X , under which SM leptons transform non-trivially. SM leptons receive corrections to their AMMs of right order via one-loop processes mediated by beyond SM (BSM) fermions required to cancel anomalies, and BSM gauge bosons that play the role of dark matter. We show that simultaneous explanation of the muon AMM along with reproducing correct relic abundance allows rather a narrow range of 0.5–2 TeV dark matter mass, consistent with current experimental constraints. However, a concurrent description that also includes electron AMM is challenging in this set-up.
A 51.3-TOPS/W, 134.4-GOPS In-Memory Binary Image Filtering in 65-nm CMOS

Neuromorphic vision sensors (NVSs) can enable energy savings due to their event-driven that exploits the temporal redundancy in video streams from a stationary camera. However, noise-driven events lead to the false triggering of the object recognition processor. Image denoise operations require memory-intensive processing leading to a bottleneck in energy and latency. In this article, we present in-memory filtering (IMF), a 6T-SRAM in-memory computing (IMC)-based image denoising for event-based binary image (EBBI) frame from an NVS. We propose a non-overlap median filter (NOMF) for image denoising. An IMC framework enables hardware implementation of NOMF leveraging the inherent read disturb phenomenon of 6T-SRAM. To demonstrate the energy-saving and effectiveness of the algorithm, we fabricated the proposed architecture in a 65-nm CMOS process. Compared to fully digital implementation, IMF enables >70 $\times $ energy savings and a >3 $\times $ improvement of processing time when tested with the video recordings from a DAVIS sensor and achieves a peak throughput of 134.4 GOPS. Furthermore, the peak energy efficiencies of the NOMF are 51.3 TOPS/W, comparable with state-of-the-art in-memory processors. We also show that the accuracy of the images obtained by NOMF provides comparable accuracy in tracking and classification applications compared with images obtained by conventional median filtering.
EGGS: Eigen-Gap Guided Search Making Subspace Clustering Easy

—The performance of spectral clustering heavily relies on the quality of afﬁnity matrix. A variety of afﬁnity-matrix-construction methods have been proposed but they have hyper-parameters to determine beforehand, which requires strong experience and lead to difﬁculty in real applications especially when the inter-cluster similarity is high or/and the dataset is large. On the other hand, we often have to determine to use a linear model or a nonlinear model, which still depends on experience. To solve these two problems, in this paper, we present an eigen-gap guided search method for subspace clustering. The main idea is to ﬁnd the most reliable afﬁnity matrix among a set of candidates constructed by linear and kernel regressions, where the reliability is quantiﬁed by the relative-eigen-gap of graph Laplacian deﬁned in this paper. We show, theoretically and numerically, that the Laplacian matrix with a larger relative-eigen-gap often yields a higher clustering accuracy and stability. Our method is able to automatically search the best model and hyper-parameters in a pre-deﬁned space. The search space is very easy to determine and can be arbitrarily large, though a relatively compact search space can reduce the highly unnecessary computation. Our method has high ﬂexibility and convenience in real applications, and also has low computational cost because the afﬁnity matrix is not computed by iterative optimization. We extend the method to large-scale datasets such as MNIST, on which the time cost is less than 90s and the clustering accuracy is state-of-the-art. Extensive experiments of natural image clustering show that our method is more stable, accurate, and efﬁcient than baseline methods.
Performance assessment of CUDA and OpenACC in large scale combustion simulations

GPUs have climbed up to the top of supercomputer systems making life harder to many legacy scientific codes. Nowadays, many recipes are being used in such code's portability, without any clarity of which is the best option. We present a comparative analysis of the two most common approaches, CUDA and OpenACC, into the multi-physics CFD code Alya. Our focus is the combustion problems which are one of the most computing demanding CFD simulations. The most computing-intensive parts of the code were analyzed in detail. New data structures for the matrix assembly step have been created to facilitate a SIMD execution that benefits vectorization in the CPU and stream processing in the GPU. As a result, the CPU code has improved its performance by up to 25%. In GPU execution, CUDA has proven to be up to 2 times faster than OpenACC for the assembly of the matrix. On the contrary, similar performance has been obtained in the kernels related to vector operations used in the linear solver, where there is minimal memory reuse.
Ju l 2 02 1 Electromagnetic waves in Born – Infeld electrodynamics

In [1], we studied the problem for G = 0 identical for both the Born and the Born–Infeld electrodynamics. In this paper, we continue to investigate two counter–propagating electromagnetic waves in the vacuum in the Born–Infeld theory in quantum electrodynamics for the case G 6= 0 to complete the study. We show that the field equations decouple and the exceptional waves are the only physically relevant solutions, i.e. the exceptional wave solutions propagate with constant speed and the shock waves can not be created. We discuss the phase shift for the process in our proposed experiment for direct detection of the photon–photon scattering. Finally, we discuss distinguishing the two theories Born–Infeld and the Heisenberg-Euler by precision test experiments based on the effective Lagrangian.
Effective Capacity Analysis of HARQ-Enabled D2D Communication in Multi-Tier Cellular Networks

This work does the statistical quality-of-service (QoS) analysis of a block-fading device-to-device (D2D) link in a multi-tier cellular network that consists of a macro-BS (<inline-formula><tex-math notation="LaTeX">$BS_{_{MC}}$</tex-math></inline-formula>) and a micro-BS (<inline-formula><tex-math notation="LaTeX">$BS_{_{mC}}$</tex-math></inline-formula>) which both operate in full-duplex (FD) mode. For the D2D link under consideration, we first formulate the mode selection problem—whereby D2D pair could either communicate directly, or, through the <inline-formula><tex-math notation="LaTeX">$BS_{_{mC}}$</tex-math></inline-formula>, or, through the <inline-formula><tex-math notation="LaTeX">$BS_{_{MC}}$</tex-math></inline-formula>—as a ternary hypothesis testing problem. Next, to compute the <italic>effective capacity</italic> (EC) for the given D2D link, we assume that the channel state information (CSI) is not available at the transmit D2D node, and hence, it transmits at a fixed rate <inline-formula><tex-math notation="LaTeX">$r$</tex-math></inline-formula> with a fixed power. This allows us to model the D2D link as a Markov system with six-states. We consider both overlay and underlay modes for the D2D link. Moreover, to improve the throughput of the D2D link, we assume that the D2D pair utilizes two special automatic repeat request (ARQ) schemes, i.e., Hybrid-ARQ (HARQ) and truncated HARQ. Furthermore, we consider two distinct queue models at the transmit D2D node, based upon how it responds to the decoding failure at the receive D2D node. Eventually, we provide closed-form expressions for the EC for both HARQ-enabled D2D link and truncated HARQ-enabled D2D link, under both queue models. Noting that the EC looks like a quasi-concave function of <inline-formula><tex-math notation="LaTeX">$r$</tex-math></inline-formula>, we further maximize the EC by searching for an optimal rate via the gradient-descent method. Simulation results provide us the following insights: i) EC decreases with an increase in the QoS exponent, ii) EC of the D2D link improves when HARQ is employed, iii) EC increases with an increase in the quality of self-interference cancellation techniques used at <inline-formula><tex-math notation="LaTeX">$BS_{_{mC}}$</tex-math></inline-formula> and <inline-formula><tex-math notation="LaTeX">$BS_{_{MC}}$</tex-math></inline-formula> in FD mode.
Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients

Assessing non-negativity of multivariate polynomials over the reals, through the computation of {\em certificates of non-negativity}, is a topical issue in polynomial optimization. This is usually tackled through the computation of {\em sums-of-squares decompositions} which rely on efficient numerical solvers for semi-definite programming. This method faces two difficulties. The first one is that the certificates obtained this way are {\em approximate} and then non-exact. The second one is due to the fact that not all non-negative polynomials are sums-of-squares. In this paper, we build on previous works by Parrilo, Nie, Demmel and Sturmfels who introduced certificates of non-negativity modulo {\em gradient ideals}. We prove that, actually, such certificates can be obtained {\em exactly}, over the rationals if the polynomial under consideration has rational coefficients and we provide {\em exact} algorithms to compute them. We analyze the bit complexity of these algorithms and deduce bit size bounds of such certificates.
Active Topological Glass Confined within a Spherical Cavity

We study active topological glass under spherical confinement, allowing us to exceed the chain lengths simulated previously and determine the critical exponents of the arrested conformations. We find a previously unresolved “tank-treading” dynamic mode of active segments along the ring contour. This mode can enhance active–passive phase separation in the state of active topological glass when both diffusional and conformational relaxation of the rings are significantly suppressed. Within the observational time, we see no systematic trends in the positioning of the separated active domains within the confining sphere. The arrested state exhibits coherent stochastic rotations. We discuss possible connections of the conformational and dynamic features of the system to chromosomes enclosed in the nucleus of a living cell.
Control of membrane-attached biofilms in extractive membrane bioreactors

Control of Membrane Attached Biofilm (MAB) formation and accumulation is a key aspect in the operation of Extractive Membrane Bioreactors (EMBs). In this work, MAB control was attempted in a novel EMB configuration which presents two innovative aspects: the presence of a biphasic biomedium and a contained liquid membrane module. This reactor, where the benefits of high shear forces and the use of a biphasic biomedium are effectively combined, was operated without any biofilm formation or reduction in organic substrate flux over time.
Exact gyratons in higher and infinite derivative gravity

We study solutions describing spinning null sources called gyratons in generic theories of gravity with terms that are quadratic in curvature and contain an arbitrary number of covariant derivatives. In particular, we show that the properties of pp-waves of the algebraic type III allow for extreme simplification of the field equations. It turns out that the resulting differential equations are exactly solvable due to partial decoupling and linearity of the equations. This is demonstrated explicitly by finding axially symmetric gyraton solutions in Stelle's fourth derivative gravity and the non-local gravity with an infinite number of derivatives.
Swift/UVOT follow-up of gravitational wave alerts in the O3 era

In this paper, we report on the observational performance of the Swift Ultra-violet/Optical Telescope (UVOT) in response to the gravitational wave (GW) alerts announced by the Advanced Laser Interferometer Gravitational Wave Observatory and the Advanced Virgo detector during the O3 period. We provide the observational strategy for follow-up of GW alerts and provide an overview of the processing and analysis of candidate optical/UV sources. For the O3 period, we also provide a statistical overview and report on serendipitous sources discovered by Swift/UVOT. Swift followed 18 GW candidate alerts, with UVOT observing a total of 424 deg2. We found 27 sources that changed in magnitude at the 3σ level compared with archival u- or g-band catalogued values. Swift/UVOT also followed up a further 13 sources reported by other facilities during the O3 period. Using catalogue information, we divided these 40 sources into five initial classifications: 11 candidate active galactic nuclei (AGNs)/quasars, three cataclysmic variables (CVs), nine supernovae, 11 unidentified sources that had archival photometry, and six uncatalogued sources for which no archival photometry was available. We have no strong evidence to identify any of these transients as counterparts to the GW events. The 17 unclassified sources are likely a mix of AGN and a class of fast-evolving transient, and one source may be a CV.
Distributed stochastic inertial methods with delayed derivatives

Stochastic gradient methods (SGMs) are predominant approaches for solving stochastic optimization. On smooth nonconvex problems, a few acceleration techniques have been applied to improve the convergence rate of SGMs. However, little exploration has been made on applying a certain acceleration technique to a stochastic subgradient method (SsGM) for nonsmooth nonconvex problems. In addition, few eﬀorts have been made to analyze an (accelerated) SsGM with delayed derivatives. The information delay naturally happens in a distributed system, where computing workers do not coordinate with each other. In this paper, we propose an inertial proximal SsGM for solving nonsmooth nonconvex stochastic optimization problems. The proposed method can have guaranteed convergence even with delayed derivative information in a distributed environment. Convergence rate results are established to three classes of nonconvex problems: weakly-convex nonsmooth problems with a convex regularizer, composite nonconvex problems with a nonsmooth convex regularizer, and smooth nonconvex problems. For each problem class, the convergence rate is O (1 /K 12 ) in the expected value of the gradient norm square, for K iterations. In a distributed environment, the convergence rate of the proposed method will be slowed down by the information delay. Nevertheless, the slow-down eﬀect will decay with the number of iterations for the latter two problem classes. We test the proposed method on three applications. The numerical results clearly demonstrate the advantages of using the inertial-based acceleration. Furthermore, we observe higher parallelization speed-up in asynchronous updates over the synchronous counterpart, though the former uses delayed derivatives.
On the Sample Complexity of Privately Learning Axis-Aligned Rectangles

We revisit the fundamental problem of learning Axis-Aligned-Rectangles over a finite grid $X^d\subseteq{\mathbb{R}}^d$ with differential privacy. Existing results show that the sample complexity of this problem is at most $\min\left\{ d{\cdot}\log|X| \;,\; d^{1.5}{\cdot}\left(\log^*|X| \right)^{1.5}\right\}$. That is, existing constructions either require sample complexity that grows linearly with $\log|X|$, or else it grows super linearly with the dimension $d$. We present a novel algorithm that reduces the sample complexity to only $\tilde{O}\left\{d{\cdot}\left(\log^*|X|\right)^{1.5}\right\}$, attaining a dimensionality optimal dependency without requiring the sample complexity to grow with $\log|X|$. The technique used in order to attain this improvement involves the deletion of"exposed"data-points on the go, in a fashion designed to avoid the cost of the adaptive composition theorems. The core of this technique may be of individual interest, introducing a new method for constructing statistically-efficient private algorithms.
Can Action be Imitated? Learn to Reconstruct and Transfer Human Dynamics from Videos

Given a video demonstration, can we imitate the action contained in this video? In this paper, we introduce a novel task, dubbed mesh-based action imitation. The goal of this task is to enable an arbitrary target human mesh to perform the same action shown on the video demonstration. To achieve this, a novel Mesh-based Video Action Imitation (M-VAI) method is proposed by us. M-VAI first learns to reconstruct the meshes from the given source image frames, then the initial recovered mesh sequence is fed into mesh2mesh, a mesh sequence smooth module proposed by us, to improve the temporal consistency. Finally, we imitate the actions by transferring the pose from the constructed human body to our target identity mesh. High-quality and detailed human body meshes can be generated by using our M-VAI. Extensive experiments demonstrate the feasibility of our task and the effectiveness of our proposed method.
A brief note on understanding neural networks as Gaussian processes

As a generalization of the work in [Lee et al., 2017], this note briefly discusses when the prior of a neural network output follows a Gaussian process, and how a neural-network-induced Gaussian process is formulated. The posterior mean functions of such a Gaussian process regression lie in the reproducing kernel Hilbert space defined by the neural-network-induced kernel. In the case of two-layer neural networks, the induced Gaussian processes provide an interpretation of the reproducing kernel Hilbert spaces whose union forms a Barron space.
Searching for Low-redshift Faint Galaxies with MMT/Hectospec

We present redshifts for 2753 low-redshift galaxies between 0.03 ≲ z spec ≲ 0.5 with 18 ≤ r ≤ 22 obtained with Hectospec at the Multi-Mirror Telescope. The observations targeted the XMM-LSS, ELAIS-N1 and DEEP2-3 fields, each of which covers ∼1 deg2. These fields are also part of the recently completed Canada–France–Hawaii Telescope Large Area U-band Deep Survey and ongoing Hyper Suprime-Cam deep fields surveys. The efficiency of our technique for selecting low-redshift galaxies is confirmed by the redshift distribution of our sources. In addition to redshifts, these high signal-to-noise ratio spectra are used to measure ages, metallicities, and nuclear activity levels. In combination with the photometric catalog in u, g, r, i, z, y down to 27 AB mag, we are able to study the galaxy population down to stellar masses of ∼108 M ⊙. This paper presents the observational strategy, the reduction procedure and properties of the galaxy sample. (The catalog can be accessed through the survey’s website at http://mips.as.arizona.edu/~cnaw/Faint_Low_z/.)