Evaluation of the bloating potential and grazing performance of AC-Grazeland verses a mixed AC-Grazeland and Sainfoin pasture for beef cattle in southwest Saskatchewan

Non-Peer ReviewedThe potential benefits of grazing alfalfa (Medicago sativa L.) are well documented (e.g., high yields and forage quality, excellent animal gains) and thus, many livestock producers are interested in its use. However, alfalfa’s ability to cause bloating in cattle and potential death has caused many livestock producers to not consider grazing pure alfalfa stands or only alfalfa/grass mixtures in which the alfalfa constitutes less than 20% of the forage stand. The recent availability of AC-Grazeland (AC), a low bloat causing alfalfa cultivar, and the use of non-bloating legumes in mixture with alfalfa are reported grazing strategies to reduce the occurrence of bloating and may be a method to increase the ability to graze alfalfa in the pasture at higher proportions. The objective of this study was to evaluate the bloating potential or bloat reducing potential and animal grazing performance of AC verses a mixed AC and sainfoin (AC+S) pasture. In 1998, one pasture (4.9 ac) was seeded to AC, while another pasture (4.4 ac) was seeded to an AC+S mixture. Seeding rate for the AC and Sainfoin (S) were 5 and 38 lbs per acre, respectively. Grazing of the two pastures were initially started in 2000 by an equal number of yearling steers. Grazing and forage data from 2002 and 2003 were used in this study. Yearling steers commenced grazing on the AC pasture at the early bud stage and the S was grazed at the early flower stage. Each steer on the AC pasture received a rumensin CRC bolus, while steers on the AC+S received no rumensin boluses. Results found that no bloating or bloat symptoms were observed in the cattle grazing from either forage treatment in 2002 and 2003. Average daily gains and total live production did not differ (P > 0.13) between pasture treatments. Further research is needed to evaluate longevity of AC and AC+S pastures under different grazing management for southwest Saskatchewan

On the Construction of Sorted Reactive Systems

We develop a theory of sorted bigraphical reactive systems. Every application of bigraphs in the literature has required an extension, a sorting, of pure bigraphs. In turn, every such application has required a redevelopment of the theory of pure bigraphical reactive systems for the sorting at hand. Here we present a general construction of sortings. The constructed sortings always sustain the behavioural theory of pure bigraphs (in a precise sense), thus obviating the need to redevelop that theory for each new application. As an example, we recover Milner’s local bigraphs as a sorting on pure bigraphs. Technically, we give our construction for ordinary reactive systems, then lift it to bigraphical reactive systems. As such, we give also a construction of sortings for ordinary reactive systems. This construction is an improvement over previous attempts in that it produces smaller and much more natural sortings, as witnessed by our recovery of local bigraphs as a sorting

Bigraphical modelling of architectural patterns

Selected for publication in FACS'2011 post-proceedings, to appear in Springer Lecture Notes in Computer ScienceArchery is a language for behavioural modelling of architectural patterns, supporting hierarchical composition and a type discipline. This paper extends Archery to cope with the patterns' structural dimension through a set of (re-)configuration combinators and constraints that all instances of a pattern must obey. Both types and instances of architectural patterns are semantically represented as bigraphical reactive systems and operations upon them as reaction rules. Such a bigraphical semantics provides a rigorous model for Archery patterns and reduces constraint verification in architectures to a type-checking problem.(undefined

Modal dependent type theory and dependent right adjoints

In recent years we have seen several new models of dependent type theory extended with some form of modal necessity operator, including nominal type theory, guarded and clocked type theory, and spatial and cohesive type theory. In this paper we study modal dependent type theory: dependent type theory with an operator satisfying (a dependent version of) the K-axiom of modal logic. We investigate both semantics and syntax. For the semantics, we introduce categories with families with a dependent right adjoint (CwDRA) and show that the examples above can be presented as such. Indeed, we show that any finite limit category with an adjunction of endofunctors gives rise to a CwDRA via the local universe construction. For the syntax, we introduce a dependently typed extension of Fitch-style modal lambda-calculus, show that it can be interpreted in any CwDRA, and build a term model. We extend the syntax and semantics with universes

BigraphER: rewriting and analysis engine for bigraphs

BigraphER is a suite of open-source tools providing an effi- cient implementation of rewriting, simulation, and visualisation for bigraphs, a universal formalism for modelling interacting systems that evolve in time and space and first introduced by Milner. BigraphER consists of an OCaml library that provides programming interfaces for the manipulation of bigraphs, their constituents and reaction rules, and a command-line tool capable of simulating Bigraphical Reactive Systems (BRSs) and computing their transition systems. Other features are native support for both bigraphs and bigraphs with sharing, stochastic reaction rules, rule priorities, instantiation maps, parameterised controls, predicate checking, graphical output and integration with the probabilistic model checker PRISM