Search results for "algorithm."
showing 10 items of 4617 documents
Semantic and Multi-scale BIM/CIM/LIM
2019
Compliance checking for building models, cities and territories involve formalizing a set of model schema knowledge and constraint. The objective of our study is to propose: an information model to federate heterogeneous data sources describing an urban area (building and building environment) along with a method for formally specifying of urban rules. The overall goal we pursue is to be able to query and to verify data against different regulations and/or requirements. The purpose of this article is to describe our approach for interoperability among different data sources (e.g. IFC, CityGML) thus creating a consistent description of an urban area.
Proceedings of 6th Linked Data in Architecture and Construction Workshop (LDAC2018)
2018
International audience
Inverse Tone Mapping Based upon Retina Response
2014
International audience; The development of high dynamic range (HDR) display arouses the research of inverse tone mapping methods, which expand dynamic range of the low dynamic range (LDR) image to match that of HDR monitor. This paper proposed a novel physiological approach, which could avoid artifacts occurred in most existing algorithms. Inspired by the property of the human visual system (HVS), this dynamic range expansion scheme performs with a low computational complexity and a limited number of parameters and obtains high-quality HDR results. Comparisons with three recent algorithms in the literature also show that the proposed method reveals more important image details and produces …
Advanced 3D movement analysis algorithms for robust functional capacity assessment.
2017
SummaryObjectives: We developed a novel system for in home functional capacities assessment in frail older adults by analyzing the Timed Up and Go movements. This system aims to follow the older people evolution, potentially allowing a forward detection of motor decompensation in order to trigger the implementation of rehabilitation. However, the pre-experimentations conducted on the ground, in different environments, revealed some problems which were related to KinectTM operation. Hence, the aim of this actual study is to develop methods to resolve these problems.Methods: Using the KinectTM sensor, we analyze the Timed Up and Go test movements by measuring nine spatio-temporal parameters, …
Embedded multi-spectral image processing for real-time medical application
2016
International audience; The newly introduced Kubelka-Munk Genetic Algorithm (KMGA) is a promising technique for the assessment of skin lesions from multi-spectral images. Using five skin parameter maps such as concentration or epidermis/dermis thickness, this method combines the Kubelka-Munk Light-Tissue interaction model and Genetic Algorithm optimization process to produce a quantitative measure of cutaneous tissue. Up to the present, variant improved KMGA implementations have been successfully realized using the recent parallel computing techniques. However, all these achievements are based on the multi-core CPUs. This results in a quite high cost and low practicability for the hardware …
Network architectures and energy efficiency for high performance data centers
2017
The increasing trend to migrate applications, computation and storage into more robust systems leads to the emergence of mega data centers hosting tens of thousands of servers. As a result, designing a data center network that interconnects this massive number of servers, and providing efficient and fault-tolerant routing service are becoming an urgent need and a challenge that will be addressed in this thesis. Since this is a hot research topic, many solutions are proposed like adapting new interconnection technologies and new algorithms for data centers. However, many of these solutions generally suffer from performance problems, or can be quite costly. In addition, devoted efforts have n…
Scheduling independent stochastic tasks on heterogeneous cloud platforms
2019
International audience; This work introduces scheduling strategies to maximize the expected number of independent tasks that can be executed on a cloud platform within a given budget and under a deadline constraint. The cloud platform is composed of several types of virtual machines (VMs), where each type has a unitexecution cost that depends upon its characteristics. The amount of budget spent during the execution of a task on a given VM is the product of its execution length by the unit execution cost of that VM. The execution lengths of tasks follow a variety of standard probability distributions (exponential, uniform, halfnormal, etc.), which is known beforehand and whose mean and stand…
Whole mirror duplication-random loss model and pattern avoiding permutations
2010
International audience; In this paper we study the problem of the whole mirror duplication-random loss model in terms of pattern avoiding permutations. We prove that the class of permutations obtained with this model after a given number p of duplications of the identity is the class of permutations avoiding the alternating permutations of length p2+1. We also compute the number of duplications necessary and sufficient to obtain any permutation of length n. We provide two efficient algorithms to reconstitute a possible scenario of whole mirror duplications from identity to any permutation of length n. One of them uses the well-known binary reflected Gray code (Gray, 1953). Other relative mo…
Scheduling independent stochastic tasks under deadline and budget constraints
2018
This article discusses scheduling strategies for the problem of maximizing the expected number of tasks that can be executed on a cloud platform within a given budget and under a deadline constraint. The execution times of tasks follow independent and identically distributed probability laws. The main questions are how many processors to enroll and whether and when to interrupt tasks that have been executing for some time. We provide complexity results and an asymptotically optimal strategy for the problem instance with discrete probability distributions and without deadline. We extend the latter strategy for the general case with continuous distributions and a deadline and we design an ef…
Probability and algorithmics: a focus on some recent developments
2017
Jean-François Coeurjolly, Adeline Leclercq-Samson Eds.; International audience; This article presents different recent theoretical results illustrating the interactions between probability and algorithmics. These contributions deal with various topics: cellular automata and calculability, variable length Markov chains and persistent random walks, perfect sampling via coupling from the past. All of them involve discrete dynamics on complex random structures.; Cet article présente différents résultats récents de nature théorique illustrant les interactions entre probabilités et algorithmique. Ces contributions traitent de sujets variés : automates cellulaires et calculabilité, chaînes de Mark…