bluuebunny/crossref_metadata_2025_split huggingface dataset:
α‐Synuclein Neuropathology is Controlled by Nuclear Hormone Receptors and Enhanced by Docosahexaenoic Acid in A Mouse Model for Parkinson's Disease
Authors: Yakunin Eugenia , Loeb Virginie , Kisos Haya , Biala Yoav , Yehuda Shlomo , Yaari Yoel , Selkoe Dennis J. , Sharon Ronit 
Published: September 2011

Abstractα‐Synuclein (α‐Syn) is a neuronal protein that accumulates progressively in Parkinson's disease (PD) and related synucleinopathies. Attempting to identify cellular factors that affect α‐Syn neuropathology, we previously reported that polyunsaturated fatty acids (PUFAs) promote α‐Syn oligomerization and aggregation in cultured cells. We now report that docosahexaenoic acid (DHA), a 22:6 PUFA, affects α‐Syn oligomerization by activating retinoic X receptor (RXR) and peroxisome proliferator‐activated receptor γ2 (PPARγ2). In addition, we show that dietary changes in brain DHA levels affect α‐Syn cytopathology in mice transgenic for the PD‐causing A53T mutation in human α‐Syn. A diet enriched in DHA, an activating ligand of RXR, increased the accumulation of soluble and insoluble neuronal α‐Syn, neuritic injury and astrocytosis. Conversely, abnormal accumulations of α‐Syn and its deleterious effects were significantly attenuated by low dietary DHA levels. Our results suggest a role for activated RXR/PPARγ 2, obtained by elevated brain PUFA levels, in α‐Syn neuropathology.
Total Phenolic Content, Consumer Acceptance, and Instrumental Analysis of Bread Made with Grape Seed Flour
Authors: Hoye, Jr Clifford , Ross Carolyn F. 
Published: September 2011

Abstract:  Grape seed flour (GSF) from grape pomace, a waste product generated during winemaking, was explored for use in bread production due to its potential health benefits. This study evaluated the consumer acceptance and physical properties of bread, including total phenolic content (TPC), made with varying levels of GSF. Dough and breads were prepared using different levels of replacement of hard red spring wheat flour (HRS) with GSF (0 to 10 g GSF/100 g HRS) and stored for 0, 2, or 6 wk at −20 °C. Replacement of 10 g GSF/100 g HRS increased the bread TPC from 0.064 mg tannic acid/g dry weight to 4.25 mg tannic acid/g dry weight. Consumer acceptance and instrumental analyses were used to investigate changes in sensory and texture properties due to GSF replacement. Replacement above 5 g GSF/100 g HRS decreased the loaf brightness and volume, with an increase in the bread hardness and porosity. Generally, breads containing ≥ 7.5 g GSF/100 g HRS were characterized by lower consumer acceptance. A reduction in overall and bitterness acceptance was observed in bread at 10 g GSF/100 g HRS, with decreased acceptance of astringency and sweetness at 7.5 and 10 g GSF/100 g HRS. Based on these results, the replacement of 5 g GSF/100 g HRS is recommended for the production of fortified breads with acceptable physical and sensory properties and high TPC activity compared to refined bread.Practical Applications:  This study shows that grape seed flour (GSF) can be used to replace hard red spring wheat flour (HRS) in bread production, with moderate impact on the physical and sensory properties of the bread. Replacement of up to 10 g GSF/100 g HRS significantly decreased overall consumer acceptance of the bread, with lower consumer acceptance of sweetness and astringency at 7.5 and 10 g GSF/100 g HRS. Thus, a replacement value of 5 g GSF/100 g HRS is recommended for the production of fortified breads.
Decisions about weight management: a synthesis of qualitative studies of obesity
Authors: Brown I. , Gould J. 
Published: September 2011

SummaryThere is a high non‐attendance and dropout attrition from weight management interventions for adults with obesity. Patient dissatisfaction with consultations involving decisions about interventions may be a factor. A systematic review was undertaken of qualitative studies reporting perceptions, experiences, contexts and influences for adults facing, or reflecting on, weight management. The aim was to synthesize a generic model of influences on decision‐making about weight management for adult patients. Electronic database and hand searches identified 29 qualitative studies involving 1387 participants (mean age 45.3 years; mean BMI 37.1 kg m−2; 79.9% women). Seven overarching themes were inductively derived from extracted data spanning: cultural identity; social structures such as gender; responses to obesity stigma; previous weight loss experiences; personal motivators and barriers; social support; and practical resources. A model is presented in the paper. Improving decisions about weight management requires attention to how diffuse cultural and psycho‐social factors, such as obesity stigma, influence patient choices. Reflection on experiences of previous attempts at weight loss is also essential, as are practical resource factors – particularly for less affluent groups. Considering these factors along with more established theories of individual psychological motivations and barriers may help to improve initial participation and retention within interventions.
Modeling
of Thermally Driven Resonance at Multiscales
Authors: Srinivasan P. , Mark
Spearing S. 
Published: September 2011

Abstract
Understanding the mechanisms of thermally driven resonance is a key for designing many engineering and physical systems especially at small scales. This paper focuses on the modeling aspects of such phenomena using the classical Fourier diffusion theory. Critical analysis revealed that the thermally induced resonant excitation is characterized by the generation of multiple wave trains with a constant phase shift as opposed to the single standing wave generated in a mechanically driven resonant response. The hypothesis proposed herein, underpin a broad range of scientific and technological developments and the analytical treatment enables design of thermally driven resonant systems with improved performance.
Molecular Characterization of UpaB and UpaC, Two New Autotransporter Proteins of Uropathogenic Escherichia coli CFT073
Authors: Allsopp Luke P. , Beloin Christophe , Ulett Glen C. , Valle Jaione , Totsika Makrina , Sherlock Orla , Ghigo Jean-Marc , Schembri Mark A. 
Published: September 2011

ABSTRACT

Uropathogenic
Escherichia coli
(UPEC) is the primary cause of urinary tract infection (UTI) in the developed world. The major factors associated with virulence of UPEC are fimbrial adhesins, which mediate specific attachment to host receptors and trigger innate host responses. Another group of adhesins is represented by the autotransporter (AT) subgroup of proteins. The genome-sequenced prototype UPEC strain CFT073 contains 11 putative AT-encoding genes. In this study, we have performed a detailed molecular characterization of two closely related AT adhesins from CFT073: UpaB (c0426) and UpaC (c0478). PCR screening revealed that the
upaB
and
upaC
AT-encoding genes are common in
E. coli
. The
upaB
and
upaC
genes were cloned and characterized in a recombinant
E. coli
K-12 strain background. This revealed that they encode proteins located at the cell surface but possess different functional properties: UpaB mediates adherence to several ECM proteins, while UpaC expression is associated with increased biofilm formation. In CFT073,
upaB
is expressed while
upaC
is transcriptionally repressed by the global regulator H-NS. In competitive colonization experiments employing the mouse UTI model, CFT073 significantly outcompeted its
upaB
(but not
upaC
) isogenic mutant strain in the bladder. This attenuated phenotype was also observed in single-challenge experiments, where deletion of the
upaB
gene in CFT073 significantly reduced early colonization of the bladder.
Impact of facilitating physician access to relevant medical literature on outcomes of hospitalised internal medicine patients: a randomised controlled trial
Authors: Izcovich Ariel , Malla Carlos Gonzalez , Diaz Martín Miguel , Manzotti Matías , Catalano Hugo Norberto 
Published: September 2011

IntroductionThere is limited high-quality evidence regarding the usefulness of bibliographic assistance in improving clinically important outcomes in hospitalised patients. This study was designed to evaluate the impact of providing attending physicians with bibliographic information to assist them in answering medical questions that arise during daily clinical practice.MethodsAll patients admitted to the Internal Medicine ward of Hospital Aleman in Buenos Aires between March and August 2010 were randomly assigned to one of two groups: intervention or control. Throughout this period, the medical questions that arose during morning rounds were identified. Bibliographic research was conducted to answer only those questions that emerged during the discussion of patients assigned to the intervention group. The compiled information was sent via e-mail to all members of the medical team.Results809 patients were included in the study, 407 were randomly assigned to a search-supported group and 402 to a control group. There was no significant difference in death or transfer to an intensive care unit (ICU) (RR 1.09 (95% CI 0.7 to 1.6)), rehospitalisation (RR 1.0 (95% CI 0.7 to 1.3)) or length of hospitalisation (6.5 vs 6.0 days, p=0.25). The subgroup of search-supported physicians' patients (n=31), whose attending physicians received hand-delivered information, had a significantly lower risk of death or transfer to an ICU compared with the control group (0% vs 13.7%, p=0.03).ConclusionsThe impact of bibliographic assistance on clinically important outcomes could not be proven by this study. However, results suggest that some interventions, such as delivering information by hand, might be beneficial in a subgroup of inpatients.
Outcomes of therapeutic hypothermia in unconscious patients after near-hanging
Authors: Lee Byung Kook , Jeung Kyung Woon , Lee Hyoung Youn , Lim Jae Hoon 
Published: September 2011

BackgroundHanging has been increasingly used to commit suicide. There is no specific treatment besides general intensive care after near-hanging. Therapeutic hypothermia (TH) has been used in unconscious patients after near-hanging.ObjectiveTo describe the outcomes in unconscious patients after near-hanging in order to determine whether TH improves the outcome of near-hanging injury.MethodsMedical charts were reviewed of unconscious patients after near-hanging who presented to Chonnam National University Hospital between January 2006 and December 2010 and who were considered to be eligible for TH. According to local policy, unconscious survivors after near-hanging, whether or not they experienced cardiac arrest at the scene, were treated with TH if this was agreed by next-of-kin.ResultsThere were 16 survivors of asphyxial cardiac arrest after near-hanging, of whom 13 received TH. Among them, only one (7.7%, 95% CI 1.4% to 33.3%) attained Cerebral Performance Category (CPC) 1; the other 15 patients had poor neurological outcomes (CPC 5 in seven patients and CPC 4 in eight patients). Nine of the patients did not experience cardiac arrest at the scene and of these, four received TH and five received normothermic treatment. All patients who did not have cardiac arrest recovered and were discharged with CPC 1.ConclusionIn this study, outcomes in unconscious near-hanging patients with cardiac arrest were poor despite treatment with TH. Before recommending TH in near-hanging patients, a prospective, randomised controlled study is required.
Towards a comprehensive theory of monadic effects
Authors: Filinski Andrzej 
Published: September 2011

It has been more than 20 years since monads were proposed as a unifying concept for computational effects, in both formal semantics and functional programs. Over that period, there has been substantial incremental progress on several fronts within the ensuing research area, including denotational, operational, and axiomatic characterizations of effects; principles and frameworks for combining effects; prescriptive vs. descriptive effect-type systems; specification vs. implementation of effects; and realizations of effect-related theoretical constructions in practical functional languages, both eager and lazy. Yet few would confidently claim that programs with computational effects are by now as well understood, and as thoroughly supported by formal reasoning techniques, as types and terms in purely functional settings.
This talk outlines (one view of) the landscape of effectful functional programming, and attempts to assess our collective progress towards the goal of a broad yet coherent theory of monadic effects. We are not quite there yet, but intriguingly, many potential ingredients of such a theory have been repeatedly discovered and developed, with only minor variations, in seemingly unrelated contexts. Some stronger-than-expected ties between the research topics mentioned above also instill hope that there is indeed a natural, comprehensive theory of monadic effects, waiting to be fully explicated.
Implicit self-adjusting computation for purely functional programs
Authors: Chen Yan , Dunfield Jana , Hammer Matthew A. , Acar Umut A. 
Published: September 2011

Computational problems that involve dynamic data, such as physics simulations and program development environments, have been an important subject of study in programming languages. Building on this work, recent advances in self-adjusting computation have developed techniques that enable programs to respond automatically and efficiently to dynamic changes in their inputs. Self-adjusting programs have been shown to be efficient for a reasonably broad range of problems but the approach still requires an explicit programming style, where the programmer must use specific monadic types and primitives to identify, create and operate on data that can change over time.
We describe techniques for automatically translating purely functional programs into self-adjusting programs. In this implicit approach, the programmer need only annotate the (top-level) input types of the programs to be translated. Type inference finds all other types, and a type-directed translation rewrites the source program into an explicitly self-adjusting target program. The type system is related to information-flow type systems and enjoys decidable type inference via constraint solving. We prove that the translation outputs well-typed self-adjusting programs and preserves the source program's input-output behavior, guaranteeing that translated programs respond correctly to all changes to their data. Using a cost semantics, we also prove that the translation preserves the asymptotic complexity of the source program.
Programming assurance cases in Agda
Authors: Takeyama Makoto 
Published: September 2011

Agda is a modern functional programming language equipped with an interactive proof assistant as its developing environment. Its features include dependent types, type universe, inductive and coinductive families of types, pattern matching, records, and nested parameterized modules. Based on the "propositions as types, proofs as programs" correspondence in Martin-Löf's Type Theory, Agda lets users to construct, verify, and execute a smooth mixture of programs and proofs.
Using Agda is similar to using an editor in a modern IDE. Users have more direct control over how programs / proofs are written than in automation-oriented systems using command-scripts for proof construction. Agda thus encourages users to express their ideas with more sophisticated dependently typed programming and less logical proofs. Programming techniques for readability and maintainability now translate to techniques for writing verified documents for human communication.
Agda has been developed at Chalmers University of Technology by Ulf Norell and others. A growing international community of developers and users applies it in research, education, and industry. At AIST in Japan, we aim to introduce its merits to construction, verification, maintenance, and run-time evaluation of "assurance cases", which are documented bodies of systems assurance arguments used as the hub for assurance- and risk-communication among stakeholders.
The talk gives an overview of Agda and presents our current effort on programming assurance cases in Agda.
On the bright side of type classes
Authors: Devriese Dominique , Piessens Frank 
Published: September 2011

We present instance arguments: an alternative to type classes and related features in the dependently typed, purely functional programming language/proof assistant Agda. They are a new, general type of function arguments, resolved from call-site scope in a type-directed way. The mechanism is inspired by both Scala's implicits and Agda's existing implicit arguments, but differs from both in important ways. Our mechanism is designed and implemented for Agda, but our design choices can be applied to other programming languages as well.
Like Scala's implicits, we do not provide a separate structure for type classes and their instances, but instead rely on Agda's standard dependently typed records, so that standard language mechanisms provide features that are missing or expensive in other proposals. Like Scala, we support the equivalent of local instances. Unlike Scala, functions taking our new arguments are first-class citizens and can be abstracted over and manipulated in standard ways. Compared to other proposals, we avoid the pitfall of introducing a separate type-level computational model through the instance search mechanism. All values in scope are automatically candidates for instance resolution. A final novelty of our approach is that existing Agda libraries using records gain the benefits of type classes without any modification.
We discuss our implementation in Agda (to be part of Agda 2.2.12) and we use monads as an example to show how it allows existing concepts in the Agda standard library to be used in a similar way as corresponding Haskell code using type classes. We also demonstrate and discuss equivalents and alternatives to some advanced type class-related patterns from the literature and some new patterns specific to our system.
Secure distributed programming with value-dependent types
Authors: Swamy Nikhil , Chen Juan , Fournet Cédric , Strub Pierre-Yves , Bhargavan Karthikeyan , Yang Jean 
Published: September 2011

Distributed applications are difficult to program reliably and securely. Dependently typed functional languages promise to prevent broad classes of errors and vulnerabilities, and to enable program verification to proceed side-by-side with development. However, as recursion, effects, and rich libraries are added, using types to reason about programs, specifications, and proofs becomes challenging.
We present F*, a full-fledged design and implementation of a new dependently typed language for secure distributed programming. Unlike prior languages, F* provides arbitrary recursion while maintaining a logically consistent core; it enables modular reasoning about state and other effects using affine types; and it supports proofs of refinement properties using a mixture of cryptographic evidence and logical proof terms. The key mechanism is a new kind system that tracks several sub-languages within F* and controls their interaction. F* subsumes two previous languages, F7 and Fine. We prove type soundness (with proofs mechanized in Coq) and logical consistency for F*.
We have implemented a compiler that translates F* to .NET bytecode, based on a prototype for Fine. F* provides access to libraries for concurrency, networking, cryptography, and interoperability with C#, F#, and the other .NET languages. The compiler produces verifiable binaries with 60% code size overhead for proofs and types, as much as a 45x improvement over the Fine compiler, while still enabling efficient bytecode verification.
To date, we have programmed and verified more than 20,000 lines of F* including (1) new schemes for multi-party sessions; (2) a zero-knowledge privacy-preserving payment protocol; (3) a provenance-aware curated database; (4) a suite of 17 web-browser extensions verified for authorization properties; and (5) a cloud-hosted multi-tier web application with a verified reference monitor.
Dispersal Evolution in Neoplasms: The Role of Disregulated Metabolism in the Evolution of Cell Motility
Authors: Aktipis C. Athena , Maley Carlo C. , Pepper John W. 
Published: September 2011

AbstractHere, we apply the theoretical framework of dispersal evolution to understand the emergence of invasive and metastatic cells. We investigate whether the dysregulated metabolism characteristic of cancer cells may play a causal role in selection for cell motility, and thus to the tissue invasion and metastasis that define cancer. With an agent-based computational model, we show that cells with higher metabolism evolve to have higher rates of movement and that “neoplastic” cells with higher metabolism rates are able to persist in a population of “normal” cells with low metabolic rates, but only if increased metabolism is accompanied by increased motility. This is true even when the cost of motility is high. These findings suggest that higher rates of cell metabolism lead to selection for motile cells in premalignant neoplasms, which may preadapt cells for subsequent invasion and metastasis. This has important implications for understanding the progression of cancer from less invasive to more invasive cell types. Cancer Prev Res; 5(2); 266–75. ©2011 AACR.
Causes of Delay and Associated Mortality in Patients Transferred With ST-Segment–Elevation Myocardial Infarction
Authors: Miedema Michael D. , Newell Marc C. , Duval Sue , Garberich Ross F. , Handran Chauncy B. , Larson David M. , Mulder Steven , Wang Yale L. , Lips Daniel L. , Henry Timothy D. 
Published: September 2011

Background—
Regional ST-segment–elevation myocardial infarction systems are being developed to improve timely access to primary percutaneous coronary intervention (PCI). System delays may diminish the mortality benefit achieved with primary PCI in ST-segment–elevation myocardial infarction patients, but the specific reasons for and clinical impact of delays in patients transferred for PCI are unknown.

Methods and Results—
This was a prospective, observational study of 2034 patients transferred for primary PCI at a single center as part of a regional ST-segment–elevation myocardial infarction system from March 2003 to December 2009. Despite long-distance transfers, 30.4% of patients (n=613) were treated in ≤90 minutes and 65.7% (n=1324) were treated in ≤120 minutes. Delays occurred most frequently at the referral hospital (64.0%, n=1298), followed by the PCI center (15.7%, n=317) and transport (12.6%, n=255). For the referral hospital, the most common reasons for delay were awaiting transport (26.4%, n=535) and emergency department delays (14.3%, n=289). Diagnostic dilemmas (median, 95.5 minutes; 25th and 75th percentiles, 72–127 minutes) and nondiagnostic initial ECGs (81 minutes; 64–110.5 minutes) led to delays of the greatest magnitude. Delays caused by cardiac arrest and/or cardiogenic shock had the highest in-hospital mortality (30.6%), in contrast with nondiagnostic initial ECGs, which, despite long treatment delays, did not affect mortality (0%). Significant variation in both the magnitude and clinical impact of delays also occurred during the transport and PCI center segments.

Conclusions—
Treatment delays occur even in efficient systems for ST-segment–elevation myocardial infarction care. The clinical impact of specific delays in interhospital transfer for PCI varies according to the cause of the delay.