Search Results (6,142)

The purpose of this study is to examine whether analyst-level credit can be assigned quantitatively in a lightweight human-feedback decision-support pipeline. In intelligence and national security workflows, analysts often provide edits, comments, and evaluative feedback during the production of analytic products, yet these intermediate contributions are usually discarded, leaving no auditable record of how individual feedback shaped the final output. To address this problem, this study proposes a proof-of-concept Analyst-of-Record framework that combines synthetic analyst feedback, a linear ridge reward model, first-order influence functions, and additive Shapley aggregation to estimate both feedback-item and analyst-level contribution scores. The research design uses the Fact Extraction and VERification (FEVER) fact-verification dataset under controlled experimental settings. The pipeline retrieves evidence with Best Matching 25 (BM25), generates a grounded template-based response, derives three synthetic analyst feedback channels from FEVER annotations, trains a reward model on simple claim–answer and analyst-identity features, and aggregates per-feedback influence scores into an Analyst Contribution Index (ACI). The main experiments are conducted on a 500-claim subset across five random seeds, with additional ablation and bootstrap analyses used to assess sensitivity and stability. The findings show that the reward model achieves a mean validation $R^2$ of $0.801\pm 0.037$, indicating that the synthetic feedback signals are learnable under the selected featureization. The analyst-level contribution scores remain stable across random seeds, with approximately half of the total influence magnitude attributed to the explanation-quality channel and the remainder split across the other two channels. Ablation results further show that removing the explanation-quality channel collapses validation fit, while bootstrap resampling demonstrates tight concentration of absolute ACI magnitudes. Theoretically, this study extends attribution research beyond document-only grounding by showing how analyst feedback itself can be modeled as an object of contribution analysis. It also demonstrates that influence functions and Shapley-style aggregation can be adapted into a tractable framework for estimating interpretable analyst-level credit in a reproducible experimental setting. Practically, the proposed framework offers an initial foundation for more traceable and accountable decision-support workflows in which intermediate analyst contributions can be preserved rather than lost. The results also provide a feasible implementation path for future systems that incorporate stronger generators, richer evidence representations, and real analyst annotations. Full article

The accelerated integration of intelligent agents in user-centered digital environments has intensified research in the field of Human–Robot Interaction, especially regarding mechanisms for adaptive, intuitive, and cognitively aligned communication. The present study develops and empirically examines a structural model of BCI-inspired adaptive agents designed to support coordinated interaction in HRI contexts. The study analyzes users’ perceptions of standardized hypothetical interaction scenarios involving BCI-inspired adaptive digital agents, where BCI inspiration is conceptual and refers to adaptive architectures interpreting behavioral cues rather than direct neural signal acquisition. The proposed model integrates four main constructs—perceived technological innovation, user involvement, agent adaptivity, and digital synergy—and examines their associations with user satisfaction in digital collaborative environments. Data were collected through an anonymous questionnaire (N = 268) and analyzed using structural equation modeling with the PLS-SEM method. The structural model demonstrates substantial explanatory power, accounting for 66.8% of the variance in user satisfaction (R² = 0.668). The study contributes by empirically supporting a scenario-based structural evaluation framework suitable for early-stage adaptive HRI system design. The results highlight the role of digital synergy in aligning innovation, engagement, and adaptive behavior in BCI-inspired adaptive HRI systems, providing directions for the design of adaptive robotic agents oriented toward coordinated interaction, user-centered integration, and responsible use in collaborative digital ecosystems. Full article

Achieving stable bipedal locomotion for humanoid robots remains a central challenge in reinforcement learning (RL), in which the design of reward functions is pivotal but non-trivial. This paper proposes a three-tier statistical reward shaping framework to optimize bipedal gait learning. First, training outcomes are diagnostically monitored using forward distance, fall rate, and posture score. Pearson correlation and regression analyses are then employed to identify trade-offs and isolate the direct effects of reward components. Finally, targeted parameter sweeps enable directionally guided optimization, substantially reducing heuristic parameter tuning while refining a reward function for the H1 robot in Isaac Lab. Experimental results demonstrate clear improvements over the baseline. The optimized policy reduces convergence time by 14% and increases forward distance by 186%. Stability is markedly enhanced, with fall rate decreasing from 75% to 2% and active locomotion efficiency nearly doubling (0.339 to 0.678). These results validate a reproducible, data-driven framework for reward design, highlighting the importance of principled statistical analysis in complex RL-based humanoid locomotion. Full article

Video Anomaly Detection aims to identify video segments containing abnormal events. However, detecting anomalies relies more heavily on temporal modeling, particularly when anomalies exhibit only subtle deviations from normal events. However, most existing methods inadequately model the heterogeneity in spatiotemporal relationships, especially the dynamic interactions between human pose and video appearance. To address this, we propose GSMTNet, a dual-stream heterogeneous unsupervised network integrating gated spatio-temporal graph convolution and multi-scale temporal learning. First, we introduce a dynamic graph structure learning module, which leverages gated spatio-temporal graph convolutions with manifold transformations to model latent spatial relationships via human pose graphs. This is coupled with a normalizing flow-based density estimation module to model the probability distribution of normal samples in a latent space. Second, we design a hybrid dilated temporal module that employs multi-scale temporal feature learning to simultaneously capture long- and short-term dependencies, thereby enhancing the separability between normal patterns and potential deviations. Finally, we propose a dual-stream fusion module to hierarchically integrate features learned from pose graphs and raw video sequences, followed by a prediction head that computes anomaly scores from the fused features. Extensive experiments demonstrate state-of-the-art performance, achieving 86.81% AUC on ShanghaiTech and 70.43% on UBnormal, outperforming existing methods in rare anomaly scenarios. Full article

Although active learning can reduce the effort required to annotate object detection data, many current methods rely on a single selection criterion or combine criteria without accounting for annotation costs or their interactions. This paper presents a multi-criterion, cost-aware active learning framework for detecting small objects in agricultural images. The framework jointly considers prediction uncertainty, object size, scene density, and annotation cost. We evaluate both scalarized and Pareto-based selection strategies across five cost models and conduct an ablation study to examine the role and interactions of each criterion. Experimental results demonstrate that explicit annotation cost modeling improves active learning efficiency by reducing the amount of annotation required to achieve a given level of detection performance. Across multiple cost formulations and selection strategies, cost-aware acquisition reaches comparable accuracy and reduces the estimated annotation effort required to reach comparable detection performance by up to 50% compared to random sampling, where annotation effort is approximated using prediction-derived cost proxies. Full article

The integration of Artificial Intelligence (AI) into Internet of Things (IoT) medical devices has revolutionized arrhythmia monitoring. However, the high computational and power demands of traditional Deep Learning (DL) models pose significant challenges for long-term, battery-operated smart electronics. Spiking Neural Networks (SNNs), inspired by the biological efficiency of the human brain, offer a promising solution. This paper reviews the intersection of SNNs, low-power IoT hardware, and biomedical signal processing. I examine the transition from frame-based to event-driven processing, and discuss the hardware–software co-design necessary for next-generation cardiac wearables. Full article

LiDAR serves as the primary sensor for acquiring environmental information in intelligent driving systems. However, under adverse weather conditions, point cloud signals obtained by LiDAR suffer from intensity attenuation and noise interference, leading to a decline in segmentation accuracy. To address these issues, this paper designs a lightweight semantic segmentation system based on the Gated Visual State Space Model (VMamba), named RainMamba. Specifically, the system utilizes spherical projection to transform point clouds into 2D sequences and constructs a physical perception feature embedding module guided by the Beer–Lambert law to explicitly model and suppress spatial noise at the source. Subsequently, an uncertainty-weighted cross-modal correction module is employed to incorporate RGB images for dynamically calibrating the degraded point cloud data. Finally, a VMamba backbone is adopted to establish global dependencies with linear complexity. Experimental results on the SemanticKITTI dataset demonstrate that the system achieves an inference speed of 83 FPS, with a relative mIoU improvement of approximately 7.2% compared to the real-time baseline PolarNet. Furthermore, zero-shot evaluations on the real-world SemanticSTF dataset validate the system’s robust Sim-to-Real generalization capability. Notably, RainMamba delivers highly competitive accuracy comparable to the state-of-the-art heavy-weight model PTv3 while requiring a significantly lower parameter footprint, thereby demonstrating its immense potential for practical edge-computing deployment. Full article

Multi-label emotion detection (MLED) suffers from long-tailed label distributions and structured inter-label correlations, which jointly suppress rare label recall and yield incoherent predictions. We present Graph Neural Network-Enhanced Transformer with Hybrid Loss Weighting (GTHL-Emo), a unified framework that addresses both challenges without heavy additional machinery. First, an adaptive imbalance-aware training scheme combines binary cross-entropy, asymmetric focal, and pairwise ranking losses under a learned batch-wise controller, emphasizing rare labels while stabilizing thresholding. Second, a lightweight correlation alignment module learns transformer-based label embeddings and aligns their predicted affinities with empirical co-occurrence via Kullback–Leibler (KL) regularization, smoothing rare label predictions through correlated frequent labels. A transformer encoder with learnable attention pooling provides semantic representations, and a dynamic GraphSAGE layer captures inter-instance structural dependencies. Comprehensive evaluation across three Arabic benchmarks—SemEval-2018-Ec-Ar, ExaAEC, and SemEval-2025 (Track A, Arq)—demonstrates competitive or leading performance. On SemEval-2018-Ec-Ar, GTHL-Emo attained a Jaccard accuracy of 58.70%, micro-F1 score of 71.02%, and macro-F1 score of 60.48%. On ExaAEC, it achieved a Jaccard accuracy of 65.99%, micro-F1 score of 70.72%, and macro-F1 score of 68.71%. On SemEval-2025-Arq, it obtained a Jaccard accuracy of 41.47%, micro-F1 score of 56.78%, and macro-F1 score of 56.69%. Ablation studies revealed that the GraphSAGE structure and ranking loss contributed most significantly (1.45% and 1.46% Jaccard accuracy drops, respectively), while label correlation alignment provided consistent improvements across the scales. These findings demonstrate that jointly optimizing imbalance-aware objectives and label dependencies yields robust Arabic MLED with minimal overhead. Full article

Traffic incident impact prediction remains challenging for intelligent transportation systems due to complex spatiotemporal dependencies. This study analyzes 38,430 real-world traffic incidents from Istanbul (2022–2024) to predict normalized traffic deviation $\Delta Traffic(\%)$ using machine learning with rigorous temporal validation. Three models—Random Forest (RF), XGBoost, and LightGBM—were evaluated using rolling-origin cross-validation (2022 training, 2023 testing; 2022–2023 training, 2024 testing) to prevent temporal leakage, employing a strictly operational 13-feature set that excludes information unavailable at incident onset (t₀). LightGBM achieved MAE = 26.81 ± 1.94% and R² = 0.506 ± 0.042 (mean ± std across folds) with 95% bootstrap confidence intervals of [27.54%, 28.81%] for MAE on the 2024 test set, significantly outperforming historical baselines (R² = 0.100 ± 0.054, p < 0.001, Bonferroni-corrected). Feature ablation studies revealed that temporal features contribute 65.2% of predictive power, while incident type contributes only 1.3%. Distributional robustness analysis confirms conclusions are stable across distributional treatments (log, winsorised, quantile), with feature importance rank correlations ρ = 1.000 between all treatment pairs. This work provides empirical evidence for context-aware traffic management systems and demonstrates the importance of proper temporal validation in transportation forecasting. Full article

Whether a counterexample is genuine or spurious fundamentally influences the effectiveness and completeness of loop invariant inference, which is a core component of automated program verification. However, reliably determining the validity of a counterexample remains a challenging task. In this paper, we present a systematic evaluation of large language models (LLMs) on this problem. We construct a benchmark of program states that serve as counterexamples, categorized into three representative types: (i) pre-states of inductive counterexamples derived from LLM-proposed invariants and (ii–iii) boundary states derived from correct inductive invariants, where the states themselves either violate (ii) or satisfy (iii) the program’s precondition. Ground-truth labels are established using a state-of-the-art program verifier. We evaluate multiple LLMs under diverse prompting strategies. Our results show that LLMs perform well on the first two types of counterexamples in the benchmark but poorly on the third. Moreover, LLMs are substantially more accurate in classifying spurious counterexamples than genuine ones. These findings offer valuable guidance for future research on LLM-assisted loop invariant inference. Full article

Personal protective equipment (PPE) detection requires architectures balancing accuracy and computational efficiency for real-time safety monitoring. This study presents the first comprehensive benchmarking and systematic comparative evaluation of YOLO26 (released January 2026) against YOLOv11 across diverse PPE detection scenarios, with the primary goal of providing evidence-based deployment guidelines rather than proposing a new architecture. A total of 30 model configurations were evaluated across 5 model scales, 2 architectures, and 3 datasets under rigorously controlled conditions using identical hardware (NVIDIA A100-80GB), hyperparameters, and COCO-pretrained initialization across CHV (133 images, 6 classes), SHEL5K (1000 images, 3 classes), and SH17 (1620 images, 17 classes) datasets. Results reveal consistent scale-dependent patterns: YOLOv11 excels at nano and small scales across all datasets, while YOLO26 achieves superiority at large and X-Large scales with advantages ranging from 1.3 to 3.1 percent mAP50–95. An exploratory negative correlation ($r=-0.98$, $n=3$) between dataset size and YOLO26 performance advantage was observed; given the small number of data points, this should be interpreted as a preliminary finding warranting further investigation rather than a statistically robust relationship. YOLOv11 provides 15 to 20 percent faster training and 9 to 18 percent faster inference, while YOLO26 demonstrates superior parameter efficiency (0.0237 vs. 0.0233 mAP per million parameters). Findings provide evidence-based, conditional deployment guidance for industrial safety applications: YOLOv11 is recommended for latency-constrained edge scenarios at nano/small scales, while YOLO26 is preferred for accuracy-critical applications at large/X-Large scales with limited training data. These recommendations address key challenges in few-shot learning, small object detection, and data-scarce deployment regimes, and are intended as practical guidelines rather than claims of general architectural superiority. Full article

Multi-view clustering (MVC) is a fundamental unsupervised learning task for exploring latent structures from heterogeneous multi-view data. Existing MVC methods face critical challenges including the high computational cost of full-graph tensor models, neglect of high-order interactions between diversity and consistency information, and anchor misalignment across different views. In this paper, we propose an efficient anchor-guided MVC framework (EAG-DCT) via diversity–consistency learning and low-rank tensor recovery. The proposed method jointly learns consensus anchors, view-specific diversity graphs, and a global consistency graph in a unified model that integrates all graphs into a high-order tensor to capture rich cross-view correlations. By imposing a nonconvex low-rank constraint on the tensor, we effectively enhance the synergy between diversity and consistency learning. Our framework achieves high computational efficiency and scalability for large-scale data. Comprehensive experimental results on benchmark datasets validate that EAG-DCT outperforms state-of-the-art MVC methods in both clustering effectiveness and efficiency. Full article

The proliferation of Internet of Things (IoT) devices and embedded processors has recently spurred rapid advances in hardware-level security. This paper systematically reviews developments in securing microcontroller units (MCUs) and constrained embedded platforms from 2020 to 2026, a period marked by the finalization of NIST’s post-quantum cryptography standards and accelerated commercial deployment of hardware security primitives. Through analysis of the peer-reviewed literature, industry implementations, and standardization efforts, we survey five critical areas: post-quantum cryptography (PQC) implementations on resource-constrained hardware, physically unclonable functions (PUFs) for device authentication, hardware Roots of Trust and secure boot mechanisms, side-channel attack mitigations, and Trusted Execution Environments (TEEs) for microcontroller-class devices. For each domain, we analyze technical mechanisms, deployment constraints (power, memory, cost), security guarantees, and commercial maturity. Our review distinguishes itself through its integration perspective, examining how these primitives must be composed to secure real-world embedded systems, and its emphasis on post-standardization PQC developments. We highlight critical gaps including PQC memory overhead challenges, ML-resistant PUF designs, and TEE developer friction, while documenting commercial progress such as PSA Level 3 certified components and 500+ million PUF-enabled devices deployed. This synthesis provides practitioners with practical guidance for securing the next generation of IoT and embedded systems. Full article

Developed in 2023, the Modified Generalized Feistel Network (MGFN) is a block cipher that complies with Malaysia’s national cryptographic and cybersecurity policies. MGFN is a 64-bit block cipher with a 128-bit master key, specifically designed to deliver lightweight cybersecurity in resource-constrained Internet of Things (IoT) environments. In this paper, we analyze the security of the full-round MGFN against differential and linear cryptanalysis. We present concrete key recovery strategies for both attacks by employing multiple peeling-off steps. As a result, for the first time, we demonstrate a practical differential cryptanalysis of the full-round MGFN within a realistic time bound. In addition, we propose a practical linear cryptanalysis of the round-reduced MGFN. Our results provide the first practical security assessment of MGFN and offer concrete insights into its resistance against differential and linear cryptanalysis, thereby supporting the design and evaluation of lightweight block ciphers for IoT environments. Full article

Data in multi-tenant cloud environments is increasingly shared across organizations, making strong in-memory isolation a critical requirement. Existing confidential computing mechanisms such as AMD SEV provide hardware-enforced protection, but they require specialized processors and incur non-trivial performance overhead, which limits their deployment in heterogeneous clouds. This paper presents DASPRI, a software-based approach that constructs an isolated execution environment for trusted virtual machines by combining dual address spaces with privilege restriction. DASPRI partitions physical memory into a normal region and an isolated region on NUMA systems, and steers all memory allocations of trusted VMs into the isolated region by monitoring page faults and kernel allocation paths. It further hardens the isolated region by mediating direct and dynamic kernel mappings and by maintaining separate page caches for trusted and normal VMs. Remote attestation is integrated to protect the integrity of metadata used to identify trusted VMs. We implement DASPRI on a HUAWEI Kunpeng AArch64 server running OpenEuler and evaluate it using microbenchmarks and UnixBench. Experimental results show that DASPRI enforces strong memory isolation with less than 5% overhead on basic system operations and only 1.3% degradation in overall host performance. Full article