SearcharxivSearch

arXiv subjects

Muhammad Adil

Publications and source records attributed to Muhammad Adil.

At least 19 recordsLinked to original sources

Movable-Element STAR-RIS for 6G: From Programmable Propagation to Programmable Geometry

Reconfigurable intelligent surfaces (RISs) make the wireless propagation environment programmable, while simultaneously transmitting and reflecting RISs (STAR-RISs) extend this capability to users located on both sides of a surface. However, conventional STAR-RIS architectures retain a fixed physical geometry after deployment. Movable-element STAR-RIS (ME-STAR-RIS) introduces an additional spatial degree of freedom by allowing the surface elements to reposition within prescribed regions while maintaining electronic control of their transmission and reflection responses. This combination of electromagnetic and geometric reconfiguration can alter propagation distances, multipath combinations, spatial correlation, interference, near-field focusing, and sensing geometry. This article presents a system-level perspective on ME-STAR-RIS through the concept of programmable geometry. We discuss its operating principles, movement architectures, and promising applications in communications, security, near-field systems, sensing, and high-mobility networks. A representative case study comparing optimized fixed and movable STAR-RIS architectures illustrates measurable spectral-efficiency gains from limited local displacement and the resulting saturation behavior. Finally, key hardware, channel-acquisition, electromagnetic, energy, reliability, and control challenges are discussed toward practical ME-STAR-RIS deployment.

cs.ET

Battery-Aware Rate-Splitting Multiple Access for Solar-Powered Cell-Free LEO Satellite Networks

Cell-free low Earth orbit (LEO) satellite downlinks improve coverage and macro-diversity, but intermittent solar harvesting and finite onboard batteries can make communication-only resource allocation energy-aggressive. We develop battery-aware one-layer rate-splitting multiple access (BA-RSMA) for a fixed-cluster solar-powered cell-free LEO downlink. A perturbed physical-battery Lyapunov queue couples common/private power allocation to stored energy, while robust energy causality protects against bounded harvesting uncertainty and allows harvest curtailment at battery saturation. Under a fixed-precoder scalar effective-channel model, dual and quadratic transforms yield convex fixed-auxiliary resource-allocation subproblems and monotonic alternating updates. Numerical cross-validation against a direct nonlinear-programming reference gives a maximum relative objective gap below $2.8\times10^{-7}$ over 12 representative slot--state instances. In a 20-seed battery-stressed experiment, BA-RSMA achieves 1.631~Mbit/J and reduces mean near-depletion from 24.84\% under Myopic-RSMA to 6.82\%, at only a 1.7\% EE penalty.

eess.SP

Performance Analysis of RSMA-Enabled Bistatic ISAC in LEO Networks with Holographic Apertures and Fluid-Antenna Users

This paper develops an ergodic performance framework for rate-splitting multiple access (RSMA)-enabled bistatic integrated sensing and communication (ISAC) in a low-Earth-orbit (LEO) satellite network with an amplitude-constrained reconfigurable holographic surface (RHS) and fluid-antenna-system (FAS) users. Deterministic angle-based common and zero-forcing private reference beams are realized through one shared multi-feed RHS amplitude state and stream-specific feed-domain precoders, and the resulting self-, leakage-, and target-direction gains are retained explicitly. Conservative private- and common-rate lower bounds are derived for both reference-port and best-of-$P$ FAS reception while preserving the same-port selection coupling. For sensing, a closed-form average bistatic sensing signal-to-noise ratio (SNR) is obtained under nearest-receiver association and a finite target--receiver guard distance, with extensions to angle-conditioned footprint averaging and angular scheduling. Monte Carlo results confirm the tightness of the analytical rate bounds and validate the sensing expressions. Benchmarks show that scalar RHS-efficiency models can miss strong direction-dependent effects and that nearest-ground-receiver bistatic sensing provides a $17.7$--$25.7$~dB mean SNR advantage over a favorable monostatic LEO reference for $N_{\rm RHS}=16384$ over LEO altitudes of $400$--$1000$~km. FAS gains are largest in scattering-rich regimes, while the realized shared-state RHS target gain need not vary monotonically with aperture size.

eess.SP

Joint Average Contiguous Duration of Correlated Fading Envelopes

Average contiguous duration (ACD) measures the mean time for which a fading envelope remains continuously inside a bounded amplitude interval. This letter extends the concept to two correlated observations by introducing joint average contiguous duration (JACD) and joint average fade duration (JAFD). Both metrics are expressed as joint-region occupancy probabilities divided by the corresponding inward boundarycrossing rates. For correlated Rayleigh fading, closed-form JACD and JAFD expressions are derived using the bivariate Rayleigh cumulative distribution function (CDF), Rayleigh level-crossing rates, and conditional Rician probabilities. As an application, reciprocal secret-key generation (SKG) is considered through JACD-based multilevel quantization and raw key generation rate (KGR) expressions. Numerical results show that JACD-balanced quantization improves the worst-bin joint duration, same-bin occupancy, and sample-wise raw KGR compared with marginalACD balancing.

eess.SP

Secrecy Outage Analysis over Correlated Composite Generalized-Gamma Fading Channels

This paper investigates physical-layer security (PLS) over correlated composite generalized-Gamma (GG)/GG fading channels, where both shadowing and small-scale fading follow GG distributions. Using Mellin transforms and Fox-H functions, closed-form expressions are derived for the single-link probability density function (PDF), joint distribution, survival function, and zero-rate secrecy outage probability (SOP)/probability of non-zero secrecy capacity (PNZSC). The general-rate SOP is expressed as an exact double series with one residual onedimensional integral per term. The model includes the Nakagamim/GG and Nakagami-m/Gamma channels as special cases. Numerical results validate the analysis and demonstrate the impact of the fading parameters on secrecy performance.

cs.IT

Integration of Object Detection and Small VLMs for Construction Safety Hazard Identification

Accurate and timely identification of construction hazards around workers is essential for preventing workplace accidents. While large vision-language models (VLMs) demonstrate strong contextual reasoning capabilities, their high computational requirements limit their applicability in near real-time construction hazard detection. In contrast, small vision-language models (sVLMs) with fewer than 4 billion parameters offer improved efficiency but often suffer from reduced accuracy and hallucination when analyzing complex construction scenes. To address this trade-off, this study proposes a detection-guided sVLM framework that integrates object detection with multimodal reasoning for contextual hazard identification. The framework first employs a YOLOv11n detector to localize workers and construction machinery within the scene. The detected entities are then embedded into structured prompts to guide the reasoning process of sVLMs, enabling spatially grounded hazard assessment. Within this framework, six sVLMs (Gemma-3 4B, Qwen-3-VL 2B/4B, InternVL-3 1B/2B, and SmolVLM-2B) were evaluated in zero-shot settings on a curated dataset of construction site images with hazard annotations and explanatory rationales. The proposed approach consistently improved hazard detection performance across all models. The best-performing model, Gemma-3 4B, achieved an F1-score of 50.6%, compared to 34.5% in the baseline configuration. Explanation quality also improved significantly, with BERTScore F1 increasing from 0.61 to 0.82. Despite incorporating object detection, the framework introduces minimal overhead, adding only 2.5 ms per image during inference. These results demonstrate that integrating lightweight object detection with small VLM reasoning provides an effective and efficient solution for context-aware construction safety hazard detection.

cs.CV

From Remote Sensing to Multiple Time Horizons Forecasts: Transformers Model for CyanoHAB Intensity in Lake Champlain

Cyanobacterial Harmful Algal Blooms (CyanoHABs) pose significant threats to aquatic ecosystems and public health globally. Lake Champlain is particularly vulnerable to recurring CyanoHAB events, especially in its northern segment: Missisquoi Bay, St. Albans Bay, and Northeast Arm, due to nutrient enrichment and climatic variability. Remote sensing provides a scalable solution for monitoring and forecasting these events, offering continuous coverage where in situ observations are sparse or unavailable. In this study, we present a remote sensing only forecasting framework that combines Transformers and BiLSTM to predict CyanoHAB intensities up to 14 days in advance. The system utilizes Cyanobacterial Index data from the Cyanobacterial Assessment Network and temperature data from Moderate Resolution Imaging Spectroradiometer satellites to capture long range dependencies and sequential dynamics in satellite time series. The dataset is very sparse, missing more than 30% of the Cyanobacterial Index data and 90% of the temperature data. A two stage preprocessing pipeline addressed data gaps by applying forward fill and weighted temporal imputation at the pixel level, followed by smoothing to reduce the discontinuities of CyanoHAB events. The raw dataset is transformed into meaningful features through equal frequency binning for the Cyanobacterial Index values and extracted temperature statistics. Transformer BiLSTM model demonstrates strong forecasting performance across multiple horizons, achieving F1 scores of 89.5%, 86.4%, and 85.5% at one, two, and three-day forecasts, respectively, and maintaining an F1 score of 78.9% with an AUC of 82.6% at the 14-day horizon. These results confirm the model's ability to capture complex spatiotemporal dynamics from sparse satellite data and to provide reliable early warning for CyanoHABs management.

cs.CV

Neuro-Symbolic AI for Cybersecurity: State of the Art, Challenges, and Opportunities

Cybersecurity demands both rapid pattern recognition and deliberative reasoning, yet purely neural or purely symbolic approaches each address only one side of this duality. Neuro-Symbolic (NeSy) AI bridges this gap by integrating learning and logic within a unified framework. This systematic review analyzes 103 publications across the neural-symbolic integration spectrum in cybersecurity through April 2026, organizing them via a three-tier taxonomy -- deep integration, structured interaction, and contextual baselines -- and a Grounding-Instructibility-Alignment (G-I-A) analytical lens. We find that multi-agent and structured-integration architectures across the surveyed spectrum substantially outperform single-agent approaches in complex scenarios, causal reasoning enables proactive defense beyond correlation-based detection, and knowledge-guided learning improves both data efficiency and explainability. These findings span intrusion detection, malware analysis, vulnerability discovery, and autonomous penetration testing, revealing that integration depth often correlates with capability gains across domains. A first-of-its-kind dual-use analysis further shows that autonomous offensive systems in the broader survey corpus are already achieving notable zero-day exploitation success at significantly reduced cost, fundamentally reshaping threat landscapes. However, critical barriers persist: evaluation standardization remains nascent, computational costs constrain deployment, and effective human-AI collaboration is underexplored. We distill these findings into a prioritized research roadmap emphasizing community-driven benchmarks, responsible development practices, and defensive alignment to guide the next generation of NeSy cybersecurity systems.

cs.CR

SymRAG: Efficient Neuro-Symbolic Retrieval Through Adaptive Query Routing

Current Retrieval-Augmented Generation systems use uniform processing, causing inefficiency as simple queries consume resources similar to complex multi-hop tasks. We present SymRAG, a framework that introduces adaptive query routing via real-time complexity and load assessment to select symbolic, neural, or hybrid pathways. SymRAG's neuro-symbolic approach adjusts computational pathways based on both query characteristics and system load, enabling efficient resource allocation across diverse query types. By combining linguistic and structural query properties with system load metrics, SymRAG allocates resources proportional to reasoning requirements. Evaluated on 2,000 queries across HotpotQA (multi-hop reasoning) and DROP (discrete reasoning) using Llama-3.2-3B and Mistral-7B models, SymRAG achieves competitive accuracy (97.6--100.0% exact match) with efficient resource utilization (3.6--6.2% CPU utilization, 0.985--3.165s processing). Disabling adaptive routing increases processing time by 169--1151%, showing its significance for complex models. These results suggest adaptive computation strategies are more sustainable and scalable for hybrid AI systems that use dynamic routing and neuro-symbolic frameworks.

cs.AI

Using Vision Language Models for Safety Hazard Identification in Construction

Safety hazard identification and prevention are the key elements of proactive safety management. Previous research has extensively explored the applications of computer vision to automatically identify hazards from image clips collected from construction sites. However, these methods struggle to identify context-specific hazards, as they focus on detecting predefined individual entities without understanding their spatial relationships and interactions. Furthermore, their limited adaptability to varying construction site guidelines and conditions hinders their generalization across different projects. These limitations reduce their ability to assess hazards in complex construction environments and adaptability to unseen risks, leading to potential safety gaps. To address these challenges, we proposed and experimentally validated a Vision Language Model (VLM)-based framework for the identification of construction hazards. The framework incorporates a prompt engineering module that structures safety guidelines into contextual queries, allowing VLM to process visual information and generate hazard assessments aligned with the regulation guide. Within this framework, we evaluated state-of-the-art VLMs, including GPT-4o, Gemini, Llama 3.2, and InternVL2, using a custom dataset of 1100 construction site images. Experimental results show that GPT-4o and Gemini 1.5 Pro outperformed alternatives and displayed promising BERTScore of 0.906 and 0.888 respectively, highlighting their ability to identify both general and context-specific hazards. However, processing times remain a significant challenge, impacting real-time feasibility. These findings offer insights into the practical deployment of VLMs for construction site hazard detection, thereby contributing to the enhancement of proactive safety management.

cs.CV

xIDS-EnsembleGuard: An Explainable Ensemble Learning-based Intrusion Detection System

In this paper, we focus on addressing the challenges of detecting malicious attacks in networks by designing an advanced Explainable Intrusion Detection System (xIDS). The existing machine learning and deep learning approaches have invisible limitations, such as potential biases in predictions, a lack of interpretability, and the risk of overfitting to training data. These issues can create doubt about their usefulness, transparency, and a decrease in trust among stakeholders. To overcome these challenges, we propose an ensemble learning technique called "EnsembleGuard." This approach uses the predicted outputs of multiple models, including tree-based methods (LightGBM, GBM, Bagging, XGBoost, CatBoost) and deep learning models such as LSTM (long short-term memory) and GRU (gated recurrent unit), to maintain a balance and achieve trustworthy results. Our work is unique because it combines both tree-based and deep learning models to design an interpretable and explainable meta-model through model distillation. By considering the predictions of all individual models, our meta-model effectively addresses key challenges and ensures both explainable and reliable results. We evaluate our model using well-known datasets, including UNSW-NB15, NSL-KDD, and CIC-IDS-2017, to assess its reliability against various types of attacks. During analysis, we found that our model outperforms both tree-based models and other comparative approaches in different attack scenarios.

cs.CR

ANSR-DT: A Neuro-Symbolic Framework for Adaptive and Explainable Digital Twins

Digital twins are increasingly used to monitor and optimize industrial systems, yet many existing frameworks remain difficult to interpret, slow to adapt, and limited in their ability to incorporate explicit domain knowledge. This paper presents ANSR-DT, an adaptive neuro-symbolic framework that unifies temporal anomaly detection, symbolic reasoning, and reinforcement-learning-based decision support within a single digital twin pipeline. ANSR-DT combines a CNN-LSTM model for multivariate pattern recognition with Prolog-based reasoning that converts learned signals into explicit rules, enabling transparent diagnoses and traceable decision paths. A PPO-based adaptation layer further refines operational responses under changing conditions while preserving interpretability. Experiments against eight baselines show that ANSR-DT delivers competitive predictive performance together with stable rule extraction, scalable symbolic reasoning, and actionable explanations. Additional validation on the Skoltech Anomaly Benchmark (SKAB) further indicates that the framework transfers beyond synthetic settings. These findings position ANSR-DT as a practical foundation for trustworthy, adaptive, and explainable industrial digital twins.

cs.AI

Decoding Android Malware with a Fraction of Features: An Attention-Enhanced MLP-SVM Approach

The escalating sophistication of Android malware poses significant challenges to traditional detection methods, necessitating innovative approaches that can efficiently identify and classify threats with high precision. This paper introduces a novel framework that synergistically integrates an attention-enhanced Multi-Layer Perceptron (MLP) with a Support Vector Machine (SVM) to make Android malware detection and classification more effective. By carefully analyzing a mere 47 features out of over 9,760 available in the comprehensive CCCS-CIC-AndMal-2020 dataset, our MLP-SVM model achieves an impressive accuracy over 99% in identifying malicious applications. The MLP, enhanced with an attention mechanism, focuses on the most discriminative features and further reduces the 47 features to only 14 components using Linear Discriminant Analysis (LDA). Despite this significant reduction in dimensionality, the SVM component, equipped with an RBF kernel, excels in mapping these components to a high-dimensional space, facilitating precise classification of malware into their respective families. Rigorous evaluations, encompassing accuracy, precision, recall, and F1-score metrics, confirm the superiority of our approach compared to existing state-of-the-art techniques. The proposed framework not only significantly reduces the computational complexity by leveraging a compact feature set but also exhibits resilience against the evolving Android malware landscape.

cs.CR

5G/6G-Enabled Metaverse Technologies: Taxonomy, Applications, and Open Security Challenges with Future Research Directions

Internet technology has proven to be a vital contributor to many cutting-edge innovations that have given humans access to interact virtually with objects. Until now, numerous virtual systems had been developed for digital transformation to enable access to thousands of services and applications that range from virtual gaming to social networks. However, the majority of these systems lack to maintain consistency during interconnectivity and communication. To explore this discussion, in the recent past a new term, Metaverse has been introduced, which is the combination of meta and universe that describes a shared virtual environment, where a number of technologies, such as 4th and 5th generation technologies, VR, ML algorithms etc., work collectively to support each other for the sake of one objective, which is the virtual accessibility of objects via one network platform. With the development, integration, and virtualization of technologies, a lot of improvement in daily life applications is expected, but at the same time, there is a big challenge for the research community to secure this platform from external and external threats, because this technology is exposed to many cybersecurity attacks. Hence, it is imperative to systematically review and understand the taxonomy, applications, open security challenges, and future research directions of the emerging Metaverse technologies. In this paper, we have made useful efforts to present a comprehensive survey regarding Metaverse technology by taking into account the aforesaid parameters. Following this, in the initial phase, we explored the future of Metaverse in the presence of 4th and 5th generation technologies. Thereafter, we discussed the possible attacks to set a preface for the open security challenges. Based on that, we suggested potential research directions that could be beneficial to address these challenges cost-effectively.

cs.CR

A First-Order Numerical Algorithm without Matrix Operations

This paper offers a matrix-free first-order numerical method to solve large-scale conic optimization problems. Solving systems of linear equations pose the most computationally challenging part in both first-order and second-order numerical algorithms. Existing direct and indirect methods are either computationally expensive or compromise on solution accuracy. Alternatively, we propose an easy-to-compute decomposition method to solve sparse linear systems that arise in conic optimization problems. Its iterations are tractable, highly parallelizable, with closed-form solutions. This algorithm can be easily implemented on distributed platforms, such as graphics processing units, with orders-of-magnitude time improvement. The performance of the proposed solver is demonstrated on large-scale conic optimization problems and is compared with the state-of-the-art first-order solvers.

math.OC

Machine Learning Based Relative Orbit Transfer for Swarm Spacecraft Motion Planning

In this paper we describe a machine learning based framework for spacecraft swarm trajectory planning. In particular, we focus on coordinating motions of multi-spacecraft in formation flying through passive relative orbit(PRO) transfers. Accounting for spacecraft dynamics while avoiding collisions between the agents makes spacecraft swarm trajectory planning difficult. Centralized approaches can be used to solve this problem, but are computationally demanding and scale poorly with the number of agents in the swarm. As a result, centralized algorithms are ill-suited for real time trajectory planning on board small spacecraft (e.g. CubeSats) comprising the swarm. In our approach a neural network is used to approximate solutions of a centralized method. The necessary training data is generated using a centralized convex optimization framework through which several instances of the n=10 spacecraft swarm trajectory planning problem are solved. We are interested in answering the following questions which will give insight on the potential utility of deep learning-based approaches to the multi-spacecraft motion planning problem: 1) Can neural networks produce feasible trajectories that satisfy safety constraints (e.g. collision avoidance) and low in fuel cost? 2) Can a neural network trained using n spacecraft data be used to solve problems for spacecraft swarms of differing size?

cs.RO

Optimal Multi-Robot Motion Planning via Parabolic Relaxation

Multi-robot systems offer enhanced capability over their monolithic counterparts, but they come at a cost of increased complexity in coordination. To reduce complexity and to make the problem tractable, multi-robot motion planning (MRMP) methods in the literature adopt de-coupled approaches that sacrifice either optimality or dynamic feasibility. In this paper, we present a convexification method, namely "parabolic relaxation", to generate optimal and dynamically feasible trajectories for MRMP in the coupled joint-space of all robots. We leverage upon the proposed relaxation to tackle the problem complexity and to attain computational tractability for planning over one hundred robots in extremely clustered environments. We take a multi-stage optimization approach that consists of i) mathematically formulating MRMP as a non-convex optimization, ii) lifting the problem into a higher dimensional space, iii) convexifying the problem through the proposed computationally efficient parabolic relaxation, and iv) penalizing with iterative search to ensure feasibility and recovery of feasible and near-optimal solutions to the original problem. Our numerical experiments demonstrate that the proposed approach is capable of generating optimal and dynamically feasible trajectories for challenging motion planning problems with higher success rate than the state-of-the-art, yet remain computationally tractable for over one hundred robots in a highly dense environment.

cs.RO

An Optimal Relay Scheme for Outage Minimization in Fog-based Internet-of-Things (IoT) Networks

Fog devices are beginning to play a key role in relaying data and services within the Internet-of-Things (IoT) ecosystem. These relays may be static or mobile, with the latter offering a new degree of freedom for performance improvement via careful relay mobility design. Besides that, power conservation has been a prevalent issue in IoT networks with devices being power-constrained, requiring optimal power-control mechanisms. In this paper, we consider a multi-tier fog-based IoT architecture where a mobile/static fog node acts as an amplify and forward relay that transmits received information from a sensor node to a higher hierarchically-placed static fog device, which offers some localized services. The outage probability of the presented scenario was efficiently minimized by jointly optimizing the mobility pattern and the transmit power of the fog relay. A closed-form analytical expression for the outage probability was derived. Furthermore, due to the intractability and non-convexity of the formulated problem, we applied an iterative algorithm based on the steepest descent method to arrive at a desirable objective. Simulations reveal that the outage probability was improved by 62.7% in the optimized-location fixed-power (OLFP) scheme, 79.3% in the optimized-power fixed-location (OPFL) scheme, and 94.2% in the optimized-location optimized-power (OLOP) scheme, as against the fixed-location and fixed-power (FLFP) scheme (i.e., without optimization). Lastly, we present an optimal relay selection strategy that chooses an appropriate relay node from randomly distributed relaying candidates.

cs.NI