Foreign Takeovers and Wage Dispersion in Hungary

This study tests FDI technology spillover models with the assumption that learning takes time against wage bargaining models by estimating the wage-premium of a foreign takeover. The technology spillover theory predicts a larger wage growth in firms taken over by foreign investors than in local firms. However, this wage growth should be confined to high-skilled workers or workers with a high level of education. Wage bargaining models also predict such a wage growth. But it should be confined to workers who are organized in trade unions, i.e. workers with low or medium level of education or skill. We apply Hungarian employee-employer matched data from 1992 until 2001, and reject the FDI technology spillover model in favor of the wage bargaining model when differentiating the wage premium by education or occupation, both by applying Mincer wage regressions and the nearest-neighbor matching method.FDI, foreign takeover, cross-border M&A, Mincer wage regression, employee-employer matched data, nearest-neighbor matching

Proceedings of the 3rd Workshop on Domain-Specific Language Design and Implementation (DSLDI 2015)

The goal of the DSLDI workshop is to bring together researchers and practitioners interested in sharing ideas on how DSLs should be designed, implemented, supported by tools, and applied in realistic application contexts. We are both interested in discovering how already known domains such as graph processing or machine learning can be best supported by DSLs, but also in exploring new domains that could be targeted by DSLs. More generally, we are interested in building a community that can drive forward the development of modern DSLs. These informal post-proceedings contain the submitted talk abstracts to the 3rd DSLDI workshop (DSLDI'15), and a summary of the panel discussion on Language Composition

A static scheduling approach to enable safety-critical OpenMP applications

Parallel computation is fundamental to satisfy the performance requirements of advanced safety-critical systems. OpenMP is a good candidate to exploit the performance opportunities of parallel platforms. However, safety-critical systems are often based on static allocation strategies, whereas current OpenMP implementations are based on dynamic schedulers. This paper proposes two OpenMP-compliant static allocation approaches: an optimal but costly approach based on an ILP formulation, and a sub-optimal but tractable approach that computes a worst-case makespan bound close to the optimal one.This work is funded by the EU projects P-SOCRATES (FP7-ICT-2013-10) and HERCULES (H2020/ICT/2015/688860), and the Spanish Ministry of Science and Innovation under contract TIN2015-65316-P.Peer ReviewedPostprint (author's final draft

Parallel Parsing in a Multiprocessor Environment

Parsing in a multiprocessor environment is considered. Two models for asynchronous bottom-up parallel parsing are presented. A method for estimating speedup in asynchronous bottom-up parallel parsing is developed, and it is used to estimate speedup obtainable by bottom-up parallel parsing of Pascal-like languages. It is found that bottom-up parallel parsing algorithms can attain a maximum speedup of 0 (L1/2) with (L1/2) processors, where L is the number of tokens in the string being parsed. Hence, bottom-up parallel parsing technique does not yield good speedup. A new parsing technique is proposed for parsing a class of block-structured languages. The novelty of the technique is that it is inherently parallel. By applying this new technique, a string of L tokens can be parsed in O (log L) time with (L /log L) processors. The parsing algorithm uses a parenthesis-matching algorithm developed here. The parenthesis-matching algorithm can find matching of a sequence of parentheses in O (log L) time with (L /log L) processors. Thus, the new parsing algorithm is cost optimal

Drivere for avskoging og insentiver for REDD+

Tropical deforestation is a global environmental and development problem. Identifying policies that effectively reduce deforestation while improving rural livelihoods is essential to meet our climate and sustainable development goals. The thesis has two main objectives: first, to evaluate the potential of collective Payments for Ecosystem Services (PES) to deliver on conservation and development outcomes under different contexts, and second, to improve our understanding of the causes of deforestation at the national level. Paper I and II investigate the central question of how to solve the free rider problem of collective PES, using data from a framed field experiment in Brazil, Indonesia and Peru. They examine three strategies to mitigate the free-rider problem: (i) increase in public monitoring of individual actions, (ii) peer-to-peer, community sanctions, and (iii) external, government sanctions. Overall, public monitoring and both types of sanctions increase policy effectiveness. Government sanctions are the most effective to reduce deforestation; community or peer-to-peer sanctions also reduce deforestation but can create trade-offs in terms of loss of local income. There are also important cross-country differences in policy impact. Increased public monitoring does not improve the performance of collective PES in Brazil, while in Indonesia peer-to-peer sanctions are much more frequent. In Indonesia, the existence of inequality in wealth reduces the performance of collective PES, while it has negligeable impacts in Peru and Brazil. In general, individuals who contribute more to conservation outcomes are also the ones who contribute more to the enforcement of conservation norms by sanctioning free-riders. Paper III presents a household-level impact evaluation of two collective PES schemes in Ucayali, Peru. The first is a local conservation project led by an NGO while the second is the Peruvian's government National Forest Conservation Program (NFCP). The paper examines land use, income, and wellbeing outcomes. The projects have not improved local incomes because of a slow and delayed implementation. The delayed and slow implementation have not, in turn, negatively affected forest or conservation outcomes. The study brings forward the importance of considering households' subjective wellbeing impacts of conservation projects. Taken together, the results of Paper I, II and III point to the importance of having good forest monitoring to improve conservation, development, and wellbeing outcomes of collective PES. Paper IV addresses the second objective of the thesis by examining how dual economy growth models can help understand patterns of deforestation across countries. The paper develops a theoretical framework to disentangle the immediate drivers of deforestation from the indirect drivers. The results are consistent with economic predictions: competing land use value between forest and agriculture are a major immediate driver of deforestation. There is suggestive evidence that openness to trade can, indirectly, reduce deforestation levels by decreasing the relative return of agricultural land.Tropisk avskoging er et globalt miljø- og utviklingsproblem. Redusert avskoging og forbedring av levebrødet på landsbygda er avgjørende for å oppfylle mål for reduserte klimaendringer og bærekraftig utvikling. Avhandlingen har to hovedmål: for det første å evaluere effekten av politikk som tar sikte på å redusere avskoging og forbedre levebrødet på landsbygda, med et fokus på kollektive betalinger for økosystemtjenester (PES), og for det andre å forbedre vår forståelse av årsakene til avskoging.CRP-FTA CGIAR Fund Donor

Scheduling and reconfiguration of interconnection network switches

Interconnection networks are important parts of modern computing systems, facilitating communication between a system\u27s components. Switches connecting various nodes of an interconnection network serve to move data in the network. The switch\u27s delay and throughput impact the overall performance of the network and thus the system. Scheduling efficient movement of data through a switch and configuring the switch to realize a schedule are the main themes of this research. We consider various interconnection network switches including (i) crossbar-based switches, (ii) circuit-switched tree switches, and (iii) fat-tree switches. For crossbar-based input-queued switches, a recent result established that logarithmic packet delay is possible. However, this result assumes that packet transmission time through the switch is no less than schedule-generation time. We prove that without this assumption (as is the case in practice) packet delay becomes linear. We also report results of simulations that bear out our result for practical switch sizes and indicate that a fast scheduling algorithm reduces not only packet delay but also buffer size. We also propose a fast mesh-of-trees based distributed switch scheduling (maximal-matching based) algorithm that has polylog complexity. A circuit-switched tree (CST) can serve as an interconnect structure for various computing architectures and models such as the self-reconfigurable gate array and the reconfigurable mesh. A CST is a tree structure with source and destination processing elements as leaves and switches as internal nodes. We design several scheduling and configuration algorithms that distributedly partition a given set of communications into non-conflicting subsets and then establish switch settings and paths on the CST corresponding to the communications. A fat-tree is another widely used interconnection structure in many of today\u27s high-performance clusters. We embed a reconfigurable mesh inside a fat-tree switch to generate efficient connections. We present an R-Mesh-based algorithm for a fat-tree switch that creates buses connecting input and output ports corresponding to various communications using that switch