bluuebunny/crossref_metadata_2025_split huggingface dataset:
Association between metabolic syndrome and liver histology among NAFLD patients without diabetes
Authors: Kanwar Pushpjeet , Nelson James E , Yates Katherine , Kleiner David E , Unalp-Arida Aynur , Kowdley Kris V 
Published: November 2016

BackgroundMetabolic syndrome (MetS) and obesity are associated with non-alcoholic fatty liver disease (NAFLD). The aim of this observational study was to examine the relationship of MetS and a diagnosis of non-alcoholic steatohepatitis (NASH) in patients without diabetes in the NASH Clinical Research Network (CRN).MethodsClinical, demographic, histological, laboratory and anthropometric data were collected on 356 adult patients without diabetes with NAFLD. Obesity was defined as body mass index ≥30.0. MetS was determined using the National Cholesterol Education Program-Adult Treatment Panel III (NCEP ATPIII) 2001 criteria to include 3 or more of the following: increased waist circumference, elevated triglycerides, reduced high-density lipoprotein cholesterol, hypertension and elevated fasting blood glucose.ResultsMost patients were obese (71%) and had MetS (67%). Obesity was more prevalent among patients with MetS (80% vs 52%; p≤0.001). Markers of insulin resistance such as homoeostasis model assessment of insulin resistance (6.5 vs 4.9, p≤0.001) were higher among those with MetS compared with those without MetS. Histologically, patients without MetS had higher hepatocellular (p=0.04) and reticuloendothelial system iron (p=0.04). Patients with MetS were more likely to have severe hepatic steatosis (p=0.04) and chronic portal inflammation (p=0.01). On multiple logistic regression analysis, patients with definite NASH were almost 2.5 times more likely to have MetS than those without definite NASH (OR=2.41, p=0.01).ConclusionsMetS is common in patients without diabetes with NAFLD and is associated with greater insulin resistance, hepatic steatosis and portal inflammation. While patients without MetS have greater iron overload, patients with MetS may have an increased propensity to have NASH. Therefore, presence of MetS in patients without diabetes with NAFLD may serve as a potential criterion for liver biopsy.Trial registration numberNCT00063622; Pre-results.
Preference-based disease-specific health-related quality of life instrument for glaucoma: a mixed methods study protocol
Authors: Muratov Sergei , Podbielski Dominik W , Jack Susan M , Ahmed Iqbal Ike K , Mitchell Levine A H , Baltaziak Monika , Xie Feng 
Published: November 2016

IntroductionA primary objective of healthcare services is to improve patients' health and health-related quality of life (HRQoL). Glaucoma, which affects a substantial proportion of the world population, has a significant detrimental impact on HRQoL. Although there are a number of glaucoma-specific questionnaires to measure HRQoL, none is preference-based which prevent them from being used in health economic evaluation. The proposed study is aimed to develop a preference-based instrument that is capable of capturing important effects specific to glaucoma and treatments on HRQoL and is scored based on the patients' preferences.MethodsA sequential, exploratory mixed methods design will be used to guide the development and evaluation of the HRQoL instrument. The study consists of several stages to be implemented sequentially: item identification, item selection, validation and valuation. The instrument items will be identified and selected through a literature review and the conduct of a qualitative study. Validation will be conducted to establish psychometric properties of the instrument followed by a valuation exercise to derive utility scores for the health states described.Ethics and disseminationThis study has been approved by the Trillium Health Partners Research Ethics Board (ID number 753). All personal information will be de-identified with the identification code kept in a secured location including the rest of the study data. Only qualified and study-related personnel will be allowed to access the data. The results of the study will be distributed widely through peer-reviewed journals, conferences and internal meetings.
Process evaluations in neurological rehabilitation: a mixed-evidence systematic review and recommendations for future research
Authors: Masterson-Algar Patricia , Burton Christopher R , Rycroft-Malone Jo 
Published: November 2016

ObjectiveTo systematically review how process evaluations are currently designed, what methodologies are used and how are they developed alongside or within neurological rehabilitation trials.MethodsThis mixed-methods systematic review had two evidence streams: stream I, studies reporting process evaluations alongside neurorehabilitation trials research and stream II, methodological guidance on process evaluation design and methodology. A search strategy was designed for each evidence stream. Data regarding process evaluation core concepts and design issues were extracted using a bespoke template. Evidence from both streams was analysed separately and then synthesised in a final overarching synthesis proposing a number of recommendations for future research.ResultsA total of 124 process evaluation studies, reporting on 106 interventions, were included in stream I evidence. 30 studies were included as stream II evidence. Synthesis 1 produced 9 themes, and synthesis 2 identified a total of 8 recommendations for process evaluation research. The overall synthesis resulted in 57 ‘synthesis recommendations’ about process evaluation methodology grouped into 9 research areas, including the use of theory, the investigation of context, intervention staff characteristics and the delivery of the trial intervention.ConclusionsThere remains no consensus regarding process evaluation terminology within the neurological rehabilitation field. There is a need for process evaluations to address the nature and influence of context over time. Process evaluations should clearly describe what intervention staff bring to a trial, including skills and experience prior to joining the research. Process evaluations should monitor intervention staff's learning effects and the possible impact that these may have on trial outcomes.
Poisson equation for the three-loop ladder diagram in string theory at genus one
Authors: Basu Anirban 
Published: November 2016

The three-loop ladder diagram is a graph with six links and four cubic vertices that contributes to the [Formula: see text] amplitude at genus one in type II string theory. The vertices represent the insertion points of vertex operators on the toroidal worldsheet and the links represent scalar Green functions connecting them. By using the properties of the Green function and manipulating the various expressions, we obtain a modular invariant Poisson equation satisfied by this diagram, with source terms involving one-, two- and three-loop diagrams. Unlike the source terms in the Poisson equations for diagrams at lower orders in the momentum expansion or the Mercedes diagram, a particular source term involves a five-point function containing a holomorphic and a antiholomorphic worldsheet derivative acting on different Green functions. We also obtain simple equalities between topologically distinct diagrams, and consider some elementary examples.
Morphotectonic expression of geological structures in the eastern part of the South East Deccan Volcanic Province (around Nanded, Maharashtra, India)
Authors: Kaplay R. D. , Babar M. D. , Mukherjee Soumyajit , Vijay Kumar T. 
Published: November 2016

Abstract
We geomorphometrically characterize the tectonics near the microseismically active Nanded region, Maharashtra, India. We used the geomorphic indices of active tectonics in 32 sub-basins to evaluate the relationship between tectonics and basin morphology. The area is divided into three different zones (1, 2 and 3). Microseismicity is concentrated along the NW–SE-trending Urvashi Ghat Lineament. The anomalous drainages and lineaments are also confined to the region where microseismicity is associated with thrust. Spatial analysis of the elongation ratio and hypsometric integral of the basins provide valuable information on their distribution and relationship to the structure and tectonics. This study suggests neotectonic control on the evolution of the basins close to Nanded City.
Compilation and appraisal of geochronological data from the North Atlantic Igneous Province (NAIP)
Authors: Wilkinson Camilla M. , Ganerød Morgan , Hendriks Bart W. H. , Eide Elizabeth A. 
Published: November 2016

Abstract

The North Atlantic Igneous Province (NAIP), composed of volcanic sequences and intrusive rocks, occurs onshore in Greenland, the Faeroe Islands, the UK and Ireland, and offshore surrounding these areas as well as the west coast of Norway. Geochronological data have been published for Cenozoic igneous and volcanic rocks for much of the province, and provide valuable information to analyse the evolution of the province and magmatic processes more broadly. As part of the NE Atlantic Geosciences (NAG) cooperation, we examined approximately 700 dates from over 70 published studies and created a comprehensive database to facilitate ready access to this important information. This includes U–Pb, Rb–Sr, Re–Os,
40
Ar/
39
Ar and K–Ar ages presented relative to the Geological Time Scale 2012.
40
Ar/
39
Ar and K–Ar ages have been recalculated to a common reference. The complete database includes data that range from approximately 177 to 0.19 Ma. Our evaluation shows that variable sample quality, ambiguous data-handling methods, inadequate data reporting and data interpretation should preclude the use of data for purposes of rigorous geochronological analysis. Through a series of filtering techniques described here, we suggest excluding >500 dates as being of too poor a quality to use in age determinations. Our analysis highlights the need for published geochronological studies to include sufficient information to allow critical assessment of ages and interpretations. We present an ‘optimized’ dataset containing 130 ages that range from approximately 64 to 13 Ma. The filtered dataset emphasizes the need for firm chronological benchmarks and suggests that some sub-provinces in the NAIP would greatly benefit from renewed research attention.

Supplementary material:
The full NAG-TEC Geochronological Database 001 and Data Evaluation 002 are available at
https://doi.org/10.6084/m9.figshare.c.3554472
Compiling a high-level language for GPUs
Authors: Dubach Christophe , Cheng Perry , Rabbah Rodric , Bacon David F. , Fink Stephen J. 
Published: November 2016

Languages such as OpenCL and CUDA offer a standard interface for general-purpose programming of GPUs. However, with these languages, programmers must explicitly manage numerous low-level details involving communication and synchronization. This burden makes programming GPUs difficult and error-prone, rendering these powerful devices inaccessible to most programmers.
We desire a higher-level programming model that makes GPUs more accessible while also effectively exploiting their computational power. This paper presents features of Lime, a new Java-compatible language targeting heterogeneous systems, that allow an optimizing compiler to generate high quality GPU code. The key insight is that the language type system enforces isolation and immutability invariants that allow the compiler to optimize for a GPU without heroic compiler analysis.
Our compiler attains GPU speedups between 75% and 140% of the performance of native OpenCL code.
Parcae
Authors: Raman Arun , Zaks Ayal , Lee Jae W. , August David I. 
Published: November 2016

Workload, platform, and available resources constitute a parallel program's execution environment. Most parallelization efforts statically target an anticipated range of environments, but performance generally degrades outside that range. Existing approaches address this problem with dynamic tuning but do not optimize a multiprogrammed system holistically. Further, they either require manual programming effort or are limited to array-based data-parallel programs.
This paper presents Parcae, a generally applicable automatic system for platform-wide dynamic tuning. Parcae includes (i) the Nona compiler, which creates flexible parallel programs whose tasks can be efficiently reconfigured during execution; (ii) the Decima monitor, which measures resource availability and system performance to detect change in the environment; and (iii) the Morta executor, which cuts short the life of executing tasks, replacing them with other functionally equivalent tasks better suited to the current environment. Parallel programs made flexible by Parcae outperform original parallel implementations in many interesting scenarios.
Design and implementation of sparse global analyses for C-like languages
Authors: Oh Hakjoo , Heo Kihong , Lee Wonchan , Lee Woosuk , Yi Kwangkeun 
Published: November 2016

In this article we present a general method for achieving global static analyzers that are precise, sound, yet also scalable. Our method generalizes the sparse analysis techniques on top of the abstract interpretation framework to support relational as well as non-relational semantics properties for C-like languages. We first use the abstract interpretation framework to have a global static analyzer whose scalability is unattended. Upon this underlying sound static analyzer, we add our generalized sparse analysis techniques to improve its scalability while preserving the precision of the underlying analysis. Our framework determines what to prove to guarantee that the resulting sparse version should preserve the precision of the underlying analyzer.
We formally present our framework; we present that existing sparse analyses are all restricted instances of our framework; we show more semantically elaborate design examples of sparse non-relational and relational static analyses; we present their implemen- tation results that scale to analyze up to one million lines of C programs. We also show a set of implementation techniques that turn out to be critical to economically support the sparse analysis process.
A dynamic program analysis to find floating-point accuracy problems
Authors: Benz Florian , Hildebrandt Andreas , Hack Sebastian 
Published: November 2016

Programs using floating-point arithmetic are prone to accuracy problems caused by rounding and catastrophic cancellation. These phenomena provoke bugs that are notoriously hard to track down: the program does not necessarily crash and the results are not necessarily obviously wrong, but often subtly inaccurate. Further use of these values can lead to catastrophic errors.
In this paper, we present a dynamic program analysis that supports the programmer in finding accuracy problems. Our analysis uses binary translation to perform every floating-point computation side by side in higher precision. Furthermore, we use a lightweight slicing approach to track the evolution of errors.
We evaluate our analysis by demonstrating that it catches wellknown floating-point accuracy problems and by analyzing the Spec CFP2006 floating-point benchmark. In the latter, we show how our tool tracks down a catastrophic cancellation that causes a complete loss of accuracy leading to a meaningless program result. Finally, we apply our program to a complex, real-world bioinformatics application in which our program detected a serious cancellation. Correcting the instability led not only to improved quality of the result, but also to an improvement of the program's run time.In this paper, we present a dynamic program analysis that supports the programmer in finding accuracy problems. Our analysis uses binary translation to perform every floating-point computation side by side in higher precision. Furthermore, we use a lightweight slicing approach to track the evolution of errors. We evaluate our analysis by demonstrating that it catches wellknown floating-point accuracy problems and by analyzing the SpecfiCFP2006 floating-point benchmark. In the latter, we show how our tool tracks down a catastrophic cancellation that causes a complete loss of accuracy leading to a meaningless program result. Finally, we apply our program to a complex, real-world bioinformatics application in which our program detected a serious cancellation. Correcting the instability led not only to improved quality of the result, but also to an improvement of the program's run time.
Cache and I/O efficent functional algorithms
Authors: Blelloch Guy E. , Harper Robert 
Published: November 2016

The widely studied I/O and ideal-cache models were developed to account for the large difference in costs to access memory at different levels of the memory hierarchy. Both models are based on a two level memory hierarchy with a fixed size primary memory(cache) of size M, an unbounded secondary memory organized in blocks of size B. The cost measure is based purely on the number of block transfers between the primary and secondary memory. All other operations are free. Many algorithms have been analyzed in these models and indeed these models predict the relative performance of algorithms much more accurately than the standard RAM model. The models, however, require specifying algorithms at a very low level requiring the user to carefully lay out their data in arrays in memory and manage their own memory allocation.
In this paper we present a cost model for analyzing the memory efficiency of algorithms expressed in a simple functional language. We show how some algorithms written in standard forms using just lists and trees (no arrays) and requiring no explicit memory layout or memory management are efficient in the model. We then describe an implementation of the language and show provable bounds for mapping the cost in our model to the cost in the ideal-cache model. These bound imply that purely functional programs based on lists and trees with no special attention to any details of memory layout can be as asymptotically as efficient as the carefully designed imperative I/O efficient algorithms. For example we describe an O(n_B logM/Bn_B)cost sorting algorithm, which is optimal in the ideal cache and I/O models.
Quantitative abstraction refinement
Authors: Cerny Pavol , Henzinger Thomas A. , Radhakrishna Arjun 
Published: November 2016

We propose a general framework for abstraction with respect to quantitative properties, such as worst-case execution time, or power consumption. Our framework provides a systematic way for counter-example guided abstraction refinement for quantitative properties. The salient aspect of the framework is that it allows anytime verification, that is, verification algorithms that can be stopped at any time (for example, due to exhaustion of memory), and report approximations that improve monotonically when the algorithms are given more time.
We instantiate the framework with a number of quantitative abstractions and refinement schemes, which differ in terms of how much quantitative information they keep from the original system. We introduce both state-based and trace-based quantitative abstractions, and we describe conditions that define classes of quantitative properties for which the abstractions provide over-approximations. We give algorithms for evaluating the quantitative properties on the abstract systems. We present algorithms for counter-example based refinements for quantitative properties for both state-based and segment-based abstractions. We perform a case study on worst-case execution time of executables to evaluate the anytime verification aspect and the quantitative abstractions we proposed.
Universal properties of impure programming languages
Authors: Staton Sam , Levy Paul Blain 
Published: November 2016

We investigate impure, call-by-value programming languages. Our first language only has variables and let-binding. Its equational theory is a variant of Lambek's theory of multicategories that omits the commutativity axiom.
We demonstrate that type constructions for impure languages --- products, sums and functions --- can be characterized by universal properties in the setting of 'premulticategories', multicategories where the commutativity law may fail. This leads us to new, universal characterizations of two earlier equational theories of impure programming languages: the premonoidal categories of Power and Robinson, and the monad-based models of Moggi. Our analysis thus puts these earlier abstract ideas on a canonical foundation, bringing them to a new, syntactic level.
Meta-theory à la carte
Authors: Delaware Benjamin , d. S. Oliveira Bruno C. , Schrijvers Tom 
Published: November 2016

Formalizing meta-theory, or proofs about programming languages, in a proof assistant has many well-known benefits. Unfortunately, the considerable effort involved in mechanizing proofs has prevented it from becoming standard practice. This cost can be amortized by reusing as much of existing mechanized formalizations as possible when building a new language or extending an existing one. One important challenge in achieving reuse is that the inductive definitions and proofs used in these formalizations are closed to extension. This forces language designers to cut and paste existing definitions and proofs in an ad-hoc manner and to expend considerable effort to patch up the results.
The key contribution of this paper is the development of an induction technique for extensible Church encodings using a novel reinterpretation of the universal property of folds. These encodings provide the foundation for a framework, formalized in Coq, which uses type classes to automate the composition of proofs from modular components. This framework enables a more structured approach to the reuse of meta-theory formalizations through the composition of modular inductive definitions and proofs.
Several interesting language features, including binders and general recursion, illustrate the capabilities of our framework. We reuse these features to build fully mechanized definitions and proofs for a number of languages, including a version of mini-ML. Bounded induction enables proofs of properties for non-inductive semantic functions, and mediating type classes enable proof adaptation for more feature-rich languages.
Fault tolerance via idempotence
Authors: Ramalingam Ganesan , Vaswani Kapil 
Published: November 2016

Building distributed services and applications is challenging due to the pitfalls of distribution such as process and communication failures. A natural solution to these problems is to detect potential failures, and retry the failed computation and/or resend messages. Ensuring correctness in such an environment requires distributed services and applications to be idempotent.
In this paper, we study the inter-related aspects of process failures, duplicate messages, and idempotence. We first introduce a simple core language (based on lambda calculus inspired by modern distributed computing platforms. This language formalizes the notions of a service, duplicate requests, process failures, data partitioning, and local atomic transactions that are restricted to a single store.
We then formalize a desired (generic) correctness criterion for applications written in this language, consisting of idempotence (which captures the desired safety properties) and failure-freedom (which captures the desired progress properties).
We then propose language support in the form of a monad that automatically ensures failfree idempotence. A key characteristic of our implementation is that it is decentralized and does not require distributed coordination. We show that the language support can be enriched with other useful constructs, such as compensations, while retaining the coordination-free decentralized nature of the implementation.
We have implemented the idempotence monad (and its variants) in F# and C# and used our implementation to build realistic applications on Windows Azure. We find that the monad has low runtime overheads and leads to more declarative applications.