A peer-peer particle swarm optimizer

Particle Swarm Optimization is a parallel algorithm that spawns particles across a search space searching for an optimized solution. Though inherently parallel, they have distinct synchronizations points which stumbles attempts to create completely distributed versions of it. In this paper, we attempt to create a completely distributed peer-peer particle swarm optimization in a cluster of heterogeneous nodes. Since, the original algorithm requires explicit synchronization points we modified the algorithm in multiple ways to support a peer-peer system of nodes. We also modify certain aspect of the basic PSO algorithm and show how certain numerical problems can take advantage of the same thereby yielding fast convergence.

A Multicast Authentication Protocol (MAP) for Dynamic Multicast Groups in Wireless Networks

In this paper, we have proposed a centralized multicast authentication protocol (MAP) for dynamic multicast groups in wireless networks. In our protocol, a multicast group is defined only at the time of the multicasting. The authentication server (AS) in the network generates a session key and authenticates it to each of the members of a multicast group using the computationally inexpensive least common multiple (LCM) method. In addition, a pseudo random function (PRF) is used to bind the secret keys of the network members with their identities. By doing this, the AS is relieved from storing per member secrets in its memory, making the scheme completely storage scalable. The protocol minimizes the load on the network members by shifting the computational tasks towards the AS node as far as possible. The protocol possesses a membership revocation mechanism and is protected against replay attack and brute force attack. Analytical and simulation results confirm the effectiveness of the proposed protocol.

Assessing the critical concentration of NH2 terminal groups on the surface of MWNTs towards chain scission of PC in PC/SAN blends: effect on dispersion, electrical conductivity and EMI shielding

The localization and dispersion quality of as received NH2 terminated multiwall carbon nanotubes (MWNT-I) and ethylene diamine (EDA) functionalized MWNTs in melt mixed blends of polycarbonate ( PC) and poly(styrene-co-acrylonitrile) (SAN) were assessed in this study using rheo-electrical and electromagnetic interference (EMI) shielding measurements. In order to improve the dispersion quality and also to selectively localize MWNTs in the PC phase of the blends, EDA was grafted onto MWNTs by two different strategies like diazonium reaction of the para-substituted benzene ring of MWNTs with EDA ( referred to as MWNT-II) and acylation of carboxyl functionalized MWNTs with thionyl chloride ( referred to as MWNT-III). By this approach we could systematically vary the concentration of NH2 functional groups on the surface of MWNTs at a fixed concentration (1 wt%) in PC/SAN blends. XPS was carried to evaluate the % concentration of N in different MWNTs and was observed to be highest for MWNT-III manifesting in a large surface coverage of EDA on the surface of MWNTs. Viscoelastic properties and melt electrical conductivities were measured to assess the dispersion quality of MWNTs using a rheo-electrical set-up both in the quiescent as well as under steady shear conditions. Rheological properties revealed chain scission of PC in the presence of MWNT-III which is due to specific interactions between EDA and PC leading to smaller PC grafts on the surface of MWNTs. The observed viscoelastic properties in the blends were further correlated with the phase morphologies under quiescent and annealed conditions. Electromagnetic interference (EMI) shielding effectiveness in X and K-u-band frequencies were measured to explore these composites for EMI shielding applications. Interestingly, MWNT-II showed the highest electrical conductivity and EMI shielding in the blends.

UNIQUENESS OF SOLUTIONS TO SCHRODINGER EQUATIONS ON H-TYPE GROUPS

This paper deals with the Schrodinger equation i partial derivative(s)u(z, t; s) - Lu(z, t; s) = 0; where L is the sub-Laplacian on the Heisenberg group. Assume that the initial data f satisfies vertical bar f(z, t)vertical bar less than or similar to q(alpha)(z, t), where q(s) is the heat kernel associated to L. If in addition vertical bar u(z, t; s(0))vertical bar less than or similar to q(beta)(z, t), for some s(0) is an element of R \textbackslash {0}, then we prove that u(z, t; s) = 0 for all s is an element of R whenever alpha beta < s(0)(2). This result holds true in the more general context of H-type groups. We also prove an analogous result for the Grushin operator on Rn+1.

Give-and-take based peer-to-peer content distribution networks

Content Distribution Networks (CDNs) are widely used to distribute data to large number of users. Traditionally, content is being replicated among a number of surrogate servers, leading to high operational costs. In this context, Peer-to-Peer (P2P) CDNs have emerged as a viable alternative. An issue of concern in P2P networks is that of free riders, i.e., selfish peers who download files and leave without uploading anything in return. Free riding must be discouraged. In this paper, we propose a criterion, the Give-and-Take (G&T) criterion, that disallows free riders. Incorporating the G&T criterion in our model, we study a problem that arises naturally when a new peer enters the system: viz., the problem of downloading a `universe' of segments, scattered among other peers, at low cost. We analyse this hard problem, and characterize the optimal download cost under the G&T criterion. We propose an optimal algorithm, and provide a sub-optimal algorithm that is nearly optimal, but runs much more quickly; this provides an attractive balance between running time and performance. Finally, we compare the performance of our algorithms with that of a few existing P2P downloading strategies in use. We also study the computation time for prescribing the strategy for initial segment and peer selection for the newly arrived peer for various existing and proposed algorithms, and quantify cost-computation time trade-offs.

Effect of functional groups on separating carbon dioxide from CO2/N-2 gas mixtures using edge functionalized graphene nanoribbons

Development of microporous adsorbents for separation and sequestration of carbon dioxide from flue gas streams is an area of active research. In this study, we assess the influence of specific functional groups on the adsorption selectivity of CO2/N-2 mixtures through Grand Canonical Monte Carlo (GCMC) simulations. Our model system consists of a bilayer graphene nanoribbon that has been edge functionalized with OH, NH2, NO2, CH3 and COOH. Ab initio Moller-Plesset (MP2) calculations with functionalized benzenes are used to obtain binding energies and optimized geometries for CO2 and N-2. This information is used to validate the choice classical forcefields in GCMC simulations. In addition to simulations of adsorption from binary mixtures of CO2 and N-2, the ideal adsorbed solution theory (IAST) is used to predict mixture isotherms. Our study reveals that functionalization always leads to an increase in the adsorption of both CO2 and N-2 with the highest for COOH. However, significant enhancement in the selectivity for CO2 is only seen with COOH functionalized nanoribbons. The COOH functionalization gives a 28% increase in selectivity compared to H terminated nanoribbons, whereas the improvement in the selectivity for other functional groups are much Enure modest. Our study suggests that specific functionalization with COOH groups can provide a material's design strategy to improve CO2 selectivity in microporous adsorbents. Synthesis of graphene nanoplatelets with edge functionalized COOH, which has the potential for large scale production, has recently been reported (Jeon el, al., 2012). (C) 2014 Elsevier Ltd. All rights reserved,

Solution processable diketopyrrolopyrrole (DPP) cored small molecules with BODIPY end groups as novel donors for organic solar cells

Two novel triads based on a diketopyrrolopyrrole (DPP) central core and two 4,4-difluoro-4-bora-3a,4a-diaza-s-indacene (BODIPY) units attached by thiophene rings have been synthesised having high molar extinction coefficients. These triads were characterised and used as donor materials in small molecule, solution processable organic solar cells. Both triads were blended with PC71BM as an acceptor in different ratios by wt% and their photovoltaic properties were studied. For both the triads a modest photovoltaic performance was observed, having an efficiency of 0.65%. Moreover, in order to understand the ground and excited state properties and vertical absorption profile of DPP and BODIPY units within the triads, theoretical DFT and TDDFT calculations were performed.

An island called India: phylogenetic patterns across multiple taxonomic groups reveal endemic radiations

Island systems from around the world have provided fascinating opportunities for studies pertaining to various evolutionary processes. One recurring feature of isolated islands is the presence of endemic radiations. In this regard, the Indian subcontinent is an interesting entity given it has been an island during much of its history following separation from Madagascar and currently is isolated from much of Eurasia by the Himalayas in the north and the Indian Ocean in the south. Not surprisingly, recent molecular studies on a number of endemic taxa from India have reported endemic radiations. These studies suggest that the uniqueness of Indian biota is not just due to its diverse origin, but also due to evolution in isolation. The isolation of India has generated some peculiarities typically seen on oceanic islands. However, these patterns might be confined to, groups with low dispersal ability.

Groups constrain the use of risky habitat by individuals: a new cost to sociality?

Predation risk can strongly constrain how individuals use time and space. Grouping is known to reduce an individual's time investment in costly antipredator behaviours. Whether grouping might similarly provide a spatial release from antipredator behaviour and allow individuals to use risky habitat more and, thus, improve their access to resources is poorly known. We used mosquito larvae, Aedes aegypti, to test the hypothesis that grouping facilitates the use of high-risk habitat. We provided two habitats, one darker, low-risk and one lighter, high-risk, and measured the relative time spent in the latter by solitary larvae versus larvae in small groups. We tested larvae reared under different resource levels, and thus presumed to vary in body condition, because condition is known to influence risk taking. We also varied the degree of contrast in habitat structure. We predicted that individuals in groups should use high-risk habitat more than solitary individuals allowing for influences of body condition and contrast in habitat structure. Grouping strongly influenced the time spent in the high-risk habitat, but, contrary to our expectation, individuals in groups spent less time in the high-risk habitat than solitary individuals. Furthermore, solitary individuals considerably increased the proportion of time spent in the high-risk habitat over time, whereas individuals in groups did not. Both solitary individuals and those in groups showed a small increase over time in their use of riskier locations within each habitat. The differences between solitary individuals and those in groups held across all resource and contrast conditions. Grouping may, thus, carry a poorly understood cost of constraining habitat use. This cost may arise because movement traits important for maintaining group cohesion (a result of strong selection on grouping) can act to exaggerate an individual preference for low-risk habitat. Further research is needed to examine the interplay between grouping, individual movement and habitat use traits in environments heterogeneous in risk and resources. (C) 2015 The Association for the Study of Animal Behaviour. Published by Elsevier Ltd. All rights reserved.

Social optimum in social groups with give-and-take criterion

We consider a Social Group' of networked nodes, seeking a universe' of segments. Each node has a subset of the universe and access to an expensive resource for downloading data. Nodes can also acquire the universe by exchanging copies of segments among themselves, at low cost, using inter-node links. While exchanges over inter-node links ensure minimum cost, some nodes in the group try to exploit the system. We term such nodes as non-reciprocating nodes' and prohibit such behavior by proposing the give-and-take' criterion, where exchange is allowed if each node has segments unavailable with the other. Under this criterion, we consider the problem of maximizing the number of nodes with the universe at the end of local exchanges. First, we present a randomized algorithm that is shown to be optimal in the asymptotic regime. Then, we present greedy links algorithm, which performs well for most of the scenarios and yields an optimal result when the number of nodes is four. The polygon algorithm is proposed, which yields an optimal result when each of the nodes has a unique segment. After presenting some intuitive algorithms (e.g., greedy incremental algorithm and rarest first algorithm), we compare the performances of all proposed algorithms with the optimal. Copyright (c) 2015 John Wiley & Sons, Ltd.