Miracle-dz/UniFAR-FTUs huggingface dataset:
Generative Adversarial Models for Extreme Downscaling of Climate Datasets

Addressing the challenges of climate change requires accurate and high-resolution mapping of climate and weather variables. However, many existing climate datasets, such as the gridded outputs of the state-of-the-art numerical climate models (e.g., general circulation models), are only available at very coarse spatial resolutions due to the model complexity and extremely high computational demand. Deep-learning-based methods, particularly generative adversarial networks (GANs) and their variants, have proved effective for refining natural images, and have shown great promise in improving scientific datasets. In this paper, we describe a conditional GAN-based geospatial downscaling method for extreme downscaling of gridded climate datasets. Compared to most existing methods, the method can generate high-resolution accurate climate datasets from very low-resolution inputs. More importantly, the method explicitly considers the uncertainty inherent to the downscaling process that tends to be ignored in existing methods. Given an input, the method can produce a multitude of plausible high-resolution samples instead of one single deterministic result. These samples allow for an empirical exploration and inferences of model uncertainty and robustness. With a case study of gridded climate datasets (wind velocity and solar irradiance), we demonstrate the performances of the framework in downscaling tasks with very high scaling factors (up to $64\times$) and highlight the advantages of the framework with a comprehensive comparison with commonly used downscaling methods, including area-to-point (ATP) kriging, deep image prior (DIP), enhanced deep super-resolution network (EDSR), enhanced super-resolution generative adversarial networks (ESRGAN), and physics-informed resolution-enhancing GAN (PhIRE GAN).
Bandits with Abstention under Expert Advice

We study the classic problem of prediction with expert advice under bandit feedback. Our model assumes that one action, corresponding to the learner's abstention from play, has no reward or loss on every trial. We propose the CBA algorithm, which exploits this assumption to obtain reward bounds that can significantly improve those of the classical Exp4 algorithm. We can view our problem as the aggregation of confidence-rated predictors when the learner has the option of abstention from play. Importantly, we are the first to achieve bounds on the expected cumulative reward for general confidence-rated predictors. In the special case of specialists we achieve a novel reward bound, significantly improving previous bounds of SpecialistExp (treating abstention as another action). As an example application, we discuss learning unions of balls in a finite metric space. In this contextual setting, we devise an efficient implementation of CBA, reducing the runtime from quadratic to almost linear in the number of contexts. Preliminary experiments show that CBA improves over existing bandit algorithms.
A Landmark-Aware Visual Navigation Dataset

Map representation learned by expert demonstrations has shown promising research value. However, recent advancements in the visual navigation field face challenges due to the lack of human datasets in the real world for efficient supervised representation learning of the environments. We present a Landmark-Aware Visual Navigation (LAVN) dataset to allow for supervised learning of human-centric exploration policies and map building. We collect RGB observation and human point-click pairs as a human annotator explores virtual and real-world environments with the goal of full coverage exploration of the space. The human annotators also provide distinct landmark examples along each trajectory, which we intuit will simplify the task of map or graph building and localization. These human point-clicks serve as direct supervision for waypoint prediction when learning to explore in environments. Our dataset covers a wide spectrum of scenes, including rooms in indoor environments, as well as walkways outdoors. Dataset is available at DOI: 10.5281/zenodo.10608067.
GazeTrak: Exploring Acoustic-based Eye Tracking on a Glass Frame

In this paper, we present GazeTrak, the first acoustic-based eye tracking system on glasses. Our system only needs one speaker and four microphones attached to each side of the glasses. These acoustic sensors capture the formations of the eyeballs and the surrounding areas by emitting encoded inaudible sound towards eyeballs and receiving the reflected signals. These reflected signals are further processed to calculate the echo profiles, which are fed to a customized deep learning pipeline to continuously infer the gaze position. In a user study with 20 participants, GazeTrak achieves an accuracy of 3.6{\deg} within the same remounting session and 4.9{\deg} across different sessions with a refreshing rate of 83.3 Hz and a power signature of 287.9 mW. Furthermore, we report the performance of our gaze tracking system fully implemented on an MCU with a low-power CNN accelerator (MAX78002). In this configuration, the system runs at up to 83.3 Hz and has a total power signature of 95.4 mW with a 30 Hz FPS.
COMPASS: Computational Mapping of Patient-Therapist Alliance Strategies with Language Modeling

The therapeutic working alliance is a critical factor in predicting the success of psychotherapy treatment. Traditionally, working alliance assessment relies on questionnaires completed by both therapists and patients. In this paper, we present COMPASS, a novel framework to directly infer the therapeutic working alliance from the natural language used in psychotherapy sessions. Our approach utilizes advanced large language models to analyze transcripts of psychotherapy sessions and compare them with distributed representations of statements in the working alliance inventory. Analyzing a dataset of over 950 sessions covering diverse psychiatric conditions, we demonstrate the effectiveness of our method in microscopically mapping patient-therapist alignment trajectories and providing interpretability for clinical psychiatry and in identifying emerging patterns related to the condition being treated. By employing various neural topic modeling techniques in combination with generative language prompting, we analyze the topical characteristics of different psychiatric conditions and incorporate temporal modeling to capture the evolution of topics at a turn-level resolution. This combined framework enhances the understanding of therapeutic interactions, enabling timely feedback for therapists regarding conversation quality and providing interpretable insights to improve the effectiveness of psychotherapy.
The affinity-efficacy problem: an essential part of pharmacology education

A fundamental mistake in receptor theory has led to an enduring misunderstanding of how to estimate the affinity and efficacy of an agonist. These properties are inextricably linked and cannot be easily separated in any case where the binding of a ligand induces a conformation change in its receptor. Consequently, binding curves and concentration-response relationships for receptor agonists have no straightforward interpretation. This problem, the affinity-efficacy problem, remains overlooked and misunderstood despite it being recognised in 1987. To avoid the further propagation of this misunderstanding, we propose that the affinity-efficacy problem should be included in the core curricula for pharmacology undergraduates proposed by the British Pharmacological Society and IUPHAR.
Strong-ARM Dynamic Latch Comparators: Design and Analyses on CAD Platform

Strong-ARM Dynamic Latch Comparators are widely used in high-speed analog-to-digital converters (ADCs), sense amplifiers in memory, RFID applications, and data receivers. This paper presents different methods to improve the performance of Strong-Arm latch-based comparators. The comparator's significant features such as power dissipation, propagation delay, offset voltage, clock feedthrough, area, and kickback noises are discussed and compared with state-of-the-art candidate topologies. Simulation results show that the new comparator topologies of Strong-ARM Dynamic Latch proposed by these authors gave the best results. The proposed designs are tested. The simulations are carried out using UMC 180nm double metal, double poly standard CMOS process technology, for a 100 MHz clock, at 1.8V supply-rail on the Cadence Virtuoso EDA platform.
An LLM-Enhanced Adversarial Editing System for Lexical Simplification

Lexical Simplification (LS) aims to simplify text at the lexical level. Existing methods rely heavily on annotated data, making it challenging to apply in low-resource scenarios. In this paper, we propose a novel LS method without parallel corpora. This method employs an Adversarial Editing System with guidance from a confusion loss and an invariance loss to predict lexical edits in the original sentences. Meanwhile, we introduce an innovative LLM-enhanced loss to enable the distillation of knowledge from Large Language Models (LLMs) into a small-size LS system. From that, complex words within sentences are masked and a Difficulty-aware Filling module is crafted to replace masked positions with simpler words. At last, extensive experimental results and analyses on three benchmark LS datasets demonstrate the effectiveness of our proposed method.
Place Anything into Any Video

Controllable video editing has demonstrated remarkable potential across diverse applications, particularly in scenarios where capturing or re-capturing real-world videos is either impractical or costly. This paper introduces a novel and efficient system named Place-Anything, which facilitates the insertion of any object into any video solely based on a picture or text description of the target object or element. The system comprises three modules: 3D generation, video reconstruction, and 3D target insertion. This integrated approach offers an efficient and effective solution for producing and editing high-quality videos by seamlessly inserting realistic objects. Through a user study, we demonstrate that our system can effortlessly place any object into any video using just a photograph of the object. Our demo video can be found at https://youtu.be/afXqgLLRnTE. Please also visit our project page https://place-anything.github. io to get access.
Mochi: Fast \& Exact Collision Detection

Collision Detection (CD) has several applications across the domains such as robotics, visual graphics, and fluid mechanics. Finding exact collisions between the objects in the scene is quite computationally intensive. To quickly filter the object pairs that do not result in a collision, bounding boxes are built on the objects, indexed using a Bounding Volume Hierarchy(BVH), and tested for intersection before performing the expensive object-object intersection tests. In state-of-the-art CD libraries, accelerators such as GPUs are used to accelerate BVH traversal by building specialized data structures. The recent addition of ray tracing architecture to GPU hardware is designed to do the same but in the context of implementing a Ray Tracing algorithm to render a graphical scene in real-time. We present Mochi, a fast and exact collision detection engine that accelerates both the broad and narrow phases by taking advantage of the capabilities of Ray Tracing cores. We introduce multiple new reductions to perform generic CD to support three types of objects for CD: simple spherical particles, objects describable by mathematical equations, and complex objects composed of a triangle mesh. By implementing our reductions, Mochi achieves several orders of magnitude speedups on synthetic datasets and 5x-28x speedups on real-world triangle mesh datasets. We further evaluate our reductions thoroughly and provide several architectural insights on the ray tracing cores that are otherwise unknown due to their proprietorship.
Semantic Image Synthesis with Unconditional Generator

Semantic image synthesis (SIS) aims to generate realistic images that match given semantic masks. Despite recent advances allowing high-quality results and precise spatial control, they require a massive semantic segmentation dataset for training the models. Instead, we propose to employ a pre-trained unconditional generator and rearrange its feature maps according to proxy masks. The proxy masks are prepared from the feature maps of random samples in the generator by simple clustering. The feature rearranger learns to rearrange original feature maps to match the shape of the proxy masks that are either from the original sample itself or from random samples. Then we introduce a semantic mapper that produces the proxy masks from various input conditions including semantic masks. Our method is versatile across various applications such as free-form spatial editing of real images, sketch-to-photo, and even scribble-to-photo. Experiments validate advantages of our method on a range of datasets: human faces, animal faces, and buildings.
Combining Language and Graph Models for Semi-structured Information Extraction on the Web

Relation extraction is an efficient way of mining the extraordinary wealth of human knowledge on the Web. Existing methods rely on domain-specific training data or produce noisy outputs. We focus here on extracting targeted relations from semi-structured web pages given only a short description of the relation. We present GraphScholarBERT, an open-domain information extraction method based on a joint graph and language model structure. GraphScholarBERT can generalize to previously unseen domains without additional data or training and produces only clean extraction results matched to the search keyword. Experiments show that GraphScholarBERT can improve extraction F1 scores by as much as 34.8\% compared to previous work in a zero-shot domain and zero-shot website setting.
Asperity generation and its relationship to seismicity on a planar fault: a laboratory simulation

Author(s): Selvadurai, PA; Glaser, SD | Abstract: © The Authors 2016. Published by Oxford University Press on behalf of The Royal Astronomical Society. Earthquake faults, and all frictional surfaces, establish contact through asperities. A detailed knowledge of how asperities form will enable a better understanding of the manner in which they communicate during foreshock failure sequences that are observed, leading to the larger main shock. We present results of experiments where a pressure sensitive film was used to map, size and measure the magnitudes of the normal stresses at asperities along a seismogenic section of a laboratory simulated fault. We measured seismicity acoustically and foreshocks were found to be the result of localized asperity failure during the nucleation phase of gross fault rupture. Since surface roughness plays an important role in how asperities are formed, two Hurst exponents were measured to characterize a highly worn interface using roughness profiles: (i) long wavelength estimates (H ~ 0.45) and (ii) short wavelength estimates (H ~ 0.8-1.2). The short wavelength roughness estimates were computed at the scale of single asperity junction points. Macroscopically, the number of asperities and real contact area increased with additional application of normal force while the mean normal stress remained constant. The ratio of real to nominal contact area was low - ranging from 0.02 l Ar/A0 l 0.05-predicting that the asperities should be elastically independent of each other. Results from the pressure sensitive film showed that asperities were closely spaced and could not be treated as mechanically independent. Larger asperities carried both higher levels of average normal stress and higher levels of normal stress heterogeneity than smaller ones. Using linear stability theorem, the critical slip distance on foreshocking asperities was estimated to be d0 ~ 0.65-3 μm. The critical slip distance d0 was ~1.8-11.5 per cent of the premonitory slip needed to initiate gross fault rupture of the interface (20-40 μm) and the overall slip necessary to initiate gross fault rupture was on the order of the average asperity diameter (52 μm). Foreshocks may be due to a change in the critical slip distance, at localized sections of the fault, caused by the two distinct roughness profiles measured at short and long length scales.
Malaysian English News Decoded: A Linguistic Resource for Named Entity and Relation Extraction

Standard English and Malaysian English exhibit notable differences, posing challenges for natural language processing (NLP) tasks on Malaysian English. Unfortunately, most of the existing datasets are mainly based on standard English and therefore inadequate for improving NLP tasks in Malaysian English. An experiment using state-of-the-art Named Entity Recognition (NER) solutions on Malaysian English news articles highlights that they cannot handle morphosyntactic variations in Malaysian English. To the best of our knowledge, there is no annotated dataset available to improvise the model. To address these issues, we constructed a Malaysian English News (MEN) dataset, which contains 200 news articles that are manually annotated with entities and relations. We then fine-tuned the spaCy NER tool and validated that having a dataset tailor-made for Malaysian English could improve the performance of NER in Malaysian English significantly. This paper presents our effort in the data acquisition, annotation methodology, and thorough analysis of the annotated dataset. To validate the quality of the annotation, inter-annotator agreement was used, followed by adjudication of disagreements by a subject matter expert. Upon completion of these tasks, we managed to develop a dataset with 6,061 entities and 3,268 relation instances. Finally, we discuss on spaCy fine-tuning setup and analysis on the NER performance. This unique dataset will contribute significantly to the advancement of NLP research in Malaysian English, allowing researchers to accelerate their progress, particularly in NER and relation extraction. The dataset and annotation guideline has been published on Github.
Can Language Models Act as Knowledge Bases at Scale?

Large language models (LLMs) have demonstrated remarkable proficiency in understanding and generating responses to complex queries through large-scale pre-training. However, the efficacy of these models in memorizing and reasoning among large-scale structured knowledge, especially world knowledge that explicitly covers abundant factual information remains questionable. Addressing this gap, our research investigates whether LLMs can effectively store, recall, and reason with knowledge on a large scale comparable to latest knowledge bases (KBs) such as Wikidata. Specifically, we focus on three crucial aspects to study the viability: (1) the efficiency of LLMs with different sizes in memorizing the exact knowledge in the large-scale KB; (2) the flexibility of recalling the memorized knowledge in response to natural language queries; (3) the capability to infer new knowledge through reasoning. Our findings indicate that while LLMs hold promise as large-scale KBs capable of retrieving and responding with flexibility, enhancements in their reasoning capabilities are necessary to fully realize their potential.
Induced subgraphs and tree decompositions XV. Even-hole-free graphs with bounded clique number have logarithmic treewidth

We prove that for every integer $t\geq 1$ there exists an integer $c_t\geq 1$ such that every $n$-vertex even-hole-free graph with no clique of size $t$ has treewidth at most $c_t\log{n}$. This resolves a conjecture of Sintiari and Trotignon, who also proved that the logarithmic bound is asymptotically best possible. It follows that several NP-hard problems such as Stable Set, Vertex Cover, Dominating Set and Coloring admit polynomial-time algorithms on this class of graphs. As a consequence, for every positive integer $r$, $r$-Coloring can be solved in polynomial time on even-hole-free graphs without any assumptions on clique size. As part of the proof, we show that there is an integer $d$ such that every even-hole-free graph has a balanced separator which is contained in the (closed) neighborhood of at most $d$ vertices. This is of independent interest; for instance, it implies the existence of efficient approximation algorithms for certain NP-hard problems while restricted to the class of all even-hole-free graphs.
Sex and gender essentialism in textbooks

Several widely used high school biology texts depart from established science Essentialism is the lay assumption that categories of living things have underlying, unobservable “essences” (1, 2). When applied to sex and gender, this assumption has a range of negative consequences, including stereotyping and discrimination (1, 2). We investigated a potentially powerful—but so far unexamined—sociocultural influence on the development of essentialism about sex and gender: what high school biology textbooks teach adolescents about these topics. We content-analyzed six of the most widely used textbooks in the United States and found that they depart from established scientific knowledge about sex and gender, instead portraying these categories in a manner consistent with essentialism.
A comprehensive map of transient protein-protein interactions and their structural features in the E. coli 1-carbon metabolism pathway

Enzymes in a pathway often form metabolons through weak protein-protein interactions (PPI) that localize and protect labile metabolites. Due to their transient nature, the structural architecture of these enzyme assemblies has largely remained elusive. Here we delineate a complete PPI map of the E. coli 1-carbon metabolism pathway using bimolecular fluorescence complementation that can detect transient interactions in vivo and show strong intra- and inter-pathway clusters within the folate and purine biosynthesis pathways. Using deep scanning mutagenesis we identify the PPI interface on DHFR. Further, a combination of AlphaFold predictions with meta-dynamics simulations reveal interaction interfaces of all PPI in the pathway, which not only agrees with experimental findings but also reveal that most proteins use conserved “dedicated” interfaces distant from their active sites to interact with multiple partners. Overall, our data reveals the structural architecture of binary PPI complexes in a metabolon in a crucial prokaryotic metabolic pathway.
Predicting species invasiveness with genomic data: is Genomic Offset related to establishment probability?

Predicting the risk of establishment and spread of populations outside their native range represents a major challenge in evolutionary biology. Various methods have recently been developed to estimate population (mal)adaptation to a new environment with genomic data via so-called Genomic Offset (GO) statistics. These approaches are particularly promising for studying invasive species, but have still rarely been used in this context. Here, we evaluated the relationship between GO and the estab-lishment probability of a population in a new environment using both in silico and empirical data. First, we designed invasion simulations to evaluate the ability to predict establishment probability of two GO computation methods (Geometric GO and Gradient Forest) under several conditions. Additionally, we aimed to evaluate the interpretability of absolute Geometric GO values, which the-oretically represent the adaptive genetic distance between populations from distinct environments. Second, utilizing public real data from the crop pest species Bactrocera tryoni, a fruit fly native from Northern Australia, we computed GO between “source” populations and a diverse range of locations within invaded areas. This practical application of GO within the context of a biological invasion underscores its potential in providing insights and guiding recommendations for future invasion risk assessment. Overall, our results suggest that GO statistics represent good predictors of the estab-lishment probability and may thus inform invasion risk, although the influence of several factors on prediction performance (e.g. propagule pressure or admixture) will need further investigation.