Intraspecific competition reveals conditional fitness effects of single gene polymorphism at the Arabidopsis root growth regulator BRX.

Intraspecific genetic variation for morphological traits is observed in many organisms. In Arabidopsis thaliana, alleles responsible for intraspecific morphological variation are increasingly being identified. However, the fitness consequences remain unclear in most cases. Here, the fitness effects of alleles of the BRX gene are investigated. A brx loss-of-function allele, which was found in a natural accession, results in a highly branched but poorly elongated root system. Comparison between the control accession Sav-0 and an introgression of brx into this background (brxS) indicated that, surprisingly, brx loss of function did not negatively affect fitness in pure stands. However, in mixed, well-watered stands brxS performance and reproductive output decreased significantly, as the proportion of Sav-0 neighbors increased. Additional comparisons between brxS and a brxS line that was complemented by a BRX transgene confirmed a direct effect of the loss-of-function allele on plant performance, as indicated by restored competitive ability of the transgenic genotype. Further, because plant height was very similar across genotypes and because the experimental setup largely excluded shading effects, the impaired competitiveness of the brx loss-of-function genotype likely reflects below-ground competition. In summary, these data reveal conditional fitness effects of a single gene polymorphism in response to intraspecific competition in Arabidopsis.

The ins and outs of unemployment: An analysis conditional on technology shocks

We analyze how unemployment, job finding and job separation rates reactto neutral and investment-specific technology shocks. Neutral shocks increaseunemployment and explain a substantial portion of it volatility; investment-specificshocks expand employment and hours worked and contribute to hoursworked volatility. Movements in the job separation rates are responsible for theimpact response of unemployment while job finding rates for movements alongits adjustment path. The evidence warns against using models with exogenousseparation rates and challenges the conventional way of modelling technologyshocks in search and sticky price models.

Robust response transformations based on optimal prediction

Nonlinear regression problems can often be reduced to linearity by transforming the response variable (e.g., using the Box-Cox family of transformations). The classic estimates of the parameter defining the transformation as well as of the regression coefficients are based on the maximum likelihood criterion, assuming homoscedastic normal errors for the transformed response. These estimates are nonrobust in the presence of outliers and can be inconsistent when the errors are nonnormal or heteroscedastic. This article proposes new robust estimates that are consistent and asymptotically normal for any unimodal and homoscedastic error distribution. For this purpose, a robust version of conditional expectation is introduced for which the prediction mean squared error is replaced with an M scale. This concept is then used to develop a nonparametric criterion to estimate the transformation parameter as well as the regression coefficients. A finite sample estimate of this criterion based on a robust version of smearing is also proposed. Monte Carlo experiments show that the new estimates compare favorably with respect to the available competitors.

Revenue management under general discrete choice model of consumer behavior

Customer choice behavior, such as 'buy-up' and 'buy-down', is an importantphe-nomenon in a wide range of industries. Yet there are few models ormethodologies available to exploit this phenomenon within yield managementsystems. We make some progress on filling this void. Specifically, wedevelop a model of yield management in which the buyers' behavior ismodeled explicitly using a multi-nomial logit model of demand. Thecontrol problem is to decide which subset of fare classes to offer ateach point in time. The set of open fare classes then affects the purchaseprobabilities for each class. We formulate a dynamic program todetermine the optimal control policy and show that it reduces to a dynamicnested allocation policy. Thus, the optimal choice-based policy caneasily be implemented in reservation systems that use nested allocationcontrols. We also develop an estimation procedure for our model based onthe expectation-maximization (EM) method that jointly estimates arrivalrates and choice model parameters when no-purchase outcomes areunobservable. Numerical results show that this combined optimization-estimation approach may significantly improve revenue performancerelative to traditional leg-based models that do not account for choicebehavior.

On the efficiency and sensitivity of a pyramidal classification algorithm

In this paper we propose a Pyramidal Classification Algorithm,which together with an appropriate aggregation index producesan indexed pseudo-hierarchy (in the strict sense) withoutinversions nor crossings. The computer implementation of thealgorithm makes it possible to carry out some simulation testsby Monte Carlo methods in order to study the efficiency andsensitivity of the pyramidal methods of the Maximum, Minimumand UPGMA. The results shown in this paper may help to choosebetween the three classification methods proposed, in order toobtain the classification that best fits the original structureof the population, provided we have an a priori informationconcerning this structure.

A simple randomized algorithm for consistent sequential prediction of ergodic time series

We present a simple randomized procedure for the prediction of a binary sequence. The algorithm uses ideas from recent developments of the theory of the prediction of individual sequences. We show that if thesequence is a realization of a stationary and ergodic random process then the average number of mistakes converges, almost surely, to that of the optimum, given by the Bayes predictor.

MSISpIC: A Probabilistic Scan Matching Algorithm Using a Mechanical Scanned Imaging Sonar

This paper compares two well known scan matching algorithms: the MbICP and the pIC. As a result of the study, it is proposed the MSISpIC, a probabilistic scan matching algorithm for the localization of an Autonomous Underwater Vehicle (AUV). The technique uses range scans gathered with a Mechanical Scanning Imaging Sonar (MSIS), and the robot displacement estimated through dead-reckoning with the help of a Doppler Velocity Log (DVL) and a Motion Reference Unit (MRU). The proposed method is an extension of the pIC algorithm. Its major contribution consists in: 1) using an EKF to estimate the local path traveled by the robot while grabbing the scan as well as its uncertainty and 2) proposing a method to group into a unique scan, with a convenient uncertainty model, all the data grabbed along the path described by the robot. The algorithm has been tested on an AUV guided along a 600m path within a marina environment with satisfactory results

An Efficient Nominal Unification Algorithm

Nominal Unification is an extension of first-order unification where terms can contain binders and unification is performed modulo α equivalence. Here we prove that the existence of nominal unifiers can be decided in quadratic time. First, we linearly-reduce nominal unification problems to a sequence of freshness and equalities between atoms, modulo a permutation, using ideas as Paterson and Wegman for first-order unification. Second, we prove that solvability of these reduced problems may be checked in quadràtic time. Finally, we point out how using ideas of Brown and Tarjan for unbalanced merging, we could solve these reduced problems more efficiently

Validation of a clinical algorithm to identify low-risk patients with pulmonary embolism.

Summary Background: We previously derived a clinical prognostic algorithm to identify patients with pulmonary embolism (PE) who are at low-risk of short-term mortality who could be safely discharged early or treated entirely in an outpatient setting. Objectives: To externally validate the clinical prognostic algorithm in an independent patient sample. Methods: We validated the algorithm in 983 consecutive patients prospectively diagnosed with PE at an emergency department of a university hospital. Patients with none of the algorithm's 10 prognostic variables (age >/= 70 years, cancer, heart failure, chronic lung disease, chronic renal disease, cerebrovascular disease, pulse >/= 110/min., systolic blood pressure < 100 mm Hg, oxygen saturation < 90%, and altered mental status) at baseline were defined as low-risk. We compared 30-day overall mortality among low-risk patients based on the algorithm between the validation and the original derivation sample. We also assessed the rate of PE-related and bleeding-related mortality among low-risk patients. Results: Overall, the algorithm classified 16.3% of patients with PE as low-risk. Mortality at 30 days was 1.9% among low-risk patients and did not differ between the validation and the original derivation sample. Among low-risk patients, only 0.6% died from definite or possible PE, and 0% died from bleeding. Conclusions: This study validates an easy-to-use, clinical prognostic algorithm for PE that accurately identifies patients with PE who are at low-risk of short-term mortality. Low-risk patients based on our algorithm are potential candidates for less costly outpatient treatment.

Using graphical probability analysis (Bayes Nets) to evaluate a conditional DNA inclusion

This paper discusses the analysis of cases in which the inclusion or exclusion of a particular suspect, as a possible contributor to a DNA mixture, depends on the value of a variable (the number of contributors) that cannot be determined with certainty. It offers alternative ways to deal with such cases, including sensitivity analysis and object-oriented Bayesian networks, that separate uncertainty about the inclusion of the suspect from uncertainty about other variables. The paper presents a case study in which the value of DNA evidence varies radically depending on the number of contributors to a DNA mixture: if there are two contributors, the suspect is excluded; if there are three or more, the suspect is included; but the number of contributors cannot be determined with certainty. It shows how an object-oriented Bayesian network can accommodate and integrate varying perspectives on the unknown variable and how it can reduce the potential for bias by directing attention to relevant considerations and distinguishing different sources of uncertainty. It also discusses the challenge of presenting such evidence to lay audiences.

Conditional BDNF release under pathological conditions improves Huntington's disease pathology by delaying neuronal dysfunction

Background Brain-Derived Neurotrophic Factor (BDNF) is the main candidate for neuroprotective therapy for Huntington's disease (HD), but its conditional administration is one of its most challenging problems. Results Here we used transgenic mice that over-express BDNF under the control of the Glial Fibrillary Acidic Protein (GFAP) promoter (pGFAP-BDNF mice) to test whether up-regulation and release of BDNF, dependent on astrogliosis, could be protective in HD. Thus, we cross-mated pGFAP-BDNF mice with R6/2 mice to generate a double-mutant mouse with mutant huntingtin protein and with a conditional over-expression of BDNF, only under pathological conditions. In these R6/2:pGFAP-BDNF animals, the decrease in striatal BDNF levels induced by mutant huntingtin was prevented in comparison to R6/2 animals at 12 weeks of age. The recovery of the neurotrophin levels in R6/2:pGFAP-BDNF mice correlated with an improvement in several motor coordination tasks and with a significant delay in anxiety and clasping alterations. Therefore, we next examined a possible improvement in cortico-striatal connectivity in R62:pGFAP-BDNF mice. Interestingly, we found that the over-expression of BDNF prevented the decrease of cortico-striatal presynaptic (VGLUT1) and postsynaptic (PSD-95) markers in the R6/2:pGFAP-BDNF striatum. Electrophysiological studies also showed that basal synaptic transmission and synaptic fatigue both improved in R6/2:pGAP-BDNF mice. Conclusions These results indicate that the conditional administration of BDNF under the GFAP promoter could become a therapeutic strategy for HD due to its positive effects on synaptic plasticity.