Antimicrobial and conducting polymer substrate derived from hybrid structures of silver nanoparticles and multiwall carbon nanotubes

Hybrid nanocomposites of polycaprolactone (PCL) with multiwall carbon nanotubes (MWNTs) and silver nanoparticles (nAg) were prepared by melt mixing. Synergetic effect of the two nanofillers (MWNT and nAg) in PCL matrix was evaluated for dielectric and antibacterial properties. Dielectric results showed that the addition of nAg as filler in PCL matrix (PCL/nAg) had no effect on conductivity, whereas addition of MWNT in PCL matrix (PCL/MWNT) caused a sharp increase in conductivity of PCL. Interestingly, the hybrid nanocomposite (PCL/MWNT/nAg) incorporating MWNT and nAg also exhibited high electrical conductivity. The hybrid composite was found to have antibacterial property similar to that of PCL/nAg composite for lower loading of nAg. This study demonstrates that the synergetic interaction of the nanofillers in the hybrid nanocomposite improves both electrical conductivity and antibacterial properties of PCL.

Hot pressed silver doped hydroxyapatite biomaterials with bactericidal properties against magnetotactic bacteria

Hydroxyapatite (HA) is widely being researched for hard tissue replacement for its good osseointegration and biocompatibility property. However, the inferior antibacterial property of HA often results in infection at host site, and this leads to rejection of the implant. The antibacterial property of silver (Ag) is well known and in the past decade or so, the application of Ag is reinvented in medicinal applications like catheters, vascular grafts and orthopaedic implants. In this respect, the present work reports the synthesis of Ag doped HA using hot pressing in argon atmosphere. This work also reports the effect of HA-Ag composition on bacterial colonisation during in vitro study. The bactericidal property of Ag doped HA has been investigated against magnetotactic bacteria, a `magnetite' containing bacteria. Magnetotactic bacteria were seeded onto pellets, and the adhesion of bacteria was evaluated using scanning electron microscopy. It was confirmed that incorporation of Ag in HA leads to improved bactericidal property.

In situ formation of silver nanowire networks on paper

Simple, universally adaptable techniques for fabricating conductive patterns are required to translate laboratory-scale innovations into low-cost solutions for the developing world. Silver nanostructures have emerged as attractive candidates for forming such conductive patterns. We report here the in situ formation of conductive silver-nanowire networks on paper, thereby eliminating the need for either cost-intensive ink formulation or substrate preparation or complex post-deposition sintering steps. Reminiscent of the photographic process of `salt printing', a desktop office printer was used to deposit desired patterns of silver bromide on paper, which were subsequently exposed to light and then immersed in a photographic developer. Percolating silver nanowire networks that conformally coated the paper fibres were formed after 10 min of exposure to light from a commercial halogen lamp. Thus, conductive and patterned films with sheet resistances of the order of 4 Omega/rectangle can be easily formed by combining two widely used processes - inkjet printing and photographic development.

Fienup Algorithm With Sparsity Constraints: Application to Frequency-Domain Optical-Coherence Tomography

We address the problem of reconstructing a sparse signal from its DFT magnitude. We refer to this problem as the sparse phase retrieval (SPR) problem, which finds applications in tomography, digital holography, electron microscopy, etc. We develop a Fienup-type iterative algorithm, referred to as the Max-K algorithm, to enforce sparsity and successively refine the estimate of phase. We show that the Max-K algorithm possesses Cauchy convergence properties under certain conditions, that is, the MSE of reconstruction does not increase with iterations. We also formulate the problem of SPR as a feasibility problem, where the goal is to find a signal that is sparse in a known basis and whose Fourier transform magnitude is consistent with the measurement. Subsequently, we interpret the Max-K algorithm as alternating projections onto the object-domain and measurement-domain constraint sets and generalize it to a parameterized relaxation, known as the relaxed averaged alternating reflections (RAAR) algorithm. On the application front, we work with measurements acquired using a frequency-domain optical-coherence tomography (FDOCT) experimental setup. Experimental results on measured data show that the proposed algorithms exhibit good reconstruction performance compared with the direct inversion technique, homomorphic technique, and the classical Fienup algorithm without sparsity constraint; specifically, the autocorrelation artifacts and background noise are suppressed to a significant extent. We also demonstrate that the RAAR algorithm offers a broader framework for FDOCT reconstruction, of which the direct inversion technique and the proposed Max-K algorithm become special instances corresponding to specific values of the relaxation parameter.

A simulation-based algorithm for optimal pricing policy under demand uncertainty

We propose a simulation-based algorithm for computing the optimal pricing policy for a product under uncertain demand dynamics. We consider a parameterized stochastic differential equation (SDE) model for the uncertain demand dynamics of the product over the planning horizon. In particular, we consider a dynamic model that is an extension of the Bass model. The performance of our algorithm is compared to that of a myopic pricing policy and is shown to give better results. Two significant advantages with our algorithm are as follows: (a) it does not require information on the system model parameters if the SDE system state is known via either a simulation device or real data, and (b) as it works efficiently even for high-dimensional parameters, it uses the efficient smoothed functional gradient estimator.

A shortest path tree based algorithm for relay placement in a wireless sensor network and its performance analysis

In this paper, we study a problem of designing a multi-hop wireless network for interconnecting sensors (hereafter called source nodes) to a Base Station (BS), by deploying a minimum number of relay nodes at a subset of given potential locations, while meeting a quality of service (QoS) objective specified as a hop count bound for paths from the sources to the BS. The hop count bound suffices to ensure a certain probability of the data being delivered to the BS within a given maximum delay under a light traffic model. We observe that the problem is NP-Hard. For this problem, we propose a polynomial time approximation algorithm based on iteratively constructing shortest path trees and heuristically pruning away the relay nodes used until the hop count bound is violated. Results show that the algorithm performs efficiently in various randomly generated network scenarios; in over 90% of the tested scenarios, it gave solutions that were either optimal or were worse than optimal by just one relay. We then use random graph techniques to obtain, under a certain stochastic setting, an upper bound on the average case approximation ratio of a class of algorithms (including the proposed algorithm) for this problem as a function of the number of source nodes, and the hop count bound. To the best of our knowledge, the average case analysis is the first of its kind in the relay placement literature. Since the design is based on a light traffic model, we also provide simulation results (using models for the IEEE 802.15.4 physical layer and medium access control) to assess the traffic levels up to which the QoS objectives continue to be met. (C) 2014 Elsevier B.V. All rights reserved.

Qualitative toxicity assessment of silver nanoparticles on the fresh water bacterial isolates and consortium at low level of exposure concentration

Silver nanoparticles (AgNPs) pose a high risk of exposure to the natural environment owing to their extensive usage in various consumer products. In the present study we attempted to understand the harmful effect of AgNPs at environmentally relevant low concentration levels (<= 1 ppm) towards two different freshwater bacterial isolates and their consortium. The standard plate count assay suggested that the AgNPs were toxic towards the fresh water bacterial isolates as well as the consortium, though toxicity was significantly reduced for the cells in the consortium. The oxidative stress assessment and membrane permeability studies corroborated with the toxicity data. The detailed electron microscopic studies suggested the cell degrading potential of the AgNPs, and the FT-IR studies confirmed the involvement of the surface groups in the toxic effects. No significant ion leaching from the AgNPs was observed at the applied concentration levels signifying the dominant role of the particle size, and size distribution in bacterial toxicity. The reduced toxicity for the cells in the consortium than the individual isolates has major significance in further studies on the ecotoxicity of the AgNPs. (C) 2014 Elsevier Inc. All rights reserved.

Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule?

The correlation clustering problem is a fundamental problem in both theory and practice, and it involves identifying clusters of objects in a data set based on their similarity. A traditional modeling of this question as a graph theoretic problem involves associating vertices with data points and indicating similarity by adjacency. Clusters then correspond to cliques in the graph. The resulting optimization problem, Cluster Editing (and several variants) are very well-studied algorithmically. In many situations, however, translating clusters to cliques can be somewhat restrictive. A more flexible notion would be that of a structure where the vertices are mutually ``not too far apart'', without necessarily being adjacent. One such generalization is realized by structures called s-clubs, which are graphs of diameter at most s. In this work, we study the question of finding a set of at most k edges whose removal leaves us with a graph whose components are s-clubs. Recently, it has been shown that unless Exponential Time Hypothesis fail (ETH) fails Cluster Editing (whose components are 1-clubs) does not admit sub-exponential time algorithm STACS, 2013]. That is, there is no algorithm solving the problem in time 2 degrees((k))n(O(1)). However, surprisingly they show that when the number of cliques in the output graph is restricted to d, then the problem can be solved in time O(2(O(root dk)) + m + n). We show that this sub-exponential time algorithm for the fixed number of cliques is rather an exception than a rule. Our first result shows that assuming the ETH, there is no algorithm solving the s-Club Cluster Edge Deletion problem in time 2 degrees((k))n(O(1)). We show, further, that even the problem of deleting edges to obtain a graph with d s-clubs cannot be solved in time 2 degrees((k))n(O)(1) for any fixed s, d >= 2. This is a radical contrast from the situation established for cliques, where sub-exponential algorithms are known.

A constant factor approximation algorithm for boxicity of circular arc graphs

The boxicity (resp. cubicity) of a graph G(V, E) is the minimum integer k such that G can be represented as the intersection graph of axis parallel boxes (resp. cubes) in R-k. Equivalently, it is the minimum number of interval graphs (resp. unit interval graphs) on the vertex set V, such that the intersection of their edge sets is E. The problem of computing boxicity (resp. cubicity) is known to be inapproximable, even for restricted graph classes like bipartite, co-bipartite and split graphs, within an O(n(1-epsilon))-factor for any epsilon > 0 in polynomial time, unless NP = ZPP. For any well known graph class of unbounded boxicity, there is no known approximation algorithm that gives n(1-epsilon)-factor approximation algorithm for computing boxicity in polynomial time, for any epsilon > 0. In this paper, we consider the problem of approximating the boxicity (cubicity) of circular arc graphs intersection graphs of arcs of a circle. Circular arc graphs are known to have unbounded boxicity, which could be as large as Omega(n). We give a (2 + 1/k) -factor (resp. (2 + log n]/k)-factor) polynomial time approximation algorithm for computing the boxicity (resp. cubicity) of any circular arc graph, where k >= 1 is the value of the optimum solution. For normal circular arc (NCA) graphs, with an NCA model given, this can be improved to an additive two approximation algorithm. The time complexity of the algorithms to approximately compute the boxicity (resp. cubicity) is O(mn + n(2)) in both these cases, and in O(mn + kn(2)) = O(n(3)) time we also get their corresponding box (resp. cube) representations, where n is the number of vertices of the graph and m is its number of edges. Our additive two approximation algorithm directly works for any proper circular arc graph, since their NCA models can be computed in polynomial time. (C) 2014 Elsevier B.V. All rights reserved.

Comparison of the photocatalytic degradation of trypan blue by undoped and silver-doped zinc oxide nanoparticles

Zinc oxide (ZnO) and silver doped zinc oxide (ZnO:Ag) nanoparticles were prepared using nitrates of zinc and silver as oxidizers and ethylene diaminetetraacetic acid (EDTA) as a fuel via low-temperature combustion synthesis (LCS) at 500 degrees C. X-ray diffraction (XRD) pattern indicates the presence of silver in the hexagonal wurtzite structure of ZnO. Fourier transform infrared (FTIR) spectrum indicates the presence of Ag-Zn-O stretching vibration at 510 cm(-1). Transmission electron microscopy (TEM) images shows that the average particle size of ZnO and ZnO:Ag nanoparticles were found to be 58 nm and 52 nm, respectively. X-ray photoelectron spectroscopy (XPS) data clearly indicates the presence of Ag in ZnO crystal lattice. The above characterization techniques indicate that the incorporation of silver affects the structural and optical properties of ZnO nanoparticles. ZnO:Ag nanoparticles exhibited 3% higher photocatalytic efficiency than pure ZnO nanoparticles. ZnO:Ag nanoparticles show better photocatalytic activity for the degradation of trypan blue (TrB) compared to undoped ZnO nanoparticles. (C) 2014 Elsevier Ltd. All rights reserved.

How does spacer length of imidazolium gemini surfactants control the fabrication of 2D-Langmuir films of silver-nanoparticles at the air-water interface?

A series of gemini surfactants based on cationic imidazolium ring as polar headgroup, abbreviated as lm-n-lm], 2Br(-) (n = 2, 5, 6 and 12), was synthesized. Their ability to stabilize silver nanoparticles in aqueous media was investigated. The resulting suspensions were characterized by UV-Vis spectroscopy and transmission electron microscopy (TEM). They exhibit specific morphologies by adopting different supramolecular assemblies in aqueous media depending on the internal packing arrangements and on the number of spacer methylene units -(CH2)(n)-]. Individual colloids were extracted from the aqueous to chloroform layer and spread at the air/water interface to allow the formation of well-defined Langmuir films. By analysis of the surface pressure-area isotherms, the details about the packing behavior and orientation of the imidazolium gemini surfactant capped silver nanoparticles were obtained. Morphological features of the dynamic process of monolayer compression at the air-water interface were elucidated using Brewster angle microscopy (BAM). These monolayers were further transferred on mica sheets by the Langmuir-Blodgett technique at their associated collapse pressure and the morphology of these monolayers was investigated by atomic force microscopy (AFM). The number of spacer methylene units -(CH2)(n)-] of the gemini surfactants exerted critical influence in modulating the characteristics of the resulting Langmuir films. (C) 2014 Elsevier Inc. All rights reserved.

How does spacer length of imidazolium gemini surfactants control the fabrication of 2D-Langmuir films of silver-nanoparticles at the air-water interface?

A series of gemini surfactants based on cationic imidazolium ring as polar headgroup, abbreviated as Im-n-Im], 2Br(-) (n = 2, 5,6 and 12), was synthesized. Their ability to stabilize silver nanoparticles in aqueous media was investigated. The resulting suspensions were characterized by UV-Vis spectroscopy and transmission electron microscopy (TEM). They exhibit specific morphologies by adopting different supramolecular assemblies in aqueous media depending on the internal packing arrangements and on the number of spacer methylene units -(CH2)(n)-]. Individual colloids were extracted from the aqueous to chloroform layer and spread at the air/water interface to allow the formation of well-defined Langmuir films. By analysis of the surface pressure-area isotherms, the details about the packing behavior and orientation of the imidazolium gemini surfactant capped silver nanoparticles were obtained. Morphological features of the dynamic process of monolayer compression at the air-water interface were elucidated using Brewster angle microscopy (BAM). These monolayers were further transferred on mica sheets by the Langmuir-Blodgett technique at their associated collapse pressure and the morphology of these monolayers was investigated by atomic force microscopy (AFM). The number of spacer methylene units (CH2)(n)-] of the gemini surfactants exerted critical influence in modulating the characteristics of the resulting Langmuir films. (C) 2014 Elsevier Inc. All rights reserved.

A Modified Sum-Product Algorithm over Graphs with Isolated Short Cycles

We investigate into the limitations of the sum-product algorithm in the probability domain over graphs with isolated short cycles. By considering the statistical dependency of messages passed in a cycle of length 4, we modify the update equations for the beliefs at the variable and check nodes. We highlight an approximate log domain algebra for the modified variable node update to ensure numerical stability. At higher signal-to-noise ratios (SNR), the performance of decoding over graphs with isolated short cycles using the modified algorithm is improved compared to the original message passing algorithm (MPA).

Conductivity Studies of Silver-, Potassium-, and Magnesium-Doped Hydroxyapatite

We report the electrical transport properties of silver-, potassium-, and magnesium-doped hydroxyapatites (HAs). While Ag+ or K+ doping to HA enhances the conductivity, Mg+2 doping lowers the conductivity when compared with undoped HA. The mechanism behind the observed differences in ionic conductivity has been discussed using the analysis of high-temperature frequency-dependent conductivity data, Cole-Cole plots of impedance data as well as on the basis of the frequency dependence of the imaginary part (M) of the complex electric modulus. The f(max) of modulus M decreased in silver- and potassium-doped samples in comparison with the undoped HA.

A Distributed TDMA Slot Scheduling Algorithm for Spatially Correlated Contention in WSNs

In WSNs the communication traffic is often time and space correlated, where multiple nodes in a proximity start transmitting simultaneously. Such a situation is known as spatially correlated contention. The random access method to resolve such contention suffers from high collision rate, whereas the traditional distributed TDMA scheduling techniques primarily try to improve the network capacity by reducing the schedule length. Usually, the situation of spatially correlated contention persists only for a short duration, and therefore generating an optimal or suboptimal schedule is not very useful. Additionally, if an algorithm takes very long time to schedule, it will not only introduce additional delay in the data transfer but also consume more energy. In this paper, we present a distributed TDMA slot scheduling (DTSS) algorithm, which considerably reduces the time required to perform scheduling, while restricting the schedule length to the maximum degree of interference graph. The DTSS algorithm supports unicast, multicast, and broadcast scheduling, simultaneously without any modification in the protocol. We have analyzed the protocol for average case performance and also simulated it using Castalia simulator to evaluate its runtime performance. Both analytical and simulation results show that our protocol is able to considerably reduce the time required for scheduling.