Delay-rate tradeoff for ergodic interference alignment in the Gaussian case

In interference alignment, users sharing a wireless channel are each able to achieve data rates of up to half of the non-interfering channel capacity, no matter the number of users. In an ergodic setting, this is achieved by pairing complementary channel realizations in order to amplify signals and cancel interference. However, this scheme has the possibility for large delays in decoding message symbols. We show that delay can be mitigated by using outputs from potentially more than two channel realizations, although data rate may be reduced. We further demonstrate the tradeoff between rate and delay via a time-sharing strategy. Our analysis considers Gaussian channels; an extension to finite field channels is also possible.Comment: 7 pages, 2 figures, presented at 48th Allerton Conference on Communication Control and Computing, 2010. Includes appendix detailing Markov chain analysi

An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging

This paper proposes two new mixed integer programming models for capacitated multi-level lot-sizing problems with backlogging, whose linear programming relaxations provide good lower bounds on the optimal solution value. We show that both of these strong formulations yield the same lower bounds. In addition to these theoretical results, we propose a new, effective optimization framework that achieves high quality solutions in reasonable computational time. Computational results show that the proposed optimization framework is superior to other well-known approaches on several important performance dimensions

Patient and Disease-Specific Induced Pluripotent Stem Cells for Discovery of Personalized Cardiovascular Drugs and Therapeutics.

Human induced pluripotent stem cells (iPSCs) have emerged as an effective platform for regenerative therapy, disease modeling, and drug discovery. iPSCs allow for the production of limitless supply of patient-specific somatic cells that enable advancement in cardiovascular precision medicine. Over the past decade, researchers have developed protocols to differentiate iPSCs to multiple cardiovascular lineages, as well as to enhance the maturity and functionality of these cells. Despite significant advances, drug therapy and discovery for cardiovascular disease have lagged behind other fields such as oncology. We speculate that this paucity of drug discovery is due to a previous lack of efficient, reproducible, and translational model systems. Notably, existing drug discovery and testing platforms rely on animal studies and clinical trials, but investigations in animal models have inherent limitations due to interspecies differences. Moreover, clinical trials are inherently flawed by assuming that all individuals with a disease will respond identically to a therapy, ignoring the genetic and epigenomic variations that define our individuality. With ever-improving differentiation and phenotyping methods, patient-specific iPSC-derived cardiovascular cells allow unprecedented opportunities to discover new drug targets and screen compounds for cardiovascular disease. Imbued with the genetic information of an individual, iPSCs will vastly improve our ability to test drugs efficiently, as well as tailor and titrate drug therapy for each patient

Partitioning-based algorithm for pipelined scheduling and module assignment

We propose partitioning-based algorithms for pipeline scheduling, module assignment, and interconnect sharing. A novel hypergraph model is used to perform module assignment which facilitates the identification of sharable resources and the calculation of interconnect costs. The algorithms use clustering and interchange improvement techniques to maximize interconnect sharing. The results show significant improvement over other published results