Miracle-dz/UniFAR-FTUs huggingface dataset:
The dynamics and stability of flows around rolling bluff bodies

A numerical and experimental study of the flow around rolling and sliding bodies is presented. The geometry of the body is either spherical or cylindrical, and the Reynolds number, based on the diameter and the translation speed of the body, is limited to values lower than 500. The aim of this study is to understand the combined effects of rotation and the presence of a wall on the wake of a bluff body when these two effects are acting simultaneously. In the case of a cylinder travelling along a wall, two- and three-dimensional simulations, as well as a linear stability analysis were carried out. When considering the flow around a sphere rolling or slipping along a wall, both experiments and three-dimensional simulations were utilised. The parameter space considered is defined by the Reynolds number and the non-dimensional rate of rotation of the body. Five values of rotation were considered. These describe motions ranging from "normal"rolling, where there is no slip between the body and the wall, to ‘reversed' rotation, where the body turns in the opposite direction. The numerical scheme uses a spectral element method to simulate the flow in two and three dimensions. Laboratory experiments were carried out in a closed circuit water channel, equipped with a moving floor and boundary layer suction. Dye visualization was then used to identify the different vortical structures present in the wake of the cylinder and sphere.
ZeroQuant-FP: A Leap Forward in LLMs Post-Training W4A8 Quantization Using Floating-Point Formats

In the complex domain of large language models (LLMs), striking a balance between computational efficiency and maintaining model quality is a formidable challenge. Navigating the inherent limitations of uniform quantization, particularly when dealing with outliers, and motivated by the launch of NVIDIA's H100 hardware, this study delves into the viability of floating-point (FP) quantization, particularly focusing on FP8 and FP4, as a potential solution. Our comprehensive investigation reveals that for LLMs, FP8 activation consistently outshines its integer (INT8) equivalent, with the performance edge becoming more noticeable in models possessing parameters beyond one billion. For weight quantization, our findings indicate that FP4 exhibits comparable, if not superior, performance to INT4, simplifying deployment on FP-supported hardware like H100. To mitigate the overhead from precision alignment caused by the disparity between weights and activations, we propose two scaling constraints for weight quantization that negligibly impact the performance compared to the standard W4A8 model. We additionally enhance our quantization methods by integrating the Low Rank Compensation (LoRC) strategy, yielding improvements especially in smaller models. The results of our investigation emphasize the immense potential of FP quantization for LLMs, paving the way for high-efficiency deployment in resource-limited settings.
Retrieving Continuous Time Event Sequences using Neural Temporal Point Processes with Learnable Hashing

Temporal sequences have become pervasive in various real-world applications. Consequently, the volume of data generated in the form of continuous time-event sequence(s) or CTES(s) has increased exponentially in the past few years. Thus, a significant fraction of the ongoing research on CTES datasets involves designing models to address downstream tasks such as next-event prediction, long-term forecasting, sequence classification etc. The recent developments in predictive modeling using marked temporal point processes (MTPP) have enabled an accurate characterization of several real-world applications involving the CTESs. However, due to the complex nature of these CTES datasets, the task of large-scale retrieval of temporal sequences has been overlooked by the past literature. In detail, by CTES retrieval we mean that for an input query sequence, a retrieval system must return a ranked list of relevant sequences from a large corpus. To tackle this, we propose NeuroSeqRet, a first-of-its-kind framework designed specifically for end-to-end CTES retrieval. Specifically, NeuroSeqRet introduces multiple enhancements over standard retrieval frameworks and first applies a trainable unwarping function on the query sequence which makes it comparable with corpus sequences, especially when a relevant query-corpus pair has individually different attributes. Next, it feeds the unwarped query sequence and the corpus sequence into MTPP-guided neural relevance models. We develop four variants of the relevance model for different kinds of applications based on the trade-off between accuracy and efficiency. We also propose an optimization framework to learn binary sequence embeddings from the relevance scores, suitable for the locality-sensitive hashing. Our experiments show the significant accuracy boost of NeuroSeqRet as well as the efficacy of our hashing mechanism.
Improved Metropolis–Hastings algorithms via landscape modification with applications to simulated annealing and the Curie–Weiss model

In this paper, we propose new Metropolis–Hastings and simulated annealing algorithms on a finite state space via modifying the energy landscape. The core idea of landscape modification rests on introducing a parameter c, such that the landscape is modified once the algorithm is above this threshold parameter to encourage exploration, while the original landscape is utilized when the algorithm is below the threshold for exploitation purposes. We illustrate the power and benefits of landscape modification by investigating its effect on the classical Curie–Weiss model with Glauber dynamics and external magnetic field in the subcritical regime. This leads to a landscape-modified mean-field equation, and with appropriate choice of c the free energy landscape can be transformed from a double-well into a single-well landscape, while the location of the global minimum is preserved on the modified landscape. Consequently, running algorithms on the modified landscape can improve the convergence to the ground state in the Curie–Weiss model. In the setting of simulated annealing, we demonstrate that landscape modification can yield improved or even subexponential mean tunnelling time between global minima in the low-temperature regime by appropriate choice of c, and we give a convergence guarantee using an improved logarithmic cooling schedule with reduced critical height. We also discuss connections between landscape modification and other acceleration techniques, such as Catoni’s energy transformation algorithm, preconditioning, importance sampling, and quantum annealing. The technique developed in this paper is not limited to simulated annealing, but is broadly applicable to any difference-based discrete optimization algorithm by a change of landscape.
Cooperation in crowd work: Attitude and perception of freelancers on a knowledge work platform

Existing literature predominantly focuses on how freelancers individually complete tasks and projects. Our study examines freelancers' willingness to work collaboratively. We report results from a survey of 122 freelancers on a leading online labor market platform (Upwork) and examine freelancers' preferences for collaboration and explore several antecedents of cooperative behaviors. We then test if actual cooperative behavior matches with freelancers' stated preferences through an incentivized social dilemma experiment. We find that respondents cooperate at a higher rate (85%) than reported in previous comparable studies (between 50-75%). This high rate of cooperation may be explained by an ingroup bias. Using a sequential mediation model we demonstrate the importance of a sense of shared expectations and accountability for cooperation. We contribute to a better understanding of the potential for collaborative work on online labor market platforms by assessing if and what social factors and collective culture exist among freelancers. We discuss the implications of our results for platform designers by highlighting the importance of platform features that promote shared expectations and improve accountability. Overall, contrary to existing literature and predictions, our results suggest that freelancers in our sample display traits that are more consistent with belonging to a coherent group with a shared collective culture, rather than being anonymous actors in a transaction-based market.
Density-invariant Features for Distant Point Cloud Registration

Registration of distant outdoor LiDAR point clouds is crucial to extending the 3D vision of collaborative autonomous vehicles, and yet is challenging due to small overlapping area and a huge disparity between observed point densities. In this paper, we propose Group-wise Contrastive Learning (GCL) scheme to extract density-invariant geometric features to register distant outdoor LiDAR point clouds. We mark through theoretical analysis and experiments that, contrastive positives should be independent and identically distributed (i.i.d.), in order to train density-invariant feature extractors. We propose upon the conclusion a simple yet effective training scheme to force the feature of multiple point clouds in the same spatial location (referred to as positive groups) to be similar, which naturally avoids the sampling bias introduced by a pair of point clouds to conform with the i.i. d. principle. The resulting fully-convolutional feature extractor is more powerful and density-invariant than state-of-the-art methods, improving the registration recall of distant scenarios on KITTI and nuScenes benchmarks by 40.9% and 26.9%, respectively. Code is available at https://github.com/liuQuan98/GCL.
Text2Layer: Layered Image Generation using Latent Diffusion Model

Layer compositing is one of the most popular image editing workflows among both amateurs and professionals. Motivated by the success of diffusion models, we explore layer compositing from a layered image generation perspective. Instead of generating an image, we propose to generate background, foreground, layer mask, and the composed image simultaneously. To achieve layered image generation, we train an autoencoder that is able to reconstruct layered images and train diffusion models on the latent representation. One benefit of the proposed problem is to enable better compositing workflows in addition to the high-quality image output. Another benefit is producing higher-quality layer masks compared to masks produced by a separate step of image segmentation. Experimental results show that the proposed method is able to generate high-quality layered images and initiates a benchmark for future work.
The semantic landscape paradigm for neural networks

Deep neural networks exhibit a fascinating spectrum of phenomena ranging from predictable scaling laws to the unpredictable emergence of new capabilities as a function of training time, dataset size and network size. Analysis of these phenomena has revealed the existence of concepts and algorithms encoded within the learned representations of these networks. While significant strides have been made in explaining observed phenomena separately, a unified framework for understanding, dissecting, and predicting the performance of neural networks is lacking. Here, we introduce the semantic landscape paradigm, a conceptual and mathematical framework that describes the training dynamics of neural networks as trajectories on a graph whose nodes correspond to emergent algorithms that are instrinsic to the learned representations of the networks. This abstraction enables us to describe a wide range of neural network phenomena in terms of well studied problems in statistical physics. Specifically, we show that grokking and emergence with scale are associated with percolation phenomena, and neural scaling laws are explainable in terms of the statistics of random walks on graphs. Finally, we discuss how the semantic landscape paradigm complements existing theoretical and practical approaches aimed at understanding and interpreting deep neural networks.
Dynamics of an Evaporating Drop Migrating in a Poiseuille Flow

The evaporation of a liquid drop of initial diameter (Ddrop) migrating in a tube of diameter (D0) is investigated using the coupled level set and volume of fluid (CLSVOF) method focusing on determining the heat and mass transfer coefficients for a deforming drop. A robust phase change model is developed using an embedded boundary method under a finite difference framework to handle vaporizing flows. The model is extensively validated through simulations of benchmark problems such as arbitrary evaporation of a static drop and reproduction of psychrometric data. The results show that the Sherwood number (Sh) and the Nusselt number (Nu) reach a steady value after an initial transient period for the drop subjected to Hagen-Poiseuille flow. A parametric study is conducted to investigate the effect of drop deformation on the rate of evaporation. It is observed that Stefan flow due to evaporation has a negligible impact on the drop deformation dynamics. We also observed that, for different values of Ddrop/D0, the Sh follows a linear correlation with Re1/2Sc1/3.
Thermodynamics of percolation in interacting systems

Interacting systems can be studied as the networks where nodes are system units and edges denote correlated interactions. Although percolation on network is a unified way to model the emergence and propagation of correlated behaviours, it remains unknown how the dynamics characterized by percolation is related to the thermodynamics of phase transitions. It is non-trivial to formalize thermodynamics for most complex systems, not to mention calculating thermodynamic quantities and verifying scaling relations during percolation. In this work, we develop a formalism to quantify the thermodynamics of percolation in interacting systems, which is rooted in a discovery that percolation transition is a process for the system to lose the freedom degrees associated with ground state configurations. We derive asymptotic formulas to accurately calculate entropy and specific heat under our framework, which enables us to detect phase transitions and demonstrate the Rushbrooke equality (i.e., $\alpha+2\beta+\gamma=2$) in six representative complex systems (e.g., Bernoulli and bootstrap percolation, classical and quantum synchronization, non-linear oscillations with damping, and cellular morphogenesis). These results suggest the general applicability of our framework in analyzing diverse interacting systems and percolation processes.
Accelerating End-host Congestion Response using P4 Programmable Switches

Transport layer congestion control relies on feedback signals that travel from the congested link to the receiver and back to the sender. This forward congestion control loop, first, requires at least one rount-trip time (RTT) to react to congestion and secondly, it depends on the downstream path after the bottleneck. The former property leads to a reaction time in the order of RTT + bottleneck queue delay, while the second may amplify the unfairness due to heterogeneous RTT. In this paper, we present Reverse Path Congestion Marking (RPM) to accelerate the reaction to network congestion events without changing the end-host stack. RPM decouples the congestion signal from the downstream path after the bottleneck while maintaining the stability of the congestion control loop. We show that RPM improves throughput fairness for RTT-heterogeneous TCP flows as well as the flow completion time, especially for small Data Center TCP (DCTCP) flows. Finally, we show RPM evaluation results in a testbed built around P4 programmable ASIC switches.
Bad is null

In this paper we develop a general framework of badly approximable points in a metric space $X$ equipped with a $\sigma$-finite doubling Borel regular measure $\mu$. We establish that under mild assumptions the $\mu$-measure of the set of badly approximable points is always zero. The framework can be applied to a variety of settings in Diophantine approximation and dynamical systems, which we also consider, including weighted and $S$-arithmetic Diophantine approximations, Diophantine approximation on manifolds and intrinsic approximations on fractals.
Development of a High-order Finite-volume Method for the Navier-Stokes Equations in Three Dimensions

Development of a High-Order Finite-Volume Method for the Navier-Stokes Equations in Three Dimensions Ramy Rashad Masters of Applied Science Graduate Department of Aerospace Engineering University of Toronto 2009 The continued research and development of high-order methods in Computational Fluid Dynamics (CFD) is primarily motivated by their potential to significantly reduce the computational cost and memory usage required to obtain a solution to a desired level of accuracy. In this work, a high-order Central Essentially Non-Oscillatory (CENO) finite-volume scheme is developed for the Euler and Navier-Stokes equations in three dimensions. The proposed CENO scheme is based on a hybrid solution reconstruction procedure using a fixed central stencil. A solution smoothness indicator facilitates the hybrid switching between a high-order k-exact reconstruction technique, and a monotonicity preserving limited piecewise linear reconstruction algorithm. The resulting scheme is applied to the compressible forms of the Euler and Navier-Stokes equations in three dimensions. The latter of which includes the application of this high-order work to the Large Eddy Simulation (LES) of turbulent non-reacting flows.
Adversarial Latent Autoencoder with Self-Attention for Structural Image Synthesis

Generative Engineering Design approaches driven by Deep Generative Models (DGM) have been proposed to facilitate industrial engineering processes. In such processes, designs often come in the form of images, such as blueprints, engineering drawings, and CAD models depending on the level of detail. DGMs have been successfully employed for synthesis of natural images, e.g., displaying animals, human faces and landscapes. However, industrial design images are fundamentally different from natural scenes in that they contain rich structural patterns and long-range dependencies, which are challenging for convolution-based DGMs to generate. Moreover, DGM-driven generation process is typically triggered based on random noisy inputs, which outputs unpredictable samples and thus cannot perform an efficient industrial design exploration. We tackle these challenges by proposing a novel model Self-Attention Adversarial Latent Autoencoder (SA-ALAE), which allows generating feasible design images of complex engineering parts. With SA-ALAE, users can not only explore novel variants of an existing design, but also control the generation process by operating in latent space. The potential of SA-ALAE is shown by generating engineering blueprints in a real automotive design task.
A Unified Framework for Pattern Recovery in Penalized and Thresholded Estimation and its Geometry

We consider the framework of penalized estimation where the penalty term is given by a real-valued polyhedral gauge, which encompasses methods such as LASSO (and many variants thereof such as the generalized LASSO), SLOPE, OSCAR, PACS and others. Each of these estimators can uncover a different structure or ``pattern'' of the unknown parameter vector. We define a general notion of patterns based on subdifferentials and formalize an approach to measure pattern complexity. For pattern recovery, we provide a minimal condition for a particular pattern to be detected by the procedure with positive probability, the so-called accessibility condition. Using our approach, we also introduce the stronger noiseless recovery condition. For the LASSO, it is well known that the irrepresentability condition is necessary for pattern recovery with probability larger than $1/2$ and we show that the noiseless recovery plays exactly the same role, thereby extending and unifying the irrepresentability condition of the LASSO to a broad class of penalized estimators. We also show that the noiseless recovery condition can be relaxed when turning to thresholded penalized estimators, extending the idea of the thresholded LASSO: we prove that the accessibility condition is already sufficient (and necessary) for sure pattern recovery by thresholded penalized estimation provided that the signal of the pattern is large enough. Throughout the article, we demonstrate how our findings can be interpreted through a geometrical lens.
Robust control of nonlinear semi‐strict feedback systems using finite‐time disturbance observers

The output tracking controller design problem is dealt with for a class of nonlinear semi‐strict feedback systems in the presence of mismatched nonlinear uncertainties, external disturbances, and uncertain nonlinear virtual control coefficients of the subsystems. The controller is designed in a backstepping manner, and to avoid the shortcoming of ‘explosion of terms’, the dynamic surface control technique that employs a group of first‐order low‐pass filters is adopted. At each step of the virtual controller design, a robust feedback controller employing some effective nonlinear damping terms is designed to guarantee input‐to‐state practical stable property of the corresponding subsystem, so that the system states remain in the feasible domain. The virtual controller is enhanced by a finite‐time disturbance observer that estimates the disturbance term in a finite‐time. The properties of the composite control system are analyzed theoretically. Furthermore, by exploiting the cascaded structure of the control system, a simplified robust controller is proposed where only the first subsystem employs a disturbance observer. The performance of the proposed methods is confirmed by numerical examples. Copyright © 2017 John Wiley & Sons, Ltd.
Longitudinal Data and a Semantic Similarity Reward for Chest X-Ray Report Generation

The current burnout rate of radiologists is high due to the large and ever growing number of Chest X-Rays (CXRs) needing interpretation and reporting. Promisingly, automatic CXR report generation has the potential to aid radiologists with this laborious task and improve patient care. Previous CXR report generation methods are limited by their diagnostic inaccuracy and their lack of alignment with the work-flow of radiologists. To address these issues, we present a new method that utilises the longitudinal history available from a patient’s previous CXR study when generating a report, which imitates a radiologist’s workflow. We also pro-pose a new reward for reinforcement learning based on CXR-BERT — which captures the clinical semantic similarity be-tween reports — to further improve CXR report generation. We conduct experiments on the publicly available MIMIC-CXR dataset with metrics more closely correlated with radi-ologists’ assessment of reporting. The results indicate capturing a patient’s longitudinal history improves CXR report generation and that CXR-BERT is a promising alternative to the current state-of-the-art reward. Our approach generates radiology reports that are quantitatively more aligned with those of radiologists than previous methods while simultaneously offering a better pathway to clinical translation. Our Hugging Face checkpoint (https://huggingface.co/aehrc/cxrmate) and code (https://github.com/aehrc/cxrmate) are publicly available.