Solving dynamic stochastic economic models by mathematical programming decomposition methods.

Discrete-time optimal control problems arise naturally in many economic problems. Despite the rapid growth in computing power and new developments in the literature, many economic problems are still quite challenging to solve. Economists are aware of the limitations of some of these approaches for solving these problems due to memory and computational requirements. However, many of the economic models present some special structure that can be exploited in an efficient manner. This paper introduces a decomposition methodology, based on a mathematical programming framework, to compute the equilibrium path in dynamic models by breaking the problem into a set of smaller independent subproblems. We study the performance of the method solving a set of dynamic stochastic economic models. The numerical results reveal that the proposed methodology is efficient in terms of computing time and accuracyDynamic stochastic economic model; Computation of equilibrium; Mathematical programming; Decomposition techniques;

Evaluation of the Effects of Predicted Associativity on the Reliability and Performance of Mobile Ad Hoc Networks

Routing in Mobile Ad Hoc Networks (MANETs) presents unique challenges not encountered in conventional networks. Predicted Associativity Routing (PAR) is a protocol designed to address reliability in MANETs. Using associativity information, PAR calculates the expected lifetime of neighboring links. Nodes use this expected lifetime, and their neighbor\u27s connectivity to determine a residual lifetime. The routes are selected from those with the longest residual lifetimes. In this way, PAR attempts to improve the reliability of discovered routes. PAR is compared to AODV using a variety of reliability and performance metrics. Despite its focus on reliability, PAR does not provide more reliable routes. Rather, AODV produces routes which last as much as three times longer than PAR. However, PAR delivers more data and has greater throughput. Both protocols are affected most by the node density of the networks. Node density accounts for 48.62% of the variation in route lifetime in AODV, and 70.66% of the variation in PAR. As node density increases from 25 to 75 nodes route lifetimes are halved, while throughput increases drastically with the increased routing overhead. Furthermore, PAR increases end-to-end delay, while AODV displays better efficiency

Path to perfection: The liberal social imaginary of International Relations

Camino de perfección es un título de una cierta raigambre en la literatura en castellano. Aquí se utiliza como figura que puede representar la idea ilustrada y teleológica de un avance de la humanidad hacia la perfección, el Bien, la Felicidad, etc. que es la columna vertebral del imaginario social de la modernidad liberal. Esta fe en el progreso y en el perfeccionamiento moral se mantiene a pesar de sucesivas catástrofes que jalonan, en este caso, la historia europea: desastres naturales, los menos, y desencadenados por los hombres, los más. Las relaciones internacionales son un ámbito donde este progreso puede ser puesto más en cuestiónCamino de perfección ─Path to perfection─ is a title with some tradition within Spanish literature. Here it is used as a literary figure that conveys the enlightened and teleological idea of a way forward of Humanity towards perfection. Such idea is the main pillar of the modern liberal social imaginary. This faith in progress and in moral improvement stands firm in spite of the catastrophes –manmade most of them- that mark European history. International Relations work as a domain where this progress is easily questioned

Dificultades en la práctica de gobernar. El riego de Lorca, Murcia y Cartagena (1617 - 1622)

Sin resume

Clio and Palas Atenea: Some notes on the role of History in the Theory of International Relations

Es posiblemente necesario en estos tiempos que los saberes humanos tengan que dividirse en disciplinas distintas. En algunos casos esta división es muy clara, pero en el campo de las humanidades y de las “ciencias sociales” esta división, por otra parte, necesaria, puede ser —llevándose, como se lleva a un extremo— frustrante y empobrecedora. Ferenc Fehér sostenía que, en última instancia, todas las disciplinas y “ciencias” sociales podían reducirse a la Historia y a la Filosofía. En este artículo se argumenta, por parte de un académico de Teoría de Relaciones Internacionales, la necesidad de la Historia para aquella disciplina. Se enumeran algunos puntos de encuentro y se sostiene que Historia es necesaria para la Teoría de Relaciones Intencionales que el autor propone y que Teoría de Relaciones Internacionales puede ser útil a la Historia. La conclusión es la defensa de la historicidad radical de los hechos, eventos y procesos en las relaciones humanast is possible necessary in our times that human knowledges ought to be divided into distinct disciplines. In some cases, this division is clear, but in the field of humanities and social sciences this division, otherwise necessary, can be —taken to an extreme— frustrating and impoverishing. Frenc Fehér stated that, at the end, all the disciplines and the social sciences have, as ultimate reference, Philosophy and History. In these pages I argue, as an International Relations Theory academic, for the need of history for the former. I enumerate some meeting points and argue why History in indispensable for IRT and what of IRT would be necessary for History. My conclusion is to stand up and defend the idea of the radical historicity of facts, events and processes in human relations

Un problema de conjuntos en computación distribuida

En matemática existen muchos problemas que involucran conjuntos. Generalmente, estos problemas están relacionados con un grupo de elementos que deben cumplir una cierta propiedad