bluuebunny/crossref_metadata_2025_split huggingface dataset:
The effect of sowing date and nitrogen rate on the grain yield, grain quality and malt analyses of spring malting barley for distilling in Ireland
Authors: Potterton E. M. , McCabe T. 
Published: August 2018

AbstractThe significant expansion of whiskey distillation in Ireland has increased requirements on the Irish malting barley industry to supply spring barley with low grain nitrogen concentration (GNC). Published literature suggests that genetics, soil type and environmental conditions are the predominant drivers controlling production of malting barley with low GNC values. However, it is acknowledged that agronomic practices such as sowing date and nitrogen (N) application are also important factors in determining the grain yield (GY) and grain quality (GQ) of malting barley. The effects of four N fertilizer rates (90, 110, 130 and 150 kg N/ha) and two sowing dates (March and April) on GY and GQ of a two-row spring barley variety (Hordeum vulgare L. cvar Overture) was evaluated at two different sites over a 3-year period (2014–2016). Earlier sowing dates resulted in significantly higher mean GY (7.98 t/ha) compared with later sowing dates (7 t/ha). GY and GNC also increased consistently with greater increments of fertilizer N. Earlier sowing dates also significantly improved several distilling malt quality parameters, such as soluble extract (SE), fermentable extract, predicted spirit yield and fermentability. Later sowing dates increased diastatic power and soluble N. The results of the current study suggest that the likelihood of producing spring malting barley with low GNC values and better malting quality is enhanced through earlier sowing dates on suitable soil types. Earlier sowing dates also facilitated the use of higher fertilizer N rates, enabling high GY potential without crossing the GNC threshold for the distilling market.
Supercongruences for truncated hypergeometric series and p-adic gamma function
Authors: BARMAN RUPAM , SAIKIA NEELAM 
Published: August 2018

AbstractWe prove three more general supercongruences between truncated hypergeometric series and p-adic gamma function from which some known supercongruences follow. A supercongruence conjectured by Rodriguez--Villegas and proved by E. Mortenson using the theory of finite field hypergeometric series follows from one of our more general supercongruences. We also prove a supercongruence for 7F6 truncated hypergeometric series which is similar to a supercongruence proved by L. Long and R. Ramakrishna.
Case–case analysis of Campylobacter and Salmonella – using surveillance data for outbreak investigations and monitoring routine risk factors
Authors: Pogreba-Brown K. , O'Connor P. , Matthews J. , Barrett E. , Bell M. L. 
Published: August 2018

AbstractUtilising routine surveillance data, this study presents a method for generating a baseline comparison that can be used in future foodborne outbreak investigations following a case–case methodology. Salmonella and Campylobacter cases (2012–2015) from Maricopa County, AZ were compared to determine differences in risk factors, symptoms and demographics. For foods and other risk factors, adjusted odds ratios were developed using Campylobacter as the reference. Comparisons were also made for three major Salmonella subtypes, Typhimurium, Enteritidis and Poona as compared with Campylobacter. Salmonella cases were younger, while Campylobacter cases were more Hispanic and female. Campylobacter cases reported consuming peppers, sprouts, poultry, queso fresco, eggs and raw nuts more and reported contact with animal products, birds, visiting a farm or dairy, owning a pet, a sick pet, swimming in a river, lake or pond, or handling multiple raw meats more. Salmonella cases reported visiting a petting zoo and contact with a reptile more. There were significant variations by Salmonella subtype in both foods and exposures. We recommend departments conduct this analysis to generate a baseline comparison and a running average of relevant odds ratios allowing staff to focus on trace-back of contaminated food items earlier in the outbreak investigation process.
Seed traits and germination of native grasses and invasive forbs are largely insensitive to parental temperature and CO2concentration
Authors: Li Jin , Ren Lei , Bai Yuguang , Lecain Daniel , Blumenthal Dana , Morgan Jack 
Published: August 2018

AbstractThe structure and function of grassland ecosystems can be altered by a changing climate, including higher temperature and elevated atmospheric CO2concentration. Previous studies suggest that there is no consistent trend in seed germination and seedling recruitment as affected by these conditions. We collected seeds of two native and two invasive species over 6 years from a field study with elevated CO2(600 p.p.m.) and temperature (1.5/3.0°C day/night) on the mixed-grass prairie of Wyoming, USA. Seed fill, viability and mass were evaluated and germination tests were conducted under alternating temperatures in growth chambers. Thermal time requirements to reach 50% germination (θ50) and base temperatures (Tb) for germination were determined using thermal time models. Climate change conditions had limited effects on seed fill, viability and mass. The combination of CO2enrichment and warming increased germination ofBouteloua gracilis.Centaurea diffusaandLinaria dalmatica, two invasive species in this study, had the lowest θ50andTbrequired for germination among all the species studied. Although final germination percentages of these invasive species were not affected by treatments, previous studies reported increased seed production under future climate conditions, indicating that they could be more invasive at the regeneration stage in the future. We conclude that projected future temperature increases will have little effect on seed reproductive traits of native species. In addition, the distribution and abundance ofB. gracilisand invasive species may be favoured by global climate change due to enhanced germination or seed production traits caused by elevated parental CO2and temperature conditions.
Self-reported adherence to foot care in type 2 diabetes patients: do illness representations and distress matter?
Authors: Pereira M. Graça , Pedras Susana , Ferreira Gabriela 
Published: August 2018

AbstractAimThis study examined the differences and the predictive role of clinical variables, illness representations, anxiety, and depression symptoms, on self-reported foot care adherence, in patients recently diagnosed with type 2 diabetes mellitus (T2DM) and assessed no longer than a year after the diagnosis (T1) and four months later (T2).BackgroundThe high rate of diabetes worldwide is one of the major public health challenges. Foot care is the behavior least performed by patients although regular foot care could prevent complications such as diabetic foot and amputation. Psychosocial processes such as illness representations and distress symptoms may contribute to explain adherence to foot self-care behaviors.MethodsThis is a longitudinal study with two assessment moments. The sample included 271 patients, who answered the Revised Summary of Diabetes Self-Care Activities, Brief-Illness Perception Questionnaire, and Hospital Anxiety and Depression Scale.FindingsPatients reported better foot care adherence at T2. Having a higher duration of T2DM and the perception of more consequences of diabetes were associated with better self-reported foot care adherence, at T1. At T2, the predictors were lower levels of HbA1c, better self-reported foot care adherence at T1, higher comprehension about T2DM, as well as fewer depressive symptoms. Interventions to promote adherence to foot care should have in consideration these variables. The results of the present study may help health professionals in designing interventions that early detect depressive symptoms and address illness beliefs, in order to promote foot self-care behaviors reducing the incidence of future complications.
First-order Answer Set Programming as Constructive Proof Search
Authors: SCHUBERT ALEKSY , URZYCZYN PAWEŁ 
Published: August 2018

AbstractWe propose an interpretation of the first-order answer set programming (FOASP) in terms of intuitionistic proof theory. It is obtained by two polynomial translations between FOASP and the bounded-arity fragment of the Σ1 level of the Mints hierarchy in first-order intuitionistic logic. It follows that Σ1 formulas using predicates of fixed arity (in particular unary) is of the same strength as FOASP. Our construction reveals a close similarity between constructive provability and stable entailment, or equivalently, between the construction of an answer set and an intuitionistic refutation. This paper is under consideration for publication in Theory and Practice of Logic Programming
An ASP Methodology for Understanding Narratives about Stereotypical Activities
Authors: INCLEZAN DANIELA , ZHANG QINGLIN , BALDUCCINI MARCELLO , ISRANEY ANKUSH 
Published: August 2018

AbstractWe describe an application of Answer Set Programming to the understanding of narratives about stereotypical activities, demonstrated via question answering. Substantial work in this direction was done by Erik Mueller, who modeled stereotypical activities as scripts. His systems were able to understand a good number of narratives, but could not process texts describing exceptional scenarios. We propose addressing this problem by using a theory of intentions developed by Blount, Gelfond, and Balduccini. We present a methodology in which we substitute scripts by activities (i.e., hierarchical plans associated with goals) and employ the concept of an intentional agent to reason about both normal and exceptional scenarios. We exemplify the application of this methodology by answering questions about a number of restaurant stories. This paper is under consideration for acceptance in TPLP.
Shared aggregate sets in answer set programming
Authors: ALVIANO MARIO , DODARO CARMINE , MARATEA MARCO 
Published: August 2018

AbstractAggregates are among the most frequently used linguistic extensions of answer set programming. The result of an aggregation may introduce new constants during the instantiation of the input program, a feature known as value invention. When the aggregation involves literals whose truth value is undefined at instantiation time, modern grounders introduce several instances of the aggregate, one for each possible interpretation of the undefined literals. This paper introduces new data structures and techniques to handle such cases, and more in general aggregations on the same aggregate set identified in the ground program in input. The proposed solution reduces the memory footprint of the solver without sacrificing efficiency. On the contrary, the performance of the solver may improve thanks to the addition of some simple entailed clauses which are not easily discovered otherwise, and since redundant computation is avoided during propagation. Empirical evidence of the potential impact of the proposed solution is given.
Cautious reasoning in ASP via minimal models and unsatisfiable cores
Authors: ALVIANO MARIO , DODARO CARMINE , JÄRVISALO MATTI , MARATEA MARCO , PREVITI ALESSANDRO 
Published: August 2018

AbstractAnswer Set Programming (ASP) is a logic-based knowledge representation framework, supporting—among other reasoning modes—the central task of query answering. In the propositional case, query answering amounts to computing cautious consequences of the input program among the atoms in a given set of candidates, where a cautious consequence is an atom belonging to all stable models. Currently, the most efficient algorithms either iteratively verify the existence of a stable model of the input program extended with the complement of one candidate, where the candidate is heuristically selected, or introduce a clause enforcing the falsity of at least one candidate, so that the solver is free to choose which candidate to falsify at any time during the computation of a stable model. This paper introduces new algorithms for the computation of cautious consequences, with the aim of driving the solver to search for stable models discarding more candidates. Specifically, one of such algorithms enforces minimality on the set of true candidates, where different notions of minimality can be used, and another takes advantage of unsatisfiable cores computation. The algorithms are implemented inwasp, and experiments on benchmarks from the latest ASP competitions show that the new algorithms perform better than the state of the art.
Optimal Scheduling for Exposed Datapath Architectures with Buffered Processing Units by ASP
Authors: DAHLEM MARC , BHAGYANATH ANOOP , SCHNEIDER KLAUS 
Published: August 2018

AbstractConventional processor architectures are restricted in exploiting instruction level parallelism (ILP) due to the relatively low number of programmer-visible registers. Therefore, more recent processor architectures expose their datapaths so that the compiler (1) can schedule parallel instructions to different processing units and (2) can make effective use of local storage of the processing units. Among these architectures, the Synchronous Control Asynchronous Dataflow (SCAD) architecture is a new exposed datapath architecture whose processing units are equipped with first-in first-out (FIFO) buffers at their input and output ports.In contrast to register-based machines, the optimal code generation for SCAD is still a matter of research. In particular, SAT and SMT solvers were used to generate optimal resource constrained and optimal time constrained schedules for SCAD, respectively. As Answer Set Programming (ASP) offers better flexibility in handling such scheduling problems, we focus in this paper on using an answer set solver for both resource and time constrained optimal SCAD code generation. As a major benefit of using ASP, we are able to generatealloptimal schedules for a given program which allows one to study their properties. Furthermore, the experimental results of this paper demonstrate that the answer set solver can compete with SAT solvers and outperforms SMT solvers.This paper is under consideration for acceptance in TPLP.
Certified Graph View Maintenance with Regular Datalog
Authors: BONIFATI ANGELA , DUMBRAVA STEFANIA , ARIAS EMILIO JESÚS GALLEGO 
Published: August 2018

AbstractWe employ the Coq proof assistant to develop a mechanically-certified framework for evaluating graph queries and incrementally maintaining materialized graph instances, also called views. The language we use for defining queries and views is Regular Datalog (RD) – a notable fragment of non-recursive Datalog that can express complex navigational queries, with transitive closure as native operator. We first design and encode the theory of RD and then mechanize a RD-specific evaluation algorithm capable of fine-grained, incremental graph view computation, which we prove sound with respect to the declarative RD semantics. By using the Coq extraction mechanism, we test an OCaml version of the verified engine on a set of preliminary benchmarks. Our development is particularly focused on leveraging existing verification and notational techniques to: a) define mechanized properties that can be easily understood by logicians and database researchers and b) attain formal verification with limited effort. Our work is the first step towards a unified, machine-verified, formal framework for dynamic graph query languages and their evaluation engines.
Constraint Answer Set Programming without Grounding
Authors: ARIAS JOAQUIN , CARRO MANUEL , SALAZAR ELMER , MARPLE KYLE , GUPTA GOPAL 
Published: August 2018

AbstractExtending ASP with constraints (CASP) enhances its expressiveness and performance. This extension is not straightforward as the grounding phase, present in most ASP systems, removes variables and the links among them, and also causes a combinatorial explosion in the size of the program. Several methods to overcome this issue have been devised: restricting the constraint domains (e.g., discrete instead of dense), or the type (or number) of models that can be returned. In this paper we propose to incorporate constraints into s(ASP), a goal-directed, top-down execution model which implements ASP while retaining logical variables both during execution and in the answer sets. The resulting model, s(CASP), can constrain variables that, as in CLP, are kept during the execution and in the answer sets. s(CASP) inherits and generalizes the execution model of s(ASP) and is parametric w.r.t. the constraint solver. We describe this novel execution model and show through several examples the enhanced expressiveness of s(CASP) w.r.t. ASP, CLP, and other CASP systems. We also report improved performance w.r.t. other very mature, highly optimized ASP systems in some benchmarks.
Temporal Answer Set Programming on Finite Traces
Authors: CABALAR PEDRO , KAMINSKI ROLAND , SCHAUB TORSTEN , SCHUHMANN ANNA 
Published: August 2018

AbstractIn this paper, we introduce an alternative approach to Temporal Answer Set Programming that relies on a variation of Temporal Equilibrium Logic (TEL) for finite traces. This approach allows us to even out the expressiveness of TEL over infinite traces with the computational capacity of (incremental) Answer Set Programming (ASP). Also, we argue that finite traces are more natural when reasoning about action and change. As a result, our approach is readily implementable via multi-shot ASP systems and benefits from an extension of ASP's full-fledged input language with temporal operators. This includes future as well as past operators whose combination offers a rich temporal modeling language. For computation, we identify the class of temporal logic programs and prove that it constitutes a normal form for our approach. Finally, we outline two implementations, a generic one and an extension of the ASP systemclingo.Under consideration for publication in Theory and Practice of Logic Programming (TPLP)
A Probabilistic Extension of Action Language
Authors: LEE JOOHYUNG , WANG YI 
Published: August 2018

AbstractWe present a probabilistic extension of action language${\cal BC}$+$. Just like${\cal BC}$+$is defined as a high-level notation of answer set programs for describing transition systems, the proposed language, which we callp${\cal BC}$+$, is defined as a high-level notation of LPMLNprograms—a probabilistic extension of answer set programs. We show how probabilistic reasoning about transition systems, such as prediction, postdiction, and planning problems, as well as probabilistic diagnosis for dynamic domains, can be modeled inp${\cal BC}$+$and computed using an implementation of LPMLN.
Realistic Worst Case for a Severe Space Weather Event Driven by a Fast Solar Wind Stream
Authors: Horne Richard B. , Phillips Mark W. , Glauert Sarah A. , Meredith Nigel P. , Hands Alex D. P. , Ryden Keith A. , Li Wen 
Published: August 2018

AbstractSatellite charging is one of the most important risks for satellites on orbit. Satellite charging can lead to an electrostatic discharge resulting in component damage, phantom commands, and loss of service and in exceptional cases total satellite loss. Here we construct a realistic worst case for a fast solar wind stream event lasting 5 days or more and use a physical model to calculate the maximum electron flux greater than 2 MeV for geostationary orbit. We find that the flux tends toward a value of 106 cm−2·s−1·sr−1 after 5 days and remains high for another 5 days. The resulting flux is comparable to a 1 in 150‐year event found from an independent statistical analysis of electron data. Approximately 2.5 mm of Al shielding would be required to reduce the internal charging current to below the National Aeronautics and Space Administration‐recommended guidelines, much more than is currently used. Thus, we would expect many satellites to report electrostatic discharge anomalies during such an event with a strong likelihood of service outage and total satellite loss. We conclude that satellites at geostationary orbit are more likely to be at risk from fast solar wind stream event than a Carrington‐type storm.
LSPIV Measurements of Two‐Dimensional Flow Structure in Streams Using Small Unmanned Aerial Systems: 2. Hydrodynamic Mapping at River Confluences
Authors: Lewis Quinn W. , Rhoads Bruce L. 
Published: August 2018

AbstractAlthough past field work at stream confluences has relied on velocity information at specific cross sections to examine flow structure, detailed characterizations of spatial and temporal variations in the hydrodynamics of confluences are lacking. This study uses large‐scale particle image velocimetry (LSPIV) obtained from small unmanned aerial systems (sUAS), a method evaluated in a companion paper, to map surficial patterns of mean flow and turbulent structures at two small stream confluences in unprecedented levels of detail. LSPIV reveals two‐dimensional flow patterns within different hydrodynamic zones in each confluence as well as similarities and differences in hydrodynamic conditions between the confluences. As expected based on extant conceptual models of confluence hydrodynamics, the spatial arrangement of characteristic hydrodynamic zones varies with confluence planform geometry and with changes in incoming flow conditions. However, local morphological features, such as bars and irregularities in channel banks, also exert a strong influence on the spatial structure of flow and in some cases influence confluence hydrodynamics to an extent comparable to changes in incoming flow conditions. The usefulness of sUAS‐based LSPIV is demonstrated by the correspondence between patterns of flow curvature revealed by this method and patterns of helical motion documented at cross sections within the confluences using acoustic Doppler velocimetry. The method can also be used to characterize the structure of turbulent vortices within the mixing interface between confluent streams under appropriate conditions. Hydrodynamic mapping using sUAS‐based LSPIV enriches the interpretation of traditional in‐stream velocity data acquired in the field and provides information on surface velocity patterns in rivers at a resolution similar to that of numerical models.
Simulations tackle abrupt massive migrations of energetic beam ions in a tokamak plasma
Authors: Bierwage Andreas , Shinohara Kouji , Todo Yasushi , Aiba Nobuyuki , Ishikawa Masao , Matsunaga Go , Takechi Manabu , Yagi Masatoshi 
Published: August 2018

AbstractIn the late 1990s, fusion scientists at the Japanese tokamak JT-60U discovered abrupt large-amplitude events during beam-driven deuterium plasma experiments. A large spike in the magnetic fluctuation signal followed by a drop in the neutron emission rate indicates that energetic ions abruptly migrate out of the plasma core during an intense burst of Alfvén waves that lasts only 0.3 ms. With continued beam injection, the energetic ion population recovers until the next event occurs 40–60 ms later. Here we present results from simulations that successfully reproduce multiple migration cycles and report numerical and experimental evidence for the multi-mode nature of these intermittent phenomena. Moreover, we elucidate the role of collisional slow-down and show that the large-amplitude Alfvénic fluctuations can drive magnetic reconnection and induce macroscopic magnetic islands. In this way, our simulations allow us to gradually unravel the underlying physical processes and develop predictive capabilities.