Vietnam Inbound M&A Activity: the Role of Government Policy and Regulatory Environment

With a robust recent history of reform and opening, joining of the World Trade Organization, and negotiating a myriad of regional and global trade agreements, Vietnam has emerged as a promising destination for foreign direct investment(FDI) and cross-border mergers and acquisitions (M&A). In this paper, we providean overview of Vietnam’s inbound mergers and acquisitions and review the twomain driving forces of inbound M&A, which are the legal framework reformprocess and the equitization of State-owned enterprises. We close by providingdirections for future research in the area of cross-border M&As

Dynamics of horizontal-like maps in higher dimension

We study the regularity of the Green currents and of the equilibrium measure associated to a horizontal-like map in C^k, under a natural assumption on the dynamical degrees. We estimate the speed of convergence towards the Green currents, the decay of correlations for the equilibrium measure and the Lyapounov exponents. We show in particular that the equilibrium measure is hyperbolic. We also show that the Green currents are the unique invariant vertical and horizontal positive closed currents. The results apply, in particular, to Henon-like maps, to regular polynomial automorphisms of C^k and to their small pertubations.Comment: Dedicated to Professor Gennadi Henkin on the occasion of his 65th birthday, 37 pages, to appear in Advances in Mat

2D Proactive Uplink Resource Allocation Algorithm for Event Based MTC Applications

We propose a two dimension (2D) proactive uplink resource allocation (2D-PURA) algorithm that aims to reduce the delay/latency in event-based machine-type communications (MTC) applications. Specifically, when an event of interest occurs at a device, it tends to spread to the neighboring devices. Consequently, when a device has data to send to the base station (BS), its neighbors later are highly likely to transmit. Thus, we propose to cluster devices in the neighborhood around the event, also referred to as the disturbance region, into rings based on the distance from the original event. To reduce the uplink latency, we then proactively allocate resources for these rings. To evaluate the proposed algorithm, we analytically derive the mean uplink delay, the proportion of resource conservation due to successful allocations, and the proportion of uplink resource wastage due to unsuccessful allocations for 2D-PURA algorithm. Numerical results demonstrate that the proposed method can save over 16.5 and 27 percent of mean uplink delay, compared with the 1D algorithm and the standard method, respectively.Comment: 6 pages, 6 figures, Published in 2018 IEEE Wireless Communications and Networking Conference (WCNC