arXiv subjects

Shan Shan

Publications and source records attributed to Shan Shan.

18 recordsLinked to original sources

arXiv2026

Access Protocols for Segmented Waveguide-Enabled Pinching-Antenna Systems (SWANs)

This paper proposes an access protocol framework for segmented waveguide-enabled pinching-antenna systems (SWANs), which exploits SWAN-induced reconfigurable channel diversity as a protocol-level resource for uplink random access. The framework consists of two stages, a channel-oracle stage and an access stage, designed under three SWAN operating modes: (i) one-segment selection (OS), (ii) segment aggregation (SA), and (iii) segment multiplexing (SM). Specifically, in the channel oracle stage, the OS mode is adopted to acquire sparse pilot observations and infer the channel responses across the SWAN configuration space. In this way, high-dimensional uplink channel acquisition is recast as a low-dimensional geometric localization problem, thereby reducing pilot overhead while preserving channel reconstruction accuracy. For the access stage, we construct two oracle-guided access codebooks under the SA and SM modes, respectively, which address the tradeoff between hardware complexity and multiuser access resolution. In particular, the SA-based scheme supports single radio frequency (RF) chain access through randomized segment-group activation, whereas the SM-based R-access scheme exploits multiple RF chains to construct deterministic access slots and enhance collision resolution. Finally, our numerical results demonstrate that (i) the proposed two-stage framework improves access performance under the same training overhead, (ii) anchor densification is more effective than aggressive segment aggregation for SA, and (iii) SM-based R-access achieves deterministic coverage and higher throughput in moderate- and high-load regimes, whereas SA-based access remains attractive for low-complexity implementations.

eess.SP↗

arXiv2026

Agent-Native Wireless Communications: Architecture, Opportunities, and the Road Ahead

Future wireless networks are moving toward autonomous service operation, where network control and resource management need to respond to time-varying radio conditions and evolving service objectives. To address this shift, this article develops an agent-native wireless communication framework that characterizes the interplay between agent intelligence and communication systems. In this framework, the coupling is organized around \emph{agents for communications} and \emph{communications for agents}. For agent-native operation, the architecture is organized around deployable computing infrastructure, programmable open radio access network (O-RAN) software, and controllable communication interfaces. Based on this architecture, \emph{agents for communications} addresses the use of agents in communication-system design and operation, including agent-generated communication software and agent-driven adaptive wireless optimization. On the other side, \emph{communications for agents} addresses wireless service support for agent operation, including network-supported single-agent loops and network-assisted multi-agent coordination. Finally, it outlines promising research directions for measurable, safe, and interoperable deployment of agent-native wireless communications.

eess.SP↗

arXiv2026

ClimateAgents: A Multi-Agent Research Assistant for Social-Climate Dynamics Analysis

The complex interaction between social behaviors and climate change requires more than traditional data-driven prediction; it demands interpretable and adaptive analytical frameworks capable of integrating heterogeneous sources of knowledge. This study introduces ClimateAgents, a multi-agent research assistant designed to support social-climate analysis through coordinated AI agents. Rather than focusing solely on predictive modeling, the framework assists researchers in exploring socio-environmental dynamics by integrating multimodal data retrieval, statistical modeling, textual analysis, and automated reasoning. Traditional approaches to climate analysis often address narrowly defined indicators and lack the flexibility to incorporate cross-domain socio-economic knowledge or adapt to evolving research questions. To address these limitations, ClimateAgents employs a set of collaborative, domain-specialized agents that collectively perform key stages of the research workflow, including hypothesis generation, data analysis, evidence retrieval, and structured reporting. The framework supports exploratory analysis and scenario investigation using datasets from sources such as the United Nations and the World Bank. By combining agent-based reasoning with quantitative analysis of socio-economic behavioral dynamics, ClimateAgents enables adaptive and interpretable exploration of relationships between climate indicators, social variables, and environmental outcomes. The results illustrate how multi-agent AI systems can augment analytical reasoning and facilitate interdisciplinary, data-driven investigation of complex socio-environmental systems.

cs.MA↗

arXiv2026

Pinching Antennas for Multiple Access in Multigroup Multicast Communications

This paper aims to design multiple access (MA) schemes to improve the max-min fairness (MMF) for pinching antennas (PAs)-based multigroup multicast communications, where PA placement and resource allocation are jointly optimized. Specifically, three MA schemes are considered to facilitate the multicast transmission: i) treating interference as noise (TIN), ii) non-orthogonal multiple access (NOMA), and iii) time-division multiple access (TDMA) with two PA reconfiguration protocols, namely pinching switching (PS) and pinching multiplexing (PM). i) For TIN, a closed-form solution is derived for optimal power allocation, while a sequential element-wise optimization (SEO) is developed for the PA placement. ii) For NOMA, a recursive power allocation framework incorporating a bisection search is developed, and a hierarchical objective evaluation (HOE) mechanism is incorporated to simplify the SEO process for PA location update. iii) For TDMA, the PS protocol allows the PA locations to be optimized separately using the SEO method, after which the time-power allocation is solved as a convex problem with a global optimum. Under the PM protocol, the PA locations are jointly optimized with the time-power resources through a Karush-Kuhn-Tucker (KKT)-based analytical solution. Numerical results demonstrate that: i) the pinching-antenna system (PASS) architecture significantly outperforms traditional fixed-antenna systems. ii) TDMA-PS achieves superior performance by fully leveraging the flexible PA reconfiguration and benefiting from interference-free transmission, whereas TIN serves as a practical lower-bound solution due to its simplicity despite its limited performance. iii) NOMA consistently outperforms TDMA-PM and, in high transmit power regimes with heterogeneous multicast group distributions, can even surpass the performance achieved by TDMA-PS.

eess.SP↗

arXiv2026

Pinching Antennas-Aided Integrated Sensing and Multicast Communication Systems

A pinching antennas (PAs)-aided integrated sensing and multicast communication framework is proposed. In this framework, the communication performance is measured by the multicast rate considering max-min fairness. Moreover, the sensing performance is quantified by the Bayesian Cram\'er-Rao bound (BCRB), where a Gauss-Hermite quadrature-based approach is proposed to compute the Bayesian Fisher information matrix. Based on these metrics, PA placement is optimized under three criteria: communications-centric (C-C), sensing-centric (S-C), and Pareto-optimal designs. These designs are investigated in two scenarios: the single-PA case and the multi-PA case. 1) For the single-PA case, a closed-form solution is derived for the location of the C-C transmit PA, while the S-C design yields optimal transmit and receive PA placements that are symmetric about the target location. Leveraging this geometric insight, the Pareto-optimal design is solved by enforcing this PA placement symmetry, thereby reducing the joint transmit and receive PA placement to the transmit PA optimization. 2) For the general multi-PA case, the PA placements constitute a highly non-convex optimization problem. To solve this, an element-wise alternating optimization-based method is proposed to sequentially optimize all PA placements for the S-C design, and is further incorporated into an augmented Lagrangian (AL) framework and a rate-profile formulation to solve the C-C and Pareto-optimal design problems, respectively. Numerical results show that: i) PASS substantially outperforms fixed-antenna baselines in both multicast rate and sensing accuracy; ii) the multicasting gain becomes more pronounced as the user density increases; and iii) the sensing accuracy improves with the number of deployed PAs.

eess.SP↗

arXiv2025

Reflexive Evidence-Based Multimodal Learning for Clean Energy Transitions: Causal Insights on Cooking Fuel Access, Urbanization, and Carbon Emissions

Achieving Sustainable Development Goal 7 (Affordable and Clean Energy) requires not only technological innovation but also a deeper understanding of the socioeconomic factors influencing energy access and carbon emissions. While these factors are gaining attention, critical questions remain, particularly regarding how to quantify their impacts on energy systems, model their cross-domain interactions, and capture feedback dynamics in the broader context of energy transitions. To address these gaps, this study introduces ClimateAgents, an AI-based framework that combines large language models with domain-specialized agents to support hypothesis generation and scenario exploration. Leveraging 20 years of socioeconomic and emissions data from 265 economies, countries and regions, and 98 indicators drawn from the World Bank database, the framework applies a machine learning based causal inference approach to identify key determinants of carbon emissions in an evidence-based, data driven manner. The analysis highlights three primary drivers: access to clean cooking fuels in rural areas, access to clean cooking fuels in urban areas, and the percentage of population living in urban areas. These findings underscore the critical role of clean cooking technologies and urbanization patterns in shaping emission outcomes. In line with growing calls for evidence-based AI policy, ClimateAgents offers a modular and reflexive learning system that supports the generation of credible and actionable insights for policy. By integrating heterogeneous data modalities, including structured indicators, policy documents, and semantic reasoning, the framework contributes to adaptive policymaking infrastructures that can evolve with complex socio-technical challenges. This approach aims to support a shift from siloed modeling to reflexive, modular systems designed for dynamic, context-aware climate action.

cs.HC↗

arXiv2025

Secure Multicast Communications with Pinching-Antenna Systems (PASS)

This article investigates secure multicast communications in pinching-antenna systems (PASS), where pinching beamforming is enabled by adaptively adjusting pinching antenna (PAs) positions along waveguides to improve multicast security. Specifically, a PASS-based secure multicast framework is proposed, in which joint optimization of transmit and pinching beamforming is conducted to maximize the secrecy multicast rate. i) For the single-group multicast scenario, an alternating optimization (AO) framework is employed, where the pinching beamformer is updated via an element-wise sequential optimization method. The transmit beamformer is designed via a semidefinite relaxation (SDR) formulation for an upper-bound solution, while a Dinkelbach-alternating direction method of multipliers (ADMM) offers a low-complexity alternative. ii) For the multi-group multicast scenario, transmit and pinching beamformers are alternately optimized under a majorization-minimization (MM) framework. The transmit beamformer is obtained via SDR or an efficient second-order cone programming (SOCP) method, while the pinching beamformer is updated through MM-based element-wise sequential update strategy. Numerical results are provided to demonstrate that: (i) PASS consistently outperform conventional fixed-location antenna architectures in terms of secrecy performance across various configurations; and (ii) the performance advantage of PASS over fixed-location architectures becomes more significant with increased service region, larger antenna arrays, and higher user and eavesdropper densities.

eess.SP↗

arXiv2025

Multigroup Multicast Design for Pinching-Antenna Systems: Waveguide-Division or Waveguide-Multiplexing?

This article addresses the design of multigroup multicast communications in the pinching-antenna system (PASS). A PASS-enabled multigroup transmission framework is proposed to maximize multicast rates under a couple of transmission architectures: waveguide-division (WD) and waveguide-multiplexing (WM). 1) For WD, an element-wise sequential optimization strategy is proposed for pinching beamforming, i.e., optimizing the activated positions of pinching antennas along dielectric waveguides. Meanwhile, a log-sum-exp projected gradient descent algorithm is proposed for transmit power allocation across waveguides. 2) For WM, a majorization-minimization (MM)-based framework is proposed to tackle the problem's non-smoothness and non-convexity. On this basis, a low-complexity element-wise sequential optimization method is developed for pinching beamforming using the MM surrogate objective. Furthermore, the optimal transmit beamformer structure is derived from the MM surrogate objective using the Lagrange duality, with an efficient transmit beamforming algorithm proposed using projected adaptive gradient descent. Numerical results demonstrate that: i) both WD and WM architectures in PASS achieve significant multicast rate improvements over conventional MIMO techniques, especially for systems with large service areas; ii) WM is more robust than WD in dense deployments, while WD excels when user groups are spatially separated.

eess.SP↗

arXiv2025

Computational Architects of Society: Quantum Machine Learning for Social Rule Genesis

The quantification of social science remains a longstanding challenge, largely due to the philosophical nature of its foundational theories. Although quantum computing has advanced rapidly in recent years, its relevance to social theory remains underexplored. Most existing research focuses on micro-cognitive models or philosophical analogies, leaving a gap in system-level applications of quantum principles to the analysis of social systems. This study addresses that gap by proposing a theoretical and computational framework that combines quantum mechanics with Generative AI to simulate the emergence and evolution of social norms. Drawing on core quantum concepts--such as superposition, entanglement, and probabilistic measurement--this research models society as a dynamic, uncertain system and sets up five ideal-type experiments. These scenarios are simulated using 25 generative agents, each assigned evolving roles as compliers, resistors, or enforcers. Within a simulated environment monitored by a central observer (the Watcher), agents interact, respond to surveillance, and adapt to periodic normative disruptions. These interactions allow the system to self-organize under external stress and reveal emergent patterns. Key findings show that quantum principles, when integrated with generative AI, enable the modeling of uncertainty, emergence, and interdependence in complex social systems. Simulations reveal patterns including convergence toward normative order, the spread of resistance, and the spontaneous emergence of new equilibria in social rules. In conclusion, this study introduces a novel computational lens that lays the groundwork for a quantum-informed social theory. It offers interdisciplinary insights into how society can be understood not just as a structure to observe but as a dynamic system to simulate and redesign through quantum technologies.

cs.AI↗

arXiv2025

Exploiting Pinching-Antenna Systems in Multicast Communications

The pinching-antenna system (PASS) reconfigures wireless links through pinching beamforming, in which the activated locations of pinching antennas (PAs) along dielectric waveguides are optimized. This article investigates the application of PASS in multicast communication systems, where pinching beamforming is designed to maximize the multicast rate. i) In the single-waveguide scenario, a closed-form solution for the optimal activated location is derived under the assumption of a single PA and linearly distributed users. Based on this, a closed-form expression for the achievable multicast rate is obtained and proven to be larger than that of conventional fixed-location antenna systems. For the general multiple-PA case with arbitrary user distributions, an element-wise alternating optimization (AO) algorithm is proposed to design the pinching beamformer. ii) In the multiple-waveguide scenario, an AO-based method is developed to jointly optimize the transmit and pinching beamformers. Specifically, the transmit beamformer is updated using a majorization-minimization (MM) framework together with second-order cone programming (SOCP), while the pinching beamformer is optimized via element-wise sequential refinement. Numerical results are provided to demonstrate that: i) PASS achieves significantly higher multicast rates than conventional fixed-location antenna systems, particularly when the number of users and spatial coverage increase; ii) increasing the number of PAs further improves the multicast performance of PASS.

eess.SP↗

arXiv2025

Using Gaussian Boson Samplers to Approximate Gaussian Expectation Problems

Gaussian Boson Sampling (GBS) have shown advantages over classical methods for performing some specific sampling tasks. To fully harness the computational power of GBS, there has been great interest in identifying their practical applications. In this study, we explore the use of GBS samples for computing a numerical approximation to the Gaussian expectation problem, that is to integrate a multivariate function against a Gaussian distribution. We propose two estimators using GBS samples, and show that they both can bring an exponential speedup over the plain Monte Carlo (MC) estimator. Precisely speaking, the exponential speedup is defined in terms of the guaranteed sample size for these estimators to reach the same level of accuracy $\epsilon$ and the same success probability $\delta$ in the $(\epsilon, \delta)$ multiplicative error approximation scheme. We prove that there is an open and nonempty subset of the Gaussian expectation problem space for such computational advantage.

quant-ph↗

arXiv2025

Estimating the Percentage of GBS Advantage in Gaussian Expectation Problems

Gaussian Boson Sampling (GBS), which can be realized with a photonic quantum computing model, perform some special kind of sampling tasks. In [4], we introduced algorithms that use GBS samples to approximate Gaussian expectation problems. We found a non-empty open subset of the problem space where these algorithms achieve exponential speedup over the standard Monte Carlo (MC) method. This speedup is defined in terms of the guaranteed sample size to reach the same accuracy $\epsilon$ and success probability $\delta$ under the $(\epsilon, \delta)$ multiplicative error approximation scheme. In this paper, we enhance our original approach by optimizing the average photon number in the GBS distribution to match the specific Gaussian expectation problem. We provide updated estimates of the guaranteed sample size for these improved algorithms and quantify the proportion of problem space where they outperform MC. Numerical results indicate that the proportion of the problem space where our improved algorithms have an advantage is substantial, and the advantage gained is significant. Notably, for certain special cases, our methods consistently outperform MC across nearly 100\% of the problem space.

quant-ph↗

arXiv2024

From Correlation to Causation: Understanding Climate Change through Causal Analysis and LLM Interpretations

This research presents a three-step causal inference framework that integrates correlation analysis, machine learning-based causality discovery, and LLM-driven interpretations to identify socioeconomic factors influencing carbon emissions and contributing to climate change. The approach begins with identifying correlations, progresses to causal analysis, and enhances decision making through LLM-generated inquiries about the context of climate change. The proposed framework offers adaptable solutions that support data-driven policy-making and strategic decision-making in climate-related contexts, uncovering causal relationships within the climate change domain.

cs.LG↗

arXiv2024

signDNE: A python package for ariaDNE and its sign-oriented extension

A key challenge in evolutionary biology is to develop robust computational tools that can accurately analyze shape variations across diverse anatomical structures. The Dirichlet Normal Energy (DNE) is a shape complexity metric that addresses this by summarizing the local curvature of surfaces, particularly aiding the analytical studies and providing insights into evolutionary and functional adaptations. Building on the DNE concept, we introduce a Python-based implementation, designed to compute both the original DNE and a newly developed sign-oriented DNE metric. This Python package includes a user-friendly command line interface (CLI) and built-in visualization tools to facilitate the interpretation of the surface's local curvature properties. The addition of signDNE, which integrates the convexity and concavity of surfaces, enhances the tool's ability to identify fine-scale features across a broad range of biological structures. We validate the robustness of our method by comparing its performance with standard implementations on a dataset of triangular meshes with varying discrete representations. Additionally, we demonstrate its potential applications through visualization of the local curvature field (i.e., local curvature value over the surface) on various biological specimens, showing how it effectively captures complex biological features. In this paper, we offer a brief overview of the Python CLI for ease of use. Alongside the Python implementation, we have also updated the original MATLAB package to ensure consistent and accurate DNE computation across platforms. These improvements enhance the tool's flexibility, reduce sensitivity to sampling density and mesh quality, and support a more accurate interpretation of biological surface topography.

q-bio.QM↗

arXiv2024

Identification of socioeconomic factors influencing global food price security using machine learning

Global concern over food prices and security has been exacerbated by the impacts of armed conflicts such as the Russia Ukraine War, pandemic diseases, and climate change. Traditionally, analyzing global food prices and their associations with socioeconomic factors has relied on static linear regression models. However, the complexity of socioeconomic factors and their implications extend beyond simple linear relationships. By incorporating determinants, critical characteristics identification, and comparative model analysis, this study aimed to identify the critical socioeconomic characteristics and multidimensional relationships associated with the underlying factors of food prices and security. Machine learning tools were used to uncover the socioeconomic factors influencing global food prices from 2000 to 2022. A total of 105 key variables from the World Development Indicators and the Food and Agriculture Organization of the United Nations were selected. Machine learning identified four key dimensions of food price security: economic and population metrics, military spending, health spending, and environmental factors. The top 30 determinants were selected for feature extraction using data mining. The efficiency of the support vector regression model allowed for precise prediction making and correlation analysis. Keywords: environment and growth, global economics, price fluctuation, support vector regression

stat.AP↗

arXiv2023

Human Limits in Machine Learning: Prediction of Plant Phenotypes Using Soil Microbiome Data

The preservation of soil health is a critical challenge in the 21st century due to its significant impact on agriculture, human health, and biodiversity. We provide the first deep investigation of the predictive potential of machine learning models to understand the connections between soil and biological phenotypes. We investigate an integrative framework performing accurate machine learning-based prediction of plant phenotypes from biological, chemical, and physical properties of the soil via two models: random forest and Bayesian neural network. We show that prediction is improved when incorporating environmental features like soil physicochemical properties and microbial population density into the models, in addition to the microbiome information. Exploring various data preprocessing strategies confirms the significant impact of human decisions on predictive performance. We show that the naive total sum scaling normalization that is commonly used in microbiome research is not the optimal strategy to maximize predictive power. Also, we find that accurately defined labels are more important than normalization, taxonomic level or model characteristics. In cases where humans are unable to classify samples accurately, machine learning model performance is limited. Lastly, we provide domain scientists via a full model selection decision tree to identify the human choices that optimize model prediction power. Our work is accompanied by open source reproducible scripts (https://github.com/solislemuslab/soil-microbiome-nn) for maximum outreach among the microbiome research community.

stat.ML↗

arXiv2022

Diffusion Maps : Using the Semigroup Property for Parameter Tuning

Diffusion maps (DM) constitute a classic dimension reduction technique, for data lying on or close to a (relatively) low-dimensional manifold embedded in a much larger dimensional space. The DM procedure consists in constructing a spectral parametrization for the manifold from simulated random walks or diffusion paths on the data set. However, DM is hard to tune in practice. In particular, the task to set a diffusion time t when constructing the diffusion kernel matrix is critical. We address this problem by using the semigroup property of the diffusion operator. We propose a semigroup criterion for picking t. Experiments show that this principled approach is effective and robust.

stat.ML↗

arXiv2019

ariaDNE: A Robustly Implemented Algorithm for Dirichlet Energy of the Normal

Point 1: Shape characterizers are metrics that quantify aspects of the overall geometry of a 3D digital surface. When computed for biological objects, the values of a shape characterizer are largely independent of homology interpretations and often contain a strong ecological and functional signal. Thus shape characterizers are useful for understanding evolutionary processes. Dirichlet Normal Energy (DNE) is a widely used shape characterizer in morphological studies. Point 2: Recent studies found that DNE is sensitive to various procedures for preparing 3D mesh from raw scan data, raising concerns regarding comparability and objectivity when utilizing DNE in morphological research. We provide a robustly implemented algorithm for computing the Dirichlet energy of the normal (ariaDNE) on 3D meshes. Point 3: We show through simulation that the effects of preparation-related mesh surface attributes such as triangle count, mesh representation, noise, smoothing and boundary triangles are much more limited on ariaDNE than DNE. Furthermore, ariaDNE retains the potential of DNE for biological studies, illustrated by its effectiveness in differentiating species by dietary preferences. Point 4: Use of ariaDNE can dramatically enhance assessment of ecological aspects of morphological variation by its stability under different 3D model acquisition methods and preparation procedure. Towards this goal, we provide scripts for computing ariaDNE and ariaDNE values for specimens used in previously published DNE analyses.

q-bio.QM↗