Influence of central venous pressure upon sinus node responses to arterial baroreflex stimulation in man

Measurements were made of sinus node responses to arterial baroreceptor stimulation with phenylephrine injection or neck suction, before and during changes of central venous pressure provoked by lower body negative pressure or leg and lower truck elevation. Variations of central venous pressure between 1.1 and 9.0 mm Hg did not influence arterial baroreflex mediated bradycardia. Baroreflex sinus node responses were augmented by intravenous propranolol, but the level of responses after propranolol was comparable during the control state, lower body negative pressure, and leg and trunk elevation. Sinus node responses to very brief baroreceptor stimuli applied during the transitions of central venous pressure also were comparable in the three states. The authors conclude that physiological variations of central venous pressure do not influence sinus node responses to arterial baroreceptor stimulation in man

Influence of low and high pressure baroreceptors on plasma renin activity in humans

The effects of low and high pressure baroreceptors on plasma renin activity (immunoassay) were evaluated using graded lower body suction (LBS) in six healthy men. LBS at -10 and -20 mmHg for 10 min decreased central venous pressure without changing arterial pressure and thereby presumably reduced low but not high pressure baroreceptor inhibition of renin release. LBS at these levels produced forearm vasoconstriction, but did not increase renin. LBS at -40 mmHG decreased central venous and arterial pulse pressure and thus reduced both low and high pressure baroreceptor inhibition. LBS at this level produced forearm vasoconstriction and tachycardia and increased renin. In summary, reduction in low pressure baroreceptor inhibition in humans did not increase renin in the presence of physiological tonic inhibition from high pressure baroreceptors. Increases in renin did not occur until there was combined reduction of high and low pressure baroreceptor inhibition on plasma renin activity

A high-wavenumber boundary-element method for an acoustic scattering problem

In this paper we show stability and convergence for a novel Galerkin boundary element method approach to the impedance boundary value problem for the Helmholtz equation in a half-plane with piecewise constant boundary data. This problem models, for example, outdoor sound propagation over inhomogeneous flat terrain. To achieve a good approximation with a relatively low number of degrees of freedom we employ a graded mesh with smaller elements adjacent to discontinuities in impedance, and a special set of basis functions for the Galerkin method so that, on each element, the approximation space consists of polynomials (of degree $\nu$) multiplied by traces of plane waves on the boundary. In the case where the impedance is constant outside an interval $[a,b]$, which only requires the discretization of $[a,b]$, we show theoretically and experimentally that the $L_2$ error in computing the acoustic field on $[a,b]$ is ${\cal O}(\log^{\nu+3/2}|k(b-a)| M^{-(\nu+1)})$, where $M$ is the number of degrees of freedom and $k$ is the wavenumber. This indicates that the proposed method is especially commendable for large intervals or a high wavenumber. In a final section we sketch how the same methodology extends to more general scattering problems

A Galerkin boundary element method for high frequency scattering by convex polygons

In this paper we consider the problem of time-harmonic acoustic scattering in two dimensions by convex polygons. Standard boundary or finite element methods for acoustic scattering problems have a computational cost that grows at least linearly as a function of the frequency of the incident wave. Here we present a novel Galerkin boundary element method, which uses an approximation space consisting of the products of plane waves with piecewise polynomials supported on a graded mesh, with smaller elements closer to the corners of the polygon. We prove that the best approximation from the approximation space requires a number of degrees of freedom to achieve a prescribed level of accuracy that grows only logarithmically as a function of the frequency. Numerical results demonstrate the same logarithmic dependence on the frequency for the Galerkin method solution. Our boundary element method is a discretization of a well-known second kind combined-layer-potential integral equation. We provide a proof that this equation and its adjoint are well-posed and equivalent to the boundary value problem in a Sobolev space setting for general Lipschitz domains

Antibiotic Spacers in Shoulder Arthroplasty: Comparison of Stemmed and Stemless Implants.

Background: Antibiotic spacers in shoulder periprosthetic joint infection deliver antibiotics locally and provide temporary stability. The purpose of this study was to evaluate differences between stemmed and stemless spacers. Methods: All spacers placed from 2011 to 2013 were identified. Stemless spacers were made by creating a spherical ball of cement placed in the joint space. Stemmed spacers had some portion in the humeral canal. Operative time, complications, reimplantation, reinfection, and range of motion were analyzed. Results: There were 37 spacers placed: 22 were stemless and 15 were stemmed. The stemless spacer population was older (70.9 ± 7.8 years vs. 62.8 ± 8.4 years, p = 0.006). The groups had a similar percentage of each gender (stemless group, 45% male vs. stemmed group, 40% male; p = 0.742), body mass index (stemless group, 29.1 ± 6.4 kg/m2 vs. stemmed group, 31.5 ± 8.3 kg/m2; p = 0.354) and Charlson Comorbidity Index (stemless group, 4.2 ± 1.2 vs. stemmed group, 4.2 ± 1.7; p = 0.958). Operative time was similar (stemless group, 127.5 ± 37.1 minutes vs. stemmed group, 130.5 ± 39.4 minutes). Two stemless group patients had self-resolving radial nerve palsies. Within the stemless group, 15 of 22 (68.2%) underwent reimplantation with 14 of 15 having forward elevation of 109° ± 23°. Within the stemmed group, 12 of 15 (80.0%, p = 0.427) underwent reimplantation with 8 of 12 having forward elevation of 94° ± 43° (range, 30° to 150°; p = 0.300). Two stemmed group patients had axillary nerve palsies, one of which self-resolved but the other did not. One patient sustained dislocation of reverse shoulder arthroplasty after reimplantation. One stemless group patient required an open reduction and glenosphere exchange of dislocated reverse shoulder arthroplasty at 6 weeks after reimplantation. Conclusions: Stemmed and stemless spacers had similar clinical outcomes. When analyzing all antibiotic spacers, over 70% were converted to revision arthroplasties. The results of this study do not suggest superiority of either stemmed or stemless antibiotic spacers

Tuberin haploinsufficiency is associated with the loss of OGG1 in rat kidney tumors

<p>Abstract</p> <p>Background</p> <p>Tuberous sclerosis complex (TSC) is caused by defects in one of two tumor suppressor genes, <it>TSC-1 </it>or <it>TSC-2</it>. <it>TSC-2 </it>gene encodes tuberin, a protein involved in the pathogenesis of kidney tumors. Loss of heterozygosity (LOH) at the <it>TSC2 </it>locus has been detected in <it>TSC</it>-associated renal cell carcinoma (RCC) and in RCC in the Eker rat. Tuberin downregulates the DNA repair enzyme 8-oxoguanine DNA-glycosylase (OGG1) with important functional consequences, compromising the ability of cells to repair damaged DNA resulting in the accumulation of the mutagenic oxidized DNA, 8-oxo-dG. Loss of function mutations of OGG1 also occurs in human kidney clear cell carcinoma and may contribute to tumorgenesis. We investigated the distribution of protein expression and the activity of OGG1 and 8-oxo-dG and correlated it with the expression of tuberin in kidneys of wild type and Eker rats and tumor from Eker rat.</p> <p>Results</p> <p>Tuberin expression, OGG1 protein expression and activity were higher in kidney cortex than in medulla or papilla in both wild type and Eker rats. On the other hand, 8-oxo-dG levels were highest in the medulla, which expressed the lowest levels of OGG1. The basal levels of 8-oxo-dG were also higher in both cortex and medulla of Eker rats compared to wild type rats.</p> <p>In kidney tumors from Eker rats, the loss of the second <it>TSC2 </it>allele is associated with loss of OGG1 expression. Immunostaining of kidney tissue shows localization of tuberin and OGG1 mainly in the cortex.</p> <p>Conclusion</p> <p>These results demonstrate that OGG1 localizes with tuberin preferentially in kidney cortex. Loss of tuberin is accompanied by the loss of OGG1 contributing to tumorgenesis. In addition, the predominant expression of OGG1 in the cortex and its decreased expression and activity in the Eker rat may account for the predominant cortical localization of renal cell carcinoma.</p

Distributed Edge Connectivity in Sublinear Time

We present the first sublinear-time algorithm for a distributed message-passing network sto compute its edge connectivity $\lambda$ exactly in the CONGEST model, as long as there are no parallel edges. Our algorithm takes $\tilde O(n^{1-1/353}D^{1/353}+n^{1-1/706})$ time to compute $\lambda$ and a cut of cardinality $\lambda$ with high probability, where $n$ and $D$ are the number of nodes and the diameter of the network, respectively, and $\tilde O$ hides polylogarithmic factors. This running time is sublinear in $n$ (i.e. $\tilde O(n^{1-\epsilon})$) whenever $D$ is. Previous sublinear-time distributed algorithms can solve this problem either (i) exactly only when $\lambda=O(n^{1/8-\epsilon})$ [Thurimella PODC'95; Pritchard, Thurimella, ACM Trans. Algorithms'11; Nanongkai, Su, DISC'14] or (ii) approximately [Ghaffari, Kuhn, DISC'13; Nanongkai, Su, DISC'14]. To achieve this we develop and combine several new techniques. First, we design the first distributed algorithm that can compute a $k$-edge connectivity certificate for any $k=O(n^{1-\epsilon})$ in time $\tilde O(\sqrt{nk}+D)$. Second, we show that by combining the recent distributed expander decomposition technique of [Chang, Pettie, Zhang, SODA'19] with techniques from the sequential deterministic edge connectivity algorithm of [Kawarabayashi, Thorup, STOC'15], we can decompose the network into a sublinear number of clusters with small average diameter and without any mincut separating a cluster (except the `trivial' ones). Finally, by extending the tree packing technique from [Karger STOC'96], we can find the minimum cut in time proportional to the number of components. As a byproduct of this technique, we obtain an $\tilde O(n)$-time algorithm for computing exact minimum cut for weighted graphs.Comment: Accepted at 51st ACM Symposium on Theory of Computing (STOC 2019