995 resultados para 280301 Programming Techniques


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Ligands and receptors of the TNF superfamily are therapeutically relevant targets in a wide range of human diseases. This chapter describes assays based on ELISA, immunoprecipitation, FACS, and reporter cell lines to monitor interactions of tagged receptors and ligands in both soluble and membrane-bound forms using unified detection techniques. A reporter cell assay that is sensitive to ligand oligomerization can identify ligands with high probability of being active on endogenous receptors. Several assays are also suitable to measure the activity of agonist or antagonist antibodies, or to detect interactions with proteoglycans. Finally, self-interaction of membrane-bound receptors can be evidenced using a FRET-based assay. This panel of methods provides a large degree of flexibility to address questions related to the specificity, activation, or inhibition of TNF-TNF receptor interactions in independent assay systems, but does not substitute for further tests in physiologically relevant conditions.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Objective: To evaluate the safety of the performance of the traditional and protected collection techniques of tracheal aspirate and to identify qualitative and quantitative agreement of the results of microbiological cultures between the techniques. Method: Clinical, prospective, comparative, single-blind research. The sample was composed of 54 patients of >18 years of age, undergoing invasive mechanical ventilation for a period of ≥48 hours and with suspected Ventilator Associated Pneumonia. The two techniques were implemented in the same patient, one immediately after the other, with an order of random execution, according to randomization by specialized software. Results: No significant events occurred oxygen desaturation, hemodynamic instability or tracheobronchial hemorrhage (p<0.05) and, although there were differences in some strains, there was qualitative and quantitative agreement between the techniques (p<0.001). Conclusion: Utilization of the protected technique provided no advantage over the traditional and execution of both techniques was safe for the patient.


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Histoire discursive du « cinéma-vérité ». Techniques, controverses, historiographie (1960-1970) retrace l'histoire du succès et de la disgrâce du label « cinéma vérité » en France qui, entre 1960 - date à laquelle Edgar Morin publie son essai programmatique « Pour un nouveau "cinéma vérité" » dans France Observateur - et 1964-65 - moment où la notion commence à perdre en popularité - sert de bannière à un mouvement cinématographique supposé renouveler les rapports entre cinéma et réalité. Une vingtaine de films - comme Chronique d'un été de Jean Rouch et Edgar Morin, Primary de Richard Leacock et Robert Drew, Les Inconnus de la terre ou Regard sur la folie de Mario Ruspoli, Hitler, connais pas de Bertrand Blier, Le Chemin de la mauvaise route de Jean Herman, Le Joli Mai de Chris Marker, La Punition de Jean Rouch ou Pour la Suite du monde de Michel Brault et Pierre Perrault - revendiquent cette étiquette ou y sont associés par la presse hexagonale qui y consacre des centaines d'articles. En effet, la sortie en salles de ces « films-vérité » provoque en France de virulentes controverses qui interrogent aussi bien l'éthique de ces projets où les personnes filmées sont supposées révéler une vérité intime face à la caméra, le statut artistique de ces réalisations, ou l'absence d'un engagement politique marqué des « cinéastes-vérité » devant les questions abordées par les protagonistes (par exemple la Guerre d'Algérie, la jeunesse française, la politique internationale). L'hypothèse à la base de cette recherche est que la production cinématographique qui se réclame du « cinéma-vérité » se caractérise par une étroite corrélation entre film et discours sur le film. D'une part car la première moitié de la décennie est marquée par de nombreuses rencontres entre les « cinéastes vérité », les critiques ou les constructeurs de caméras légères et de magnétophones synchrones ; rencontres qui contribuent à accentuer et à médiatiser les dissensions au sein du mouvement. D'autre part car la particularité de nombreux projets est d'inclure dans le film des séquences méta-discursives où les participants, les réalisateurs ou des experts débattent de la réussite du tournage. Ce travail montre que le succès du mouvement entre 1960 et 1964-65 ne se fait pas malgré une forte polémique, mais qu'au contraire, nombre de longs métrages intègrent la controverse en leur sein, interrogeant, sur un plan symbolique, l'abolition du filtre entre le film et son spectateur. Si les films qui s'inscrivent dans la mouvance du « cinéma vérité » octroient une large place à la confrontation, c'est parce que la « vérité » est pensée comme un processus dialectique, qui émerge dans une dynamique d'échanges (entre les réalisateurs de cette mouvance, entre les protagonistes, entre le film et son public). Les querelles internes ou publiques qui rythment ces quelques années font partie du dispositif « cinéma-vérité » et justifient de faire l'histoire de ce mouvement cinématographique par le biais des discours qu'il a suscité au sein de la cinéphilie française.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Fungal symbionts commonly occur in plants influencing host growth, physiology, and ecology (Carlile et al., 2001). However, while whole-plant growth responses to biotrophic fungi are readily demonstrated, it has been much more difficult to identify and detect the physiological mechanisms responsible. Previous work on the clonal grass Glyceria striata has revealed that the systemic fungal endophyte Epichloë glyceriae has a positive effect on clonal growth of its host (Pan & Clay, 2002; 2003). The latest study from these authors, in this issue (pp. 467- 475), now suggests that increased carbon movement in hosts infected by E. glyceriae may function as one mechanism by which endophytic fungi could increase plant growth. Given the widespread distribution of both clonal plants and symbiotic fungi, this research will have implications for our understanding of the ecology and evolution of fungus-plant associations in natural communities.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Models incorporating more realistic models of customer behavior, as customers choosing froman offer set, have recently become popular in assortment optimization and revenue management.The dynamic program for these models is intractable and approximated by a deterministiclinear program called the CDLP which has an exponential number of columns. However, whenthe segment consideration sets overlap, the CDLP is difficult to solve. Column generationhas been proposed but finding an entering column has been shown to be NP-hard. In thispaper we propose a new approach called SDCP to solving CDLP based on segments and theirconsideration sets. SDCP is a relaxation of CDLP and hence forms a looser upper bound onthe dynamic program but coincides with CDLP for the case of non-overlapping segments. Ifthe number of elements in a consideration set for a segment is not very large (SDCP) can beapplied to any discrete-choice model of consumer behavior. We tighten the SDCP bound by(i) simulations, called the randomized concave programming (RCP) method, and (ii) by addingcuts to a recent compact formulation of the problem for a latent multinomial-choice model ofdemand (SBLP+). This latter approach turns out to be very effective, essentially obtainingCDLP value, and excellent revenue performance in simulations, even for overlapping segments.By formulating the problem as a separation problem, we give insight into why CDLP is easyfor the MNL with non-overlapping considerations sets and why generalizations of MNL posedifficulties. We perform numerical simulations to determine the revenue performance of all themethods on reference data sets in the literature.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The choice network revenue management model incorporates customer purchase behavioras a function of the offered products, and is the appropriate model for airline and hotel networkrevenue management, dynamic sales of bundles, and dynamic assortment optimization.The optimization problem is a stochastic dynamic program and is intractable. A certainty-equivalencerelaxation of the dynamic program, called the choice deterministic linear program(CDLP) is usually used to generate dyamic controls. Recently, a compact linear programmingformulation of this linear program was given for the multi-segment multinomial-logit (MNL)model of customer choice with non-overlapping consideration sets. Our objective is to obtaina tighter bound than this formulation while retaining the appealing properties of a compactlinear programming representation. To this end, it is natural to consider the affine relaxationof the dynamic program. We first show that the affine relaxation is NP-complete even for asingle-segment MNL model. Nevertheless, by analyzing the affine relaxation we derive a newcompact linear program that approximates the dynamic programming value function betterthan CDLP, provably between the CDLP value and the affine relaxation, and often comingclose to the latter in our numerical experiments. When the segment consideration sets overlap,we show that some strong equalities called product cuts developed for the CDLP remain validfor our new formulation. Finally we perform extensive numerical comparisons on the variousbounds to evaluate their performance.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Radiological investigations using gadolinium or intravenous iodinated contrast products are used cautiously in patients suffering from chronic kidney disease because of their risk of acute kidney injury and systemic nephrogenic fibrosis. In this article, we review several radiological alternatives that can be useful to obtain renal anatomical and/or functional information in this patient population. The basic principles, indications, and advantages and limitations of Doppler ultrasound with measurement of the resistance index, contrast-enhanced ultrasound, and a technique called BOLD-MRI (blood-oxygenation level dependent-MRI) are discussed.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We present a new unifying framework for investigating throughput-WIP(Work-in-Process) optimal control problems in queueing systems,based on reformulating them as linear programming (LP) problems withspecial structure: We show that if a throughput-WIP performance pairin a stochastic system satisfies the Threshold Property we introducein this paper, then we can reformulate the problem of optimizing alinear objective of throughput-WIP performance as a (semi-infinite)LP problem over a polygon with special structure (a thresholdpolygon). The strong structural properties of such polygones explainthe optimality of threshold policies for optimizing linearperformance objectives: their vertices correspond to the performancepairs of threshold policies. We analyze in this framework theversatile input-output queueing intensity control model introduced byChen and Yao (1990), obtaining a variety of new results, including (a)an exact reformulation of the control problem as an LP problem over athreshold polygon; (b) an analytical characterization of the Min WIPfunction (giving the minimum WIP level required to attain a targetthroughput level); (c) an LP Value Decomposition Theorem that relatesthe objective value under an arbitrary policy with that of a giventhreshold policy (thus revealing the LP interpretation of Chen andYao's optimality conditions); (d) diminishing returns and invarianceproperties of throughput-WIP performance, which underlie thresholdoptimality; (e) a unified treatment of the time-discounted andtime-average cases.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper introduces the approach of using Total Unduplicated Reach and Frequency analysis (TURF) to design a product line through a binary linear programming model. This improves the efficiency of the search for the solution to the problem compared to the algorithms that have been used to date. The results obtained through our exact algorithm are presented, and this method shows to be extremely efficient both in obtaining optimal solutions and in computing time for very large instances of the problem at hand. Furthermore, the proposed technique enables the model to be improved in order to overcome the main drawbacks presented by TURF analysis in practice.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We develop a mathematical programming approach for the classicalPSPACE - hard restless bandit problem in stochastic optimization.We introduce a hierarchy of n (where n is the number of bandits)increasingly stronger linear programming relaxations, the lastof which is exact and corresponds to the (exponential size)formulation of the problem as a Markov decision chain, while theother relaxations provide bounds and are efficiently computed. Wealso propose a priority-index heuristic scheduling policy fromthe solution to the first-order relaxation, where the indices aredefined in terms of optimal dual variables. In this way wepropose a policy and a suboptimality guarantee. We report resultsof computational experiments that suggest that the proposedheuristic policy is nearly optimal. Moreover, the second-orderrelaxation is found to provide strong bounds on the optimalvalue.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The Network Revenue Management problem can be formulated as a stochastic dynamic programming problem (DP or the\optimal" solution V *) whose exact solution is computationally intractable. Consequently, a number of heuristics have been proposed in the literature, the most popular of which are the deterministic linear programming (DLP) model, and a simulation based method, the randomized linear programming (RLP) model. Both methods give upper bounds on the optimal solution value (DLP and PHLP respectively). These bounds are used to provide control values that can be used in practice to make accept/deny decisions for booking requests. Recently Adelman [1] and Topaloglu [18] have proposed alternate upper bounds, the affine relaxation (AR) bound and the Lagrangian relaxation (LR) bound respectively, and showed that their bounds are tighter than the DLP bound. Tight bounds are of great interest as it appears from empirical studies and practical experience that models that give tighter bounds also lead to better controls (better in the sense that they lead to more revenue). In this paper we give tightened versions of three bounds, calling themsAR (strong Affine Relaxation), sLR (strong Lagrangian Relaxation) and sPHLP (strong Perfect Hindsight LP), and show relations between them. Speciffically, we show that the sPHLP bound is tighter than sLR bound and sAR bound is tighter than the LR bound. The techniques for deriving the sLR and sPHLP bounds can potentially be applied to other instances of weakly-coupled dynamic programming.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Transcatheter aortic valve therapies are the newest established techniques for the treatment of high risk patients affected by severe symptomatic aortic valve stenosis. The transapical approach requires a left anterolateral mini-thoracotomy, whereas the transfemoral method requires an adequate peripheral vascular access and can be performed fully percutaneously. Alternatively, the trans-subclavian access has been recently proposed as a third promising approach. Depending on the technique, the fine stent-valve positioning can be performed with or without contrast injections. The transapical echo-guided stent-valve implantation without angiography (the Lausanne technique) relies entirely on transoesophageal echocardiogramme imaging for the fine stent-valve positioning and it has been proved that this technique prevents the onset of postoperative contrast-related acute kidney failure. Recent published reports have shown good hospital outcomes and short-term results after transcatheter aortic valve implantation, but there are no proven advantages in using the transfemoral or the transapical technique. In particular, the transapical series have a higher mean logistic Euroscore of 27-35%, a procedural success rate above 95% and a mean 30-day mortality between 7.5 and 17.5%, whereas the transfemoral results show a lower logistic Euroscore of 23-25.5%, a procedural success rate above 90% and a 30-day mortality of 7-10.8%. Nevertheless, further clinical trials and long-term results are mandatory to confirm this positive trend. Future perspectives in transcatheter aortic valve therapies would be the development of intravascular devices for the ablation of the diseased valve leaflets and the launch of new stent-valves with improved haemodynamic, different sizes and smaller delivery systems.