bluuebunny/crossref_metadata_2025_split huggingface dataset:
A novel, cell‐free PCR‐based assay for evaluating the inhibitory activity of antiretroviral compounds against HIV reverse transcriptase
Authors: Frezza Caterina , Balestrieri Emanuela , Marino‐Merlo Francesca , Mastino Antonio , Macchi Beatrice 
Published: September 2013

AbstractThis study describes a novel, PCR‐based assay that evaluates the ability of compounds to inhibit cDNA generation by HIV reverse transcriptase (RT), of both commercial and viral lysate origin, from a known RNA template. The template consisted of RNA from stable transfectants ectopically expressing the US6 gene of herpes simplex virus‐1, coding for glycoprotein D. Controls were carried out to demonstrate that no residual DNA polymerase activity or DNA contamination was responsible for the amplified DNA in the tested, control samples. In this assay, 0.1 μM nevirapine totally inhibited the RT activity of 0.5 U commercial HIV RT, while 10 nM inhibited it by only 10%. Conversely, 10 pM efavirenz completely inhibited 0.5 U HIV RT. Similar results were obtained when a self‐prepared viral lysate was used as a source of HIV RT. A reference commercial kit directly measuring HIV RT activity, without amplification, was less sensitive than the new assay. As a consequence, the HIV RT 50% inhibitory concentration of nevirapine and efavirenz in the newly described assay was 8 and 5 × 103 times lower, respectively, than in the commercial assay. In conclusion, this novel method was sensitive, reproducible, and sufficiently rapid for screening in vitro the functional activity of known or potential antiretroviral compounds against HIV RT. J. Med. Virol. 86:1–7, 2014. © 2013 Wiley Periodicals, Inc.
Sequential Fractionation of Cottonseed Meal to Improve Its Wood Adhesive Properties
Authors: He Zhongqi , Cheng Huai N. , Chapital Dorselyn C. , Dowd Michael K. 
Published: September 2013

AbstractFor better understanding of the adhesive properties of different fractions of cottonseed protein, cottonseed meals from both glanded and glandless cotton varieties were separated into several fractions. Each meal was sequentially extracted with water and 1 M NaCl solution, or with phosphate buffer and NaCl solution. Adhesives were prepared from the recovered fractions and hot‐pressed onto maple veneer strips and tested for their properties. The adhesive strength of the water‐ and buffer‐washed solid fractions (i.e., the un‐extractable residues of the meals) from the glanded seed ranged from 1.32 to 1.62 MPa and were unchanged or increased compared with the adhesive strength of the original meal that varied from 0.98 and 1.49 MPa. Soaking the wood specimens bonded at 80 °C revealed that the water resistance of these water‐ and buffer‐washed adhesives was significantly improved in that they exhibited no delamination during soaking compared with the meal adhesive that showed some delamination (20–30 % of the samples). Furthermore, the water resistance of these fractions with wet shear strength around 1.5 MPa was comparable to that of cottonseed protein isolate (>90 % protein) when the joints were bonded at 100 °C. The preparations from glandless cottonseed meals showed similar adhesive performances. Additional extraction of the meals with NaCl solution reduced adhesive performance. The results suggest that water‐ or buffer‐washed cottonseed meal fractions can be used as wood adhesives and would be less costly to prepare than cottonseed protein isolates.
Cohort Trends in Premarital First Births: What Role for the Retreat From Marriage?
Authors: England Paula , Wu Lawrence L. , Shafer Emily Fitzgibbons 
Published: September 2013

Abstract
We examine cohort trends in premarital first births for U.S. women born between 1920 and 1964. The rise in premarital first births is often argued to be a consequence of the retreat from marriage, with later ages at first marriage resulting in more years of exposure to the risk of a premarital first birth. However, cohort trends in premarital first births may also reflect trends in premarital sexual activity, premarital conceptions, and how premarital conceptions are resolved. We decompose observed cohort trends in premarital first births into components reflecting cohort trends in (1) the age-specific risk of a premarital conception taken to term; (2) the age-specific risk of first marriages not preceded by such a conception, which will influence women’s years of exposure to the risk of a premarital conception; and (3) whether a premarital conception is resolved by entering a first marriage before the resulting first birth (a “shotgun marriage”). For women born between 1920–1924 and 1945–1949, increases in premarital first births were primarily attributable to increases in premarital conceptions. For women born between 1945–1949 and 1960–1964, increases in premarital first births were primarily attributable to declines in responding to premarital conceptions by marrying before the birth. Trends in premarital first births were affected only modestly by the retreat from marriages not preceded by conceptions—a finding that holds for both whites and blacks. These results cast doubt on hypotheses concerning “marriageable” men and instead suggest that increases in premarital first births resulted initially from increases in premarital sex and then later from decreases in responding to a conception by marrying before a first birth.
Standardizing Documentation for Postoperative Nausea and Vomiting in the Electronic Health Record
Authors: DeBlieck Conni , LaFlamme Anne Fishman , Rivard Mary Jane , Monsen Karen A. 
Published: September 2013

AbstractPostoperative nausea and vomiting (PONV) remains a common postoperative complication that causes patient discomfort and increases health care costs. Clinicians use the American Society of PeriAnesthesia Nurses (ASPAN) guideline to help prevent and treat PONV. However, the lack of standardized terminology in the electronic health record (EHR) and the lack of clinical decision support tools make it difficult for clinicians to document guideline implementation and to determine the effects of nursing care on PONV. To address this, we created a concept map of the Perioperative Nursing Data Set (PNDS) that illustrates the relationship between elements of this standardized nursing terminology and the ASPAN guideline, using the Systematized Nomenclature of Medicine—Clinical Terms multidisciplinary terminology to fill any gaps. This mapping results in a standardized dataset specific to PONV for use in an EHR, which links nursing care to nursing diagnoses, interventions, and outcomes. The mapping and documentation in the EHR also allows standardized data collection for research, evaluation, and benchmarking, which makes perioperative nursing care of patients who are at risk for or experiencing PONV measureable and visible. Distributing this information to perioperative and perianesthesia nursing personnel, in addition to implementing risk assessment tools for PONV and clinical support alerts in electronic documentation systems, will help support implementation of the PONV clinical practice guideline in the EHR.
Different routes to metacognitive judgments: The role of accuracy motivation
Authors: Park Se‐Bum , Bae Sung Joo 
Published: September 2013

AbstractThe current research proposes that metacognitive difficulty affects product evaluation through two different routes—the feelings of ease‐of‐retrieval heuristic and the self‐validation process. The findings across four laboratory experiments show that metacognitive difficulty can undermine product evaluation through the feelings of ease‐of‐retrieval heuristic among low‐accuracy individuals, regardless of a perceived fit between expected and experienced difficulty. In contrast, the findings indicate that metacognitive difficulty can enhance (vs. undermine) product evaluation among high‐accuracy individuals through the self‐validation process when there is a perceived fit (vs. misfit) between expected and experienced difficulty. We suggest that individuals under high accuracy motivation are more likely than those under low accuracy motivation to draw less determined and more flexible interpretation of metacognitive difficulty in making their product evaluation.
Ein Blick auf den Produktionsprozess: Mehr Effizienz durch neue Aufgabenverteilung im Gesundheitssystem? Beispiele aus der Physiotherapie
Authors: Räbiger Jutta 
Published: September 2013

Einleitung
Möglichkeiten, die Effektivität und Effizienz der Versorgung zu verbessern, liegen nicht nur in der (wettbewerblichen) Gestaltung des Gesundheitssystems. Dieser Beitrag untersucht, inwieweit die Organisation des ‘Produktionsprozesses‘, speziell die Umverteilung von Aufgaben zwischen den Gesundheitsberufen, die Wirksamkeit und Wirtschaftlichkeit der Versorgung steigern kann. Die bisher vorgelegten Ergebnisse zu den Modellen der Blanko-Verordnung und des Direktzugangs in der Physiotherapie, bei der die wesentlichen Entscheidungen über die therapeutische Behandlung (z.T.) vom Arzt auf den Physiotherapeuten verlagert werden, lassen positive Effekte für die Patienten und die Krankenversicherungen erwarten.
Does active psychosis cause neurobiological pathology? A critical review of the neurotoxicity hypothesis
Authors: Rund B. R. 
Published: September 2013

BackgroundSince the neurotoxicity hypothesis was launched in 1991, it has generated a great deal of interest and given rise to several studies investigating the validity of the hypothesis that being psychotic has a toxic effect on the brain. The toxicity argument is used to justify early treatment. This review attempts to assess the studies that have addressed the question: Does an active psychosis, indexed by the duration of untreated psychosis (DUP), cause neurobiological pathology?MethodThe validity of the hypothesis has been studied primarily by correlation analyses that assess whether there are significant correlations between DUP and changes in neurocognitive functioning or brain structure. In this review, relevant reports were identified by a literature survey.ResultsOf the 35 studies (33 papers) evaluated, six neurocognitive studies supported the hypothesis and 16 did not. Eight morphology studies supported the hypothesis and five did not. In general, the studies that did not support the neurotoxicity hypothesis were larger in size and had more adequate designs (longitudinal) than those that supported the hypothesis.ConclusionsOverall, there is limited empirical evidence for the neurotoxicity hypothesis in the studies reviewed. However, it is possible that there is a threshold value for a toxic effect of psychosis, rather than a linear relationship between DUP and a neurotoxic effect, and that several of the studies evaluated did not have a long enough DUP to detect a toxic effect of active psychosis.
Some reductions of the spectral set conjecture to integers
Authors: DUTKAY DORIN ERVIN , LAI CHUN–KIT 
Published: September 2013

AbstractThe spectral set conjecture, also known as the Fuglede conjecture, asserts that every bounded spectral set is a tile and vice versa. While this conjecture remains open on${\mathbb R}^1$, there are many results in the literature that discuss the relations among various forms of the Fuglede conjecture on${\mathbb Z}_n$,${\mathbb Z}$and${\mathbb R}^1$and also the seemingly stronger universal tiling (spectrum) conjectures on the respective groups. In this paper, we clarify the equivalences between these statements in dimension one. In addition, we show that if the Fuglede conjecture on${\mathbb R}^1$is true, then every spectral set with rational measure must have a rational spectrum. We then investigate the Coven–Meyerowitz property for finite sets of integers, introduced in [1], and we show that if the spectral sets and the tiles in${\mathbb Z}$satisfy the Coven–Meyerowitz property, then both sides of the Fuglede conjecture on${\mathbb R}^1$are true.
Detection and exploitation of functional dependencies for model generation
Authors: DE CAT BROES , BRUYNOOGHE MAURICE 
Published: September 2013

AbstractRecent work in Answer Set Programming has integrated ideas from Constraint Programming. This has led to a new field called ASP Modulo CSP (CASP), in which the ASP language is enriched with constraint atoms representing constraint satisfaction problems. These constraints have a more compact grounding and are handled by a new generation of search algorithms. However, the burden is on the modeler to exploit these new constructs in his declarative problem specifications. Here, we explore how to remove this burden by automatically generating constraint atoms. We do so in the context of FO(·)IDP, a knowledge representation language that extends first-order logic with, among others, inductive definitions, arithmetic and aggregates. We uncover functional dependencies in declarative problem specifications with a theorem prover and exploit them with a transformation that introduces functions. Experimental evaluation shows that we obtain more compact groundings and better search performance.
The jobs puzzle: Taking on the challenge via controlled natural language processing
Authors: SCHWITTER ROLF 
Published: September 2013

AbstractIn this paper we take on Stuart C. Shapiro's challenge of solving the Jobs Puzzle automatically and do this via controlled natural language processing. Instead of encoding the puzzle in a formal language that might be difficult to use and understand, we employ a controlled natural language as a high-level specification language that adheres closely to the original notation of the puzzle and allows us to reconstruct the puzzle in a machine-processable way and add missing and implicit information to the problem description. We show how the resulting specification can be translated into an answer set program and be processed by a state-of-the-art answer set solver to find the solutions to the puzzle.
Compiling Input* FO(·) inductive definitions into tabled prolog rules for IDP3
Authors: JANSEN JOACHIM , JORISSEN ALBERT , JANSSENS GERDA 
Published: September 2013

AbstractFO(·)IDP3 extends first-order logic with inductive definitions, partial functions, types and aggregates. Its model generator IDP3 first grounds the theory and then uses search to find the models. The grounder uses Lifted Unit Propagation (LUP) to reduce the size of the groundings of problem specifications in IDP3. LUP is in general very effective, but performs poorly on definitions of predicates whose two-valued interpretation can be computed from data in the input structure. To solve this problem, a preprocessing step is introduced that converts such definitions to Prolog code and uses XSB Prolog to compute their interpretation. The interpretation of these predicates is then added to the input structure, their definitions are removed from the theory and further processing is done by the standard IDP3 system. Experimental results show the effectiveness of our method.
Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments
Authors: GRECO SERGIO , MOLINARO CRISTIAN , TRUBITSYNA IRINA 
Published: September 2013

AbstractRecent years have witnessed an increasing interest in enhancing answer set solvers by allowing function symbols. Since the introduction of function symbols makes common inference tasks undecidable, research has focused on identifying classes of programs allowing only a restricted use of function symbols while ensuring decidability of common inference tasks. Finitely-ground programs, introduced in Calimeri et al. (2008), are guaranteed to admit a finite number of stable models with each of them of finite size. Stable models of such programs can be computed and thus common inference tasks become decidable. Unfortunately, checking whether a program is finitely-ground is semi-decidable. This has led to several decidable criteria, called termination criteria, providing sufficient conditions for a program to be finitely-ground. This paper presents a new technique that, used in conjunction with current termination criteria, allows us to detect more programs as finitely-ground. Specifically, the proposed technique takes a logic program ${\cal P}$ and transforms it into an adorned program ${{\cal P}}$μ with the aim of applying termination criteria to ${{\cal P}}$μ rather than ${\cal P}$. The transformation is sound in that if the adorned program satisfies a certain termination criterion, then the original program is finitely-ground. Importantly, applying termination criteria to adorned programs rather than the original ones strictly enlarges the class of programs recognized as finitely-ground.
Fuzzy answer sets approximations
Authors: ALVIANO MARIO , PEÑALOZA RAFAEL 
Published: September 2013

AbstractFuzzy answer set programming (FASP) is a recent formalism for knowledge representation that enriches the declarativity of answer set programming by allowing propositions to be graded. To now, no implementations of FASP solvers are available and all current proposals are based on compilations of logic programs into different paradigms, like mixed integer programs or bilevel programs. These approaches introduce many auxiliary variables which might affect the performance of a solver negatively. To limit this downside, operators for approximating fuzzy answer sets can be introduced: Given a FASP program, these operators compute lower and upper bounds for all atoms in the program such that all answer sets are between these bounds. This paper analyzes several operators of this kind which are based on linear programming, fuzzy unfounded sets and source pointers. Furthermore, the paper reports on a prototypical implementation, also describing strategies for avoiding computations of these operators when they are guaranteed to not improve current bounds. The operators and their implementation can be used to obtain more constrained mixed integer or bilevel programs, or even for providing a basis for implementing a native FASP solver. Interestingly, the semantics of relevant classes of programs with unique answer sets, like positive programs and programs with stratified negation, can be already computed by the prototype without the need for an external tool.
BigYAP: Exo-compilation meets UDI
Authors: SANTOS COSTA VÍTOR , VAZ DAVID 
Published: September 2013

AbstractThe widespread availability of large data-sets poses both an opportunity and a challenge to logic programming. A first approach is to couple a relational database with logic programming, say, a Prolog system with MySQL. While this approach does pay off in cases where the data cannot reside in main memory, it is known to introduce substantial overheads. Ideally, we would like the Prolog system to deal with large data-sets in an efficient way both in terms of memory and of processing time. Just In Time Indexing (JITI) was mainly motivated by this challenge, and can work quite well in many application.Exo-compilation, designed to deal with large tables, is a next step that achieves very interesting results, reducing the memory footprint over two thirds. We show that combining exo-compilation with Just In Time Indexing can have significant advantages both in terms of memory usage and in terms of execution time.An alternative path that is relevant for many applications is User-Defined Indexing (UDI). This allows the use of specialized indexing for specific applications, say the spatial indexing crucial to any spatial system. The UDI sees indexing as pluggable modules, and can naturally be combined with Exo-compilation. We do so by using UDI with exo-data, and incorporating ideas from the UDI into high-performance indexers for specific tasks.
A declarative approach to distributed computing: Specification, execution and analysis
Authors: MA JIEFEI , LE FRANCK , WOOD DAVID , RUSSO ALESSANDRA , LOBO JORGE 
Published: September 2013

AbstractThere is an increasing interest in using logic programming to specify and implement distributed algorithms, including a variety of network applications. These are applications where data and computation are distributed among several devices and where, in principle, all the devices can exchange data and share the computational results of the group. In this paper we propose a declarative approach to distributed computing whereby distributed algorithms and communication models can be (i) specified as action theories of fluents and actions; (ii) executed as collections of distributed state machines, where devices are abstracted as (input/output) automata that can exchange messages; and (iii) analysed using existing results on connecting causal theories and Answer Set Programming. Results on the application of our approach to different classes of network protocols are also presented.
Lab on a Biomembrane: Rapid prototyping and manipulation of 2D fluidic lipid bilayer circuits
Authors: Ainla Alar , Gözen Irep , Hakonen Bodil , Jesorka Aldo 
Published: September 2013

AbstractLipid bilayer membranes are among the most ubiquitous structures in the living world, with intricate structural features and a multitude of biological functions. It is attractive to recreate these structures in the laboratory, as this allows mimicking and studying the properties of biomembranes and their constituents and to specifically exploit the intrinsic two-dimensional fluidity. Even though diverse strategies for membrane fabrication have been reported, the development of related applications and technologies has been hindered by the unavailability of both versatile and simple methods. Here we report a rapid prototyping technology for two-dimensional fluidic devices, based on in-situ generated circuits of phospholipid films. In this “lab on a molecularly thin membrane”, various chemical and physical operations, such as writing, erasing, functionalization and molecular transport, can be applied to user-defined regions of a membrane circuit. This concept is an enabling technology for research on molecular membranes and their technological use.
Diagnostic leukapheresis enables reliable detection of circulating tumor cells of nonmetastatic cancer patients
Authors: Fischer Johannes C. , Niederacher Dieter , Topp Stefan A. , Honisch Ellen , Schumacher Sarah , Schmitz Norma , Zacarias Föhrding Luisa , Vay Christian , Hoffmann Imke , Kasprowicz Nikola S. , Hepp Philip G. , Mohrmann Svjetlana , Nitz Ulrike , Stresemann Antje , Krahn Thomas , Henze Tanja , Griebsch Evelyn , Raba Katharina , Rox Jutta M. , Wenzel Folker , Sproll Christoph , Janni Wolfgang , Fehm Tanja , Klein Christoph A. , Knoefel Wolfram Trudo , Stoecklein Nikolas H. 
Published: September 2013

Significance
The infrequent detection of circulating tumor cells (CTCs) has hindered their clinical implication and their potential use in the sense of a “liquid biopsy” for cancer diagnosis and therapy. Hypothesizing that the limited blood volume commonly used for CTC analysis (1–10 mL) accounts for variable detection rates, we used leukapheresis to screen large blood volumes for CTCs. This enabled a more reliable detection of CTCs at high frequency even in nonmetastatic cancer patients. Thus, diagnostic leukapheresis may facilitate the routine clinical use of CTCs as biomarkers for personalized medicine. Combined with technologies for single-cell molecular genetics or cell biology, it may significantly improve prediction of therapy response and monitoring, especially in early systemic cancer.
Introduction
Authors: Maslin Mark 
Published: September 2013

Abstract
The ‘Introduction’ explains that global warming is the most important science issue of the 21st century, challenging the very structure of our global society. The problem is that global warming is not just a scientific concern, but encompasses economics, sociology, geopolitics, local politics, and individuals' choice of lifestyle. Global warming is caused by the massive increase of greenhouse gases, such as carbon dioxide, in the atmosphere, resulting from the burning of fossil fuels and deforestation. An overview of the following chapters is provided.