TTTruong X. Tran

Truong X. Tran

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Truong X. Tran has a total of 53 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Co-GRFuzz: Shared-Corpus Cooperative Fuzzing for Python Libraries

    by Anh Le Minh Viet, Hieu Nguyen Huy, Thang Hoang Nam, Anh Tran Hai, Truong Tran Xuan

    Parallel fuzzing can exchange successful inputs, but the behavior of different Python mutation strategies under a shared corpus is not well characterized. We evaluate four Pythonfuzz-anchored two-worker configurations-PP, PD, PO, and PG-on five Python libraries and compare them with isolated single-process references under one common sys.settrace-based line-transition coverage representation. The observed outcomes are target-dependent and do not favor GRPO as a cooperative partner. On python-dateutil, PD and PO each reach a global union of 3407 edges, whereas PG reaches 2913 despite similar local coverage of the learning-guided worker. On cryptography, PD and PO reach a 47-edge union while PG shows no union gain. A provenance-enabled PG run records 106 global-first discoveries whose direct parent was produced by the peer worker, documenting within-run seed reuse without establishing a causal benefit of sharing. Each configuration is represented by one six-hour campaign; the reported values are therefore individual campaign observations rather than statistical comparisons. Two previously undocumented exceptions are also reported as qualitative bug-finding evidence.

  • FedEABoost: A Client Entropy Adaptive Boosting Framework for Federated Learning

    by Hai Anh Tran, Huy-Hieu Nguyen, Quoc-Trung Le, Abdelhamid Mellouk, Truong X. Tran

  • Open Access

    Causal and Collective Learning for Adaptive Congestion Control in Heterogeneous Multi-Domain Networks

    by Hai Anh Tran, Truong X. Tran

    Modern computer networks increasingly operate in heterogeneous and multi-domain environments, including edge–cloud infrastructures, high-speed data center fabrics, and emerging 5G/6G and satellite–terrestrial hybrid networks. In such settings, existing congestion control mechanisms for TCP and QUIC often fail to maintain stable performance, as they rely on correlation-based signals that do not generalize well under dynamic and cross-domain conditions. This paper proposes a novel causal and collective learning framework for adaptive congestion control, formulating congestion control as a distributed adaptive control problem. Instead of directly mapping observed measurements to sending rates, the proposed approach learns causal representations of network dynamics to distinguish true congestion from non-congestive performance variations, and introduces collective learning where multiple client clusters coordinate via optional asynchronous exchange of compact abstract summaries without any centralized controller. The framework is realized by a lightweight control plane and a fast data-plane execution module with explicit timescale separation for practical deployability. Experiments on emulated multi-domain scenarios show that the proposed method improves the overall throughput–latency–fairness balance: it reduces RTT95 from 142.6 ms to 96.2 ms compared to TCP CUBIC (32.5% reduction) while increasing average throughput from 71.9 to 82.7 Mbps, and achieves higher fairness than aggressive model-based baselines (Jain index 0.93 versus 0.74 for TCP BBR) under multi-cluster contention.

  • Open Access

    Co-Evolutionary Mechanism Design for Federated Traffic Classification in Multi-ISP Edge–Cloud Clusters

    by Hai-Anh Tran, Truong X. Tran

    Federated learning enables multiple Internet service providers to collaboratively train traffic classification models without sharing raw traffic traces, which is attractive for privacy and business confidentiality in edge--cloud cluster deployments. However, incentive mismatches can motivate strategic behaviors such as low-effort training, selective participation, or subtle update bias, which degrade classification accuracy, fairness, and system stability. This paper proposes a co-evolutionary mechanism design framework that jointly optimizes coordinator policies and adaptive strategic Internet service provider behaviors. A population of coordinator mechanisms, including participation control, reward and penalty rules, auditing policies, and aggregation settings, is evolved via multi-objective search to balance classification utility with communication and computational overhead. In parallel, a population of strategic behaviors is evolved and expanded using a large language model that generates realistic tactics from observed system feedback. Experiments on federated traffic classification show that, under \((p_{\mathrm{str}}=0.4)\), the proposed approach achieves a macro-F1 of \((0.876)\) and improves the worst-ISP accuracy to 82.1%, outperforming fixed-rule and robustness-only baselines while maintaining practical coordination overhead.

  • Why is Data Misclassified? Quantifying Data Difficulty for Machine Learning Models with Dual Probability Difficulty Measure

    by Ayomide Afolabi, Ramazan Aygun, Truong X. Tran

    Despite the high accuracy of machine learning models, misclassification of data may raise issues regarding the trustworthiness of these models. There are a number of reasons for misclassification, such as model complexity and the difference between the distributions of training data and evaluation data. In this paper, we investigate whether specific data could be hard to classify correctly based on the training dataset or not. The development of measures to quantify the difficulty of data provides insight into assessing the potential performance of such models. However, most of the existing data difficulty measures, which are typically model-based, suffer from various model biases, while the few existing model-agnostic measures do not yield consistent results across datasets and machine learning models. In this paper, we propose a novel model-agnostic measure named Dual Probability Difficulty Measure. This measure considers the probability of the data instance label and the probability of the most frequent label that does not share the same label as the data instance in the K-nearest neighbors to assess the data difficulty. We conducted experiments to evaluate the accuracy of machine learning models with respect to different data difficulty levels and utilized the area under the curve to assess the effectiveness of our proposed method compared to other methods. Our experimental results on five diverse datasets across various machine learning models show that our Dual Probability Difficulty Measure has a correlation with model performance and identifies data likely to be misclassified.


  • Open Access

    Context-Enriched Dynamic Graph Word Embeddings for Robust NLP Applications

    by Truong X. Tran, Ryan E. Himes, Hai Anh Tran

    Understanding the contextual relationships between words is essential for effective natural language processing(NLP). Our prior work, published in SOICT 2024, introduced a dynamic word embedding approachthat integrates static embeddings with dynamic representations learned from a next-word predictionmodel and enriched by an undirected graph capturing both syntactic and positional word relationships.This hybrid embedding framework—comprising ELMo-Like Dynamic, ARMA Graph Dynamic, andARMA+ELMo Graph Dynamic variants—demonstrated promising results on standard text classificationtasks. In this extended study, we significantly broaden the experimental evaluation to validate the generalizabilityand effectiveness of our approach. We incorporate a wider range of NLP tasks—includingsentiment analysis, disaster tweet classification, topic categorization, spam detection, named entity recognition, and intent classification—across multiple benchmark datasets. Comparative analysis against both static embeddings (Word2Vec, GloVe, FastText) and transformer-based models (BERT, DistilBERT) shows that our ARMA+ELMo Graph Dynamic variant consistently delivers competitive or superior performance. Notably, our method achieves a classification accuracy of 93.2% on the AG News topic classification task and an F1-score of 94.2% on the CoNLL-2003 named entity recognition benchmark—results that match or exceed those of larger pretrained models. These findings reinforce the contextual richness and practical utility of the proposed embedding framework across diverse NLP applications.

  • FedImp: Enhancing Federated Learning Convergence With Impurity-Based Weighting

    by Hai Anh Tran, Cuong Ta, Truong X. Tran

    Federated Learning (FL) is a collaborative paradigm that enables multiple devices to train a global model while preserving local data privacy. A major challenge in FL is the non-Independent and Identically Distributed (non-IID) nature of data across devices, which hinders training efficiency and slows convergence. To tackle this, we propose Federated Impurity Weighting (FedImp), a novel algorithm that quantifies each device’s contribution based on the informational content of its local data. These contributions are normalized to compute distinct aggregation weights for the global model update. Extensive experiments on EMNIST and CIFAR-10 datasets show that FedImp significantly improves convergence speed, reducing communication rounds by up to 64.4%, 27.8%, and 66.7% on EMNIST, and 44.2%, 44%, and 25.6% on CIFAR-10 compared to FedAvg, FedProx, and FedAdp, respectively. Under highly imbalanced data distributions, FedImp outperforms all baselines and achieves the highest accuracy. Overall, FedImp offers an effective solution to enhance FL efficiency in non-IID settings.


  • Encrypted Traffic Classification Through Deep Domain Adaptation Network With Smooth Characteristic Function

    by Van Tong, Cuong Dao, Hai-Anh Tran, Duc Tran, Huynh Thi Thanh Binh, Thang Hoang-Nam, Truong X. Tran

    Encrypted network traffic classification has become a critical task with the widespread adoption of protocols such as HTTPS and QUIC. Deep learning-based methods have proven to be effective in identifying traffic patterns, even within encrypted data streams. However, these methods face significant challenges when confronted with new applications that were not part of the original training set. To address this issue, knowledge transfer from existing models is often employed to accommodate novel applications. As the complexity of network traffic increases, particularly at higher protocol layers, the transferability of learned features diminishes due to domain discrepancies. Recent studies have explored Deep Adaptation Networks (DAN) as a solution, which extends deep convolutional neural networks to better adapt to target domains by mitigating these discrepancies. Despite its potential, the computational complexity of discrepancy metrics, such as Maximum Mean Discrepancy, limits DAN’s scalability, especially when applied to large datasets. In this paper, we propose a novel DAN architecture that incorporates Smooth Characteristic Functions (SCFs), specifically SCF-unNorm (Unnormalized SCF) and SCF-pInverse (Pseudo-inverse SCF). These functions are designed to enhance feature transferability in task-specific layers, effectively addressing the limitations posed by domain discrepancies and computational complexity. The proposed mechanism provides a means to efficiently handle situations with limited labeled data or entirely unlabeled data for new applications. The aim is to limit the target error by incorporating a domain discrepancy between the source and target distributions along with the source error. Two statistics classes, SCF-unNorm and SCF-pInverse, are used to minimize this domain discrepancy in traffic classification. The experimental results demonstrate that our proposed mechanism outperforms existing benchmarks in terms of accuracy, enabling real-time traffic classification in network systems. Specifically, we achieve up to 99% accuracy with an execution time of only three milliseconds in the considered scenarios.