Searcharxiv⌕ Search

arXiv subjects

Tu Nguyen

Publications and source records attributed to Tu Nguyen.

32 records · Page 2Linked to original sources
arXiv2025

Highly Stable Silicon Anodes Enabled by Sub-10 nm Pores and Particles

Silicon anodes offer high energy densities for next-generation lithium-ion batteries; however, their application is limited by severe volume expansion during cycling. Making silicon porous or nanostructured mitigates this expansion but often increases lithium inventory losses due to the inherent high surface area of nanomaterials. This study introduces a simple bottom-up process that overcomes this limitation. The approach relies on small silicon particles (<10 nm) produced using an efficient low-temperature plasma approach. These small building blocks are assembled into micron-scale superstructures characterized by uniformly dispersed sub-10 nm pores. This structure addresses both volume expansion and lithium-inventory issues while achieving tap densities exceeding those of commercial graphite (~1.2 g/cm3), all while maintaining good processability. The resulting silicon-dominant anodes achieve remarkable stability in full pouch cells with NMC811 and LFP cathodes, retaining ~80% capacity for more than 400 cycles without pre-lithiation, graphite blending, or pre-cycling.

cond-mat.mtrl-sci↗
arXiv2024

Utilizing Low-Cost Sensors to Monitor Indoor Air Quality in Mongolian Gers

Air quality has important climate and health effects. There is a need, therefore, to monitor air quality both indoors and outdoors. Methods of measuring air quality should be cost-effective if they are to be used widely, and one such method is low-cost sensors (LCS). This study reports on the use of LCSs in Ulaanbaatar, Mongolia, to measure $\mathrm{PM_{2.5}}$ concentrations inside yurts or "gers." Some of these gers were part of a non-government agency (NGO) initiative to improve the insulating properties of these housing structures. The goal of the NGO was to decrease particulate emissions inside the gers; a secondary result was to lower the use of coal and other biomass material. LCSs were installed in gers heated primarily by coal, and interior air quality was measured. Gers that were modified by increasing their insulating capacities showed a 17.5% reduction in $\mathrm{PM_{2.5}}$ concentrations, but these concentrations remained higher than levels recommended by health organizations. Gers that were insulated and used a combination of both coal and electricity showed a 19.1% reduction in $\mathrm{PM_{2.5}}$ concentrations. Insulated gers that used electricity for both heating and cooking showed a 48% reduction in $\mathrm{PM_{2.5}}$, though concentrations were still 6.4 times higher than those recommended by the World Health Organization (WHO). Nighttime and daytime trends followed similar patterns in $\mathrm{PM_{2.5}}$ concentrations with slight variations. It was found that, at nighttime, the outside $\mathrm{PM_{2.5}}$ concentrations were generally higher than the inside concentrations of the gers in this study. This suggests that $\mathrm{PM_{2.5}}$ would flow into the gers whenever the doors were opened, causing spikes in $\mathrm{PM_{2.5}}$ concentrations.

physics.ao-ph↗
arXiv2024

On Early-stage Debunking Rumors on Twitter: Leveraging the Wisdom of Weak Learners

Recently a lot of progress has been made in rumor modeling and rumor detection for micro-blogging streams. However, existing automated methods do not perform very well for early rumor detection, which is crucial in many settings, e.g., in crisis situations. One reason for this is that aggregated rumor features such as propagation features, which work well on the long run, are - due to their accumulating characteristic - not very helpful in the early phase of a rumor. In this work, we present an approach for early rumor detection, which leverages Convolutional Neural Networks for learning the hidden representations of individual rumor-related tweets to gain insights on the credibility of each tweets. We then aggregate the predictions from the very beginning of a rumor to obtain the overall event credits (so-called wisdom), and finally combine it with a time series based rumor classification model. Our extensive experiments show a clearly improved classification performance within the critical very first hours of a rumor. For a better understanding, we also conduct an extensive feature evaluation that emphasized on the early stage and shows that the low-level credibility has best predictability at all phases of the rumor lifetime.

cs.SI↗
arXiv2024

A Comprehensive Low and High-level Feature Analysis for Early Rumor Detection on Twitter

Recent work have done a good job in modeling rumors and detecting them over microblog streams. However, the performance of their automatic approaches are not relatively high when looking early in the diffusion. A first intuition is that, at early stage, most of the aggregated rumor features (e.g., propagation features) are not mature and distinctive enough. The objective of rumor debunking in microblogs, however, are to detect these misinformation as early as possible. In this work, we leverage neural models in learning the hidden representations of individual rumor-related tweets at the very beginning of a rumor. Our extensive experiments show that the resulting signal improves our classification performance over time, significantly within the first 10 hours. To deepen the understanding of these low and high-level features in contributing to the model performance over time, we conduct an extensive study on a wide range of high impact rumor features for the 48 hours range. The end model that engages these features are shown to be competitive, reaches over 90% accuracy and out-performs strong baselines in our carefully cured dataset.

cs.SI↗
arXiv2024

Multiple Models for Recommending Temporal Aspects of Entities

Entity aspect recommendation is an emerging task in semantic search that helps users discover serendipitous and prominent information with respect to an entity, of which salience (e.g., popularity) is the most important factor in previous work. However, entity aspects are temporally dynamic and often driven by events happening over time. For such cases, aspect suggestion based solely on salience features can give unsatisfactory results, for two reasons. First, salience is often accumulated over a long time period and does not account for recency. Second, many aspects related to an event entity are strongly time-dependent. In this paper, we study the task of temporal aspect recommendation for a given entity, which aims at recommending the most relevant aspects and takes into account time in order to improve search experience. We propose a novel event-centric ensemble ranking method that learns from multiple time and type-dependent models and dynamically trades off salience and recency characteristics. Through extensive experiments on real-world query logs, we demonstrate that our method is robust and achieves better effectiveness than competitive baselines.

cs.IR↗
arXiv2024

On the Predictability of non-CGM Diabetes Data for Personalized Recommendation

With continuous glucose monitoring (CGM), data-driven models on blood glucose prediction have been shown to be effective in related work. However, such (CGM) systems are not always available, e.g., for a patient at home. In this work, we conduct a study on 9 patients and examine the online predictability of data-driven (aka. machine learning) based models on patient-level blood glucose prediction; with measurements are taken only periodically (i.e., after several hours). To this end, we propose several post-prediction methods to account for the noise nature of these data, that marginally improves the performance of the end system.

cs.CY↗
arXiv2022

Globally optimal and scalable $N$-way matching of astronomy catalogs

Building on previous Bayesian approaches, we introduce a novel formulation of probabilistic cross-identification, where detections are directly associated to (hypothesized) astronomical objects in a globally optimal way. We show that this new method scales better for processing multiple catalogs than enumerating all possible candidates, especially in the limit of crowded fields, which is the most challenging observational regime for new-generation astronomy experiments such as the Rubin Observatory Legacy Survey of Space and Time (LSST). Here we study simulated catalogs where the ground-truth is known and report on the statistical and computational performance of the method. The paper is accompanied by a public software tool to perform globally optimal catalog matching based on directional data.

astro-ph.IM↗
arXiv2022

Enabling hand gesture customization on wrist-worn devices

We present a framework for gesture customization requiring minimal examples from users, all without degrading the performance of existing gesture sets. To achieve this, we first deployed a large-scale study (N=500+) to collect data and train an accelerometer-gyroscope recognition model with a cross-user accuracy of 95.7% and a false-positive rate of 0.6 per hour when tested on everyday non-gesture data. Next, we design a few-shot learning framework which derives a lightweight model from our pre-trained model, enabling knowledge transfer without performance degradation. We validate our approach through a user study (N=20) examining on-device customization from 12 new gestures, resulting in an average accuracy of 55.3%, 83.1%, and 87.2% on using one, three, or five shots when adding a new gesture, while maintaining the same recognition accuracy and false-positive rate from the pre-existing gesture set. We further evaluate the usability of our real-time implementation with a user experience study (N=20). Our results highlight the effectiveness, learnability, and usability of our customization framework. Our approach paves the way for a future where users are no longer bound to pre-existing gestures, freeing them to creatively introduce new gestures tailored to their preferences and abilities.

cs.HC↗
arXiv2021

On the Feasibility of Predicting Questions being Forgotten in Stack Overflow

For their attractiveness, comprehensiveness and dynamic coverage of relevant topics, community-based question answering sites such as Stack Overflow heavily rely on the engagement of their communities: Questions on new technologies, technology features as well as technology versions come up and have to be answered as technology evolves (and as community members gather experience with it). At the same time, other questions cease in importance over time, finally becoming irrelevant to users. Beyond filtering low-quality questions, "forgetting" questions, which have become redundant, is an important step for keeping the Stack Overflow content concise and useful. In this work, we study this managed forgetting task for Stack Overflow. Our work is based on data from more than a decade (2008 - 2019) - covering 18.1M questions, that are made publicly available by the site itself. For establishing a deeper understanding, we first analyze and characterize the set of questions about to be forgotten, i.e., questions that get a considerable number of views in the current period but become unattractive in the near future. Subsequently, we examine the capability of a wide range of features in predicting such forgotten questions in different categories. We find some categories in which those questions are more predictable. We also discover that the text-based features are surprisingly not helpful in this prediction task, while the meta information is much more predictive.

cs.IR↗
arXiv2020

Admissibility of solution estimators for stochastic optimization

We look at stochastic optimization problems through the lens of statistical decision theory. In particular, we address admissibility, in the statistical decision theory sense, of the natural sample average estimator for a stochastic optimization problem (which is also known as the empirical risk minimization (ERM) rule in learning literature). It is well known that for some simple stochastic optimization problems, the sample average estimator may not be admissible. This is known as {\em Stein's paradox} in the statistics literature. We show in this paper that for optimizing stochastic linear functions over compact sets, the sample average estimator is admissible. Moreover, we study problems with convex quadratic objectives subject to box constraints. Stein's paradox holds when there are no constraints and the dimension of the problem is at least three. We show that in the presence of box constraints, admissibility is recovered for dimensions 3 and 4.

math.OC↗
arXiv2018

Uniqueness estimates for the general complex conductivity equation and their applications to inverse problems

The aim of the paper is twofold. Firstly, we would like to derive quantitative uniqueness estimates for solutions of the general complex conductivity equation. It is still unknown whether the \emph{strong} unique continuation property holds for such equations. Nonetheless, in this paper, we show that the unique continuation property in the form of three-ball inequalities is satisfied for the complex conductivity equation under only Lipschitz assumption on the leading coefficients. The derivation of such estimates relies on a delicate Carleman estimate. Secondly, we study the problem of estimating the size of an inclusion embedded inside of a conductive body with anisotropic complex admittivity by one boundary measurement. The study of such inverse problem is motivated by practical problems.

math.AP↗
arXiv2007

On a question of Landis and Oleinik

We answer in the affirmative a question posed by Landis and Oleinik on unique continuation of variable coefficients parabolic equations.

math.AP↗