Process variables in biomimetic synthesis of silver nanoparticles by aqueous extract of Azadirachta indica (Neem) leaves

Owing to widespread applications, synthesis and characterization of silver nanoparticles is recently attracting considerable attention. Increasing environmental concerns over chemical synthesis routes have resulted in attempts to develop biomimetic approaches. One of them is synthesis using plant parts, which eliminates the elaborate process of maintaining the microbial culture and often found to be kinetically favourable than other bioprocesses. The present study deals with investigating the effect of process variables like reductant concentrations, reaction pH, mixing ratio of the reactants and interaction time on the morphology and size of silver nanoparticles synthesized using aqueous extract of Azadirachta indica (Neem) leaves. The formation of crystalline silver nanoparticles was confirmed using X-ray diffraction analysis. By means of UV spectroscopy, Scanning and Transmission Electron Microscopy techniques, it was observed that the morphology and size of the nanoparticles were strongly dependent on the process parameters. Within 4 h interaction period, nanoparticles below 20-nm-size with nearly spherical shape were produced. On increasing interaction time (ageing) to 66 days, both aggregation and shape anisotropy (ellipsoidal, polyhedral and capsular) of the particles increased. In alkaline pH range, the stability of cluster distribution increased with a declined tendency for aggregation of the particles. It can be inferred from the study that fine tuning the bioprocess parameters will enhance possibilities of desired nano-product tailor made for particular applications.

Novel melody line identification algorithm for polyphonic MIDI music

The problem of automatic melody line identification in a MIDI file plays an important role towards taking QBH systems to the next level. We present here, a novel algorithm to identify the melody line in a polyphonic MIDI file. A note pruning and track/channel ranking method is used to identify the melody line. We use results from musicology to derive certain simple heuristics for the note pruning stage. This helps in the robustness of the algorithm, by way of discarding "spurious" notes. A ranking based on the melodic information in each track/channel enables us to choose the melody line accurately. Our algorithm makes no assumption about MIDI performer specific parameters, is simple and achieves an accuracy of 97% in identifying the melody line correctly. This algorithm is currently being used by us in a QBH system built in our lab.

Supramolecular Organization in Tetra Aqua (mu-8-Hydroxyquinoline-5-sulfonate) Barium (II) and Ag center dot center dot center dot I Interactions in a Pseudopolymorphic Form of (7-Iodo-8-hydroxyquinoline-5-sulfonate) Silver (I) Monohydrate

The complexes, Ba (HQS) (H2O)(4) (HQS = 8-hydroxyquinoline-5-sulfonic acid) (1) and Ag (HIQS) (H2O) (Ferron = 7-iodo-8-hydroxyquinoline-5-sulfonic acid) (2) have been synthesized and characterized by X-ray diffraction analysis and spectroscopic studies. In compound 1, Ba2+ ion has a nine-coordinate monocapped antiprismatic geometry. In compound 2, Ag+ has distorted tetrahedral coordination and Ag center dot center dot center dot I interactions generate the supramolecular architectures. The complexes have been characterized by FT-IR and UV-Visible measurements. In both the structures, the inversion-related organic ligands are stacked over one another leading to three-dimensional networks.

Real-coded genetic algorithm for machining condition optimization

In this paper, we consider the machining condition optimization models presented in earlier studies. Finding the optimal combination of machining conditions within the constraints is a difficult task. Hence, in earlier studies standard optimization methods are used. The non-linear nature of the objective function, and the constraints that need to be satisfied makes it difficult to use the standard optimization methods for the solution. In this paper, we present a real coded genetic algorithm (RCGA), to find the optimal combination of machining conditions. We present various issues related to real coded genetic algorithm such as solution representation, crossover operators, and repair algorithm in detail. We also present the results obtained for these models using real coded genetic algorithm and discuss the advantages of using real coded genetic algorithm for these problems. From the results obtained, we conclude that real coded genetic algorithm is reliable and accurate for solving the machining condition optimization models.

Stabilizing High-Energy Crystal Structure in Silver Nanowires with Underpotential Electrochemistry

We demonstrate that commonly face-centered cubic (fcc) metallic nanowires can be stabilized in hexagonal structures even when their surface energy contribution is relatively small. With a modified electrochemical growth process, we have grown purely single-crystalline 4H silver nanowires (AgNWs) of diameters as large as 100 nm within nanoporous anodic alumina and polycarbonate templates. The growth process is not limited by the/Ag Nernst equilibrium potential, and time-resolved imaging with high-resolution transmission electron microscopy (TEM) indicates a kinematically new mechanism of nanowire growth. Most importantly, our experiments aim to separate the effects of confinement and growth conditions on the crystal structure of nanoscale systems.

Profiling k-Iteration Paths : A Generalization of the Ball-Larus Profiling Algorithm

The Ball-Larus path-profiling algorithm is an efficient technique to collect acyclic path frequencies of a program. However, longer paths -those extending across loop iterations - describe the runtime behaviour of programs better. We generalize the Ball-Larus profiling algorithm for profiling k-iteration paths - paths that can span up to to k iterations of a loop. We show that it is possible to number suchk-iteration paths perfectly, thus allowing for an efficient profiling algorithm for such longer paths. We also describe a scheme for mixed-mode profiling: profiling different parts of a procedure with different path lengths. Experimental results show that k-iteration profiling is realistic.

Modified density matrix renormalization group algorithm for the zigzag spin-1/2 chain with frustrated antiferromagnetic exchange: Comparison with field theory at large J(2)/J(1)

A modified density matrix renormalization group (DMRG) algorithm is applied to the zigzag spin-1/2 chain with frustrated antiferromagnetic exchange J(1) and J(2) between first and second neighbors. The modified algorithm yields accurate results up to J(2)/J(1) approximate to 4 for the magnetic gap Delta to the lowest triplet state, the amplitude B of the bond order wave phase, the wavelength lambda of the spiral phase, and the spin correlation length xi. The J(2)/J(1) dependences of Delta, B, lambda, and xi provide multiple comparisons to field theories of the zigzag chain. The twist angle of the spiral phase and the spin structure factor yield additional comparisons between DMRG and field theory. Attention is given to the numerical accuracy required to obtain exponentially small gaps or exponentially long correlations near a quantum phase transition.

A genetic algorithm with characteristic amplification through multiple geographically isolated populations and varied fitness landscapes

This paper proposes a new approach, wherein multiple populations are evolved on different landscapes. The problem statement is broken down, to describe discrete characteristics. Each landscape, described by its fitness landscape is used to optimize or amplify a certain characteristic or set of characteristics. Individuals from each of these populations are kept geographically isolated from each other Each population is evolved individually. After a predetermined number of evolutions, the system of populations is analysed against a normalized fitness function. Depending on this score and a predefined merging scheme, the populations are merged, one at a time, while continuing evolution. Merging continues until only one final population remains. This population is then evolved, following which the resulting population will contain the optimal solution. The final resulting population will contain individuals which have been optimized against all characteristics as desired by the problem statement. Each individual population is optimized for a local maxima. Thus when populations are merged, the effect is to produce a new population which is closer to the global maxima.

A genetic algorithm with characteristic amplification through multiple geographically isolated populations and varied fitness landscapes

This paper proposes a new approach, wherein multiple populations are evolved on different landscapes. The problem statement is broken down, to describe discrete characteristics. Each landscape, described by its fitness landscape is used to optimize or amplify a certain characteristic or set of characteristics. Individuals from each of these populations are kept geographically isolated from each other Each population is evolved individually. After a predetermined number of evolutions, the system of populations is analysed against a normalized fitness function. Depending on this score and a predefined merging scheme, the populations are merged, one at a time, while continuing evolution. Merging continues until only one final population remains. This population is then evolved, following which the resulting population will contain the optimal solution. The final resulting population will contain individuals which have been optimized against all characteristics as desired by the problem statement. Each individual population is optimized for a local maxima. Thus when populations are merged, the effect is to produce a new population which is closer to the global maxima.

A fast dual algorithm for kernel logistic regression

This paper gives a new iterative algorithm for kernel logistic regression. It is based on the solution of a dual problem using ideas similar to those of the Sequential Minimal Optimization algorithm for Support Vector Machines. Asymptotic convergence of the algorithm is proved. Computational experiments show that the algorithm is robust and fast. The algorithmic ideas can also be used to give a fast dual algorithm for solving the optimization problem arising in the inner loop of Gaussian Process classifiers.

RACK: RApid Clustering using K-means algorithm

The k-means algorithm is an extremely popular technique for clustering data. One of the major limitations of the k-means is that the time to cluster a given dataset D is linear in the number of clusters, k. In this paper, we employ height balanced trees to address this issue. Specifically, we make two major contributions, (a) we propose an algorithm, RACK (acronym for RApid Clustering using k-means), which takes time favorably comparable with the fastest known existing techniques, and (b) we prove an expected bound on the quality of clustering achieved using RACK. Our experimental results on large datasets strongly suggest that RACK is competitive with the k-means algorithm in terms of quality of clustering, while taking significantly less time.

A real coded genetic algorithm for data partitioning and scheduling in networks with arbitrary processor release time

The problem of scheduling divisible loads in distributed computing systems, in presence of processor release time is considered. The objective is to find the optimal sequence of load distribution and the optimal load fractions assigned to each processor in the system such that the processing time of the entire processing load is a minimum. This is a difficult combinatorial optimization problem and hence genetic algorithms approach is presented for its solution.

Delay optimal control algorithm for a multiaccess fading channel with peak power constraint

We consider an optimal power and rate scheduling problem for a multiaccess fading wireless channel with the objective of minimising a weighted sum of mean packet transmission delay subject to a peak power constraint. The base station acts as a controller which, depending upon the buffer lengths and the channel state of each user, allocates transmission rate and power to individual users. We assume perfect channel state information at the transmitter and the receiver. We also assume a Markov model for the fading and packet arrival processes. The policy obtained represents a form of Indexability.

Pareto-optimal solutions for multi-objective optimization of fed-batch bioreactors using nondominated sorting genetic algorithm

Many optimal control problems are characterized by their multiple performance measures that are often noncommensurable and competing with each other. The presence of multiple objectives in a problem usually give rise to a set of optimal solutions, largely known as Pareto-optimal solutions. Evolutionary algorithms have been recognized to be well suited for multi-objective optimization because of their capability to evolve a set of nondominated solutions distributed along the Pareto front. This has led to the development of many evolutionary multi-objective optimization algorithms among which Nondominated Sorting Genetic Algorithm (NSGA and its enhanced version NSGA-II) has been found effective in solving a wide variety of problems. Recently, we reported a genetic algorithm based technique for solving dynamic single-objective optimization problems, with single as well as multiple control variables, that appear in fed-batch bioreactor applications. The purpose of this study is to extend this methodology for solution of multi-objective optimal control problems under the framework of NSGA-II. The applicability of the technique is illustrated by solving two optimal control problems, taken from literature, which have usually been solved by several methods as single-objective dynamic optimization problems. (C) 2004 Elsevier Ltd. All rights reserved.

Infrared absorption spectra of single crystals of glycine silver nitrate and monoglycine nitrate

he infrared absorption spectra of glycine silver nitrate (GAgNO3) and glycine nitrate (GHNO3) show that the glycine group exists completely in the zwitter ion form in the former and in both forms in the latter. The spectrum of GAgNO3 at liquid air temperature did not reveal any striking change which can be attributed to a freezing of the rapid reorientation of the NH3+ group taking place at higher temperatures. The position of the COO− stretching frequencies indicate that this group is co-ordinated only weakly to the Ag+ ion. The summation frequencies reported by Schroeder, Wier and Lippincott (1962) for AgNO3 were not observed in the present study on GAgNO3. It shows however that ferroelectricity in GAgNO3 is in all probability due to the motion of the Ag+ ion in the oxygen co-ordination polyhedron and is not directly connected with the ordering of the hydrogen bonds below Curie point.