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

Journals

Article Types

Countries / Regions

Search Results (8)

Search Parameters:
Authors = Pascal Bouvry

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
18 pages, 929 KiB  
Article
Round-Based Mechanism and Job Packing with Model-Similarity-Based Policy for Scheduling DL Training in GPU Cluster
by Panissara Thanapol, Kittichai Lavangnananda, Franck Leprévost, Arnaud Glad, Julien Schleich and Pascal Bouvry
Appl. Sci. 2024, 14(6), 2349; https://doi.org/10.3390/app14062349 - 11 Mar 2024
Cited by 2 | Viewed by 1319
Abstract
Graphics Processing Units (GPUs) are employed for their parallel processing capabilities, which are essential to train deep learning (DL) models with large datasets within a reasonable time. However, the diverse GPU architectures exhibit variability in training performance depending on DL models. Furthermore, factors [...] Read more.
Graphics Processing Units (GPUs) are employed for their parallel processing capabilities, which are essential to train deep learning (DL) models with large datasets within a reasonable time. However, the diverse GPU architectures exhibit variability in training performance depending on DL models. Furthermore, factors such as the number of GPUs for distributed training and batch size significantly impact training efficiency. Addressing the variability in training performance and accounting for these influential factors are critical for optimising resource usage. This paper presents a scheduling policy for DL training tasks in a heterogeneous GPU cluster. It builds upon a model-similarity-based scheduling policy by implementing a round-based mechanism and job packing. The round-based mechanism allows the scheduler to adjust its scheduling decisions periodically, whereas job packing optimises GPU utilisation by fitting additional jobs into a GPU that trains a small model. Results show that implementing a round-based mechanism reduces the makespan by approximately 29%, compared to the scenario without it. Additionally, integrating job packing further decreases the makespan by 5%. Full article
Show Figures

Figure 1

30 pages, 6792 KiB  
Article
An Edge-Based Approach to Partitioning and Overlapping Graph Clustering with User-Specified Density
by Rohi Tariq, Kittichai Lavangnananda, Pascal Bouvry and Pornchai Mongkolnam
Appl. Sci. 2024, 14(1), 380; https://doi.org/10.3390/app14010380 - 31 Dec 2023
Cited by 1 | Viewed by 3071
Abstract
Graph clustering has received considerable attention recently, and its applications are numerous, ranging from the detection of social communities to the clustering of computer networks. It is classified as an NP-class problem, and several algorithms have been proposed with specific objectives. There also [...] Read more.
Graph clustering has received considerable attention recently, and its applications are numerous, ranging from the detection of social communities to the clustering of computer networks. It is classified as an NP-class problem, and several algorithms have been proposed with specific objectives. There also exist various quality metrics for evaluating them. Having clusters with the required density can be beneficial because it permits the effective deployment of resources. This study proposes an approach to partitioning and overlapping clustering of undirected unweighted graphs, allowing users to specify the required density of resultant clusters. This required density is achieved by means of ‘Relative Density’. The proposed algorithm adopts an edge-based approach, commencing with the determination of the edge degree for each edge. The main clustering process is then initiated by an edge with an average degree. A cluster is expanded by considering adjacent edges that can be included while monitoring the relative density of the cluster. Eight empirical networks with diverse characteristics are used to validate the proposed algorithm for both partitioning and overlapping clustering. Their results are assessed using an appropriate metric known as the mean relative density deviation coefficient (MRDDC). This is the first work that attempts to carry out partitioning and overlapping graph clustering, which allows user-specified density. Full article
Show Figures

Figure 1

24 pages, 1412 KiB  
Article
Learning to Optimise a Swarm of UAVs
by Gabriel Duflo, Grégoire Danoy, El-Ghazali Talbi and Pascal Bouvry
Appl. Sci. 2022, 12(19), 9587; https://doi.org/10.3390/app12199587 - 24 Sep 2022
Cited by 2 | Viewed by 7238
Abstract
The use of Unmanned Aerial Vehicles (UAVs) has shown a drastic increase in interest in the past few years. Current applications mainly depend on single UAV operations, which face critical limitations such as mission range or resilience. Using several autonomous UAVs as a [...] Read more.
The use of Unmanned Aerial Vehicles (UAVs) has shown a drastic increase in interest in the past few years. Current applications mainly depend on single UAV operations, which face critical limitations such as mission range or resilience. Using several autonomous UAVs as a swarm is a promising approach to overcome these. However, designing an efficient swarm is a challenging task, since its global behaviour emerges solely from local decisions and interactions. These properties make classical multirobot design techniques not applicable, while evolutionary swarm robotics is typically limited to a single use case. This work, thus, proposes an automated swarming algorithm design approach, and more precisely, a generative hyper-heuristic relying on multi-objective reinforcement learning, that permits us to obtain not only efficient but also reusable swarming behaviours. Experimental results on a three-objective variant of the Coverage of a Connected UAV Swarm problem demonstrate that it not only permits one to generate swarming heuristics that outperform the state-of-the-art in terms of coverage by a swarm of UAVs but also provides high stability. Indeed, it is empirically demonstrated that the model trained on a certain class of instances generates heuristics and is capable of performing well on instances with a different size or swarm density. Full article
(This article belongs to the Special Issue Artificial Intelligence within Robot Swarms)
Show Figures

Figure 1

19 pages, 15807 KiB  
Article
SuSy-EnGaD: Surveillance System Enhanced by Games of Drones
by Daniel H. Stolfi, Matthias R. Brust, Grégoire Danoy and Pascal Bouvry
Drones 2022, 6(1), 13; https://doi.org/10.3390/drones6010013 - 6 Jan 2022
Cited by 2 | Viewed by 3203
Abstract
In this article, we propose SuSy-EnGaD, a surveillance system enhanced by games of drones. We propose three different approaches to optimise a swarm of UAVs for improving intruder detection, two of them featuring a multi-objective optimisation approach, while the third approach relates to [...] Read more.
In this article, we propose SuSy-EnGaD, a surveillance system enhanced by games of drones. We propose three different approaches to optimise a swarm of UAVs for improving intruder detection, two of them featuring a multi-objective optimisation approach, while the third approach relates to the evolutionary game theory where three different strategies based on games are proposed. We test our system on four different case studies, analyse the results presented as Pareto fronts in terms of flying time and area coverage, and compare them with the single-objective optimisation results from games. Finally, an analysis of the UAVs trajectories is performed to help understand the results achieved. Full article
(This article belongs to the Special Issue Feature Papers of Drones)
Show Figures

Figure 1

25 pages, 10277 KiB  
Article
Optimization of Carsharing Fleet Placement in Round-Trip Carsharing Service
by Boonyarit Changaival, Kittichai Lavangnananda, Grégoire Danoy, Dzmitry Kliazovich, Frédéric Guinand, Matthias Brust, Jedrzej Musial and Pascal Bouvry
Appl. Sci. 2021, 11(23), 11393; https://doi.org/10.3390/app112311393 - 1 Dec 2021
Cited by 8 | Viewed by 3987
Abstract
In a round-trip carsharing system, stations must be located in such a way that allow for maximum user coverage with the least walking distance as well as offer certain degrees of flexibility for returning. Therefore, a balance must be stricken between these factors. [...] Read more.
In a round-trip carsharing system, stations must be located in such a way that allow for maximum user coverage with the least walking distance as well as offer certain degrees of flexibility for returning. Therefore, a balance must be stricken between these factors. Providing a satisfactory system can be translated into an optimization problem and belongs to an NP-hard class. In this article, a novel optimization model for the round-trip carsharing fleet placement problem, called Fleet Placement Problem (FPP), is proposed. The optimization in this work is multiobjective and its NP-hard nature is proven. Three different optimization algorithms: PolySCIP (exact method), heuristics, and NSGA-II (metaheuristic) are investigated. This work adopts three real instances for the study, instead of their abstracts where they are most commonly used. They are two instance:, in the city of Luxembourg (smaller and larger) and a much larger instance in the city of Munich. Results from each algorithm are validated and compared with solution from human experts. Superiority of the proposed FPP model over the traditional methods is also demonstrated. Full article
(This article belongs to the Topic Applied Metaheuristic Computing)
Show Figures

Figure 1

37 pages, 5184 KiB  
Review
Overview of Radiolabeled Somatostatin Analogs for Cancer Imaging and Therapy
by Romain Eychenne, Christelle Bouvry, Mickael Bourgeois, Pascal Loyer, Eric Benoist and Nicolas Lepareur
Molecules 2020, 25(17), 4012; https://doi.org/10.3390/molecules25174012 - 2 Sep 2020
Cited by 91 | Viewed by 13898
Abstract
Identified in 1973, somatostatin (SST) is a cyclic hormone peptide with a short biological half-life. Somatostatin receptors (SSTRs) are widely expressed in the whole body, with five subtypes described. The interaction between SST and its receptors leads to the internalization of the ligand–receptor [...] Read more.
Identified in 1973, somatostatin (SST) is a cyclic hormone peptide with a short biological half-life. Somatostatin receptors (SSTRs) are widely expressed in the whole body, with five subtypes described. The interaction between SST and its receptors leads to the internalization of the ligand–receptor complex and triggers different cellular signaling pathways. Interestingly, the expression of SSTRs is significantly enhanced in many solid tumors, especially gastro-entero-pancreatic neuroendocrine tumors (GEP-NET). Thus, somatostatin analogs (SSAs) have been developed to improve the stability of the endogenous ligand and so extend its half-life. Radiolabeled analogs have been developed with several radioelements such as indium-111, technetium-99 m, and recently gallium-68, fluorine-18, and copper-64, to visualize the distribution of receptor overexpression in tumors. Internal metabolic radiotherapy is also used as a therapeutic strategy (e.g., using yttrium-90, lutetium-177, and actinium-225). With some radiopharmaceuticals now used in clinical practice, somatostatin analogs developed for imaging and therapy are an example of the concept of personalized medicine with a theranostic approach. Here, we review the development of these analogs, from the well-established and authorized ones to the most recently developed radiotracers, which have better pharmacokinetic properties and demonstrate increased efficacy and safety, as well as the search for new clinical indications. Full article
(This article belongs to the Special Issue Radiolabeled Compounds for Diagnosis and Treatment of Cancer)
Show Figures

Figure 1

21 pages, 4063 KiB  
Article
Emerging Inter-Swarm Collaboration for Surveillance Using Pheromones and Evolutionary Techniques
by Daniel H. Stolfi, Matthias R. Brust, Grégoire Danoy and Pascal Bouvry
Sensors 2020, 20(9), 2566; https://doi.org/10.3390/s20092566 - 30 Apr 2020
Cited by 10 | Viewed by 4367
Abstract
In this article, we propose a new mobility model, called Attractor Based Inter-Swarm collaborationS (ABISS), for improving the surveillance of restricted areas performed by unmanned autonomous vehicles. This approach uses different types of vehicles which explore an area of interest following unpredictable trajectories [...] Read more.
In this article, we propose a new mobility model, called Attractor Based Inter-Swarm collaborationS (ABISS), for improving the surveillance of restricted areas performed by unmanned autonomous vehicles. This approach uses different types of vehicles which explore an area of interest following unpredictable trajectories based on chaotic solutions of dynamic systems. Collaborations between vehicles are meant to cover some regions of the area which are unreachable by members of one swarm, e.g., unmanned ground vehicles on water surface, by using members of another swarm, e.g., unmanned aerial vehicles. Experimental results demonstrate that collaboration is not only possible but also emerges as part of the configurations calculated by a specially designed and parameterised evolutionary algorithm. Experiments were conducted on 12 different case studies including 30 scenarios each, observing an improvement in the total covered area up to 11%, when comparing ABISS with a non-collaborative approach. Full article
(This article belongs to the Special Issue Unmanned Aerial Vehicle Control, Networks, System and Application)
Show Figures

Figure 1

22 pages, 9229 KiB  
Article
Internet of Unmanned Aerial Vehicles—A Multilayer Low-Altitude Airspace Model for Distributed UAV Traffic Management
by Nader Samir Labib, Grégoire Danoy, Jedrzej Musial, Matthias R. Brust and Pascal Bouvry
Sensors 2019, 19(21), 4779; https://doi.org/10.3390/s19214779 - 3 Nov 2019
Cited by 64 | Viewed by 7195
Abstract
The rapid adoption of Internet of Things (IoT) has encouraged the integration of new connected devices such as Unmanned Aerial Vehicles (UAVs) to the ubiquitous network. UAVs promise a pragmatic solution to the limitations of existing terrestrial IoT infrastructure as well as bring [...] Read more.
The rapid adoption of Internet of Things (IoT) has encouraged the integration of new connected devices such as Unmanned Aerial Vehicles (UAVs) to the ubiquitous network. UAVs promise a pragmatic solution to the limitations of existing terrestrial IoT infrastructure as well as bring new means of delivering IoT services through a wide range of applications. Owning to their potential, UAVs are expected to soon dominate the low-altitude airspace over populated cities. This introduces new research challenges such as the safe management of UAVs operation under high traffic demands. This paper proposes a novel way of structuring the uncontrolled, low-altitude airspace, with the aim of addressing the complex problem of UAV traffic management at an abstract level. The work, hence, introduces a model of the airspace as a weighted multilayer network of nodes and airways and presents a set of experimental simulation results using three UAV traffic management heuristics. Full article
(This article belongs to the Special Issue UAV-Based Applications in the Internet of Things (IoT))
Show Figures

Figure 1

Back to TopTop