Effect of inspiratory threshold loading on ventilatory kinetics during constant-load exercise.

Humoral factors play an important role in the control of exercise hyperpnea. The role of neuromechanical ventilatory factors, however, is still being investigated. We tested the hypothesis that the afferents of the thoracopulmonary system, and consequently of the neuromechanical ventilatory loop, have an influence on the kinetics of oxygen consumption (VO2), carbon dioxide output (VCO2), and ventilation (VE) during moderate intensity exercise. We did this by comparing the ventilatory time constants (tau) of exercise with and without an inspiratory load. Fourteen healthy, trained men (age 22.6 +/- 3.2 yr) performed a continuous incremental cycle exercise test to determine maximal oxygen uptake (VO2max = 55.2 +/- 5.8 ml x min(-1) x kg(-1)). On another day, after unloaded warm-up they performed randomized constant-load tests at 40% of their VO2max for 8 min, one with and the other without an inspiratory threshold load of 15 cmH2O. Ventilatory variables were obtained breath by breath. Phase 2 ventilatory kinetics (VO2, VCO2, and VE) could be described in all cases by a monoexponential function. The bootstrap method revealed small coefficients of variation for the model parameters, indicating an accurate determination for all parameters. Paired Student's t-tests showed that the addition of the inspiratory resistance significantly increased the tau during phase 2 of VO2 (43.1 +/- 8.6 vs. 60.9 +/- 14.1 s; P < 0.001), VCO2 (60.3 +/- 17.6 vs. 84.5 +/- 18.1 s; P < 0.001) and VE (59.4 +/- 16.1 vs. 85.9 +/- 17.1 s; P < 0.001). The average rise in tau was 41.3% for VO2, 40.1% for VCO2, and 44.6% for VE. The tau changes indicated that neuromechanical ventilatory factors play a role in the ventilatory response to moderate exercise.

Dynamic graphics of parametrically linked multivariate methods used in compositional data analysis

Many multivariate methods that are apparently distinct can be linked by introducing oneor more parameters in their definition. Methods that can be linked in this way arecorrespondence analysis, unweighted or weighted logratio analysis (the latter alsoknown as "spectral mapping"), nonsymmetric correspondence analysis, principalcomponent analysis (with and without logarithmic transformation of the data) andmultidimensional scaling. In this presentation I will show how several of thesemethods, which are frequently used in compositional data analysis, may be linkedthrough parametrizations such as power transformations, linear transformations andconvex linear combinations. Since the methods of interest here all lead to visual mapsof data, a "movie" can be made where where the linking parameter is allowed to vary insmall steps: the results are recalculated "frame by frame" and one can see the smoothchange from one method to another. Several of these "movies" will be shown, giving adeeper insight into the similarities and differences between these methods

An iterative Multiscale Finite-Volume algorithm converging to the exact solution

The multiscale finite volume (MsFV) method has been developed to efficiently solve large heterogeneous problems (elliptic or parabolic); it is usually employed for pressure equations and delivers conservative flux fields to be used in transport problems. The method essentially relies on the hypothesis that the (fine-scale) problem can be reasonably described by a set of local solutions coupled by a conservative global (coarse-scale) problem. In most cases, the boundary conditions assigned for the local problems are satisfactory and the approximate conservative fluxes provided by the method are accurate. In numerically challenging cases, however, a more accurate localization is required to obtain a good approximation of the fine-scale solution. In this paper we develop a procedure to iteratively improve the boundary conditions of the local problems. The algorithm relies on the data structure of the MsFV method and employs a Krylov-subspace projection method to obtain an unconditionally stable scheme and accelerate convergence. Two variants are considered: in the first, only the MsFV operator is used; in the second, the MsFV operator is combined in a two-step method with an operator derived from the problem solved to construct the conservative flux field. The resulting iterative MsFV algorithms allow arbitrary reduction of the solution error without compromising the construction of a conservative flux field, which is guaranteed at any iteration. Since it converges to the exact solution, the method can be regarded as a linear solver. In this context, the schemes proposed here can be viewed as preconditioned versions of the Generalized Minimal Residual method (GMRES), with a very peculiar characteristic that the residual on the coarse grid is zero at any iteration (thus conservative fluxes can be obtained).

Proposal of a parallel architecture for a motion detection algorithm

This paper proposes a parallel architecture for estimation of the motion of an underwater robot. It is well known that image processing requires a huge amount of computation, mainly at low-level processing where the algorithms are dealing with a great number of data. In a motion estimation algorithm, correspondences between two images have to be solved at the low level. In the underwater imaging, normalised correlation can be a solution in the presence of non-uniform illumination. Due to its regular processing scheme, parallel implementation of the correspondence problem can be an adequate approach to reduce the computation time. Taking into consideration the complexity of the normalised correlation criteria, a new approach using parallel organisation of every processor from the architecture is proposed

Implementation of a robust coded structured light technique for dynamic 3D measurements

This paper presents the implementation details of a coded structured light system for rapid shape acquisition of unknown surfaces. Such techniques are based on the projection of patterns onto a measuring surface and grabbing images of every projection with a camera. Analyzing the pattern deformations that appear in the images, 3D information of the surface can be calculated. The implemented technique projects a unique pattern so that it can be used to measure moving surfaces. The structure of the pattern is a grid where the color of the slits are selected using a De Bruijn sequence. Moreover, since both axis of the pattern are coded, the cross points of the grid have two codewords (which permits to reconstruct them very precisely), while pixels belonging to horizontal and vertical slits have also a codeword. Different sets of colors are used for horizontal and vertical slits, so the resulting pattern is invariant to rotation. Therefore, the alignment constraint between camera and projector considered by a lot of authors is not necessary

Speculative parallelization of multipath radiosity algorithm

In computer graphics, global illumination algorithms take into account not only the light that comes directly from the sources, but also the light interreflections. This kind of algorithms produce very realistic images, but at a high computational cost, especially when dealing with complex environments. Parallel computation has been successfully applied to such algorithms in order to make it possible to compute highly-realistic images in a reasonable time. We introduce here a speculation-based parallel solution for a global illumination algorithm in the context of radiosity, in which we have taken advantage of the hierarchical nature of such an algorithm

Lightweight monitoring of label switched paths for bandwidth management

The purpose of resource management is the efficient and effective use of network resources, for instance bandwidth. In this article, a connection oriented network scenario is considered, where a certain amount of bandwidth is reserved for each label switch path (LSP), which is a logical path, in a MPLS or GMPLS environment. Assuming there is also some kind of admission control (explicit or implicit), these environments typically provide quality of service (QoS) guarantees. It could happen that some LSPs become busy, thus rejecting connections, while other LSPs may be under-utilised. We propose a distributed lightweight monitoring technique, based on threshold values, the objective of which is to detect congestion when it occurs in an LSP and activate the corresponding alarm which will trigger a dynamic bandwidth reallocation mechanism

Dynamic bandwidth management as part of an integrated network management system based on distributed agents

We present a system for dynamic network resource configuration in environments with bandwidth reservation and path restoration mechanisms. Our focus is on the dynamic bandwidth management results, although the main goal of the system is the integration of the different mechanisms that manage the reserved paths (bandwidth, restoration, and spare capacity planning). The objective is to avoid conflicts between these mechanisms. The system is able to dynamically manage a logical network such as a virtual path network in ATM or a label switch path network in MPLS. This system has been designed to be modular in the sense that in can be activated or deactivated, and it can be applied only in a sub-network. The system design and implementation is based on a multi-agent system (MAS). We also included details of its architecture and implementation

Dynamic arterial elastance to predict arterial pressure response to volume loading in preload-dependent patients

INTRODUCTION Hemodynamic resuscitation should be aimed at achieving not only adequate cardiac output but also sufficient mean arterial pressure (MAP) to guarantee adequate tissue perfusion pressure. Since the arterial pressure response to volume expansion (VE) depends on arterial tone, knowing whether a patient is preload-dependent provides only a partial solution to the problem. The objective of this study was to assess the ability of a functional evaluation of arterial tone by dynamic arterial elastance (Ea(dyn)), defined as the pulse pressure variation (PPV) to stroke volume variation (SVV) ratio, to predict the hemodynamic response in MAP to fluid administration in hypotensive, preload-dependent patients with acute circulatory failure. METHODS We performed a prospective clinical study in an adult medical/surgical intensive care unit in a tertiary care teaching hospital, including 25 patients with controlled mechanical ventilation who were monitored with the Vigileo(®) monitor, for whom the decision to give fluids was made because of the presence of acute circulatory failure, including arterial hypotension (MAP ≤65 mmHg or systolic arterial pressure <90 mmHg) and preserved preload responsiveness condition, defined as a SVV value ≥10%. RESULTS Before fluid infusion, Ea(dyn) was significantly different between MAP responders (MAP increase ≥15% after VE) and MAP nonresponders. VE-induced increases in MAP were strongly correlated with baseline Ea(dyn) (r(2) = 0.83; P < 0.0001). The only predictor of MAP increase was Ea(dyn) (area under the curve, 0.986 ± 0.02; 95% confidence interval (CI), 0.84-1). A baseline Ea(dyn) value >0.89 predicted a MAP increase after fluid administration with a sensitivity of 93.75% (95% CI, 69.8%-99.8%) and a specificity of 100% (95% CI, 66.4%-100%). CONCLUSIONS Functional assessment of arterial tone by Ea(dyn), measured as the PVV to SVV ratio, predicted arterial pressure response after volume loading in hypotensive, preload-dependent patients under controlled mechanical ventilation.

Dissolution of Dynamic Electronic Institutions, a first approach: Relevant factors and causes

In the context of the digital business ecosystems, small organizations cooperate between them in order to achieve common goals or offer new services for expanding their markets. There are different approaches for these cooperation models such as virtual enterprises, virtual organizations or dynamic electronic institutions which in their lifecycle have in common a dissolution phase. However this phase has not been studied deeply in the current literature and it lacks formalization. In this paper a first approach for achieving and managing the dissolution phase is proposed, as well as a CBR process in order to support it in a multi-agent system

Predictive motion control of a mirosot mobile robot

This paper discusses predictive motion control of a MiRoSoT robot. The dynamic model of the robot is deduced by taking into account the whole process - robot, vision, control and transmission systems. Based on the obtained dynamic model, an integrated predictive control algorithm is proposed to position precisely with either stationary or moving obstacle avoidance. This objective is achieved automatically by introducing distant constraints into the open-loop optimization of control inputs. Simulation results demonstrate the feasibility of such control strategy for the deduced dynamic model

A Monte Carlo-Based Fiber Tracking Algorithm using Diffusion Tensor MRI

Diffusion tensor magnetic resonance imaging, which measures directional information of water diffusion in the brain, has emerged as a powerful tool for human brain studies. In this paper, we introduce a new Monte Carlo-based fiber tracking approach to estimate brain connectivity. One of the main characteristics of this approach is that all parameters of the algorithm are automatically determined at each point using the entropy of the eigenvalues of the diffusion tensor. Experimental results show the good performance of the proposed approach