arXiv subjects

Bin Han

Publications and source records attributed to Bin Han.

At least 37 records · Page 2Linked to original sources

arXiv2026

Balancing Functionality and GDPR-Driven Privacy in ISAC Trajectory Sharing

Integrated Sensing and Communications (ISAC) enables trajectory sharing that enhances beamforming, resource allocation, and cooperative perception, yet raises fundamental privacy concerns under the General Data Protection Regulation (GDPR) data minimisation principle. This paper proposes a Fisher Information Density (FID)-constrained trajectory sharing framework that enforces a local lower bound on estimation uncertainty, providing hard, quantifiable privacy guarantees by construction. Unlike fixed-noise approaches, the proposed method bounds the Privacy Leak Ratio (PLR) regardless of sensing power or adversarial post-processing, ensuring that no trajectory segment can be reconstructed beyond a prescribed accuracy threshold. Simulations on the OpenTraj dataset demonstrate that the framework keeps the average PLR below 20-25% and the maximum leakage segment duration under 2-2.5 s, while preserving data utility for downstream tasks such as movement prediction. The resulting criterion is interpretable, model-agnostic, and compatible with GDPR-compliant ISAC system design.

eess.SP↗

arXiv2026

GDPR-Aware Trajectory Sharing for ISAC-Assisted Robot Navigation: A Case Study on FID-Constrained Collision Prediction

Integrated sensing and communication (ISAC) enables intelligent wireless infrastructure but raises growing regulatory concern as fine-grained personal trajectory histories become a byproduct of sensing. General Data Protection Regulation (GDPR) Articles 5(1)(c) and 5(1)(f) require that personal data be limited to what is necessary and protected through appropriate technical measures against unauthorised reconstruction. This paper addresses both requirements through a Fisher information density (FID)-constrained trajectory sharing scheme for robot collision avoidance, where sensing estimates are perturbed according to local information content before sharing. Experiments on real pedestrian traces show that FID-controlled sharing achieves a strictly better privacy-utility tradeoff than fixed-error perturbation: at matched missed-conflict rates, reconstruction leakage and sustained exposure lengths are consistently lower, establishing information-aware perturbation as a principled technical measure aligned with GDPR data minimisation and integrity requirements.

cs.RO↗

arXiv2026

Ling and Ring 2.6 Technical Report: Efficient and Instant Agentic Intelligence at Trillion-Parameter Scale

Efficient and scalable agentic intelligence requires models that can deliver both low-latency responses and strong reasoning capabilities while remaining practical to train, serve, and deploy. In this report, we present Ling-2.6 and Ring-2.6, a family of models designed to address this challenge at scale. Ling-2.6 is optimized for instant response generation and high capability per output token, whereas Ring-2.6 is tailored for deeper reasoning and more advanced agentic workflows. Instead of training from scratch, we upgrade the Ling-2.0 base model through architectural migration pre-training and large-scale post-training. This upgrade is guided by a unified co-design of model architecture, optimization objectives, serving systems, and agent training environments, enabling improvements in both model capability and deployment efficiency. At the architectural level, we introduce a hybrid linear attention design that integrates Lightning Attention with MLA, improving the efficiency of long-context training and decoding. To further enhance token efficiency, we optimize capability per output token through Evolutionary Chain-of-Thought, Linguistic Unit Policy Optimization, bidirectional preference alignment, and shortest-correct-response distillation. For agentic capabilities, we propose KPop, a reinforcement learning framework designed to support stable training of Ring-2.6-1T on large-scale environment-grounded data. KPop improves training efficiency through asynchronous scheduling across coding, search, tool use, and workflow execution, enabling scalable learning from complex agent-environment interactions. Together, Ling-2.6 and Ring-2.6 provide a practical pathway toward efficient, scalable, and open agentic systems. We open-source all checkpoints in the 2.6 family to support further research and development in practical agentic intelligence.

cs.CL↗

arXiv2026

RATrain: A Resource-Aware Training Runtime for Large Language Models on Bandwidth-Constrained Heterogeneous Supercomputing Platforms

Production heterogeneous supercomputing platforms are increasingly used to host large language model (LLM) training workloads. However, existing GPU-oriented training runtimes typically rely on high-bandwidth device memory, fast interconnects, and mature collective communication libraries, making them difficult to directly adapt to MT-3000, a platform with an explicit memory hierarchy, limited usable DDR capacity, and constrained inter-cluster communication. This paper presents RATrain, a resource-aware training runtime for dense LLMs on bandwidth-constrained heterogeneous supercomputing platforms. RATrain formulates standard non-interleaved 1F1B training as a training-state lifecycle scheduling problem, and schedules gradient synchronization, parameter update, parameter-view prefetching, and activation recovery at layer-level and stage-local granularity. RATrain further combines an MT-3000-aware execution backend for efficient and predictable FP16 GEMM, Attention Backward, and explicit data movement with a resource-aware planner that selects feasible training configurations under the 20GB usable-DDR constraint per compute cluster. We implement RATrain on a real MT-3000 platform and evaluate it using LLaMA-2-7B, Baichuan2-13B, Qwen2.5-32B, and LLaMA-2-70B configurations. Results show that RATrain achieves up to 1.35$\times$ end-to-end speedup over MT-3000-adapted GPU-style training strategies. For LLaMA-2-7B, RATrain scales to 1024 compute clusters, reaches 112,790.55 tokens/s, and achieves 97.0\% scaling efficiency. A further 1.028B-token correctness run shows that RATrain preserves the loss trajectory of a semantically equivalent Baseline-1F1B run, with a maximum relative loss deviation of 0.081\%.

cs.DC↗

arXiv2026

Bandwidth-Aware LLM Inference on Heterogeneous Many-Core Supercomputers

Large language model (LLM) inference is limited by high computational cost and memory bandwidth demands, making deployment on heterogeneous many-core processors challenging. Taking the MT-3000 processor used in the Tianhe supercomputer as an example, its limited main-memory bandwidth and distributed memory hierarchy exemplify these bottlenecks, making it difficult to directly migrate existing GPU-based inference frameworks. To address this problem, we propose THInfer, a hardware-aware inference framework that maximizes data locality under bandwidth-constrained conditions through hardware-software co-design and parallel strategy optimization. THInfer incorporates three key techniques: (1) a high-performance operator library for the VLIW SIMD architecture, providing hand-optimized FP16 kernels that achieve up to 70 percent of the peak performance per cluster; (2) a density-driven computation graph fusion and unified kernel scheduling mechanism, combined with a staged pipelined attention fusion method; and (3) a Prefill-Buffer-Decode (P-B-D) pipeline and bounded buffer management strategy, which supports hybrid parallelism and enables efficient multi-cluster collaboration through two-level communication based on MPI and hthreads. Experiments on the Llama model series show that THInfer improves throughput on the 7B model by 62 percent to 73 percent over DeepSpeed on two V100S GPUs and by 67 percent to 84 percent over the A800 GPU. The 13B and 30B models also demonstrate comparable or better performance. Moreover, THInfer maintains stable performance on the 70B model, whereas typical GPU-based frameworks fail to run under the same setting. Overall, THInfer significantly enhances throughput, reduces latency, and improves scalability, providing a feasible system solution for efficient and scalable LLM inference on heterogeneous many-core architectures.

cs.DC↗

arXiv2026

Efficient and simple fourth-order compact finite difference methods for convection-diffusion-reaction equations on arbitrary curved domains

In this paper, we discuss the 2D convection-diffusion-reaction equation with variable smooth coefficients and the Dirichlet boundary condition on a complicated, thin, and curved domain. We propose the fourth-order compact FDM at every grid point with the uniform Cartesian mesh. For the regular stencil center, we utilize the fourth-order compact 9-point FDM to approximate the solution. According to the preliminary analysis, we use vertical and horizontal transformations to derive fourth-order compact FDMs in 10 cases for all irregular stencil centers. To obtain the left-hand side of the stencil of the fourth-order FDM in each case, we only need to solve an at most $6 \times 24$ linear system which is presented with the explicit formula. The right-hand side of the FDM is constructed in explicit expression for any irregular stencil centers too. To achieve the fourth-order consistency, up to second-order partial derivatives of convection, diffusion, reaction, and source terms are used for the FDM at the regular stencil center, and the FDM at an irregular stencil center only requires first-order partial derivatives of convection, diffusion, reaction, and source terms, and up to third-order derivatives of the Dirichlet boundary function and the parametric expression of the boundary curve. We test challenging domains with 100-leaf, high-curvature, high-frequency, sharply varying, and nearly overlapping boundary curves, the proposed FDM produces the high accuracy and the stable fourth-order convergence rate in $l_2$ and $l_{\infty}$ norms. All stencils of our FDMs have a simple desired structure by only keeping grid points inside $Ω$ in the standard compact 9-point stencil for both regular stencils and boundary stencils, but without assuming any information outside the domain $Ω$.

math.NA↗

arXiv2026

Matched and Euclidean-Mismatched Decoding on Fourier-Curve Constellations with Tangent Noise

We study matched and Euclidean-mismatched decoding on finite Fourier-curve constellations with tangent-space artificial noise. Each hypothesis induces a Gaussian law with symbol-dependent rank-one covariance. We derive exact Euclidean pairwise errors for arbitrary pairs and an exact Gaussian-expectation representation for matched decoding on bilaterally tangent-orthogonal pairs. For uniform even constellations, the Euclidean side yields explicit distance spectra and symbol-error bounds across all offset classes; the matched side is exact on antipodal pairs and benchmarked numerically at the full-codebook level via Monte Carlo. By isolating the detection-theoretic consequence of tangent-space artificial noise, these results clarify analytically how noise fraction and constellation density enter the mismatch behavior; secrecy-rate implications require additional channel and adversary modeling.

cs.IT↗

arXiv2026

Physical Layer Deception as a Stackelberg Game: Strategy Regimes, Equilibrium, and Robust Design

Physical layer deception (PLD) combines physical layer security (PLS) with deception: the transmitter actively misleads the eavesdropper with falsified information. We model the transmitter-eavesdropper interaction as a Stackelberg game in which the transmitter commits to a resource allocation and encryption strategy, and each receiver best-responds by selecting among three decryption modes: Perception, Dropping, and Exclusion. Using semantic distortion as the metric, we derive closed-form switching surfaces that partition the parameter space into strategy regimes and identify conditions under which each regime dominates. The robust operating point, at the peak of the worst-case distortion envelope, is shown to be a Stackelberg equilibrium; iterative best-response dynamics oscillate around it with strictly lower time-averaged security. We evaluate the design under Nakagami-m fading with static and adaptive transmitter strategies, benchmarked against a classical PLS baseline. Numerical results validate the regime characterization and show 12-55% higher eavesdropper distortion than the erasure-only baseline across all fading conditions.

cs.CR↗

arXiv2026

Quotation-Based Data Retention Mechanism for Data Privacy in LLM-Empowered Network Services

The deployment of large language models (LLMs) for next-generation network optimization introduces novel data governance challenges. mobile network operators (MNOs) increasingly leverage generative artificial intelligence (AI) for traffic prediction, anomaly detection, and service personalization, requiring access to users' sensitive network usage data-including mobility patterns, traffic types, and location histories. Under the General Data Protection Regulation (GDPR), the California Consumer Privacy Act (CCPA), and similar regulations, users retain the right to withdraw consent and demand data deletion. However, extensive machine unlearning degrades model accuracy and incurs substantial computational costs, ultimately harming network performance for all users. We propose an iterative price discovery mechanism enabling MNOs to compensate users for data retention through sequential price quotations. The server progressively raises the unit price for retaining data while users independently determine their supply at each quoted price. This approach requires no prior knowledge of users' privacy preferences and efficiently maximizes social welfare across the network ecosystem.

cs.LG↗

arXiv2026

The Price of Ignorance: Information-Free Quotation for Data Retention in Machine Unlearning

When users exercise data deletion rights under the General Data Protection Regulation (GDPR) and similar regulations, mobile network operators face a tradeoff: excessive machine unlearning degrades model accuracy and incurs retraining costs, yet existing pricing mechanisms for data retention require the server to know every user's private privacy and accuracy preferences, which is infeasible under the very regulations that motivate unlearning. We ask: what is the welfare cost of operating without this private information? We design an information-free ascending quotation mechanism where the server broadcasts progressively higher prices and users self-select their data supply, requiring no knowledge of users' parameters. Under complete information, the protocol admits a unique subgame-perfect Nash equilibrium characterized by single-period selling. We formalize the Price of Ignorance -- the welfare gap between optimal personalized pricing (which knows everything) and our information-free quotation (which knows nothing) -- and prove a three-regime efficiency ordering. Numerical evaluation across seven mechanisms and 5000 Monte Carlo runs shows that this price is near zero: the information-free mechanism achieves >=99% of the welfare of its information-intensive benchmarks, while providing noise-robust guarantees and comparable fairness.

cs.GT↗

arXiv2026

Is ASMR Engineerable? A Signal Processing and User Experience Study

Autonomous Sensory Meridian Response (ASMR) has been remarkably popular in the recent decade, yet whether its effects can be deliberately engineered remains an open question. While ASMR effects validated through behavioral studies and neuro-physiological measurements such as electroencephalography (EEG) and related bio-signals, the acoustic mechanisms that trigger it remain poorly understood. We investigate whether ASMR responses can be systematically induced through controlled acoustic design, hypothesizing that cyclic patterns where predictability drives relaxation and variation sustains intrigue are key engineerable parameters. Specifically, we design cyclic sound patterns with varying predictability and randomness, and evaluate their effects via a structured user study. Signal processing-based feature extraction and regression analysis are used to establish an interpretable mapping between acoustic structure and perceived ASMR effects. Results show that relaxing effects accumulate progressively, are independent of spatial orientation, and remain stable across time. Crucially, smoothly spread, energy-dense cyclic patterns most effectively trigger ASMR, suggesting that signal-level engineering of ASMR experiences is achievable

eess.AS↗

arXiv2026

Quality-Aware Denoising of Ultra-Short TDoA Measurements for 5G-NR UAV Localization

Reliable positioning is essential for Uncrewed Aerial Vehicles (UAVs) in safety-critical urban operations, yet achieving sub-meter accuracy under stringent latency constraints remains challenging. While 3rd Generation Partnership Project (3GPP) specifies repeated Positioning Reference Signals (PRS) transmissions for accurate Time Difference of Arrival (TDoA) measurements, denoising techniques specifically tailored for extremely limited measurement sequences within 3GPP frameworks remain underexplored. We propose Adaptive Gain Exponential Smoother (AGES), a lightweight filter combining exponentially weighted averaging with adaptive gains informed by 3GPP measurement quality reports. Simulations demonstrate AGES achieves 30-40% reduction in positioning error with only 3-5 repeated measurements while maintaining Fifth Generation New Radio (5G-NR) infrastructure compatibility.

eess.SP↗

arXiv2026

Generative Semantic HARQ: Latent-Space Text Retransmission and Combining

Semantic communication conveys meaning rather than raw bits, but reliability at the semantic level remains an open challenge. We propose a semantic-level hybrid automatic repeat request (HARQ) framework for text communication, in which a Transformer-variational autoencoder (VAE) codec operates as a lightweight overlay on the conventional protocol stack. The stochastic encoder inherently generates diverse latent representations across retransmissions-providing incremental knowledge (IK) from a single model without dedicated protocol design. On the receiver side, a soft quality estimator triggers retransmissions and a quality-aware combiner merges the received latent vectors within a consistent latent space. We systematically benchmark six semantic quality metrics and four soft combining strategies under hybrid semantic distortion that mixes systematic bias with additive noise. The results suggest combining Weighted-Average or MRC-Inspired combining with self-consistency-based HARQ triggering for the best performance.

eess.SP↗

arXiv2026

The Structure of Service Level Agreement of Slice-based 5G Network

Network slicing is considered to be one of the key enablers to Fifth Generation (5G) communication system. Legacy telecommunication networks have been providing various services to all kinds of customers through a single network infrastructure. In contrast, with the deployment of network slicing, operators are now able to partition entire network into different slices, each with its own configuration and Quality of Service (QoS) requirements. There are many applications across industry, each needs an independent slice with its own functions and features. All these applications open new business opportunities, which require new business models and therefore every single slice needs an individual Service Level Agreement (SLA). In this paper, we proposed a comprehensive end-to-end structure of SLA between tenant and service provider of slice-based 5G network, which balances the interests of both sides. The proposed SLA is expected to define reliability, availability, and performance of delivered telecommunication services in order to ensure that right information gets to the right destination at right time, safely and securely. We also discussed the metrics of slice-based network SLA such as throughput, penalty, cost, revenue, profit, and QoS related metrics, which we think are very critical to be considered during the agreement.

cs.NI↗

arXiv2026

Network Slicing in 5G Mobile Communication Architecture, Profit Modeling, and Challenges

Efficient flexibility and higher system scalability call for enhanced network performance, better energy consumption, lower infrastructure cost, and effective resource utilization. To accomplish this, an architectural optimization and reconstruction of existing cellular network is required. Network slicing is considered to be one of the key enablers and an architectural answer of communication system of 2020 and beyond. Traditional mobile operators provide all types of services to various kinds of customers through a single network, however, with the deployment of network slicing operators are now able to divide entire network into different slices each with its own configuration and specific Quality of Service (QoS) requirements. In a slice-based network, each slice will be considered as a separate logical network. In this way, the infrastructure utilization and resource allocation will be much more energy and cost efficient in comparison to traditional network. In this paper, we provided a comprehensive discussion on concept and system architecture of network slicing with particular focus on its business aspect and profit modeling. We throughly discussed two different dimensions of profit modeling, so called Own-Slice Implementation and Resource Leasing for Outsourced Slices. We further addressed open research directions and existing challenges with the purpose of motivating new advances and adding realistic solutions to this emerging technology.

cs.NI↗

arXiv2026

Security, Privacy and System-Level Resillience of 6G End-to-End System: Hexa-X-II Perspective

The sixth generation (6G) of mobile networks are being developed to overcome limitations in previous generations and meet emerging user demands. As a European project, the Smart Networks and Services Joint Undertaking (SNS JU) 6G Flagship project Hexa-X-II has a leading role for developing technologies and anchoring 6G end-to-end system. This paper summarizes the security, privacy and resilient (SPR) controls identified by Hexa-X-II project and their validation frameworks.

cs.NI↗

arXiv2026

Can LLMs Truly Embody Human Personality? Analyzing AI and Human Behavior Alignment in Dispute Resolution

Large language models (LLMs) are increasingly used to simulate human behavior in social settings such as legal mediation, negotiation, and dispute resolution. However, it remains unclear whether these simulations reproduce the personality-behavior patterns observed in humans. Human personality, for instance, shapes how individuals navigate social interactions, including strategic choices and behaviors in emotionally charged interactions. This raises the question: Can LLMs, when prompted with personality traits, reproduce personality-driven differences in human conflict behavior? To explore this, we introduce an evaluation framework that enables direct comparison of human-human and LLM-LLM behaviors in dispute resolution dialogues with respect to Big Five Inventory (BFI) personality traits. This framework provides a set of interpretable metrics related to strategic behavior and conflict outcomes. We additionally contribute a novel dataset creation methodology for LLM dispute resolution dialogues with matched scenarios and personality traits with respect to human conversations. Finally, we demonstrate the use of our evaluation framework with three contemporary closed-source LLMs and show significant divergences in how personality manifests in conflict across different LLMs compared to human data, challenging the assumption that personality-prompted agents can serve as reliable behavioral proxies in socially impactful applications. Our work highlights the need for psychological grounding and validation in AI simulations before real-world use.

cs.AI↗

arXiv2026

Personality Expression Across Contexts: Linguistic and Behavioral Variation in LLM Agents

Large Language Models (LLMs) can be conditioned with explicit personality prompts, yet their behavioral realization often varies depending on context. This study examines how identical personality prompts lead to distinct linguistic, behavioral, and emotional outcomes across four conversational settings: ice-breaking, negotiation, group decision, and empathy tasks. Results show that contextual cues systematically influence both personality expression and emotional tone, suggesting that the same traits are expressed differently depending on social and affective demands. This raises an important question for LLM-based dialogue agents: whether such variations reflect inconsistency or context-sensitive adaptation akin to human behavior. Viewed through the lens of Whole Trait Theory, these findings highlight that LLMs exhibit context-sensitive rather than fixed personality expression, adapting flexibly to social interaction goals and affective conditions.

cs.CL↗