Relaying for Multiuser Networks in the Absence of Codebook Information

This work considers relay assisted transmission for multiuser networks when the relay has no access to the codebooks used by the transmitters. The relay is called oblivious for this reason. Of particular interest is the generalized compress-and-forward (GCF) strategy, where the destinations jointly decode the compression indices and the transmitted messages, and their optimality in this setting. The relay-to-destination links are assumed to be out-of-band with finite capacity. Two models are investigated: the multiple access relay channel (MARC) and the interference relay channel (IFRC). For the MARC with an oblivious relay, a new outerbound is derived and it is shown to be tight by means of achievability of the capacity region using GCF scheme. For the IFRC with an oblivious relay, a new strong interference condition is established, under which the capacity region is found by deriving a new outerbound and showing that it is achievable using GCF scheme. The result is further extended to establish the capacity region of M-user MARC with an oblivious relay, and multicast networks containing M sources and K destinations with an oblivious relay.Comment: submitted to IEEE Transactions on Information Theor

Degrees of Freedom for the MIMO Multi-way Relay Channel

This paper investigates the degrees of freedom (DoF) of the L-cluster, K-user MIMO multi-way relay channel, where users in each cluster wish to exchange messages within the cluster, and they can only communicate through the relay. A novel DoF upper bound is derived by providing users with carefully designed genie information. Achievable DoF is identified using signal space alignment and multiple-access transmission. For the two-cluster MIMO multi-way relay channel with two users in each cluster, DoF is established for the general case when users and the relay have arbitrary number of antennas, and it is shown that the DoF upper bound can be achieved using signal space alignment or multiple-access transmission, or a combination of both. The result is then generalized to the three user case. For the L-cluster K-user MIMO multi-way relay channel in the symmetric setting, conditions under which the DoF upper bound can be achieved are established. In addition to being shown to be tight in a variety of scenarios of interests of the multi-way relay channel, the newly derived upperbound also establishes the optimality of several previously established achievable DoF results for multiuser relay channels that are special cases of the multi-way relay channel.Comment: submitted to IEEE Transactions on Information Theor

What are Alternatives to Traditional Performance Rating Cycles and Processes?

The dominant format for performance appraisal systems in large U.S. industrial companies continues to be an objective-based approach such as management by objectives (MBO). Most companies conduct formal performance ratings annually or semi-annually. However, the traditional way of performance rating is receiving more and more doubt. With the development of HR theories, practices and technology, many companies are trying to manage employee performance in new ways

Horizontal non-vanishing of Heegner points and toric periods

Let $F/\mathbb{Q}$ be a totally real field and $A$ a modular \GL_2-type abelian variety over $F$. Let $K/F$ be a CM quadratic extension. Let $\chi$ be a class group character over $K$ such that the Rankin-Selberg convolution $L(s,A,\chi)$ is self-dual with root number $-1$. We show that the number of class group characters $\chi$ with bounded ramification such that $L'(1, A, \chi) \neq 0$ increases with the absolute value of the discriminant of $K$. We also consider a rather general rank zero situation. Let $\pi$ be a cuspidal cohomological automorphic representation over \GL_{2}(\BA_{F}). Let $\chi$ be a Hecke character over $K$ such that the Rankin-Selberg convolution $L(s,\pi,\chi)$ is self-dual with root number $1$. We show that the number of Hecke characters $\chi$ with fixed $\infty$-type and bounded ramification such that $L(1/2, \pi, \chi) \neq 0$ increases with the absolute value of the discriminant of $K$. The Gross-Zagier formula and the Waldspurger formula relate the question to horizontal non-vanishing of Heegner points and toric periods, respectively. For both situations, the strategy is geometric relying on the Zariski density of CM points on self-products of a quaternionic Shimura variety. The recent result \cite{Ts, YZ, AGHP} on the Andr\'e-Oort conjecture is accordingly fundamental to the approach.Comment: Adv. Math., to appear. arXiv admin note: text overlap with arXiv:1712.0214

Location, Proximity, and M&A Transactions

In this paper, we examine how the geographic location of firms affects acquisition decisions and value creation for acquirers in takeover transactions. We find that firms located in an urban area are more likely to receive a takeover bid and complete a takeover transaction as a target than firms located in rural areas, and takeover deals involving an urban target are associated with higher acquirer announcement returns, after controlling for the proximity between the target and the acquirer. In addition, a target\u27s urban location significantly attenuates the negative effect of a long distance between the target and the acquirer on acquirer returns, a fact that is documented in the existing literature. Our findings reveal a previously underexplored force—firm location—that can affect takeover transactions, in addition to proximity. Our paper suggests that a firm\u27s location plays an important role in facilitating the dissemination of soft information and enhancing information-based synergies

Letter to the Editor

The paper by Alfons, Croux and Gelper (2013), Sparse least trimmed squares regression for analyzing high-dimensional large data sets, considered a combination of least trimmed squares (LTS) and lasso penalty for robust and sparse high-dimensional regression. In a recent paper [She and Owen (2011)], a method for outlier detection based on a sparsity penalty on the mean shift parameter was proposed (designated by "SO" in the following). This work is mentioned in Alfons et al. as being an "entirely different approach." Certainly the problem studied by Alfons et al. is novel and interesting.Comment: Published in at http://dx.doi.org/10.1214/13-AOAS640 the Annals of Applied Statistics (http://www.imstat.org/aoas/) by the Institute of Mathematical Statistics (http://www.imstat.org