A note on growth and inflation

A simple exercise on growth and inflationary financing of public expenditures is presented in this note. In a parameterized overlapping generations mode1 where government expenses positivc1y affects the growth rate of human capital, steady state capital and output increase with inflation, reproducing the so called Tobin effect. For large inflation rates, however, government authorities cannot affect real variables and there are only nominal effects. It is also shown that the optimal policy implies some inflation but not growth maximization.

Inflation, welfare and public expenditures

This paper studies welfare effects of monetary policy in an overlapping generations model with capital and no form of taxation other than inflation. Public expenditures have a positive effect on labor productivity. The main result of the paper is that an expansive monetary policy can be welfare improving, at least for ìsmall enoughî inflation rates, and that there is an optimal inflation rate. Growth maximization, however, is never optimal. Steady-state capital and output increase with inflation, reproducing the so-called Tobin effect. For large inflation rates, however, the government authorities cannot affect real variables and there are only nominal effects.

Aggregate uncertainty, disappointment aversion and the business cycle

We investigate the eff ect of aggregate uncertainty shocks on real variables. More speci fically, we introduce a shock in the volatility of productivity in an RBC model with long-run volatility risk and preferences that exhibit generalised disappointment aversion. We find that, when combined with a negative productivity shock, a volatility shock leads to further decline in real variables, such as output, consumption, hours worked and investment. For instance, out of the 2% decrease in output as a result of both shocks, we attribute 0.25% to the e ffect of an increase in volatility. We also fi nd that this e ffect is the same as the one obtained in a model with Epstein-Zin- Weil preferences, but higher than that of a model with expected utility. Moreover, GDA preferences yield superior asset pricing results, when compared to both Epstein-Zin-Weil preferences and expected utility.

VAr planning using genetic algorithm and linear programming

A combined methodology consisting of successive linear programming (SLP) and a simple genetic algorithm (SGA) solves the reactive planning problem. The problem is divided into operating and planning subproblems; the operating subproblem, which is a nonlinear, ill-conditioned and nonconvex problem, consists of determining the voltage control and the adjustment of reactive sources. The planning subproblem consists of obtaining the optimal reactive source expansion considering operational, economical and physical characteristics of the system. SLP solves the optimal reactive dispatch problem related to real variables, while SGA is used to determine the necessary adjustments of both the binary and discrete variables existing in the modelling problem. Once the set of candidate busbars has been defined, the program implemented gives the location and size of the reactive sources needed, if any, to maintain the operating and security constraints.

Modeling regional macroeconomic interactions: situation and perspectives for macroeconomic coordination in Latin America. Background paper prepared for the REDIMA workshop on Modeling Macroeconomic Coordination in the Andean Community, (Santiago, Chile 22 October 2003)""

Includes bibliography

Policies for competitiveness

Includes bibliography

Máximos e mínimos com proposta de aplicação para funções quadráticas

Pós-graduação em Matemática em Rede Nacional - IBILCE

Daily monetary impulses and security prices

This paper uses Swiss data to study the real long-run effects of monetary policy. Daily unexpected changes in the monetary base are found to be negatively correlated with security price changes. This result is unaffected when, implicitly following Geske and Roll (1983), we try to measure the autonomous component of monetary policy by taking into account a reaction function of monetary policy to changes in real variables.

Algoritmos para mineria de datos con redes de neuronas

Este trabajo propone una serie de algoritmos con el objetivo de extraer información de conjuntos de datos con redes de neuronas. Se estudian dichos algoritmos con redes de neuronas Enhenced Neural Networks (ENN), debido a que esta arquitectura tiene algunas ventajas cuando se aproximan funciones mediante redes neuronales. En la red ENN los pesos de la matriz principal varián con cada patrón, por lo que se comete un error menor en la aproximación. Las redes de neuronas ENN reúnen la información en los pesos de su red auxiliar, se propone un método para obtener información de la red a través de dichos pesos en formas de reglas y asignando un factor de certeza de dichas reglas. La red ENN obtiene un error cuadrático medio menor que el error teórico de una aproximación matemática por ejemplo mediante polinomios de Taylor. Se muestra como una red ENN, entrenada a partir un conjunto de patrones obtenido de una función de variables reales, sus pesos asociados tienen unas relaciones similares a las que se veri_can con las variables independientes con dicha función de variables reales. Las redes de neuronas ENN aproximan polinomios, se extrae conocimiento de un conjunto de datos de forma similar a la regresión estadística, resolviendo de forma más adecuada el problema de multicolionalidad en caso de existir. Las relaciones a partir de los pesos asociados de la matriz de la red auxiliar se obtienen similares a los coeficientes de una regresión para el mismo conjunto numérico. Una red ENN entrenada a partir de un conjunto de datos de una función boolena extrae el conocimiento a partir de los pesos asociados, y la influencia de las variables de la regla lógica de la función booleana, queda reejada en esos pesos asociados a la red auxiliar de la red ENN. Se plantea una red de base radial (RBF) para la clasificación y predicción en problemas forestales y agrícolas, obteniendo mejores resultados que con el modelo de regresión y otros métodos. Los resultados con una red RBF mejoran al método de regresión si existe colinealidad entre los datos que se dispone y no son muy numerosos. También se detecta que variables tienen más importancia en virtud de la variable pronóstico. Obteniendo el error cuadrático medio con redes RBF menor que con otros métodos, en particular que con el modelo de regresión. Abstract A series of algorithms is proposed in this study aiming at the goal of producing information about data groups with a neural network. These algorithms are studied with Enheced Neural Networks (ENN), owing to the fact that this structure shows sever advantages when the functions are approximated by neural networks. Main matrix weights in th ENN vary on each pattern; so, a smaller error is produced when approximating. The neural network ENN joins the weight information contained in their auxiliary network. Thus, a method to obtain information on the network through those weights is proposed by means of rules adding a certainty factor. The net ENN obtains a mean squared error smaller than the theorical one emerging from a mathematical aproximation such as, for example, by means of Taylor's polynomials. This study also shows how in a neural network ENN trained from a set of patterns obtained through a function of real variables, its associated weights have relationships similar to those ones tested by means of the independent variables connected with such functions of real variables. The neural network ENN approximates polynomials through it information about a set of data may be obtained in a similar way than through statistical regression, solving in this way possible problems of multicollinearity in a more suitable way. Relationships emerging from the associated weights in the auxiliary network matrix obtained are similar to the coeficients corresponding to a regression for the same numerical set. A net ENN trained from a boolean function data set obtains its information from its associated weights. The inuence of the variables of the boolean function logical rule are reected on those weights associated to the net auxiliar of the ENN. A radial basis neural networks (RBF) for the classification and prediction of forest and agricultural problems is proposed. This scheme obtains better results than the ones obtained by means of regression and other methods. The outputs with a net RBF better the regression method if the collineality with the available data and their amount is not very large. Detection of which variables are more important basing on the forecast variable can also be achieved, obtaining a mean squared error smaller that the ones obtained through other methods, in special the one produced by the regression pattern.

Serie di Fourier e altre rappresentazioni analitiche delle funzioni di una variabile reale.

Available on demand as hard copy or computer file from Cornell University Library.

Fondamenti per la teorica delle funzioni di variabili reali.

Available on demand as hard copy or computer file from Cornell University Library.

An introduction to the study of the elements of the differential and integral calculus.

Available on demand as hard copy or computer file from Cornell University Library.

Resource allocation in sparse graphs

Resource allocation in sparsely connected networks, a representative problem of systems with real variables, is studied using the replica and Bethe approximation methods. An efficient distributed algorithm is devised on the basis of insights gained from the analysis and is examined using numerical simulations,showing excellent performance and full agreement with the theoretical results. The physical properties of the resource allocation model are discussed.

Equilibration through local information exchange in networks

We study the equilibrium states of energy functions involving a large set of real variables, defined on the links of sparsely connected networks, and interacting at the network nodes, using the cavity and replica methods. When applied to the representative problem of network resource allocation, an efficient distributed algorithm is devised, with simulations showing full agreement with theory. Scaling properties with the network connectivity and the resource availability are found. © 2006 The American Physical Society.

Message passing for task redistribution on sparse graphs

The problem of resource allocation in sparse graphs with real variables is studied using methods of statistical physics. An efficient distributed algorithm is devised on the basis of insight gained from the analysis and is examined using numerical simulations, showing excellent performance and full agreement with the theoretical results.