969 resultados para open loop
Resumo:
This paper examines the effects of permanent and transitory changes in government purchases in the context of a model of a small open economy that produces and consumes both traded and nontraded goods. The model incorporates an equilibrium interpretation of the business cycle that emphasizes the responsiveness of agents to intertemporal relative price changes. It is demonstrated that transitory increases in government purchases lead to an appreciation of the real exchange rate and an ambiguous change (although a likely worsening) in the current account, while permanent increases have an ambiguous impact on the real exchange rate and no effect on the current account. When agents do not know whether a given increase in government purchases is permanent or transitory the effect is a weighted average of these separate effects. The weights depend on the relative variances of the transitory and permanent components of government purchases. © 1985.
Resumo:
BACKGROUND: The ability to write clearly and effectively is of central importance to the scientific enterprise. Encouraged by the success of simulation environments in other biomedical sciences, we developed WriteSim TCExam, an open-source, Web-based, textual simulation environment for teaching effective writing techniques to novice researchers. We shortlisted and modified an existing open source application - TCExam to serve as a textual simulation environment. After testing usability internally in our team, we conducted formal field usability studies with novice researchers. These were followed by formal surveys with researchers fitting the role of administrators and users (novice researchers) RESULTS: The development process was guided by feedback from usability tests within our research team. Online surveys and formal studies, involving members of the Research on Research group and selected novice researchers, show that the application is user-friendly. Additionally it has been used to train 25 novice researchers in scientific writing to date and has generated encouraging results. CONCLUSION: WriteSim TCExam is the first Web-based, open-source textual simulation environment designed to complement traditional scientific writing instruction. While initial reviews by students and educators have been positive, a formal study is needed to measure its benefits in comparison to standard instructional methods.
Resumo:
Although lactic acidosis is a prominent feature of solid tumors, we still have limited understanding of the mechanisms by which lactic acidosis influences metabolic phenotypes of cancer cells. We compared global transcriptional responses of breast cancer cells in response to three distinct tumor microenvironmental stresses: lactic acidosis, glucose deprivation, and hypoxia. We found that lactic acidosis and glucose deprivation trigger highly similar transcriptional responses, each inducing features of starvation response. In contrast to their comparable effects on gene expression, lactic acidosis and glucose deprivation have opposing effects on glucose uptake. This divergence of metabolic responses in the context of highly similar transcriptional responses allows the identification of a small subset of genes that are regulated in opposite directions by these two conditions. Among these selected genes, TXNIP and its paralogue ARRDC4 are both induced under lactic acidosis and repressed with glucose deprivation. This induction of TXNIP under lactic acidosis is caused by the activation of the glucose-sensing helix-loop-helix transcriptional complex MondoA:Mlx, which is usually triggered upon glucose exposure. Therefore, the upregulation of TXNIP significantly contributes to inhibition of tumor glycolytic phenotypes under lactic acidosis. Expression levels of TXNIP and ARRDC4 in human cancers are also highly correlated with predicted lactic acidosis pathway activities and associated with favorable clinical outcomes. Lactic acidosis triggers features of starvation response while activating the glucose-sensing MondoA-TXNIP pathways and contributing to the "anti-Warburg" metabolic effects and anti-tumor properties of cancer cells. These results stem from integrative analysis of transcriptome and metabolic response data under various tumor microenvironmental stresses and open new paths to explore how these stresses influence phenotypic and metabolic adaptations in human cancers.
Resumo:
Given a probability distribution on an open book (a metric space obtained by gluing a disjoint union of copies of a half-space along their boundary hyperplanes), we define a precise concept of when the Fréchet mean (barycenter) is sticky. This nonclassical phenomenon is quantified by a law of large numbers (LLN) stating that the empirical mean eventually almost surely lies on the (codimension 1 and hence measure 0) spine that is the glued hyperplane, and a central limit theorem (CLT) stating that the limiting distribution is Gaussian and supported on the spine.We also state versions of the LLN and CLT for the cases where the mean is nonsticky (i.e., not lying on the spine) and partly sticky (i.e., is, on the spine but not sticky). © Institute of Mathematical Statistics, 2013.
Resumo:
BACKGROUND: Lumbar disc herniation has a prevalence of up to 58% in the athletic population. Lumbar discectomy is a common surgical procedure to alleviate pain and disability in athletes. We systematically reviewed the current clinical evidence regarding athlete return to sport (RTS) following lumbar discectomy compared to conservative treatment. METHODS: A computer-assisted literature search of MEDLINE, CINAHL, Web of Science, PEDro, OVID and PubMed databases (from inception to August 2015) was utilised using keywords related to lumbar disc herniation and surgery. The design of this systematic review was developed using the guidelines of the Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA). Methodological quality of individual studies was assessed using the Downs and Black scale (0-16 points). RESULTS: The search strategy revealed 14 articles. Downs and Black quality scores were generally low with no articles in this review earning a high-quality rating, only 5 articles earning a moderate quality rating and 9 of the 14 articles earning a low-quality rating. The pooled RTS for surgical intervention of all included studies was 81% (95% CI 76% to 86%) with significant heterogeneity (I(2)=63.4%, p<0.001) although pooled estimates report only 59% RTS at same level. Pooled analysis showed no difference in RTS rate between surgical (84% (95% CI 77% to 90%)) and conservative intervention (76% (95% CI 56% to 92%); p=0.33). CONCLUSIONS: Studies comparing surgical versus conservative treatment found no significant difference between groups regarding RTS. Not all athletes that RTS return at the level of participation they performed at prior to surgery. Owing to the heterogeneity and low methodological quality of included studies, rates of RTS cannot be accurately determined.
Resumo:
Emerging evidence suggests that microRNAs can initiate asymmetric division, but whether microRNA and protein cell fate determinants coordinate with each other remains unclear. Here, we show that miR-34a directly suppresses Numb in early-stage colon cancer stem cells (CCSCs), forming an incoherent feedforward loop (IFFL) targeting Notch to separate stem and non-stem cell fates robustly. Perturbation of the IFFL leads to a new intermediate cell population with plastic and ambiguous identity. Lgr5+ mouse intestinal/colon stem cells (ISCs) predominantly undergo symmetric division but turn on asymmetric division to curb the number of ISCs when proinflammatory response causes excessive proliferation. Deletion of miR-34a inhibits asymmetric division and exacerbates Lgr5+ ISC proliferation under such stress. Collectively, our data indicate that microRNA and protein cell fate determinants coordinate to enhance robustness of cell fate decision, and they provide a safeguard mechanism against stem cell proliferation induced by inflammation or oncogenic mutation.
Resumo:
The Bioinformatics Open Source Conference (BOSC) is organized by the Open Bioinformatics Foundation (OBF), a nonprofit group dedicated to promoting the practice and philosophy of open source software development and open science within the biological research community. Since its inception in 2000, BOSC has provided bioinformatics developers with a forum for communicating the results of their latest efforts to the wider research community. BOSC offers a focused environment for developers and users to interact and share ideas about standards; software development practices; practical techniques for solving bioinformatics problems; and approaches that promote open science and sharing of data, results, and software. BOSC is run as a two-day special interest group (SIG) before the annual Intelligent Systems in Molecular Biology (ISMB) conference. BOSC 2015 took place in Dublin, Ireland, and was attended by over 125 people, about half of whom were first-time attendees. Session topics included "Data Science;" "Standards and Interoperability;" "Open Science and Reproducibility;" "Translational Bioinformatics;" "Visualization;" and "Bioinformatics Open Source Project Updates". In addition to two keynote talks and dozens of shorter talks chosen from submitted abstracts, BOSC 2015 included a panel, titled "Open Source, Open Door: Increasing Diversity in the Bioinformatics Open Source Community," that provided an opportunity for open discussion about ways to increase the diversity of participants in BOSC in particular, and in open source bioinformatics in general. The complete program of BOSC 2015 is available online at http://www.open-bio.org/wiki/BOSC_2015_Schedule.
Resumo:
This chapter presents a model averaging approach in the M-open setting using sample re-use methods to approximate the predictive distribution of future observations. It first reviews the standard M-closed Bayesian Model Averaging approach and decision-theoretic methods for producing inferences and decisions. It then reviews model selection from the M-complete and M-open perspectives, before formulating a Bayesian solution to model averaging in the M-open perspective. It constructs optimal weights for MOMA:M-open Model Averaging using a decision-theoretic framework, where models are treated as part of the ‘action space’ rather than unknown states of nature. Using ‘incompatible’ retrospective and prospective models for data from a case-control study, the chapter demonstrates that MOMA gives better predictive accuracy than the proxy models. It concludes with open questions and future directions.
Resumo:
"Im Zuge der weiteren Verbreitung der Social Media und der internetbasierten Lehre, gewinnen eLearning Inhalte immer mehr an Bedeutung. In den Kontext von eLearning und internetbasierter Lehre gehören auch Open Educational Resources (OER). OER sind digitale Lern- und Lehrmaterialien, die frei für Lehrende und Studierende zugänglich sind und auch frei verbreitet werden dürfen. [...] Um OER auszutauschen, zu finden, zu beschaffen und sie auf einer breiten Basis zugänglich zu machen, insbesondere auch über Suchmaschinen und dadurch verwenden zu können, werden für die jeweiligen Materialien Metadaten benötigt. [...] Um die Frage nach dem Handlungs- und Forschungsbedarf zum Thema Metadaten für Open Educational Resources zu untersuchen, wird zunächst ein Überblick über die momentan bestehenden nationalen und internationalen Metadatenstandards für eLearning Objekte gegeben. [...] Hieraus ergeben sich Empfehlungen, welche Metadaten-Standards für die weitere Nutzung und Förderung geeignet sein könnten. Es werden außerdem die Möglichkeiten der Erstellung eines neuen Metadaten-Standards sowie eines gemeinsamen Portals für OER erörtert. Hierbei wird vor allem auf die zu erwartenden Probleme und die damit verbundenen Anforderungen eingegangen." (DIPF/Orig.)
Resumo:
The paper considers the open shop scheduling problem to minimize the make-span, provided that one of the machines has to process the jobs according to a given sequence. We show that in the preemptive case the problem is polynomially solvable for an arbitrary number of machines. If preemption is not allowed, the problem is NP-hard in the strong sense if the number of machines is variable, and is NP-hard in the ordinary sense in the case of two machines. For the latter case we give a heuristic algorithm that runs in linear time and produces a schedule with the makespan that is at most 5/4 times the optimal value. We also show that the two-machine problem in the nonpreemptive case is solvable in pseudopolynomial time by a dynamic programming algorithm, and that the algorithm can be converted into a fully polynomial approximation scheme. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 705–731, 1998
Resumo:
The paper presents an improved version of the greedy open shop approximation algorithm with pre-ordering of jobs. It is shown that the algorithm compares favorably with the greedy algorithm with no pre-ordering by reducing either its absolute or relative error. In the case of three machines, the new algorithm creates a schedule with the makespan that is at most 3/2 times the optimal value.
Resumo:
This paper considers the problem of minimizing the schedule length of a two-machine shop in which not only can a job be assigned any of the two possible routes, but also the processing times depend on the chosen route. This problem is known to be NP-hard. We describe a simple approximation algorithm that guarantees a worst-case performance ratio of 2. We also present some modifications to this algorithm that improve its performance and guarantee a worst-case performance ratio of 3=2.