Hemiorchidectomy leads to dramatic and immediate alterations in pituitary follicle-stimulating hormone secretion and the functional activity of the remaining testis in the adult male bonnet monkey (Macaca radiata)

The aim of the present study was to examine the effect of hemiorchidectomy (HO) on serum FSH, LH, testosterone (T), and inhibin (INH) concentrations as well as on the testicular volume (TV) and on changes in the kinetics of germ cell turnovers in the remaining testis of adult male bonnet monkeys. Blood samples collected at 2200 h at various times before and after HO and testicular biopsies obtained at different periods were subjected to hormone analysis and DNA flow cytometry. Though serum T levels were lowered (p < 0.05) at 12 h after HO, T levels rapidly returned to intact control concentrations by Day 5. While serum LH remained unaltered, serum FSH increased markedly within 2 days of HO and remained significantly (p < 0.05) elevated over the next 90 days. Though serum INH showed a significant decrease (p < 0.05) by 15 min of HO, it returned to approximately 80% of intact levels within one week. The TV of the remaining testis showed maximal increment by Day 30 (p < 0.05) of HO. DNA flow cytometric analysis 24 days after HO showed increases (p < 0.05) in spermatogonia (2C) and primary spermatocytes (4C). These cell types by Day 45 had transformed to round (1C) and elongate (HC) (by 38%, p < 0.001) spermatids. Overall spermatogenesis (conversion of 2C to 1C and HC) showed significant enhancement at Days 110 and 175, suggesting that the spurt in spermatogenic activity is not confined to a single spermatogenic cycle.

Boxicity and Poset Dimension

Let G be a simple, undirected, finite graph with vertex set V(G) and edge set E(C). A k-dimensional box is a Cartesian product of closed intervals a(1), b(1)] x a(2), b(2)] x ... x a(k), b(k)]. The boxicity of G, box(G) is the minimum integer k such that G can be represented as the intersection graph of k-dimensional boxes, i.e. each vertex is mapped to a k-dimensional box and two vertices are adjacent in G if and only if their corresponding boxes intersect. Let P = (S, P) be a poset where S is the ground set and P is a reflexive, anti-symmetric and transitive binary relation on S. The dimension of P, dim(P) is the minimum integer l such that P can be expressed as the intersection of t total orders. Let G(P) be the underlying comparability graph of P. It is a well-known fact that posets with the same underlying comparability graph have the same dimension. The first result of this paper links the dimension of a poset to the boxicity of its underlying comparability graph. In particular, we show that for any poset P, box(G(P))/(chi(G(P)) - 1) <= dim(P) <= 2box(G(P)), where chi(G(P)) is the chromatic number of G(P) and chi(G(P)) not equal 1. The second result of the paper relates the boxicity of a graph G with a natural partial order associated with its extended double cover, denoted as G(c). Let P-c be the natural height-2 poset associated with G(c) by making A the set of minimal elements and B the set of maximal elements. We show that box(G)/2 <= dim(P-c) <= 2box(G) + 4. These results have some immediate and significant consequences. The upper bound dim(P) <= 2box(G(P)) allows us to derive hitherto unknown upper bounds for poset dimension. In the other direction, using the already known bounds for partial order dimension we get the following: (I) The boxicity of any graph with maximum degree Delta is O(Delta log(2) Delta) which is an improvement over the best known upper bound of Delta(2) + 2. (2) There exist graphs with boxicity Omega(Delta log Delta). This disproves a conjecture that the boxicity of a graph is O(Delta). (3) There exists no polynomial-time algorithm to approximate the boxicity of a bipartite graph on n vertices with a factor of O(n(0.5-epsilon)) for any epsilon > 0, unless NP=ZPP.

Characterization of a 10- to 14-kilodalton protease-sensitive mycobacterium tuberculosis H37Ra antigen that stimulates human -yi T cells

gamma delta T-cell receptor-bearing T cells (gamma delta T cells) are readily activated by intracellular bacterial pathogens such as Mycobacterium tuberculosis. The bacterial antigens responsible for gamma delta T-cell activation remain poorly characterized. We have found that heat treatment of live M. tuberculosis bacilli released into the supernatant an antigen which stimulated human gamma delta T cells, gamma delta T-cell activation was measured by determining the increase in percentage of gamma delta T cells by flow cytometry in peripheral blood mononuclear cells stimulated with antigen and by proliferation of gamma delta T-cell lines with monocytes as antigen-presenting cells. Supernatant from heat-treated M. tuberculosis was fractionated by fast-performance liquid chromatography (FPLC) on a Superose 12 column. Maximal gamma delta T-cell activation was measured for a fraction of 10 to 14 kDa. Separation of the supernatant by preparative isoelectric focusing demonstrated peak activity at a pi of <4.0. On two-dimensional gel electrophoresis, the 10- to 14-kDa FPLC fraction contained at least seven distinct molecules, of which two had a pi of <4.5. Protease treatment reduced the bioactivity of the 10- to 14-kDa FPLC fraction for both resting and activated gamma delta T cells. Murine antibodies raised to the 10- to 14-kDa fraction reacted by enzyme-linked immunosorbent assay with antigens of 10 to 14 kDa in lysate of M. tuberculosis. In addition, gamma delta T cells proliferated in response to an antigen of 10 to 14 kDa present in M. tuberculosis lysate. gamma delta T-cell-stimulating antigen was not found in culture filtrate of M. tuberculosis but was associated,vith the bacterial pellet and lysate of M. tuberculosis. These results provide a preliminary characterization of a 10- to 14-kDa, cell-associated, heat-stable, low-pI protein antigen of M. tuberculosis which is a major stimulus for human gamma delta T cells.

DNA polymerase alpha-primase complex from the silk glands of the non-mulberry silkworm Philosamia ricini.

The DNA content in the silk glands of the non-mulberry silkworm Philosamia ricini increases continuously during the fourth and fifth instars of larval development indicating high levels of DNA replication in this terminally differentiated tissue. Concomitantly, the DNA polymerase alpha activity also increases in the middle and the posterior silk glands during development, reaching maximal levels in the middle of the fifth larval instar. A comparable level of DNA polymerase delta/epsilon was also observed in this highly replicative tissue. The DNA polymerase alpha-primase complex from the silk glands of P. ricini has been purified to homogeneity by conventional column chromatography as well as by immunoaffinity techniques. The molecular mass of the native enzyme is 560 kDa and the enzyme comprises six non-identical subunits. The identity of the enzyme as DNA polymerase alpha has been established by its sensitivity to inhibitors such as aphidicolin, N-ethylmaleimide, butylphenyl-dGTP, butylanilino-dATP and antibodies to polymerase alpha. The enzyme possesses primase activity capable of initiating DNA synthesis on single-stranded DNA templates. The tight association of polymerase and primase activities at a constant ratio of 6:1 is observed through all the purification steps. The 180 kDa subunit harbours the polymerase activity, while the primase activity is associated with the 45 kDa subunit.

Some results and approaches for reconstruction conjectures

Tutte (1979) proved that the disconnected spanning subgraphs of a graph can be reconstructed from its vertex deck. This result is used to prove that if we can reconstruct a set of connected graphs from the shuffled edge deck (SED) then the vertex reconstruction conjecture is true. It is proved that a set of connected graphs can be reconstructed from the SED when all the graphs in the set are claw-free or all are P-4-free. Such a problem is also solved for a large subclass of the class of chordal graphs. This subclass contains maximal outerplanar graphs. Finally, two new conjectures, which imply the edge reconstruction conjecture, are presented. Conjecture 1 demands a construction of a stronger k-edge hypomorphism (to be defined later) from the edge hypomorphism. It is well known that the Nash-Williams' theorem applies to a variety of structures. To prove Conjecture 2, we need to incorporate more graph theoretic information in the Nash-Williams' theorem.

Evidence for follicle-stimulating hormone mediation in the hemiorchidectomy-induced compensatory increase in the function of the remaining testis of the adult male bonnet monkey (Macaca radiata)

Hemiorchidectomy (HO) in the adult male bonnet monkey results in a selective increase in circulating concentrations of FSH and testosterone, and this is accompanied by compensatory increase in sperm production by the remaining testis. We investigated the possible role of increased FSH concentration that occurs after HO in the compensatory increase in the activity of the remaining testis. Of eight adult male bonnet monkeys that underwent HO, four received i.v. injections every other day for 30 days of a well-characterized ovine FSH antiserum (a/s) that cross-reacts with monkey FSH. The remaining four males received normal monkey serum (NMS) as control treatment in a protocol similar to that employed for ais-treated males. Blood samples were collected between 2100 and 2200 h before and 1/2, 1, 3, 5, 7, 14, 22, and 29 days after HO. Testicular weight, number of 3 beta-hydroxy steroid dehydrogenase-positive (3 beta-HSD+) cells, and DNA flow cytometric analysis of germ cell populations were obtained for testes collected before and at the termination of NMS or ais treatment. In NMS-treated males, circulating serum FSH concentrations progressively increased to reach a maximal level by Day 7 after HO (1.95 +/- 0.3 vs. 5.6 +/- 0.7 ng/ml on Days -1 and 7, respectively). Within 30 min of ais injection, FSH antibodies were detected in circulation, and the antibody level was maintained at a constant level between Day 7 and end of treatment (exhibiting 50-60% binding to I-125-hFSH). Although circulating mean nocturnal serum testosterone concentration showed an initial decrease, it rose gradually to pre-HO concentrations by Day 7 in NMS-treated males. In contrast, nocturnal mat serum testosterone concentrations in a/s-treated males remained lower than in NMS-treated controls (p < 0.05) up to Day 22 and thereafter only marginally increased. Testicular weights increased (p < 0.05) over the pre-HO weight in NMS- but not in ais-treated males. After HO, the number of 3 beta-HSD+ cells (Leydig cells) was markedly increased but was significantly (p < 0.05) higher in NMS-treated males compared to a/s-treated males. A significant (p < 0.05) reduction in the primary spermatocyte population of germ cells was observed in ais-treated compared to NMS-treated males. These results suggest that the increased FSH occurring after HO could be intimately involved in increasing the compensatory functional activity of the remaining testis in the male bonnet monkey.

Throughput Maximization of Delay-Constrained Traffic in Wireless Energy Harvesting Sensors

A wireless Energy Harvesting Sensor (EHS) needs to send data packets arriving in its queue over a fading channel at maximum possible throughput while ensuring acceptable packet delays. At the same time, it needs to ensure that energy neutrality is satisfied, i.e., the average energy drawn from a battery should equal the amount of energy deposited in it minus the energy lost due to the inefficiency of the battery. In this work, a framework is developed under which a system designer can optimize the performance of the EHS node using power control based on the current channel state information, when the EHS node employs a single modulation and coding scheme and the channel is Rayleigh fading. Optimal system parameters for throughput optimal, delay optimal and delay-constrained throughput optimal policies that ensure energy neutrality are derived. It is seen that a throughput optimal (maximal) policy is packet delay-unbounded and an average delay optimal (minimal) policy achieves negligibly small throughput. Finally, the influence of the harvested energy profile on the performance of the EHS is illustrated through the example of solar energy harvesting.

DMT of multi-hop cooperative networks

Some basic results that help in determining the Diversity-Multiplexing Tradeoff (DMT) of cooperative multihop networks are first identified. As examples, the maximum achievable diversity gain is shown to equal the min-cut between source and sink, whereas the maximal multiplexing gain is shown to equal the minimum rank of the matrix characterizing the MIMO channel appearing across a cut in the network. Two multi-hop generalizations of the two-hop network are then considered, namely layered networks as well as a class of networks introduced here and termed as K-parallel-path (KPP) networks. The DMT of KPP networks is characterized for K > 3. It is shown that a linear DMT between the maximum diversity dmax and the maximum multiplexing gain of 1 is achievable for fully-connected, layered networks. Explicit coding schemes achieving the DMT that make use of cyclic-division-algebra-based distributed space-time codes underlie the above results. Two key implications of the results in the paper are that the half-duplex constraint does not entail any rate loss for a large class of cooperative networks and that simple, amplify-and-forward protocols are often sufficient to attain the optimal DMT.

Isolation and characterization of proteolytic enzymes from the latex of Synadenium grantii Hook, 'f'

Two fractions showing proteolytic enzymes have been obtained from the latex of Synadenium grantii Hook, 'f', using gel-filtration and anion-exchange chromatographic techniques. Both these proteases have the same molecular mass of 76+/-2 kDa each. They exhibit maximal activity at pH 7.0 and at a temperature of 60 degreesC. They display stability over a pH range from 5-10 and are also highly thermostable. Irreversible inhibition by PMSF indicates that they are serine proteases. In addition, histidine residues also appear to play an important role in catalysis as evidenced by inhibition with DEPC. They also exhibit similarity with respect to pH and temperature optima, kinetic properties and thermal stability. (C) 2002 Elsevier Science Ireland Ltd. All rights reserved.

Conjugacy invariant pseudo-norms, representability and RNA secondary structures

To a reasonable approximation, a secondary structures of RNA is determined by Watson-Crick pairing without pseudo-knots in such a way as to minimise the number of unpaired bases: We show that this minimal number is determined by the maximal conjugacy-invariant pseudo-norm on the free group on two generators subject to bounds on the generators. This allows us to construct lower bounds on the minimal number of unpaired bases by constructing conjugacy invariant pseudo-norms. We show that one such construction, based on isometric actions on metric spaces, gives a sharp lower bound. A major goal here is to formulate a purely mathematical question, based on considering orthogonal representations, which we believe is of some interest independent of its biological roots.

Polynomial Approximation, Local Polynomial convexity, and Degenerate CR Singularities- II

We provide some conditions for the graph of a Holder-continuous function on (D) over bar, where (D) over bar is a closed disk in C, to be polynomially convex. Almost all sufficient conditions known to date - provided the function (say F) is smooth - arise from versions of the Weierstrass Approximation Theorem on (D) over bar. These conditions often fail to yield any conclusion if rank(R)DF is not maximal on a sufficiently large subset of (D) over bar. We bypass this difficulty by introducing a technique that relies on the interplay of certain plurisubharmonic functions. This technique also allows us to make some observations on the polynomial hull of a graph in C(2) at an isolated complex tangency.

Computational Biology and Language

Current scientific research is characterized by increasing specialization, accumulating knowledge at a high speed due to parallel advances in a multitude of sub-disciplines. Recent estimates suggest that human knowledge doubles every two to three years – and with the advances in information and communication technologies, this wide body of scientific knowledge is available to anyone, anywhere, anytime. This may also be referred to as ambient intelligence – an environment characterized by plentiful and available knowledge. The bottleneck in utilizing this knowledge for specific applications is not accessing but assimilating the information and transforming it to suit the needs for a specific application. The increasingly specialized areas of scientific research often have the common goal of converting data into insight allowing the identification of solutions to scientific problems. Due to this common goal, there are strong parallels between different areas of applications that can be exploited and used to cross-fertilize different disciplines. For example, the same fundamental statistical methods are used extensively in speech and language processing, in materials science applications, in visual processing and in biomedicine. Each sub-discipline has found its own specialized methodologies making these statistical methods successful to the given application. The unification of specialized areas is possible because many different problems can share strong analogies, making the theories developed for one problem applicable to other areas of research. It is the goal of this paper to demonstrate the utility of merging two disparate areas of applications to advance scientific research. The merging process requires cross-disciplinary collaboration to allow maximal exploitation of advances in one sub-discipline for that of another. We will demonstrate this general concept with the specific example of merging language technologies and computational biology.

Deviation from 3-D Ising critical behaviour in aqueous electrolyte solutions

The near-critical behaviour in complex fluids, comprising electrolyte solutions, polymer solutions and amphiphilic systems, reveals a marked departure from the 3-D Ising behaviour. This departure manifests itself either in terms of a crossover from Ising to mean-field (or classical) critical behaviour, when moving away from a given critical point (Tc), or by the persistence of only mean-field region in the surprisingly close vicinity of Tc. The ilo,non-Ising features of the osmotic compressibility (chi(T,p)) in solutions of electrolytes, that exhibit orle or many liquid-liquid transitions, will be presented. The underlying cause of the breakdown of the anticipated 3-D Ising behaviour in aqueous electrolyte solutions is traced to the structuring induced by the electrolytes. New evidence constituting, measurements of small-angle X-ray scattering (SAXS) and the excess molar volume, is advanced to support the thesis of the close relationship, between the structuring and the deviation from the 3-D Ising critical behaviour in aqueous electrolyte solutions.

Boxicity and Poset Dimension

Let G be a simple, undirected, finite graph with vertex set V (G) and edge set E(G). A k-dimensional box is a Cartesian product of closed intervals [a(1), b(1)] x [a(2), b(2)] x ... x [a(k), b(k)]. The boxicity of G, box(G), is the minimum integer k such that G can be represented as the intersection graph of k-dimensional boxes; i.e., each vertex is mapped to a k-dimensional box and two vertices are adjacent in G if and only if their corresponding boxes intersect. Let P = (S, P) be a poset, where S is the ground set and P is a reflexive, antisymmetric and transitive binary relation on S. The dimension of P, dim(P), is the minimum integer t such that P can be expressed as the intersection of t total orders. Let G(P) be the underlying comparability graph of P; i.e., S is the vertex set and two vertices are adjacent if and only if they are comparable in P. It is a well-known fact that posets with the same underlying comparability graph have the same dimension. The first result of this paper links the dimension of a poset to the boxicity of its underlying comparability graph. In particular, we show that for any poset P, box(G(P))/(chi(G(P)) - 1) <= dim(P) <= 2box(G(P)), where chi(G(P)) is the chromatic number of G(P) and chi(G(P)) not equal 1. It immediately follows that if P is a height-2 poset, then box(G(P)) <= dim(P) <= 2box(G(P)) since the underlying comparability graph of a height-2 poset is a bipartite graph. The second result of the paper relates the boxicity of a graph G with a natural partial order associated with the extended double cover of G, denoted as G(c): Note that G(c) is a bipartite graph with partite sets A and B which are copies of V (G) such that, corresponding to every u is an element of V (G), there are two vertices u(A) is an element of A and u(B) is an element of B and {u(A), v(B)} is an edge in G(c) if and only if either u = v or u is adjacent to v in G. Let P(c) be the natural height-2 poset associated with G(c) by making A the set of minimal elements and B the set of maximal elements. We show that box(G)/2 <= dim(P(c)) <= 2box(G) + 4. These results have some immediate and significant consequences. The upper bound dim(P) <= 2box(G(P)) allows us to derive hitherto unknown upper bounds for poset dimension such as dim(P) = 2 tree width (G(P)) + 4, since boxicity of any graph is known to be at most its tree width + 2. In the other direction, using the already known bounds for partial order dimension we get the following: (1) The boxicity of any graph with maximum degree Delta is O(Delta log(2) Delta), which is an improvement over the best-known upper bound of Delta(2) + 2. (2) There exist graphs with boxicity Omega(Delta log Delta). This disproves a conjecture that the boxicity of a graph is O(Delta). (3) There exists no polynomial-time algorithm to approximate the boxicity of a bipartite graph on n vertices with a factor of O(n(0.5-is an element of)) for any is an element of > 0 unless NP = ZPP.

Low-Delay, High-Rate Nonsquare Complex Orthogonal Designs

The maximal rate of a nonsquare complex orthogonal design for transmit antennas is 1/2 + 1/n if is even and 1/2 + 1/n+1 if is odd and the codes have been constructed for all by Liang (2003) and Lu et al. (2005) to achieve this rate. A lower bound on the decoding delay of maximal-rate complex orthogonal designs has been obtained by Adams et al. (2007) and it is observed that Liang's construction achieves the bound on delay for equal to 1 and 3 modulo 4 while Lu et al.'s construction achieves the bound for n = 0, 1, 3 mod 4. For n = 2 mod 4, Adams et al. (2010) have shown that the minimal decoding delay is twice the lower bound, in which case, both Liang's and Lu et al.'s construction achieve the minimum decoding delay. For large value of, it is observed that the rate is close to half and the decoding delay is very large. A class of rate-1/2 codes with low decoding delay for all has been constructed by Tarokh et al. (1999). In this paper, another class of rate-1/2 codes is constructed for all in which case the decoding delay is half the decoding delay of the rate-1/2 codes given by Tarokh et al. This is achieved by giving first a general construction of square real orthogonal designs which includes as special cases the well-known constructions of Adams, Lax, and Phillips and the construction of Geramita and Pullman, and then making use of it to obtain the desired rate-1/2 codes. For the case of nine transmit antennas, the proposed rate-1/2 code is shown to be of minimal delay. The proposed construction results in designs with zero entries which may have high peak-to-average power ratio and it is shown that by appropriate postmultiplication, a design with no zero entry can be obtained with no change in the code parameters.