Genetic and Epigenetic Risk Factors for Diabetic Kidney Disease

Diabetes is increasing at daunting rates worldwide, and approximately 40% of affected individuals will develop kidney complications. Diabetic kidney disease (DKD) is the leading cause of end-stage kidney disease, and there are significant healthcare costs providing appropriate renal replacement therapies to affected individuals. For several decades, investigators have sought to discover inherited risk factors and biomarkers for DKD. In recent years, advances in high-throughput laboratory techniques and computational analyses, coupled with the establishment of multicenter consortia, have helped to identify genetic loci that are replicated across multiple populations. Several genome-wide association studies (GWAS) have been conducted for DKD with further meta-analysis of GWAS and comprehensive ”single gene” meta-analyses now published. Despite these efforts, much of the inherited predisposition to DKD remains unexplained. Meta-analyses and integrated–omics pathway studies are being used to help elucidate underlying genetic risks. Epigenetic phenomena are increasingly recognized as important drivers of disease risk, and several epigenome-wide association studies have now been completed. This review describes key findings and ongoing genetic and epigenetic initiatives for DKD.

Man-in-the-Middle Attack Test-bed Investigating Cyber-security Vulnerabilities in Smart Grid SCADA Systems

The increased complexity and interconnectivity of Supervisory Control and Data Acquisition (SCADA) systems in the Smart Grid has exposed them to a wide range of cyber-security issues, and there are a multitude of potential access points for cyber attackers. This paper presents a SCADA-specific cyber-security test-bed which contains SCADA software and communication infrastructure. This test-bed is used to investigate an Address Resolution Protocol (ARP) spoofing based man-in-the-middle attack. Finally, the paper proposes a future work plan which focuses on applying intrusion detection and prevention technology to address cyber-security issues in SCADA systems.

AXL Is a Key Regulator of Inherent and Chemotherapy-Induced Invasion and Predicts a Poor Clinical Outcome in Early-Stage Colon Cancer

Purpose: Despite the use of 5-fluorouracil (5-FU)–based adjuvant treatments, a large proportion of patients with high-risk stage II/III colorectal cancer will relapse. Thus, novel therapeutic strategies are needed for early-stage colorectal cancer. Residual micrometastatic disease from the primary tumor is a major cause of patient relapse.

Experimental Design: To model colorectal cancer tumor cell invasion/metastasis, we have generated invasive (KRASMT/KRASWT/+chr3/p53-null) colorectal cancer cell subpopulations. Receptor tyrosine kinase (RTK) screens were used to identify novel proteins that underpin the migratory/invasive phenotype. Migration/invasion was assessed using the XCELLigence system. Tumors from patients with early-stage colorectal cancer (N = 336) were examined for AXL expression.

Results: Invasive colorectal cancer cell subpopulations showed a transition from an epithelial-to-mesenchymal like phenotype with significant increases in migration, invasion, colony-forming ability, and an attenuation of EGF receptor (EGFR)/HER2 autocrine signaling. RTK arrays showed significant increases in AXL levels in all invasive sublines. Importantly, 5-FU treatment resulted in significantly increased migration and invasion, and targeting AXL using pharmacologic inhibition or RNA interference (RNAi) approaches suppressed basal and 5-FU–induced migration and invasion. Significantly, high AXL mRNA and protein expression were found to be associated with poor overall survival in early-stage colorectal cancer tissues.

Conclusions: We have identified AXL as a poor prognostic marker and important mediator of cell migration/invasiveness in colorectal cancer. These findings provide support for the further investigation of AXL as a novel prognostic biomarker and therapeutic target in colorectal cancer, in particular in the adjuvant disease in which EGFR/VEGF–targeted therapies have failed.

Xheal: A localized self-healing algorithm using expanders

We consider the problem of self-healing in reconfigurable networks e.g., peer-to-peer and wireless mesh networks. For such networks under repeated attack by an omniscient adversary, we propose a fully distributed algorithm, Xheal, that maintains good expansion and spectral properties of the network, while keeping the network connected. Moreover, Xheal does this while allowing only low stretch and degree increase per node. The algorithm heals global properties like expansion and stretch while only doing local changes and using only local information. We also provide bounds on the second smallest eigenvalue of the Laplacian which captures key properties such as mixing time, conductance, congestion in routing etc. Xheal has low amortized latency and bandwidth requirements. Our work improves over the self-healing algorithms Forgiving tree [PODC 2008] andForgiving graph [PODC 2009] in that we are able to give guarantees on degree and stretch, while at the same time preserving the expansion and spectral properties of the network.

The forgiving tree: a self-healing distributed data structure

We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that the following process continues for up to n rounds where n is the total number of nodes initially in the network: the adversary deletesan arbitrary node from the network, then the network responds by quickly adding a small number of new edges.

We present a distributed data structure that ensures two key properties. First, the diameter of the network is never more than O(log Delta) times its original diameter, where Delta is the maximum degree of the network initially. We note that for many peer-to-peer systems, Delta is polylogarithmic, so the diameter increase would be a O(loglog n) multiplicative factor. Second, the degree of any node never increases by more than 3 over its original degree. Our data structure is fully distributed, has O(1) latency per round and requires each node to send and receive O(1) messages per round. The data structure requires an initial setup phase that has latency equal to the diameter of the original network, and requires, with high probability, each node v to send O(log n) messages along every edge incident to v. Our approach is orthogonal and complementary to traditional topology-based approaches to defending against attack.

Algorithms for Self-Healing Networks

Many modern networks are \emph{reconfigurable}, in the sense that the topology of the network can be changed by the nodes in the network. For example, peer-to-peer, wireless and ad-hoc networks are reconfigurable. More generally, many social networks, such as a company's organizational chart; infrastructure networks, such as an airline's transportation network; and biological networks, such as the human brain, are also reconfigurable. Modern reconfigurable networks have a complexity unprecedented in the history of engineering, resembling more a dynamic and evolving living animal rather than a structure of steel designed from a blueprint. Unfortunately, our mathematical and algorithmic tools have not yet developed enough to handle this complexity and fully exploit the flexibility of these networks. We believe that it is no longer possible to build networks that are scalable and never have node failures. Instead, these networks should be able to admit small, and maybe, periodic failures and still recover like skin heals from a cut. This process, where the network can recover itself by maintaining key invariants in response to attack by a powerful adversary is what we call \emph{self-healing}. Here, we present several fast and provably good distributed algorithms for self-healing in reconfigurable dynamic networks. Each of these algorithms have different properties, a different set of gaurantees and limitations. We also discuss future directions and theoretical questions we would like to answer. %in the final dissertation that this document is proposed to lead to.

The Forgiving Graph:A distributed data structure for low stretch under adversarial attack

We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that, over a sequence of rounds, an adversary either inserts a node with arbitrary connections or deletes an arbitrary node from the network. The network responds to each such change by quick "repairs," which consist of adding or deleting a small number of edges. These repairs essentially preserve closeness of nodes after adversarial deletions,without increasing node degrees by too much, in the following sense. At any point in the algorithm, nodes v and w whose distance would have been - in the graph formed by considering only the adversarial insertions (not the adversarial deletions), will be at distance at most - log n in the actual graph, where n is the total number of vertices seen so far. Similarly, at any point, a node v whose degreewould have been d in the graph with adversarial insertions only, will have degree at most 3d in the actual graph. Our distributed data structure, which we call the Forgiving Graph, has low latency and bandwidth requirements. The Forgiving Graph improves on the Forgiving Tree distributed data structure from Hayes et al. (2008) in the following ways: 1) it ensures low stretch over all pairs of nodes, while the Forgiving Tree only ensures low diameter increase; 2) it handles both node insertions and deletions, while the Forgiving Tree only handles deletions; 3) it requires only a very simple and minimal initialization phase, while the Forgiving Tree initially requires construction of a spanning tree of the network. © Springer-Verlag 2012.

New Views on Effect of Recycled Aggregates on Concrete Compressive Strength

This paper presents an in-depth study on the effect that composition and properties of recycled coarse aggregates from previous concrete structures, together with water/cement ratio (w/c) and a replacement ratio of coarse aggregate, have on compressive strength, its evolution through time, and its variability. A rigorous approach through statistical inference based on multiple linear regression has identified the key factors. A predictive equation is given for compressive strength when recycled coarse aggregates are used. The w/c and replacement ratio are the capital factors affecting concrete compressive strength. Their effect is significantly modified by the properties and composition of the recycled aggregates used. An equation that accurately predicts concrete compressive strength in terms of these parameters is presented. Particular attention has been paid to the complex effect that old concrete and adhered mortar have on concrete compressive strength and its mid-term evolution. It has been confirmed that the presence of contaminants tends to increase variability of compressive strength values.