Showing papers by "University of Marne-la-Vallée published in 2015"
TL;DR: In this article, the authors proposed a technology roadmapping (TRM) with seven layers based on SAO analysis, which is composed by material, technology, influencing factor, component, product, goal and application area.
51 citations
05 Jan 2015
TL;DR: A system that is almost domain independent and consists of standard segmentation methods that performs better, or equals, all previous published empirical results on all available facade benchmark datasets.
Abstract: In this paper we propose a system for the problem of facade segmentation. Building facades are highly structured images and consequently most methods that have been proposed for this problem, aim to make use of this strong prior information. We are describing a system that is almost domain independent and consists of standard segmentation methods. A sequence of boosted decision trees is stacked using auto-context features and learned using the stacked generalization technique. We find that this, albeit standard, technique performs better, or equals, all previous published empirical results on all available facade benchmark datasets. The proposed method is simple to implement, easy to extend, and very efficient at test time inference.
35 citations
25 Apr 2015
TL;DR: A new model based on proportional integral derivative controller is proposed in order to dynamically select the security level adapted to QoS requirements while considering the energy consumption and the results obtained with the simulation illustrate that the security is always ensured with lower costs in terms of QoS and energy consumption.
Abstract: In this paper, we focus on the coexistence between security and quality of services QoS guarantee in wireless sensor networks. The idea is to integrate the security services: authentication, integrity, confidentiality, and non-repudiation with QoS guarantee. In literature, the major proposed solutions consider QoS and security separately. In addition, it has been shown that it is difficult to offer the end-users multiple levels of security while offering a high level of QoS, because security and QoS are opposite parameters. To tackle this main issue, we propose a new model based on proportional integral derivative controller in order to dynamically select the security level adapted to QoS requirements while considering the energy consumption. The stability parameters in terms of security level and QoS are taken into account by using the principle of proportional integral derivative which is based on the past parameters history, the current system state present, and the predictable system change future. In order to evaluate the proposed model, we consider the case of routing protocol, and we introduce this model into the well-known ad-hoc on-demand distance vector AODV protocol called QwS-AODV protocol. Unlike the classical secure AODV, the QwS-AODV protocol aims at adding or removing security services dynamically according to the network performance. Moreover, the validation and the evaluation of the proposed solution are carried out by simulation. The performance evaluation is presented with different network parameters such as throughput, delay, energy consumption, and security services. In addition, the comparison with a classical secure AODV is carried out, and the results obtained with the simulation illustrate that the security is always ensured with lower costs in terms of QoS and energy consumption. Copyright © 2014 John Wiley & Sons, Ltd.
23 citations
TL;DR: This paper showed that convex measures in high dimensions are concentrated in an annulus between two convex sets (as in the log-concave case) despite their possibly having much heavier tails.
Abstract: We establish sharp exponential deviation estimates of the information content as well as a sharp bound on the varentropy for the class of convex measures on Euclidean spaces. This generalizes a similar development for log-concave measures in the recent work of Fradelizi, Madiman and Wang (2016). In particular, our results imply that convex measures in high dimensions are concentrated in an annulus between two convex sets (as in the log-concave case) despite their possibly having much heavier tails. Various tools and consequences are developed, including a sharp comparison result for Renyi entropies, inequalities of Kahane-Khinchine type for convex measures that extend those of Koldobsky, Pajor and Yaskin (2008) for log-concave measures, and an extension of Berwald's inequality (1947).
16 citations
07 Sep 2015
TL;DR: Results from scalable simulations using realistic vehicular mobility traces show that InfoRank is an efficient ranking algorithm to find top information facilitator vehicles in comparison to other ranking metrics in the literature.
Abstract: Modern cars are transforming towards autonomous cars capable to make intelligent decisions to facilitate our travel comfort and safety. Such "Smart Vehicles" are equipped with various sensor platforms and cameras to collect, store and share tremendous amount of heterogeneous data from urban streets. This paper addresses the efficient collection and distribution of such massive data by allowing a popular Smart Vehicle to autonomously decide its user relevant importance in the vehicular network without relying on the infrastructure network. Therefore, we propose an Information-Centric algorithm, "InfoRank" for a vehicle to rank different location- dependent information associated to it. It then uses the information importance to analytically find its influence in the network. InfoRank is the first step towards identifying the best information hubs to be used in the network for the efficient collection, storage and distribution of urban sensory information. Results from scalable simulations using realistic vehicular mobility traces show that InfoRank is an efficient ranking algorithm to find top information facilitator vehicles in comparison to other ranking metrics in the literature.
15 citations
TL;DR: This paper deals with the superreplication of non-path-dependent European claims under additional convex constraints on the number of shares held in the portfolio, and introduces the notion of first order viability property for linear parabolic PDEs.
Abstract: This paper deals with the superreplication of non-path-dependent European claims under additional convex constraints on the number of shares held in the portfolio. The corresponding superreplication price of a given claim has been widely studied in the literature, and its terminal value, which dominates the claim of interest, is the so-called facelift transform of the claim. We investigate under which conditions the superreplication price and strategy of a large class of claims coincide with the exact replication price and strategy of the facelift transform of this claim. In one dimension, we observe that this property is satisfied for any local volatility model. In any dimension, we exhibit an analytical necessary and sufficient condition for this property, which combines the dynamics of the stock together with the characteristics of the closed convex set of constraints. To obtain this condition, we introduce the notion of first order viability property for linear parabolic PDEs. We investigate in detail several practical cases of interest: multidimensional Black–Scholes model, non-tradable assets, and short-selling restrictions.
14 citations
TL;DR: The authors showed that the drying rate of plaster pastes is significantly lower than that expected for a pure liquid evaporating from a simple homogeneous porous medium, which is enhanced by the air flow velocity and the initial solid/water ratio.
Abstract: We show that the drying rate of plaster pastes is significantly lower than that expected for a pure liquid evaporating from a simple homogeneous porous medium. This effect is enhanced by the air flow velocity and the initial solid/water ratio. Further tests under various conditions and with the help of additional techniques (MRI, ESEM, Microtomography) for measuring the drying rate and local characteristics (water content, porosity) prove that this effect is due to the crystallization of gypsum ions below the sample free surface, which creates a dry region and decreases the drying rate by increasing the length of the path the vapor has to follow before reaching the free surface.
14 citations
28 Sep 2015
TL;DR: CarRank, an Information-Centric algorithm for a vehicle to first rank different location-aware information, is presented and results show that CarRank is an efficient ranking algorithm to identify socially important vehicles in comparison to other ranking metrics used in the literature.
Abstract: Future cars are becoming powerful sensor platforms capable to collect, store and share large amount of sensory data by constant monitoring of urban streets. It is quite challenging to upload such data from all vehicles to the infrastructure due to limited bandwidth resources and high upload cost. This invoke the need to identify the appropriate vehicles within the Vehicular Ad-hoc Network, that are important for different urban sensing tasks based on their natural mobility and availability. This paper address this problem leveraging the self-decision making ability of a "Smart Vehicle" regarding its importance in the network. To do so, we present Car Rank, an Information-Centric algorithm for a vehicle to first rank different location-aware information. It then uses the information importance, its spatio-temporal availability and neighborhood topology to analytically find its relative importance in the network. Car Rank is the first step towards identifying the best set of information hubs to be used in the network for the efficient collection, storage and distribution of urban sensory information. We evaluate Car Rank under a scalable simulation environment using realistic vehicular mobility traces. Results show that Car Rank is an efficient ranking algorithm to identify socially important vehicles in comparison to other ranking metrics used in the literature.
14 citations
TL;DR: In this paper, the authors characterize the asymptotic behavior of value functions in the control of piecewise deterministic Markov processes (PDMP) of switch type under nonexpansive assumptions.
Abstract: We aim at characterizing the asymptotic behavior of value functions in the control of piecewise deterministic Markov processes (PDMP) of switch type under nonexpansive assumptions. For a particular class of processes inspired by temperate viruses, we show that uniform limits of discounted problems as the discount decreases to zero and time-averaged problems as the time horizon increases to infinity exist and coincide. The arguments allow the limit value to depend on initial configuration of the system and do not require dissipative properties on the dynamics. The approach strongly relies on viscosity techniques, linear programming arguments, and coupling via random measures associated to PDMP. As an intermediate step in our approach, we present the approximation of discounted value functions when using piecewise constant (in time) open-loop policies.
7 citations
TL;DR: Bouchitte et al. as mentioned in this paper proposed a deterministic dispersion law for dielectric parallel nanorods with a random permittivity e(ω) whose law is represented by a density on a window Δh =( a �,a + ) × (0,h ) of the complex plane.
Abstract: In (G. Bouchittea nd D. Felbacq,C. R. Math. Acad. Sci. Paris 339 (2004) 377-382; D. Felbacq and G. Bouchitte, Phys. Rev. Lett. 94 (2005) 183902; D. Felbacq and G. Bouchitte, New J. Phys. 7 (2005) 159), a theory for artificial magnetism in two-dimensional photonic crystals has been developed for large wavelength using homogenization techniques. In this paper we pursue this approach within a rigorous stochastic framework: dielectric parallel nanorods are randomly disposed, each of them having, up to a large scaling factor, a random permittivity e(ω) whose law is represented by a density on a window Δh =( a � ,a + ) × (0 ,h ) of the complex plane. We give precise conditions on the initial probability law (permittivity, radius and position of the rods) under which the homogenization process can be performed leading to a deterministic dispersion law for the effective permeability with possibly negative real part. Subsequently a limit analysis h → 0, accounting a density law of e which concentrates on the real axis, reveals singular behavior due to the presence of resonances in the microstructure.
6 citations
TL;DR: In this paper, the authors investigate non-compact mean-convex Alexandrov embedded surfaces in the round unit 3-sphere, and show under which conditions it is possible to continuously deform these preserving mean-Convex Alexev embeddedness.
Abstract: We investigate non-compact mean-convex Alexandrov embedded surfaces in the round unit 3-sphere, and show under which conditions it is possible to continuously deform these preserving mean-convex Alexandrov embeddedness.
Posted Content•
TL;DR: Gawrychowski et al. as discussed by the authors showed that for a closely related notion of maximal δ-subrepetition (maximal factors of exponent between $1+δ$ and $2), there is an algorithm with time complexity O(n/δ) for computing all maximal α-gapped repeats.
Abstract: Following (Kolpakov et al., 2013; Gawrychowski and Manea, 2015), we continue the study of {\em $\alpha$-gapped repeats} in strings, defined as factors $uvu$ with $|uv|\leq \alpha |u|$. Our main result is the $O(\alpha n)$ bound on the number of {\em maximal} $\alpha$-gapped repeats in a string of length $n$, previously proved to be $O(\alpha^2 n)$ in (Kolpakov et al., 2013). For a closely related notion of maximal $\delta$-subrepetition (maximal factors of exponent between $1+\delta$ and $2$), our result implies the $O(n/\delta)$ bound on their number, which improves the bound of (Kolpakov et al., 2010) by a $\log n$ factor.
We also prove an algorithmic time bound $O(\alpha n+S)$ ($S$ size of the output) for computing all maximal $\alpha$-gapped repeats. Our solution, inspired by (Gawrychowski and Manea, 2015), is different from the recently published proof by (Tanimura et al., 2015) of the same bound. Together with our bound on $S$, this implies an $O(\alpha n)$-time algorithm for computing all maximal $\alpha$-gapped repeats.
19 Aug 2015-The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences
TL;DR: In this article, the authors present a feedback on the design of two low-altitude remote sensing sensors for the study of natural areas, and present a design of the sensors.
Abstract: The recent years have shown a growing interest in low-altitude remote sensing for the study of natural areas. But natural environments lead to many constraints on acquisition sensors, which add to operational and carriers constraints. This article is a feedback on the design of two of these sensors.
TL;DR: In the context of sustainability, life cycle approaches are becoming increasingly popular for the assessment of potential impacts of a product or a system, from raw materials production to decommis... as mentioned in this paper.
Abstract: In the context of sustainability, life cycle approaches are becoming increasingly popular for the assessment of potential impacts of a product or a system, from raw materials production to decommis...
TL;DR: This model is motivated by studies of spiteful behavior in nature, including several species of parasitoid hymenoptera in which sperm-depleted males continue to mate despite not being fertile.
Abstract: We study a generalization of the Wright–Fisher model in which some individuals adopt a behavior that is harmful to others without any direct advantage for themselves. This model is motivated by studies of spiteful behavior in nature, including several species of parasitoid hymenoptera in which sperm-depleted males continue to mate despite not being fertile. We first study a single reproductive season, then use it as a building block for a generalized Wright–Fisher model. In the large population limit, for male-skewed sex ratios, we rigorously derive the convergence of the renormalized process to a diffusion with a frequency-dependent selection and genetic drift. This allows a quantitative comparison of the indirect selective advantage with the direct one classically considered in the Wright–Fisher model. From the mathematical point of view, each season is modeled by a mix between samplings with and without replacement, and analyzed by a sort of “reverse numerical analysis”, viewing a key recurrence relation as a discretization scheme for a PDE. The diffusion approximation is then obtained by classical methods.
19 Oct 2015
TL;DR: This work proposes a new cross-layer design based on multiple transmit and receive antennas (MIMO) capabilities, called MIMOMAX, and shows that MIMOAX is robust and resists to the early network saturation problem.
Abstract: In Single-Input Single-Output (SISO) wireless multi-hop networks, when two or more stations attempt to transmit at the same time in the same vicinity area, a collision will occur. In this case, the collided packets are discarded and then retransmitted later. In order to deal with collision and to maximize the system's throughput, we propose a new cross-layer design based on multiple transmit and receive antennas (MIMO) capabilities, called MIMOMAX. Transmit filter, receive filter and channel state information (CSI) are exchanged between the PHY and MAC layers to optimize the scheduling of simultaneous transmissions on the same channel. The performance evaluation is conducted using OPNET simulation tool. The results obtained through extensive simulations are compared with those of IEEE 802.11b/g/n single-hop and multi-hop wireless networks. We show that MIMOMAX is less efficient (low throughput and long delays) for single-hop networks. This is due to an under-utilization of channel Degrees of Freedom (DoFs). However, it always performs better (high throughput and low packet delay) than the 802.11b/g/n wireless multi-hop networks: up to 30% and 87% as improvements in network throughput compared to the IEEE 802.11n and IEEE 802.11g networks respectively. In addition, we illustrate that MIMOAX is robust and resists to the early network saturation problem.
TL;DR: A robust observer design methodology to estimate tire forces in heavy-duty vehicles using low-cost sensors and observer-based numerical differentiators with finite-time convergence with small estimation error is presented.
Abstract: This paper presents a robust observer design methodology to estimate tire forces in heavy-duty vehicles. The proposed methodology uses low-cost sensors and observer-based numerical differentiators. In addition to the already available sensors, low-cost sensors from the CAN bus are employed to get additional measurements. Sliding mode differentiators are used to optimize the sensors' configuration. Validation of the proposed estimation methodology is made by comparing the results with that generated using the PROSPER software simulator. The finite-time convergence with small estimation error suggests that the proposed methodology is valid and can be applied in real time.
07 Oct 2015
TL;DR: This paper describes how to minimize the allocation done by the implementation of the JSR 292 on Android and presents a comparison of the execution time with and without the allocation minimization.
Abstract: To improve and simplify the implementation of dynamically typed languages on top of the Java virtual machine, Java 7 introduced a new instructions set as well as a new API specified by the JSR 292 [2]. Android, the Google operating system for embedded devices, uses for its applicative part a Java-based virtual machine called Dalvik. Android 292 is our implementation of the JSR 292 on top of Dalvik which uses a C interpreter for direct method handles and a Java flexible interpreter for the "combiner" method handles. The implementation presented in [7] is slowed down by several allocations done by the C interpreter and the combiner interpreter.This paper describes how we minimize the allocation done by our implementation of the JSR 292 on Android. First we explain how we avoid allocations from the C interpreter using a stack frame allocation (fake stack frame). Then we detail how we handle allocations from the combiner interpreter using a stack object (dual stack) allocated in the heap and avoid allocations done by the continuation mechanism.At the end, we present a comparison of the execution time with and without the allocation minimization. Even though the invoke-dynamic instruction with the dual stack implementation is slowed down by doing a fair amount of computations, the comparison shows that the dual stack implementation greatly improves the execution time.
01 Jan 2015
TL;DR: In this work, a solution is presented that enables to qualify and quantify the uncertainty of extracted information from linguistic treatment.
Abstract: In this work, we consider that a close collaboration between the research fields of Natural Language Processing and Knowledge Representation becomes essential to fulfill the vision of the Semantic Web. This will permit to retrieve information from vast amount of textual documents present on the Web and to represent these extractions in an amenable manner for querying and reasoning purposes. In such a context, uncertain, incomplete and ambiguous information must be handled properly. In the following, we present a solution that enables to qualify and quantify the uncertainty of extracted information from linguistic treatment.
01 Nov 2015
TL;DR: This work extends and adapt the lattice-based compute-and-forward coding scheme to the model of two transmitters communicating, simultaneously, with two destinations with the help of a half-duplex relay, and shows that this coding scheme can offer substantial gain over standard relaying techniques such that amplify- and-forward and decode-and -forward for this model.
Abstract: In this work, we study a Compound Multiple Access Relay Channel (C-MARC). The system is a simultaneous multicast network where all destinations are intended to receive and decode signals from all transmitters. Particularly, we focus on the model of two transmitters communicating, simultaneously, with two destinations with the help of a half-duplex relay. We extend and adapt the lattice-based compute-and-forward coding scheme to the model we study. This coding scheme is implemented at the relay and at the destinations through some modulo reduction operations. The relay computes one of the linear combinations and then forwards it, simultaneously to the destinations where the other linear combinations will be computed based on the direct transmissions. In this paper, we discuss the design criteria, and derive the allowed symmetric-rate. An optimization problem will then be formulated and solved through a Mixed Integer Quadratic Programming (MIQP) problem. The analysis shows that our coding scheme can offer substantial gain over standard relaying techniques such that amplify-and-forward and decode-and-forward for this model. We illustrate our results through some numerical examples.
01 Sep 2015
Posted Content•
TL;DR: In this paper, the authors consider the Dirichlet energy and find critical points of this energy with prescribed modulus on partial A and with prescribed degrees on the two connected components of the partial A. They then construct new immersed minimal surfaces with this property.
Abstract: Let $A \subset \mathbb{R} ^2 $ be a smooth doubly connected domain. We consider the Dirichlet energy $E(u)=\int_{A} |
abla u|^2$, where $u:A \rightarrow \mathbb{C}$, and look for critical points of this energy with prescribed modulus $|u|=1$ on $\partial A$ and with prescribed degrees on the two connected components of $\partial A$. This variational problem is a problem with lack of compactness hence we can not use the direct methods of calculus of variations. Our analysis relies on the so-called Hopf differential and on a strong link between this problem and the problem of finding all minimal surfaces bounded by two $p$ covering of circles in parallel planes. We then construct new immersed minimal surfaces in $\mathbb{R} ^3$ with this property. These surfaces are obtained by bifurcation from a family of $p$-coverings of catenoids.
TL;DR: HAL as discussed by the authors is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not, which may come from teaching and research institutions in France or abroad, or from public or private research centers.
Abstract: HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. Editorial Viscoplastic fluids: From theory to application 2013 Xavier Chateau, Anthony Wachs
01 Jan 2015
TL;DR: The so-called Malliavin–Thalmaier formula is given which allows us to represent the density of the law of a multi-dimensional random variable using just one integration by parts, and the properties of the density are investigated using this formula.
Abstract: We present an abstract setting for integration by parts inspired by the Malliavin calculus. In this framework we give the so-called Malliavin–Thalmaier formula which allows us to represent the density of the law of a multi-dimensional random variable using just one integration by parts, and we investigate the properties of the density using this formula. Finally we present a new argument, based on an interpolation method, which permits us to obtain regularity properties for the density under quite weak regularity assumptions.
Posted Content•
TL;DR: For a particular class of processes inspired by temperate viruses, it is shown that uniform limits of discounted problems as the discount decreases to zero and time-averaged problems asThe time horizon increases to infinity exist and coincide.
Abstract: We aim at characterizing the asymptotic behavior of value functions in the control of piece-wise deterministic Markov processes (PDMP) of switch type under nonexpansive assumptions. For a particular class of processes inspired by temperate viruses, we show that uniform limits of discounted problems as the discount decreases to zero and time-averaged problems as the time horizon increases to infinity exist and coincide. The arguments allow the limit value to depend on initial configuration of the system and do not require dissipative properties on the dynamics. The approach strongly relies on viscosity techniques, linear programming arguments and coupling via random measures associated to PDMP. As an intermediate step in our approach, we present the approximation of discounted value functions when using piecewise constant (in time) open-loop policies.
01 Jan 2015
TL;DR: In this paper, a methode de modelisation probabiliste ainsi qu’une methodologie d’identification inverse (a partir de donnees experimentales) sont enfin illustrees sur des potentiels isotropes classiques tels que les polynomials de Mooney-Rivlin et d'Ogden.
Abstract: Dans ce travail, on s’interesse a la construction, par la theorie de l’information, d’une classe de potentiels hyperelastiques stochastiques satisfaisant des proprietes fondamentales associees a des theoremes d’existence [1]. Un generateur base sur la resolution, a partir d’un schema numerique adaptatif [4], d’une equation differentielle stochastique d’Ito est ensuite introduit et permet d’echantillonner les potentiels hyperelastiques aleatoires ainsi construits. La methode de modelisation probabiliste ainsi qu’une methodologie d’identification inverse (a partir de donnees experimentales) sont enfin illustrees sur des potentiels isotropes classiques tels que les potentiels de Mooney-Rivlin et d’Ogden. Mots clefs :Hyperelasticite,modele probabiliste, principe dumaximumd’entropie, equations differentielles stochastiques