3,677 research outputs found
Vintage Capital and the Dynamics of the AK Model
This paper analyzes the equilibrium dynamics of an AK-type endogenous growth model with vintage capital. The inclusion of vintage capital leads to oscillatory dynamics governed by replacement echoes, which additionally influence the intercept of the balanced growth path. These features, which are in sharp contrast to those from the standard AK model, can contribute to explaining the short-run deviations observed between investment and growth rates time series. To characterize the convergence properties and the dynamics of the model we develop analytical and numerical methods that should be of interest for the general resolution of endogenous growth models with vintage capital.
Peripartum cardiomyopathy (PPCM): anesthetic and obstetric monitoring, management and medico-legal aspects
Peripartum Cardiomyopathy (PPCM): anesthetic and obstetric monitoring, management and medico-legal aspect
Recommended from our members
Automated structure detection for distributed process optimization
The design and control of large-scale engineering systems, consisting of a number of interacting subsystems, is a heavily researched topic with relevance both for industry and academia. This paper presents two methodologies for optimal model-based decomposition, where an optimization problem is decomposed into several smaller sub-problems and subsequently solved by augmented Lagrangian decomposition methods. Large-scale and highly nonlinear problems commonly arise in process optimization, and could greatly benefit from these approaches, as they reduce the storage requirements and computational costs for global optimization. The strategy presented translates the problem into a constraint graph. The first approach uses a heuristic community detection algorithm to identify highly connected clusters in the optimization problem graph representation. The second approach uses a multilevel graph bisection algorithm to find the optimal partition, given a desired number of sub-problems. The partitioned graphs are translated back into decomposed sets of sub-problems with a minimal number of coupling constraints. Results show both of these methods can be used as efficient frameworks to decompose optimization problems in linear time, in comparison to traditional methods which require polynomial time.Author E. A. del Rio-Chanona would like to acknowledge CONACyT scholarship No. 522530 for funding this project. Author F. Fiorelli gratefully acknowledges the support from his family. The authors would also 27 like to thank Dr Bart Hallmark, University of Cambridge, for suggesting to employ as a demonstration the chemical system in Example 7.This is the author accepted manuscript. The final version is available from Elsevier via http://dx.doi.org/10.1016/j.compchemeng.2016.03.01
Evaluating the development potential for intermodal transportation centers using the Miami Intermodal Center (MIC)
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Architecture, 1996 [first author]; and, (M.S.)--Massachusetts Institute of Technology, Dept. of Urban Studies, 1996 [second author].Includes bibliographical references (leaves 143-151).by Omar F. del Rio and Donald R. Hackstaff.M.S
- …