Decoding imagined speech from non-invasive brain recordings is challenging because imagined datasets are scarce and difficult to align temporally across subjects and sessions In this work, we propose a new approach to the decoding of imagined speech that leverages the richer and more reliably labeled recordings during listening to speech. We collected paired listened and imagined MEG recordings to rhythmic melodic and spoken stimuli from trained musicians. Using trained musicians helped improve temporal alignment across conditions. We then developed a three-stage decoding pipeline that revealed consistent and meaningful relationships between neural activity evoked by imagining and listening to the same stimuli. First, we trained six linear and neural models to map imagined MEG responses to listened responses. We evaluated these models against a null baseline from unseen subjects to validate that the predicted-listening responses preserve stimulus-specific information. In the second stage, we trained a contrastive word decoder exclusively on the listened MEG responses, and evaluated it using four embedding strategies including semantic, acoustic, and phonetic representations. In the third stage, we process the imagined MEG responses from held-out subjects through the mapping pipeline to compute the corresponding listening responses that are then decoded by the listened decoder. Using rank-based analysis, we show that the imagined words are decodable significantly above chance. We shall report here the results of a proof-of-concept implementation to decode imagined speech, where all evaluations are performed on held-out subjects. We also demonstrate that performance improves with training data size, suggesting that this approach is scalable and can directly be made applicable to realistic brain-computer interface scenarios.

Recently, the pinching antenna systems (PASS) have attracted significant attention due to their ability to exploit dynamically reconfigurable pinching points along waveguides for flexible signal transmission. However, existing work largely overlooks user mobility although the optimal pinching configuration is highly dependent on the user's location and must be continuously adjusted. In this work, we investigate a PASS-enabled system model in which a base station (BS) serves a mobile user. We formulate an optimization problem that aims to maximize the user's average sum rate over a predefined time horizon while satisfying quality-of-service (QoS) constraint. This objective is achieved by jointly optimizing the beamforming vector at the BS and the pinching locations along the waveguides. Nevertheless, the resulting problem is highly non-convex and challenging to solve using conventional optimization techniques due to the intricate coupling among variables. The difficulty is further exacerbated by environmental randomness arising from user mobility and a probabilistic blockage model. This reveals a key engineering challenge: the performance gains of PASS critically rely on the ability to track or predict user trajectories in real time. To address these challenges, we adopt a deep deterministic policy gradient (DDPG) approach within a reinforcement learning framework, which is well-suited for continuous state and action spaces. Finally, extensive simulations are conducted to validate the proposed approach and demonstrate the importance of real-time configurability.

Building a site-specific propagation model typically requires either ray-tracing over detailed 3D maps or dense measurement campaigns. Both approaches are expensive and often infeasible for rapid deployments where geographic data is unavailable or outdated. We present PropSplat, a map-free propagation modeling method that reconstructs radio frequency (RF) fields using 3D anisotropic Gaussian primitives. Each Gaussian encodes a scalar path loss offset relative to an explicit baseline path loss model with a learnable path loss exponent. Gaussians are initialized along observed transmitter--receiver paths and optimized end-to-end to learn the propagation environment without external information like floor plans, terrain databases, or clutter data. We evaluate PropSplat against wireless radiance field methods NeRF$^2$, GSRF, and WRF-GS+ on two real-world datasets. On large-scale outdoor drive-tests spanning multiple topographical regions at six sub-6 GHz frequencies, PropSplat achieves 5.38 dB RMSE when training measurements are spaced 300m apart and outperforms WRF-GS+ (5.87 dB), GSRF (7.46 dB), and NeRF$^2$ (14.76 dB). On indoor Bluetooth Low Energy measurements, PropSplat achieves 0.19m mean localization error, an order of magnitude better than NeRF$^2$ (1.84m), while achieving near-identical received signal strength prediction accuracy. These results show that accurate site-specific propagation reconstruction is achievable from sparse RF-native measurements. The need for geographic data as a prerequisite for scalable RF environment modeling is reduced.

Traffic state estimation from sparse fixed sensors is challenging because physics-informed neural networks (PINNs) tend to over-smooth the shockwaves admitted by the Lighthill-Whitham-Richards (LWR) model. This study proposes Adaptive Domain Decomposition Physics-Informed Neural Networks (ADD-PINN), a two-stage residual-guided framework for LWR-based offline speed-field reconstruction. A coarse global PINN is first trained; its spatial residual profile is then used to place subdomain boundaries and initialize child subnetworks in a decomposition-enabled mode, while a data-driven shock indicator can retain a single-domain fallback when localized evidence of transition is weak. The primary offline I-24 MOTION evaluation spans five days, five sensor configurations, and ten seeds per configuration, yielding 1,500 runs in total. Against neural and physics-informed baselines, ADD-PINN attains the lowest relative L2 error in 18 of 25 configurations and in 14 of 15 sparse-sensing cases, while training 2.4 times faster than the extended PINN (XPINN) baseline. An ablation study supports spatial-only decomposition as an effective default for fixed-sensor traffic reconstruction in the evaluated settings. Supplementary Next Generation Simulation (NGSIM) experiments serve as a negative control: the shock indicator suppresses decomposition in all 50 runs, and the default single-domain fallback ranks first across all sensor configurations. These results support residual-guided spatial decomposition as an effective PINN-family design for offline reconstruction when sparse fixed sensing coincides with localized transition regions.

Safe operation of connected vehicle platoons under stochastic disturbances and time-delayed dynamics requires accurate quantification of rare but dangerous events, such as inter-vehicle collisions. We propose a rigorous framework for quantifying the risk of inter-vehicle collisions in connected vehicle platoons subject to time-delayed stochastic dynamics. We adopt the \emph{entropic value-at-risk} (EVaR) as a conservative metric to capture \emph{risk due to extreme events}, highlighting its advantages over conventional Value-at-Risk (VaR) and Conditional Value-at-Risk (CVaR). By expressing the inter-vehicle distance covariance in terms of the Laplacian eigenvalues of the communication network, we derive \emph{network-and time-delay-induced bounds} on both the minimum inherent risk and the worst-case risk. Specifically, the algebraic connectivity dictates the maximum EVaR, while the largest Laplacian eigenvalue determines the minimum risk inherently induced by the network structure. Numerical simulations illustrate how network topology and time delay shape collision risk, offering actionable insights for the safe design of vehicle platoons operating under stochastic disturbances.

This paper provides an in-depth analysis on how different aspects of the dynamic operating envelope (DOE) formulation impact the computation and allocation of network capacity. We show that the envelopes are significantly affected by the power flow model (non-linear or linear), binding network constraint (thermal or voltage) and by the calculation case (import or export envelope). We also propose a novel DOE algorithm (LACE) that presents transparent and scalable computation that is useful for larger networks or to act in tandem with other optimization engines. We run numerical simulations with different test feeders, including a realistic low-voltage feeder with real-world data from Belgium. This paper provides crucial insights and tools to distribution system operators (DSOs), stakeholders and academics alike to make sure DOE calculation achieves desirable and efficient outcome.

Atlas-based approaches allow high-quality, patient-specific shape reconstructions of cardiac anatomy from sparse and/or noisy data such as point clouds. However, these methods are mainly prior-driven, so the impact of uncertainty can be large, limiting their clinical reliability. We propose a probabilistic framework for uncertainty-aware cardiac shape reconstruction that combines Deep Signed Distance Functions (DeepSDFs) with Markov Chain Monte Carlo (MCMC) sampling. Cardiac geometries are modeled implicitly as zero-level sets of a neural network conditioned on learned latent codes, enabling multi-surface reconstruction of the left and right ventricles. By interpreting the reconstruction loss as a log-likelihood, we perform Bayesian inference in the latent space to obtain both maximum a posteriori (MAP) and posterior-sampled reconstructions. Experiments on a public cardiac dataset show that our approach produces accurate reconstructions and well-calibrated uncertainty estimates.

Sampling-based model predictive control (MPC) algorithms, such as model predictive path integral (MPPI), enable approximate, gradient-free solutions to optimal control problems by drawing samples from a proposal distribution, evaluating their trajectory costs, and updating the proposal parameters accordingly. However, these approaches typically rely on heuristics for adjusting hyperparameters, such as temperature or momentum, or manual tuning. We propose a trust region formulation for sampling-based MPC that constrains updates of the proposal distribution via a principled Kullback--Leibler (KL) divergence bound and, optionally, an entropy lower bound. This replaces heuristic hyperparameter adaptation with values that are optimal w.r.t. the underlying Lagrangian. We further improve sample efficiency and convergence by combining the trust region update with deterministic localized cumulative distribution (LCD)-based sampling. Experiments on two benchmark environments demonstrate that the proposed trust region update achieves faster convergence and better sample efficiency in low-sample and low-iteration regimes, especially when paired with deterministic LCD-based sampling.

We investigate interactive trajectory planning subject to uncertainty in the decisions of surrounding agents. To control the ego-agent, we aim to first learn the decision distribution and solve a Stochastic Model Predictive Control (SMPC) problem. To account for errors in the learned distribution, we show that it is possible to utilize Probably Approximately Correct (PAC) learning in combination with Distributionally Robust (DR) optimization to obtain a solution which accounts for the errors induced by the learning model. The results indicate that our PAC learning-based DR-MPC framework provides a method to interpolate between a robust MPC and an omnipotent SMPC, based on the available number of samples.

Satellite networks with dense low Earth orbit (LEO) constellations rely on aggressive spectrum reuse, making co-channel interference a dominant and rapidly varying factor that limits link availability and complicates spectrum sharing and compliance. Satellite radio map (RM) construction is therefore essential for interference cognition, yet it is challenging because the active satellite set is unknown, beam footprints and pointing are not directly observable, and received signal strength (RSS) measurements are difficult to calibrate under coupled link budget variations and noise. These latent uncertainties yield a severely underdetermined inverse problem with strong signature coherence, where existing methods often trade detection recall for precision and still fail to recover a faithful continuous RSS field. This paper proposes a beam-aware RM estimation framework that unifies active satellite identification and RSS field reconstruction through physics-consistent parametric modeling. An interpretable structural prior links geometry and beam shaping to spatial RSS formation, and an adaptive model order selection strategy infers the number of active satellites from measurements by balancing fit and complexity. Extensive experiments across varying signal to noise ratio (SNR), total satellite count, and active satellite count demonstrate consistently higher RSS spatial correlation, lower root mean squared error (RMSE), and improved F1 score, validating the proposed approach for interference-aware satellite RM construction in satellite networks.

This paper introduces a novel control strategy to optimize urban network traffic in mixed autonomy settings, featuring Connected and Automated Vehicles (CAVs) alongside Human-Driven Vehicles (HDVs). Unlike previous control strategies, where the impact of driver behaviour of CAVs and HDVs is not explicitly considered, we propose a dynamic, queue-responsive saturation rate to account for autonomy-driven variations in traffic flow characteristics. The proposed method is based on an extended multi-commodity store-and-forward model to a mixed autonomy environment, integrating optimized routing for CAVs via infrastructure-linked connectivity, and signal timings at every signalized intersection. The problem is formulated as a Non-Convex Quadratic Program (NQP), which accounts for queue evolution, spillback, green time allocation, and CAVs routing. To enable computational efficiency for real-time applications, we transform the NQP into a sequence of convex subproblems, leveraging under- and over-estimators to reformulate it as a Mixed Integer Linear Program (MILP). Experimental results via microscopic simulations validate the efficiency and robustness of the proposed methodology. The results reflect that the proposed model outperforms the existing multi-commodity approach, thus demonstrating its potential for real-time traffic optimization in future urban mobility systems.

This study investigates the performance of cascade PID control architecture applied to an inverted pendulum on a cart system through both simulation and experimental implementation. A nonlinear model of the system was developed using Simscape Multibody in Simulink, while a physical prototype was constructed using a DC motor-driven cart, pendulum, rotary encoder, ultrasonic sensor, and an Arduino. The cascade PID control structure consists of an inner loop regulating the pendulum angle and an outer loop controlling the cart position. Simulation results demonstrated effective stabilization of the pendulum and satisfactory position tracking under idealized conditions. Experimental results confirmed successful real-time stabilization but revealed notable differences from simulation, particularly in controller gains, transient behavior, and disturbance response due to sensor noise, unmodeled friction, and implementation constraints. The study also highlights the limitations of cascade PID control in disturbance rejection and large position commands, particularly under limited track length. A comparative analysis using an LQR-based inner loop demonstrated better disturbance rejection and reduced overshoot. The results provide practical insights into the applicability and limitations of cascade PID control of the inverted pendulum system.

Hardware acceleration has emerged as a key research topic for supporting computationally intensive signal processing and artificial intelligence applications in 6G research and development studies. This paper presents an RF Network on Chip (RFNoC) based hardware acceleration framework that offloads key physical layer procedures to a field programmable gate array (FPGA). The proposed design accelerates procedures, including low density parity check codes (LDPC) encoding and decoding, rate matching and unmatching, interleaving and deinterleaving, scrambling and descrambling, and log likelihood ratio estimation. The accelerator is integrated directly into the OpenAirInterface radio access network software, enabling simultaneous use of the FPGA as driver of the radio front end and a high throughput accelerator. The proposed system is validated through real time experiments with a commercial smartphone successfully connecting to the network. The implementation results demonstrate that a throughput of about 900 Mbps is achiievable using a moderate FPGA resource utlization.

A unified framework for the characterization of continuous electromagnetic (EM) manifolds for arbitrary multipleinput multiple-output (MIMO) system geometries is presented. The EM manifold refers to the set of all physically realizable radiated field vectors, parameterized by the array excitation, that encodes the full spatial structure of the antenna system including near-field phase variations, polarization, and mutual coupling. Building upon the discrete moment-matrix formulation, the proposed framework addresses three fundamental limitations simultaneously: (i) point-source near-field modeling errors in the radiation operator; (ii) confinement of the beamforming space to the $N$-dimensional subspace dictated by hardware port count; and (iii) restriction to linear (1D) array geometries. Each mesh element is modeled as a two-dimensional (2D) planar patch, whose spatially averaged Green's function is evaluated via Gauss-Legendre (GL) quadrature, yielding superior nearfield accuracy at negligible additional cost. A continuous feeding function $w(\mathbf{p})\in L^2(\mathcal{S}_\mathrm{T})$ is introduced as the infinite-dimensional limit of the $N$-port network, enabling optimization over a higher dimensional current subspace, decoupled from hardware constraints. Full-wave MATLAB Antenna Toolbox validation confirms near-field accuracy improvements over the state-of-the-art (SotA) baseline for both linear and planar array geometries, while maintaining reasonable computational complexity.

Single-channel speaker distance estimation has recently achieved centimeter-level accuracy in simulated environments, yet it remains unclear which components of the room impulse response (RIR) the model exploits and how performance depends on the recording conditions. In this work, we decompose simulated RIRs into four variants (full, direct-only, no-late, and no-early) using the mixing time estimated from the echo density function as the boundary between early reflections and late reverberation. We define four calibration scenarios, from fully calibrated (synchronised capture, known source level) to fully uncalibrated (arbitrary onset, unknown level), and evaluate all combinations on a matched dataset. Results show that without time calibration, mean absolute error (MAE) increases to $1.29$ m and the model extracts reverberation-based cues, with early reflections emerging as the most informative component. Further analysis against DRR, $C_{50}$, and $T_{60}$ confirms that estimation accuracy improves with stronger early energy and degrades in highly reverberant environments. When time calibration is available, the model achieves a MAE of $0.14$ m by extracting the propagation delay alone, regardless of the RIR content.

The successful completion of collaborative tasks relies on the effective selection of trustworthy collaborators. To accurately evaluate the trustworthiness of potential collaborators, it is necessary to combine insights from their past collaborations with assessments of their resource capabilities under specific task contexts. However, the coexistence of diverse trust perspectives, along with complex spatiotemporal dependencies among devices, makes accurate trust evaluation particularly challenging. To address these challenges, we propose a customized Graph Neural Network (GNN)-Mamba (GM) model for trust evaluation and collaborator selection. In this model, the GNN model performs spatial trust fusion by leveraging inter-device spatial dependencies extracted from historical collaborations, while the Mamba-based temporal model captures both short-term fluctuations and long-term evolution of device trust. In addition, task-specific resource trust is incorporated to reflect the practical capabilities of devices under varying task conditions. Experimental results demonstrate that the proposed GM model outperforms baseline approaches in terms of the accuracy and stability of trust evaluation.

Direct electric drivelines without power-split open new design freedom for frame and suspension design, along with often lower energy losses. This paper focuses on self-propelled agricultural machinery (combine and forage harvest-ers, root crop harvesters), equipment carriers, propelled trailers and field robots. For a typical vehicle with four driven wheels, the electric motors can be packaged as two axle modules or four wheel modules, both defined herein as self-contained mechatronic units with integrated power electronics, distributed control intelligence and steering. Axle module and wheel module concepts are compared in detail against engineering requirements including loads, effi-ciency, steerability, controllability, braking, suspension, structural load support, asymmetric wheel loading and manu-facturing cost. The wheel module offers maximum design freedom, redundancy and controllability, while the axle module provides lower cost, structural rigidity, automatic load sharing through the differential and the ability to be used in existing vehicle structures. Both concepts are defined such that distributed control intelligence and steering are integral to each unit, requiring only a DC power bus and communication interface from the vehicle.

Lens flares, caused by complex optical aberrations, severely degrade image quality especially in nighttime photography. Although recent restoration methods have made remarkable progress, most still rely on spatially uniform processing. They are failing to handle the region-dependent restoration demands of flare scenes, where saturated light sources should be preserved, flare artifacts removed, and background details recovered. To address this challenge, we propose DeflareMambav2, a prior-guided Mamba framework for lens flare removal. Specifically, we introduce a Flare Prior Network (FPN) to estimate flare priors and guide adaptive restoration. Besides, a novel radial serialization strategy breaks spatially homogeneous processing by performing flare-aware targeted sampling, and better supports long-range modeling in State Space Models (SSMs). Based on these priors, the backbone adopts a dual-level adaptive scheme. It explicitly preserves light-source regions to avoid over-processing, and applies curriculum-based restoration to the remaining contaminated areas while calibrating restoration intensity at the pixel level. Extensive experiments demonstrate that DeflareMambav2 achieves state-of-the-art performance with reduced parameter burden. Code is available at https://github.com/BNU-ERC-ITEA/DeflareMambav2.

The rapid growth of the low-altitude economy has intensified safety concerns arising from unauthorized unmanned aerial vehicles (UAVs), positioning UAV supervision as a key use case in 3GPP. To precisely sense such UAVs with wide coverage and low cost, we leverage fixed wireless access (FWA) customer premises equipment (CPEs), static, densely deployed devices that serve as wireless cameras for the radio environment. We develop an artificial intelligence-empowered two-stage cooperative sensing pipeline that exploits uplink channel state information (CSI) from multiple base station-CPE pairs for UAV detection and localization. In cooperative detection, lightweight CSI features are first individually extracted by neural network, and then adaptively integrated through an attention-based scheme to declare UAV presence. The learned attention scores effectively identify the critical pairs during detection, while facilitating UAV-affected pair selection for subsequent localization. For cooperative localization, neural network initially generates individual estimates and extract CSI features from selected pairs. These estimates, together with features and pair indexes, are fused using a Transformer to produce a precise cooperative estimate. Simulations show that cooperative schemes significantly reduce the missed detection probability to 0.63% and realize a 95%-confidence positioning error of 6.50 m, satisfying 3GPP requirements and showing the potential of FWA-assisted cooperative sensing. Dataset and codes are available on GitHub.

We propose a distributionally robust data-driven predictive control framework for stochastic linear time-invariant systems with unknown dynamics and disturbance distributions. We use an offline trajectory to fit the subspace predictive control (SPC) predictor via least squares and construct an empirical distribution of the prediction residuals as a proxy for the unknown disturbance distribution. We then center a Wasserstein ambiguity set around this estimate and minimize the worst-case expected cost while enforcing probabilistic output constraint satisfaction over all distributions in the set. The resulting problem admits a tractable reformulation with an equivalent direct data-driven form, eliminating the need for explicit predictor identification. Using finite-sample concentration results, we provide a data-driven Wasserstein radius such that, with high probability, the true expected cost is bounded above by the tractable objective and output constraints are satisfied with respect to the true disturbance distribution. Numerical simulations validate the framework against existing methods under various disturbance conditions and cost functions.

AI-RAN consolidates AI services and Radio Access Network (RAN) functions onto a unified, GPU-accelerated infrastructure at the network edge. However, compute sharing between real-time RAN functions and highly heterogeneous AI services requires coordination of scheduling decisions at mismatched timescales, and placement adaptation may require service migration across nodes with non-negligible interruptions. This paper proposes a hierarchical agentic framework (HAF) for compute sharing in AI-RAN that combines a large language model (LLM)-based agent for slow-timescale placement of AI services and RAN functions with a closed-form, deadline-aware convex algorithm for fast-timescale GPU/CPU allocation. The LLM agent is further equipped with a predictive critic that filters out migrations when the induced service interruption outweighs the expected service-level objective (SLO) benefit. Experimental results show that HAF reaches 90.0% overall SLO fulfillment, a 20.5% improvement over the strongest baseline, and raises AI service request fulfillment from 51% to 85.3%. Further evaluations show that HAF retains its advantage under diverse load conditions, while the critic consistently improves SLO fulfillment across multiple open-source LLM agents.

Falsification of hybrid dynamical systems remains challenging due to mode-dependent dynamics and discrete transitions. In this work, we propose a surrogate-based falsification approach that enables hybrid systems by learning a differentiable hybrid automaton model from data. This extends previous surrogate-based falsification methods, which were limited to purely continuous dynamics. Specifically, we employ neural hybrid automata to learn both a latent mode encoder and the corresponding mode-conditioned vector fields. Once the surrogate has paired each mode with an associated vector field, the transition guards are inferred using existing trajectory data. The learned surrogate is subsequently subjected to a gradient-based optimal control formulation, which minimizes a smooth approximation of the safety specification to find safety violations. In the last step, an experiment with the optimal control solution is carried out on the original system to ensure soundness. The proposed method consistently uncovers counterexamples on a majority of evaluated benchmark specifications; on these cases, it achieves competitive or improved sample efficiency than other tools while using a reduced simulation budget.

This paper assesses the resilience of IEC 61850 digital substations under False Data Injection Attacks (FDIAs) targeting the Sampled Values (SV) protocol. The multicast nature of SV, while enabling time-critical automation, exposes substations to cyber intrusions capable of disrupting protection functions and causing large-scale outages. To evaluate these risks, coordinated attack vectors involving both physical and cyber access at the bay level are experimentally analyzed using an advanced setup based on industrial-grade intelligent electronic devices (IEDs). The proposed attacks simultaneously manipulate multiple electrical parameters in a coordinated and physically consistent manner. Experimental results confirm the feasibility of stealthy multi-vector FDIAs that can trigger false protection actions, conceal real faults, or block protection mechanisms while maintaining realistic signal behavior. The Power Hardware-in-the-Loop (PHIL) testbed enables closed-loop evaluation under strict timing, communication, and protection logic constraints, reflecting real device behavior beyond simulation and controller-level HIL environments. The findings reveal critical vulnerabilities in SV-based protection schemes that directly affect grid reliability, particularly under realistic attacker positioning. To address these challenges, a defense strategy covering deterrence, prevention, detection, mitigation, and resilience is analyzed, with emphasis on bay-level infrastructure. Furthermore, a resilience-oriented method based on trusted independent channels and cross-verification of SV data within the protection logic is outlined as a complementary countermeasure for scenarios where existing standardized security mechanisms are insufficient.

Ingestible electronic systems enable non-invasive, in situ sensing within the gastrointestinal (GI) tract, yet clinical translation has been limited by uncontrolled transit, short operational lifetimes, and unreliable wireless communication that prevent continuous monitoring. Here, we present a gastric-resident ingestible robotic platform that achieves week-long operation through integration of a bioinspired, electrically triggered release mechanism with a kirigami-enabled electronic architecture. A kirigami-patterned flexible printed circuit board spans the capsule body and deployable superelastic arms, enabling high-density integration of sensing, power management, and wireless modules within a constrained volume while tolerating large mechanical deformation during gastric residence. Stable retention and on-demand disassembly are achieved using thermally responsive polycaprolactone joints that transition from rigid to compliant states under electrical activation, avoiding dependence on variable chemical triggers. Reliable telemetry in the highly attenuating gastric environment is maintained using a dual-band Bluetooth Low Energy and sub-gigahertz module with RSSI- and throughput-aware adaptive transmission, balancing link robustness and energy consumption. We demonstrate long-term, continuous monitoring of gastric radiation exposure, enabling early detection of dose accumulation and providing a promising in vivo alternative to wearable or handheld dosimeters. Swine studies confirm stable gastric residence, sustained real-time telemetry, and safe gastrointestinal passage following triggered disassembly. This work establishes kirigami-enabled integration as a scalable strategy for long-term gastric-resident robotic systems.

The institutional separation between local energy communities and public electric vehicle (EV) charging limits the efficient use of locally generated renewable energy. This paper introduces the concept of community-to-vehicle (C2V) as an institutional design mechanism to bridge this gap by enabling EV charging within the community boundary, where locally generated photovoltaic (PV) surplus is preferentially allocated and offered to external users at a community charging price. Building on the recently introduced local electricity community framework in Switzerland, we design scenarios that capture the transition from full separation to coordinated EV charging and evaluate their impacts on EV users and the community. The results show that C2V significantly improves local PV utilization and enhances economic performance, reducing EV charging costs relative to commercial alternatives while generating additional revenue streams for the community. These findings highlight the potential of C2V as a practical, implementable mechanism for integrating EV charging into local energy communities, providing a clear pathway for adopting coordinated community-EV interaction within existing regulatory frameworks.

We derive a physics-based, closed-form model linking antenna directivity to the root-mean-square (RMS) delay spread and mean excess delay in large reverberant indoor environments. Starting from the Rician K-factor-the ratio of line-of-sight (LOS) to scattered power we show that K scales with the total transmit-plus-receive (Tx+Rx) antenna gain through a single reverberance factor that quantifies scatter anisotropy. For an arbitrary scatter power delay profile (PDP), we derive a general identity connecting sigma, tau, and K; the exponential scatter model is the physically motivated special case. Ray-tracing simulations over 100 random link placements in a 57300 m3 industrial hall at 75 GHz validate the model. Compact design rules map target delay-spread values to the minimum required antenna gain, enabling wideband mmWave industrial links.

Semantic communication (SemCom) has emerged as a promising paradigm for next-generation networks. However, its typical end-to-end joint source--channel coding (JSCC) architecture also raises serious privacy concerns. To guide future secure SemCom design, it is important to understand how serious such leakage can be. Nevertheless, existing eavesdropping attacks mainly rely on fixed-configuration solvers and often require instantaneous wiretap channel state information (CSI) to achieve effective privacy inference. This may lead future secure SemCom designs to overlook potentially severe risks. To address this, we propose a large language model (LLM)-orchestrated agentic eavesdropper. Specifically, the proposed eavesdropper forms a closed-loop workflow with three functional agents. The optimization agent adaptively performs joint semantic-and-channel inversion to recover private information from the intercepted signal without requiring wiretap CSI. The perception agent evaluates the effectiveness of the optimization agent and assesses whether the recovered private semantics are reasonable, providing feedback to the optimization agent. The refinement agent further analyzes the recovered content and uses a generative prior to refine promising candidates into more realistic and complete private reconstructions while preserving consistency with the intercepted signal. Simulation results over a MIMO Rayleigh fading channel show that the proposed eavesdropper achieves more than $75\%$ eavesdropping success rate at $\mathrm{SNR}\geq 5$~dB even without wiretap CSI, highlighting a severe privacy threat that future secure SemCom systems must address.

We present an empirical case study of cinema SDR-to-HDR mapping using ASC StEM2, a rare common-source dataset containing EXR scene-referred images and matched SDR/HDR cinema release masters from the same ACES-based mastering workflow. Based on pixel-wise statistics over all 18,580 frames of the test film, we construct a three-domain comparison involving EXR source data, SDR release masters, and HDR release masters to characterize their luminance and color structural relationships within this controlled workflow. In the luminance dimension, SDR and HDR masters exhibit a highly stable global monotonic correspondence, with geometric structure remaining largely consistent overall; sparse and structured deviations appear in self-luminous highlights and specific material regions. In the color dimension, the two masters remain largely consistent in hue, with saturation exhibiting a redistribution pattern of shadow suppression, midtone expansion, and highlight convergence. Using EXR as a scene-referred anchor, we further define a pixel-level decision map that operationally separates EXR-closer recovery regions from content-adaptive adjustment regions. Under this operational definition, 82.4% of sampled image regions are classified as EXR-closer recovery, while the remainder require localized adaptive adjustment. Rather than claiming a universal law for all cinema mastering pipelines, the study provides an interpretable quantitative baseline for structure-aware SDR-to-HDR analysis and for designing learning-based models under shared-source mastering conditions.

The efficient user scheduling policy in the massive Multiple Input Multiple Output (mMIMO) system remains a significant challenge in the field of 5G and Beyond 5G (B5G) due to its high computational complexity, scalability, and Channel State Information (CSI) overhead. This paper proposes a novel Grover's search-inspired Quantum Reinforcement Learning (QRL) framework for mMIMO user scheduling. The QRL agent can explore the exponentially large scheduling space effectively by applying Grover's search to the reinforcement learning process. The model is implemented using our designed quantum-gate-based circuit, which imitates the layered architecture of reinforcement learning, where quantum operations act as policy updates and decision-making units. Moreover, the simulation results demonstrate that the proposed method achieves proper convergence and significantly outperforms classical Convolutional Neural Networks (CNN) and Quantum Deep Learning (QDL) benchmarks.

An energy-based modeling framework for the nonlinear dynamics of spatial Cosserat rods undergoing large displacements and rotations is proposed. The mixed formulation features independent displacement, velocity and stress variables and is further objective and locking-free. Finite rotations are represented using a director formulation that avoids singularities and yields a constant mass matrix. This results in an infinite-dimensional nonlinear port-Hamiltonian (PH) system governed by partial differential-algebraic equations with a quadratic energy functional. Using a time-differentiated compliance form of the stress-strain relations allows for the imposition of kinematic constraints, such as inextensibility or shear-rigidity. A structure-preserving finite element discretization leads to a finite-dimensional system with PH structure, thus facilitating the design of an energy-momentum consistent integration scheme. Dissipative material behavior (via the generalized-Maxwell model) and non-standard actuation approaches (via pneumatic chambers or tendons) integrate naturally into the framework. As illustrated by selected numerical examples, the present framework establishes a new approach to energy-momentum consistent formulations in computational mechanics involving finite rotations.