118 resultados para Maximal unipotent subgroups
Resumo:
It is shown that the asymmetric chiral gauging of the WZW models give rise to consistent string backgrounds. The target space structure of the chiral gauged SL(2,R) WZW model, with the gauging of subgroups SO(1, 1) in the left and U(1) in the right moving sector, is obtained. We then analyze the symmetries of the background and show the presence of a non-trivial isometry in the canonical parametrization of the WZW model. Using these results, the equivalence of the asymmetric models with the symmetric ones is demonstrated.
Resumo:
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.
Resumo:
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.
Resumo:
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'
Resumo:
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.
Resumo:
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.
Resumo:
Several studies on molecular profiling of oligodendrogliomas (OGs) in adults have shown a distinctive genetic pattern characterized by combined deletions of chromosome arms 1 p and 19q, O6-methylguanine-methyltransferase (MGMT) methylation, and isocitrate dehydrogenase 1 (IDH1) mutation, which have potential diagnostic, prognostic, and even therapeutic relevance. OGs in pediatric and young adult patients are rare and have been poorly characterized on a molecular and biological basis, and it remains uncertain whether markers with prognostic significance in adults also have predictive value in these patients. Fourteen cases of OGs in young patients (age, <= 25 years) who received a diagnosis over 7 years were selected (7 pediatric patients age <= 18 years and 7 young adults aged 19-25 years). The cases were evaluated for 1p/19q status, MGMT promoter methylation, p53 mutation, and IDH1 mutation. None of the pediatric cases showed 1p/19q deletion. In young adults, combined 1p/19q loss was observed in 57% and isolated 1p loss in 14% of cases. The majority of cases in both subgroups (71% in each) harbored MGMT gene promoter methylation. TP53 and IDH1 mutations were not seen in any of the cases in both the groups. To our knowledge, this is the first study to show that molecular profile of OGs in pediatric and young adult patients is distinct. Further large-scale studies are required to identify additional clinically relevant genetic alterations in this group of patients.
Resumo:
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.
Resumo:
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.
Resumo:
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.
Resumo:
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.
Resumo:
Calcium-dependent protein kinases (CPKs) constitute a unique family of kinases involved in many physiological responses in plants. Biochemical and kinetic properties of a recombinant Swainsona canescens calcium-dependent protein kinase (ScCPK1) were examined in this study. The optimum pH and temperature for activity were pH 7.5 and 37 degrees C, respectively. Substrate phosphorylation activity of ScCPK1 was calmodulin (CaM) independent. Yet CaM antagonists, W7 N-(6-aminohexyl)-5-chloro-1-naphthalene sulphonamide] and calmidazolium inhibited the activity with IC50 values of 750 nM and 350 pM, respectively. Both serine and threonine residues were found to be phosphorylated in auto-phosphorylated ScCPK1 and in histone III-S phosphorylated by ScCPK1. The Ca2+] for half maximal activity (K-0.5) was found to be 0.4 mu M for ScCPK1 with histone III-S as substrate. Kinetic analysis showed that Km of ScCPK1 for histone III-S was 4.8 mu M. These data suggest that ScCPK1 is a functional Ser/Thr kinase, regulated by calcium, and may have a role in Ca2+-mediated signaling in S. canescens. (C) 2012 Elsevier Masson SAS. All rights reserved.
Resumo:
Most bacterial genomes harbor restriction-modification systems, encoding a REase and its cognate MTase. On attack by a foreign DNA, the REase recognizes it as nonself and subjects it to restriction. Should REases be highly specific for targeting the invading foreign DNA? It is often considered to be the case. However, when bacteria harboring a promiscuous or high-fidelity variant of the REase were challenged with bacteriophages, fitness was maximal under conditions of catalytic promiscuity. We also delineate possible mechanisms by which the REase recognizes the chromosome as self at the noncanonical sites, thereby preventing lethal dsDNA breaks. This study provides a fundamental understanding of how bacteria exploit an existing defense system to gain fitness advantage during a host-parasite coevolutionary ``arms race.''
Resumo:
A perturbation of FtsZ assembly dynamics has been shown to inhibit bacterial cytokinesis. In this study, the antibacterial activity of 151 rhodanine compounds was assayed using Bacillus subtilis cells. Of 151 compounds, eight strongly inhibited bacterial proliferation at 2 mu M. Subsequently, we used the elongation of B. subtilis cells as a secondary screen to identify potential FtsZ-targeted antibacterial agents. We found that three compounds significantly increased bacterial cell length. One of the three compounds, namely, CCR-11 (E)-2-thioxo-5-({3-(trifluoromethyl)phenyl]furan-2-yl}methylene) thiazolidin-4-one], inhibited the assembly and GTPase activity of FtsZ in vitro. CCR-11 bound to FtsZ with a dissociation constant of 1.5 +/- 0.3 mu M. A docking analysis indicated that CCR-11 may bind to FtsZ in a cavity adjacent to the T7 loop and that short halogen oxygen, H-bonding, and hydrophobic interactions might be important for the binding of CCR-11 with FtsZ. CCR-11 inhibited the proliferation of B. subtilis cells with a half-maximal inhibitory concentration (IC50) of 1.2 +/- 0.2 mu M and a minimal inhibitory concentration of 3 mu M. It also potently inhibited proliferation of Mycobacterium smegmatis cells. Further, CCR-11 perturbed Z-ring formation in B. subtilis cells; however, it neither visibly affected nucleoid segregation nor altered the membrane integrity of the cells. CCR-11 inhibited HeLa cell proliferation with an IC50 value of 18.1 +/- 0.2,mu M (similar to 15 x IC50 of B. subtilis cell proliferation). The results suggested that CCR-11 inhibits bacterial cytokinesis by inhibiting FtsZ assembly, and it can be used as a lead molecule to develop FtsZ-targeted antibacterial agents.
Resumo:
We study zero-sum risk-sensitive stochastic differential games on the infinite horizon with discounted and ergodic payoff criteria. Under certain assumptions, we establish the existence of values and saddle-point equilibria. We obtain our results by studying the corresponding Hamilton-Jacobi-Isaacs equations. Finally, we show that the value of the ergodic payoff criterion is a constant multiple of the maximal eigenvalue of the generators of the associated nonlinear semigroups.