Gossypol-induced hypokalemia and role of exogenous potassium salt supplementation when used as an antispermatogenic agent in male langur monkey

In our earlier study, we have observed that hypokalemia in langur monkeys, following gossypol acetic acid (GAA) treatment (5 mg dose level) when used as an antispermatogenic agent, and potassium salt supplementation partially maintained body potassium level of the animals. The aims of the present investigation was to confirm further occurrence of hypokalemia in the monkey (comparatively at two higher dose levels) and the role of potassium salt in preventing occurrence of gossypol-induced hypokalemia. Highly purified gossypol acetic acid alone at two dose levels (7.5 and 10 mg/animal/day; oral) and in combination with potassium chloride (0.50 and 0.75 mg/animal/day; oral) was given for 180 days. Treatment with gossypol alone as well as with the supplementation of potassium salt resulted in severe oligospermia and azoospermia. Animals receiving gossypol alone showed significant potassium deficiency with signs of fatigue at both dose levels. Enhanced potassium loss through urine was found in potassium-deficient animals, whereas animals receiving gossypol acetic acid plus potassium salt showed normal serum potassium with a less significant increase in urine potassium level during treatment phases. Other parameters of the body remained within normal range except gradual and significant elevation in serum transaminases activity. The animals gradually returned to normalcy following 150 and 180 days of termination of the treatment.

An Iron Complex of Dipyridophenazine as a Potent Photocytotoxic Agent in Visible Light

Ternary iron(III) complexes (FeL(B)] (1-3) of a trianionic tetradentate phenolate-based ligand (L) and henanthroline base (B), namely, 1,10-phenanthroline (phen, 1), dipyridoquinoxaline (dpq, 2), and dipyridophenazine (dppz, 3), have been prepared and structurally characterized and their DNA binding, cleavage, and photocytotoxic properties studied. The complexes with a FeN3O3 core show the Fe(III)/Fe(II) redox couple near -0.6 V in DMF, a magnetic moment value of similar to 5.9 mu(B), and a binding propensity to both calf thymus DNA and bovine serum albumin (BSA) protein. They exhibit red-light-induced DNA cleavage activity following a metal-assisted photoredox pathway forming HO center dot radicals but do not show any photocleavage of BSA in UV-A light. Complex 3 displays photocytotoxicity in the human cervical cancer cell line (HeLa) and human keratinocyte cell line (HaCaT) with respective IC50 values of 3.59 mu M and 6.07 mu M in visible light and 251 nM and 751 nM in UV-A light of 365 nm. No significant cytotoxicity is observed in the dark. The photoexposed HeLa cells, treated prior with complex 3, have shown marked changes in nuclear morphology as demonstrated by Hoechst 33258 nuclear stain. Generation of reactive oxygen species has been evidenced from the fluorescence enhancement of dichlorofluorescein upon treatment with 3 followed by photoexposure. Nuclear chromatin cleavage has been observed in acridine orange/ethidium bromide dual staining of treated HeLa cells and from alkaline single-cell gel electrophoresis. Caspase 3/7 activity in HeLa cells has been found to be upregulated by only 4 fold after photoirradiation, signifying the fact that cell death through a caspase 3/7 dependent pathway may not be solely operative.

Biomethanation of herbaceous biomass residues using 3-zone plug flow like digesters - A case study from India

Biomethanation of herbaceous biomass feedstock has the potential to provide clean energy source for cooking and other activities in areas where such biomass availability predominates. A biomethanation concept that involves fermentation of biomass residues in three steps, occurring in three zones of the fermentor is described. This approach while attempting take advantage of multistage reactors simplifies the reactor operation and obviates the need for a high degree of process control or complex reactor design. Typical herbaceous biomass decompose with a rapid VFA flux initially (with a tendency to float) followed by a slower decomposition showing balanced process of VFA generation and its utilization by methanogens that colonize biomass slowly. The tendency to float at the initial stages is suppressed by allowing previous days feed to hold it below digester liquid which permits VFA to disperse into the digester liquid without causing process inhibition. This approach has been used to build and operate simple biomass digesters to provide cooking gas in rural areas with weed and agro-residues. With appropriate modifications, the same concept has been used for digesting municipal solid wastes in small towns where large fermentors are not viable. With further modifications this concept has been used for solid-liquid feed fermentors. Methanogen colonized leaf biomass has been used as biofilm support to treat coffee processing wastewater as well as crop litter alternately in a year. During summer it functions as a biomass based biogas plants operating in the three-zone mode while in winter, feeding biomass is suspended and high strength coffee processing wastewater is let into the fermentor achieving over 90% BOD reduction. The early field experience of these fermentors is presented.

Topochemical photodimerization of 7-acetoxycoumarin: the acetoxy group as a steering agent

Among the various substituted coumarins investigated only 7-acetoxycoumarin is observed to photodimerize topochemically in the crystalline state and this observation may be of importance in the context of "crystal engineering".

Topochemical photo-dimerization of 7-acetoxycoumarin - the acetoxy group as a steering agent

Among the various substituted coumarins investigated only 7-acetoxycoumarin is observed to photodimerize topochemically in the crystalline state and this observation may be of importance in the context of "crystal engineering".

Positional Consensus in Multi-Agent Systems using a Broadcast Control Mechanism

In this paper a strategy for controlling a group of agents to achieve positional consensus is presented. The proposed technique is based on the constraint that every agents must be given the same control input through a broadcast communication mechanism. Although the control command is computed using state information in a global framework, the control input is implemented by the agents in a local coordinate frame. We propose a novel linear programming formulation that is computationally less intensive than earlier proposed methods. Moreover, we introduce a random perturbation input in the control command that helps us to achieve perfect consensus even for a large number of agents, which was not possible with the existing strategy in the literature. Moreover, we extend the method to achieve positional consensus at a pre-specified location. The effectiveness of the approach is illustrated through simulation results.

Negotiation schemes for multi-agent cooperative search

Because of limited sensor and communication ranges, designing efficient mechanisms for cooperative tasks is difficult. In this article, several negotiation schemes for multiple agents performing a cooperative task are presented. The negotiation schemes provide suboptimal solutions, but have attractive features of fast decision-making, and scalability to large number of agents without increasing the complexity of the algorithm. A software agent architecture of the decision-making process is also presented. The effect of the magnitude of information flow during the negotiation process is studied by using different models of the negotiation scheme. The performance of the various negotiation schemes, using different information structures, is studied based on the uncertainty reduction achieved for a specified number of search steps. The negotiation schemes perform comparable to that of optimal strategy in terms of uncertainty reduction and also require very low computational time, similar to 7 per cent to that of optimal strategy. Finally, analysis on computational and communication requirement for the negotiation schemes is carried out.

The role of glycodelin as an immune-modulating agent at the feto-maternal interface

Glycodelin A is a progesterone-induced endometrial glycoprotein which has been amply documented to play a role in down-modulation of the maternal immune response to fetal allo-antigens and to be indispensable for the maintenance and progression of pregnancy. Earlier studies from our laboratory have focused on the effect of glycodelin on T cells, key regulators of both the antibody and cell-mediated arms of the acquired immune system. Glycodelin-induced apoptosis inactivated T cells occurs through a caspase-dependant intrinsic mitochondrial pathway. Interestingly, glycodelin inhibited the proliferation of B cells but did not induce apoptosis. More recently, we have studied the effect of glycodelin on the cells of the innate immune system, namely monocytes and NK cells. We have found that glycodelin induced apoptosis in monocytic cells before their differentiation to macrophages, via the mitochondrial pathway, but did not affect their phagocytic capacity after differentiation. Glycodelin induced apoptosis in NK cells but this activity was independent of caspases. In conclusion, glycodelin is observed to affect many cells of the immune system, although the nature of the effect and signaling mechanisms involved in each cell type may be distinct.

Oxovanadium(IV) complexes of phenanthroline bases: the dipyridophenazine complex as a near-IR photocytotoxic agent

Oxovanadium(IV) complexes [VOCl(B)(2)]Cl (1-3) of phenanthroline bases (B), viz. 1,10-phenanthroline (phen in 1), dipyrido[3,2-d: 2', 3'-f] quinoxaline (dpq in 2) and dipyrido[3,2-a: 2', 3'-c] phenazine (dppz in 3), have been prepared, characterized and their DNA and protein binding, photo-induced DNA and protein cleavage activity andm photocytotoxicity have been studied. Complex 2, structurally characterized by X-ray crystallography, shows the presence of a vanadyl group in VOClN4 coordination geometry. The dpq ligand displays a chelating mode of binding with a N-donor site trans to the oxo-group. The chloride ligand is cis to the oxo-group. The one-electron paramagnetic complexes show a d-d band near 715 nm in 15% DMF-Tris-HCl buffer. The complexes are redox active exhibiting a V(IV)/V(III) redox couple within -0.5 to -0.7 V vs. SCE in 20% DMF-Tris-HCl/0.1 M KCl. The complexes bind to calf thymus (CT) DNA in the order: 3 (dppz) > 2 (dpq) > 1 (phen). The binding data reveal the groove and/or partial intercalative DNA binding nature of the complexes. The complexes show chemical nuclease'' activity in the dark in the presence of 3-mercaptopropionic acid or hydrogen peroxide via a hydroxyl radical pathway. The dpq and dppz complexes are efficient photocleavers of DNA in UV-A light of 365 nm forming reactive singlet oxygen (O-1(2)) and hydroxyl radical ((OH)-O-center dot) species. Complexes 2 and 3 also show DNA cleavage activity in red light (> 750 nm) by an exclusive (OH)-O-center dot pathway. The complexes display a binding propensity to bovine serum albumin (BSA) protein giving K-BSA values in the range of 7.1 x 10(4)-1.8 x 10(5) M-1. The dppz complex 3 shows BSA and lysozyme protein cleavage activity in UV-A light of 365 nm via (OH)-O-center dot pathway. The dppz complex 3 exhibits significant PDT effect in human cervical cancer HeLa cells giving IC50 values of 1.0 mu M and 12.0 mu M in UV-A and visible light, respectively (IC50 = > 100 mu M in the dark).

Deploy and search strategy for multi-agent systems using Voronoi partitions

In this paper we analyze a deploy and search strategy for multi-agent systems. Mobile agents equipped with sensors carry out search operation in the search space. The lack of information about the search space is modeled as an uncertainty density distribution over the space, and is assumed to be known to the agents a priori. In each step, the agents deploy themselves in an optimal way so as to maximize per step reduction in the uncertainty density. We analyze the proposed strategy for convergence and spatial distributedness. The control law moving the agents has been analyzed for stability and convergence using LaSalle's invariance principle, and for spatial distributedness under a few realistic constraints on the control input such as constant speed, limit on maximum speed, and also sensor range limits. The simulation experiments show that the strategy successfully reduces the average uncertainty density below the required level.

An agent based adaptive bandwidth allocation scheme for multimedia applications

Bandwidth allocation for multimedia applications in case of network congestion and failure poses technical challenges due to bursty and delay sensitive nature of the applications. The growth of multimedia services on Internet and the development of agent technology have made us to investigate new techniques for resolving the bandwidth issues in multimedia communications. Agent technology is emerging as a flexible promising solution for network resource management and QoS (Quality of Service) control in a distributed environment. In this paper, we propose an adaptive bandwidth allocation scheme for multimedia applications by deploying the static and mobile agents. It is a run-time allocation scheme that functions at the network nodes. This technique adaptively finds an alternate patchup route for every congested/failed link and reallocates the bandwidth for the affected multimedia applications. The designed method has been tested (analytical and simulation)with various network sizes and conditions. The results are presented to assess the performance and effectiveness of the approach. This work also demonstrates some of the benefits of the agent based schemes in providing flexibility, adaptability, software reusability, and maintainability. (C) 2004 Elsevier Inc. All rights reserved.

An agent based adaptive bandwidth allocation scheme for multimedia applications

Bandwidth allocation for multimedia applications in case of network congestion and failure poses technical challenges due to bursty and delay sensitive nature of the applications. The growth of multimedia services on Internet and the development of agent technology have made us to investigate new techniques for resolving the bandwidth issues in multimedia communications. Agent technology is emerging as a flexible promising solution for network resource management and QoS (Quality of Service) control in a distributed environment. In this paper, we propose an adaptive bandwidth allocation scheme for multimedia applications by deploying the static and mobile agents. It is a run-time allocation scheme that functions at the network nodes. This technique adaptively finds an alternate patchup route for every congested/failed link and reallocates the bandwidth for the affected multimedia applications. The designed method has been tested (analytical and simulation)with various network sizes and conditions. The results are presented to assess the performance and effectiveness of the approach. This work also demonstrates some of the benefits of the agent based schemes in providing flexibility, adaptability, software reusability, and maintainability. (C) 2004 Elsevier Inc. All rights reserved.

Folding a Polymer via Two-Point Interaction with an External Folding Agent: Use of H-Bonding and Charge-Transfer Interactions

A polymer containing electron-rich aromatic donors (1,5-dialkoxynaphthalene (DAN)) was coerced into a folded state by an external folding agent that contained an electron-deficient aromatic acceptor (pyromellitic diimide (PM)) unit. The donor-containing polymer was designed to carry a tertiary amine moiety in the linking segment, which served as an H-bonding site for reinforcing the interaction with the acceptor containing folding agent that also bore a carboxylic acid group. The H-bonding interaction of the carboxylic acid and the tertiary amine brings the PDI unit between two adjacent DAN units along the polymer backbone to induce charge-transfer (C-T) interactions, and this in turn causes the polymer chain to form a pleated structure. Evidence for the formation of such a pleated structure was obtained from NMR titration studies and also by monitoring the C-T band in their UV-visible spectra. By varying the length of the segment that links the PDI acceptor to the carboxylic acid group, we showed that the most effective folding agent was the one that had a single carbon spacer, as evident from the highest value of the association constant. Control experiments with propionic acid clearly demonstrated the importance of the additional C-T interactions for venerating the folded structures. Further, solution viscosity measurements in the presence of varying amounts of the folding agent revealed a gradual stiffening of the chain in the case of the PDI carrying carboxylic acid, whereas no such affect was seen in the case of simple propionic acid. These observations were supported by D FT calculations of the interactions of a dimeric model of the polymer with the various folding agents; here too the stability of the complex was seen to be highest in the case of the single carbon spacer.

Two-agent cooperative search using game models with endurance-time constraints

In this article, the problem of two Unmanned Aerial Vehicles (UAVs) cooperatively searching an unknown region is addressed. The search region is discretized into hexagonal cells and each cell is assumed to possess an uncertainty value. The UAVs have to cooperatively search these cells taking limited endurance, sensor and communication range constraints into account. Due to limited endurance, the UAVs need to return to the base station for refuelling and also need to select a base station when multiple base stations are present. This article proposes a route planning algorithm that takes endurance time constraints into account and uses game theoretical strategies to reduce the uncertainty. The route planning algorithm selects only those cells that ensure the agent will return to any one of the available bases. A set of paths are formed using these cells which the game theoretical strategies use to select a path that yields maximum uncertainty reduction. We explore non-cooperative Nash, cooperative and security strategies from game theory to enhance the search effectiveness. Monte-Carlo simulations are carried out which show the superiority of the game theoretical strategies over greedy strategy for different look ahead step length paths. Within the game theoretical strategies, non-cooperative Nash and cooperative strategy perform similarly in an ideal case, but Nash strategy performs better than the cooperative strategy when the perceived information is different. We also propose a heuristic based on partitioning of the search space into sectors to reduce computational overhead without performance degradation.

Self assessment schemes for multi-agent cooperative search

In this paper, we present self assessment schemes (SAS) for multiple agents performing a search mission on an unknown terrain. The agents are subjected to limited communication and sensor ranges. The agents communicate and coordinate with their neighbours to arrive at route decisions. The self assessment schemes proposed here have very low communication and computational overhead. The SAS also has attractive features like scalability to large number of agents and fast decision-making capability. SAS can be used with partial or complete information sharing schemes during the search mission. We validate the performance of SAS using simulation on a large search space consisting of 100 agents with different information structures and self assessment schemes. We also compare the results obtained using SAS with that of a previously proposed negotiation scheme. The simulation results show that the SAS is scalable to large number of agents and can perform as good as the negotiation schemes with reduced communication requirement (almost 20% of that required for negotiation).