185,888 research outputs found
Association between one-hour post-load plasma glucose levels and vascular stiffness in essential hypertension
Objectives: Pulse wave velocity (PWV) is a surrogate end-point for cardiovascular morbidity and mortality. A plasma glucose
value 155 mg/dl (NGT155 had a worse insulin sensitivity and higher hs-CRP than NGT,155, similar to IGT subjects. In addition, NGT 155 subjects, compared with NGT,155, have higher PWV and its hemodynamic correlates
that increase their cardiovascular risk profile
The effect of age on the relationship between cardiac and vascular function
Age-related changes in cardiac and vascular function are associated with increased risk of cardiovascular mortality and morbidity. The aim of the present study was to define the effect of age on the relationship between cardiac and vascular function. Haemodynamic and gas exchange measurements were performed at rest and peak exercise in healthy individuals. Augmentation index was measured at rest. Cardiac power output, a measure of overall cardiac function, was calculated as the product of cardiac output and mean arterial blood pressure. Augmentation index was significantly higher in older than younger participants (27.7 ± 10.1 vs. 2.5 ± 10.1%, P < 0.01). Older people demonstrated significantly higher stroke volume and mean arterial blood pressure (P < 0.05), but lower heart rate (145 ± 13 vs. 172 ± 10 beats/min, P < 0.01) and peak oxygen consumption (22.5 ± 5.2 vs. 41.2 ± 8.4 ml/kg/min, P < 0.01). There was a significant negative relationship between augmentation index and peak exercise cardiac power output (r = −0.73, P = 0.02) and cardiac output (r = −0.69, P = 0.03) in older participants. Older people maintain maximal cardiac function due to increased stroke volume. Vascular function is a strong predictor of overall cardiac function in older but in not younger people
ACGAN-based Data Augmentation Integrated with Long-term Scalogram for Acoustic Scene Classification
In acoustic scene classification (ASC), acoustic features play a crucial role
in the extraction of scene information, which can be stored over different time
scales. Moreover, the limited size of the dataset may lead to a biased model
with a poor performance for records from unseen cities and confusing scene
classes. In order to overcome this, we propose a long-term wavelet feature that
requires a lower storage capacity and can be classified faster and more
accurately compared with classic Mel filter bank coefficients (FBank). This
feature can be extracted with predefined wavelet scales similar to the FBank.
Furthermore, a novel data augmentation scheme based on generative adversarial
neural networks with auxiliary classifiers (ACGANs) is adopted to improve the
generalization of the ASC systems. The scheme, which contains ACGANs and a
sample filter, extends the database iteratively by splitting the dataset,
training the ACGANs and subsequently filtering samples. Experiments were
conducted on datasets from the Detection and Classification of Acoustic Scenes
and Events (DCASE) challenges. The results on the DCASE19 dataset demonstrate
the improved performance of the proposed techniques compared with the classic
FBank classifier. Moreover, the proposed fusion system achieved first place in
the DCASE19 competition and surpassed the top accuracies on the DCASE17
dataset
Non-Uniform Robust Network Design in Planar Graphs
Robust optimization is concerned with constructing solutions that remain
feasible also when a limited number of resources is removed from the solution.
Most studies of robust combinatorial optimization to date made the assumption
that every resource is equally vulnerable, and that the set of scenarios is
implicitly given by a single budget constraint. This paper studies a robustness
model of a different kind. We focus on \textbf{bulk-robustness}, a model
recently introduced~\cite{bulk} for addressing the need to model non-uniform
failure patterns in systems.
We significantly extend the techniques used in~\cite{bulk} to design
approximation algorithm for bulk-robust network design problems in planar
graphs. Our techniques use an augmentation framework, combined with linear
programming (LP) rounding that depends on a planar embedding of the input
graph. A connection to cut covering problems and the dominating set problem in
circle graphs is established. Our methods use few of the specifics of
bulk-robust optimization, hence it is conceivable that they can be adapted to
solve other robust network design problems.Comment: 17 pages, 2 figure
Contact homology and one parameter families of Legendrian knots
We consider S^1-families of Legendrian knots in the standard contact R^3. We
define the monodromy of such a loop, which is an automorphism of the
Chekanov-Eliashberg contact homology of the starting (and ending) point. We
prove this monodromy is a homotopy invariant of the loop. We also establish
techniques to address the issue of Reidemeister moves of Lagrangian projections
of Legendrian links. As an application, we exhibit a loop of right-handed
Legendrian torus knots which is non-contractible in the space Leg(S^1,R^3) of
Legendrian knots, although it is contractible in the space Emb(S^1,R^3) of
smooth knots. For this result, we also compute the contact homology of what we
call the Legendrian closure of a positive braid and construct an augmentation
for each such link diagram.Comment: Published by Geometry and Topology at
http://www.maths.warwick.ac.uk/gt/GTVol9/paper46.abs.htm
A scattering of orders
A linear ordering is scattered if it does not contain a copy of the rationals. Hausdorff characterised the class of scattered linear orderings as the least family of linear orderings that includes the class of well-orderings and reversed well-orderings, and is closed under lexicographic sums with index set in . More generally, we say that a partial ordering is -scattered if it does not contain a copy of any -dense linear ordering. We prove analogues of Hausdorff's result for -scattered linear orderings, and for -scattered partial orderings satisfying the finite antichain condition. We also study the -scattered partial orderings, where is the saturated linear ordering of cardinality , and a partial ordering is -scattered when it embeds no copy of . We classify the -scattered partial orderings with the finite antichain condition relative to the -scattered linear orderings. We show that in general the property of being a -scattered linear ordering is not absolute, and argue that this makes a classification theorem for such orderings hard to achieve without extra set-theoretic assumptions
- …
