[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
You seem to have javascript disabled. Please note that many of the page functionalities won't work as expected without javascript enabled.
 
 
Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Article Types

Countries / Regions

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Search Results (4,876)

Search Parameters:
Keywords = edge-computing

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
12 pages, 251 KiB  
Article
On the Complexity of Computing a Maximum Acyclic Matching in Undirected Graphs
by Samer Nofal
Mathematics 2025, 13(5), 889; https://doi.org/10.3390/math13050889 (registering DOI) - 6 Mar 2025
Abstract
The problem of finding a maximum acyclic matching in a simple undirected graph is known to be NP-complete. In this paper, we present new results; we show that a maximum acyclic matching in a given undirected graph (with n vertices and m edges) [...] Read more.
The problem of finding a maximum acyclic matching in a simple undirected graph is known to be NP-complete. In this paper, we present new results; we show that a maximum acyclic matching in a given undirected graph (with n vertices and m edges) can be computed recursively with a recursion depth O(lnm) in expectation. Consequently, employing a recursive computation of a maximum acyclic matching in a given graph, if the recursion depth meets the expectation O(lnm), then a maximum acyclic matching can be computed in time O(n3.4) and space O(mlnm). However, for the general case, the complexity of the recursive computation of a maximum acyclic matching is in O(n22m) time and in O(m2) space. Full article
30 pages, 1417 KiB  
Article
A Comparative Analysis of Compression and Transfer Learning Techniques in DeepFake Detection Models
by Andreas Karathanasis, John Violos and Ioannis Kompatsiaris
Mathematics 2025, 13(5), 887; https://doi.org/10.3390/math13050887 - 6 Mar 2025
Abstract
DeepFake detection models play a crucial role in ambient intelligence and smart environments, where systems rely on authentic information for accurate decisions. These environments, integrating interconnected IoT devices and AI-driven systems, face significant threats from DeepFakes, potentially leading to compromised trust, erroneous decisions, [...] Read more.
DeepFake detection models play a crucial role in ambient intelligence and smart environments, where systems rely on authentic information for accurate decisions. These environments, integrating interconnected IoT devices and AI-driven systems, face significant threats from DeepFakes, potentially leading to compromised trust, erroneous decisions, and security breaches. To mitigate these risks, neural-network-based DeepFake detection models have been developed. However, their substantial computational requirements and long training times hinder deployment on resource-constrained edge devices. This paper investigates compression and transfer learning techniques to reduce the computational demands of training and deploying DeepFake detection models, while preserving performance. Pruning, knowledge distillation, quantization, and adapter modules are explored to enable efficient real-time DeepFake detection. An evaluation was conducted on four benchmark datasets: “SynthBuster”, “140k Real and Fake Faces”, “DeepFake and Real Images”, and “ForenSynths”. It compared compressed models with uncompressed baselines using widely recognized metrics such as accuracy, precision, recall, F1-score, model size, and training time. The results showed that a compressed model at 10% of the original size retained only 56% of the baseline accuracy, but fine-tuning in similar scenarios increased this to nearly 98%. In some cases, the accuracy even surpassed the original’s performance by up to 12%. These findings highlight the feasibility of deploying DeepFake detection models in edge computing scenarios. Full article
(This article belongs to the Special Issue Ambient Intelligence Methods and Applications)
41 pages, 603 KiB  
Review
Edge and Cloud Computing in Smart Cities
by Maria Trigka and Elias Dritsas
Future Internet 2025, 17(3), 118; https://doi.org/10.3390/fi17030118 - 6 Mar 2025
Abstract
The evolution of smart cities is intrinsically linked to advancements in computing paradigms that support real-time data processing, intelligent decision-making, and efficient resource utilization. Edge and cloud computing have emerged as fundamental pillars that enable scalable, distributed, and latency-aware services in urban environments. [...] Read more.
The evolution of smart cities is intrinsically linked to advancements in computing paradigms that support real-time data processing, intelligent decision-making, and efficient resource utilization. Edge and cloud computing have emerged as fundamental pillars that enable scalable, distributed, and latency-aware services in urban environments. Cloud computing provides extensive computational capabilities and centralized data storage, whereas edge computing ensures localized processing to mitigate network congestion and latency. This survey presents an in-depth analysis of the integration of edge and cloud computing in smart cities, highlighting architectural frameworks, enabling technologies, application domains, and key research challenges. The study examines resource allocation strategies, real-time analytics, and security considerations, emphasizing the synergies and trade-offs between cloud and edge computing paradigms. The present survey also notes future directions that address critical challenges, paving the way for sustainable and intelligent urban development. Full article
(This article belongs to the Special Issue IoT, Edge, and Cloud Computing in Smart Cities)
Show Figures

Figure 1

Figure 1
<p>An overview of surveyed key topics: edge and cloud computing in smart cities.</p>
Full article ">Figure 2
<p>Schematic representation of the three-tier architecture.</p>
Full article ">
21 pages, 11630 KiB  
Article
Assessment of the Maize Crop Water Stress Index (CWSI) Using Drone-Acquired Data Across Different Phenological Stages
by Mpho Kapari, Mbulisi Sibanda, James Magidi, Tafadzwanashe Mabhaudhi, Sylvester Mpandeli and Luxon Nhamo
Drones 2025, 9(3), 192; https://doi.org/10.3390/drones9030192 - 6 Mar 2025
Abstract
The temperature-based crop water stress index (CWSI) is the most robust metric among precise techniques that assess the severity of crop water stress, particularly in susceptible crops like maize. This study used a unmanned aerial vehicle (UAV) to remotely collect data, to use [...] Read more.
The temperature-based crop water stress index (CWSI) is the most robust metric among precise techniques that assess the severity of crop water stress, particularly in susceptible crops like maize. This study used a unmanned aerial vehicle (UAV) to remotely collect data, to use in combination with the random forest regression algorithm to detect the maize CWSI in smallholder croplands. This study sought to predict a foliar temperature-derived maize CWSI as a proxy for crop water stress using UAV-acquired spectral variables together with random forest regression throughout the vegetative and reproductive growth stages. The CWSI was derived after computing the non-water-stress baseline (NWSB) and non-transpiration baseline (NTB) using the field-measured canopy temperature, air temperature, and humidity data during the vegetative growth stages (V5, V10, and V14) and the reproductive growth stage (R1 stage). The results showed that the CWSI (CWSI < 0.3) could be estimated to an R2 of 0.86, RMSE of 0.12, and MAE of 0.10 for the 5th vegetative stage; an R2 of 0.85, RMSE of 0.03, and MAE of 0.02 for the 10th vegetative stage; an R2 of 0.85, RMSE of 0.05, and MAE of 0.04 for the 14th vegetative stage; and an R2 of 0.82, RMSE of 0.09, and MAE of 0.08 for the 1st reproductive stage. The Red, RedEdge, NIR, and TIR UAV-bands and their associated indices (CCCI, MTCI, GNDVI, NDRE, Red, TIR) were the most influential variables across all the growth stages. The vegetative V10 stage exhibited the most optimal prediction accuracies (RMSE = 0.03, MAE = 0.02), with the Red band being the most influential predictor variable. Unmanned aerial vehicles are essential for collecting data on the small and fragmented croplands predominant in southern Africa. The procedure facilitates determining crop water stress at different phenological stages to develop timeous response interventions, acting as an early warning system for crops. Full article
Show Figures

Figure 1

Figure 1
<p>Location of the Swayimane study area, study site, and smallholder maize field.</p>
Full article ">Figure 2
<p>Flowchart showing the data collection (blue), data preparation RF analysis (orange), and data analysis (green).</p>
Full article ">Figure 3
<p>(<b>a</b>) An automated in-field meteorological tower in the maize field, (<b>b</b>) meteorological tower-mounted infrared radiometers (IRRs), and (<b>c</b>) a CR1000 data logger, an Em50 datalogger, and a 12 V battery.</p>
Full article ">Figure 4
<p>(<b>a</b>) UAV system, DJI Matrice 300, (<b>b</b>) MicaSense Altum camera, (<b>c</b>) DJI M-300 flight plan, and (<b>d</b>) MicaSense Altum calibration reflectance panel.</p>
Full article ">Figure 5
<p>Non-water-stressed baselines used to calculate the CWSI for maize growth stages.</p>
Full article ">Figure 6
<p>The variation in the CWSI for maize over different DOYs in 2021.</p>
Full article ">Figure 7
<p>Linear relationships between the actual and predicted CWSI for maize crop’s vegetative stages (<b>ai</b>) V5, (<b>bi</b>) V10, and (<b>ci</b>) V14 and (<b>di</b>) reproductive stages (R1), as well as the corresponding variables’ importance (<b>ai</b>–<b>dii</b>).</p>
Full article ">Figure 8
<p>The maize CWSI over the smallholder field for vegetative stages (<b>a</b>–<b>c</b>) and reproductive stages (<b>d</b>).</p>
Full article ">
28 pages, 1026 KiB  
Article
Transitioning from TinyML to Edge GenAI: A Review
by Gloria Giorgetti and Danilo Pietro Pau
Big Data Cogn. Comput. 2025, 9(3), 61; https://doi.org/10.3390/bdcc9030061 - 6 Mar 2025
Abstract
Generative AI (GenAI) models are designed to produce realistic and natural data, such as images, audio, or written text. Due to their high computational and memory demands, these models traditionally run on powerful remote compute servers. However, there is growing interest in deploying [...] Read more.
Generative AI (GenAI) models are designed to produce realistic and natural data, such as images, audio, or written text. Due to their high computational and memory demands, these models traditionally run on powerful remote compute servers. However, there is growing interest in deploying GenAI models at the edge, on resource-constrained embedded devices. Since 2018, the TinyML community has proved that running fixed topology AI models on edge devices offers several benefits, including independence from internet connectivity, low-latency processing, and enhanced privacy. Nevertheless, deploying resource-consuming GenAI models on embedded devices is challenging since the latter have limited computational, memory, and energy resources. This review paper aims to evaluate the progresses made to date in the field of Edge GenAI, an emerging area of research within the broader domain of EdgeAI which focuses on bringing GenAI on edge devices. Papers released between 2022 and 2024 that address the design and deployment of GenAI models on embedded devices are identified and described. Additionally, their approaches and results are compared. This manuscript contributes to understand the ongoing transition from TinyML to Edge GenAI and provides valuable insights to the AI research community on this emerging, impactful, and quite under-explored field. Full article
Show Figures

Figure 1

Figure 1
<p>Statistics of the 66 collected papers. (<b>Left</b>) Percentage of papers by type of publication. (<b>Right</b>) Percentage of papers coming from each source.</p>
Full article ">Figure 2
<p>Comparison of the Fréchet Inception Distance (FID) score and the parameter count between cloud-based text-to-image models and the models proposed in the collected papers. FID scores are computed on the MS-COCO validation set and evaluate the visual fidelity of generated images against real ones. A lower FID score indicates better performance.</p>
Full article ">Figure 3
<p>Comparison of zero-shot performance on the HellaSwag commonsense reasoning task and the parameter count between LLMs and the SLMs proposed in the collected papers. Models with higher parameter counts achieve better performance.</p>
Full article ">Figure 4
<p>Number of revised and collected papers per year.</p>
Full article ">Figure 5
<p>Percentage of collected papers that investigate the deployment of the proposed models on each device type: smartphones and their application processors, Raspberry Pi, NVIDIA Jetson, microcontrollers, and others. Some papers explore deployment on multiple device types; therefore, the sum of the percentages exceeds 100%.</p>
Full article ">Figure 6
<p>Percentage of collected papers that deploy the proposed model on smartphone processors from each manufacturer.</p>
Full article ">Figure 7
<p>Distribution of collected papers by the tasks addressed.</p>
Full article ">
22 pages, 3751 KiB  
Article
Bio-Inspired Traffic Pattern Generation for Multi-AMR Systems
by Rok Vrabič, Andreja Malus, Jure Dvoršak, Gregor Klančar and Tena Žužek
Appl. Sci. 2025, 15(5), 2849; https://doi.org/10.3390/app15052849 - 6 Mar 2025
Abstract
In intralogistics, autonomous mobile robots (AMRs) operate without predefined paths, leading to complex traffic patterns and potential conflicts that impact system efficiency. This paper proposes a bio-inspired optimization method for autonomously generating spatial movement constraints for autonomous mobile robots (AMRs). Unlike traditional multi-agent [...] Read more.
In intralogistics, autonomous mobile robots (AMRs) operate without predefined paths, leading to complex traffic patterns and potential conflicts that impact system efficiency. This paper proposes a bio-inspired optimization method for autonomously generating spatial movement constraints for autonomous mobile robots (AMRs). Unlike traditional multi-agent pathfinding (MAPF) approaches, which focus on temporal coordination, our approach proactively reduces conflicts by adapting a weighted directed grid graph to improve traffic flow. This is achieved through four mechanisms inspired by ant colony systems: (1) a movement reward that decreases the weight of traversed edges, similar to pheromone deposition, (2) a delay penalty that increases edge weights along delayed paths, (3) a collision penalty that increases weights at conflict locations, and (4) an evaporation mechanism that prevents premature convergence to suboptimal solutions. Compared to the existing approaches, the proposed approach addresses the entire intralogistic problem, including plant layout, task distribution, release and dispatching algorithms, and fleet size. Its autonomous movement rule generation and low computational complexity make it well suited for dynamic intralogistic environments. Validated through physics-based simulations in Gazebo across three scenarios, a standard MAPF benchmark, and two industrial environments, the movement constraints generated using the proposed method improved the system throughput by up to 10% compared to unconstrained navigation and up to 4% compared to expert-designed solutions while reducing the need for conflict-resolution interventions. Full article
Show Figures

Figure 1

Figure 1
<p>Illustration of the bio-inspired mechanisms. (<b>a</b>) AMR movements and the corresponding weights after applying (<b>b</b>) movement rewards (pheromone deposition), (<b>c</b>) collision handling, (<b>d</b>) delay feedback, and (<b>e</b>) pheromone evaporation.</p>
Full article ">Figure 2
<p>Solutions to the test problem: (<b>a</b>) first solution and (<b>b</b>) second solution.</p>
Full article ">Figure 3
<p>The emergence of the resulting movement patterns.</p>
Full article ">Figure 4
<p>Additional test scenarios demonstrating the impact of different parameters on the emerging movement patterns: (<b>a</b>) solution with a single AMR, (<b>b</b>) solution without collision penalty, and (<b>c</b>) solution with additional tasks.</p>
Full article ">Figure 5
<p>Sensitivity analysis of key parameters by phase.</p>
Full article ">Figure 6
<p>Comparison of algorithm performance when Phase 1 is removed, means and standard deviations.</p>
Full article ">Figure 7
<p>The solution to the rooms’ layout, obtained through the presented algorithm.</p>
Full article ">Figure 8
<p>The (<b>a</b>) expert and (<b>b</b>) algorithmic solutions for industrial scenario A. Pickups in light, intermediate buffers in medium, and dropoffs in dark blue.</p>
Full article ">Figure 9
<p>The (<b>a</b>) expert and (<b>b</b>) algorithmic solutions for industrial scenario B.</p>
Full article ">Figure 10
<p>Analysis of punctuality for industrial scenarios: (<b>a</b>) scenario A and (<b>b</b>) scenario B.</p>
Full article ">Figure 11
<p>Simulation in ROS2/Gazebo: (<b>a</b>) 3D view of the rooms’ layout, (<b>b</b>) top-down view, and (<b>c</b>) RViZ view.</p>
Full article ">Figure 12
<p>Performance comparison across scenarios. Bars show tasks completed with and without recovery actions; whiskers indicate the standard deviation of total task completions.</p>
Full article ">
34 pages, 10596 KiB  
Article
Scalable Container-Based Time Synchronization for Smart Grid Data Center Networks
by Kennedy Chinedu Okafor, Wisdom Onyema Okafor, Omowunmi Mary Longe, Ikechukwu Ignatius Ayogu, Kelvin Anoh and Bamidele Adebisi
Technologies 2025, 13(3), 105; https://doi.org/10.3390/technologies13030105 - 5 Mar 2025
Viewed by 263
Abstract
The integration of edge-to-cloud infrastructures in smart grid (SG) data center networks requires scalable, efficient, and secure architecture. Traditional server-based SG data center architectures face high computational loads and delays. To address this problem, a lightweight data center network (DCN) with low-cost, and fast-converging [...] Read more.
The integration of edge-to-cloud infrastructures in smart grid (SG) data center networks requires scalable, efficient, and secure architecture. Traditional server-based SG data center architectures face high computational loads and delays. To address this problem, a lightweight data center network (DCN) with low-cost, and fast-converging optimization is required. This paper introduces a container-based time synchronization model (CTSM) within a spine–leaf virtual private cloud (SL-VPC), deployed via AWS CloudFormation stack as a practical use case. The CTSM optimizes resource utilization, security, and traffic management while reducing computational overhead. The model was benchmarked against five DCN topologies—DCell, Mesh, Skywalk, Dahu, and Ficonn—using Mininet simulations and a software-defined CloudFormation stack on an Amazon EC2 HPC testbed under realistic SG traffic patterns. The results show that CTSM achieved near-100% reliability, with the highest received energy data (29.87%), lowest packetization delay (13.11%), and highest traffic availability (70.85%). Stateless container engines improved resource allocation, reducing administrative overhead and enhancing grid stability. Software-defined Network (SDN)-driven adaptive routing and load balancing further optimized performance under dynamic demand conditions. These findings position CTSM-SL-VPC as a secure, scalable, and efficient solution for next-generation smart grid automation. Full article
Show Figures

Figure 1

Figure 1
<p>Residential units with layered SGDA with edge-to-cloud interfaces.</p>
Full article ">Figure 2
<p>Smart grid edge-to-cloud integration using CTSM multi-queue system for heterogenous fleet servers.</p>
Full article ">Figure 3
<p>(<b>a</b>,<b>b</b>): Implementation of the load management AMI hardware in SGDA.</p>
Full article ">Figure 4
<p>Proof-of-concept Advanced Metering Infrastructure (AMI) that employs full-duplex computational modeling of energy generation and distribution. This model utilizes exponential, gamma, Bernoulli, and binomial distributions to simulate GENCO lifespan, aggregated energy output, and smart meter reading accuracy for dynamic load management in the cloud. The SG system comprises key components such as smart load control switching modules, voltage and current sensors, and IoT RF communication modules, which monitor and manage electrical parameters while facilitating real-time data exchange. Enclosed edge aggregation boxes with both disabled and active load points organize and control distributed energy resources. Data acquisition mobile devices gather operational data, and high-frequency display modules provide energy readings and system status updates, enabling informed decision-making and effective grid management.</p>
Full article ">Figure 5
<p>Computation of neural controller architecture for SG architecture.</p>
Full article ">Figure 6
<p>Mean square error plot for SG edge neural network model.</p>
Full article ">Figure 7
<p>Simulated SGDA implementation. The edge-to-cloud AMI experiments were conducted on an EC2 HPC testbed featuring Intel Xeon Gold 6132 CPUs, NVIDIA GeForce GTX 1080Ti GPUs, and 192GB of RAM. We used Python 3.7.4 and PyTorch 1.1.0 to implement the CTSM modules on the EC2 HPC infrastructure. A Cisco Nexus 7700 core switch with 18 slots managed network connectivity, supporting up to 768 × 1 and 10 Gigabit Ethernet ports, 384 × 40 Gigabit Ethernet ports, and 192 × 100 Gigabit Ethernet ports, which efficiently handled the SG workloads and automation processes.</p>
Full article ">Figure 8
<p>SGDA energy data received response.</p>
Full article ">Figure 9
<p>SGDA service delay response.</p>
Full article ">Figure 10
<p>SGDA media access delay response.</p>
Full article ">Figure 11
<p>SGDA service throughput response.</p>
Full article ">Figure 12
<p>SGDA traffic availability response.</p>
Full article ">Figure 13
<p>SGDA security overhead response.</p>
Full article ">
20 pages, 468 KiB  
Article
Toward 6G: Latency-Optimized MEC Systems with UAV and RIS Integration
by Abdullah Alshahrani
Mathematics 2025, 13(5), 871; https://doi.org/10.3390/math13050871 - 5 Mar 2025
Viewed by 132
Abstract
Multi-access edge computing (MEC) has emerged as a cornerstone technology for deploying 6G network services, offering efficient computation and ultra-low-latency communication. The integration of unmanned aerial vehicles (UAVs) and reconfigurable intelligent surfaces (RISs) further enhances wireless propagation, capacity, and coverage, presenting a transformative [...] Read more.
Multi-access edge computing (MEC) has emerged as a cornerstone technology for deploying 6G network services, offering efficient computation and ultra-low-latency communication. The integration of unmanned aerial vehicles (UAVs) and reconfigurable intelligent surfaces (RISs) further enhances wireless propagation, capacity, and coverage, presenting a transformative paradigm for next-generation networks. This paper addresses the critical challenge of task offloading and resource allocation in an MEC-based system, where a massive MIMO base station, serving multiple macro-cells, hosts the MEC server with support from a UAV-equipped RIS. We propose an optimization framework to minimize task execution latency for user equipment (UE) by jointly optimizing task offloading and communication resource allocation within this UAV-assisted, RIS-aided network. By modeling this problem as a Markov decision process (MDP) with a discrete-continuous hybrid action space, we develop a deep reinforcement learning (DRL) algorithm leveraging a hybrid space representation to solve it effectively. Extensive simulations validate the superiority of the proposed method, demonstrating significant latency reductions compared to state-of-the-art approaches, thereby advancing the feasibility of MEC in 6G networks. Full article
Show Figures

Figure 1

Figure 1
<p>Framework of the proposed algorithm.</p>
Full article ">Figure 2
<p>Average rewards vs. no. of episodes.</p>
Full article ">Figure 3
<p>The total time delay according to different schemes vs. <math display="inline"><semantics> <mi mathvariant="script">F</mi> </semantics></math>m,k, with <span class="html-italic">K</span> = 100 and <math display="inline"><semantics> <msub> <mi>ζ</mi> <mrow> <mi>m</mi> <mi>a</mi> <mi>x</mi> </mrow> </msub> </semantics></math> = 30 Giga cycles/s.</p>
Full article ">Figure 4
<p>The total time delay according to different schemes vs. <math display="inline"><semantics> <msub> <mi>ζ</mi> <mrow> <mi>m</mi> <mi>a</mi> <mi>x</mi> </mrow> </msub> </semantics></math>, with <span class="html-italic">K</span> = 100 and <math display="inline"><semantics> <msub> <mi>F</mi> <mrow> <mi>m</mi> <mo>,</mo> <mi>k</mi> </mrow> </msub> </semantics></math> = 600 cycles/bit.</p>
Full article ">Figure 5
<p>The total time delay vs. no. of UEs.</p>
Full article ">Figure 6
<p>Task completion ratio vs. no. of UEs.</p>
Full article ">
14 pages, 6384 KiB  
Article
Parallel CUDA-Based Optimization of the Intersection Calculation Process in the Greiner–Hormann Algorithm
by Jiwei Zuo, Junfu Fan, Kuan Li, Qingyun Liu, Yuke Zhou and Yi Zhang
Algorithms 2025, 18(3), 147; https://doi.org/10.3390/a18030147 - 5 Mar 2025
Viewed by 54
Abstract
The Greiner–Hormann algorithm is a commonly used polygon overlay analysis algorithm. It uses a double-linked list structure to store vertex data, and its intersection calculation step has a significant effect on the overall operating efficiency of the algorithm. To address the time-consuming intersection [...] Read more.
The Greiner–Hormann algorithm is a commonly used polygon overlay analysis algorithm. It uses a double-linked list structure to store vertex data, and its intersection calculation step has a significant effect on the overall operating efficiency of the algorithm. To address the time-consuming intersection calculation process in the Greiner–Hormann algorithm, this paper presents two kernel functions that implement a GPU parallel improvement algorithm based on CUDA multi-threading. This method allocates a thread to each edge of the subject polygon, determines in parallel whether it intersects with each edge of the clipping polygon, transfers the number of intersection points back to the CPU for calculation, and opens up corresponding storage space on the GPU side on the basis of the total number of intersection points; then, information such as intersection coordinates is calculated in parallel. In addition, experiments are conducted on the data of eight polygons with different complexities, and the optimal thread mode, running time, and speedup ratio of the parallel algorithm are statistically analyzed. The experimental results show that when a single CUDA thread block contains 64 threads or 128 threads, the parallel transformation step of the Greiner–Hormann algorithm has the highest computational efficiency. When the complexity of the subject polygon exceeds 53,000, the parallel improvement algorithm can obtain a speedup ratio of approximately three times that of the serial algorithm. This shows that the design method in this paper can effectively improve the operating efficiency of the polygon overlay analysis algorithm in the current large-scale data context. Full article
(This article belongs to the Collection Parallel and Distributed Computing: Algorithms and Applications)
Show Figures

Figure 1

Figure 1
<p>Experimental data. (<b>a</b>) Chinese land use patch data. (<b>b</b>) Clipping polygon. (<b>c</b>) Subject polygon.</p>
Full article ">Figure 2
<p>Greiner–Hormann algorithm.</p>
Full article ">Figure 3
<p>Greiner–Hormann algorithm time consumption statistics.</p>
Full article ">Figure 4
<p>GPU parallel optimization of the Greiner–Hormann algorithm.</p>
Full article ">Figure 5
<p>Runtime of the Greiner–Hormann algorithm in different thread modes with different datasets.</p>
Full article ">Figure 6
<p>Parallel algorithm acceleration analysis for different datasets.</p>
Full article ">
25 pages, 8084 KiB  
Article
Efficient Optimization Method of the Meshed Return Plane Through Fusion of Convolutional Neural Network and Improved Particle Swarm Optimization
by Jingling Mei, Haiyue Yuan, Xiuqin Chu and Lei Ding
Electronics 2025, 14(5), 1035; https://doi.org/10.3390/electronics14051035 - 5 Mar 2025
Viewed by 226
Abstract
Reducing distortion of spectral simulation signals in infrared detection systems is essential to improve the precision of detecting fine spectra in space-based carbon monitoring satellites. The rigid-flex printed circuit board (PCB), a vital interconnection structure between detectors and signal conditioning circuits, exhibits signal [...] Read more.
Reducing distortion of spectral simulation signals in infrared detection systems is essential to improve the precision of detecting fine spectra in space-based carbon monitoring satellites. The rigid-flex printed circuit board (PCB), a vital interconnection structure between detectors and signal conditioning circuits, exhibits signal quality variations due to impedance fluctuations and parasitic capacitance changes induced by its meshed return plane geometry. This periodically varying structure necessitates full-wave field solutions to include longitudinal discontinuity. Although full-wave simulations provide accurate characterization, they demand substantial computational resources and time. To address these challenges, we propose an innovative approach to effectively determine optimal meshed return plane designs across various transmission rates. The method integrates a convolutional neural network (CNN) with improved particle swarm optimization (IPSO). First, a CNN model is employed efficiently to predict scattering parameters (S-parameters) for different design configurations, thereby overcoming the inefficiencies associated with iterative full-wave simulation optimization. Then, an IPSO algorithm has been implemented to address the optimization challenge of crosstalk and inter-symbol interference (ISI) in signal transmission. Furthermore, to increase the optimization speed and evaluate the system performance under extreme conditions, we propose a fitness function construction method based on double-edge responses (DER) to rapidly generate a worst-case peak distortion analysis (PDA) eye diagram within the IPSO algorithm. The proposed methodology reduces computational complexity by two orders of magnitude relative to the full-wave simulation. Quantitative analysis conducted at a transmission rate of 5 Gbps demonstrates substantial signal quality improvements compared to empirical PCB design: the eye height increased by 49.7%, and the eye width expanded by 35.7%. The effectiveness of these improvements has been verified through commercial simulation software, proving that the method can provide design support for infrared detection systems. Full article
Show Figures

Figure 1

Figure 1
<p>Signal processing chain of the atmospheric infrared detection system.</p>
Full article ">Figure 2
<p>Two types of meshed ground planes and line widths, spacings, and angles of the reference ground plane coppers. (<b>a</b>) A 45° uniform oblique grid. (<b>b</b>) Vertical crossed grid.</p>
Full article ">Figure 3
<p>Configuration specifications of transmission lines. (<b>a</b>) Topology of Line A and Line B on a rigid–flex PCB. (<b>b</b>) Port number configuration for Line A and Line B.</p>
Full article ">Figure 4
<p>S–parameter magnitudes for 480 different sets of grid parameters. (<b>a</b>) S<sub>11</sub>. (<b>b</b>) S<sub>31</sub>. (<b>c</b>) S<sub>12</sub>.</p>
Full article ">Figure 5
<p>CNN model architecture.</p>
Full article ">Figure 6
<p>Comparison curves of the output S–parameters among different ANN methods. (<b>a</b>) Real part predictions of S<sub>11</sub>. (<b>b</b>) Imaginary part predictions of S<sub>11</sub>. (<b>c</b>) Real part predictions of S<sub>12</sub>. (<b>d</b>) Imaginary part predictions of S<sub>12</sub>. (<b>e</b>) Real part predictions of S<sub>31</sub>. (<b>f</b>) Imaginary part predictions of S<sub>31</sub>.</p>
Full article ">Figure 6 Cont.
<p>Comparison curves of the output S–parameters among different ANN methods. (<b>a</b>) Real part predictions of S<sub>11</sub>. (<b>b</b>) Imaginary part predictions of S<sub>11</sub>. (<b>c</b>) Real part predictions of S<sub>12</sub>. (<b>d</b>) Imaginary part predictions of S<sub>12</sub>. (<b>e</b>) Real part predictions of S<sub>31</sub>. (<b>f</b>) Imaginary part predictions of S<sub>31</sub>.</p>
Full article ">Figure 7
<p>The CNN−based framework for IPSO algorithms.</p>
Full article ">Figure 8
<p>The worst–case eye diagram.</p>
Full article ">Figure 9
<p>Construction of the system response using the DER method.</p>
Full article ">Figure 10
<p>The calculation process for constructing the worst-case eye diagram.</p>
Full article ">Figure 11
<p>The worst−case eye diagram including crosstalk peaks.</p>
Full article ">Figure 12
<p>Comparison of eye height and width for different fitness values.</p>
Full article ">Figure 13
<p>The variation in inertia weight with iteration times.</p>
Full article ">Figure 14
<p>Comparison of fitness iteration curves for different population sizes.</p>
Full article ">Figure 15
<p>Comparison of fitness iteration curves based on IPSO and standard PSO algorithms.</p>
Full article ">Figure 16
<p>Comparative analysis of worst−case eye diagrams for different design combinations across three transmission rates: (<b>a</b>) 1 Gbps, (<b>b</b>) 2.5 Gbps, and (<b>c</b>) 5 Gbps.</p>
Full article ">Figure 17
<p>Eye diagram obtained from ADS simulation under: (<b>a</b>) C<sub>5 Gbps</sub> and (<b>b</b>) D<sub>Experience</sub>.</p>
Full article ">
22 pages, 6298 KiB  
Article
BGLE-YOLO: A Lightweight Model for Underwater Bio-Detection
by Hua Zhao, Chao Xu, Jiaxing Chen, Zhexian Zhang and Xiang Wang
Sensors 2025, 25(5), 1595; https://doi.org/10.3390/s25051595 - 5 Mar 2025
Viewed by 81
Abstract
Due to low contrast, chromatic aberration, and generally small objects in underwater environments, a new underwater fish detection model, BGLE-YOLO, is proposed to investigate automated methods dedicated to accurately detecting underwater objects in images. The model has small parameters and low computational effort [...] Read more.
Due to low contrast, chromatic aberration, and generally small objects in underwater environments, a new underwater fish detection model, BGLE-YOLO, is proposed to investigate automated methods dedicated to accurately detecting underwater objects in images. The model has small parameters and low computational effort and is suitable for edge devices. First, an efficient multi-scale convolutional EMC module is introduced to enhance the backbone network and capture the dynamic changes in targets in the underwater environment. Secondly, a global and local feature fusion module for small targets (BIG) is integrated into the neck network to preserve more feature information, reduce error information in higher-level features, and increase the model’s effectiveness in detecting small targets. Finally, to prevent the detection accuracy impact due to excessive lightweighting, the lightweight shared head (LSH) is constructed. The reparameterization technique further improves detection accuracy without additional parameters and computational cost. Experimental results of BGLE-YOLO on the underwater datasets DUO (Detection Underwater Objects) and RUOD (Real-World Underwater Object Detection) show that the model achieves the same accuracy as the benchmark model with an ultra-low computational cost of 6.2 GFLOPs and an ultra-low model parameter of 1.6 MB. Full article
Show Figures

Figure 1

Figure 1
<p>Images (<b>a</b>,<b>b</b>) describe underwater image features marked by low contrast and small targets, respectively, and (<b>c</b>,<b>d</b>) describe underwater image features marked by underwater blurring and color deviations due to various attenuations, respectively.</p>
Full article ">Figure 2
<p>(<b>a</b>) The diagram illustrates the architecture of YOLOv8. (<b>b</b>) The diagram depicts the architecture of BGLE-YOLO. Compared to (<b>a</b>), (<b>b</b>) adds BiFPN network, GLSA attention block, EMC convolution, and LSH detection header to (<b>a</b>).</p>
Full article ">Figure 3
<p>The structures of EMC are presented. The input feature map is channelized and then fused into an output feature map by independent multi-channel features.</p>
Full article ">Figure 4
<p>The structures of FPN, PANet, NAS-FPN, and BiFPN.</p>
Full article ">Figure 5
<p>Introduction to the Global-to-Local Spatial Aggregation (GLSA) module.</p>
Full article ">Figure 6
<p>Convolution in LSH consists of the group normalized GN convolution and the group normalized detail-enhanced convolution DEConv. The red pixels are normalized using the same mean and variance, which are calculated by combining the values of these pixels.</p>
Full article ">Figure 7
<p>Comparison plots of the YOLO family of algorithms on the DUO dataset. (<b>a</b>) Accuracy comparison plot; (<b>b</b>) mAP@0.5 comparison plot; (<b>c</b>) mAP@0.5:0.95 comparison plot.</p>
Full article ">Figure 8
<p>Comparison plots of the YOLO family of algorithms on the RUOD dataset. (<b>a</b>) Accuracy comparison plot; (<b>b</b>) mAP@0.5 comparison plot; (<b>c</b>) mAP@0.5:0.95 comparison plot.</p>
Full article ">Figure 9
<p>Comparison of parameters as well as computational effort of different models.</p>
Full article ">Figure 10
<p>Qualitative comparison of the detection performance of the YOLO series of models, (<b>a</b>–<b>c</b>) showing the detection results for four categories in the DUO dataset.</p>
Full article ">Figure 11
<p>Qualitative comparison of the detection performance of the YOLO series of models, (<b>a</b>–<b>c</b>) showing the detection results for four categories in the RUOD dataset.</p>
Full article ">
21 pages, 1297 KiB  
Article
Assessing the Constraints to and Drivers for the Adoption and Diffusion of Smart XG, Last-Mile Connectivity and Edge Computing Solutions in Agriculture: The Case of Digital Shepherds in Flanders, Belgium
by Max López-Maciel, Peter Roebeling, Katrine Soma and Jeremie Haumont
Land 2025, 14(3), 543; https://doi.org/10.3390/land14030543 (registering DOI) - 5 Mar 2025
Viewed by 160
Abstract
Advanced generations of mobile network technologies (XG), last-mile connectivity and edge computing solutions can offer invaluable support for farmers and agribusinesses, fostering sustainable development, though unequal access to these digital technologies may lead to a digital divide. It remains, however, unclear to what [...] Read more.
Advanced generations of mobile network technologies (XG), last-mile connectivity and edge computing solutions can offer invaluable support for farmers and agribusinesses, fostering sustainable development, though unequal access to these digital technologies may lead to a digital divide. It remains, however, unclear to what extent and why farmers are (not) ready to adopt digital technology solutions in agricultural production systems. Hence, this study identifies and assesses the constraints on and drivers for the adoption and diffusion of smart XG, last-mile connectivity and edge computing solutions in agricultural production systems, using the Adoption and Diffusion Outcome Prediction Tool (ADOPT) in a stakeholder workshop setting. Results for the case of the ‘digital shepherd’ in Flanders (Belgium) show that there is substantial potential for its adoption (~40% of the target population) and diffusion (~15 years to peak adoption). To motivate farmers to adopt the ‘digital shepherd’, its profitability, environmental benefits and management convenience are pivotal; to accelerate adoption of the ‘digital shepherd’, its trialability and evaluability, as well as farmers’ skills and knowledge, are pivotal. Addressing these factors can significantly reduce the risk of a digital divide and, hence, allow policy makers to define corresponding strategies. Full article
Show Figures

Graphical abstract

Graphical abstract
Full article ">Figure 1
<p>ADOPT quadrants, their relationships to the 22 questions and their influences on Peak Adoption Level and Time to Peak Adoption (source: Reprinted with permission from [<a href="#B29-land-14-00543" class="html-bibr">29</a>]; adapted from [<a href="#B25-land-14-00543" class="html-bibr">25</a>]).</p>
Full article ">Figure 2
<p>Adoption level curve from ADOPT for original (blue) and single step-up (green) and step-down (red) for the most sensitive question (question 16).</p>
Full article ">Figure 3
<p>Sensitivity analysis for Peak Adoption Level of single step-up (green) and step-down (red) changes for all questions (Image generated by ADOPT_v2.1).</p>
Full article ">Figure 4
<p>Sensitivity analysis for Time to Peak Adoption Level of single step-up (green) and step-down (red) changes for all questions (Image generated by ADOPT_v2.1).</p>
Full article ">
25 pages, 3152 KiB  
Review
Thermal and Photochemical Reactions of Organosilicon Compounds
by Masae Takahashi
Molecules 2025, 30(5), 1158; https://doi.org/10.3390/molecules30051158 - 4 Mar 2025
Viewed by 129
Abstract
This article provides a comprehensive review of quantum chemical computational studies on the thermal and photochemical reactions of organosilicon compounds, based on fundamental concepts such as initial complex formation, HOMO-LUMO interactions, and subjacent orbital interactions. Despite silicon’s position in group 14 of the [...] Read more.
This article provides a comprehensive review of quantum chemical computational studies on the thermal and photochemical reactions of organosilicon compounds, based on fundamental concepts such as initial complex formation, HOMO-LUMO interactions, and subjacent orbital interactions. Despite silicon’s position in group 14 of the periodic table, alongside carbon, its reactivity patterns exhibit significant deviations from those of carbon. This review delves into the reactivity behaviors of organosilicon compounds, particularly focusing on the highly coordinated nature of silicon. It is poised to serve as a valuable resource for chemists, offering insights into cutting-edge research and fostering further innovations in synthetic chemistry and also theoretical chemistry. Full article
(This article belongs to the Special Issue Quantum Chemical Calculations of Molecular Reaction Processes)
Show Figures

Figure 1

Figure 1
<p>1,2-Addition reaction of molecule XY to doubly bonded compound RHM1=M2H<sub>2</sub>, resulting in two regioselective products RHXM1–M2YH<sub>2</sub> and RHYM1–M2XH<sub>2</sub> via pathways 1 and 2, respectively. For water addition to disilene, X, Y, M1, and M2 are H, OH, Si, and Si, respectively.</p>
Full article ">Figure 2
<p>HOMO–LUMO interaction between molecule XY and doubly bonded compound RHM1=M2H<sub>2</sub>.</p>
Full article ">Figure 3
<p>Energy diagram for the water-addition reaction to disilene. C<sub>L</sub>, TS<sub>L</sub>, and P<sub>A</sub> are the same as C’<sub>L</sub>, TS’<sub>L</sub>, and P<sub>S</sub>, respectively, in the water-addition reaction to disilene, as the two silicon atoms in disilene are not distinguished.</p>
Full article ">Figure 4
<p>Generalized mechanism for nucleophilic addition of ammonia to disilene.</p>
Full article ">Figure 5
<p>1,3-Silyl migration of allylsilanes with symmetry-allowed suprafacial inversion of configuration at the migrating silicon.</p>
Full article ">Figure 6
<p>The trigonal bipyramidal (TBP) and square pyramidal (SP) transition structures in 1,3-sigmatropic silyl migration of allylsilanes.</p>
Full article ">Figure 7
<p>Interaction diagram of frontier orbitals in TBP and SP transition structures for 1,3-silyl migration of allylsilanes. The frontier orbitals of the silyl and allyl radicals interacting in the transition structures are constructed by the three π orbitals (<span class="html-italic">ϕ</span><sub>1</sub>, <span class="html-italic">ϕ</span><sub>2</sub>, and <span class="html-italic">ϕ</span><sub>3</sub>) of the allyl radical and the three 3p orbitals (<span class="html-italic">θ</span><sub>1</sub>, <span class="html-italic">θ</span><sub>2</sub>, and <span class="html-italic">θ</span><sub>3</sub>) or (<span class="html-italic">θ</span>’<sub>1</sub>, <span class="html-italic">θ</span>’<sub>2</sub>, and <span class="html-italic">θ</span>’<sub>3</sub>) of the silyl radical. The symmetry notations S (symmetric) and A (antisymmetric) refer to the planes that bisect the ally CCC plane.</p>
Full article ">Figure 8
<p>Photochemical reactions of cyclopropenylidene (<b>1</b>) and silacyclopropenylidene (<b>3</b>).</p>
Full article ">Figure 9
<p>A characteristic conical intersection (CI) structure common to photochemical sigmatropic shifts reported as a ubiquitous control element [<a href="#B194-molecules-30-01158" class="html-bibr">194</a>].</p>
Full article ">
23 pages, 10794 KiB  
Article
Hand–Eye Separation-Based First-Frame Positioning and Follower Tracking Method for Perforating Robotic Arm
by Handuo Zhang, Jun Guo, Chunyan Xu and Bin Zhang
Appl. Sci. 2025, 15(5), 2769; https://doi.org/10.3390/app15052769 - 4 Mar 2025
Viewed by 221
Abstract
In subway tunnel construction, current hand–eye integrated drilling robots use a camera mounted on the drilling arm for image acquisition. However, dust interference and long-distance operation cause a decline in image quality, affecting the stability and accuracy of the visual recognition system. Additionally, [...] Read more.
In subway tunnel construction, current hand–eye integrated drilling robots use a camera mounted on the drilling arm for image acquisition. However, dust interference and long-distance operation cause a decline in image quality, affecting the stability and accuracy of the visual recognition system. Additionally, the computational complexity of high-precision detection models limits deployment on resource-constrained edge devices, such as industrial controllers. To address these challenges, this paper proposes a dual-arm tunnel drilling robot system with hand–eye separation, utilizing the first-frame localization and follower tracking method. The vision arm (“eye”) provides real-time position data to the drilling arm (“hand”), ensuring accurate and efficient operation. The study employs an RFBNet model for initial frame localization, replacing the original VGG16 backbone with ShuffleNet V2. This reduces model parameters by 30% (135.5 MB vs. 146.3 MB) through channel splitting and depthwise separable convolutions to reduce computational complexity. Additionally, the GIoU loss function is introduced to replace the traditional IoU, further optimizing bounding box regression through the calculation of the minimum enclosing box. This resolves the gradient vanishing problem in traditional IoU and improves average precision (AP) by 3.3% (from 0.91 to 0.94). For continuous tracking, a SiamRPN-based algorithm combined with Kalman filtering and PID control ensures robustness against occlusions and nonlinear disturbances, increasing the success rate by 1.6% (0.639 vs. 0.629). Experimental results show that this approach significantly improves tracking accuracy and operational stability, achieving 31 FPS inference speed on edge devices and providing a deployable solution for tunnel construction’s safety and efficiency needs. Full article
Show Figures

Figure 1

Figure 1
<p>Hand–eye separation schematic.</p>
Full article ">Figure 2
<p>Network structure of initial frame positioning model based on improved RFBNet. Schemes follow the same formatting.</p>
Full article ">Figure 3
<p>ShuffleNet V2 block.</p>
Full article ">Figure 4
<p>Comparison of tracking results of the proposed method with the baseline algorithm and the classical algorithm.</p>
Full article ">Figure 5
<p>Tracking and positioning process diagram of drilling robot arm based on SiamRPN.</p>
Full article ">Figure 6
<p>PID control system block diagram.</p>
Full article ">Figure 7
<p>Comparison of initial frame positioning model effect of improved RFBNet.</p>
Full article ">Figure 8
<p>Comparison of success rate and accuracy rate between proposed algorithm and baseline algorithm.</p>
Full article ">Figure 9
<p>Comparison of success rate and accuracy rate between proposed algorithm and classical algorithm.</p>
Full article ">Figure 10
<p>Comparison of accuracy rates between the proposed method and the classical algorithm. Figures are arranged in three columns per row.</p>
Full article ">Figure 11
<p>Comparison of accuracy rates between the proposed method and the classical algorithm. Figures are arranged in three columns per row.</p>
Full article ">Figure 12
<p>Comparison of tracking results of the proposed method with the baseline algorithm and the classical algorithm.</p>
Full article ">
19 pages, 6430 KiB  
Article
Improving Road Safety with AI: Automated Detection of Signs and Surface Damage
by Davide Merolla, Vittorio Latorre, Antonio Salis and Gianluca Boanelli
Computers 2025, 14(3), 91; https://doi.org/10.3390/computers14030091 - 4 Mar 2025
Viewed by 193
Abstract
Public transportation plays a crucial role in our lives, and the road network is a vital component in the implementation of smart cities. Recent advancements in AI have enabled the development of advanced monitoring systems capable of detecting anomalies in road surfaces and [...] Read more.
Public transportation plays a crucial role in our lives, and the road network is a vital component in the implementation of smart cities. Recent advancements in AI have enabled the development of advanced monitoring systems capable of detecting anomalies in road surfaces and road signs, which can lead to serious accidents. This paper presents an innovative approach to enhance road safety through the detection and classification of traffic signs and road surface damage using advanced deep learning techniques (CNN), achieving over 90% precision and accuracy in both detection and classification of traffic signs and road surface damage. This integrated approach supports proactive maintenance strategies, improving road safety and resource allocation for the Molise region and the city of Campobasso. The resulting system, developed as part of the CTE Molise research project funded by the Italian Minister of Economic Growth (MIMIT), leverages cutting-edge technologies such as cloud computing and High-Performance Computing with GPU utilization. It serves as a valuable tool for municipalities, for the quick detection of anomalies and the prompt organization of maintenance operations. Full article
(This article belongs to the Special Issue AI in Its Ecosystem)
Show Figures

Figure 1

Figure 1
<p>Experimental workflow. The diagram shows how images flow from collection through dataset expansion, data augmentation, and detection/classification.</p>
Full article ">Figure 2
<p>YOLOv8 architecture.</p>
Full article ">Figure 3
<p>Road damage detection.</p>
Full article ">Figure 4
<p>Traffic sign detection.</p>
Full article ">Figure 5
<p>YOLOv8x accuracy.</p>
Full article ">Figure 6
<p>YOLOv8x box loss.</p>
Full article ">Figure 7
<p>YOLOv8x object loss.</p>
Full article ">Figure 8
<p>YOLOv8s accuracy.</p>
Full article ">Figure 9
<p>YOLOv8s box loss.</p>
Full article ">Figure 10
<p>YOLOv8s object loss.</p>
Full article ">Figure 11
<p>CNN training and validation metrics.</p>
Full article ">Figure 12
<p>Dashboard showing georeferenced layers of road and traffic sign anomalies in the urban area of Campobasso, as explained by warning symbols.</p>
Full article ">
Back to TopTop