Characterization and Genetic Relationships Analysis of Buffalo Population in Moa Island of South-east West Maluku Regency of Maluku Province

The research aim was to study the variance of some morphometric characteristics and morphologyof Moa buffalo, and the genetic relationships analysis between buffalo subpopulations in Moa Island.Characterization was by using 174 buffalos from any group of ages and sex that were collected fromWest area (Werwaru, Patti), Central area (Syota, Klis) and East area (Tounwawan, Poliwu). Thevariables observed were morphometric characters (body weight, shoulder height, body length, chestwidth, chest depth, chest girth, skull length, skull width, skull height, ear width, ear length, cannon girth,horn length, horn girth and distance between horns), body morphology characters (horn position, headcolor, body color and scheme of body color), and genetic distance between buffalo subpopulations.Body morphometric data were analyzed using mean, standard deviation and variance coefficient. Bodymorphology data were analyzed using relative frequencies. The genetic distance was analyzed usingcanonical discriminant function through Mahalanobis distance approach and by making phylogeny usingUPGMA method. The result indicated that variation of body morphometric was related to productionperformance, variation of color and color scheme of body. Based on genetic distance, central and westsubpopulations were the nearest where West subpopulation was isolated from Central and Eastsubpopulation

Pelvimetry of kuri and bunaji cows in Maiduguri metropolitan slaughterhouse, northern Nigeria

The study was conducted on 58 indigenous cattle consisting of 33 Kuri and 25 Bunaji cows slaughtered at the Maiduguri Metropolitan Slaughter house. The internal and external pelvic dimensions in the two breeds were  obtained immediately post slaughter before the animals were dressed.  The Mean ± SEM for pelvic area were found to be 120.83 cm ± 3.6 and 110.1 cm ± 3.4 for Kuri (K) and Bunaji (WF) respectively. The mean ± SEM for various body measurements were 80.98 cm ± 0.5 and 74.0 cm ± 0.8  for heart girth; 149.9 cm ± 1.1 and 138 cm ± 0.7 for height at withers;  129.3 cm ± 1.04 and 117.96 ± 1.4 for height at pin bone; 141.3 cm ± 0.54 and 131.7 cm ± 1.05 for height at hook bone; 46.2 cm ± 0.42 and 42.3 cm ± 0.51 for rump length; 43.6 cm ± 0.45 and 40.8 cm ± 0.74 for rump width; 10.7 cm ± 0.2 and 9.5 cm ± 0.16 bisilliac distance and 11.85 cm ± 0.02 and 11.12 cm ± 0.18 sacropubis distance for Kuri and Bunaji respectively. There was a significant correlation (P<0.05) between pelvic area and sacropubis, bisilliac, height at pin bone and height at withers in both breeds. The pelvic area was significantly (P<0.05) correlated with height at hook bone in Kuri cows but, there was no correlation with heart girth. The Bunaji showed a significant correlation of the pelvic area with the heart girth while, there was no correlation with the height at hook bone. A significant difference (P<0.05) was observed in the dimensions of the traitsbetween the breeds except in the heart girth and rump width. The study indicated that the parameters measured above may be used as good indicators of cows with large pelvic area in both breeds

A Strong Edge-Coloring of Graphs with Maximum Degree 4 Using 22 Colors

In 1985, Erd\H{o}s and Ne\'{s}etril conjectured that the strong edge-coloring number of a graph is bounded above by ${5/4}\Delta^2$ when $\Delta$ is even and ${1/4}(5\Delta^2-2\Delta+1)$ when $\Delta$ is odd. They gave a simple construction which requires this many colors. The conjecture has been verified for $\Delta\leq 3$. For $\Delta=4$, the conjectured bound is 20. Previously, the best known upper bound was 23 due to Horak. In this paper we give an algorithm that uses at most 22 colors.Comment: 9 pages, 4 figure

A Feasibility Study on the Use of a Structured Light Depth-Camera for Three-Dimensional Body Measurements of Dairy Cows in Free-Stall Barns

Frequent checks on livestock\u2019s body growth can help reducing problems related to cow infertility or other welfare implications, and recognizing health\u2019s anomalies. In the last ten years, optical methods have been proposed to extract information on various parameters while avoiding direct contact with animals\u2019 body, generally causes stress. This research aims to evaluate a new monitoring system, which is suitable to frequently check calves and cow\u2019s growth through a three-dimensional analysis of their bodies\u2019 portions. The innovative system is based on multiple acquisitions from a low cost Structured Light Depth-Camera (Microsoft Kinect\u2122 v1). The metrological performance of the instrument is proved through an uncertainty analysis and a proper calibration procedure. The paper reports application of the depth camera for extraction of different body parameters. Expanded uncertainty ranging between 3 and 15 mm is reported in the case of ten repeated measurements. Coef\ufb01cients of determination R2> 0.84 and deviations lower than 6% from manual measurements where in general detected in the case of head size, hips distance, withers to tail length, chest girth, hips, and withers height. Conversely, lower performances where recognized in the case of animal depth (R2 = 0.74) and back slope (R2 = 0.12)

Tree-Based Construction of LDPC Codes Having Good Pseudocodeword Weights

We present a tree-based construction of LDPC codes that have minimum pseudocodeword weight equal to or almost equal to the minimum distance, and perform well with iterative decoding. The construction involves enumerating a $d$-regular tree for a fixed number of layers and employing a connection algorithm based on permutations or mutually orthogonal Latin squares to close the tree. Methods are presented for degrees $d=p^s$ and $d = p^s+1$, for $p$ a prime. One class corresponds to the well-known finite-geometry and finite generalized quadrangle LDPC codes; the other codes presented are new. We also present some bounds on pseudocodeword weight for $p$-ary LDPC codes. Treating these codes as $p$-ary LDPC codes rather than binary LDPC codes improves their rates, minimum distances, and pseudocodeword weights, thereby giving a new importance to the finite geometry LDPC codes where $p > 2$.Comment: Submitted to Transactions on Information Theory. Submitted: Oct. 1, 2005; Revised: May 1, 2006, Nov. 25, 200

Short directed cycles in bipartite digraphs

The Caccetta-H\"aggkvist conjecture implies that for every integer $k\ge 1$, if $G$ is a bipartite digraph, with $n$ vertices in each part, and every vertex has out-degree more than $n/(k+1)$, then $G$ has a directed cycle of length at most $2k$. If true this is best possible, and we prove this for $k = 1,2,3,4,6$ and all $k\ge 224,539$. More generally, we conjecture that for every integer $k\ge 1$, and every pair of reals $\alpha, \beta> 0$ with $k\alpha +\beta>1$, if $G$ is a bipartite digraph with bipartition $(A,B)$, where every vertex in $A$ has out-degree at least $\beta|B|$, and every vertex in $B$ has out-degree at least $\alpha|A|$, then $G$ has a directed cycle of length at most $2k$. This implies the Caccetta-H\"aggkvist conjecture (set $\beta>0$ and very small), and again is best possible for infinitely many pairs $(\alpha,\beta)$. We prove this for $k = 1,2$, and prove a weaker statement (that $\alpha+\beta>2/(k+1)$ suffices) for $k=3,4$