Exploring metabolic dysfunction in chronic kidney disease

Abstract Impaired kidney function and chronic kidney disease (CKD) leading to kidney failure and end-stage renal disease (ESRD) is a serious medical condition associated with increased morbidity, mortality, and in particular cardiovascular disease (CVD) risk. CKD is associated with multiple physiological and metabolic disturbances, including hypertension, dyslipidemia and the anorexia-cachexia syndrome which are linked to poor outcomes. Specific hormonal, inflammatory, and nutritional-metabolic factors may play key roles in CKD development and pathogenesis. These include raised proinflammatory cytokines, such as interleukin-1 and −6, tumor necrosis factor, altered hepatic acute phase proteins, including reduced albumin, increased C-reactive protein, and perturbations in normal anabolic hormone responses with reduced growth hormone-insulin-like growth factor-1 axis activity. Others include hyperactivation of the renin-angiotensin aldosterone system (RAAS), with angiotensin II and aldosterone implicated in hypertension and the promotion of insulin resistance, and subsequent pharmacological blockade shown to improve blood pressure, metabolic control and offer reno-protective effects. Abnormal adipocytokine levels including leptin and adiponectin may further promote the insulin resistant, and proinflammatory state in CKD. Ghrelin may be also implicated and controversial studies suggest activities may be reduced in human CKD, and may provide a rationale for administration of acyl-ghrelin. Poor vitamin D status has also been associated with patient outcome and CVD risk and may indicate a role for supplementation. Glucocorticoid activities traditionally known for their involvement in the pathogenesis of a number of disease states are increased and may be implicated in CKD-associated hypertension, insulin resistance, diabetes risk and cachexia, both directly and indirectly through effects on other systems including activation of the mineralcorticoid receptor. Insight into the multiple factors altered in CKD may provide useful information on disease pathogenesis, clinical assessment and treatment rationale such as potential pharmacological, nutritional and exercise therapies

Central limit theorems in the configuration model

We prove a general normal approximation theorem for local graph statistics in the configuration model, together with an explicit bound on the error in the approximation with respect to the Wasserstein metric. Such statistics take the form $T := \sum_{v \in V} H_v$, where $V$ is the vertex set, and $H_v$ depends on a neighbourhood in the graph around $v$ of size at most $\ell$. The error bound is expressed in terms of $\ell$, $|V|$, an almost sure bound on $H_v$, the maximum vertex degree $d_{\max}$ and the variance of $T$. Under suitable assumptions on the convergence of the empirical degree distributions to a limiting distribution, we deduce that the size of the giant component in the configuration model has asymptotically Gaussian fluctuations.Comment: minor change

Explosive Collisions at RHIC?

Motivated by experimental results from RHIC, we suggest how a condensate for the Polyakov loop might produce explosive behavior at the QCD phase transition. This is due to a rapid rollover of the condensate field below the transition temperature

On the number of tetrahedra with minimum, unit, and distinct volumes in three-space

We formulate and give partial answers to several combinatorial problems on volumes of simplices determined by $n$ points in 3-space, and in general in $d$ dimensions. (i) The number of tetrahedra of minimum (nonzero) volume spanned by $n$ points in \RR^3 is at most ${2/3}n^3-O(n^2)$, and there are point sets for which this number is ${3/16}n^3-O(n^2)$. We also present an $O(n^3)$ time algorithm for reporting all tetrahedra of minimum nonzero volume, and thereby extend an algorithm of Edelsbrunner, O'Rourke, and Seidel. In general, for every k,d\in \NN, $1\leq k \leq d$, the maximum number of $k$-dimensional simplices of minimum (nonzero) volume spanned by $n$ points in \RR^d is $\Theta(n^k)$. (ii) The number of unit-volume tetrahedra determined by $n$ points in \RR^3 is $O(n^{7/2})$, and there are point sets for which this number is $\Omega(n^3 \log \log{n})$. (iii) For every d\in \NN, the minimum number of distinct volumes of all full-dimensional simplices determined by $n$ points in \RR^d, not all on a hyperplane, is $\Theta(n)$.Comment: 19 pages, 3 figures, a preliminary version has appeard in proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 200

Constant-Factor Approximation for TSP with Disks

We revisit the traveling salesman problem with neighborhoods (TSPN) and present the first constant-ratio approximation for disks in the plane: Given a set of $n$ disks in the plane, a TSP tour whose length is at most $O(1)$ times the optimal can be computed in time that is polynomial in $n$. Our result is the first constant-ratio approximation for a class of planar convex bodies of arbitrary size and arbitrary intersections. In order to achieve a $O(1)$-approximation, we reduce the traveling salesman problem with disks, up to constant factors, to a minimum weight hitting set problem in a geometric hypergraph. The connection between TSPN and hitting sets in geometric hypergraphs, established here, is likely to have future applications.Comment: 14 pages, 3 figure

Maximizing precision over extended unambiguous range for TOF range imaging systems

The maximum unambiguous range for time-of-flight range imaging systems is inversely proportional to the chosen modulation frequency. However, increasing the unambiguous range by decreasing the modulation frequency will generally also degrade the range measurement precision. We describe a technique that significantly extends the range of a time-of-flight imaging system without compromising range precision. This is achieved by employing two modulation frequencies simultaneously. The chosen frequencies can be a combination of high and low frequency, or two similarly high frequencies. In this paper we present experimental results comparing single frequency; dual high and low frequency; and dual high frequency operation and demonstrate that range precision need not be appreciably compromised to achieve an extended unambiguous range

Development and characterisation of an easily configurable range imaging system

Range imaging is becoming a popular tool for many applications, with several commercial variants now available. These systems find numerous real world applications such as interactive gaming and the automotive industry. This paper describes the development of a range imaging system employing the PMD-19 k sensor from PMD technologies. One specific advantage of our system is that it is extremely customisable in terms of modulation patterns to act as a platform for further research into time-of-flight range imaging. Experimental results are presented giving an indication of the precision and accuracy of the system, and how modifying certain operating parameters can improve system performance