نتایج جستجو برای: dynamic relaxation method

تعداد نتایج: 2030112  

2014
Sumit Kunnumkal Kalyan Talluri

The choice network revenue management model incorporates customer purchase behavior as a function of the offered products, and is the appropriate model for airline and hotel network revenue management, dynamic sales of bundles, and dynamic assortment optimization. The optimization problem is a stochastic dynamic program and is intractable. A certainty-equivalence relaxation of the dynamic progr...

Journal: :SIAM J. Numerical Analysis 2002
Muruhan Rathinam Linda R. Petzold

We describe a new iterative method, dynamic iteration using reduced order models (DIRM), for simulation of large scale modular systems using reduced order models that preserve the interconnection structure. This method may be compared to the waveform relaxation technique; however, unlike DIRM, waveform relaxation does not take advantage of model reduction techniques. The DIRM method involves si...

2016
Yoon-Chul Rhim A Naseri

This paper represents numerical simulation of fluid-structure interaction (FSI) system involving an incompressible viscous fluid and a lightweight elastic structure. We follow a semi-implicit approach in which we implicitly couple the added-mass term (pressure stress) of the fluid to the structure, while other terms are coupled explicitly. This significantly reduces the computational cost of th...

2009
Luis Gouveia Ana Paias Stefan Voß

The traveling purchaser problem (TPP) is the problem of determining a tour of a purchaser that needs to buy several items in different shops such that the total amount of travel and purchase costs is minimized. We study a version of the problem with additional constraints, namely, a limit on the maximum number of markets to be visited, a limit on the number of items bought per market and where ...

2003
Satya Prakash Mallick

A feature based image mosaicing algorithm is presented in this project. A relaxation based correspondence algrithm is used to first select corresponding corners in two images. RANSAC is used to estimate the homography relating the two images. The estimated homogrphy is refined using Newton's non-linear method. A dynamic programming based blending algorithm was used to seamlessly blend the two i...

Journal: :Physical chemistry chemical physics : PCCP 2011
Maria-Teresa Türke Marina Bennati

We propose the use of the pulse electron double resonance (ELDOR) method to determine the effective saturation factor of nitroxide radicals for dynamic nuclear polarization (DNP) experiments in liquids. The obtained values for the nitroxide radical TEMPONE-D,(15)N at different concentrations are rationalized in terms of spin relaxation and are shown to fulfil the Overhauser theory.

Journal: :Journal of magnetic resonance 2012
Nathaniel J Traaseth Fa-An Chao Larry R Masterson Silvia Mangia Michael Garwood Shalom Michaeli Burckhard Seelig Gianluigi Veglia

NMR relaxation methods probe biomolecular motions over a wide range of timescales. In particular, the rotating frame spin-lock R(1ρ) and Carr-Purcell-Meiboom-Gill (CPMG) R(2) experiments are commonly used to characterize μs to ms dynamics, which play a critical role in enzyme folding and catalysis. In an effort to complement these approaches, we introduced the Heteronuclear Adiabatic Relaxation...

2006
T. Hanney

We introduce a real-space renormalisation group procedure for driven diffusive systems which predicts both steady state and dynamic properties. We apply the method to the boundary driven asymmetric simple exclusion process and recover exact results for the steady state phase diagram, as well as the crossovers in the relaxation dynamics for each phase.

Journal: :SIAM J. Math. Analysis 2006
Carlota M. Cuesta Christian Schmeiser

For one-dimensional kinetic BGK models, regarded as relaxation models for scalar conservation laws with genuinely nonlinear fluxes, existence of small amplitude travelling waves is proven. Dynamic stability of these kinetic shock profiles is shown by extending a classical energy method for viscous regularizations of conservation laws.

2010

We describe an exact decoding algorithm for syntax-based statistical translation. The approach uses Lagrangian relaxation to decompose the decoding problem into tractable subproblems, thereby avoiding exhaustive dynamic programming. The method recovers exact solutions, with certificates of optimality, on over 97% of test examples; it has comparable speed to state-of-the-art decoders.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید