On Certain Greedoid Polyhedra, Partially Indexable Scheduling Problems, and Extended Restless Bandit Allocation Indices

We present a polyhedral framework for establishing general structural properties on optimal solutions of stochastic scheduling problems, where multiple job classes vie for service resources: the existence of an optimal priority policy in a given family, characterized by a greedoid (whose feasible class subsets may receive higher priority), where optimal priorities are determined by class-ranking indices, under restricted linear performance objectives (partial indexability). This framework extends that of Bertsimas and Niño-Mora (1996), which explained the optimality of priority-index policies under all linear objectives (general indexability). We show that, if performance measures satisfy partial conservation laws (with respect to the greedoid), which extend previous generalized conservation laws, then the problem admits a strong LP relaxation over a so-called extended greedoid polytope, which has strong structural and algorithmic properties. We present an adaptive-greedy algorithm (which extends Klimov's) taking as input the linear objective coefficients, which (1) determines whether the optimal LP solution is achievable by a policy in the given family; and (2) if so, computes a set of class-ranking indices that characterize optimal priority policies in the family. In the special case of project scheduling, we show that, under additional conditions, the optimal indices can be computed separately for each project (index decomposition). We further apply the framework to the important restless bandit model (two-action Markov decision chains), obtaining new index policies, that extend Whittle's (1988), and simple sufficient conditions for their validity. These results highlight the power of polyhedral methods (the so-called achievable region approach) in dynamic and stochastic optimization.

Maternal side-effects after multiple courses of antenatal corticosteroids (MACS): the three-month follow-up of women in the randomized controlled trial of MACS for preterm birth study.

OBJECTIVE: A single course of antenatal corticosteroids (ACS) is associated with a reduction in respiratory distress syndrome and neonatal death. Multiple Courses of Antenatal Corticosteroids Study (MACS), a study involving 1858 women, was a multicentre randomized placebo-controlled trial of multiple courses of ACS, given every 14 days until 33+6 weeks or birth, whichever came first. The primary outcome of the study, a composite of neonatal mortality and morbidity, was similar for the multiple ACS and placebo groups (12.9% vs. 12.5%), but infants exposed to multiple courses of ACS weighed less, were shorter, and had smaller head circumferences. Thus for women who remain at increased risk of preterm birth, multiple courses of ACS (every 14 days) are not recommended. Chronic use of corticosteroids is associated with numerous side effects including weight gain and depression. The aim of this postpartum assessment was to ascertain if multiple courses of ACS were associated with maternal side effects. METHODS: Three months postpartum, women who participated in MACS were asked to complete a structured questionnaire that asked about maternal side effects of corticosteroid use during MACS and included the Edinburgh Postnatal Depression Scale. Women were also asked to evaluate their study participation. RESULTS: Of the 1858 women randomized, 1712 (92.1%) completed the postpartum questionnaire. There were no significant differences in the risk of maternal side effects between the two groups. Large numbers of women met the criteria for postpartum depression (14.1% in the ACS vs. 16.0% in the placebo group). Most women (94.1%) responded that they would participate in the trial again. CONCLUSION: In pregnancy, corticosteroids are given to women for fetal lung maturation and for the treatment of various maternal diseases. In this international multicentre randomized controlled trial, multiple courses of ACS (every 14 days) were not associated with maternal side effects, and the majority of women responded that they would participate in such a study again.

Le multiple evanescent white dot syndrome: une prédisposition génétique [Multiple evanescent white dot syndrome: a genetic predisposition?]

BACKGROUND: Multiple evanescent white dot syndrome (MEWDS) is a benign acquired isolated chorioretinal disorder. Symptoms include photopsia, visual blur and scotomas. Ocular examination reveals multiple white dots at the level of the deep retina. A parainfectious disorder was suggested but the exact mechanism of MEWDS is still unknown. Postulating that MEWDS might be an antigen driven inflammatory reaction, we analyzed HLA subtypes in patients with MEWDS. PATIENTS AND METHODS: Sixteen patients were diagnosed with MEWDS in Lausanne from 1985 to 1994. Blood was withdrawn in 9/16 patients. HLA-A, -B and -DR were sought. RESULTS: HLA-B51 was detected in 4/9 patients (44.4%). Other HLA subtypes were detected sporadically. CONCLUSIONS: The frequency of HLA-B51 haplotype was found to be 3.7 times more elevated than in a normal control caucasian group. This suggests the possibility that MEWDS might be a genetically determined disorder as it is the case for other ocular diseases like Birdshot chorioretinopathy (HLA-A29), Harada's disease (HLA-DRMT3), acute anterior uveitis (HLA-B27) or Behçet's disease (HLA-B51). We have no explanation for the presence of HLA-B51 in both Behçet's disease and MEWDS. The association of HLA-B51 and MEWDS needs confirmation by further testing.

High-resolution 3D whole-heart coronary MRA: a study on the combination of data acquisition in multiple breath-holds and 1D residual respiratory motion compensation.

OBJECT: To study a scan protocol for coronary magnetic resonance angiography based on multiple breath-holds featuring 1D motion compensation and to compare the resulting image quality to a navigator-gated free-breathing acquisition. Image reconstruction was performed using L1 regularized iterative SENSE. MATERIALS AND METHODS: The effects of respiratory motion on the Cartesian sampling scheme were minimized by performing data acquisition in multiple breath-holds. During the scan, repetitive readouts through a k-space center were used to detect and correct the respiratory displacement of the heart by exploiting the self-navigation principle in image reconstruction. In vivo experiments were performed in nine healthy volunteers and the resulting image quality was compared to a navigator-gated reference in terms of vessel length and sharpness. RESULTS: Acquisition in breath-hold is an effective method to reduce the scan time by more than 30 % compared to the navigator-gated reference. Although an equivalent mean image quality with respect to the reference was achieved with the proposed method, the 1D motion compensation did not work equally well in all cases. CONCLUSION: In general, the image quality scaled with the robustness of the motion compensation. Nevertheless, the featured setup provides a positive basis for future extension with more advanced motion compensation methods.

Biana: a software framework for compiling biological interactions and analyzing networks

Background: The analysis and usage of biological data is hindered by the spread of information across multiple repositories and the difficulties posed by different nomenclature systems and storage formats. In particular, there is an important need for data unification in the study and use of protein-protein interactions. Without good integration strategies, it is difficult to analyze the whole set of available data and its properties.Results: We introduce BIANA (Biologic Interactions and Network Analysis), a tool for biological information integration and network management. BIANA is a Python framework designed to achieve two major goals: i) the integration of multiple sources of biological information, including biological entities and their relationships, and ii) the management of biological information as a network where entities are nodes and relationships are edges. Moreover, BIANA uses properties of proteins and genes to infer latent biomolecular relationships by transferring edges to entities sharing similar properties. BIANA is also provided as a plugin for Cytoscape, which allows users to visualize and interactively manage the data. A web interface to BIANA providing basic functionalities is also available. The software can be downloaded under GNU GPL license from http://sbi.imim.es/web/BIANA.php.Conclusions: BIANA's approach to data unification solves many of the nomenclature issues common to systems dealing with biological data. BIANA can easily be extended to handle new specific data repositories and new specific data types. The unification protocol allows BIANA to be a flexible tool suitable for different user requirements: non-expert users can use a suggested unification protocol while expert users can define their own specific unification rules.

Cerebrospinal fluid in the diagnosis of multiple sclerosis: a consensus report.

The Committee of the European Concerted Action for Multiple Sclerosis (Charcot Foundation) organised five workshops to discuss CSF analytical standards in the diagnosis of multiple sclerosis. This consensus report from 12 European countries summarises the results of those workshops. It is hoped that neurologists will confer with their colleagues in clinical chemistry to arrange the best possible local practice. The most sensitive method for the detection of oligoclonal immunoglobulin bands is isoelectric focusing. The same amounts of IgG in parallel CSF and serum samples are used and oligoclonal bands are revealed with IgG specific antibody staining. All laboratories performing isoelectric focusing should check their technique at least annually using "blind" standards for the five different CSF and serum patterns. Quantitative measurements of IgG production in the CNS are less sensitive than isoelectric focusing. The preferred method for detection of blood-CSF barrier dysfunction is the albumin quotient. The CSF albumin or total protein concentrations are less satisfactory. These results must be interpreted with reference to the age of the patient and the local method of determination. Cells should be counted. The normal value is no more than 4 cells/microliters. Among evolving optional tests, measurement of the combined local synthesis of antibodies against measles, rubella, and/or varicella zoster could represent a significant advance if it offers higher specificity (not sensitivity) for identifying chronic rather than acute inflammation. Other tests that may have useful correlations with clinical indices include those for oligoclonal free light chains, IgM, IgA, or myelin basic protein concentrations.

Sclérose en plaques: au-delà des traitements de première ligne [Multiple sclerosis: beyong first line therapies].

We are currently experiencing a key period in the management of patients with relapsing remitting multiple sclerosis. The application of new criteria allows early diagnosis, thus at a stage when the available immune treatments are the most likely to show a good efficacy. The therapeutic offer is expanding but its complexity too. It is thus important, for a given patient, to assess as precisely as possible the degree of severity of his/her disease, in order to give the drug with the optimal risk/benefit ratio.

Zoledronate inhibits endothelial cell adhesion, migration and survival through the suppression of multiple, prenylation-dependent signaling pathways.

BACKGROUND: Recent evidence indicates that zoledronate, a nitrogen-containing bisphosphonate used to treat conditions of increased bone resorption, may have anti-angiogenic activity. The endothelial cells signaling events modulated by zoledronate remain largely elusive. OBJECTIVES: The aim of this work was to identify signaling events suppressed by zoledronate in endothelial cells and responsible for some of its biological effects. METHODS: Human umbilical vein endothelial cells (HUVEC) were exposed to zoledronate, isoprenoid analogs (i.e. farnesol and geranylgeraniol) and various inhibitors of signaling, and the effect on adhesion, survival, migration, actin cytoskeleton and signaling events characterized. RESULTS: Zoledronate reduced Ras prenylation, Ras and RhoA translocation to the membrane, and sustained ERK1/2 phosphorylation and tumor necrosis factor (TNF) induced JNK phosphorylation. Isoprenoid analogs attenuated zoledronate effects on HUVEC adhesion, actin stress fibers and focal adhesions, migration and survival. Isoprenoid analogs also restored Ras prenylation, RhoA translocation to the membrane, sustained FAK and ERK1/2 phosphorylation and prevented suppression of protein kinase B (PKB) and JNK phosphorylation in HUVEC exposed to TNF in the presence of zoledronate. Pharmacological inhibition of Rock, a RhoA target mediating actin fiber formation, phosphatidylinositol 3-kinase, an activator of PKB, MEK1/2, an activator of ERK1/2, and JNK, recapitulated individual zoledronate effects, consistent with the involvement of these molecules and pathways and their inhibition in the zoledronate effects. CONCLUSIONS: This work has demonstrated that zoledronate inhibits HUVEC adhesion, survival, migration and actin stress fiber formation by interfering with protein prenylation and has identified ERK1/2, JNK, Rock, FAK and PKB as kinases affected by zoledronate in a prenylation-dependent manner.

On certain greedoid polyhedra, partially indexable scheduling problems and extended restless bandit allocation indices

We present a polyhedral framework for establishing general structural properties on optimal solutions of stochastic scheduling problems, where multiple job classes vie for service resources: the existence of an optimal priority policy in a given family, characterized by a greedoid(whose feasible class subsets may receive higher priority), where optimal priorities are determined by class-ranking indices, under restricted linear performance objectives (partial indexability). This framework extends that of Bertsimas and Niño-Mora (1996), which explained the optimality of priority-index policies under all linear objectives (general indexability). We show that, if performance measures satisfy partial conservation laws (with respect to the greedoid), which extend previous generalized conservation laws, then theproblem admits a strong LP relaxation over a so-called extended greedoid polytope, which has strong structural and algorithmic properties. We present an adaptive-greedy algorithm (which extends Klimov's) taking as input the linear objective coefficients, which (1) determines whether the optimal LP solution is achievable by a policy in the given family; and (2) if so, computes a set of class-ranking indices that characterize optimal priority policies in the family. In the special case of project scheduling, we show that, under additional conditions, the optimal indices can be computed separately for each project (index decomposition). We further apply the framework to the important restless bandit model (two-action Markov decision chains), obtaining new index policies, that extend Whittle's (1988), and simple sufficient conditions for their validity. These results highlight the power of polyhedral methods (the so-called achievable region approach) in dynamic and stochastic optimization.

Computation of multiple correspondence analysis, with code in R

The generalization of simple correspondence analysis, for two categorical variables, to multiple correspondence analysis where they may be three or more variables, is not straighforward, both from a mathematical and computational point of view. In this paper we detail the exact computational steps involved in performing a multiple correspondence analysis, including the special aspects of adjusting the principal inertias to correct the percentages of inertia, supplementary points and subset analysis. Furthermore, we give the algorithm for joint correspondence analysis where the cross-tabulations of all unique pairs of variables are analysed jointly. The code in the R language for every step of the computations is given, as well as the results of each computation.

Multiple correspondence analysis of a subset of response categories

In the analysis of multivariate categorical data, typically the analysis of questionnaire data, it is often advantageous, for substantive and technical reasons, to analyse a subset of response categories. In multiple correspondence analysis, where each category is coded as a column of an indicator matrix or row and column of Burt matrix, it is not correct to simply analyse the corresponding submatrix of data, since the whole geometric structure is different for the submatrix . A simple modification of the correspondence analysis algorithm allows the overall geometric structure of the complete data set to be retained while calculating the solution for the selected subset of points. This strategy is useful for analysing patterns of response amongst any subset of categories and relating these patterns to demographic factors, especially for studying patterns of particular responses such as missing and neutral responses. The methodology is illustrated using data from the International Social Survey Program on Family and Changing Gender Roles in 1994.

Multiple sclerosis-related trigeminal neuralgia: a prospective series of 43 patients treated with gamma knife surgery with more than one year of follow-up.

BACKGROUND: Trigeminal neuralgia (TN) related to multiple sclerosis (MS) is more difficult to manage pharmacologically and surgically. OBJECTIVE: This article aims to evaluate the safety and efficacy of Gamma Knife surgery (GKS) in this special group of patients. METHODS: Between July 1992 and November 2010, 43 cases with more than 1 year of follow-up were operated with GKS for TN related to MS and prospectively evaluated in the Timone University Hospital, Marseille, France. Radiosurgery using the Gamma Knife (model B or C or Perfexion) was performed. A single 4-mm isocenter was positioned at a median distance of 8 mm (range 5.7-14.7) anterior to the emergence of the nerve. A median maximum dose of 85 Gy (range 75-90) was delivered. RESULTS: The median follow-up period was 53.8 months (12-157.1). Thirty-nine patients (90.7%) were initially pain free. Their actuarial probability of remaining pain free without medication at 6 months, 1, 3, 5 and 10 years was 87.2, 71.8, 43.1, 38.3 and 20.5%, respectively, and remained stable till 12 years. The hypoesthesia actuarial rate at 6 months, 1 and 2 years was 11.5, 11.5 and 16%, and remained stable till 12 years. CONCLUSIONS: GKS proved safe and effective in this special group of patients.

From correspondence analysis to multiple and joint correspondence analysis

The generalization of simple (two-variable) correspondence analysis to more than two categorical variables, commonly referred to as multiple correspondence analysis, is neither obvious nor well-defined. We present two alternative ways of generalizing correspondence analysis, one based on the quantification of the variables and intercorrelation relationships, and the other based on the geometric ideas of simple correspondence analysis. We propose a version of multiple correspondence analysis, with adjusted principal inertias, as the method of choice for the geometric definition, since it contains simple correspondence analysis as an exact special case, which is not the situation of the standard generalizations. We also clarify the issue of supplementary point representation and the properties of joint correspondence analysis, a method that visualizes all two-way relationships between the variables. The methodology is illustrated using data on attitudes to science from the International Social Survey Program on Environment in 1993.

Variance reduction methods for simulation of densities on Wiener space

We develop a general error analysis framework for the Monte Carlo simulationof densities for functionals in Wiener space. We also study variancereduction methods with the help of Malliavin derivatives. For this, wegive some general heuristic principles which are applied to diffusionprocesses. A comparison with kernel density estimates is made.

Location of multiple server common service centers or public facilities for minimizing general congestion and travel cost functions

We propose a model and solution methods, for locating a fixed number ofmultiple-server, congestible common service centers or congestible publicfacilities. Locations are chosen so to minimize consumers congestion (orqueuing) and travel costs, considering that all the demand must be served.Customers choose the facilities to which they travel in order to receiveservice at minimum travel and congestion cost. As a proxy for thiscriterion, total travel and waiting costs are minimized. The travel costis a general function of the origin and destination of the demand, whilethe congestion cost is a general function of the number of customers inqueue at the facilities.