Searcharxiv⌕ Search

arXiv subjects

Jie Ding

Publications and source records attributed to Jie Ding.

At least 55 records · Page 3Linked to original sources

Recent Advances in Graphene-Based Humidity Sensors with the Focus of Structural Design: A Review

The advent of the 5G era means that the concepts of robot, VR/AR, UAV, smart home, smart healthcare based on IoT (Internet of Things) have gradually entered human life. Since then, intelligent life has become the dominant direction of social development. Humidity sensors, as humidity detection tools, not only convey the comfort of human living environment, but also display great significance in the fields of meteorology, medicine, agriculture and industry. Graphene-based materials exhibit tremendous potential in humidity sensing owing to their ultra-high specific surface area and excellent electron mobility under room temperature for application in humidity sensing. This review begins with the introduction of examples of various synthesis strategies of graphene, followed by the device structure and working mechanism of graphene-based humidity sensor. In addition, several different structural design methods of graphene are summarized, demonstrating the structural design of graphene can not only optimize the performance of graphene, but also bring significant advantages in humidity sensing. Finally, key challenges hindering the further development and practical application of high-performance graphene-based humidity sensors are discussed, followed by presenting the future perspectives.

cond-mat.mes-hall↗

Recent Advances in Graphene-Based Pressure Sensors: A Review

In recent years, pressure sensors have been widely used as crucial technology components in industrial, healthcare, consumer electronics, and automotive safety applications. With the development of intelligent technologies, there is a growing demand for pressure sensors with higher sensitivity, smaller size, and wider detection range. Graphene and its derivatives, as novel emerging materials in recent years, have received widespread attention from researchers due to their unique mechanical and electrical properties, and are considered as promising sensing materials for the high-performance pressure sensors. In general, graphene-based pressure sensors can be classified into flexible pressure sensors and gas pressure sensors. In this paper, we firstly introduce the basic properties of graphene and its derivatives and then review the research progress of both graphene-based flexible pressure sensors and graphene-based gas pressure sensors respectively, focusing on different sensing mechanisms. Finally, the application prospects of graphene-based pressure sensors as well as future challenges are discussed.

cond-mat.mes-hall↗

Graphene MEMS and NEMS

Graphene is being increasingly used as an interesting transducer membrane in micro- and nanoelectromechanical systems (MEMS and NEMS, respectively) due to its atomical thickness, extremely high carrier mobility, high mechanical strength and piezoresistive electromechanical transductions. NEMS devices based on graphene feature increased sensitivity, reduced size, and new functionalities. In this review, we discuss the merits of graphene as a functional material for MEMS and NEMS, the related properties of graphene, the transduction mechanisms of graphene MEMS and NEMS, typical transfer methods for integrating graphene with MEMS substrates, methods for fabricating suspended graphene, and graphene patterning and electrical contact. Consequently, we provide an overview of devices based on suspended and nonsuspended graphene structures. Finally, we discuss the potential and challenges of applications of graphene in MEMS and NEMS. Owing to its unique features, graphene is a promising material for emerging MEMS, NEMS and sensor applications.

cond-mat.mes-hall↗

Humidity Sensing Properties of Different Atomic Layers of Graphene on SiO2/Si Substrate

Graphene has the great potential to be used for humidity sensing due to ultrahigh surface area and conductivity. However, the impact of different atomic layers of graphene on SiO2/Si substrate on the humidity sensing have not been studied yet. In this paper, we fabricated three types of humidity sensors on SiO2/Si substrate based on one to three atomic layers of graphene, in which the sensing areas of graphene are 75 μm * 72 μm and 45 μm * 72 μm, respectively. We studied the impact of both the number of atomic layers of graphene and the sensing areas of graphene on the responsivity and response/recovery time of the prepared graphene-based humidity sensors. We found the relative resistance change of the prepared devices decreased with the increase of number of atomic layers of graphene under the same change of relative humidity. Further, devices based on tri-layer graphene showed the fastest response/recovery time while devices based on double-layer graphene showed the slowest response/recovery time. Finally, we chose the devices based on double-layer graphene that have relatively good responsivity and stability for application in respiration monitoring and contact-free finger monitoring.

cond-mat.mes-hall↗

Four ribbons of double-layer graphene suspending masses for NEMS applications

Graphene ribbons with a suspended proof mass for nanomechanical systems have been rarely studied. Here, we report three types of nanomechanical devices consisting of graphene ribbons (two ribbons, four ribbons-cross and four ribbons-parallel) with suspended Si proof masses and studied their mechanical properties. The resonance frequencies and built-in stresses of three types of devices ranged from tens of kHz to hundreds of kHz, and from 82.61 MPa to 545.73 MPa, respectively, both of which decrease with the increase of the size of proof mass. The devices with four graphene ribbons featured higher resonance frequencies and spring constants, but lower built-in stresses than two ribbon devices under otherwise identical conditions. The Young's modulus and fracture strain of double-layer graphene were measured to be 0.34 TPa and 1.13% respectively, by using the experimental data and finite element analysis (FEA) simulations. Our studies would lay the foundation for understanding of mechanical properties of graphene ribbons with a suspended proof mass and their potential applications in nanoelectromechanical systems.

cond-mat.mes-hall↗

Drift to Remember

Lifelong learning in artificial intelligence (AI) aims to mimic the biological brain's ability to continuously learn and retain knowledge, yet it faces challenges such as catastrophic forgetting. Recent neuroscience research suggests that neural activity in biological systems undergoes representational drift, where neural responses evolve over time, even with consistent inputs and tasks. We hypothesize that representational drift can alleviate catastrophic forgetting in AI during new task acquisition. To test this, we introduce DriftNet, a network designed to constantly explore various local minima in the loss landscape while dynamically retrieving relevant tasks. This approach ensures efficient integration of new information and preserves existing knowledge. Experimental studies in image classification and natural language processing demonstrate that DriftNet outperforms existing models in lifelong learning. Importantly, DriftNet is scalable in handling a sequence of tasks such as sentiment analysis and question answering using large language models (LLMs) with billions of parameters on a single Nvidia A100 GPU. DriftNet efficiently updates LLMs using only new data, avoiding the need for full dataset retraining. Tested on GPT-2 and RoBERTa, DriftNet is a robust, cost-effective solution for lifelong learning in LLMs. This study not only advances AI systems to emulate biological learning, but also provides insights into the adaptive mechanisms of biological neural systems, deepening our understanding of lifelong learning in nature.

cs.AI↗

Entropy Increasing Numerical Methods for Prediction of Reversible and Irreversible Heating in Supercapacitors

Accurate characterization of entropy plays a pivotal role in capturing reversible and irreversible heating in supercapacitors during charging/discharging cycles. However, numerical methods that can faithfully capture entropy variation in supercapacitors are still in lack. This work develops first-order and second-order finite-volume schemes for the prediction of non-isothermal electrokinetics in supercapacitors. Semi-implicit discretization that decouples temperature from ionic concentrations and electric potential results in an efficient first-order accurate scheme. Its numerical analysis theoretically establishes the unique solvability of the nonlinear scheme with the existence of positive ionic concentrations and temperature at discrete level. To obtain an entropy-increasing second-order scheme, a modified Crank-Nicolson approach is proposed for discretization of the logarithm of both temperature and ionic concentrations, which is employed to enforce numerical positivity. Moreover, numerical analysis rigorously demonstrates that both first-order and second-order schemes are able to unconditionally preserve ionic mass conservation and original entropy increase for a closed, thermally insulated supercapacitor. Extensive numerical simulations show that the proposed schemes have expected accuracy and robust performance in preserving the desired properties. Temperature oscillation in the charging/discharging processes is successfully predicted, unraveling a quadratic scaling law of temperature rising slope against voltage scanning rate. It is also demonstrated that the variation of ionic entropy contribution, which is the underlying mechanism responsible for reversible heating, is faithfully captured. Our work provides a promising tool in predicting reversible and irreversible heating in supercapacitors.

math.NA↗

DynamicFL: Federated Learning with Dynamic Communication Resource Allocation

Federated Learning (FL) is a collaborative machine learning framework that allows multiple users to train models utilizing their local data in a distributed manner. However, considerable statistical heterogeneity in local data across devices often leads to suboptimal model performance compared with independently and identically distributed (IID) data scenarios. In this paper, we introduce DynamicFL, a new FL framework that investigates the trade-offs between global model performance and communication costs for two widely adopted FL methods: Federated Stochastic Gradient Descent (FedSGD) and Federated Averaging (FedAvg). Our approach allocates diverse communication resources to clients based on their data statistical heterogeneity, considering communication resource constraints, and attains substantial performance enhancements compared to uniform communication resource allocation. Notably, our method bridges the gap between FedSGD and FedAvg, providing a flexible framework leveraging communication heterogeneity to address statistical heterogeneity in FL. Through extensive experiments, we demonstrate that DynamicFL surpasses current state-of-the-art methods with up to a 10% increase in model accuracy, demonstrating its adaptability and effectiveness in tackling data statistical heterogeneity challenges.

cs.LG↗

Drop the beat! Freestyler for Accompaniment Conditioned Rapping Voice Generation

Rap, a prominent genre of vocal performance, remains underexplored in vocal generation. General vocal synthesis depends on precise note and duration inputs, requiring users to have related musical knowledge, which limits flexibility. In contrast, rap typically features simpler melodies, with a core focus on a strong rhythmic sense that harmonizes with accompanying beats. In this paper, we propose Freestyler, the first system that generates rapping vocals directly from lyrics and accompaniment inputs. Freestyler utilizes language model-based token generation, followed by a conditional flow matching model to produce spectrograms and a neural vocoder to restore audio. It allows a 3-second prompt to enable zero-shot timbre control. Due to the scarcity of publicly available rap datasets, we also present RapBank, a rap song dataset collected from the internet, alongside a meticulously designed processing pipeline. Experimental results show that Freestyler produces high-quality rapping voice generation with enhanced naturalness and strong alignment with accompanying beats, both stylistically and rhythmically.

eess.AS↗

Base Models for Parabolic Partial Differential Equations

Parabolic partial differential equations (PDEs) appear in many disciplines to model the evolution of various mathematical objects, such as probability flows, value functions in control theory, and derivative prices in finance. It is often necessary to compute the solutions or a function of the solutions to a parametric PDE in multiple scenarios corresponding to different parameters of this PDE. This process often requires resolving the PDEs from scratch, which is time-consuming. To better employ existing simulations for the PDEs, we propose a framework for finding solutions to parabolic PDEs across different scenarios by meta-learning an underlying base distribution. We build upon this base distribution to propose a method for computing solutions to parametric PDEs under different parameter settings. Finally, we illustrate the application of the proposed methods through extensive experiments in generative modeling, stochastic control, and finance. The empirical results suggest that the proposed approach improves generalization to solving PDEs under new parameter regimes.

cs.LG↗

CroMo-Mixup: Augmenting Cross-Model Representations for Continual Self-Supervised Learning

Continual self-supervised learning (CSSL) learns a series of tasks sequentially on the unlabeled data. Two main challenges of continual learning are catastrophic forgetting and task confusion. While CSSL problem has been studied to address the catastrophic forgetting challenge, little work has been done to address the task confusion aspect. In this work, we show through extensive experiments that self-supervised learning (SSL) can make CSSL more susceptible to the task confusion problem, particularly in less diverse settings of class incremental learning because different classes belonging to different tasks are not trained concurrently. Motivated by this challenge, we present a novel cross-model feature Mixup (CroMo-Mixup) framework that addresses this issue through two key components: 1) Cross-Task data Mixup, which mixes samples across tasks to enhance negative sample diversity; and 2) Cross-Model feature Mixup, which learns similarities between embeddings obtained from current and old models of the mixed sample and the original images, facilitating cross-task class contrast learning and old knowledge retrieval. We evaluate the effectiveness of CroMo-Mixup to improve both Task-ID prediction and average linear accuracy across all tasks on three datasets, CIFAR10, CIFAR100, and tinyImageNet under different class-incremental learning settings. We validate the compatibility of CroMo-Mixup on four state-of-the-art SSL objectives. Code is available at \url{https://github.com/ErumMushtaq/CroMo-Mixup}.

cs.CV↗

WizardMerge -- Save Us From Merging Without Any Clues

Modern software development necessitates efficient version-oriented collaboration among developers. While Git is the most popular version control system, it generates unsatisfactory version merging results due to textual-based workflow, leading to potentially unexpected results in the merged version of the project. Although numerous merging tools have been proposed for improving merge results, developers remain struggling to resolve the conflicts and fix incorrectly modified code without clues. We present WizardMerge, an auxiliary tool that leverages merging results from Git to retrieve code block dependency on text and LLVM-IR level and provide suggestions for developers to resolve errors introduced by textual merging. Through the evaluation, we subjected WizardMerge to testing on 227 conflicts within five large-scale projects. The outcomes demonstrate that WizardMerge diminishes conflict merging time costs, achieving a 23.85% reduction. Beyond addressing conflicts, WizardMerge provides merging suggestions for over 70% of the code blocks potentially affected by the conflicts. Notably, WizardMerge exhibits the capability to identify conflict-unrelated code blocks that require manual intervention yet are harmfully applied by Git during the merging.

cs.SE↗

A second-order accurate, original energy dissipative numerical scheme for chemotaxis and its convergence analysis

This paper proposes a second-order accurate numerical scheme for the Patlak-Keller-Segel system with various mobilities for the description of chemotaxis. Formulated in a variational structure, the entropy part is novelly discretized by a modified Crank-Nicolson approach so that the solution to the proposed nonlinear scheme corresponds to a minimizer of a convex functional. A careful theoretical analysis reveals that the unique solvability and positivity-preserving property could be theoretically justified. More importantly, such a second order numerical scheme is able to preserve the dissipative property of the original energy functional, instead of a modified one. To the best of our knowledge, the proposed scheme is the first second-order accurate one in literature that could achieve both the numerical positivity and original energy dissipation. In addition, an optimal rate convergence estimate is provided for the proposed scheme, in which rough and refined error estimate techniques have to be included to accomplish such an analysis. Ample numerical results are presented to demonstrate robust performance of the proposed scheme in preserving positivity and original energy dissipation in blowup simulations.

math.NA↗

Additive-Effect Assisted Learning

It is quite popular nowadays for researchers and data analysts holding different datasets to seek assistance from each other to enhance their modeling performance. We consider a scenario where different learners hold datasets with potentially distinct variables, and their observations can be aligned by a nonprivate identifier. Their collaboration faces the following difficulties: First, learners may need to keep data values or even variable names undisclosed due to, e.g., commercial interest or privacy regulations; second, there are restrictions on the number of transmission rounds between them due to e.g., communication costs. To address these challenges, we develop a two-stage assisted learning architecture for an agent, Alice, to seek assistance from another agent, Bob. In the first stage, we propose a privacy-aware hypothesis testing-based screening method for Alice to decide on the usefulness of the data from Bob, in a way that only requires Bob to transmit sketchy data. Once Alice recognizes Bob's usefulness, Alice and Bob move to the second stage, where they jointly apply a synergistic iterative model training procedure. With limited transmissions of summary statistics, we show that Alice can achieve the oracle performance as if the training were from centralized data, both theoretically and numerically.

stat.ML↗

ColA: Collaborative Adaptation with Gradient Learning

A primary function of back-propagation is to compute both the gradient of hidden representations and parameters for optimization with gradient descent. Training large models requires high computational costs due to their vast parameter sizes. While Parameter-Efficient Fine-Tuning (PEFT) methods aim to train smaller auxiliary models to save computational space, they still present computational overheads, especially in Fine-Tuning as a Service (FTaaS) for numerous users. We introduce Collaborative Adaptation (ColA) with Gradient Learning (GL), a parameter-free, model-agnostic fine-tuning approach that decouples the computation of the gradient of hidden representations and parameters. In comparison to PEFT methods, ColA facilitates more cost-effective FTaaS by offloading the computation of the gradient to low-cost devices. We also provide a theoretical analysis of ColA and experimentally demonstrate that ColA can perform on par or better than existing PEFT methods on various benchmarks.

cs.LG↗

A Graph Transformer-Driven Approach for Network Robustness Learning

Learning and analysis of network robustness, including controllability robustness and connectivity robustness, is critical for various networked systems against attacks. Traditionally, network robustness is determined by attack simulations, which is very time-consuming and even incapable for large-scale networks. Network Robustness Learning, which is dedicated to learning network robustness with high precision and high speed, provides a powerful tool to analyze network robustness by replacing simulations. In this paper, a novel versatile and unified robustness learning approach via graph transformer (NRL-GT) is proposed, which accomplishes the task of controllability robustness learning and connectivity robustness learning from multiple aspects including robustness curve learning, overall robustness learning, and synthetic network classification. Numerous experiments show that: 1) NRL-GT is a unified learning framework for controllability robustness and connectivity robustness, demonstrating a strong generalization ability to ensure high precision when training and test sets are distributed differently; 2) Compared to the cutting-edge methods, NRL-GT can simultaneously perform network robustness learning from multiple aspects and obtains superior results in less time. NRL-GT is also able to deal with complex networks of different size with low learning error and high efficiency; 3) It is worth mentioning that the backbone of NRL-GT can serve as a transferable feature learning module for complex networks of different size and different downstream tasks.

cs.LG↗

Assisted Learning for Organizations with Limited Imbalanced Data

In the era of big data, many big organizations are integrating machine learning into their work pipelines to facilitate data analysis. However, the performance of their trained models is often restricted by limited and imbalanced data available to them. In this work, we develop an assisted learning framework for assisting organizations to improve their learning performance. The organizations have sufficient computation resources but are subject to stringent data-sharing and collaboration policies. Their limited imbalanced data often cause biased inference and sub-optimal decision-making. In assisted learning, an organizational learner purchases assistance service from an external service provider and aims to enhance its model performance within only a few assistance rounds. We develop effective stochastic training algorithms for both assisted deep learning and assisted reinforcement learning. Different from existing distributed algorithms that need to frequently transmit gradients or models, our framework allows the learner to only occasionally share information with the service provider, but still obtain a model that achieves near-oracle performance as if all the data were centralized.

cs.LG↗

RAW: A Robust and Agile Plug-and-Play Watermark Framework for AI-Generated Images with Provable Guarantees

Safeguarding intellectual property and preventing potential misuse of AI-generated images are of paramount importance. This paper introduces a robust and agile plug-and-play watermark detection framework, dubbed as RAW. As a departure from traditional encoder-decoder methods, which incorporate fixed binary codes as watermarks within latent representations, our approach introduces learnable watermarks directly into the original image data. Subsequently, we employ a classifier that is jointly trained with the watermark to detect the presence of the watermark. The proposed framework is compatible with various generative architectures and supports on-the-fly watermark injection after training. By incorporating state-of-the-art smoothing techniques, we show that the framework provides provable guarantees regarding the false positive rate for misclassifying a watermarked image, even in the presence of certain adversarial attacks targeting watermark removal. Experiments on a diverse range of images generated by state-of-the-art diffusion models reveal substantial performance enhancements compared to existing approaches. For instance, our method demonstrates a notable increase in AUROC, from 0.48 to 0.82, when compared to state-of-the-art approaches in detecting watermarked images under adversarial attacks, while maintaining image quality, as indicated by closely aligned FID and CLIP scores.

cs.CV↗