Miracle-dz/UniFAR-FTUs huggingface dataset:
GeoScaler: Geometry and Rendering-Aware Downsampling of 3D Mesh Textures

High-resolution texture maps are necessary for representing real-world objects accurately with 3D meshes. The large sizes of textures can bottleneck the real-time rendering of high-quality virtual 3D scenes on devices having low computational budgets and limited memory. Downsampling the texture maps directly addresses the issue, albeit at the cost of visual fidelity. Traditionally, downsampling of texture maps is performed using methods like bicubic interpolation and the Lanczos algorithm. These methods ignore the geometric layout of the mesh and its UV parametrization and also do not account for the rendering process used to obtain the final visualization that the users will experience. Towards filling these gaps, we introduce GeoScaler, which is a method of downsampling texture maps of 3D meshes while incorporating geometric cues, and by maximizing the visual fidelity of the rendered views of the textured meshes. We show that the textures generated by GeoScaler deliver significantly better quality rendered images compared to those generated by traditional downsampling methods
CharacterGLM: Customizing Chinese Conversational AI Characters with Large Language Models

In this paper, we present CharacterGLM, a series of models built upon ChatGLM, with model sizes ranging from 6B to 66B parameters. Our CharacterGLM is designed for generating Character-based Dialogues (CharacterDial), which aims to equip a conversational AI system with character customization for satisfying people's inherent social desires and emotional needs. On top of CharacterGLM, we can customize various AI characters or social agents by configuring their attributes (identities, interests, viewpoints, experiences, achievements, social relationships, etc.) and behaviors (linguistic features, emotional expressions, interaction patterns, etc.). Our model outperforms most mainstream close-source large langauge models, including the GPT series, especially in terms of consistency, human-likeness, and engagement according to manual evaluations. We will release our 6B version of CharacterGLM and a subset of training data to facilitate further research development in the direction of character-based dialogue generation.
Chapter 22 Precambrian metallic mineralization in India

Abstract Four Archaean cratons (Aravalli–Bundelkhand, Singhbhum, Bastar and Dharwar), together with the marginal Proterozoic mobile belts and sedimentary basins, constitute the geology of peninsular India. Huge resources of ferrous metals (Fe and Mn) and chromite, the lone granitoid-hosted Malanjkhand Cu–Mo deposit, a moderate occurrence of gold and promising platinum group element mineralization constitute the Archaean metal inventory of India. Additionally, the Proterozoic Aeon witnessed diverse mineralization in the mobile belts and craton–mobile belt contacts. These include vast resources of base metals in the northwestern Indian Shield and Mn in the central Indian block, apart from considerable U–Cu deposits in the Singhbhum Shear Zone. These ores formed as a consequence of an entire genetic spectrum, covering various orthomagmatic, volcanosedimentary and diverse hydrothermal processes, aided and abetted by supergene enrichment, as in the case of iron ores.
Robust Self-calibration of Focal Lengths from the Fundamental Matrix

The problem of self-calibration of two cameras from a given fundamental matrix is one of the basic problems in geometric computer vision. Under the assumption of known principal points and square pixels, the well-known Bougnoux formula offers a means to compute the two unknown focal lengths. However, in many practical situations, the formula yields inaccurate results due to commonly occurring singularities. Moreover, the estimates are sensitive to noise in the computed fundamental matrix and to the assumed positions of the principal points. In this paper, we therefore propose an efficient and robust iterative method to estimate the focal lengths along with the principal points of the cameras given a fundamental matrix and priors for the estimated camera parameters. In addition, we study a computationally efficient check of models generated within RANSAC that improves the accuracy of the estimated models while reducing the total computational time. Extensive experiments on real and synthetic data show that our iterative method brings significant improvements in terms of the accuracy of the estimated focal lengths over the Bougnoux formula and other state-of-the-art methods, even when relying on inaccurate priors.
Estimates of size of cycle in a predator-prey system II

We prove estimates for the maximal and minimal predator and prey populations on the unique limit cycle in a standard predator-prey system. Our estimates are valid when the cycle exhibits small predator and prey abundances and large amplitudes. The proofs consist of constructions of several Lyapunov-type functions and derivation of a large number of non-trivial estimates, and should be of independent interest. This study generalizes results proved by the authors in (Differ Equ Dyn Syst 30, 131-159 (2022)) to a wider class of systems and, in addition, it gives simpler proofs of some already known estimates.
Nonlinear Landau Fan Diagram for Graphene Electrons Exposed to a Moiré Potential

Due to Landau quantization, the conductance of two-dimensional electrons exposed to a perpendicular magnetic field exhibits oscillations that generate a fan of linear trajectories when plotted in the parameter space spanned by density and field. This fan looks identical, irrespective of the dispersion and field dependence of the Landau level energy. This is no surprise because the position of conductance minima depends solely on the level degeneracy that is linear in flux. The fractal energy spectrum that emerges within each Landau band when electrons are also exposed to a two-dimensional superlattice potential produces numerous additional oscillations, but they also create just linear fans for identical reasons. Here, we report conductance oscillations of graphene electrons exposed to a moiré potential that defy this general rule and form nonlinear trajectories in the density-field plane. We attribute this anomalous behavior to the simultaneous occupation of multiple minibands and magnetic breakdown-induced open orbits.
Advancing state estimation for lithium-ion batteries with hysteresis: systematic extended Kalman filter tuning

Knowledge of remaining battery charge is fundamental to electric vehicle deployment. Accurate measurements of state-of-charge (SOC) cannot be directly obtained, and estimation methods must be used instead. This requires both a good model of a battery and a well-designed state estimator. Here, hysteretic reduced-order battery models and adaptive extended Kalman filter estimators are shown to be highly effective, accurate SOC estimators. A battery model parameterisation framework is proposed, which enhances standardised methods to capture hysteresis effects. The hysteretic model is parameterised for three independent NMC811 lithium-ion cells and is shown to reduce voltage RMS error by 50% across 18-hour automotive drive-cycles. Parameterised models are used alongside an extended Kalman filter, which demonstrates the value of adaptive filter parameterisation schemes. When used alongside an extended Kalman filter, adaptive covariance matrices yield highly accurate SOC estimates, reducing SOC estimation error by 85%, compared to the industry standard battery model.
On robust overfitting: adversarial training induced distribution matters

Adversarial training may be regarded as standard training with a modified loss function. But its generalization error appears much larger than standard training under standard loss. This phenomenon, known as robust overfitting, has attracted significant research attention and remains largely as a mystery. In this paper, we first show empirically that robust overfitting correlates with the increasing generalization difficulty of the perturbation-induced distributions along the trajectory of adversarial training (specifically PGD-based adversarial training). We then provide a novel upper bound for generalization error with respect to the perturbation-induced distributions, in which a notion of the perturbation operator, referred to"local dispersion", plays an important role. Experimental results are presented to validate the usefulness of the bound and various additional insights are provided.
Tracking a Year of Polarized Twitter Discourse on Abortion

Abortion is one of the most contentious issues in American politics. The Dobbs v. Jackson Women's Health Organization ruling in 2022, which shifted the authority to regulate abortion from the federal government to the states, triggering intense protests and emotional debates across the nation. Yet, little is known about how online discourse about abortion rights fluctuated on social media platforms. This study analyzes a corpus of over 57M abortion-related tweets from January 2022 to January 2023 to show how emotions, hateful rhetoric, toxic speech, use of obscenities and insults, and also framing strategies fluctuated over the span of one year among liberal and conservative users. We offer three key findings. (1) Fluctuations in emotions were temporary; key events during the analyzed period did not bring about lasting shifts in expressed emotions. (2) We observe significant ideological differences in the use of hate speech: conservatives resorted to hateful rhetoric more than liberals. Yet, liberals were especially likely to use obscenities and insults, especially on the days the ruling was leaked and after the Dobbs decision. In turn, toxic language sharply increased among both groups following the leak and after the SCOTUS ruling. (3) Conservatives employ religious and fetal personhood frames, while liberals emphasize women's health and bodily autonomy, with each group reacting negatively to the other group's frames. Our results offer an in-depth insight into the dynamics of online discourse on one of the most contentious issues in contemporary America.
A Distribution-Based Threshold for Determining Sentence Similarity

We hereby present a solution to a semantic textual similarity (STS) problem in which it is necessary to match two sentences containing, as the only distinguishing factor, highly specific information (such as names, addresses, identification codes), and from which we need to derive a definition for when they are similar and when they are not. The solution revolves around the use of a neural network, based on the siamese architecture, to create the distributions of the distances between similar and dissimilar pairs of sentences. The goal of these distributions is to find a discriminating factor, that we call"threshold", which represents a well-defined quantity that can be used to distinguish vector distances of similar pairs from vector distances of dissimilar pairs in new predictions and later analyses. In addition, we developed a way to score the predictions by combining attributes from both the distributions' features and the way the distance function works. Finally, we generalize the results showing that they can be transferred to a wider range of domains by applying the system discussed to a well-known and widely used benchmark dataset for STS problems.
FP-Fed: Privacy-Preserving Federated Detection of Browser Fingerprinting

Browser fingerprinting often provides an attractive alternative to third-party cookies for tracking users across the web. In fact, the increasing restrictions on third-party cookies placed by common web browsers and recent regulations like the GDPR may accelerate the transition. To counter browser fingerprinting, previous work proposed several techniques to detect its prevalence and severity. However, these rely on 1) centralized web crawls and/or 2) computationally intensive operations to extract and process signals (e.g., information-flow and static analysis). To address these limitations, we present FP-Fed, the first distributed system for browser fingerprinting detection. Using FP-Fed, users can collaboratively train on-device models based on their real browsing patterns, without sharing their training data with a central entity, by relying on Differentially Private Federated Learning (DP-FL). To demonstrate its feasibility and effectiveness, we evaluate FP-Fed's performance on a set of 18.3k popular websites with different privacy levels, numbers of participants, and features extracted from the scripts. Our experiments show that FP-Fed achieves reasonably high detection performance and can perform both training and inference efficiently, on-device, by only relying on runtime signals extracted from the execution trace, without requiring any resource-intensive operation.
Q-Pilot: Field Programmable Quantum Array Compilation with Flying Ancillas

Neutral atom arrays have become a promising platform for quantum computing, especially the \textit{field programmable qubit array} (FPQA) endowed with the unique capability of atom movement. This feature allows dynamic alterations in qubit connectivity during runtime, which can reduce the cost of executing long-range gates and improve parallelism. However, this added flexibility introduces new challenges in circuit compilation. Inspired by the placement and routing strategies for FPGAs, we propose to map all data qubits to fixed atoms while utilizing movable atoms to route for 2-qubit gates between data qubits. Coined \textit{flying ancillas}, these mobile atoms function as ancilla qubits, dynamically generated and recycled during execution. We present Q-Pilot, a scalable compiler for FPQA employing flying ancillas to maximize circuit parallelism. For two important quantum applications, quantum simulation and the Quantum Approximate Optimization Algorithm (QAOA), we devise domain-specific routing strategies. In comparison to alternative technologies such as superconducting devices or fixed atom arrays, Q-Pilot effectively harnesses the flexibility of FPQA, achieving reductions of 1.4$\times$, 27.7$\times$, and 6.3$\times$ in circuit depth for 100-qubit random, quantum simulation, and QAOA circuits, respectively.
Lane-Keeping Control of Autonomous Vehicles Through a Soft-Constrained Iterative LQR

The accurate prediction of smooth steering inputs is crucial for autonomous vehicle applications because control actions with jitter might cause the vehicle system to become unstable. To address this problem in automobile lane-keeping control without the use of additional smoothing algorithms, we developed a soft-constrained iterative linear-quadratic regulator (soft-CILQR) algorithm by integrating CILQR algorithm and a model predictive control (MPC) constraint relaxation method. We incorporated slack variables into the state and control barrier functions of the soft-CILQR solver to soften the constraints in the optimization process so that stabilizing control inputs can be calculated in a relatively simple manner. Two types of automotive lane-keeping experiments were conducted with a linear system dynamics model to test the performance of the proposed soft-CILQR algorithm and to compare its performance with that of the CILQR algorithm: numerical simulations and experiments involving challenging vision-based maneuvers. In the numerical simulations, the soft-CILQR and CILQR solvers managed to drive the system toward the reference state asymptotically; however, the soft-CILQR solver obtained smooth steering input trajectories more easily than did the CILQR solver under conditions involving additive disturbances. In the experiments with visual inputs, the soft-CILQR controller outperformed the CILQR controller in terms of tracking accuracy and steering smoothness during the driving of an ego vehicle on TORCS.
Efficient Multimodal Diffusion Models Using Joint Data Infilling with Partially Shared U-Net

Recently, diffusion models have been used successfully to fit distributions for cross-modal data translation and multimodal data generation. However, these methods rely on extensive scaling, overlooking the inefficiency and interference between modalities. We develop Partially Shared U-Net (PS-U-Net) architecture which is an efficient multimodal diffusion model that allows text and image inputs to pass through dedicated layers and skip-connections for preserving modality-specific fine-grained details. Inspired by image inpainting, we also propose a new efficient multimodal sampling method that introduces new scenarios for conditional generation while only requiring a simple joint distribution to be learned. Our empirical exploration of the MS-COCO dataset demonstrates that our method generates multimodal text and image data with higher quality compared to existing multimodal diffusion models while having a comparable size, faster training, faster multimodal sampling, and more flexible generation.
Deep Learning for Time Series Classification of Parkinson's Disease Eye Tracking Data

Eye-tracking is an accessible and non-invasive technology that provides information about a subject's motor and cognitive abilities. As such, it has proven to be a valuable resource in the study of neurodegenerative diseases such as Parkinson's disease. Saccade experiments, in particular, have proven useful in the diagnosis and staging of Parkinson's disease. However, to date, no single eye-movement biomarker has been found to conclusively differentiate patients from healthy controls. In the present work, we investigate the use of state-of-the-art deep learning algorithms to perform Parkinson's disease classification using eye-tracking data from saccade experiments. In contrast to previous work, instead of using hand-crafted features from the saccades, we use raw $\sim1.5\,s$ long fixation intervals recorded during the preparatory phase before each trial. Using these short time series as input we implement two different classification models, InceptionTime and ROCKET. We find that the models are able to learn the classification task and generalize to unseen subjects. InceptionTime achieves $78\%$ accuracy, while ROCKET achieves $88\%$ accuracy. We also employ a novel method for pruning the ROCKET model to improve interpretability and generalizability, achieving an accuracy of $96\%$. Our results suggest that fixation data has low inter-subject variability and potentially carries useful information about brain cognitive and motor conditions, making it suitable for use with machine learning in the discovery of disease-relevant biomarkers.
Quantum Fluctuations in a Weakly Correlated Mott Insulator

Quantum fluctuations in low-dimensional systems and near quantum phase transitions have significant influences on material properties. Yet, it is difficult to experimentally gauge the strength and importance of quantum fluctuations. Here we provide a resonant inelastic x-ray scattering study of magnon excitations in Mott insulating cuprates. From the thin film of SrCuO$_2$, single- and bi-magnon dispersions are derived. Using an effective Heisenberg Hamiltonian generated from the Hubbard model, we show that the single magnon dispersion is only described satisfactorily when including significant renormalization stemming from quantum fluctuations. Comparative results on La$_2$CuO$_4$ indicate that quantum fluctuations are much stronger in SrCuO$_2$ suggesting closer proximity to a magnetic quantum critical point. Monte Carlo calculations suggest an exotic incommensurate magnetic order as the ground state that competes with the antiferromagnetic N\'eel order. Our results indicate that SrCuO$_2$ -- due to strong quantum fluctuations -- is a unique starting point for the exploration of novel magnetic ground states.
The Graph Convolutional Network with Multi-representation Alignment for Drug Synergy Prediction

Drug combination refers to the use of two or more drugs to treat a specific disease at the same time. It is currently the mainstream way to treat complex diseases. Compared with single drugs, drug combinations have better efficacy and can better inhibit toxicity and drug resistance. The computational model based on deep learning concatenates the representation of multiple drugs and the corresponding cell line feature as input, and the output is whether the drug combination can have an inhibitory effect on the cell line. However, this strategy of concatenating multiple representations has the following defects: the alignment of drug representation and cell line representation is ignored, resulting in the synergistic relationship not being reflected positionally in the embedding space. Moreover, the alignment measurement function in deep learning cannot be suitable for drug synergy prediction tasks due to differences in input types. Therefore, in this work, we propose a graph convolutional network with multi-representation alignment (GCNMRA) for predicting drug synergy. In the GCNMRA model, we designed a multi-representation alignment function suitable for the drug synergy prediction task so that the positional relationship between drug representations and cell line representation is reflected in the embedding space. In addition, the vector modulus of drug representations and cell line representation is considered to improve the accuracy of calculation results and accelerate model convergence. Finally, many relevant experiments were run on multiple drug synergy datasets to verify the effectiveness of the above innovative elements and the excellence of the GCNMRA model.
Multi-agent statistical discriminative sub-trajectory mining and an application to NBA basketball

Improvements in tracking technology through optical and computer vision systems have enabled a greater understanding of the movement-based behaviour of multiple agents, including in team sports. In this study, a Multi-Agent Statistically Discriminative Sub-Trajectory Mining (MA-Stat-DSM) method is proposed that takes a set of binary-labelled agent trajectory matrices as input and incorporates Hausdorff distance to identify sub-matrices that statistically significantly discriminate between the two groups of labelled trajectory matrices. Utilizing 2015/16 SportVU NBA tracking data, agent trajectory matrices representing attacks consisting of the trajectories of five agents (the ball, shooter, last passer, shooter defender, and last passer defender), were truncated to correspond to the time interval following the receipt of the ball by the last passer, and labelled as effective or ineffective based on a definition of attack effectiveness that we devise in the current study. After identifying appropriate parameters for MA-Stat-DSM by iteratively applying it to all matches involving the two top- and two bottom-placed teams from the 2015/16 NBA season, the method was then applied to selected matches and could identify and visualize the portions of plays, e.g., involving passing, on-, and/or off-the-ball movements, which were most relevant in rendering attacks effective or ineffective.
Learning Multimodal Latent Dynamics for Human-Robot Interaction

This article presents a method for learning well-coordinated Human-Robot Interaction (HRI) from Human-Human Interactions (HHI). We devise a hybrid approach using Hidden Markov Models (HMMs) as the latent space priors for a Variational Autoencoder to model a joint distribution over the interacting agents. We leverage the interaction dynamics learned from HHI to learn HRI and incorporate the conditional generation of robot motions from human observations into the training, thereby predicting more accurate robot trajectories. The generated robot motions are further adapted with Inverse Kinematics to ensure the desired physical proximity with a human, combining the ease of joint space learning and accurate task space reachability. For contact-rich interactions, we modulate the robot's stiffness using HMM segmentation for a compliant interaction. We verify the effectiveness of our approach deployed on a Humanoid robot via a user study. Our method generalizes well to various humans despite being trained on data from just two humans. We find that Users perceive our method as more human-like, timely, and accurate and rank our method with a higher degree of preference over other baselines.