Solow Residuals without Capital Stocks

For more than fifty years, the Solow decomposition (Solow 1957) has served as the standard measurement of total factor productivity (TFP) growth in economics and management, yet little is known about its precision, especially when the capital stock is poorly measured. Using synthetic data generated from a prototypical stochastic growth model, we explore the quantitative extent of capital measurement error when the initial condition is unknown to the analyst and when capacity utilization and depreciation are endogenous. We propose two alternative measurements which eliminate capital stocks from the decomposition and significantly outperform the conventional Solow residual, reducing the root mean squared error in simulated data by as much as two-thirds. This improvement is inversely related to the sample size as well as proximity to the steady state. As an application, we compute and compare TFP growth estimates using data from the new and old German federal states.Total factor productivity, Solow residual, generalized differences, measurement error, Malmquist index

TFP Growth in Old and New Europe

Using Solow-Tornqvist residuals as well as two alternative measurements, we present estimates of total factor productivity (TFP) growth in a sample of 30 European economies for the period 1994-2005. In most of Western Europe, we find a deceleration of TFP growth since 2000. However, the economies of New Europe exhibit a higher level of TFP growth overall and have slowed less than those of Old Europe. In the new market economies of Central and Eastern Europe, we nd both high TFP growth as well as acceleration in the second half of the sample. Regression evidence from Western Europe suggests that product market regulation may adversely aect TFP growth and may thus impair convergence.Total factor productivity growth, Solow residual, product and labor market regulation

Planar Embeddings with Small and Uniform Faces

Motivated by finding planar embeddings that lead to drawings with favorable aesthetics, we study the problems MINMAXFACE and UNIFORMFACES of embedding a given biconnected multi-graph such that the largest face is as small as possible and such that all faces have the same size, respectively. We prove a complexity dichotomy for MINMAXFACE and show that deciding whether the maximum is at most $k$ is polynomial-time solvable for $k \leq 4$ and NP-complete for $k \geq 5$. Further, we give a 6-approximation for minimizing the maximum face in a planar embedding. For UNIFORMFACES, we show that the problem is NP-complete for odd $k \geq 7$ and even $k \geq 10$. Moreover, we characterize the biconnected planar multi-graphs admitting 3- and 4-uniform embeddings (in a $k$-uniform embedding all faces have size $k$) and give an efficient algorithm for testing the existence of a 6-uniform embedding.Comment: 23 pages, 5 figures, extended version of 'Planar Embeddings with Small and Uniform Faces' (The 25th International Symposium on Algorithms and Computation, 2014

Application of the exact regularized point particle method (ERPP) to particle laden turbulent shear flows in the two-way coupling regime

The Exact Regularized Point Particle method (ERPP), which is a new inter-phase momentum coupling ap- proach, is extensively used for the first time to explore the response of homogeneous shear turbulence in presence of different particle populations. Particle suspensions with different Stokes number and/or mass loading are considered. Particles with Kolmogorov Stokes number of order one suppress turbulent kinetic energy when the mass loading is increased. In contrast, heavier particles leave this observable almost un- changed with respect to the reference uncoupled case. Turbulence modulation is found to be anisotropic, leaving the streamwise velocity fluctuations less affected by unitary Stokes number particles whilst it is increased by heavier particles. The analysis of the energy spectra shows that the turbulence modulation occurs throughout the entire range of resolved scales leading to non-trivial augmentation/depletion of the energy content among the different velocity components at different length-scales. In this regard, the ERPP approach is able to provide convergent statistics up to the smallest dissipative scales of the flow, giving the opportunity to trust the ensuing results. Indeed, a substantial modification of the turbu- lent fluctuations at the smallest-scales, i.e. at the level of the velocity gradients, is observed due to the particle backreaction. Small scale anisotropies are enhanced and fluctuations show a greater level of in- termittency as measured by the probability distribution function of the longitudinal velocity increments and by the corresponding flatness

Turbulent mixing of a slightly supercritical Van der Waals fluid at Low-Mach number

Supercritical fluids near the critical point are characterized by liquid-like densities and gas-like transport properties. These features are purposely exploited in different contexts ranging from natural products extraction/fractionation to aerospace propulsion. Large part of studies concerns this last context, focusing on the dynamics of supercritical fluids at high Mach number where compressibility and thermodynamics strictly interact. Despite the widespread use also at low Mach number, the turbulent mixing properties of slightly supercritical fluids have still not investigated in detail in this regime. This topic is addressed here by dealing with Direct Numerical Simulations (DNS) of a coaxial jet of a slightly supercritical Van der Waals fluid. Since acoustic effects are irrelevant in the Low Mach number conditions found in many industrial applications, the numerical model is based on a suitable low-Mach number expansion of the governing equation. According to experimental observations, the weakly supercritical regime is characterized by the formation of finger-like structures-- the so-called ligaments --in the shear layers separating the two streams. The mechanism of ligament formation at vanishing Mach number is extracted from the simulations and a detailed statistical characterization is provided. Ligaments always form whenever a high density contrast occurs, independently of real or perfect gas behaviors. The difference between real and perfect gas conditions is found in the ligament small-scale structure. More intense density gradients and thinner interfaces characterize the near critical fluid in comparison with the smoother behavior of the perfect gas. A phenomenological interpretation is here provided on the basis of the real gas thermodynamics properties.Comment: Published on Physics of Fluid

A Study of Activated Processes in Soft Sphere Glass

On the basis of long simulations of a binary mixture of soft spheres just below the glass transition, we make an exploratory study of the activated processes that contribute to the dynamics. We concentrate on statistical measures of the size of the activated processes.Comment: 17 pages, 9 postscript figures with epsf, uses harvmac.te

Transport of micro-bubbles in turbulent shear flows

The dynamics of micro-bubbles, which are typical in many industrial applications, is addressed by means the Direct Numerical Simulations (DNS) of two prototypal flows, namely a homogeneous shear flow and a fully developed pipe flows. This preliminary study has a two-fold purpose. The homogenous turbulent shear flow is useful to characterize the bubble dynamics in terms of their eventual clustering properties which is expected to be controlled by the Stokes number. The time history of the fluid pressure experienced by the bubbles during their evolution is recorded and successively employed to force the Rayleigh-Plesset equation [1]. The ensuing data are used to address a posteriori the bubble diameter statistics in view of bubble collapse induced by strong and intermittent turbulent pressure fluctuations. The turbulent pipe flow simulations serve to address the bubble dynamics in wall bounded flows. Here the bubbles are observed to accumulate in the near-wall region with different intensity depending on the bubble dimensions

Advances in C-Planarity Testing of Clustered Graphs

A clustered graph C=(G,T) consists of an undirected graph G and a rooted tree T in which the leaves of T correspond to the vertices of G=(V,E). Each vertex c in T corresponds to a subset of the vertices of the graph called ''cluster''. C-planarity is a natural extension of graph planarity for clustered graphs, and plays an important role in automatic graph drawing. The complexity status of c-planarity testing is unknown. It has been shown that c-planarity can be tested in linear time for c-connected graphs, i.e., graphs in which the cluster induced subgraphs are connected. In this paper, we provide a polynomial time algorithm for c-planarity testing for "almost" c-connected clustered graphs, i.e., graphs for which all c-vertices corresponding to the non-c-connected clusters lie on the same path in T starting at the root of T, or graphs in which for each non-connected cluster its super-cluster and all its siblings are connected. The algorithm uses ideas of the algorithm for subgraph induced planar connectivity augmentation. We regard it as a first step towards general c-planarity testing