bluuebunny/crossref_metadata_2025_split huggingface dataset:
An efficient and selective microwave-assisted Claisen-Schmidt reaction for the synthesis of functionalized benzalacetones
Authors: Rayar Anita , Veitía Maité Sylla-Iyarreta , Ferroud Clotilde 
Published: May 2015

Abstract
A simple and direct method for the Claisen-Schmidt reaction to prepare functionalized α,β-unsaturated ketones has been developed. Microwave irradiation of aldehydes with acetone produces benzalacetones selectively without self-condensation product in very short reaction times and good yields.
Holocene variations of wildfire occurrence as a guide for sustainable management of the northeastern Canadian boreal forest
Authors: El-Guellab Ahmed , Asselin Hugo , Gauthier Sylvie , Bergeron Yves , Ali Adam A. 
Published: May 2015

Abstract

Background
Cumulative impacts of wildfires and forest harvesting can cause shifts from closed-crown forest to open woodland in boreal ecosystems. To lower the probability of occurrence of such catastrophic regime shifts, forest logging must decrease when fire frequency increases, so that the combined disturbance rate does not exceed the Holocene maximum. Knowing how climate warming will affect fire regimes is thus crucial to sustainably manage the forest. This study aimed to provide a guide to determine sustainable forest harvesting levels, by reconstructing the Holocene fire history at the northern limit of commercial forestry in Quebec using charcoal particles preserved in lake sediments.

Methods
Sediment cores were sampled from four lakes located close to the northern limit of commercial forestry in Quebec. The cores were sliced into consecutive 0.5 cm thick subsamples from which 1 cm3 was extracted to count and measure charcoal particles larger than 150 microns. Age-depth models were obtained for each core based on accelerator mass spectroscopy (AMS) radiocarbon dates. Holocene fire histories were reconstructed by combining charcoal counts and age-depth models to obtain charcoal accumulation rates and, after statistical treatment, long-term trends in fire occurrence (expressed as number of fires per 1000 years).

Results
Fire occurrence varied between the four studied sites, but fires generally occurred more often during warm and dry periods of the Holocene, especially during the Holocene Thermal Maximum (7000–3500 cal. BP), when fire occurrence was twice as high as at present.

Conclusions
The current fire regime in the study area is still within the natural range of variability observed over the Holocene. However, climatic conditions comparable to the Holocene Thermal Maximum could be reached within the next few decades, thus substantially reducing the amount of wood available to the forest industry.
Reduced-dose and high-speed acquisition strategies for multi-dimensional electron microscopy
Authors: Saghi Zineb , Benning Martin , Leary Rowan , Macias-Montero Manuel , Borras Ana , Midgley Paul A 
Published: May 2015

AbstractMulti-dimensional electron microscopy has recently gained considerable interest thanks to the advent of microscopes with unprecedented analytical and in situ capabilities. These information-rich imaging modes, though, are often subject to long acquisition times and large data generation. In this paper, we explore novel acquisition strategies and reconstruction algorithms to retrieve reliable reconstructions from datasets that are limited in terms of both per image and tilt series angular sampling. We show that inpainting techniques are capable of restoring scanning transmission electron microscopy images in which a very restricted number of pixels are scanned, while compressed sensing tomographic reconstruction is capable of minimising artefacts due to angular subsampling. An example of robust reconstruction from data constituting a dose reduction of 10× is presented, using an organic/inorganic core-shell nanowire as a test sample. The combination of these novel acquisition schemes and image recovery strategies provides new avenues to reduced-dose and high-speed imaging.
Hepatitis B Virus Screening for Patients With Cancer Before Therapy: American Society of Clinical Oncology Provisional Clinical Opinion Update
Authors: Hwang Jessica P. , Somerfield Mark R. , Alston-Johnson Devena E. , Cryer Donna R. , Feld Jordan J. , Kramer Barnett S. , Sabichi Anita L. , Wong Sandra L. , Artz Andrew S. 
Published: May 2015

Purpose This updated provisional clinical opinion presents a revised opinion based on American Society of Clinical Oncology panel consensus in the context of an evolving database. Context Despite the 2010 provisional clinical opinion recommendation, there is still evidence of suboptimal hepatitis B virus (HBV) screening among patients at high risk for HBV infection or HBV reactivation after chemotherapy. This updated provisional clinical opinion introduces a risk-adaptive strategy to identify and treat patients with HBV infection to reduce their risk of HBV reactivation. Provisional Clinical Opinion Medical providers should screen by testing patients for HBV infection before starting anti-CD20 therapy or hematopoietic cell transplantation. Providers should also screen patients with risk factors for HBV infection. Screening should include both hepatitis B surface antigen (HBsAg) and hepatitis B core antibody (anti-HBc), because reactivation can occur in patients who are HBsAg positive/anti-HBc positive or HBsAg negative/anti-HBc positive. Either total anti-HBc or anti-HBc immunoglobulin G (not immunoglobulin M) test should be used. Clinicians should start antiviral therapy for HBsAg-positive/anti-HBc–positive patients before or contemporaneously with cancer therapy and monitor HBsAg-negative/anti-HBc–positive patients for reactivation with HBV DNA and ALT levels, promptly starting antivirals if reactivation occurs. Clinicians can initiate antivirals for HBsAg-negative/anti-HBc–positive patients anticipating cancer therapies associated with a high risk of reactivation, or they can monitor HBV DNA and ALT levels and initiate on-demand antivirals. For patients who neither have HBV risk factors nor anticipate cancer therapy associated with a high risk of reactivation, current evidence does not support HBV screening before initiation of cancer therapy. Two panel members provided a minority viewpoint, involving a strategy of universal HBsAg and selective anti-HBc testing.
GABAB receptor promotes its own surface expression by recruiting a Rap1-dependent signaling cascade
Authors: Zhang Zongyong , Zhang Wenhua , Huang Siluo , Sun Qian , Wang Yunyun , Hu Yongjian , Sun Ninghua , Zhang Yilei , Jiang Zhihua , Minato Nagahiro , Pin Jean-Philippe , Su Li , Liu Jianfeng 
Published: May 2015

ABSTRACT
G-protein-coupled receptors (GPCRs) are key players in cell signaling, and their cell surface expression is tightly regulated. For many GPCRs such as β2-AR (β2-adrenergic receptor), receptor activation leads to downregulation of receptor surface expression, a phenomenon that has been extensively characterized. By contrast, some other GPCRs, such as GABAB receptor, remain relatively stable at the cell surface even after prolonged agonist treatment; however, the underlying mechanisms are unclear. Here, we identify the small GTPase Rap1 as a key regulator for promoting GABAB receptor surface expression. Agonist stimulation of GABAB receptor signals through Gαi/o to inhibit Rap1GAPII (also known as Rap1GAP1b, an isoform of Rap1GAP1), thereby activating Rap1 (which has two isoforms, Rap1a and Rap1b) in cultured cerebellar granule neurons (CGNs). The active form of Rap1 is then recruited to GABAB receptor through physical interactions in CGNs. This Rap1-dependent signaling cascade promotes GABAB receptor surface expression by stimulating receptor recycling. Our results uncover a new mechanism regulating GPCR surface expression and also provide a potential explanation for the slow, long-lasting inhibitory action of GABA neurotransmitter.
Architectures of multisubunit complexes revealed by a visible immunoprecipitation assay using fluorescent fusion proteins
Authors: Katoh Yohei , Nozaki Shohei , Hartanto David , Miyano Rie , Nakayama Kazuhisa 
Published: May 2015

ABSTRACT
In this study, we elucidated the architectures of two multisubunit complexes, the BBSome and exocyst, through a novel application of fluorescent fusion proteins. By processing lysates from cells co-expressing GFP and RFP fusion proteins for immunoprecipitation with anti-GFP nanobody, protein–protein interactions could be reproducibly visualized by directly observing the immunoprecipitates under a microscope, and evaluated using a microplate reader, without requiring immunoblotting. Using this ‘visible’ immunoprecipitation (VIP) assay, we mapped binary subunit interactions of the BBSome complex, and determined the hierarchies of up to four subunit interactions. We also demonstrated the assembly sequence of the BBSome around the centrosome, and showed that BBS18 (also known as BBIP1 and BBIP10) serves as a linker between BBS4 and BBS8 (also known as TTC8). We also applied the VIP assay to mapping subunit interactions of the exocyst tethering complex. By individually subtracting the eight exocyst subunits from multisubunit interaction assays, we unequivocally demonstrated one-to-many subunit interactions (Exo70 with Sec10+Sec15, and Exo84 with Sec10+Sec15+Exo70). The simple, versatile VIP assay described here will pave the way to understanding the architectures and functions of multisubunit complexes involved in a variety of cellular processes.
Effect of rice variety and blending proportion on the proximate compositions, minerals and phytic acid contents of bread from rice-teff blend
Authors: Legesse Sintayehu , Worku Solomon , Bultosa Geremew 
Published: May 2015

Development of bakery products containing rice (Oryza sativa, Linn.) and teff (Eragrostis tef) could have potential health benefits due to their gluten free nature. Nine experimental runs were generated using custom design by JMP 8 software. The effect of two factors, rice variety (Edeget, X-jigna and Nerica-4) and blending proportions of rice and teff (0.5:0.5, 0.7:0.3 and 0.9:0.1) were studied. The data analysis was conducted using SAS software package for the mean comparison and custom design by JMP 8 software. Response surface methodology was applied to study the interaction effect of the main factors and to generate the predictive equations. An optimal value (1.60%) of fiber was obtained when the proportion of the blend was 50% Edeget and 50% teff because teff grain is high in fiber. A maximum value (10.75%) of protein was obtained when the proportion of the blend was 70% Nerica-4 and 30% teff. Carbohydrate was optimal (81.37%) when 90% Edeget and 10% teff were blended because rice grain is high in carbohydrate. Optimal iron content (12.97 mg/100g) was obtained when the proportion of the blend was 50% Nerica-4 and 50% teff because teff grain is high in iron. Optimal zinc content (4.14 mg/100g) was obtained when the proportion of the blend was 50% X-jigna and 50% teff. The optimal value (61.25 mg/100g) of calcium was obtained when the proportion of the blend was 50% Edeget and 50% teff. Optimum (lower) value (0.31mg/g) of phytic acid was obtained when the proportion of the blend was 90% Nerica-4 and 10% teff because rice grain is lower in phytic acid content. It was concluded that rice variety and rice-teff blending proportion had a significant effect on the physico-chemical properties of rice-teff blend bread. An optimal nutrient blend (high in nutrients, low in anti-nutrients) was obtained when 70% Edeget rice variety was blended with 30% teff. All the derived mathematical models for the various responses were found to fit significantly to the predicted data.
Age- and Sex-Specific Dynamics in 22 Hematologic and Biochemical Analytes from Birth to Adolescence
Authors: Zierk Jakob , Arzideh Farhad , Rechenauer Tobias , Haeckel Rainer , Rascher Wolfgang , Metzler Markus , Rauh Manfred 
Published: May 2015

Abstract

BACKGROUND
Pediatric laboratory test results must be interpreted in the context of interindividual variation and age- and sex-dependent dynamics. Reference intervals as presently defined for separate age groups can only approximate the age-related dynamics encountered in pediatrics. Continuous reference intervals from birth to adulthood are not available for most laboratory analytes because of the ethical and practical constraints of defining reference intervals using a population of healthy community children. We applied an indirect method to generate continuous reference intervals for 22 hematologic and biochemical analytes by analyzing clinical laboratory data from blood samples taken during clinical care of patients.

METHODS
We included samples from 32 000 different inpatients and outpatients (167 000 samples per analyte) from a German pediatric tertiary care center. Measurements were performed on a Sysmex-XE 2100 and a Cobas Integra 800 during clinical care over a 6-year period. The distribution of samples considered normal was estimated with an established indirect statistical approach and used for the calculation of reference intervals.

RESULTS
We provide continuous reference intervals from birth to adulthood for 9 hematology analytes (hemoglobin, hematocrit, red cell indices, red cell count, red cell distribution width, white cell count, and platelet count) and 13 biochemical analytes (sodium, chloride, potassium, calcium, magnesium, phosphate, creatinine, aspartate transaminase, alanine transaminase, γ-glutamyltransferase, alkaline phosphatase, lactate dehydrogenase, and total protein).

CONCLUSIONS
Continuous reference intervals capture the population changes in laboratory analytes during pediatric development more accurately than age groups. After local validation, the reference intervals provided should allow a more precise consideration of these dynamics in clinical decision making.
Reviews
Authors: Weeks Paul , Sandover Rebecca , Kaaristo Maarja , Gilbertson Adam 
Published: May 2015

Abstract
Eating Her Curries and Kway: A Cultural History of Food in Singapore, Nicole Tarulevicz (2013) Urbana, University of Illinois Press, xi + 204 pp., ISBN: 97802520389099, p/bk, £34.00
Food and the Self: Consumption, Production and Material Culture, Isabelle de Solier (2013) London: Bloomsbury, ix+199 pp., ISBN: 9780857854223, p/bk, £19.99
Tourism and the Power of Otherness: Seductions of Difference, David Picard and Michael A. Di Giovine (eds) (2014) Bristol: Channel View, xii+195 pp., ISBN: 9781845414153, p/bk, £24.95
Food and Society: Principles and Paradoxes, Amy E. Guptill, Denise A. Copelton and Betsy Lucal (2013) Cambridge: Polity Press, 333 pp., ISBN: 9780745642826, p/bk, £17.99
Certain query answering in partially consistent databases
Authors: Greco Sergio , Pijcke Fabian , Wijsen Jef 
Published: May 2015

A database is called uncertain if two or more tuples of the same relation are allowed to agree on their primary key. Intuitively, such tuples act as alternatives for each other. A repair (or possible world) of such uncertain database is obtained by selecting a maximal number of tuples without ever selecting two tuples of the same relation that agree on their primary key. For a Boolean queryq, the problem CERTAINTY(q) takes as input an uncertain databasedband asks whetherqevaluates to true on every repair ofdb.In recent years, the complexity of CERTAINTY(q) has been studied under different restrictions onq. These complexity studies have assumed no restrictions on the uncertain databases that are input to CERTAINTY(q). In practice, however, it may be known that these input databases are partially consistent, in the sense that they satisfy some dependencies (e.g., functional dependencies). In this article, we introduce the problem CERTAINTY(q) in the presence of a set Σ of dependencies. The problem CERTAINTY(q, Σ) takes as input an uncertain databasedbthat satisfiesΣ, and asks whether every repair ofdbsatisfiesq.We focus on the complexity of CERTAINTY(q, Σ) whenqis an acyclic conjunctive query without self-join, and Σ is a set of functional dependencies and join dependencies, the latter of a particular form. We provide an algorithm that, givenqand Σ, decides whether CERTAINTY(q, Σ) is first-order expressible. Moreover, we show how to effectively construct a first-order definition of CERTAINTY(q, Σ) if it exists.
An efficient reconciliation algorithm for social networks
Authors: Korula Nitish , Lattanzi Silvio 
Published: May 2015

People today typically use multiple online social networks (Facebook, Twitter, Google+, LinkedIn, etc.). Each online network represents a subset of their "real" ego-networks. An interesting and challenging problem is to reconcile these online networks, that is, to identify all the accounts belonging to the same individual. Besides providing a richer understanding of social dynamics, the problem has a number of practical applications. At first sight, this problem appears algorithmically challenging. Fortunately, a small fraction of individuals explicitly link their accounts across multiple networks; our work leverages these connections to identify a very large fraction of the network.
Our main contributions are to mathematically formalize the problem for the first time, and to design a simple, local, and efficient parallel algorithm to solve it. We are able to prove strong theoretical guarantees on the algorithm's performance on well-established network models (Random Graphs, Preferential Attachment). We also experimentally confirm the effectiveness of the algorithm on synthetic and real social network data sets.
Shared workload optimization
Authors: Giannikis Georgios , Makreshanski Darko , Alonso Gustavo , Kossmann Donald 
Published: May 2015

As a result of increases in both the query load and the data managed, as well as changes in hardware architecture (multicore), the last years have seen a shift from query-at-a-time approaches towards shared work (SW) systems where queries are executed in groups. Such groups share operators like scans and joins, leading to systems that process hundreds to thousands of queries in one go.
SW systems range from storage engines that use in-memory co-operative scans to more complex query processing engines that share joins over analytical and star schema queries. In all cases, they rely on either single query optimizers, predicate sharing, or on manually generated plans. In this paper we explore the problem of shared workload optimization (SWO) for SW systems. The challenge in doing so is that the optimization has to be done for the entire workload and that results in a class of stochastic knapsack with uncertain weights optimization, which can only be addressed with heuristics to achieve a reasonable runtime. In this paper we focus on hash joins and shared scans and present a first algorithm capable of optimizing the execution of entire workloads by deriving a global executing plan for all the queries in the system. We evaluate the optimizer over the TPC-W and the TPC-H benchmarks. The results prove the feasibility of this approach and demonstrate the performance gains that can be obtained from SW systems.
Concurrent analytical query processing with GPUs
Authors: Wang Kaibo , Zhang Kai , Yuan Yuan , Ma Siyuan , Lee Rubao , Ding Xiaoning , Zhang Xiaodong 
Published: May 2015

In current databases, GPUs are used as dedicated accelerators to process each individual query. Sharing GPUs among concurrent queries is not supported, causing serious resource underutilization. Based on the profiling of an open-source GPU query engine running commonly used single-query data warehousing workloads, we observe that the utilization of main GPU resources is only up to 25%. The underutilization leads to low system throughput.
To address the problem, this paper proposes concurrent query execution as an effective solution. To efficiently share GPUs among concurrent queries for high throughput, the major challenge is to provide software support to control and resolve resource contention incurred by the sharing. Our solution relies on GPU query scheduling and device memory swapping policies to address this challenge. We have implemented a prototype system and evaluated it intensively. The experiment results confirm the effectiveness and performance advantage of our approach. By executing multiple GPU queries concurrently, system throughput can be improved by up to 55% compared with dedicated processing.
Of snowstorms and bushy trees
Authors: Ahmed Rafi , Sen Rajkumar , Poess Meikel , Chakkappen Sunil 
Published: May 2015

Many workloads for analytical processing in commercial RDBMSs are dominated by snowstorm queries, which are characterized by references to multiple large fact tables and their associated smaller dimension tables. This paper describes a technique for bushy join tree optimization for snowstorm queries in Oracle database system. This technique generates bushy join trees containing subtrees that produce substantially reduced sets of rows and, therefore, their joins with other subtrees are generally much more efficient than joins in the left-deep trees.
The generation of bushy join trees within an existing commercial physical optimizer requires extensive changes to the optimizer. Further, the optimizer will have to consider a large join permutation search space to generate efficient bushy join trees. The novelty of the approach is that bushy join trees can be generated outside the physical optimizer using logical query transformation that explores a considerably pruned search space. The paper describes an algorithm for generating optimal bushy join trees for snowstorm queries using an existing query transformation framework. It also presents performance results for this optimization, which show significant execution time improvements.
Fatman
Authors: Qin An , Hu Dianming , Liu Jun , Yang Wenjun , Tan Dai 
Published: May 2015

We present Fatman, an enterprise-scale archival storage based on volunteer contribution resources from underutilized web servers, usually deployed on thousands of nodes with spare storage capacity. Fatman is specifically designed for enhancing the utilization of existing storage resources and cutting down the hardware purchase cost. Two major concerned issues of the system design are maximizing the resource utilization of volunteer nodes without violating Service Level Objectives (SLOs) and minimizing the cost without reducing the availability of archival system.
Fatman has been widely deployed on tens of thousands of server nodes across several datacenters, provided more than 100PB storage capacity and served dozens of internal mass-data applications. The system realizes an efficient storage quota consolidation by strong isolation and budget limitation, to maximally support resources contribution without any degradation on host-level SLOs. It firstly improves data reliability by applying disk failure prediction to minish failure recovery cost, named fault-aware data management, dramatically reduces the MTTR by 76.3% and decreases file crash ratio by 35% on real-life product workload.
Spatial joins in main memory
Authors: Šidlauskas Darius , Jensen Christian S. 
Published: May 2015

A recent PVLDB paper reports on experimental analyses of ten spatial join techniques in main memory. We build on this comprehensive study to raise awareness of the fact that empirical running time performance findings in main-memory settings are results of not only the algorithms and data structures employed, but also their implementation, which complicates the interpretation of the results.
In particular, we re-implement the worst performing technique without changing the underlying high-level algorithm, and we then offer evidence that the resulting re-implementation is capable of outperforming all the other techniques. This study demonstrates that in main memory, where no time-consuming I/O can mask variations in implementation, implementation details are very important; and it offers a concrete illustration of how it is difficult to make conclusions from empirical running time performance findings in main-memory settings about data structures and algorithms studied.