Vanderbilt University

About: Vanderbilt University is a education organization based out in Nashville, Tennessee, United States. It is known for research contribution in the topics: Population & Cancer. The organization has 45066 authors who have published 106528 publications receiving 5435039 citations. The organization is also known as: Vandy.

Sotagliflozin in Patients with Diabetes and Recent Worsening Heart Failure

Abstract: Background Sodium–glucose cotransporter 2 (SGLT2) inhibitors reduce the risk of hospitalization for heart failure or death from cardiovascular causes among patients with stable heart failu...

6th International Consultation on Incontinence. Recommendations of the International Scientific Committee: Evaluation and treatment of urinary incontinence, pelvic organ prolapse and faecal incontinence

Abstract: Scientific report of the proceedings from the 6th International Consultation on Incontinence, (Tokyo 2016).

Increasing prevalence of multidrug-resistant Streptococcus pneumoniae in the United States.

Abstract: Background The emergence of drug-resistant strains of bacteria has complicated treatment decisions and may lead to treatment failures. Methods We examined data on invasive pneumococcal disease in patients identified from 1995 to 1998 in the Active Bacterial Core Surveillance program of the Centers for Disease Control and Prevention. Pneumococci that had a high level of resistance or had intermediate resistance according to the definitions of the National Committee for Clinical Laboratory Standards were defined as “resistant” for this analysis. Results During 1998, 4013 cases of invasive Streptococcus pneumoniae disease were reported (23 cases per 100,000 population); isolates were available for 3475 (87 percent). Overall, 24 percent of isolates from 1998 were resistant to penicillin. The proportion of isolates that were resistant to penicillin was highest in Georgia (33 percent) and Tennessee (35 percent), in children under five years of age (32 percent, vs. 21 percent for persons five or more years of ag...

NKCC1 transporter facilitates seizures in the developing brain

Abstract: During development, activation of Cl(-)-permeable GABA(A) receptors (GABA(A)-R) excites neurons as a result of elevated intracellular Cl(-) levels and a depolarized Cl(-) equilibrium potential (E(Cl)). GABA becomes inhibitory as net outward neuronal transport of Cl(-) develops in a caudal-rostral progression. In line with this caudal-rostral developmental pattern, GABAergic anticonvulsant compounds inhibit motor manifestations of neonatal seizures but not cortical seizure activity. The Na(+)-K(+)-2Cl(-) cotransporter (NKCC1) facilitates the accumulation of Cl(-) in neurons. The NKCC1 blocker bumetanide shifted E(Cl) negative in immature neurons, suppressed epileptiform activity in hippocampal slices in vitro and attenuated electrographic seizures in neonatal rats in vivo. Bumetanide had no effect in the presence of the GABA(A)-R antagonist bicuculline, nor in brain slices from NKCC1-knockout mice. NKCC1 expression level versus expression of the Cl(-)-extruding transporter (KCC2) in human and rat cortex showed that Cl(-) transport in perinatal human cortex is as immature as in the rat. Our results provide evidence that NKCC1 facilitates seizures in the developing brain and indicate that bumetanide should be useful in the treatment of neonatal seizures.

A linear time algorithm for computing exact Euclidean distance transforms of binary images in arbitrary dimensions

Abstract: A sequential algorithm is presented for computing the exact Euclidean distance transform (DT) of a k-dimensional binary image in time linear in the total number of voxels N. The algorithm, which is based on dimensionality reduction and partial Voronoi diagram construction, can be used for computing the DT for a wide class of distance functions, including the L/sub p/ and chamfer metrics. At each dimension level, the DT is computed by constructing the intersection of the Voronoi diagram whose sites are the feature voxels with each row of the image. This construction is performed efficiently by using the DT in the next lower dimension. The correctness and linear time complexity are demonstrated analytically and verified experimentally. The algorithm may be of practical value since it is relatively simple and easy to implement and it is relatively fast (not only does it run in O(N) time but the time constant is small). A simple modification of the algorithm computes the weighted Euclidean DT, which is useful for images with anisotropic voxel dimensions. A parallel version of the algorithm runs in O(N/p) time with p processors.