bluuebunny/crossref_metadata_2025_split huggingface dataset:
Abbreviated Breast Magnetic Resonance Imaging (MRI): First Postcontrast Subtracted Images and Maximum-Intensity Projection—A Novel Approach to Breast Cancer Screening With MRI
Authors: Kuhl Christiane K. , Schrading Simone , Strobel Kevin , Schild Hans H. , Hilgers Ralf-Dieter , Bieling Heribert B. 
Published: June 2014

Purpose We investigated whether an abbreviated protocol (AP), consisting of only one pre- and one postcontrast acquisition and their derived images (first postcontrast subtracted [FAST] and maximum-intensity projection [MIP] images), was suitable for breast magnetic resonance imaging (MRI) screening. Methods We conducted a prospective observational reader study in 443 women at mildly to moderately increased risk who underwent 606 screening MRIs. Eligible women had normal or benign digital mammograms and, for those with heterogeneously dense or extremely dense breasts (n = 427), normal or benign ultrasounds. Expert radiologists reviewed the MIP image first to search for significant enhancement and then reviewed the complete AP (consisting of MIP and FAST images and optionally their nonsubtracted source images) to characterize enhancement and establish a diagnosis. Only thereafter was the regular full diagnostic protocol (FDP) analyzed. Results MRI acquisition time for FDP was 17 minutes, versus 3 minutes for the AP. Average time to read the single MIP and complete AP was 2.8 and 28 seconds, respectively. Eleven breast cancers (four ductal carcinomas in situ and seven invasive cancers; all T1N0 intermediate or high grade) were diagnosed, for an additional cancer yield of 18.2 per 1,000. MIP readings were positive in 10 (90.9%) of 11 cancers and allowed establishment of the absence of breast cancer, with a negative predictive value (NPV) of 99.8% (418 of 419). Interpretation of the complete AP, as with the FDP, allowed diagnosis of all cancers (11 [100%] of 11). Specificity and positive predictive value (PPV) of AP versus FDP were equivalent (94.3% v 93.9% and 24.4% v 23.4%, respectively). Conclusion An MRI acquisition time of 3 minutes and an expert radiologist MIP image reading time of 3 seconds are sufficient to establish the absence of breast cancer, with an NPV of 99.8%. With a reading time < 30 seconds for the complete AP, diagnostic accuracy was equivalent to that of the FDP and resulted in an additional cancer yield of 18.2 per 1,000.
Human Papillomavirus and Overall Survival After Progression of Oropharyngeal Squamous Cell Carcinoma
Authors: Fakhry Carole , Zhang Qiang , Nguyen-Tan Phuc Felix , Rosenthal David , El-Naggar Adel , Garden Adam S. , Soulieres Denis , Trotti Andy , Avizonis Vilija , Ridge John Andrew , Harris Jonathan , Le Quynh-Thu , Gillison Maura 
Published: June 2014

PurposeRisk of cancer progression is reduced for patients with human papillomavirus (HPV) –positive oropharynx cancer (OPC) relative to HPV-negative OPC, but it is unknown whether risk of death after progression is similarly reduced.Patients and MethodsPatients with stage III-IV OPC enrolled onto Radiation Therapy Oncology Group trials 0129 or RTOG 0522 who had known tumor p16 status plus local, regional, and/or distant progression after receiving platinum-based chemoradiotherapy were eligible for a retrospective analysis of the association between tumor p16 status and overall survival (OS) after disease progression. Rates were estimated by Kaplan-Meier method and compared by log-rank; hazard ratios (HRs) were estimated by Cox models. Tests and models were stratified by treatment protocol.ResultsA total of 181 patients with p16-positive (n = 105) or p16-negative (n = 76) OPC were included in the analysis. Patterns of failure and median time to progression (8.2 v 7.3 months; P = .67) were similar for patients with p16-positive and p16-negative tumors. After a median follow-up period of 4.0 years after disease progression, patients with p16-positive OPC had significantly improved survival rates compared with p16-negative patients (2-year OS, 54.6% v 27.6%; median, 2.6 v 0.8 years; P < .001). p16-positive tumor status (HR, 0.48; 95% CI, 0.31 to 0.74) and receipt of salvage surgery (HR, 0.48; 95% CI; 0.27 to 0.84) reduced risk of death after disease progression whereas distant versus locoregional progression (HR, 1.99; 95% CI, 1.28 to 3.09) increased risk, after adjustment for tumor stage and cigarette pack-years at enrollment.ConclusionTumor HPV status is a strong and independent predictor of OS after disease progression and should be a stratification factor for clinical trials for patients with recurrent or metastatic OPC.
Calcium, Vitamin D, Dairy Products, and Mortality Among Colorectal Cancer Survivors: The Cancer Prevention Study-II Nutrition Cohort
Authors: Yang Baiyu , McCullough Marjorie L. , Gapstur Susan M. , Jacobs Eric J. , Bostick Roberd M. , Fedirko Veronika , Flanders W. Dana , Campbell Peter T. 
Published: June 2014

Purpose Higher calcium, vitamin D, and dairy product intakes are associated with lower colorectal cancer incidence, but their impacts on colorectal cancer survival are unclear. We evaluated associations of calcium, vitamin D, and dairy product intakes before and after colorectal cancer diagnosis with all-cause and colorectal cancer-specific mortality among colorectal cancer patients. Patients and Methods This analysis included 2,284 participants in a prospective cohort who were diagnosed with invasive, nonmetastatic colorectal cancer after baseline (1992 or 1993) and up to 2009. Mortality follow-up was through 2010. Prediagnosis risk factor information was collected on the baseline questionnaire. Postdiagnosis information was collected via questionnaires in 1999 and 2003 and was available for 1,111 patients. Results A total of 949 participants with colorectal cancer died during follow-up, including 408 from colorectal cancer. In multivariable-adjusted Cox proportional hazards regression models, postdiagnosis total calcium intake was inversely associated with all-cause mortality (relative risk [RR] for those in the highest relative to the lowest quartiles, 0.72; 95% CI, 0.53-0.98; Ptrend = .02) and associated with marginally statistically significant reduced colorectal cancer-specific mortality (RR, 0.59; 95% CI, 0.33 to 1.05; Ptrend = .01). An inverse association with all-cause mortality was also observed for postdiagnosis milk intake (RR, 0.72; 95% CI, 0.55 to 0.94; Ptrend = .02), but not vitamin D intake. Prediagnosis calcium, vitamin D, and dairy product intakes were not associated with any mortality outcomes. Conclusion Higher postdiagnosis intakes of total calcium and milk may be associated with lower risk of death among patients with nonmetastatic colorectal cancer.
The role of animal models in tendon research
Authors: Hast M. W. , Zuskov A. , Soslowsky L. J. 
Published: June 2014

Tendinopathy is a debilitating musculoskeletal condition which can cause significant pain and lead to complete rupture of the tendon, which often requires surgical repair. Due in part to the large spectrum of tendon pathologies, these disorders continue to be a clinical challenge. Animal models are often used in this field of research as they offer an attractive framework to examine the cascade of processes that occur throughout both tendon pathology and repair. This review discusses the structural, mechanical, and biological changes that occur throughout tendon pathology in animal models, as well as strategies for the improvement of tendon healing. Cite this article: Bone Joint Res 2014;3:193–202.
‘Dieu et le sexe. Le pur et l’impur’: Concilier l’Islam et l’homosexualité chez Rachid O. et Abdellah Taïa
Authors: Ncube Gibson 
Published: June 2014

Abstract
Although homosexuality is palpably present in Arab-Muslim societies of the Maghreb, there is nonetheless intolerance of their open discussion. Even on a purely discursive level, taboo remains an insurmountable hurdle. The present study attempts to contribute to growing debate and interest in various aspects and potential common points between literary production and ‘marginal’ sexuality in Francophone North Africa. This article problematizes homosexuality in Arab-Muslim societies before examining its depiction in the autofictional novels of two openly gay Moroccan writers: Rachid O. and Abdellah Taïa. Of particular interest in this literary analysis is the manner in which the protagonists of the two novelists grapple in reconciling their (homo)sexuality and their religious beliefs. This article concludes by scrutinizing the transgressiveness of these pioneering contemporary novels in their candid and open representation homosexuality.
Bien que l’homosexualité soit manifestement présente dans les sociétés arabo-musulmanes du Maghreb, sa discussion ouverte demeure intolérable. Même sur un plan purement discursif, le tabou reste un obstacle insurmontable. La présente étude vise à contribuer au débat et à l’intérêt croissants par rapport aux divers aspects et aux points communs potentiels entre la production littéraire et la sexualité ‘marginale’ dans les milieux francophones de l’Afrique du Nord. Cet article problématise initialement l’homosexualité dans les sociétés arabo-musulmanes avant d’examiner sa représentation dans les romans autofictionnels de deux écrivains marocains qui sont ouvertement gay: Rachid O. et Abdellah Taïa. L’intérêt particulier de cette analyse littéraire sera la manière dont les protagonistes des deux romanciers se négocient la difficulté de concilier leur (homo)sexualité et leurs croyances religieuses. Cet article examine, en guise de conclusion, la nature transgressive de ces romans contemporains pionniers dans leur représentation franche et ouverte de l’homosexualité.
Review Article
Authors: Arnold Markus 
Published: June 2014

Abstract
Géo/Graphies postcoloniales. La Poétique de l’espace dans le roman mauricien et sénégalais, Antje Ziethen (2013) Trier: WVT Wissenschaftlicher Verlag Trier, 172 pp., ISBN: 9783868214260, 25€
Structural signatures for tree data structures
Authors: Kundu Ashish , Bertino Elisa 
Published: June 2014

Data sharing with multiple parties over a third-party distribution framework requires that both data integrity and confidentiality be assured. One of the most widely used data organization structures is the tree structure. When such structures encode sensitive information (such as in XML documents), it is crucial that integrity and confidentiality be assured not only for the content, but also for the structure. Digital signature schemes are commonly used to authenticate the integrity of the data. The most widely used such technique for tree structures is the Merkle hash technique, which however is known to be "not hiding", thus leading to unauthorized leakage of information. Most techniques in the literature are based on the Merkle hash technique and thus suffer from the problem of unauthorized information leakages. Assurance of integrity and confidentiality (no leakages) of tree-structured data is an important problem in the context of secure data publishing and content distribution systems.
In this paper, we propose a signature scheme for tree structures, which assures both confidentiality and integrity and is also efficient, especially in third-party distribution environments. Our integrity assurance technique, which we refer to as the "Structural signature scheme", is based on the structure of the tree as defined by tree traversals (pre-order, post-order, in-order) and is defined using a randomized notion of such traversal numbers. In addition to formally defining the technique, we prove that it protects against violations of content and structural integrity and information leakages. We also show through complexity and performance analysis that the structural signature scheme is efficient; with respect to the Merkle hash technique, it incurs comparable cost for signing the trees and incurs lower cost for user-side integrity verification.
Maintaining dynamic channel profiles on the web
Authors: Roitman Haggai , Carmel David , Yom-Tov Elad 
Published: June 2014

This work addresses a novel problem of maintaining channel proflies on the Web. Such channel maintenance is essential for next generation of Web 2.0 applications that provide sophisticated search and discovery services over Web information channels. Maintaining a fresh channel profile is extremely difficult due to the the dynamic nature of the channel, especially under the constraint of a limited monitoring budget.
We propose a novel monitoring scheme that learns the channels' monitoring rates. The monitoring scheme is further extended to consider the content that is published on the channels. We describe a novelty detection filter that refines the monitoring rate according to the expected rate of novel content published on the channels. We further show how inter-channel profile similarities can be utilized to refine the channel monitoring rates.
Using real-world data of Web feeds we study the performance of the monitoring scheme. We experiment with several monitoring policies over a large set of Web feeds and show that a policy based on learning the monitoring rate of the channels, combined with novelty detection, outperforms alternative channel monitoring policies. Our results show that the suggested content-based policy is able to maintain high quality channel profiles under limited monitoring resources.
Efficient search for the top-k probable nearest neighbors in uncertain databases
Authors: Beskales George , Soliman Mohamed A. , Ilyas Ihab F. 
Published: June 2014

Uncertainty pervades many domains in our lives. Current real-life applications, e.g., location tracking using GPS devices or cell phones, multimedia feature extraction, and sensor data management, deal with different kinds of uncertainty. Finding the nearest neighbor objects to a given query point is an important query type in these applications.
In this paper, we study the problem of finding objects with the highest marginal probability of being the nearest neighbors to a query object. We adopt a general uncertainty model allowing for data and query uncertainty. Under this model, we define new query semantics, and provide several efficient evaluation algorithms. We analyze the cost factors involved in query evaluation, and present novel techniques to address the trade-offs among these factors. We give multiple extensions to our techniques including handling dependencies among data objects, and answering threshold queries. We conduct an extensive experimental study to evaluate our techniques on both real and synthetic data.
Type inference and type checking for queries on execution traces
Authors: Deutch Daniel , Milo Tova 
Published: June 2014

This paper studies, for the first time, the management of type information for an important class of semi-structured data: nested DAGs (Directed Acyclic Graphs) that describe execution traces of business processes (BPs for short). Specifically, we consider here type inference and type checking for queries over BP execution traces. The queries that we consider select portions of the traces that are of interest to the user; the types describe the possible shape of the execution traces in the input/output of the query.
We formally define and characterize here three common classes of BP execution traces and their respective notions of type inference and type checking. We study the complexity of the two problems for query languages of varying expressive power and present efficient type inference/checking algorithms whenever possible. Our analysis offers a nearly complete picture of which combinations of trace classes and query features lead to PTIME algorithms and which to NP-complete or undecidable problems.
Rose
Authors: Sears Russell , Callaghan Mark , Brewer Eric 
Published: June 2014

Rose is a database storage engine for high-throughput replication. It targets seek-limited, write-intensive transaction processing workloads that perform near real-time decision support and analytical processing queries. Rose uses
log structured merge
(LSM) trees to create full database replicas using purely sequential I/O, allowing it to provide orders of magnitude more write throughput than B-tree based replicas. Also, LSM-trees cannot become fragmented and provide fast, predictable index scans.

Rose's write performance relies on replicas' ability to perform writes without looking up old values. LSM-tree lookups have performance comparable to B-tree lookups. If Rose read each value that it updated then its write throughput would also be comparable to a B-tree. Although we target replication, Rose provides high write throughput to any application that updates tuples without reading existing data, such as append-only, streaming and versioning databases.
We introduce a page compression format that takes advantage of LSM-tree's sequential, sorted data layout. It increases replication throughput by reducing sequential I/O, and enables efficient tree lookups by supporting small page sizes and doubling as an index of the values it stores. Any scheme that can compress data in a single pass and provide random access to compressed values could be used by Rose.
Replication environments have multiple readers but only one writer. This allows Rose to provide atomicity, consistency and isolation to concurrent transactions without resorting to rollback, blocking index requests or interfering with maintenance tasks.
Rose avoids random I/O during replication and scans, leaving more I/O capacity for queries than existing systems, and providing scalable, real-time replication of seek-bound workloads. Analytical models and experiments show that Rose provides orders of magnitude greater replication bandwidth over larger databases than conventional techniques.
Dynamic partitioning of the cache hierarchy in shared data centers
Authors: Soundararajan Gokul , Chen Jin , Sharaf Mohamed A. , Amza Cristiana 
Published: June 2014

Due to the imperative need to reduce the management costs of large data centers, operators multiplex several concurrent database applications on a server farm connected to shared network attached storage. Determining and enforcing per-application resource quotas in the resulting cache hierarchy, on the fly, poses a complex resource allocation problem spanning the database server and the storage server tiers. This problem is further complicated by the need to provide strict Quality of Service (QoS) guarantees to hosted applications.
In this paper, we design and implement a novel coordinated partitioning technique of the database buffer pool and storage cache between applications for any given cache replacement policy and per-application access pattern. We use statistical regression to dynamically determine the mapping between cache quota settings and the resulting per-application QoS. A resource controller embedded within the database engine actuates the partitioning of the two-level cache, converging towards the configuration with maximum application utility, expressed as the service provider revenue in that configuration, based on a set of latency sample points.
Our experimental evaluation, using the MySQL database engine, a server farm with consolidated storage, and two e-commerce benchmarks, shows the effectiveness of our technique in enforcing application QoS, as well as maximizing the revenue of the service provider in shared server farms.
Identifying robust plans through plan diagram reduction
Authors: D. Harish , Darera Pooja N. , Haritsa Jayant R. 
Published: June 2014

Estimates of predicate selectivities by database query optimizers often differ significantly from those actually encountered during query execution, leading to poor plan choices and inflated response times. In this paper, we investigate mitigating this problem by replacing selectivity error-sensitive plan choices with alternative plans that provide robust performance. Our approach is based on the recent observation that even the complex and dense "plan diagrams" associated with industrial-strength optimizers can be efficiently reduced to "anorexic" equivalents featuring only a few plans, without materially impacting query processing quality.
Extensive experimentation with a rich set of TPC-H and TPC-DS-based query templates in a variety of database environments indicate that plan diagram reduction typically retains plans that are substantially resistant to selectivity errors on the base relations. However, it can sometimes also be severely counter-productive, with the replacements performing much worse. We address this problem through a generalized mathematical characterization of plan cost behavior over the parameter space, which lends itself to efficient criteria of when it is safe to reduce. Our strategies are fully non-invasive and have been implemented in the Picasso optimizer visualization tool.
Oracle SecureFiles System
Authors: Mukherjee Niloy , Aleti Bharath , Ganesh Amit , Kunchithapadam Krishna , Lynn Scott , Muthulingam Sujatha , Shergill Kam , Wang Shaoyu , Zhang Wei 
Published: June 2014

Over the last decade, the nature of content stored on computer storage systems has evolved from being relational to being semi-structured, i.e., unstructured data accompanied by relational metadata. Average data volumes have increased from a few hundred megabytes to hundreds of terabytes. Simultaneously, data feed rates have also increased with increase in processor, storage and network bandwidths. Data growth trends seem to be following Moore's law and thereby imply an exponential explosion in content volumes and rates in the years to come. The near future poses requirements for data management systems to provide solutions that provide unlimited scalability in execution, availability, recoverability and storage usage of semi-structured content.
Traditionally, filesystems have been preferred over database management systems for providing storage solutions for unstructured data, while databases have been the preferred choice to manage relational data. Lack of consolidated semi-structured content management architecture compromises security, availability, recoverability, and manageability among other features. We introduce a system without compromises, the Oracle SecureFiles System, designed to provide highly scalable storage and access execution of unstructured and structured content as first-class objects within the Oracle relational database management system. Oracle SecureFiles breaks the performance barrier that has kept such content out of databases. The architecture provides capability to maximize utilization of storage usage through compression and de-duplication and achieves robustness by preserving transactional atomicity, durability, availability, read-consistent query-ability and security of the database management system.