Search results for " scheme"
showing 10 items of 323 documents
A fast heuristic for solving the D1EC coloring problem
2010
In this paper we propose an efficient heuristic for solving the Distance-1 Edge Coloring problem (D1EC) for the on-the-fly assignment of orthogonal wireless channels in wireless as soon as a topology change occurs. The coloring algorithm exploits the simulated annealing paradigm, i.e., a generalization of Monte Carlo methods for solving combinatorial problems. We show that the simulated annealing-based coloring converges fast to a sub optimal coloring scheme even for the case of dynamic channel allocation. However, a stateful implementation of the D1EC scheme is needed in order to speed-up the network coloring upon topology changes. In fact, a stateful D1EC reduces the algorithm’s convergen…
Fully Polynomial Time Approximation Scheme for the Two-Parallel Capacitated Machines Scheduling Problem Under Unavailability Constraint
2010
Abstract Decision Support Systems (DSS) ensure the computer-based support for the conscientious decision-making in solving problems that require a large amount of information processing and complex scenarios. DSS for Transportation (DSST) are intelligent systems that are used at operational and organizational management levels. Operating a DSST in a public transportation web-based monitoring system is presented in this paper.
Distributed Resource Allocation in Underlay Multicast D2D Communications
2021
Multicast device-to-device communications operating underlay with cellular networks is a spectral efficient technique for disseminating data to nearby receivers. However, due to the critical challenge of having an intelligent interference coordination between multicast groups along with the cellular network, it is necessary to judiciously perform resource allocation for the combined network. In this work, we present a framework for a joint channel and power allocation strategy to maximize the sum rate of the combined network while guaranteeing minimum rate to individual groups and cellular users. The objective function is augmented by an austerity function that penalizes excessive assignmen…
Error bounds for a convexity-preserving interpolation and its limit function
2008
AbstractError bounds between a nonlinear interpolation and the limit function of its associated subdivision scheme are estimated. The bounds can be evaluated without recursive subdivision. We show that this interpolation is convexity preserving, as its associated subdivision scheme. Finally, some numerical experiments are presented.
New analytical approach to analyze the nonlinear regime of stochastic resonance
2015
We propose some approximate methods to explore the nonlinear regime of the stochastic resonance phenomenon. These approximations correspond to different truncation schemes of cumulants. We compare the theoretical results for the signal power amplification, obtained by using ordinary cumulant truncation schemes, that is Gaussian and excess approximations, the modified two-state approximation with those obtained by numerical simulations of the Langevin equation describing the dynamics of the system.
Representation of capacity drop at a road merge via point constraints in a first order traffic model
2018
We reproduce the capacity drop phenomenon at a road merge by implementing a non-local point constraint at the junction in a first order traffic model. We call capacity drop the situation in which the outflow through the junction is lower than the receiving capacity of the outgoing road, as too many vehicles trying to access the junction from the incoming roads hinder each other. In this paper, we first construct an enhanced version of the locally constrained model introduced by Haut et al. (Proceedings 16th IFAC World Congress. Prague, Czech Republic 229 (2005) TuM01TP/3), then we propose its counterpart featuring a non-local constraint and finally we compare numerically the two models by c…
ε-Regularized two-level optimization problems: Approximation and existence results
2006
The purpose of this work is to improve some results given in [12], relating to approximate solutions for two-level optimization problems. By considering an e-regularized problem, we get new properties, under convexity assumptions in the lower level problems. In particular, we prove existence results for the solutions to the e-regularized problem, whereas the initial two-level optimization problem may fail to have a solution. Finally, as an example, we consider an approximation method with interior penalty functions.
Convergence of a high-order compact finite difference scheme for a nonlinear Black–Scholes equation
2004
A high-order compact finite difference scheme for a fully nonlinear parabolic differential equation is analyzed. The equation arises in the modeling of option prices in financial markets with transaction costs. It is shown that the finite difference solution converges locally uniformly to the unique viscosity solution of the continuous equation. The proof is based on a careful study of the discretization matrices and on an abstract convergence result due to Barles and Souganides.
Simulation of extreme heat events over the Valencia coastal region: Sensitivity to initial conditions and boundary layer parameterizations
2019
The Valencia coastal region (Western Mediterranean) is especially sensitive to extreme heat events, where they are really common. However, due to its geophysical characteristics and climatic conditions, the incidence of high and extreme temperatures may still be modulated over this area by means of sea breeze circulations, defining a Sea Breeze Convergence Zone (SBCZ) due to the meet and interaction of these mesoscale conditions and Western synoptic-scale wind regimes. A proper definition of this convergence zone is of significant importance over the study area for the simulation and forecast of intense-heat meteorological events. This study analyses a week period in August 2010 over this a…
Adaptive surface compression with geometric wavelets.
2008
The recent advances in computer graphics and digitization allow access to an ever finer three-dimensional modelling of the world. The critical challenges with 3D models lie in their transmission and rendering, which must fit the heterogeneity of the end resources (network bandwidth, display terminals . . . ). In this context, this thesis investigates the progressive compression and transmission of 3D models, based on multiresolution analysis, to provide a scalable representation of these geometric models. This work is part of "CoSurf", a collaborative research project involving LIRIS laboratory and France Télécom R&D in Rennes. The proposed hierarchical compression method is based on a wave…