Results 1-20 of 402.
((uid:50001021))
![]() Kieffer, Emmanuel ![]() in Frontiers in Artificial Intelligence in Finance (2023) Keeping strategic allocations at target level to maintain high exposure to private equity is a complex but essential task for investors who need to balance against the risk of default. Illiquidity and ... [more ▼] Keeping strategic allocations at target level to maintain high exposure to private equity is a complex but essential task for investors who need to balance against the risk of default. Illiquidity and cashflow uncertainty are critical challenges especially when commitments are irrevocable. In this work, we propose to use a trustworthy and explainable A.I. approach to design recommitment strategies. Using intensive portfolios simulations and evolutionary computing, we show that efficient and dynamic recommitment strategies can be brought forth automatically. [less ▲] Detailed reference viewed: 65 (4 UL)![]() Talbot, Pierre ![]() ![]() ![]() in Proceedings of the AAAI Conference on Artificial Intelligence (2022, June), 36(4), 3830-3839 The number of cores on graphical computing units (GPUs) is reaching thousands nowadays, whereas the clock speed of processors stagnates. Unfortunately, constraint programming solvers do not take advantage ... [more ▼] The number of cores on graphical computing units (GPUs) is reaching thousands nowadays, whereas the clock speed of processors stagnates. Unfortunately, constraint programming solvers do not take advantage yet of GPU parallelism. One reason is that constraint solvers were primarily designed within the mental frame of sequential computation. To solve this issue, we take a step back and contribute to a simple, intrinsically parallel, lock-free and formally correct programming language based on concurrent constraint programming. We then re-examine parallel constraint solving on GPUs within this formalism, and develop Turbo, a simple constraint solver entirely programmed on GPUs. Turbo validates the correctness of our approach and compares positively to a parallel CPU-based solver. [less ▲] Detailed reference viewed: 59 (7 UL)![]() Helbecque, Guillaume André Marcel ![]() ![]() in PMAM '22: Proceedings of the Thirteenth International Workshop on Programming Models and Applications for Multicores and Manycores (2022, April 18) The increase in complexity, diversity and scale of high performance computing environments, as well as the increasing sophistication of parallel applications and algorithms call for productivity-aware ... [more ▼] The increase in complexity, diversity and scale of high performance computing environments, as well as the increasing sophistication of parallel applications and algorithms call for productivity-aware programming languages for high-performance computing. Among them, the Chapel programming language stands out as one of the more successful approaches based on the Partitioned Global Address Space programming model. Although Chapel is designed for productive parallel computing at scale, the question of its competitiveness with well-established conventional parallel programming environments arises. To this end, this work compares the performance of Chapel-based fractal generation on shared- and distributed-memory platforms with corresponding OpenMP and MPI+X implementations. The parallel computation of the Mandelbrot set is chosen as a test-case for its high degree of parallelism and its irregular workload. Experiments are performed on a cluster composed of 192 cores using the French national testbed Grid'5000. Chapel as well as its default tasking layer demonstrate high performance in shared-memory context, while Chapel competes with hybrid MPI+OpenMP in distributed-memory environment. [less ▲] Detailed reference viewed: 33 (1 UL)![]() ; Brust, Mathias ![]() in PLoS ONE (2022), 17(1), 1-17 Detailed reference viewed: 93 (15 UL)![]() Duflo, Gabriel ![]() ![]() ![]() in Applied Sciences (2022), 12(19 9587), 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 ... [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. [less ▲] Detailed reference viewed: 70 (8 UL)![]() Sirajzade, Joshgun ![]() ![]() ![]() in Applied Informatics, 5th International Conference, ICAI 2022, Arequipa, Peru, October 27–29, 2022, Proceedings (2022) In this paper we investigate how scientific and medical papers about Covid-19 can be effectively mined. For this purpose we use the CORD19 dataset which is a huge collection of all papers published about ... [more ▼] In this paper we investigate how scientific and medical papers about Covid-19 can be effectively mined. For this purpose we use the CORD19 dataset which is a huge collection of all papers published about and around the SARS-CoV2 virus and the pandemic it caused. We discuss how classical text mining algorithms like Latent Semantic Analysis (LSA) or its modern version Latent Drichlet Allocation (LDA) can be used for this purpose and also touch more modern variant of these algorithms like word2vec which came with deep learning wave and show their advantages and disadvantages each. We finish the paper with showing some topic examples from the corpus and answer questions such as which topics are the most prominent for the corpus or how many percentage of the corpus is dedicated to them. We also give a discussion of how topics around RNA research in connection with Covid-19 can be examined. [less ▲] Detailed reference viewed: 39 (3 UL)![]() Stolfi Rosso, Daniel ![]() ![]() ![]() in Drones (2022), 6(13), 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 ... [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. [less ▲] Detailed reference viewed: 81 (15 UL)![]() Duflo, Gabriel ![]() ![]() ![]() in International Conference in Optimization and Learning (OLA2022) (2022) Detailed reference viewed: 120 (14 UL)![]() Felten, Florian ![]() ![]() in Proceedings of the 14th International Conference on Agents and Artificial Intelligence (2022) The fields of Reinforcement Learning (RL) and Optimization aim at finding an optimal solution to a problem, characterized by an objective function. The exploration-exploitation dilemma (EED) is a well ... [more ▼] The fields of Reinforcement Learning (RL) and Optimization aim at finding an optimal solution to a problem, characterized by an objective function. The exploration-exploitation dilemma (EED) is a well known subject in those fields. Indeed, a consequent amount of literature has already been proposed on the subject and shown it is a non-negligible topic to consider to achieve good performances. Yet, many problems in real life involve the optimization of multiple objectives. Multi-Policy Multi-Objective Reinforcement Learning (MPMORL) offers a way to learn various optimised behaviours for the agent in such problems. This work introduces a modular framework for the learning phase of such algorithms, allowing to ease the study of the EED in Inner- Loop MPMORL algorithms. We present three new exploration strategies inspired from the metaheuristics domain. To assess the performance of our methods on various environments, we use a classical benchmark - the Deep Sea Treasure (DST) - as well as propose a harder version of it. Our experiments show all of the proposed strategies outperform the current state-of-the-art ε-greedy based methods on the studied benchmarks. [less ▲] Detailed reference viewed: 243 (66 UL)![]() Kieffer, Emmanuel ![]() ![]() ![]() in A RNN-Based Hyper-Heuristic for Combinatorial Problems (2022) Designing efficient heuristics is a laborious and tedious task that generally requires a full understanding and knowledge of a given optimization problem. Hyper-heuristics have been mainly introduced to ... [more ▼] Designing efficient heuristics is a laborious and tedious task that generally requires a full understanding and knowledge of a given optimization problem. Hyper-heuristics have been mainly introduced to tackle this issue and are mostly relying on Genetic Programming and its variants. Many attempts in the literature have shown that an automatic training mechanism for heuristic learning is possible and can challenge human-based heuristics in terms of gap to optimality. In this work, we introduce a novel approach based on a recent work on Deep Symbolic Regression. We demonstrate that scoring functions can be trained using Recurrent Neural Networks to tackle a well-know combinatorial problem, i.e., the Multi-dimensional Knapsack. Experiments have been conducted on instances from the OR-Library and results show that the proposed modus operandi is an alternative and promising approach to human- based heuristics and classical heuristic generation approaches. [less ▲] Detailed reference viewed: 106 (13 UL)![]() Stolfi Rosso, Daniel ![]() ![]() ![]() in ICCCI 2021: Computational Collective Intelligence (2021, July 30) In this article we address the optimisation of pheromone communication used for the mobility management of a swarm of Unmanned Aerial Vehicles (UAVs) for surveillance applications. A genetic algorithm is ... [more ▼] In this article we address the optimisation of pheromone communication used for the mobility management of a swarm of Unmanned Aerial Vehicles (UAVs) for surveillance applications. A genetic algorithm is proposed to optimise the exchange of pheromone maps used in the CACOC (Chaotic Ant Colony Optimisation for Coverage) mobility model which improves the vehicles’ routes in order to achieve unpredictable trajectories as well as maximise area coverage. Experiments are conducted using realistic simulations, which additionally permit to assess the impact of packet loss ratios on the performance of the surveillance system, in terms of reliability and area coverage. [less ▲] Detailed reference viewed: 38 (3 UL)![]() ; Varrette, Sébastien ![]() ![]() in Proc. of the EU Annual Privacy Forum (APF) 2021 (2021, June) The Open Science projects are also aimed at strongly encouraging the use of Cloud technologies and High Performance Computing (HPC), for the benefit of European researchers and universities. The emerging ... [more ▼] The Open Science projects are also aimed at strongly encouraging the use of Cloud technologies and High Performance Computing (HPC), for the benefit of European researchers and universities. The emerging paradigm of Open Science enables an easier access to expert knowledge and material; however, it also raises some challenges regarding the protection of personal data, considering that part of the research data are personal data thus subjected to the EU’s General Data Protection Regulation (GDPR). This paper investigates the concept of scientific research in the field of data protection, with regard both to the European (GDPR) and national (Luxembourg Data Protection Law) legal framework for the compliance of the HPC technology. Therefore, it focuses on a case study, the HPC platform of the University of Luxembourg (ULHPC), to pinpoint the major data protection issues arising from the processing activities through HPC from the perspective of the HPC platform operators. Our study illustrates where the most problematic aspects of compliance lie. In this regard, possible solutions are also suggested, which mainly revolve around (1) standardisation of procedures; (2) cooperation at institutional level; (3) identification of guidelines for common challenges. This research is aimed to support legal researchers in the field of data protection, in order to help deepen the understanding of HPC technology’s challenges and universities and research centres holding an HPC platform for research purposes, which have to address the same issues. [less ▲] Detailed reference viewed: 155 (12 UL)![]() Brust, Matthias R. ![]() ![]() ![]() in Discover Internet of Things (2021), 1(1), Unmanned Aerial Vehicles (UAVs) have quickly become one of the promising Internet-of-Things (IoT) devices for smart cities. Thanks to their mobility, agility, and onboard sensors'customizability, UAVs ... [more ▼] Unmanned Aerial Vehicles (UAVs) have quickly become one of the promising Internet-of-Things (IoT) devices for smart cities. Thanks to their mobility, agility, and onboard sensors'customizability, UAVs have already demonstrated immense potential for numerous commercial applications. The UAVs expansion will come at the price of a dense, high-speed and dynamic traffic prone to UAVs going rogue or deployed with malicious intent. Counter UAV systems (C-UAS) are thus required to ensure their operations are safe. Existing C-UAS, which for the majority come from the military domain, lack scalability or induce collateral damages. This paper proposes a C-UAS able to intercept and escort intruders. It relies on an autonomous defense UAV swarm, capable of self-organizing their defense formation and to intercept the malicious UAV. This fully localized and GPS-free approach follows a modular design regarding the defense phases and it uses a newly developed balanced clustering to realize the intercept- and capture-formation. The resulting networked defense UAV swarm is resilient to communication losses. Finally, a prototype UAV simulator has been implemented. Through extensive simulations, we demonstrate the feasibility and performance of our approach. [less ▲] Detailed reference viewed: 110 (22 UL)![]() ; Pinel, Frederic ![]() ![]() in Proceedings of International Conference on Agents and Artificial Intelligence (ICAART) (2021, February 05) Elementary cellular automata (ECA) are simple dynamic systems which display complex behaviour from simple local interactions. The complex behaviour is apparent in the two-dimensional temporal evolution of ... [more ▼] Elementary cellular automata (ECA) are simple dynamic systems which display complex behaviour from simple local interactions. The complex behaviour is apparent in the two-dimensional temporal evolution of a cellular automata, which can be viewed as an image composed of black and white pixels. The visual patterns within these images inspired several ECA classifications, aimed at matching the automatas’ properties to observed patterns, visual or statistical. In this paper, we quantitatively compare 11 ECA classifications. In contrast to the a priori logic behind a classification, we propose an a posteriori evaluation of a classification. The evaluation employs a convolutional neural network, trained to classify each ECA to its assigned class in a classification. The prediction accuracy indicates how well the convolutional neural network is able to learn the underlying classification logic, and reflects how well this classification logic clusters patterns in the temporal evolution. Results show different prediction accuracy (yet all above 85%), three classifications are very well captured by our simple convolutional neural network (accuracy above 99%), although trained on a small extract from the temporal evolution, and with little observations (100 per ECA, evolving 513 cells). In addition, we explain an unreported ”pathological” behaviour in two ECAs. [less ▲] Detailed reference viewed: 135 (8 UL)![]() Fiscarelli, Antonio Maria ![]() ![]() in Scientific Reports (2021) Detailed reference viewed: 133 (27 UL)![]() Samir Labib, Nader ![]() ![]() ![]() Scientific Conference (2021, January 07) Autonomous Unmanned Aerial Vehicles (UAVs) are in increasing demand thanks to their applicability in a wide range of domains. However, to fully exploit such potential, UAVs should be capable of ... [more ▼] Autonomous Unmanned Aerial Vehicles (UAVs) are in increasing demand thanks to their applicability in a wide range of domains. However, to fully exploit such potential, UAVs should be capable of intelligently planning their collision-free paths as that impacts greatly the execution quality of their applications. While being a problem well addressed in literature, most presented solutions are either computationally complex centralised approaches or ones not suitable for the multiobjective requirements of most UAV use-cases. This extended abstract introduces ongoing research on a novel distributed Pareto path planning algorithm incorporating a dynamic multi-criteria decision matrix allowing each UAV to plan its collision-free path relying on local knowledge gained via digital stigmergy. The article presents some initial simulations results of a distributed UAV Traffic Management system (UTM) on a weighted multilayer network. [less ▲] Detailed reference viewed: 242 (44 UL)![]() Esmaeilzadeh Dilmaghani, Saharnaz ![]() ![]() ![]() Scientific Conference (2021) Early approaches of community detection algorithms often depend on the network’s global structure with a time complexity correlated to the network size. Local algorithms emerged as a more efficient ... [more ▼] Early approaches of community detection algorithms often depend on the network’s global structure with a time complexity correlated to the network size. Local algorithms emerged as a more efficient solution to deal with large-scale networks with millions to billions of nodes. This methodology has shifted the attention from global structure towards the local level to deal with a network using only a portion of nodes. Investigating the state-of-the-art, we notice the absence of a standard definition of locality between community detection algorithms. Different goals have been explored under the local terminology of community detection approaches that can be misunderstood. This paper probes existing contributions to extract the scopes where an algorithm performs locally. Our purpose is to interpret the concept of locality in community detection algorithms. We propose a locality exploration scheme to investigate the concept of locality at each stage of an existing community detection workflow. We summarized terminologies concerning the locality in the state-of-the-art community detection approaches. In some cases, we observe how different terms are used for the same concept. We demonstrate the applicability of our algorithm by providing a review of some algorithms using our proposed scheme. Our review highlights a research gap in community detection algorithms and initiates new research topics in this domain. [less ▲] Detailed reference viewed: 271 (34 UL)![]() Duflo, Gabriel ![]() ![]() ![]() in Intelligent Information and Database Systems - 13th Asian Conference ACIIDS 2021, Phuket, Thailand, April 7-10, 2021, Proceedings (2021) Detailed reference viewed: 79 (13 UL)![]() Stolfi Rosso, Daniel ![]() ![]() ![]() in Frontiers in Robotics and AI (2021), 8 In this paper we present a surveillance system for early detection of escapers from a restricted area based on a new swarming mobility model called CROMM-MS (Chaotic Rössler Mobility Model for Multi ... [more ▼] In this paper we present a surveillance system for early detection of escapers from a restricted area based on a new swarming mobility model called CROMM-MS (Chaotic Rössler Mobility Model for Multi-Swarms). CROMM-MS is designed for controlling the trajectories of heterogeneous multi-swarms of aerial, ground and marine unmanned vehicles with important features such as prioritising early detections and success rate. A new Competitive Coevolutionary Genetic Algorithm (CompCGA) is proposed to optimise the vehicles’ parameters and escapers’ evasion ability using a predator-prey approach. Our results show that CROMM-MS is not only viable for surveillance tasks but also that its results are competitive in regard to the state-of-the-art approaches. [less ▲] Detailed reference viewed: 111 (12 UL)![]() ; Brust, Matthias R. ![]() ![]() in Swarm Intelligence (2021), 15(3), 205--235 Detailed reference viewed: 81 (12 UL) |
||