Miracle-dz/UniFAR-FTUs huggingface dataset:
Performance of Wall-Modeled LES with Boundary-Layer-Conforming Grids for External Aerodynamics

B = intercept constant for the log law Cp = surface pressure coefficient L = crank chord, mm Nbl = point per boundary-layer thickness Npoints = total number of points of wall-modeled large-eddy simulation Re = Reynolds number based on the crank chord and freestream velocity Re Δ = Reynolds number based onΔmin and freestreamvelocity T = temperature, K U∞ = freestream velocity, m∕s u, v, w = streamwise, vertical, and spanwise instantaneous large-eddy simulation velocities, m∕s uI = inviscid solution, m∕s uk = wall-parallel velocity, m∕s uτ = friction velocity ν = fluid kinematic viscosity, kg∕m x, y, z = coordinates in the streamwise, vertical, and spanwise directions, mm xk, zk = coordinates wall-parallel to the aircraft surface, mm y⊥ = wall-normal direction to the aircraft surface, mm αq = exponent of the error power law for a quantity q βq = constant of the error power law for a quantity q Δ = grid resolution, mm δ = boundary-layer thickness based on 99% of the freestream velocity, m εq = relative error in the quantity q κ = Kármán constant for the log law ρ = fluid density, kg∕m τw = tangential shear stress at the wall h⋅i = time-average operator ⋅ 0 = fluctuating quantity k ⋅ kn = L2-norm over the spatial coordinates.
Giant star-forming complexes in high-z main-sequence galaxy analogues: the internal structure of clumps in DYNAMO galaxies

To indirectly study the internal structure of giant clumps in main sequence galaxies at z ∼ 1–3, we target very turbulent and gas-rich local analogues from the DYNAMO sample with the Hubble Space Telescope, over a wavelength range of ∼200–480 nm. We present a catalogue of 58 clumps identified in six DYNAMO galaxies, including the WFC3/UVIS F225W, F336W, and F467M photometry where the (225–336) and (336–467) colours are sensitive to extinction and stellar population age, respectively. We measure the internal colour gradients of clumps themselves to study their age and extinction properties. We find a marked colour trend within individual clumps, where the resolved colour distributions show that clumps generally have bluer (336–467) colours (denoting very young ages) in their centres than at their edges, with little variation in the (225–336) colour associated with extinction. Furthermore, we find that clumps whose colours suggest they are older, are preferentially located closer towards the centres of their galaxies, and we find no young clumps at small galactocentric distances. Both results are consistent with simulations of high-redshift star-forming systems that show clumps form via violent disc instability, and through dynamic processes migrate to the centres of their galaxies to contribute to bulge growth on time-scales of a few 100 Myr, while continually forming stars in their centres. When we compare the DYNAMO clumps to those in these simulations, we find the best agreement with the long-lived clumps.
Redshift-space effects in voids and their impact on cosmological tests. Part II: the void-galaxy cross-correlation function

This is the second part of a thorough investigation of the redshift-space effects that affect void properties and the impact they have on cosmological tests. Here, we focus on the voidgalaxy cross-correlation function, specifically, on the projected versions that we developed in a previous work. The pillar of the analysis is the one-to-one relationship between real and redshift-space voids above the shot-noise level identified with a spherical void finder. Under this mapping, void properties are affected by three effects: (i) a systematic expansion as a consequence of the distortions induced by galaxy dynamics, (ii) the Alcock-Paczynski volume effect, whichmanifests as an overall expansion or contraction depending on the fiducial cosmology, and (iii) a systematic off-centring along the line of sight as a consequence of the distortions induced by void dynamics. We found that correlations are also affected by an additional source of distortions: the ellipticity of voids. This is the first time that distortions due to the off-centring and ellipticity effects are detected and quantified. With a simplified test, we verified that the Gaussian streaming model is still robust provided all these effects are taken into account, laying the foundations for improvements in current models in order to obtain unbiased cosmological constraints from spectroscopic surveys. Besides this practical importance, this analysis also encodes key information about the structure and dynamics of the Universe at the largest scales. Furthermore, some of the effects constitute cosmological probes by themselves, as is the case of the void ellipticity.
CInC Flow: Characterizable Invertible 3x3 Convolution

Normalizing flows are an essential alternative to GANs for generative modelling, which can be optimized directly on the maximum likelihood of the dataset. They also allow computation of the exact latent vector corresponding to an image since they are composed of invertible transformations. However, the requirement of invertibility of the transformation prevents standard and expressive neural network models such as CNNs from being directly used. Emergent convolutions were proposed to construct an invertible 3$\times$3 CNN layer using a pair of masked CNN layers, making them inefficient. We study conditions such that 3$\times$3 CNNs are invertible, allowing them to construct expressive normalizing flows. We derive necessary and sufficient conditions on a padded CNN for it to be invertible. Our conditions for invertibility are simple, can easily be maintained during the training process. Since we require only a single CNN layer for every effective invertible CNN layer, our approach is more efficient than emerging convolutions. We also proposed a coupling method, Quad-coupling. We benchmark our approach and show similar performance results to emergent convolutions while improving the model's efficiency.
Ray-ONet: Efficient 3D Reconstruction From A Single RGB Image

We propose Ray-ONet to reconstruct detailed 3D models from monocular images efficiently. By predicting a series of occupancy probabilities along a ray that is back-projected from a pixel in the camera coordinate, our method Ray-ONet improves the reconstruction accuracy in comparison with Occupancy Networks (ONet), while reducing the network inference complexity to O($N^2$). As a result, Ray-ONet achieves state-of-the-art performance on the ShapeNet benchmark with more than 20$\times$ speed-up at $128^3$ resolution and maintains a similar memory footprint during inference.
Textual Data Distributions: Kullback Leibler Textual Distributions Contrasts on GPT-2 Generated Texts, with Supervised, Unsupervised Learning on Vaccine & Market Topics & Sentiment

Efficient textual data distributions (TDD) alignment and generation are open research problems in textual analytics and NLP. It is presently difficult to parsimoniously and methodologically confirm that two or more natural language datasets belong to similar distributions, and to identify the extent to which textual data possess alignment. This study focuses on addressing a segment of the broader problem described above by applying multiple supervised and unsupervised machine learning (ML) methods to explore the behavior of TDD by (i) topical alignment, and (ii) by sentiment alignment. Furthermore, we use multiple text generation methods including fine-tuned GPT-2, to generate text by topic and by sentiment. Finally we develop a unique process driven variation of Kullback-Leibler divergence (KLD) application to TDD, named KL Textual Distributions Contrasts (KL-TDC) to identify the alignment of machine generated textual corpora with naturally occurring textual corpora. This study thus identifies a unique approach for generating and validating TDD by topic and sentiment, which can be used to help address sparse data problems and other research, practice and classroom situations in need of artificially generated topic or sentiment aligned textual data.
EAR-NET: Error Attention Refining Network For Retinal Vessel Segmentation

The precise detection of blood vessels in retinal images is crucial to the early diagnosis of the retinal vascular diseases, e.g., diabetic, hypertensive and solar retinopathies. Existing works often fail in predicting the abnormal areas, e.g, sudden brighter and darker areas and are inclined to predict a pixel to background due to the significant class imbalance, leading to high accuracy and specificity while low sensitivity. To that end, we propose a novel error attention refining network (ERA-Net) that is capable of learning and predicting the potential false predictions in a two-stage manner for effective retinal vessel segmentation. The proposed ERA-Net in the refine stage drives the model to focus on and refine the segmentation errors produced in the initial training stage. To achieve this, unlike most previous attention approaches that run in an unsupervised manner, we introduce a novel error attention mechanism which considers the differences between the ground truth and the initial segmentation masks as the ground truth to supervise the attention map learning. Experimental results demonstrate that our method achieves state-of-the-art performance on two common retinal blood vessel datasets. Code is available at this link.
The PCP-like Theorem for Sub-linear Time Inapproximability

In this paper we propose the PCP-like theorem for sub-linear time inapproximability. Abboud et al. have devised the distributed PCP framework for proving sub-quadratic time inapproximability. Here we try to go further in this direction. Staring from SETH, we first find a problem denoted as Ext-$k$-SAT, which can not be computed in linear time, then devise an efficient MA-like protocol for this problem. To use this protocol to prove the sub-linear time inapproximability of other problems, we devise a new kind of reduction denoted as Ext-reduction, and it is different from existing reduction techniques. We also define two new hardness class, the problems in which can be computed in linear-time, but can not be efficiently approximated in sub-linear time. Some problems are shown to be in the newly defined hardness class.
Toward Increased Airspace Safety: Quadrotor Guidance for Targeting Aerial Objects

As the market for commercially available unmanned aerial vehicles (UAVs) booms, there is an increasing number of small, teleoperated or autonomous aircraft found in protected or sensitive airspace. Existing solutions for removal of these aircraft are either military-grade and too disruptive for domestic use, or compose of cumbersomely teleoperated counter-UAV vehicles that have proven ineffective in high-profile domestic cases. In this work, we examine the use of a quadrotor for autonomously targeting semi-stationary and moving aerial objects with little or no prior knowledge of the target’s flight characteristics. Guidance and control commands are generated with information just from an onboard monocular camera. We draw inspiration from literature in missile guidance, and demonstrate an optimal guidance method implemented on a quadrotor but not usable by missiles. Results are presented for first-pass hit success and pursuit duration with various methods. Finally, we cover the CMU Team Tartan entry in the MBZIRC 2020 Challenge 1 competition, demonstrating the effectiveness of simple line-of-sight guidance methods in a structured competition setting.
Is Automated Topic Model Evaluation Broken?: The Incoherence of Coherence

Topic model evaluation, like evaluation of other unsupervised methods, can be contentious. However, the field has coalesced around automated estimates of topic coherence, which rely on the frequency of word co-occurrences in a reference corpus. Contemporary neural topic models surpass classical ones according to these metrics. At the same time, topic model evaluation suffers from a validation gap: automated coherence, developed for classical models, has not been validated using human experimentation for neural models. In addition, a meta-analysis of topic modeling literature reveals a substantial standardization gap in automated topic modeling benchmarks. To address the validation gap, we compare automated coherence with the two most widely accepted human judgment tasks: topic rating and word intrusion. To address the standardization gap, we systematically evaluate a dominant classical model and two state-of-the-art neural models on two commonly used datasets. Automated evaluations declare a winning model when corresponding human evaluations do not, calling into question the validity of fully automatic evaluations independent of human judgments.
DeepRapper: Neural Rap Generation with Rhyme and Rhythm Modeling

Rap generation, which aims to produce lyrics and corresponding singing beats, needs to model both rhymes and rhythms. Previous works for rap generation focused on rhyming lyrics, but ignored rhythmic beats, which are important for rap performance. In this paper, we develop DeepRapper, a Transformer-based rap generation system that can model both rhymes and rhythms. Since there is no available rap datasets with rhythmic beats, we develop a data mining pipeline to collect a large-scale rap dataset, which includes a large number of rap songs with aligned lyrics and rhythmic beats. Second, we design a Transformer-based autoregressive language model which carefully models rhymes and rhythms. Specifically, we generate lyrics in the reverse order with rhyme representation and constraint for rhyme enhancement, and insert a beat symbol into lyrics for rhythm/beat modeling. To our knowledge, DeepRapper is the first system to generate rap with both rhymes and rhythms. Both objective and subjective evaluations demonstrate that DeepRapper generates creative and high-quality raps with rhymes and rhythms.
Sensor-invariant Fingerprint ROI Segmentation Using Recurrent Adversarial Learning

A fingerprint region of interest (roi) segmentation algorithm is designed to separate the foreground fingerprint from the background noise. All the learning based state-of-the-art fingerprint roi segmentation algorithms proposed in the literature are benchmarked on scenarios when both training and testing databases consist of fingerprint images acquired from the same sensors. However, when testing is conducted on a different sensor, the segmentation performance obtained is often unsatisfactory. As a result, every time a new fingerprint sensor is used for testing, the fingerprint roi segmentation model needs to be re-trained with the fingerprint image acquired from the new sensor and its corresponding manually marked ROI. Manually marking fingerprint ROI is expensive because firstly, it is time consuming and more importantly, requires domain expertise. In order to save the human effort in generating annotations required by state-of-the-art, we propose a fingerprint roi segmentation model which aligns the features of fingerprint images derived from the unseen sensor such that they are similar to the ones obtained from the fingerprints whose ground truth roi masks are available for training. Specifically, we propose a recurrent adversarial learning based feature alignment network that helps the fingerprint roi segmentation model to learn sensor-invariant features. Consequently, sensor-invariant features learnt by the proposed roi segmentation model help it to achieve improved segmentation performance on fingerprints acquired from the new sensor. Experiments on publicly available FVC databases demonstrate the efficacy of the proposed work.
The Propagation of Strong Shocks into Planetary and Stellar Atmospheres

In this work we present a mathematical model for the propagation of the shock waves that occur in graded density profiles. These waves can occur in a wide range of astrophysical events, such as collisions in planetary and stellar atmospheres, common envelope explosions and peculiar type Ia supernovae. The behaviour of the shock wave and its evolution can be modelled using type II self similar solutions. In such solutions the evolution of the shock wave is determined by boundary conditions at the shock front and a singular point in the shocked region. We show how the evolution can be determined for different equations of state and density profiles, and compare these results to numerical simulations. These findings are also applied to a variety of astrophysical phenomena to further test their validity.
Learning Hierarchical Graph Neural Networks for Image Clustering

We propose a hierarchical graph neural network (GNN) model that learns how to cluster a set of images into an unknown number of identities using a training set of images annotated with labels belonging to a disjoint set of identities. Our hierarchical GNN uses a novel approach to merge connected components predicted at each level of the hierarchy to form a new graph at the next level. Unlike fully unsupervised hierarchical clustering, the choice of grouping and complexity criteria stems naturally from supervision in the training set. The resulting method, Hi-LANDER, achieves an average of 49% improvement in F-score and 7% increase in Normalized Mutual Information (NMI) relative to current GNN-based clustering algorithms. Additionally, state-of-the-art GNN-based methods rely on separate models to predict linkage probabilities and node densities as intermediate steps of the clustering process. In contrast, our unified framework achieves a three-fold decrease in computational cost. Our training and inference code are released 1.
Provable Convergence of Nesterov Accelerated Method for Over-Parameterized Neural Networks

—Despite the empirical success of deep learning, it still lacks theoretical understandings to explain why randomly initialized neural network trained by ﬁrst-order optimization methods is able to achieve zero training loss, even though its landscape is non-convex and non-smooth. Recently, there are some works to demystiﬁes this phenomenon under over-parameterized regime. In this work, we make a further progress on this area by considering a commonly used momentum optimization algorithm: Nesterov accelerated method (NAG). We analyze the convergence of NAG for two-layer fully connected neural network with ReLU activation. Speciﬁcally, we prove that the error of NAG converges to zero at a linear convergence rate 1 − Θ(1 / √ κ ) , where κ > 1 is determined by the initialization and the architecture of neural network. Comparing to the rate 1 − Θ(1 /κ ) of gradient descent, NAG achieves an acceleration. Besides, it also validates NAG and Heavy-ball method can achieve a similar convergence rate.
Do Different Tracking Tasks Require Different Appearance Models?

Tracking objects of interest in a video is one of the most popular and widely applicable problems in computer vision. However, with the years, a Cambrian explosion of use cases and benchmarks has fragmented the problem in a multitude of different experimental setups. As a consequence, the literature has fragmented too, and now novel approaches proposed by the community are usually specialised to fit only one specific setup. To understand to what extent this specialisation is necessary, in this work we present UniTrack, a solution to address five different tasks within the same framework. UniTrack consists of a single and task-agnostic appearance model, which can be learned in a supervised or self-supervised fashion, and multiple ``heads'' that address individual tasks and do not require training. We show how most tracking tasks can be solved within this framework, and that the same appearance model can be successfully used to obtain results that are competitive against specialised methods for most of the tasks considered. The framework also allows us to analyse appearance models obtained with the most recent self-supervised methods, thus extending their evaluation and comparison to a larger variety of important problems.
The HCCL Speaker Verification System for Far-Field Speaker Verification Challenge

This paper describes the systems submitted by team HCCL to the Far-Field Speaker Verification Challenge. Our previous work in the AIshell Speaker Verification Challenge 2019 shows that the powerful modeling abilities of Neural Network architectures can provide exceptional performance for this kind of task. Therefore, in this challenge, we focus on constructing deep Neural Network architectures based on TDNN, Resnet and Res2net blocks. Most of the developed systems consist of Neural Network embeddings are applied with PLDA backend. Firstly, the speed perturbation method is applied to augment data and significant performance improvements are achieved. Then, we explore the use of AMsoftmax loss function and propose to join a CE-loss branch when we train model using AMsoftmax loss. In addition, the impact of score normalization on performance is also investigated. The final system, a fusion of four systems, achieves minDCF 0.5342, EER 5.05\% on task1 eval set, and achieves minDCF 0.5193, EER 5.47\% on task3 eval set.
Control of Rough Terrain Vehicles Using Deep Reinforcement Learning

We explore the potential to control terrain vehicles using deep reinforcement in scenarios where human operators and traditional control methods are inadequate. This letter presents a controller that perceives, plans, and successfully controls a 16-tonne forestry vehicle with two frame articulation joints, six wheels, and their actively articulated suspensions to traverse rough terrain. The carefully shaped reward signal promotes safe, environmental, and efficient driving, which leads to the emergence of unprecedented driving skills. We test learned skills in a virtual environment, including terrains reconstructed from high-density laser scans of forest sites. The controller displays the ability to handle obstructing obstacles, slopes up to 27$^\circ$, and a variety of natural terrains, all with limited wheel slip, smooth, and upright traversal with intelligent use of the active suspensions. The results confirm that deep reinforcement learning has the potential to enhance control of vehicles with complex dynamics and high-dimensional observation data compared to human operators or traditional control methods, especially in rough terrain.
When Are Learned Models Better Than Hash Functions?

In this work, we aim to study when learned models are better hash functions, particular for hash-maps. We use lightweight piece-wise linear models to replace the hash functions as they have small inference times and are sufficiently general to capture complex distributions. We analyze the learned models in terms of: the model inference time and the number of collisions. Surprisingly, we found that learned models are not much slower to compute than hash functions if optimized correctly. However, it turns out that learned models can only reduce the number of collisions (i.e., the number of times different keys have the same hash value) if the model is able to over-fit to the data; otherwise, it can not be better than an ordinary hash function. Hence, how much better a learned model is in avoiding collisions highly depends on the data and the ability of the model to over-fit. To evaluate the effectiveness of learned models, we used them as hash functions in the bucket chaining and Cuckoo hash tables. For bucket chaining hash table, we found that learned models can achieve 30% smaller sizes and 10% lower probe latency. For Cuckoo hash tables, in some datasets, learned models can increase the ratio of keys stored in their primary locations by around 10%. In summary, we found that learned models can indeed outperform hash functions but only for certain data distributions and with a limited margin.