Several algorithms build on the perfect phylogeny model to infer evolutionary trees. This problem is particularly hard when evolutionary trees are inferred from the fraction of genomes that have mutations in different positions, across different samples. Existing algorithms might do extensive searches over the space of possible trees. At the center of these algorithms is a projection problem that assigns a fitness cost to phylogenetic trees. In order to perform a wide search over the space of the trees, it is critical to solve this projection problem fast. In this paper, we use Moreau's decomposition for proximal operators, and a tree reduction scheme, to develop a new algorithm to compute this projection. Our algorithm terminates with an exact solution in a finite number of steps, and is extremely fast. In particular, it can search over all evolutionary trees with fewer than 11 nodes, a size relevant for several biological problems (more than 2 billion trees) in about 2 hours.

In this paper, a new radiation pattern reconfigurable antenna is designed for mobile relay station (MRS) on vehicles to increase the link reliability and system flexibility in mobility. With only a single radio frequency (RF) chain, various beam patterns can be formed and selected electronically in a simple way. The design and corresponding beam switching mechanism are demonstrated through an experimental prototype with improved SINR performance, particularly at the cell boundary. Furthermore, its advantage in handover is confirmed through numerical simulations. The handover success rate increases significantly in high speed mobility.

Relay has been identified as a fundamental feature in LTE-Advanced in order to achieve LTE-A requirements. The conventional straightforward relaying scheme named decode-and-forward (DF) protocol is used at relay station (RS) to decode the data received from mobile station (MS) and forward the decoded data to the base station (BS) to improve the spatial diversity gain. It is not efficient and optimal since the traditional DF scheme has not considered the unequal bit reliability within each QAM symbols. In this paper, a bit rearrangement technique is used at RS to improve the performance of the cooperative relaying system, in which the bit remapping employed at RS is different from the one used at MS. At BS, the soft information combining technique with maximum a posteriori (MAP) is used to demodulate the data before turbo decoding. Simulation results show that the proposed cooperative transmission scheme obtains a significant performance gain in terms of block error rate (BLER) compared to the traditional DF relaying scheme.