Search results for " Computer Science"

2020

Vector-borne diseases such as malaria, dengue fever, West Nile virus, and so forth are some of the most prominent threats to human health. They are transmitted to the human population by infected insects or by direct transmission between humans. The epidemic process relies on suitable environmental and climatic conditions. Indeed, climatic factors affect the development of pathogens in vectors as well as the population dynamics of the vectors impacting significantly the incidence of disease in the human population. While the influence of the climatic conditions on Vector-borne diseases is well-documented, there is a strong need to design more realistic epidemiological models incorporating e…

Universal natural shapes: From unifying shape description to simple methods for shape analysis and boundary value problems

2012

Gielis curves and surfaces can describe a wide range of natural shapes and they have been used in various studies in biology and physics as descriptive tool. This has stimulated the generalization of widely used computational methods. Here we show that proper normalization of the Levenberg-Marquardt algorithm allows for efficient and robust reconstruction of Gielis curves, including self-intersecting and asymmetric curves, without increasing the overall complexity of the algorithm. Then, we show how complex curves of k-type can be constructed and how solutions to the Dirichlet problem for the Laplace equation on these complex domains can be derived using a semi-Fourier method. In all three …

A Push Forward Construction and the Comprehensive Factorization for Internal Crossed Modules

2014

In a semi-abelian category, we give a categorical construction of the push forward of an internal pre-crossed module, generalizing the pushout of a short exact sequence in abelian categories. The main properties of the push forward are discussed. A simplified version is given for action accessible categories, providing examples in the categories of rings and Lie algebras. We show that push forwards can be used to obtain the crossed module version of the comprehensive factorization for internal groupoids.

An ergonomic approach of commercial websites : from consumer perception to consumer behavior

2011

Pas de résumé en anglais

AIOC2: A deep Q-learning approach to autonomic I/O congestion control in Lustre

2021

Abstract In high performance computing systems, I/O congestion is a common problem in large-scale distributed file systems. However, the current implementation mainly requires administrator to manually design low-level implementation and optimization, we proposes an adaptive I/O congestion control framework, named AIOC 2 , which can not only adaptively tune the I/O congestion control parameters, but also exploit the deep Q-learning method to start the training parameters and optimize the tuning for different types of workloads from the server and the client at the same time. AIOC 2 combines the feedback-based dynamic I/O congestion control and deep Q-learning parameter tuning technology to …

Evaluating the impact of friends in predicting user’s availability in online social networks

2017

In recent years, Online Social Networks (OSNs) have changed the way people connect and interact with each other. Indeed, most people have registered an account on some popular OSNs (such as Facebook, or Google+) which is used to access the system at different times of the days, depending on their life and habits. In this context, understanding how users connect to the OSNs is of paramount importance for both the protection of their privacy and the OSN’s provider (or third-party applications) that want to exploit this information. In this paper, we study the task of predicting the availability status (online/offline) of the OSNs’ users by exploiting the availability information of their frie…

Strategies for accelerating ant colony optimization algorithms on graphical processing units

2007

Ant colony optimization (ACO) is being used to solve many combinatorial problems. However, existing implementations fail to solve large instances of problems effectively. In this paper we propose two ACO implementations that use graphical processing units to support the needed computation. We also provide experimental results by solving several instances of the well-known orienteering problem to show their features, emphasizing the good properties that make these implementations extremely competitive versus parallel approaches.

On the Greedy Algorithm for the Shortest Common Superstring Problem with Reversals

2015

We study a variation of the classical Shortest Common Superstring (SCS) problem in which a shortest superstring of a finite set of strings $S$ is sought containing as a factor every string of $S$ or its reversal. We call this problem Shortest Common Superstring with Reversals (SCS-R). This problem has been introduced by Jiang et al., who designed a greedy-like algorithm with length approximation ratio $4$. In this paper, we show that a natural adaptation of the classical greedy algorithm for SCS has (optimal) compression ratio $\frac12$, i.e., the sum of the overlaps in the output string is at least half the sum of the overlaps in an optimal solution. We also provide a linear-time implement…

Scheduling on Two Types of Resources: a Survey

2020

International audience; We study the problem of executing an application represented by a precedence task graph on a parallel machine composed of standard computing cores and accelerators. Contrary to most existing approaches, we distinguish the allocation and the scheduling phases and we mainly focus on the allocation part of the problem: choose the most appropriate type of computing unit for each task. We address both off-line and on-line settings and design generic scheduling approaches. In the first case, we establish strong lower bounds on the worst-case performance of a known approach based on Linear Programming for solving the allocation problem. Then, we refine the scheduling phase …

Polarimetric image augmentation

2021

Robotics applications in urban environments are subject to obstacles that exhibit specular reflections hampering autonomous navigation. On the other hand, these reflections are highly polarized and this extra information can successfully be used to segment the specular areas. In nature, polarized light is obtained by reflection or scattering. Deep Convolutional Neural Networks (DCNNs) have shown excellent segmentation results, but require a significant amount of data to achieve best performances. The lack of data is usually overcomed by using augmentation methods. However, unlike RGB images, polarization images are not only scalar (intensity) images and standard augmentation techniques cann…