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).

Polymer–filler interactions in hydroxy-terminated polybutadiene–ammonium perchlorate system in the presence of a bonding agent

Bonding between ammonium perchlorate (AP) and hydroxy-terminated polybutadiene (HTPB), constituting a nonreinforcing filler system, has been studied in the presence of a unique bonding agent (BA)–a switter ion molecule, 2,4-dinitrophenylhydrazone derivative of 1,1′-bisacetylferrocene (DNPHD AF). Extensive conjugation and a permanent ionic character makes the DNPHD AF to bond strongly with the ionic oxidizer AP. Through its terminal OH group, HTPH bonds with the NO2 groups of DNPHD AF. Bonding sites in the molecules have been located from IR studies and from the first-order rate constant measurements of the bonding of DNPHD AF and other model BAs with HTPB and AP. The bonding ability of DNPHD AF is further evidenced from SEM micrographs.

The Biocontrol Agent Phlebiopsis gigantea: Efficacy and Impacts on the Stump Bacterial Biota and Conifer tree Defences

Phlebiopsis gigantea has been for a long time known as a strong competitor against Heterobasidion annosum and intensively applied as a biological control agent on stump surfaces of Picea abies in Fennoscandia. However, the mechanism underlying its antagonistic activity is still unknown. A primary concern is the possible impact of P. gigantea treatment on resident non-target microbial biota of conifer stumps. Additional risk factor is the potential of P. gigantea to acquire a necrotrophic habit through adaptation to living wood tissues. This study focused on the differential screening of several P. gigantea isolates from diverse geographical sources as well as the use of breeding approach to enhance the biocontrol efficacy against H. annosum infection. The results showed a significant positive correlation between growth rate in wood and high biocontrol efficacy. Furthermore, with aid of breeding approach, several progeny strains were obtained that had better growth rate and control efficacy than parental isolates. To address the issue of the potential of P. gigantea to acquire necrotrophic capability, a combination of histochemical, molecular and transcript profiling (454 sequencing) were used to investigate the interactions between these two fungi and ten year old P. sylvestris seedlings. The results revealed that both P. gigantea and H. annosum provoked strong necrotic lesions, but after prolonged incubation, P. gigantea lesions shrank and ceased to expand further. Tree seedlings pre-treated with P. gigantea further restricted H. annosum-induced necrosis and had elevated transcript levels of genes important for lignification, cell death regulation and jasmonic acid signalling. These suggest that induced localized resistance is a contributory factor for the biocontrol efficacy of P.gigantea, and it has a comparatively limited necrotrophic capability than H. annosum. Finally, to investigate the potential impact of P. gigantea on the stump bacterial biota, 16S rDNA isolated from tissue samples from stumps of P. abies after 1-, 6- and 13-year post treatment was sequenced using bar-coded 454 Titanium pyrosequencing. Proteobacteria were found to be the most abundant at the initial stages of stump decay but were selectively replaced by Acidobacteria at advanced stages of the decay. Moreover, P. gigantea treatment significantly decreased the bacterial richness at initial decay stage in the stumps. Over time, the bacterial community in the stumps gradually recovered and the negative effects of P. gigantea was attenuated.

Control of Agent Swarms using Generalized Centroidal Cyclic Pursuit Laws

One of the major tasks in swarm intelligence is to design decentralized but homogenoeus strategies to enable controlling the behaviour of swarms of agents. It has been shown in the literature that the point of convergence and motion of a swarm of autonomous mobile agents can be controlled by using cyclic pursuit laws. In cyclic pursuit, there exists a predefined cyclic connection between agents and each agent pursues the next agent in the cycle. In this paper we generalize this idea to a case where an agent pursues a point which is the weighted average of the positions of the remaining agents. This point correspond to a particular pursuit sequence. Using this concept of centroidal cyclic pursuit, the behavior of the agents is analyzed such that, by suitably selecting the agents' gain, the rendezvous point of the agents can be controlled, directed linear motion of the agents can be achieved, and the trajectories of the agents can be changed by switching between the pursuit sequences keeping some of the behaviors of the agents invariant. Simulation experiments are given to support the analytical proofs.

Multi-Agent Rendezvous Algorithm with Rectilinear Decision Domain

The aim of this paper is to develop a computationally efficient decentralized rendezvous algorithm for a group of autonomous agents. The algorithm generalizes the notion of sensor domain and decision domain of agents to enable implementation of simple computational algorithms. Specifically, the algorithm proposed in this paper uses a rectilinear decision domain (RDD) as against the circular decision domain assumed in earlier work. Because of this, the computational complexity of the algorithm reduces considerably and, when compared to the standard Ando's algorithm available in the literature, the RDD algorithm shows very significant improvement in convergence time performance. Analytical results to prove convergence and supporting simulation results are presented in the paper.

Positional Consensus of Multi-Agent Systems Using Linear Programming Based Decentralized Control with Rectilinear Decision Domain

In this paper we develop a Linear Programming (LP) based decentralized algorithm for a group of multiple autonomous agents to achieve positional consensus. Each agent is capable of exchanging information about its position and orientation with other agents within their sensing region. The method is computationally feasible and easy to implement. Analytical results are presented. The effectiveness of the approach is illustrated with simulation results.

Microwave assisted synthesis and UV-Vis spectroscopic studies of silver nanoparticles synthesized using vanillin as a reducing agent

The present investigation explores the adaptability of a microwave assisted route to obtain silver nanoparticles by the reduction of AgNO3 with vanillin, an environmentally benign material. Anionic surfactants such as AOT and SDS were used separately for encapsulating AgNPs and their role was compared. The UV-Visible absorption spectra present a broad SPR band consisting of two peaks suggesting the formation of silver nanoparticle with bimodal size distribution. The TEM image shows particles with spherical and hexagonal morphologies which confirms the results of UV-Vis studies. The anisotropy in the particle morphology can be attributed to the surface oxidation which in turn produces Ag@Ag2O core-shell nanostructures. Thus an intriguing feature of this system is that the obtained colloid is a mixture of AgNPs with and without Ag2O layers. Studies on the influence of pH on the stability of the synthesized nanoparticles revealed that the presence of excess Ag2O layers has a profound influence on it. Ag2O layers can be removed from AgNPs' surface by changing the solution pH to the acidic regime. The present study attests the enhanced ability of AOT in stabilizing the AgNPs in aqueous media. (C) 2011 Elsevier B.V. All rights reserved.

Automated Multi-Agent Search Using Centroidal Voronoi Configuration

This paper addresses the problem of automated multiagent search in an unknown environment. Autonomous agents equipped with sensors carry out a search operation in a search space, where the uncertainty, or lack of information about the environment, is known a priori as an uncertainty density distribution function. The agents are deployed in the search space to maximize single step search effectiveness. The centroidal Voronoi configuration, which achieves a locally optimal deployment, forms the basis for the proposed sequential deploy and search strategy. It is shown that with the proposed control law the agent trajectories converge in a globally asymptotic manner to the centroidal Voronoi configuration. Simulation experiments are provided to validate the strategy. Note to Practitioners-In this paper, searching an unknown region to gather information about it is modeled as a problem of using search as a means of reducing information uncertainty about the region. Moreover, multiple automated searchers or agents are used to carry out this operation optimally. This problem has many applications in search and surveillance operations using several autonomous UAVs or mobile robots. The concept of agents converging to the centroid of their Voronoi cells, weighted with the uncertainty density, is used to design a search strategy named as sequential deploy and search. Finally, the performance of the strategy is validated using simulations.

Synthesis of epoxy-terminated polymers by radical polymerization using alpha-(t-butylperoxymethyl)styrene as chain transfer agent

Epoxy-terminated polystyrene has been synthesized by radical polymerization using alpha-(t-butylperoxymethyl) styrene (TPMS) as the chain transfer agent. The chain transfer constants were found to be 0.66 and 0.80 at 60 and 70 degrees C, respectively. The presence of epoxy end groups was confirmed by functional group modification of epoxide to aldehyde by treatment with BF3.Et(2)O. Thermal stability of TPMS was followed by differential scanning calorimetry and iodimetry. Thermal decomposition of TPMS in toluene follows first order kinetics with an activation energy of 23 kcal/mol. (C) 1996 John Wiley & Sons, Inc.