U.S. National Parks and "The Tragedy of the Commons" : A contribution to the characterization of U.S. mountain guides' professional practice

This paper aims at presenting the stakes related to the access to protected land in the United States and to its conservation, through the analysis of the professional practice of U.S. mountain guides. From a methodological standpoint, this research is based both on a theoretical analysis grounded in the field of environmental economics and on an empirical study. The authors' starting point is Garrett Hardin's paper, "The Tragedy of the Commons" (Science, 1968), even if it introduces some confusion on the notion of common goods. So as to avoid this confusion, the authors use two theoretical tools pertaining to a typology of common goods and the different property rights that can be applied in National Parks. Finally, they apply this framework to the observations made on the field in Colorado in July 2009.

Risk determinants of acute mountain sickness in trekkers in the Nepali Himalaya: a 24-year follow-up.

OBJECTIVE: Exposure to altitude may lead to acute mountain sickness (AMS) in nonacclimatized individuals. We surveyed AMS prevalence and potential risk factors in trekkers crossing a 5400-m pass in Nepal and compared the results with those of 2 similar studies conducted 12 and 24 years earlier. METHODS: In April 2010, 500 surveys were distributed to English-speaking trekkers at 3500 m on their way to 5400 m, of which 332 (66%) surveys were returned complete. Acute mountain sickness was quantified with the Lake Louise Scoring System (LLSS, cutoff ≥3 and ≥5) and the Environmental Statistical Questionnaire III AMS-C score (ESQ-III, cutoff ≥0.7). We surveyed demographics, body mass index (BMI), smoking habit, rate of ascent, awareness of AMS, and acetazolamide use. RESULTS: Prevalence of AMS was 22%, 23%, and 48% (ESQ-III ≥0.7, LLSS ≥5, and LLSS ≥3, respectively) lower when compared with earlier studies. Risk factors for AMS were younger age, female sex, higher BMI, and smoking habit. Forty-two percent had elementary knowledge about the risk and prevention of AMS. Forty-four percent used acetazolamide. Trekkers took longer to climb from 3500 to 5400 m than in earlier studies. CONCLUSIONS: Prevalence of AMS continued to decline over a period of 24 years, likely as a result of slower ascent and increased use of acetazolamide. The AMS risk factors of younger age, female sex, and high BMI are consistent with prior studies. Awareness of risk and prevention of AMS remains low, indicating an opportunity to better educate trekkers and potentially further reduce AMS prevalence.

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).

Semi-online neural-Q_leaming for real-time robot learning

Reinforcement learning (RL) is a very suitable technique for robot learning, as it can learn in unknown environments and in real-time computation. The main difficulties in adapting classic RL algorithms to robotic systems are the generalization problem and the correct observation of the Markovian state. This paper attempts to solve the generalization problem by proposing the semi-online neural-Q_learning algorithm (SONQL). The algorithm uses the classic Q_learning technique with two modifications. First, a neural network (NN) approximates the Q_function allowing the use of continuous states and actions. Second, a database of the most representative learning samples accelerates and stabilizes the convergence. The term semi-online is referred to the fact that the algorithm uses the current but also past learning samples. However, the algorithm is able to learn in real-time while the robot is interacting with the environment. The paper shows simulated results with the "mountain-car" benchmark and, also, real results with an underwater robot in a target following behavior

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

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

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

Outbreak of Rocky Mountain spotted fever in Córdoba, Colombia

Rocky Mountain spotted fever (RMSF) is a tick-borne disease caused by the obligate intracellular bacterium Rickettsia rickettsii. Although RMSF was first reported in Colombia in 1937, it remains a neglected disease. Herein, we describe the investigation of a large cluster of cases of spotted fever rickettsiosis in a new area of Colombia.

Constraint algorithm for k-presymplectic Hamiltonian systems. Application to singular field theories

The k-symplectic formulation of field theories is especially simple, since only tangent and cotangent bundles are needed in its description. Its defining elements show a close relationship with those in the symplectic formulation of mechanics. It will be shown that this relationship also stands in the presymplectic case. In a natural way,one can mimick the presymplectic constraint algorithm to obtain a constraint algorithmthat can be applied to k-presymplectic field theory, and more particularly to the Lagrangian and Hamiltonian formulations offield theories defined by a singular Lagrangian, as well as to the unified Lagrangian-Hamiltonian formalism (Skinner--Rusk formalism) for k-presymplectic field theory. Two examples of application of the algorithm are also analyzed.

Stable carbon isotope composition of perirenal adipose tissue fatty acids from Engadine sheep grazing either mountain or lowland pasture

To provide further insights into ruminant lipid digestion and metabolism, and into cis9, trans-11 18:2 synthesis, 12 growing Engadine lambs grazing either mountain pasture (2,250 m above sea level; n = 6) or lowland pasture (400 m above sea level; n = 6) were studied. Both pastures consisted exclusively of C-3 plants. Before the experiment, all animals grazed a common pasture for 6 wk. Grasses and perirenal adipose tissues of the sheep were analyzed for fatty acids by gas chromatography. Stable C-isotope ratios (delta C-13 values in % vs. the Vienna Pee Dee Belemnite standard) were determined in the composite samples by elemental analysis-isotope ratio mass spectrometry. The delta C-13 of the individual fatty acids were measured by gas chromatography-combustion-isotope ratio mass spectrometry. The delta C-13 value of the entire mountain pasture grass was -27.5% (SD 0.31), whereas that of the lowland pasture grass was -30.0% (SD 0.07). This difference was reflected in the perirenal adipose tissues of the corresponding sheep (P < 0.05), even though the delta C-13 values were less in the animals than in the grass. The delta C-13 values for cis-9 16:1 and cis-9 18:1 in perirenal fat differed between mountain and lowland lambs (P < 0.05). The 16:0 in the adipose tissue was enriched in C-13 by 5% compared with the dietary 16:0, likely as a result of partly endogenous synthesis. The d13C values of cis-9, trans-11 18:2 (cis-9, trans-11 CLA) in the adipose tissue were smaller than those of its dietary precursors, cis-9, cis-12 18:2 and cis-9, cis-12, cis-15 18:3; conversely, the delta C-13 values of trans-11 18:1 were not, suggesting that large proportions of perirenal cis-9, trans-11 18:2 were of endogenous origin and discrimination against C-13 occurred during Delta(9)-desaturation. The same discrimination was indicated by the isotopic shift between 16:0 and cis-9 16:1 in the mountain grazing group. Furthermore, the delta C-13 values of cis-9, trans-11 18:2 were smaller relative to the precursor fatty acids in the mountain lambs compared with the lowland group. This result suggests a reduced extent of biohydrogenation in lambs grazing on mountain grass in comparison with those grazing on lowland grass. This was supported by the smaller cis-9, trans-11 18:2 concentrations in total fatty acids found in the adipose tissues of the lowland lambs (P < 0.001). The results of this study demonstrate that natural differences between delta C-13 values of swards from different pastures and the adipose tissue fatty acids could be used as tracers in studies of lipid metabolism in ruminants.

Risk assessment of recurrence in sporadic retinoblastoma using a molecular-based algorithm

Le rétinoblastome (Rb) est une tumeur provenant des cellules rétiniennes progénitrices des photorécepteurs. C'est la tumeur pédiatrique maligne la plus fréquente avec une incidence par naissance évaluée entre 1/15Ό00 et 1/20Ό00. Les enfants atteints de Rb sont diagnostiqué dans leur grande majorité avant l'âge de 4 ans, soit le temps nécessaire à la différentiation et à la maturation des photorécepteurs et donc à la disparition de la cellule d'origine du Rb. La survie du patient, la sauvegarde oculaire et le pronostic visuel restent excellents pour autant que le traitement ne soit pas différé. Dans sa variante non héréditaire (60%) le Rb est toujours unilatéral et sporadique. Le Rb héréditaire de transmission dominante autosomique (40%), se décline sous toutes les formes, familiale (10%) ou sporadique (30%), que l'atteinte soit unilatérale ou bilatérale. La majorité des mutations causales sont uniques et distribuées de façon aléatoire sur la totalité du gène RB1 sans région prédisposante. La détection de ces mutations est couteuse et chronophage, tout en présentant un taux de détection relativement bas; surtout dans les cas de Rb sporadiques unilatéraux. Dans le but d'identifier les patients présentant un risque réel de développer un Rb, et de réduire le nombre d'examens sous narcose requis pour le dépistage de la maladie chez les sujets à risque, nous avons développé une stratégie sensible, rapide, efficace et peu couteuse basée sur une analyse de l'haplotype intragénique. Cet algorithme prend en compte a) la perte d'hétérozygotie intratumorale du gène RB1, b) l'origine paternelle préférentielle des nouvelles mutations germinales et c) un risque a priori dérivé des données empiriques de Vogel. Pendant la période allant de janvier 1994 à décembre 2006, nous avons comparé l'apparition de nouveau Rb parmi la fratrie et la descendance de patient atteints au nombre de nouveaux cas attendus calculé par notre algorithme. 134 familles ont été étudiées. L'analyse moléculaire a été effectuée chez 570 personnes dont 99 patients âgés de moins de 4 ans et donc à risque de développer un Rb. Parmi cette cohorte, nous avons observé l'apparition d'un cas de Rb, alors que les risques cumulés a posteriori calculé par notre algorithme prédisait l'apparition de 1.77 nouveau cas. Dans cette étude, nous avons pu valider notre algorithme prédisant la récurrence de Rb chez les parents de 1er degré de patients atteints. Cet outil devrait grandement faciliter le conseil génétique ainsi que le suivi des patients à risque de développer un Rb, surtout dans les cas ou le séquençage direct du gène RB1 n'est pas disponible ou est resté non informatif. - Purpose: Most RBI mutations are unique and distributed throughout the RBI gene. Their detection can be time-consuming and the yield especially low in cases of conservatively-treated sporadic unilateral retinoblas-toma (Rb) patients. In order to identify patients with true risk of developing Rb, and to reduce the number of unnecessary examinations under anesthesia in all other cases, we developed a universal sensitive, efficient and cost-effective strategy based on intragenic haplotype analysis. Methods: This algorithm allows the calculation of the a posteriori risk of developing Rb and takes into account (a) RBI loss of heterozygosity in tumors, (b) preferential paternal origin of new germline mutations, (c) a priori risk derived from empirical data by Vogel, and (d) disease penetrance of 90% in most cases. We report the occurrence of Rb in first degree relatives of patients with sporadic Rb who visited the Jules Gonin Eye Hospital, Lausanne, Switzerland, from January 1994 to December 2006 compared to expected new cases of Rb using our algorithm. Results: A total of 134 families with sporadic Rb were enrolled; testing was performed in 570 individuals and 99 patients younger than 4 years old were identified. We observed one new case of Rb. Using our algorithm, the cumulated total a posteriori risk of recurrence was 1.77. Conclusions: This is the first time that linkage analysis has been validated to monitor the risk of recurrence in sporadic Rb. This should be a useful tool in genetic counseling, especially when direct RBI screening for mutations leaves a negative result or is unavailable.

Land use improves spatial predictions of mountain plant abundance but not presence-absence

Question Does a land-use variable improve spatial predictions of plant species presence-absence and abundance models at the regional scale in a mountain landscape? Location Western Swiss Alps. Methods Presence-absence generalized linear models (GLM) and abundance ordinal logistic regression models (LRM) were fitted to data on 78 mountain plant species, with topo-climatic and/or land-use variables available at a 25-m resolution. The additional contribution of land use when added to topo-climatic models was evaluated by: (1) assessing the changes in model fit and (2) predictive power, (3) partitioning the deviance respectively explained by the topo-climatic variables and the land-use variable through variation partitioning, and (5) comparing spatial projections. Results Land use significantly improved the fit of presence-absence models but not their predictive power. In contrast, land use significantly improved both the fit and predictive power of abundance models. Variation partitioning also showed that the individual contribution of land use to the deviance explained by presence-absence models was, on average, weak for both GLM and LRM (3.7% and 4.5%, respectively), but changes in spatial projections could nevertheless be important for some species. Conclusions In this mountain area and at our regional scale, land use is important for predicting abundance, but not presence-absence. The importance of adding land-use information depends on the species considered. Even without a marked effect on model fit and predictive performance, adding land use can affect spatial projections of both presence-absence and abundance models.

A Label space reduction algorithm for P2MP LSPs using asymmetric tunnels

The aim of traffic engineering is to optimise network resource utilization. Although several works on minimizing network resource utilization have been published, few works have focused on LSR label space. This paper proposes an algorithm that uses MPLS label stack features in order to reduce the number of labels used in LSPs forwarding. Some tunnelling methods and their MPLS implementation drawbacks are also discussed. The algorithm described sets up the NHLFE tables in each LSR, creating asymmetric tunnels when possible. Experimental results show that the algorithm achieves a large reduction factor in the label space. The work presented here applies for both types of connections: P2MP and P2P