Global sustainability initiatives increasingly rely on innovative technologies to safeguard biodiversity and mitigate environmental impacts. In this paper, we present EcoWatch, a novel framework that leverages Wireless Multimedia Sensor Networks (WMSNs) using LoRaWAN technology for efficient data transmission to enable real-time bird species detection and counting in their natural habitat. EcoWatch combines YOLOv8 You Only Look Once for object detection and Learning to Count Everything (LTCE) for precise object counting at the base station. To address the inherent limitations of WSNs in terms of energy and bandwidth, EcoWatch incorporates a multi-level ROI-based video compression technique. Extensive evaluation demonstrates that EcoWatch significantly reduces energy consumption (up to 58.7%) and data transmission load (by 69.8%) compared to other methods while maintaining acceptable image quality, detection and counting accuracy. Notably, EcoWatch exhibits robust performance across seasons and adapts well to varying environmental conditions, making it a promising solution for real-world ecological monitoring applications.

Global sustainability initiatives increasingly rely on innovative technologies to safeguard biodiversity and mitigate environmental impacts. In this paper, we present EcoWatch, a novel framework that leverages Wireless Multimedia Sensor Networks (WMSNs) using LoRaWAN technology for efficient data transmission to enable real-time bird species detection and counting in their natural habitat. EcoWatch combines YOLOv8 You Only Look Once for object detection and Learning to Count Everything (LTCE) for precise object counting at the base station. To address the inherent limitations of WSNs in terms of energy and bandwidth, EcoWatch incorporates a multi-level ROI-based video compression technique. Extensive evaluation demonstrates that EcoWatch significantly reduces energy consumption (up to 58.7%) and data transmission load (by 69.8%) compared to other methods while maintaining acceptable image quality, detection and counting accuracy. Notably, EcoWatch exhibits robust performance across seasons and adapts well to varying environmental conditions, making it a promising solution for real-world ecological monitoring applications.

This paper presents a novel metaheuristic binary crow search algorithm (CSA) designed for positive-unlabeled (PU) learning, a paradigm where only positive and unlabeled data are available, with applications in many diversified fields, such as medical diagnosis and fraud detection. The algorithm represent a useful adaptation of CSA, itself inspired by the food-hiding behavior of crows. The proposed BiCSA-PUL (binary crow search algorithm for positive-unlabeled learning) selects reliable negative samples from unlabeled data using binary vectors, and updates positions employing Hamming distance, guided by a modified F1-score, as fitness function. The algorithm was tested on 30 samples from 10 diverse datasets, outperforming seven state-of-the-art PU learning methods. The results reveal that BiCSA-PUL provides a robust and efficient approach for PU learning, significantly improving fitness and reliability. This work opens new avenues for applying metaheuristic optimization methods to challenging classification problems with limited labeled data. The main limitations are the potentially time-intensive process of parameters tuning and reliance on initial sampling.

This paper presents a novel metaheuristic binary crow search algorithm (CSA) designed for positive-unlabeled (PU) learning, a paradigm where only positive and unlabeled data are available, with applications in many diversified fields, such as medical diagnosis and fraud detection. The algorithm represent a useful adaptation of CSA, itself inspired by the food-hiding behavior of crows. The proposed BiCSA-PUL (binary crow search algorithm for positive-unlabeled learning) selects reliable negative samples from unlabeled data using binary vectors, and updates positions employing Hamming distance, guided by a modified F1-score, as fitness function. The algorithm was tested on 30 samples from 10 diverse datasets, outperforming seven state-of-the-art PU learning methods. The results reveal that BiCSA-PUL provides a robust and efficient approach for PU learning, significantly improving fitness and reliability. This work opens new avenues for applying metaheuristic optimization methods to challenging classification problems with limited labeled data. The main limitations are the potentially time-intensive process of parameters tuning and reliance on initial sampling.

This paper presents a novel metaheuristic binary crow search algorithm (CSA) designed for positive-unlabeled (PU) learning, a paradigm where only positive and unlabeled data are available, with applications in many diversified fields, such as medical diagnosis and fraud detection. The algorithm represent a useful adaptation of CSA, itself inspired by the food-hiding behavior of crows. The proposed BiCSA-PUL (binary crow search algorithm for positive-unlabeled learning) selects reliable negative samples from unlabeled data using binary vectors, and updates positions employing Hamming distance, guided by a modified F1-score, as fitness function. The algorithm was tested on 30 samples from 10 diverse datasets, outperforming seven state-of-the-art PU learning methods. The results reveal that BiCSA-PUL provides a robust and efficient approach for PU learning, significantly improving fitness and reliability. This work opens new avenues for applying metaheuristic optimization methods to challenging classification problems with limited labeled data. The main limitations are the potentially time-intensive process of parameters tuning and reliance on initial sampling.

This paper presents a novel metaheuristic binary crow search algorithm (CSA) designed for positive-unlabeled (PU) learning, a paradigm where only positive and unlabeled data are available, with applications in many diversified fields, such as medical diagnosis and fraud detection. The algorithm represent a useful adaptation of CSA, itself inspired by the food-hiding behavior of crows. The proposed BiCSA-PUL (binary crow search algorithm for positive-unlabeled learning) selects reliable negative samples from unlabeled data using binary vectors, and updates positions employing Hamming distance, guided by a modified F1-score, as fitness function. The algorithm was tested on 30 samples from 10 diverse datasets, outperforming seven state-of-the-art PU learning methods. The results reveal that BiCSA-PUL provides a robust and efficient approach for PU learning, significantly improving fitness and reliability. This work opens new avenues for applying metaheuristic optimization methods to challenging classification problems with limited labeled data. The main limitations are the potentially time-intensive process of parameters tuning and reliance on initial sampling.

This paper presents a novel metaheuristic binary crow search algorithm (CSA) designed for positive-unlabeled (PU) learning, a paradigm where only positive and unlabeled data are available, with applications in many diversified fields, such as medical diagnosis and fraud detection. The algorithm represent a useful adaptation of CSA, itself inspired by the food-hiding behavior of crows. The proposed BiCSA-PUL (binary crow search algorithm for positive-unlabeled learning) selects reliable negative samples from unlabeled data using binary vectors, and updates positions employing Hamming distance, guided by a modified F1-score, as fitness function. The algorithm was tested on 30 samples from 10 diverse datasets, outperforming seven state-of-the-art PU learning methods. The results reveal that BiCSA-PUL provides a robust and efficient approach for PU learning, significantly improving fitness and reliability. This work opens new avenues for applying metaheuristic optimization methods to challenging classification problems with limited labeled data. The main limitations are the potentially time-intensive process of parameters tuning and reliance on initial sampling.

This paper presents a novel metaheuristic binary crow search algorithm (CSA) designed for positive-unlabeled (PU) learning, a paradigm where only positive and unlabeled data are available, with applications in many diversified fields, such as medical diagnosis and fraud detection. The algorithm represent a useful adaptation of CSA, itself inspired by the food-hiding behavior of crows. The proposed BiCSA-PUL (binary crow search algorithm for positive-unlabeled learning) selects reliable negative samples from unlabeled data using binary vectors, and updates positions employing Hamming distance, guided by a modified F1-score, as fitness function. The algorithm was tested on 30 samples from 10 diverse datasets, outperforming seven state-of-the-art PU learning methods. The results reveal that BiCSA-PUL provides a robust and efficient approach for PU learning, significantly improving fitness and reliability. This work opens new avenues for applying metaheuristic optimization methods to challenging classification problems with limited labeled data. The main limitations are the potentially time-intensive process of parameters tuning and reliance on initial sampling.

This paper presents a novel metaheuristic binary crow search algorithm (CSA) designed for positive-unlabeled (PU) learning, a paradigm where only positive and unlabeled data are available, with applications in many diversified fields, such as medical diagnosis and fraud detection. The algorithm represent a useful adaptation of CSA, itself inspired by the food-hiding behavior of crows. The proposed BiCSA-PUL (binary crow search algorithm for positive-unlabeled learning) selects reliable negative samples from unlabeled data using binary vectors, and updates positions employing Hamming distance, guided by a modified F1-score, as fitness function. The algorithm was tested on 30 samples from 10 diverse datasets, outperforming seven state-of-the-art PU learning methods. The results reveal that BiCSA-PUL provides a robust and efficient approach for PU learning, significantly improving fitness and reliability. This work opens new avenues for applying metaheuristic optimization methods to challenging classification problems with limited labeled data. The main limitations are the potentially time-intensive process of parameters tuning and reliance on initial sampling.

The global wind energy industry achieved a significant milestone by reaching a total capacity of one terawatt (TW) by the end of 2023, underscoring the increasing importance of wind energy as a sustainable energy source (Global Wind Energy Outlook, 2022). This study focuses on the simulation and dynamic analysis of an H-Darrieus wind turbine rotor using 3D Finite Element Analysis (FEA). Key structural parameters, including natural frequencies, associated vibration modes, and mass participation rates, were determined to optimize the rotor performance. A novel blade design is proposed in this work, offering a lighter and more robust alternative to traditional rotor blades manufactured from composites, like fiberglass-polyester, fiberglass-epoxy, or combinations with wood and carbon. The lighter design enhances the startup performance at low wind speeds, while the improved strength and fixing mechanisms ensure resilience against the increasingly severe sandstorms reported in recent years. The vibration dynamics of the rotor under critical wind loads were analyzed using the SolidWorks Simulation software, yielding highly satisfactory results. The stability and reliability of the rotor were validated, as the dynamic performance indices, and the quality criteria meet the requirements for optimal operation.

The global wind energy industry achieved a significant milestone by reaching a total capacity of one terawatt (TW) by the end of 2023, underscoring the increasing importance of wind energy as a sustainable energy source (Global Wind Energy Outlook, 2022). This study focuses on the simulation and dynamic analysis of an H-Darrieus wind turbine rotor using 3D Finite Element Analysis (FEA). Key structural parameters, including natural frequencies, associated vibration modes, and mass participation rates, were determined to optimize the rotor performance. A novel blade design is proposed in this work, offering a lighter and more robust alternative to traditional rotor blades manufactured from composites, like fiberglass-polyester, fiberglass-epoxy, or combinations with wood and carbon. The lighter design enhances the startup performance at low wind speeds, while the improved strength and fixing mechanisms ensure resilience against the increasingly severe sandstorms reported in recent years. The vibration dynamics of the rotor under critical wind loads were analyzed using the SolidWorks Simulation software, yielding highly satisfactory results. The stability and reliability of the rotor were validated, as the dynamic performance indices, and the quality criteria meet the requirements for optimal operation.

The global wind energy industry achieved a significant milestone by reaching a total capacity of one terawatt (TW) by the end of 2023, underscoring the increasing importance of wind energy as a sustainable energy source (Global Wind Energy Outlook, 2022). This study focuses on the simulation and dynamic analysis of an H-Darrieus wind turbine rotor using 3D Finite Element Analysis (FEA). Key structural parameters, including natural frequencies, associated vibration modes, and mass participation rates, were determined to optimize the rotor performance. A novel blade design is proposed in this work, offering a lighter and more robust alternative to traditional rotor blades manufactured from composites, like fiberglass-polyester, fiberglass-epoxy, or combinations with wood and carbon. The lighter design enhances the startup performance at low wind speeds, while the improved strength and fixing mechanisms ensure resilience against the increasingly severe sandstorms reported in recent years. The vibration dynamics of the rotor under critical wind loads were analyzed using the SolidWorks Simulation software, yielding highly satisfactory results. The stability and reliability of the rotor were validated, as the dynamic performance indices, and the quality criteria meet the requirements for optimal operation.

Let (X,d,μ) be a space of homogeneous type and L be a nonnegative self-adjoint operator on L2(X) whose heat kernels satisfy Gaussian upper bounds. In this article, we introduce the weighted variable Besov space associated with the operator L and demonstrate that Peetre maximal functions can be used to characterize this space. Furthermore, we provide a detailed study of its atomic decompositions.

Let (X,d,μ) be a space of homogeneous type and L be a nonnegative self-adjoint operator on L2(X) whose heat kernels satisfy Gaussian upper bounds. In this article, we introduce the weighted variable Besov space associated with the operator L and demonstrate that Peetre maximal functions can be used to characterize this space. Furthermore, we provide a detailed study of its atomic decompositions.

Let (X,d,μ) be a space of homogeneous type and L be a nonnegative self-adjoint operator on L2(X) whose heat kernels satisfy Gaussian upper bounds. In this article, we introduce the weighted variable Besov space associated with the operator L and demonstrate that Peetre maximal functions can be used to characterize this space. Furthermore, we provide a detailed study of its atomic decompositions.

Simultaneous localisation and mapping (SLAM) is a process by which robots build maps of their environment and simultaneous ly determine their location and orientation in the environment. In recent years, SLAM research has advanced quickly. Researchers are cur rently working on developing reliable and accurate visual SLAM algorithms dealing with dynamic environments. The steps involved in de veloping a SLAM system are described in this article. We explore the most-recent methods used in SLAM systems, including probabilistic methods, visual methods, and deep learning (DL) methods. We also discuss the fundamental techniques utilised in SLAM fields.

Simultaneous localisation and mapping (SLAM) is a process by which robots build maps of their environment and simultaneous ly determine their location and orientation in the environment. In recent years, SLAM research has advanced quickly. Researchers are cur rently working on developing reliable and accurate visual SLAM algorithms dealing with dynamic environments. The steps involved in de veloping a SLAM system are described in this article. We explore the most-recent methods used in SLAM systems, including probabilistic methods, visual methods, and deep learning (DL) methods. We also discuss the fundamental techniques utilised in SLAM fields.

Cette étude vise à évaluer la capacité des fibres (chanvre et alfa) à améliorer les propriétés mécaniques du béton, dans le but de créer un béton respectueux de l'environnement. Les bétons ont été incorporés avec des teneurs de 0.25%, 0.5%, et 1% (en volume) en fibres de chanvre, plus une dose de 0.5% (en volume) de fibres d'alfa et ainsi qu'un béton ordinaire. Les résultats montrent que l'utilisation des fibres de chanvre et d'alfa permet une meilleure augmentation de la résistance à la traction par fendage par rapport au béton ordinaire. En outre, l'augmentation de la résistance à la flexion pour le béton de fibres de chanvre est optimale avec une teneur de 0.25%. Aussi, le module d’élasticité dynamique du HFC-0.25 est proche ou égal à celui du béton ordinaire. Nous concluons que les fibres végétales de chanvre et d'alfa sont des candidats potentiels pour produire du béton vert.

Cette étude vise à évaluer la capacité des fibres (chanvre et alfa) à améliorer les propriétés mécaniques du béton, dans le but de créer un béton respectueux de l'environnement. Les bétons ont été incorporés avec des teneurs de 0.25%, 0.5%, et 1% (en volume) en fibres de chanvre, plus une dose de 0.5% (en volume) de fibres d'alfa et ainsi qu'un béton ordinaire. Les résultats montrent que l'utilisation des fibres de chanvre et d'alfa permet une meilleure augmentation de la résistance à la traction par fendage par rapport au béton ordinaire. En outre, l'augmentation de la résistance à la flexion pour le béton de fibres de chanvre est optimale avec une teneur de 0.25%. Aussi, le module d’élasticité dynamique du HFC-0.25 est proche ou égal à celui du béton ordinaire. Nous concluons que les fibres végétales de chanvre et d'alfa sont des candidats potentiels pour produire du béton vert.

Cette étude vise à évaluer la capacité des fibres (chanvre et alfa) à améliorer les propriétés mécaniques du béton, dans le but de créer un béton respectueux de l'environnement. Les bétons ont été incorporés avec des teneurs de 0.25%, 0.5%, et 1% (en volume) en fibres de chanvre, plus une dose de 0.5% (en volume) de fibres d'alfa et ainsi qu'un béton ordinaire. Les résultats montrent que l'utilisation des fibres de chanvre et d'alfa permet une meilleure augmentation de la résistance à la traction par fendage par rapport au béton ordinaire. En outre, l'augmentation de la résistance à la flexion pour le béton de fibres de chanvre est optimale avec une teneur de 0.25%. Aussi, le module d’élasticité dynamique du HFC-0.25 est proche ou égal à celui du béton ordinaire. Nous concluons que les fibres végétales de chanvre et d'alfa sont des candidats potentiels pour produire du béton vert.