Jonathan Hernandez

Simple Summary: The present study evaluates the effects of two dietary supplements (guanidinoacetic acid [GAA] and zilpaterol hydrochloride [ZLH]) on the productive performance of fattening lambs over a 60-day period. The inclusion of these additives did not result in significant differences in the parameters studied. However, serum glucose and creatinine levels in the GAA group were higher than those in the control group. These findings suggest that further research is needed to determine the optimal dosage and duration of GAA supplementation to enhance lamb growth and meat production. Abstract: This study evaluated the effects of dietary supplementation with guanidinoacetic acid (GAA) and zilpaterol hydrochloride (ZLH) on productive performance, carcass traits, and blood chemistry in non-castrated male lambs over 60 days. Twenty-four Pelibuey × Dorper crossbred lambs (16.3 ± 2.7 kg) were adapted to housing and diet for 14 days before being randomly assigned to one of three treatments: (1) Control: total mixed ration (TMR) without additives; (2) GAA: TMR with 0.2% GAA; and (3) ZLH: TMR with 6 mg/kg dry matter (DM) of ZLH for the last 30 days. No significant differences were observed in productive performance or carcass traits among treatments. However, lambs fed GAA showed higher serum glucose and creatinine levels than the control group (p < 0.05), suggesting a potential effect on energy metabolism. ZLH supplementation had no measurable impact on the parameters evaluated. These findings indicate that while GAA may influence certain metabolic indicators, further research with extended feeding periods or varying dosages is needed to clarify its effects on growth and carcass characteristics in lambs.

Counting models for a two conjunctive formula $F$, a problem known as $\sharp $2Sat, is a classic $\sharp $P complete problem. Given a 2-CF $F$ as input, its constraint graph $G$ is built. If $G$ is acyclic, then $\sharp $2Sat can be computed efficiently. In this paper, we address the case when $G$ has cycles. When $G$ is cyclic, we propose a decomposition on the constraint graph $G$ that allows the computation of $\sharp $2Sat in incremental way. Let $T$ be a cactus graph of $G$ containing a maximal number of independent cycles, and let $\overline{T}=-E)$ be a subset of frond edges from $G$. The clauses in $\overline{T}$ are ordered in connected components $\{K_1, \ldots, K_r\}$. Each $, i=1,\ldots,r$ is a knot of the graph. The arrangement of the clauses of $\overline{T}$ allows the decomposition of $G$ in knots and provides a way of computing $\sharp $2Sat in an incremental way. Our procedure has a bottom-up orientation for the computation of $\sharp $2Sat. It begins with $F_0 = T$. In each iteration of the procedure, a new clause $C_i \in \overline{T}$ is considered in order to form $F_i = $ and then to compute $\sharp $2Sat$$ based on the computation of $\sharp $2Sat$$.