arXiv subjects

Le Fang

Publications and source records attributed to Le Fang.

At least 19 recordsLinked to original sources

arXiv2026

CapSenseBand: Sustaining Cross-Disciplinary Creativity When Stitches Must Meet Signals

Wearable sensing systems increasingly depend on textiles that are both materially wearable and electronically functional. Their design requires collaboration between textile designers, who reason through stitches, yarn behavior, and machine constraints, and interaction designers, who reason through electrodes, signal paths, and insulation. However, these forms of expertise do not easily translate across disciplinary boundaries. This poster presents CapSenseBand, a knitted capacitive-sensing wristband developed through a research-through-design process organized around Analysis, Synthesis, and Detailing. We document an artifact chain spanning material swatches, a rapid wearable prototype, Paper Models as shared negotiation surfaces, a double-layer knitted structure, and an insulated Swept Frequency Capacitive Sensing breakout board. We show how Paper Models functioned as boundary objects, helping collaborators externalize intent, negotiate spatial and technical constraints, and preserve disciplinary expertise while converging on a shared design. We contribute a reusable swatch-to-sleeve pattern for material-centered HCI: keep discipline-specific probes open early, then converge through artifacts that make material, spatial, and electronic decisions legible before fabrication locks them in.

cs.HC↗

arXiv2026

Exact formulas for arbitrary order velocity-gradient moments in isotropic turbulence

Statistical moments of velocity gradients provide fundamental information on the small-scale properties of turbulence. In this work, we propose a systematic method to derive exact expressions for statistical moments of arbitrary order for both longitudinal and transverse velocity gradients in isotropic turbulence. The approach is applicable to both compressible and incompressible flows and expresses the moments in terms of invariants of the velocity gradient tensor. The derivation combines isotropic tensor theory, orientational averaging, and an algorithmic implementation, enabling the computation of high-order moments in a unified framework. We show that longitudinal velocity gradient moments of order higher than three depend not only on $\mathrm{tr}(\boldsymbol{S}^2)$, which is proportional to the dissipation rate, but also on $\mathrm{tr}(\boldsymbol{S}^3)$, which reflects strain self-amplification, where $\boldsymbol{S}$ denotes the strain-rate tensor. The resulting theoretical expressions are validated through comparisons with existing theoretical results and direct numerical simulations.

physics.flu-dyn↗

arXiv2026

Do LLMs Need to See Everything? A Benchmark and Study of Failures in LLM-driven Smartphone Automation using Screentext vs. Screenshots

With the rapid advancement of large language models (LLMs), mobile agents have emerged as promising tools for phone automation, simulating human interactions on screens to accomplish complex tasks. However, these agents often suffer from low accuracy, misinterpretation of user instructions, and failure on challenging tasks, with limited prior work examining why and where they fail. To address this, we introduce DailyDroid, a benchmark of 75 tasks in five scenarios across 25 Android apps, spanning three difficulty levels to mimic everyday smartphone use. We evaluate it using text-only and multimodal (text + screenshot) inputs on GPT-4o and o4-mini across 300 trials, revealing comparable performance with multimodal inputs yielding marginally higher success rates. Through in-depth failure analysis, we compile a handbook of common failures. Our findings reveal critical issues in UI accessibility, input modalities, and LLM/app design, offering implications for future mobile agents, applications, and UI development.

cs.HC↗

arXiv2026

Flow-based Polynomial Chaos Expansion for Uncertainty Quantification in Power System Dynamic Simulation

The large-scale integration of renewable energy sources introduces significant operational uncertainty into power systems. Although Polynomial Chaos Expansion (PCE) provides an efficient tool for uncertainty quantification (UQ) in power system dynamics, its accuracy depends critically on the faithful representation of input uncertainty, an assumption that is oftern violated in practice due to correlated, non-Gaussian, and otherwise complex data distributions. In contrast to purely data-driven surrogates that often overlook rigorous input distribution modelling, this paper introduces flow-based PCE, a unified framework that couples expressive input modelling with efficient uncertainty propagation. Specifically, normalising flows are employed to learn an invertible transport map from a simple base distribution to the empirical joint distribution of uncertain inputs, and this map is then integrated directly into the PCE construction. In addition, the Map Smoothness Index (MSI) is introduced as a new metric to quantify the quality of the learned map, and smoother transformations are shown to yield more accurate PCE surrogates. The proposed Flow-based PCE framework is validated on benchmark dynamic models, including the IEEE 14-bus system and the Great Britain transmission system, under a range of uncertainty scenarios.

eess.SY↗

arXiv2025

The Role of Vortex Stretching in Drag Reduction of Polymer-Laden Turbulent Flow

An addition of polymers can significantly reduce drag in wall-bounded turbulent flows, such as pipes or channels. This phenomenon is accompanied by a noticeable modification of the mean velocity profile. Starting from the premise that polymers reduce vortex-stretching, we derive a theoretical prediction for the mean-velocity profile. After assessing this prediction by numerical experiments of turbulence with reduced vortex stretching, we show that the theory successfully describes experimental measurements of drag-reduction in pipe-flow.

physics.flu-dyn↗

arXiv2025

Show Me Why It's Correct: Saving 1/3 of Debugging Time in Program Repair with Interactive Runtime Comparison

Automated Program Repair (APR) holds the promise of alleviating the burden of debugging and fixing software bugs. Despite this, developers still need to manually inspect each patch to confirm its correctness, which is tedious and time-consuming. This challenge is exacerbated in the presence of plausible patches, which accidentally pass test cases but may not correctly fix the bug. To address this challenge, we propose an interactive approach called iFix to facilitate patch understanding and comparison based on their runtime difference. iFix performs static analysis to identify runtime variables related to the buggy statement and captures their runtime values during execution for each patch. These values are then aligned across different patch candidates, allowing users to compare and contrast their runtime behavior. To evaluate iFix, we conducted a within-subjects user study with 28 participants. Compared with manual inspection and a state-of-the-art interactive patch filtering technique, iFix reduced participants' task completion time by 36% and 33% while also improving their confidence by 50% and 20%, respectively. Besides, quantitative experiments demonstrate that iFix improves the ranking of correct patches by at least 39% compared with other patch ranking methods and is generalizable to different APR tools.

cs.SE↗

arXiv2025

The contribution of dilatational motion to energy flux in homogeneous compressible turbulence

We analyze the energy flux in compressible turbulence by generalizing the exact decomposition recently proposed by Johnson (Phys. Rev. Lett., vol. 124, 2020. 104501) to study incompressible turbulent flows. This allows us to characterize the effect of dilatational motion on the inter-scale energy transfer in three-dimensional compressible turbulence. Our analysis reveals that the contribution of dilatational motion to energy transfer is due to three different physical mechanisms: the interaction between dilatation and strain, between dilatation and vorticity, and the self-interaction of dilatational motion across scales. By analyzing numerical simulations of flows at moderate turbulent Mach numbers ($Ma_t \lesssim 0.3$), we validate our theoretical derivations and provide a quantitative description of the role of dilatational motion in energy transfer. In particular, we determine the scaling dependence of the dilatational contributions on the turbulent Mach number. Moreover, our findings reveal that the eddy-viscosity assumption often used in large-eddy simulations, in the spirit of the approach used for incompressible flows, effectively neglects the interaction between solenoidal-dilatational energy transfer and overestimate dilatational effects.

physics.flu-dyn↗

arXiv2024

AutoJournaling: A Context-Aware Journaling System Leveraging MLLMs on Smartphone Screenshots

Journaling offers significant benefits, including fostering self-reflection, enhancing writing skills, and aiding in mood monitoring. However, many people abandon the practice because traditional journaling is time-consuming, and detailed life events may be overlooked if not recorded promptly. Given that smartphones are the most widely used devices for entertainment, work, and socialization, they present an ideal platform for innovative approaches to journaling. Despite their ubiquity, the potential of using digital phenotyping, a method of unobtrusively collecting data from digital devices to gain insights into psychological and behavioral patterns, for automated journal generation has been largely underexplored. In this study, we propose AutoJournaling, the first-of-its-kind system that automatically generates journals by collecting and analyzing screenshots from smartphones. This system captures life events and corresponding emotions, offering a novel approach to digital phenotyping. We evaluated AutoJournaling by collecting screenshots every 3 seconds from three students over five days, demonstrating its feasibility and accuracy. AutoJournaling is the first framework to utilize seamlessly collected screenshots for journal generation, providing new insights into psychological states through digital phenotyping.

cs.HC↗

arXiv2024

Enabling On-Device LLMs Personalization with Smartphone Sensing

This demo presents a novel end-to-end framework that combines on-device large language models (LLMs) with smartphone sensing technologies to achieve context-aware and personalized services. The framework addresses critical limitations of current personalization solutions via cloud LLMs, such as privacy concerns, latency and cost, and limited personal information. To achieve this, we innovatively proposed deploying LLMs on smartphones with multimodal sensor data through context-aware sensing and customized prompt engineering, ensuring privacy and enhancing personalization performance. A case study involving a university student demonstrated the capability of the framework to provide tailored recommendations. In addition, we show that the framework achieves the best trade-off in privacy, performance, latency, cost, battery and energy consumption between on-device and cloud LLMs. To the best of our knowledge, this is the first framework to provide on-device LLMs personalization with smartphone sensing. Future work will incorporate more diverse sensor data and involve extensive user studies to enhance personalization. Our proposed framework has the potential to substantially improve user experiences across domains including healthcare, productivity, and entertainment.

cs.HC↗

arXiv2024

ScreenTK: Seamless Detection of Time-Killing Moments Using Continuous Mobile Screen Text and On-Device LLMs

Smartphones have become essential to people's digital lives, providing a continuous stream of information and connectivity. However, this constant flow can lead to moments where users are simply passing time rather than engaging meaningfully. This underscores the importance of developing methods to identify these "time-killing" moments, enabling the delivery of important notifications in a way that minimizes interruptions and enhances user engagement. Recent work has utilized screenshots taken every 5 seconds to detect time-killing activities on smartphones. However, this method often misses to capture phone usage between intervals. We demonstrate that up to 50% of time-killing instances go undetected using screenshots, leading to substantial gaps in understanding user behavior. To address this limitation, we propose a method called ScreenTK that detects time-killing moments by leveraging continuous screen text monitoring and on-device large language models (LLMs). Screen text contains more comprehensive information than screenshots and allows LLMs to summarize detailed phone usage. To verify our framework, we conducted experiments with six participants, capturing 1,034 records of different time-killing moments. Initial results show that our framework outperforms state-of-the-art solutions by 38% in our case study.

cs.HC↗

arXiv2022

Meta-Learning with Less Forgetting on Large-Scale Non-Stationary Task Distributions

The paradigm of machine intelligence moves from purely supervised learning to a more practical scenario when many loosely related unlabeled data are available and labeled data is scarce. Most existing algorithms assume that the underlying task distribution is stationary. Here we consider a more realistic and challenging setting in that task distributions evolve over time. We name this problem as Semi-supervised meta-learning with Evolving Task diStributions, abbreviated as SETS. Two key challenges arise in this more realistic setting: (i) how to use unlabeled data in the presence of a large amount of unlabeled out-of-distribution (OOD) data; and (ii) how to prevent catastrophic forgetting on previously learned task distributions due to the task distribution shift. We propose an OOD Robust and knowleDge presErved semi-supeRvised meta-learning approach (ORDER), to tackle these two major challenges. Specifically, our ORDER introduces a novel mutual information regularization to robustify the model with unlabeled OOD data and adopts an optimal transport regularization to remember previously learned knowledge in feature space. In addition, we test our method on a very challenging dataset: SETS on large-scale non-stationary semi-supervised task distributions consisting of (at least) 72K tasks. With extensive experiments, we demonstrate the proposed ORDER alleviates forgetting on evolving task distributions and is more robust to OOD data than related strong baselines.

cs.CV↗

arXiv2022

Improving Task-free Continual Learning by Distributionally Robust Memory Evolution

Task-free continual learning (CL) aims to learn a non-stationary data stream without explicit task definitions and not forget previous knowledge. The widely adopted memory replay approach could gradually become less effective for long data streams, as the model may memorize the stored examples and overfit the memory buffer. Second, existing methods overlook the high uncertainty in the memory data distribution since there is a big gap between the memory data distribution and the distribution of all the previous data examples. To address these problems, for the first time, we propose a principled memory evolution framework to dynamically evolve the memory data distribution by making the memory buffer gradually harder to be memorized with distributionally robust optimization (DRO). We then derive a family of methods to evolve the memory buffer data in the continuous probability measure space with Wasserstein gradient flow (WGF). The proposed DRO is w.r.t the worst-case evolved memory data distribution, thus guarantees the model performance and learns significantly more robust features than existing memory-replay-based methods. Extensive experiments on existing benchmarks demonstrate the effectiveness of the proposed methods for alleviating forgetting. As a by-product of the proposed framework, our method is more robust to adversarial examples than existing task-free CL methods. Code is available on GitHub \url{https://github.com/joey-wang123/DRO-Task-free}

cs.LG↗

arXiv2022

Low-order moments of the velocity gradient in homogeneous compressible turbulence

We derive from first principles analytic relations for the second and third order moments of the velocity gradient mij = dui/dxj in compressible turbulence, which generalize known relations in incompressible flows. These relations, although derived for homogeneous flows, hold approximately for a mixing layer. We also discuss how to apply these relations to determine all the second and third moments of the velocity gradient experimentally.

physics.flu-dyn↗

arXiv2022

How ferroelectric BaTiO$_3$ can tune a two-dimensional electron gas at the interface of LaInO3 and BaSnO$_3$: a first-principles study

The emerging interest in two-dimensional electron gases (2DEGs), formed at interfaces between two insulating oxide perovskites poses crucial fundamental question in view of future electronic devices. In the framework of density-functional theory, we investigate the possibility to control the characteristics of the 2DEG formed at the LaInO$_3$/BaSnO$_3$ interface by including a ferroelectric BaTiO$_3$ layer. To do so, we examine how the orientation of the ferroelectric polarization impacts density and confinement of the 2DEG. We find that aligning the ferroelectric polarization toward (outward) the LaInO$_3$/BaSnO$_3$ interface leads to an accumulation (depletion) of the interfacial 2DEG. Varying its magnitude, we find a linear effect on the 2DEG charge density that is confined within the BaSnO$_3$ side. Analysis of the optimized geometries revels that inclusion of the BaTiO$_3$ block makes structural distortions at the LaInO$_3$/BaSnO$_3$ less pronounced, which, in turn, enhances the 2DEG density. Thicker ferroelectric layers allow for reaching higher polarization magnitudes. We discuss the mechanisms behind all these findings and rationalize how the characteristics of both 2DEG and 2D hole gases can be controlled in the considered heterostructures. Overall, our results can be generalized to other combinations of ferroelectric, polar, and nonpolar materials.

cond-mat.mtrl-sci↗

arXiv2022

Two-dimensional electron gas at LaInO$_3$/BaSnO$_3$ interfaces controlled by a ferroelectric layer

With the example of LaInO$_{3}$/BaSnO$_3$, we demonstrate how both density and distribution of a two-dimensional electron gas (2DEG) formed at the interface between these perovskite oxides, can be efficiently controlled by a ferroelectric functional material. A polarization induced in a BaTiO$_3$ layer pointing toward the interface enhances the polar discontinuity which, in turn, significantly increases the 2DEG density and confinement, while, the opposite polarization depletes the 2DEG. Our predictions and analysis, based on first-principles calculations, can serve as a guide for designing such material combinations to be used in electronic devices.

cond-mat.mtrl-sci↗

arXiv2021

Meta Learning on a Sequence of Imbalanced Domains with Difficulty Awareness

Recognizing new objects by learning from a few labeled examples in an evolving environment is crucial to obtain excellent generalization ability for real-world machine learning systems. A typical setting across current meta learning algorithms assumes a stationary task distribution during meta training. In this paper, we explore a more practical and challenging setting where task distribution changes over time with domain shift. Particularly, we consider realistic scenarios where task distribution is highly imbalanced with domain labels unavailable in nature. We propose a kernel-based method for domain change detection and a difficulty-aware memory management mechanism that jointly considers the imbalanced domain size and domain importance to learn across domains continuously. Furthermore, we introduce an efficient adaptive task sampling method during meta training, which significantly reduces task gradient variance with theoretical guarantees. Finally, we propose a challenging benchmark with imbalanced domain sequences and varied domain difficulty. We have performed extensive evaluations on the proposed benchmark, demonstrating the effectiveness of our method. We made our code publicly available.

cs.LG↗

arXiv2021

Outline to Story: Fine-grained Controllable Story Generation from Cascaded Events

Large-scale pretrained language models have shown thrilling generation capabilities, especially when they generate consistent long text in thousands of words with ease. However, users of these models can only control the prefix of sentences or certain global aspects of generated text. It is challenging to simultaneously achieve fine-grained controllability and preserve the state-of-the-art unconditional text generation capability. In this paper, we first propose a new task named "Outline to Story" (O2S) as a test bed for fine-grained controllable generation of long text, which generates a multi-paragraph story from cascaded events, i.e. a sequence of outline events that guide subsequent paragraph generation. We then create dedicate datasets for future benchmarks, built by state-of-the-art keyword extraction techniques. Finally, we propose an extremely simple yet strong baseline method for the O2S task, which fine tunes pre-trained language models on augmented sequences of outline-story pairs with simple language modeling objective. Our method does not introduce any new parameters or perform any architecture modification, except several special tokens as delimiters to build augmented sequences. Extensive experiments on various datasets demonstrate state-of-the-art conditional story generation performance with our model, achieving better fine-grained controllability and user flexibility. Our paper is among the first ones by our knowledge to propose a model and to create datasets for the task of "outline to story". Our work also instantiates research interest of fine-grained controllable generation of open-domain long text, where controlling inputs are represented by short text.

cs.CL↗

arXiv2021

Transformer-based Conditional Variational Autoencoder for Controllable Story Generation

We investigate large-scale latent variable models (LVMs) for neural story generation -- an under-explored application for open-domain long text -- with objectives in two threads: generation effectiveness and controllability. LVMs, especially the variational autoencoder (VAE), have achieved both effective and controllable generation through exploiting flexible distributional latent representations. Recently, Transformers and its variants have achieved remarkable effectiveness without explicit latent representation learning, thus lack satisfying controllability in generation. In this paper, we advocate to revive latent variable modeling, essentially the power of representation learning, in the era of Transformers to enhance controllability without hurting state-of-the-art generation effectiveness. Specifically, we integrate latent representation vectors with a Transformer-based pre-trained architecture to build conditional variational autoencoder (CVAE). Model components such as encoder, decoder and the variational posterior are all built on top of pre-trained language models -- GPT2 specifically in this paper. Experiments demonstrate state-of-the-art conditional generation ability of our model, as well as its excellent representation learning capability and controllability.

cs.CL↗