bluuebunny/crossref_metadata_2025_split huggingface dataset:
Adult somatic progenitor cells and hematopoiesis in oyster
Authors: Jemaà Mohamed , Morin Nathalie , Cavelier Patricia , Cau Julien , Strub Jean-Marc , Delsert Claude 
Published: June 2014

Abstract
Long-lived animals show a non-observable age-related decline in immune defense, which is provided by blood cells that derive from self-renewing stem cells. The oldest living animals are bivalves. Yet, the origin of hemocytes, the cells involved in innate immunity, is unknown in bivalves and current knowledge about mollusk adult somatic stem cells is scarce. Here we identify a population of adult somatic precursor cells and show their differentiation into hemocytes. Oyster gill contains an as yet unreported irregularly folded structure (IFS) with stem-like cells bathing into the hemolymph. BrdU labeling revealed that the stem-like cells in the gill epithelium and in the nearby hemolymph replicate DNA. Proliferation of this cell population was further evidenced by phosphorylated-histone H3 mitotic staining. Finally, these small cells most abundant in the IFS epithelium were found positive for the stemness marker Sox2. We provide evidence for hematopoiesis by showing that co-expression of Sox2 and Cu/Zn SOD, a hemocyte-specific enzyme, does not occur in the gill epithelial cells but rather in the underlying tissues and vessels. We further confirm the hematopoietic features of these cells by the detection of Filamin, a protein specific for a sub-population of hemocytes, in large BrdU-labeled cells bathing into gill vessels. Altogether, our data show that progenitor cells differentiate into hemocytes in gill, which suggests that hematopoiesis occurs in oyster gills.
Computational Mutation Design of Diol Dehydratase: Catalytic Ability toward Glycerol beyond the Wild-Type Enzyme
Authors: Doitomi Kazuki , Tanaka Hiromasa , Kamachi Takashi , Toraya Tetsuo , Yoshizawa Kazunari 
Published: June 2014

Abstract
A computational mutation analysis based on quantum mechanical/molecular mechanical (QM/MM) calculations is performed for the elucidation of catalytic functions of amino acid residues at the active site of diol dehydratase in the dehydration of glycerol to afford 3-hydroxypropionaldehyde. While the wild-type diol dehydratase is subject to suicide inactivation in the dehydration process, mutants Gln336Ala and Ser301Ala are more resistant to the inactivation by glycerol (Yamanishi et al., FEBS J.2012, 279, 793). In the present study the impact of the mutation is discussed on the basis of energy profiles of two reaction pathways for the dehydration of glycerol and the inactivation of the enzyme. Both the mutants efficiently distinguish between two possible binding conformations of glycerol, the GS and GR conformations, where the former is known to mainly contribute to the inactivation of the enzyme. The improved resistance to the inactivation observed for the mutants can be explained by a hydrogen-bonding interaction between an OH group of glycerol and Ser301 as well as steric repulsion between glycerol and Val300. The computational mutation analysis first unveils the vital role of Val300 in the discrimination of the GS and GR conformations, which was not clearly viewed in the wild-type enzyme. The present findings will encourage the application of computational mutation approach to the rational design of enzymes optimized for desired organic synthesis.
Additive effects of β-adrenergic and cytokine signaling on lipolytic activation
Authors: Card Nicholas , Garver William S. , Orlando Robert A. 
Published: June 2014

Obesity often leads to increased systemic inflammation which is now thought to play a causative role in the development of atherosclerotic disease and insulin resistance. This inflammatory response originates within large adipose tissue depots and is initiated by classically activated macrophages that infiltrate the tissue from the circulation. The large number of macrophages residing in obese adipose tissue leads to significant increases in interleukin-6 (IL-6) and tumor necrosis factor-α (TNFα) secretion; achieving levels sufficient to elevate circulating plasma concentrations. These cytokines activate potent signals to initiate lipolysis, to release free fatty acids from triacylglycerol stores and contribute to hyperlipidemia in obese individuals. Obese adipose tissue responds to normal β-adrenergic and glucagon stimuli to recover from negative energy balance by inducing lipolysis. However, it is not clear what quantitative influence additional lipolytic stimulation by IL-6 and TNFα has on normal β-adrenergic activity. Although, β-adrenergic and cytokine signaling activate separate pathways for lipolytic activation, it is undefined whether the effects of multiple signaling events on lipolysis are additive or coincident. To clarify this issue, we measured lipolytic activity in 3T3-L1-derived adipocytes stimulated by a β-adrenergic agonist (isoproterenol), IL-6 or TNFα individually and in combinations as co- and tri-stimulation. Treatment of adipocytes with isoproterenol and either IL-6 or TNFα as co-stimulants increased lipolytic activation by approximately the sum of the individual ligands, suggesting contributions from two independent pathways. Co-stimulation with IL-6 and TNFα provided slightly more than an additive response indicating signaling contributions from independent and common pathways. Tri-stimulation resulted in the largest level of lipolytic activation with a value approximate to adding isoproterenol stimulation to a combined treatment of IL-6 and TNFα. The additive nature of cytokine signaling to β-adrenergic activity suggests its therapeutic inhibition will prevent excessive lipolysis, yet minimally interfere with maintaining normal responses to varying energy demands.
Novel somatic single nucleotide variants within the RNA binding protein hnRNP A1 in multiple sclerosis patients
Authors: Lee Sangmin , Levin Michael 
Published: June 2014

Some somatic single nucleotide variants (SNVs) are thought to be pathogenic, leading to neurological disease. We hypothesized that heterogeneous nuclear ribonuclear protein A1 (hnRNP A1), an autoantigen associated with multiple sclerosis (MS) would contain SNVs. MS patients develop antibodies to hnRNP A1293-304, an epitope within the M9 domain (AA268-305) of hnRNP A1. M9 is hnRNP A1’s nucleocytoplasmic transport domain, which binds transportin-1 (TPNO-1) and allows for hnRNP A1’s transport into and out of the nucleus. Genomic DNA sequencing of M9 revealed nine novel SNVs that resulted in an amino acid substitution in MS patients that were not present in controls. SNVs occurred within the TPNO-1 binding domain (hnRNP A1268-289) and the MS IgG epitope (hnRNP A1293-304), within M9. In contrast to the nuclear localization of wild type (WT) hnRNP A1, mutant hnRNP A1 mis-localized to the cytoplasm, co-localized with stress granules and caused cellular apoptosis. Whilst WT hnRNP A1 bound TPNO-1, mutant hnRNP A1 showed reduced TPNO-1 binding. These data suggest SNVs in hnRNP A1 might contribute to pathogenesis of MS.
World alliance for arts education: A reflection upon seven years of advocacy
Authors: Buck Ralph 
Published: June 2014

Abstract
The World Alliance for Arts Education (WAAE) is a peak arts organization that aims to foster diverse and sustainable arts education. This article traces the journey and emergence of the WAAE from an idea in 2006 to an internationally respected alliance today. The journey of WAAE has included 1000s of arts educators across the globe. This account of the WAAE takes an insider perspective, providing a kind of travelogue, an auto-narrative noting key events, places and persons in respective organizations and vital partnerships. The article reflects upon dominant emergent issues raised over seven years and issues that inform the development of non-government organizations and alliances. The journey of this narrative begins by quickly highlighting a key destination we arrived at in Paris in 2012. Noting this endpoint upfront, contextualizes the journey of the article but also the journey of the WAAE.
So we can dance! Towards a new inclusive Australian dance curriculum – power, contestations and settlements
Authors: Meiners Jeff 
Published: June 2014

Abstract
This article uses autoethnographic writing in a research study that encompasses aspects of a personal and professional journey to locate dance within school cultures. Critical Discourse Analysis was utilized to investigate factors impacting on the construction and realization of a dance curriculum for all primary school students in Australia. The investigation is informed by Bourdieuian and Foucaultian approaches to reveal discourses, struggles and the effects of power in the construction of a new school dance curriculum within the context of political and micro-political interests related to dance education. In the neo-liberal context of the globalized idea of a national curriculum, dance as a learning experience in schools is usually located at the bottom of a deeply entrenched curriculum hierarchy. The article provides insight into the dance curriculum deliberation and settlement process, contributing to arts curriculum development research.
Book Reviews
Authors: Hjelde Katrine , Lim Maria , Wasilewski Marek 
Published: June 2014

Abstract
Artist, Researcher, Teacher: A Study of Professional Identity in Art and Education, Alan Thornton (2012) Bristol: Intellect, 96 pp., ISBN: 9781841506449, p/bk, £16/$23
The Art and Craft of Pedagogy: Portraits of Effective Teachers, Richard Hickman (2011) London and New York: Bloomsbury, 174 pp., ISBN: 9781847062901, p/bk, £24.99
Black Mountain College: Experiment in Art, Vincent Katz (ed.) (2013) Cambridge, MA and London: MIT Press, 352 pp., ISBN: 9780262518451, p/bk, £27.95
Is transactional memory an oxymoron?
Authors: Hill Mark D. 
Published: June 2014

Transactional memory (TM) was invented 15 years ago [1]. Recently, however, TM activity has exploded [2], as the proliferation of multicore chips has provoked researchers to revisit support for parallel programming. Since some regard me as a TM expert, most of my talk will summarize TM's goals and implementation options, primarily by developing a taxonomy and using Wisconsin LogTM [3, 4] as a case study. In particular, I will consider TM implementations via software, hardware, and hybrids, as well as important design choices, such as how to buffer TM writes and when to detect TM conflicts.
I will conclude with forward-looking comments regarding TM and database transactions. In theory, the two concepts have many similarities. In practice, however, they differ substantially. First, today's TM exclusively targets concurrency, while database transactions seek reliability first. Second, TM implementations focus in operations with caches and memory, while database transactions deal more with the more substantial access gap between memory and disks. Finally, I will speculate on cross-fertilization opportunities between TM and database transactions. I will not provide answers here, in part because you are the database experts. Nevertheless, I hope to encourage us all to ask the right questions.
STBenchmark
Authors: Alexe Bogdan , Tan Wang-Chiew , Velegrakis Yannis 
Published: June 2014

A fundamental problem in information integration is to precisely specify the relationships, called mappings, between schemas. Designing mappings is a time-consuming process. To alleviate this problem, many mapping systems have been developed to assist the design of mappings. However, a benchmark for comparing and evaluating these systems has not yet been developed.
We present STBenchmark, a solution towards a much needed benchmark for mapping systems. We first describe the challenges that are unique to the development of benchmarks for mapping systems. After this, we describe the three components of STBenchmark: (1) a basic suite of mapping scenarios that we believe represents a minimum set of transformations that should be readily supported by any mapping system, (2) a mapping scenario generator as well as an instance generator that can produce complex mapping scenarios and, respectively, instances of varying sizes of a given schema, (3) a simple usability model that can be used as a first-cut measure on the case of use of a mapping system. We use STBenchmark to evaluate four mapping systems and report our results, as well as describe some interesting observations.
Conditioning probabilistic databases
Authors: Koch Christoph , Olteanu Dan 
Published: June 2014

Past research on probabilistic databases has studied the problem of answering queries on a static database. Application scenarios of probabilistic databases however often involve the conditioning of a database using additional information in the form of new evidence. The conditioning problem is thus to transform a probabilistic database of priors into a posterior probabilistic database which is materialized for subsequent query processing or further refinement. It turns out that the conditioning problem is closely related to the problem of computing exact tuple confidence values.
It is known that exact confidence computation is an NP-hard problem. This has led researchers to consider approximation techniques for confidence computation. However, neither conditioning nor exact confidence computation can be solved using such techniques. In this paper we present efficient techniques for both problems. We study several problem decomposition methods and heuristics that are based on the most successful search techniques from constraint satisfaction, such as the Davis-Putnam algorithm. We complement this with a thorough experimental evaluation of the algorithms proposed. Our experiments show that our exact algorithms scale well to realistic database sizes and can in some scenarios compete with the most efficient previous approximation algorithms.
WebTables
Authors: Cafarella Michael J. , Halevy Alon , Wang Daisy Zhe , Wu Eugene , Zhang Yang 
Published: June 2014

The World-Wide Web consists of a huge number of unstructured documents, but it also contains structured data in the form of HTML tables. We extracted 14.1 billion HTML tables from Google's general-purpose web crawl, and used statistical classification techniques to find the estimated 154M that contain high-quality relational data. Because each relational table has its own "schema" of labeled and typed columns, each such table can be considered a small structured database. The resulting corpus of databases is larger than any other corpus we are aware of, by at least five orders of magnitude.
We describe the WEBTABLES system to explore two fundamental questions about this collection of databases. First, what are effective techniques for searching for structured data at search-engine scales? Second, what additional power can be derived by analyzing such a huge corpus?

First, we develop new techniques for keyword search over a corpus of tables, and show that they can achieve substantially higher relevance than solutions based on a traditional search engine. Second, we introduce a new object derived from the database corpus: the
attribute correlation statistics database
(AcsDB) that records corpus-wide statistics on co-occurrences of schema elements. In addition to improving search relevance, the AcsDB makes possible several novel applications:
schema auto-complete
, which helps a database designer to choose schema elements;
attribute synonym finding
, which automatically computes attribute synonym pairs for schema matching; and
join-graph traversal
, which allows a user to navigate between extracted schemas using automatically-generated join links.
Discovery of convoys in trajectory databases
Authors: Jeung Hoyoung , Yiu Man Lung , Zhou Xiaofang , Jensen Christian S. , Shen Heng Tao 
Published: June 2014

As mobile devices with positioning capabilities continue to proliferate, data management for so-called trajectory databases that capture the historical movements of populations of moving objects becomes important. This paper considers the querying of such databases for convoys, a convoy being a group of objects that have traveled together for some time.
More specifically, this paper formalizes the concept of a convoy query using density-based notions, in order to capture groups of arbitrary extents and shapes. Convoy discovery is relevant for real-life applications in throughput planning of trucks and carpooling of vehicles. Although there has been extensive research on trajectories in the literature, none of this can be applied to retrieve correctly exact convoy result sets. Motivated by this, we develop three efficient algorithms for convoy discovery that adopt the well-known filter-refinement framework. In the filter step, we apply line-simplification techniques on the trajectories and establish distance bounds between the simplified trajectories. This permits efficient convoy discovery over the simplified trajectories without missing any actual convoys. In the refinement step, the candidate convoys are further processed to obtain the actual convoys. Our comprehensive empirical study offers insight into the properties of the paper's proposals and demonstrates that the proposals are effective and efficient on real-world trajectory data.
Keyword search on external memory data graphs
Authors: Dalvi Bhavana Bharat , Kshirsagar Meghana , Sudarshan S. 
Published: June 2014

Keyword search on graph structured data has attracted a lot of attention in recent years. Graphs are a natural "lowest common denominator" representation which can combine relational, XML and HTML data. Responses to keyword queries are usually modeled as trees that connect nodes matching the keywords.
In this paper we address the problem of keyword search on graphs that may be significantly larger than memory. We propose a graph representation technique that combines a condensed version of the graph (the "supernode graph") which is always memory resident, along with whatever parts of the detailed graph are in a cache, to form a multi-granular graph representation. We propose two alternative approaches which extend existing search algorithms to exploit multigranular graphs; both approaches attempt to minimize IO by directing search towards areas of the graph that are likely to give good results. We compare our algorithms with a virtual memory approach on several real data sets. Our experimental results show significant benefits in terms of reduction in IO due to our algorithms.
Industry-scale duplicate detection
Authors: Weis Melanie , Naumann Felix , Jehle Ulrich , Lufter Jens , Schuster Holger 
Published: June 2014

Duplicate detection is the process of identifying multiple representations of a same real-world object in a data source. Duplicate detection is a problem of critical importance in many applications, including customer relationship management, personal information management, or data mining.
In this paper, we present how a research prototype, namely DogmatiX, which was designed to detect duplicates in hierarchical XML data, was successfully extended and applied on a large scale industrial relational database in cooperation with Schufa Holding AG. Schufa's main business line is to store and retrieve credit histories of over 60 million individuals. Here, correctly identifying duplicates is critical both for individuals and companies: On the one hand, an incorrectly identified duplicate potentially results in a false negative credit history for an individual, who will then not be granted credit anymore. On the other hand, it is essential for companies that Schufa detects duplicates of a person that deliberately tries to create a new identity in the database in order to have a clean credit history.
Besides the quality of duplicate detection, i.e., its effectiveness, scalability cannot be neglected, because of the considerable size of the database. We describe our solution to coping with both problems and present a comprehensive evaluation based on large volumes of real-world data.
Towards a streaming SQL standard
Authors: Jain Namit , Mishra Shailendra , Srinivasan Anand , Gehrke Johannes , Widom Jennifer , Balakrishnan Hari , Çetintemel Uǧur , Cherniack Mitch , Tibbetts Richard , Zdonik Stan 
Published: June 2014

This paper describes a unification of two different SQL extensions for streams and its associated semantics. We use the data models from Oracle and StreamBase as our examples. Oracle uses a time-based execution model while StreamBase uses a tuple-based execution model. Time-based execution provides a way to model simultaneity while tuple-based execution provides a way to react to primitive events as soon as they are seen by the system.
The result is a new model that gives the user control over the granularity at which one can express simultaneity. Of course, it is possible to ignore simultaneity altogether. The proposed model captures ordering and simultaneity through partial orders on batches of tuples. The batching and the ordering are encapsulated in and can be modified by means of a powerful new operator that we call SPREAD. This paper describes the semantics of SPREAD and gives several examples of its use.
Binary XML storage and query processing in Oracle 11g
Authors: Zhang Ning , Agarwal Nipun , Chandrasekar Sivasankaran , Idicula Sam , Medi Vijay , Petride Sabina , Sthanikam Balasubramanyam 
Published: June 2014

Oracle RDBMS has supported XML data management for more than six years since version 9i. Prior to 11g, text-centric XML documents can be stored as-is in a CLOB column and schema-based data-centric documents can be shredded and stored in object-relational (OR) tables mapped from their XML Schema. However, both storage formats have intrinsic limitations---XML/CLOB has unacceptable query and update performance, and XML/OR requires XML schema. To tackle this problem, Oracle 11g introduces a native Binary XML storage format and a complete stack of data management operations. Binary XML was designed to address a wide range of real application problems encountered in XML data management---schema flexibility, amenability to XML indexes, update performance, schema evolution, just to name a few.
In this paper, we introduce the Binary XML storage format based on Oracle SecureFiles System[21]. We propose a lightweight navigational index on top of the storage and an NFA-based navigational algorithm to provide efficient streaming processing. We further optimize query processing by exploiting XML structural and schema information that are collected in database dictionary. We conducted extensive experiments to demonstrate high performance of the native Binary XML in query processing, update, and space consumption.