Carney complex (CNC) is a familial multiple neoplasia syndrome characterized by cardiac and extracardiac myxomas in the setting of spotty skin pigmentation and endocrinopathy. We previously identified PRKAR1A (regulatory subunit 1α of protein kinase A) mutations in CNC. Mutational analyses of the PRKAR1A gene in 51 unrelated CNC probands now detect mutations in 65%. All mutations, except for one unique missense mutation, lead to PRKAR1A haploinsufficiency. Therefore, we studied the consequences of prkar1a haploinsufficiency in mice. Although we did not observe cardiac myxomas or altered pigmentation in prkar1a +/– mice, we did observe some phenotypes similar to CNC, including altered heart rate variability. Moreover, prkar1a +/– mice exhibited a marked propensity for extracardiac tumorigenesis. They developed sarcomas and hepatocellular carcinomas. Sarcomas were frequently associated with myxomatous differentiation. Tumors from prkar1a +/– mice did not exhibit prkar1a loss of heterozygosity. Thus, we conclude that although PRKAR1A haploinsufficiency does predispose to tumorigenesis, distinct secondary genetic events are required for tumor formation.

We describe PhotoCompas, a system that utilizes the time and location information embedded in digital photographs to automatically organize a personal photo collection. PhotoCompas produces browseable location and event hierarchies for the collection. These hierarchies are created using algorithms that interleave time and location to produce an organization that mimics the way people think about their photo collections. In addition, the algorithm annotates the generated hierarchy with geographical names. We tested our approach in case studies of three real-world collections and verified that the results are meaningful and useful for the collection owners.

Transcriptional regulatory cascades during epicardial and coronary vascular development from proepicardial progenitor cells remain to be defined. We have used immunohistochemistry of human embryonic tissues to demonstrate that the TBX5 transcription factor is expressed not only in the myocardium, but also throughout the embryonic epicardium and coronary vasculature. TBX5 is not expressed in other human fetal vascular beds. Furthermore, immunohistochemical analyses of human embryonic tissues reveals that unlike their epicardial counterparts, delaminating epicardial-derived cells do not express TBX5 as they migrate through the subepicardium before undergoing epithelial-mesenchymal transformation required for coronary vasculogenesis. In the chick, Tbx5 is expressed in the embryonic proepicardial organ (PEO), which is composed of the epicardial and coronary vascular progenitor cells. Retrovirus-mediated overexpression of human TBX5 inhibits cell incorporation of infected proepicardial cells into the nascent chick epicardium and coronary vasculature. TBX5 overexpression as well as antisense-mediated knockdown of chick Tbx5 produce a cell-autonomous defect in the PEO that prevents proepicardial cell migration. Thus, both increasing and decreasing Tbx5 dosage impairs development of the proepicardium. Culture of explanted PEOs demonstrates that untreated chick proepicardial cells downregulate Tbx5 expression during cell migration. Therefore, we propose that Tbx5 participates in regulation of proepicardial cell migration, a critical event in the establishment of the epicardium and coronary vasculature.

Abstract. Asynchronous Byzantine consensus algorithms are an important primitive for building Byzantine fault-tolerant systems. Algorithms for Byzantine consensus typically require at least two communication steps for decision; in many systems, this imposes a significant performance overhead. In this paper, we show that it is possible to design Byzantine fault-tolerant consensus algorithms that decide in one message latency under contention-free scenarios and still provide strong consistency guarantees when contention occurs. We define two variants of one-step asynchronous Byzantine consensus and show a lower bound on the number of processors needed for each. We present a Byzantine consensus algorithm, Bosco, for asynchronous networks that meets these bounds, even in the face of a strong network adversary.

No abstract