Preference Bias and Outsourcing to Market: A Steady-State Analysis

We analyze a model that focuses on the export/outsource decision. Outsourcing has the advantage of providing better information about local preferences. The disadvantage is that producing in the host country also means using the inferior technology embodied in the local capital. The decision of whether to offer an outsourcing contract weighs these two effects against each other. The host country accepts the outsourcing contract if the higher price they pay for the outsourced good is worth the benefit of consuming a manufactured good closer to their ideal variety. These results suggest that as low income countries develop they become a more attractive destination for outsourcing because the quality of their capital improves and the local market is more lucrative. In addition, the developing low income country finds the outsourcing contract more attractive since their increased demand for the correct variety of the manufactured good increases. This suggests that preference based outsourcing is more likely to occur with higher income host countries.outsourcing, multinational firms, foreign direct investment

Generating functions and short recursions, with applications to the moments of quadratic forms in noncentral normal vectors

Using generating functions, the top-order zonal polynomials that occur in much distribution theory under normality can be recursively related to other symmetric functions (power-sum and elementary symmetric functions, Ruben (1962), Hillier, Kan, and Wang (2009)). Typically, in a recursion of this type the k-th object of interest, dk say, is expressed in terms of all lower-order dj ’s. In Hillier, Kan, and Wang (2009) we pointed out that, in the case of top-order zonal polynomials (and generalizations of them), a shorter (i.e., fixed length) recursion can be deduced. The present paper shows that the argument in Hillier, Kan, and Wang (2009) generalizes to a large class of objects/generating functions. The results thus obtained are then applied to various problems involving quadratic forms in noncentral normal vectors Keywords; generating functions, invariant polynomials, non-central normal distribution, recursions, symmetric functions, zonal polynomials

Generating functions and short recursions, with applications to the moments of quadratic forms in noncentral normal vectors

Using generating functions, the top-order zonal polynomials that occur in much distribution theory under normality can be recursively related to other symmetric functions (power-sum and elementary symmetric functions, Ruben, Hillier, Kan, and Wang). Typically, in a recursion of this type the k -th object of interest, d k say, is expressed in terms of all lower-order d j's. In Hillier, Kan, and Wang we pointed out that, in the case of top-order zonal polynomials (and generalizations of them), a shorter (i.e., fixed length) recursion can be deduced. The present paper shows that the argument in generalizes to a large class of objects/generating functions. The results thus obtained are then applied to various problems involving quadratic forms in noncentral normal vectors.

Computationally efficient recursions for top-order invariant polynomials with applications

The top-order zonal polynomials Ck(A),and top-order invariant polynomials Ck1,...,kr(A1,...,Ar)in which each of the partitions of ki,i = 1,..., r,has only one part, occur frequently in multivariate distribution theory, and econometrics - see, for example Phillips (1980, 1984, 1985, 1986), Hillier (1985, 2001), Hillier and Satchell (1986), and Smith (1989, 1993). However, even with the recursive algorithms of Ruben (1962) and Chikuse (1987), numerical evaluation of these invariant polynomials is extremely time consuming. As a result, the value of invariant polynomials has been largely confined to analytic work on distribution theory. In this paper we present new, very much more efficient, algorithms for computing both the top-order zonal and invariant polynomials. These results should make the theoretical results involving these functions much more valuable for direct practical study. We demonstrate the value of our results by providing fast and accurate algorithms for computing the moments of a ratio of quadratic forms in normal random variables.

On Capacity and Delay of Multi-channel Wireless Networks with Infrastructure Support

In this paper, we propose a novel multi-channel network with infrastructure support, called an MC-IS network, which has not been studied in the literature. To the best of our knowledge, we are the first to study such an MC-IS network. Our proposed MC-IS network has a number of advantages over three existing conventional networks, namely a single-channel wireless ad hoc network (called an SC-AH network), a multi-channel wireless ad hoc network (called an MC-AH network) and a single-channel network with infrastructure support (called an SC-IS network). In particular, the network capacity of our proposed MC-IS network is $\sqrt{n \log n}$ times higher than that of an SC-AH network and an MC-AH network and the same as that of an SC-IS network, where $n$ is the number of nodes in the network. The average delay of our MC-IS network is $\sqrt{\log n/n}$ times lower than that of an SC-AH network and an MC-AH network, and $\min\{C_I,m\}$ times lower than the average delay of an SC-IS network, where $C_I$ and $m$ denote the number of channels dedicated for infrastructure communications and the number of interfaces mounted at each infrastructure node, respectively. Our analysis on an MC-IS network equipped with omni-directional antennas only has been extended to an MC-IS network equipped with directional antennas only, which are named as an MC-IS-DA network. We show that an MC-IS-DA network has an even lower delay of $\frac{c}{\lfloor \frac{2\pi}{\theta}\rfloor \cdot C_I}$ compared with an SC-IS network and our MC-IS network. For example, when $C_I=12$ and $\theta=\frac{\pi}{12}$, an MC-IS-DA network can further reduce the delay by 24 times lower that of an MC-IS network and reduce the delay by 288 times lower than that of an SC-IS network.Comment: accepted, IEEE Transactions on Vehicular Technology, 201

Non-convex optimization for 3D point source localization using a rotating point spread function

We consider the high-resolution imaging problem of 3D point source image recovery from 2D data using a method based on point spread function (PSF) engineering. The method involves a new technique, recently proposed by S.~Prasad, based on the use of a rotating PSF with a single lobe to obtain depth from defocus. The amount of rotation of the PSF encodes the depth position of the point source. Applications include high-resolution single molecule localization microscopy as well as the problem addressed in this paper on localization of space debris using a space-based telescope. The localization problem is discretized on a cubical lattice where the coordinates of nonzero entries represent the 3D locations and the values of these entries the fluxes of the point sources. Finding the locations and fluxes of the point sources is a large-scale sparse 3D inverse problem. A new nonconvex regularization method with a data-fitting term based on Kullback-Leibler (KL) divergence is proposed for 3D localization for the Poisson noise model. In addition, we propose a new scheme of estimation of the source fluxes from the KL data-fitting term. Numerical experiments illustrate the efficiency and stability of the algorithms that are trained on a random subset of image data before being applied to other images. Our 3D localization algorithms can be readily applied to other kinds of depth-encoding PSFs as well.Comment: 28 page

The Transformation of Trust in China’s Alternative Food Networks: Disruption, Reconstruction, and Development

Food safety issues in China have received much scholarly attention, yet few studies systematically examined this matter through the lens of trust. More importantly, little is known about the transformation of different types of trust in the dynamic process of food production, provision, and consumption. We consider trust as an evolving interdependent relationship between different actors. We used the Beijing County Fair, a prominent ecological farmers’ market in China, as an example to examine the transformation of trust in China’s alternative food networks. We argue that although there has been a disruption of institutional trust among the general public since 2008 when the melamine-tainted milk scandal broke out, reconstruction of individual trust and development of organizational trust have been observed, along with the emergence and increasing popularity of alternative food networks. Based on more than six months of fieldwork on the emerging ecological agriculture sector in 13 provinces across China as well as monitoring of online discussions and posts, we analyze how various social factors—including but not limited to direct and indirect reciprocity, information, endogenous institutions, and altruism—have simultaneously contributed to the transformation of trust in China’s alternative food networks. The findings not only complement current social theories of trust, but also highlight an important yet understudied phenomenon whereby informal social mechanisms have been partially substituting for formal institutions and gradually have been building trust against the backdrop of the food safety crisis in China