An evaluation of reproductive performance, behavior, immunity and ergonomics was conducted for two common sow housing systems: the girth tether and crate. Littermate Yorkshire × Landrace gilts were randomly assigned to either the crate or girth tether system and they remained in that treatment for two consecutive pregnancies and lactations. A total of 171 matings resulted in 141 litters (82.4% ...

INTRODUCTION Current girth augmentation techniques rely either on liposuction/injection or on the use of dermal fat grafts. These procedures have serious disadvantages, including regression in gained size, deformities, irregular contour, and asymmetry. Ideally, the augmentation technique should ensure durability and symmetry. This case report describes the first application of a flap (superfici...

We describe two computational methods for the construction of cubic graphs with given girth. These were used to produce two independent proofs that the (3, 9)-cages, defined as the smallest cubic graphs of girth 9, have 58 vertices. There are exactly 18 such graphs. We also show that cubic graphs of girth 11 must have at least 106 vertices and cubic graphs of girth 13 must have at least 196 ver...

We describe two new algorithms for the generation of all non-isomorphic cubic graphs with girth at least k ≥ 5 which are very efficient for 5 ≤ k ≤ 7 and show how these algorithms can be efficiently restricted to generate snarks with girth at least k. Our implementation of these algorithms is more than 30, respectively 40 times faster than the previously fastest generator for cubic graphs with ...

The aim of this study is to estimate body weight from withers height, body length, and chest girth measurements by using Regression Tree (RT) Method. For this purpose, data were collected from 239 male sheep at yearling age (11-13 months) of five indigenous sheep breeds (Mengali (48), Balochi (48), Harnai (48), Beverigh (47) and Rakhshani (48)) reared in Balochistan, Pakistan. Bivariate relatio...

W. He et al. showed that a planar graph of girth 11 can be decomposed into a forest and a matching. D. Kleitman et al. proved the same statement for planar graphs of girth 10. We further improve the bound on girth to 9. c © 2007 Elsevier Ltd. All rights reserved.

This paper describes the calculation of the optimal partition parameters such that the girth maximum (m, r) Balanced Tanner Unit lies in family of BTUs specified by them using a series of proved results and thus creates a framework for specifying a search problem for finding the girth maximum (m, r) BTU. Several open questions for girth maximum (m, r) BTU have been raised.

Recently, we [1] proposed a simple-to-implement heuristic, namely, BIT-FILLING, for constructing high rate and high girth LDPC codes. In the present work, we extend BIT-FILLING, and demonstrate that the extended algorithm produces better codes, that is, codes with higher rate/girth and good bit error rate performance. We demonstrate the positive effect of girth on bit error rate performance.