The measurement and decomposition of economy-wide productivity growth:Assessing the accuracy and selecting between different approaches

Productivity at the macro level is a complex concept but also arguably the most appropriate measure of economic welfare. Currently, there is limited research available on the various approaches that can be used to measure it and especially on the relative accuracy of said approaches. This thesis has two main objectives: firstly, to detail some of the most common productivity measurement approaches and assess their accuracy under a number of conditions and secondly, to present an up-to-date application of productivity measurement and provide some guidance on selecting between sometimes conflicting productivity estimates. With regards to the first objective, the thesis provides a discussion on the issues specific to macro-level productivity measurement and on the strengths and weaknesses of the three main types of approaches available, namely index-number approaches (represented by Growth Accounting), non-parametric distance functions (DEA-based Malmquist indices) and parametric production functions (COLS- and SFA-based Malmquist indices). The accuracy of these approaches is assessed through simulation analysis, which provided some interesting findings. Probably the most important were that deterministic approaches are quite accurate even when the data is moderately noisy, that no approaches were accurate when noise was more extensive, that functional form misspecification has a severe negative effect in the accuracy of the parametric approaches and finally that increased volatility in inputs and prices from one period to the next adversely affects all approaches examined. The application was based on the EU KLEMS (2008) dataset and revealed that the different approaches do in fact result in different productivity change estimates, at least for some of the countries assessed. To assist researchers in selecting between conflicting estimates, a new, three step selection framework is proposed, based on findings of simulation analyses and established diagnostics/indicators. An application of this framework is also provided, based on the EU KLEMS dataset.

Thermal decomposition behavior of 1,2-bis-(2,4,6-tribromophenoxy)ethane

The thermal decomposition behavior of 1,2-bis-(2,4,6-tribromophenoxy)ethane (BTBPE) widely used as flame retardant plastics additive was studied by HRTG and differential scanning calorimetries. It was pyrolysed in inert atmosphere at 240 and 340 °C in isothermal conditions, the decomposition products were collected and investigated by means of IR and GC-MS, most of them are identified. It was found that BTBPE mostly evaporates at 240 °C. The decomposition products at 340°C depend on rate of their removal from the hot reaction zone. Main primary decomposition products found in case of rapid removal are tribromophenol and vinyl tribromophenyl ether. Whereas, prolonged contact with heating zone also produces hydrogen bromide, ethylene bromide, polybrominated vinyl phenyl ethers and diphenyl ethers, and dibenzodioxins. The nature of the identified compounds are in accordance with a molecular and radical pyrolysis reaction pathway. © 2002 Elsevier Science B.V. All rights reserved.

A shape-based decomposition of the yield adjustment term in the arbitrage-free Nelson and Siegel (AFNS) model of the yield curve

The appealing feature of the arbitrage-free Nelson-Siegel model of the yield curve is the ability to capture movements in the yield curve through readily interpretable shifts in its level, slope or curvature, all within a dynamic arbitrage-free framework. To ensure that the level, slope and curvature factors evolve so as not to admit arbitrage, the model introduces a yield-adjustment term. This paper shows how the yield-adjustment term can also be decomposed into the familiar level, slope and curvature elements plus some additional readily interpretable shape adjustments. This means that, even in an arbitrage-free setting, it continues to be possible to interpret movements in the yield curve in terms of level, slope and curvature influences. © 2014 © 2014 Taylor & Francis.

Decomposition of the B2-type matrix

The microstructural stability of aluminide diffusion coatings, prepared by means of a two-stage pack-aluminization treatment on single-crystal nickel-base superalloy substrates, is considered in this article. Edge-on specimens of coated superalloy are studied using transmission electron microscopy (TEM). The effects of coating thickness and post-coating heat treatment (duration, temperature, and atmosphere) on coating microstructure are examined. The article discusses the partial transformation of the matrix of the coating, from a B2-type phase (nominally NiAl) to a L12 phase (nominally Ni3(Al, Ti)), during exposure at temperatures of 850 °C and 950 °C in air and in vacuum for up to 138 hours. Three possible processes that can account for decom- position of the coating matrix are investigated, namely, interdiffusion between the coating and the substrate, oxidation of the coating surface, and aging of the coating. Of these processes, aging of the coating is shown to be the predominant factor in the coating transformation under the conditions considered. © 1992 The Minerals, Metals and Materials Society, and ASM International.

A fast XPS study of sulphate promoted propene decomposition over Pt{111}

SO2 oxidation has been followed by Fast XPS over Pt{111}. Preadsorbed oxygen reduces the low temperature saturation coverage of SO2 with respect to the clean surface. Heating a mixed O2/SO2 adlayer results in efficient oxidation of both upright and flat-lying SO2 molecules to surface-bound SO4. Sulphate decomposes above room temperature liberating gas-phase SO2 and SO3. Propene adsorbs molecularly at 100 K over clean Pt{111} and dehydrogenates above 250 K to form a stable propylidyne adlayer, which in turn decomposes above 400 K to form graphitic carbon. Preadsorbed surface sulphate enhances the sticking probability of propene via formation of an alkyl-sulphate complex. Thermal decomposition of this complex accounts for low temperature propene combustion and is accompanied by atomic sulpur deposition. Propylidyne forms as on clean Pt but is less reactive undergoing partial oxidation above 450 K with residual surface oxygen.

A fast XPS study of propene decomposition over clean and sulphated Pt{111}

The thermal decomposition of propene over clean and sulphate precovered Pt{111} has been followed by Fast XPS. The saturation propene coverage over the clean surface is 0.21 mL at 90 K. Propene is stable up to 200 K, above which molecular desorption and dehydrogenation result in the formation of a stable propylidyne intermediate adlayer at 300 K. Propylidyne decomposes above 400 K eventually forming graphitic carbon above 800 K. Preadsorbed surface sulphate promotes room temperature propene combustion associated with the decomposition of a thermally unstable alkyl--sulphate complex. Propylidyne also forms as on clean Pt{111}, but is less reactive, its decomposition above 450 K triggering partial oxidation with residual surface oxygen to liberate gas phase CO.

Solar thermal decomposition of desalination reject brine for carbon dioxide removal and neutralisation of ocean acidity

Desalination plants could become net absorbers (rather than net emitters) of CO2. Thermal decomposition of salts in desalination reject brine can yield MgO which, added to the ocean, would take up CO2 through conversion to bicarbonate. The process proposed here comprises dewatering of brine followed by decomposition in a solar receiver using a heliostat field.

Recognizing Decomposition of a Partial Boolean Function

A hard combinatorial problem is investigated which has useful application in design of discrete devices: the two-block decomposition of a partial Boolean function. The key task is regarded: finding such a weak partition on the set of arguments, at which the considered function can be decomposed. Solving that task is essentially speeded up by the way of preliminary discovering traces of the sought-for partition. Efficient combinatorial operations are used by that, based on parallel execution of operations above adjacent units in the Boolean space.

State advances and private retreats? Evidence from the decomposition of the Chinese manufacturing aggregate productivity decomposition in China

This paper is motivated by the recent debate on the existence and scale of China's 'Guo Jin Min Tui' phenomenon, which is often translated as 'the state sector advances and the private sector retreats'. We argue that the profound implication of an advancing state sector is not the size expansion of the state ownership in the economy per se, but the likely retardation of the development of the already financially constrained private sector and the issues around the sustainability of the already weakening Chinese economy growth. Drawing on recent methodological advances, we provide a critical analysis of the contributions of the state and non-state sectors in the aggregate Total Factor Productivity and its growth over the period of 1998-2007 to verify the existence of GJMT and its possible impacts on Chinese economic growth. Overall, we find strong and consistent evidence of a systematic and worsening resource misallocation within the state sector and/or between the state sectors and private sectors over time. This suggests that non-market forces allow resources to be driven away from their competitive market allocation and towards the inefficient state sector. Crown Copyright © 2014.

Decomposition of Banach Space into a Direct Sum of Separable and Reflexive Subspaces and Borel Maps

* This paper was supported in part by the Bulgarian Ministry of Education, Science and Technologies under contract MM-506/95.

Decomposition of Boolean Functions – Recognizing a Good Solution by Traces

The problem of sequent two-block decomposition of a Boolean function is regarded in case when a good solution does exist. The problem consists mainly in finding an appropriate weak partition on the set of arguments of the considered Boolean function, which should be decomposable at that partition. A new fast heuristic combinatorial algorithm is offered for solving this task. At first the randomized search for traces of such a partition is fulfilled. The recognized traces are represented by some "triads" - the simplest weak partitions corresponding to non-trivial decompositions. After that the whole sought-for partition is restored from the discovered trace by building a track initialized by the trace and leading to the solution. The results of computer experiments testify the high practical efficiency of the algorithm.

Implementation of a Heuristic Method of Decomposition of Partial Boolean Functions

An original heuristic algorithm of sequential two-block decomposition of partial Boolean functions is researched. The key combinatorial task is considered: finding of suitable partition on the set of arguments, i. e. such one, on which the function is separable. The search for suitable partition is essentially accelerated by preliminary detection of its traces. Within the framework of the experimental system the efficiency of the algorithm is evaluated, the boundaries of its practical application are determined.

Asymmetric Cipher Protocol Using Decomposition Problem

The asymmetric cipher protocol based on decomposition problem in matrix semiring M over semiring of natural numbers N is presented. The security parameters are defined and preliminary security analysis is presented.