Influence of the bipartite scrotum on the testicular and scrotal temperatures in goats

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Influence of the bipartite scrotum on the testicular and scrotal temperatures in goats

O objetivo deste trabalho foi avaliar a influência do grau de bipartição escrotal e do período do ano sobre a termorregulação escroto-testicular em caprinos criados no Estado do Piauí. Foram utilizados 18 reprodutores caprinos machos, divididos em três grupos de seis animais: O Grupo I contendo caprinos com escroto simples, o Grupo II, caprinos com escroto bipartido até 50% do comprimento testicular e o Grupo III, caprinos com bipartição superior a 50% do comprimento testicular. Os parâmetros avaliados foram as temperaturas do escroto, testículo e funículo espermático, obtidas de forma invasiva, com um termômetro digital termoacoplável, e não invasiva, com um pirômetro, nos terços proximal, médio e distal. Os dados foram coletados nos períodos seco (outubro-novembro) e chuvoso (fevereiro-março) do ano, bem como, nos turnos da manhã (6h00 às 7h00) e tarde (14h00 às 15h00). Os resultados foram submetidos à análise de variância (ANOVA) seguida do teste SNK para comparação das médias (p<0,05). O período do ano interferiu na termorregulação escroto-testicular, pois no período seco as temperaturas do escroto, testículo e funículo espermático foram mais elevadas que as observadas no período chuvoso. O grau de bipartição do escroto foi outro fator que modificou a temperatura escroto-testicular, já que os caprinos que apresentaram escroto com maior grau de bipartição demonstraram as menores médias das temperaturas escroto-testiculares em ambos os períodos e turnos avaliados. Conclui-se, portanto, que tanto o período do ano quanto o grau de bipartição do escroto influenciaram o processo de termorregulação escroto-testicular em caprinos.

Spermatogenesis in goats with and without scrotum bipartition

The objective of the present research was to quantify the seminiferous epithelium cells, spermatogenesis efficiency and characterize the ultrastrucure of Sertoli cells in goats. Eighteen goats were used and divided into three groups: Group I - goats without bipartition of the scrotum; Group II - animals with bipartition of the scrotum in up to 50% of the testicular length; Group III - goats with bipartition of the scrotum in more than 50% of the testicular length. The goat testes in Group III had a greater number of primary spermatocytes (25.37 +/- 4.55 cells per cross sections), spermatids (112 +/- 15.12 cells per cross sections), and Sertoli cells (9.46 +/- 1.74 cells per cross sections) than the animals in Groups land (P <0.05). The spermatogenic mitotic, meiotic, and general efficiency were greater in animals in Group III (1.25 +/- 0.28; 5.12 +/- 1.63; 6.44 +/- 1.96) when compared to those in Groups I and II. Sheet-like processes originated from the Sertoli cell body as simple and smooth structures which involved almost all the surface of germ cells. Slender cord-like processes originated from Sertoli cells and also from the sheet-like processes. The relative frequency of the cycle stages showed differences among the groups of goats studied, and the highest frequency was in Stage 3 (20.68% for goats in Group I, 21.15% for those in Group II, and 16.89% for the animals in Group III). In conclusion, goats with bipartition of the scrotum have a greater number of germ and Sertoli cells per cross section of seminiferous tubule, that indicated a greater sperm production when compared to the other groups, and the ultrastructure of the Sertoli cell process did not present any relationship with bipartition of the scrotum. (C) 2012 Elsevier B.V. All rights reserved.

Daily sperm production and testicular morphometry in goats according to external scrotal conformation

The present study aimed to compare testicular histology and the testicular cell population as well as spermatogenic efficiency in goats with different scrotal conformations. Eighteen goats were divided into 3 groups: Group I - goats without bipartition of the scrotum, Group II - animals with bipartition of the scrotum up to 50% of the testicular length, Group III - goats with scrotal bipartition more than 50% of the testicular length. In goats in Groups I, II and III, the values for the volume density of seminiferous epithelium were 68.9 +/- 0.6%, 71.5 +/- 2.8% and 73.4 +/- 4.7% (P < 0.05), the height of the seminiferous epithelium were 60.2 +/- 4.9 mu m, 61.0 +/- 5.0 mu m and 73.1 +/- 6.6 mu m (P < 0.05), total length of seminiferous tubules found for Groups I, II and III were 2091.9 +/- 27 m, 2172.5 +/- 24.1 m, and 2340.1 14 m (P < 0.05), number of Sertoli and Leydig cells were 1.8 +/- 0.4 x 10(9) and 1.4 +/- 0.1 x 10(9), 2.2 +/- 0.4 and 2.2 +/- 0.7 x 10(9), and 2.5 +/- 0.1 10(9) and 2.3 +/- 0.510(9)(P < 0.05)and daily sperm production observed were 2.1 0.3 x 109, 2.8 0.4 x 109, and 3.1 0.7 x 109 (P < 0.05). In conclusion, goats with greater scrotal bipartition have a greater capacity to produce reproductive cells that is reflected in a greater reproductive potential. (C) 2011 Elsevier B.V. All rights reserved.

On the cubicity of bipartite graphs

A unit cube in k-dimension (or a k-cube) is defined as the Cartesian product R-1 x R-2 x ... x R-k, where each R-i is a closed interval on the real line of the form [a(j), a(i), + 1]. The cubicity of G, denoted as cub(G), is the minimum k such that G is the intersection graph of a collection of k-cubes. Many NP-complete graph problems can be solved efficiently or have good approximation ratios in graphs of low cubicity. In most of these cases the first step is to get a low dimensional cube representation of the given graph. It is known that for graph G, cub(G) <= left perpendicular2n/3right perpendicular. Recently it has been shown that for a graph G, cub(G) >= 4(Delta + 1) In n, where n and Delta are the number of vertices and maximum degree of G, respectively. In this paper, we show that for a bipartite graph G = (A boolean OR B, E) with |A| = n(1), |B| = n2, n(1) <= n(2), and Delta' = min {Delta(A),Delta(B)}, where Delta(A) = max(a is an element of A)d(a) and Delta(B) = max(b is an element of B) d(b), d(a) and d(b) being the degree of a and b in G, respectively , cub(G) <= 2(Delta' + 2) bar left rightln n(2)bar left arrow. We also give an efficient randomized algorithm to construct the cube representation of G in 3 (Delta' + 2) bar right arrowIn n(2)bar left arrow dimension. The reader may note that in general Delta' can be much smaller than Delta.

A note on acyclic edge coloring of complete bipartite graphs

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic (2-colored) cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). Let Delta = Delta(G) denote the maximum degree of a vertex in a graph G. A complete bipartite graph with n vertices on each side is denoted by K-n,K-n. Alon, McDiarmid and Reed observed that a'(K-p-1,K-p-1) = p for every prime p. In this paper we prove that a'(K-p,K-p) <= p + 2 = Delta + 2 when p is prime. Basavaraju, Chandran and Kummini proved that a'(K-n,K-n) >= n + 2 = Delta + 2 when n is odd, which combined with our result implies that a'(K-p,K-p) = p + 2 = Delta + 2 when p is an odd prime. Moreover we show that if we remove any edge from K-p,K-p, the resulting graph is acyclically Delta + 1 = p + 1-edge-colorable. (C) 2009 Elsevier B.V. All rights reserved.

Chordal Bipartite Graphs with High Boxicity

The boxicity of a graph G is defined as the minimum integer k such that G is an intersection graph of axis-parallel k-dimensional boxes. Chordal bipartite graphs are bipartite graphs that do not contain an induced cycle of length greater than 4. It was conjectured by Otachi, Okamoto and Yamazaki that chordal bipartite graphs have boxicity at most 2. We disprove this conjecture by exhibiting an infinite family of chordal bipartite graphs that have unbounded boxicity.

Bipartite Powers of k-chordal Graphs

Let k be an integer and k >= 3. A graph G is k-chordal if G does not have an induced cycle of length greater than k. From the definition it is clear that 3-chordal graphs are precisely the class of chordal graphs. Duchet proved that, for every positive integer m, if G m is chordal then so is G(m+2). Brandst `` adt et al. in Andreas Brandsadt, Van Bang Le, and Thomas Szymczak. Duchet- type theorems for powers of HHD- free graphs. Discrete Mathematics, 177(1- 3): 9- 16, 1997.] showed that if G m is k - chordal, then so is G(m+2). Powering a bipartite graph does not preserve its bipartitedness. In order to preserve the bipartitedness of a bipartite graph while powering Chandran et al. introduced the notion of bipartite powering. This notion was introduced to aid their study of boxicity of chordal bipartite graphs. The m - th bipartite power G(m]) of a bipartite graph G is the bipartite graph obtained from G by adding edges (u; v) where d G (u; v) is odd and less than or equal to m. Note that G(m]) = G(m+1]) for each odd m. In this paper we show that, given a bipartite graph G, if G is k-chordal then so is G m], where k, m are positive integers with k >= 4

Surrogate Regret Bounds for Bipartite Ranking via Strongly Proper Losses

The problem of bipartite ranking, where instances are labeled positive or negative and the goal is to learn a scoring function that minimizes the probability of mis-ranking a pair of positive and negative instances (or equivalently, that maximizes the area under the ROC curve), has been widely studied in recent years. A dominant theoretical and algorithmic framework for the problem has been to reduce bipartite ranking to pairwise classification; in particular, it is well known that the bipartite ranking regret can be formulated as a pairwise classification regret, which in turn can be upper bounded using usual regret bounds for classification problems. Recently, Kotlowski et al. (2011) showed regret bounds for bipartite ranking in terms of the regret associated with balanced versions of the standard (non-pairwise) logistic and exponential losses. In this paper, we show that such (non-pairwise) surrogate regret bounds for bipartite ranking can be obtained in terms of a broad class of proper (composite) losses that we term as strongly proper. Our proof technique is much simpler than that of Kotlowski et al. (2011), and relies on properties of proper (composite) losses as elucidated recently by Reid and Williamson (2010, 2011) and others. Our result yields explicit surrogate bounds (with no hidden balancing terms) in terms of a variety of strongly proper losses, including for example logistic, exponential, squared and squared hinge losses as special cases. An important consequence is that standard algorithms minimizing a (non-pairwise) strongly proper loss, such as logistic regression and boosting algorithms (assuming a universal function class and appropriate regularization), are in fact consistent for bipartite ranking; moreover, our results allow us to quantify the bipartite ranking regret in terms of the corresponding surrogate regret. We also obtain tighter surrogate bounds under certain low-noise conditions via a recent result of Clemencon and Robbiano (2011).

Optimal values of bipartite entanglement in a tripartite system

For a general tripartite system in some pure state, an observer possessing any two parts will see them in a mixed state. By the consequence of Hughston-Jozsa-Wootters theorem, each basis set of local measurement on the third part will correspond to a particular decomposition of the bipartite mixed state into a weighted sum of pure states. It is possible to associate an average bipartite entanglement ((S) over bar) with each of these decompositions. The maximum value of (S) over bar is called the entanglement of assistance (E-A) while the minimum value is called the entanglement of formation (E-F). An appropriate choice of the basis set of local measurement will correspond to an optimal value of (S) over bar; we find here a generic optimality condition for the choice of the basis set. In the present context, we analyze the tripartite states W and GHZ and show how they are fundamentally different. (C) 2014 Elsevier B.V. All rights reserved.

Geometric phase of a bipartite system with Dzyaloshinski-Moriya interaction

The Berry phase of a bipartite system described by a Heisenberg XXZ model driven by a one-site magnetic field is investigated. The effect of the Dzyaloshinski-Moriya (DM) anisotropic interaction on the Berry phase is discussed. It is found that the DM interaction affects the Berry phase monotonously. and can also cause sudden change of the Berry phase for some weak magnetic field cases. (c) 2008 Elsevier B.V. All rights reserved.

Conditions for the local manipulation of all bipartite Gaussian states

We provide a general, necessary, and sufficient condition for the possibility of transforming a mixed bipartite Gaussian state with arbitrarily many modes to another one under arbitrary local Gaussian channels, which do not include classical communication. Moreover, by means of this condition we present a necessary criterion that can be used to check the possibility of a state transformation between two mixed Gaussian states. At the same time, we prove that our criterion can be reduced to the Eisert-Plenio criterion when the mode number is chosen as 1 per side.

Hall conditions for edge-weighted bipartite graphs

A weighted variant of Hall's condition for the existence of matchings is shown to be equivalent to the existence of a matching in a lexicographic product. This is used to introduce characterizations of those bipartite graphs whose edges may be replicated so as to yield semiregular multigraphs or, equivalently, semiregular edge-weightings. Such bipartite graphs will be called semiregularizable. Some infinite families of semiregularizable trees are described and all semiregularizable trees on at most 11 vertices are listed. Matrix analogues of some of the results are mentioned and are shown to imply some of the known characterizations of regularizable graphs.

Teleporting bipartite entanglement using maximally entangled mixed channels

The ability to teleport entanglement through maximally entangled mixed states as defined by concurrence and linear entropy is studied. We show how the teleported entanglement depends on the quality of the quantum channel used, as defined through its entanglement and mixedness, as well as the form of the target state to be teleported. We present new results based on the fidelity of the teleported state as well as an experimental setup that is immediately implementable with currently available technology.

Intra-testicular varicocele presenting as acute scrotum

The term varicocele describes a dilated, tortuous and elongated pampiniform plexus of veins, which is well known in relation to the spermatic cord. Recently varicocele has also been observed inside the testis, and this new entity is known as intra-testicular varicocele. We present a case of intra-testicular varicocele presenting as acute scrotum and discuss the management issues.