Development of micro-shock wave assisted dry particle and fluid jet delivery system

Small quantity of energetic material coated on the inner wall of a polymer tube is proposed as a new method to generate micro-shock waves in the laboratory. These micro-shock waves have been harnessed to develop a novel method of delivering dry particle and liquid jet into the target. We have generated micro-shock waves with the help of reactive explosive compound high melting explosive (octahydro-1,3,5,7-tetranitro-1,3,5,7-tetrazocine) and traces of aluminium] coated polymer tube, utilising 9 J of energy. The detonation process is initiated electrically from one end of the tube, while the micro-shock wave followed by the products of detonation escape from the open end of the polymer tube. The energy available at the open end of the polymer tube is used to accelerate tungsten micro-particles coated on the other side of the diaphragm or force a liquid jet out of a small cavity filled with the liquid. The micro-particles deposited on a thin metal diaphragm (typically 100-mu m thick) were accelerated to high velocity using micro-shock waves to penetrate the target. Tungsten particles of 0.7 mu m diameter have been successfully delivered into agarose gel targets of various strengths (0.6-1.0 %). The device has been tested by delivering micro-particles into potato tuber and Arachis hypogaea Linnaeus (ground nut) stem tissue. Along similar lines, liquid jets of diameter 200-250 mu m (methylene blue, water and oils) have been successfully delivered into agarose gel targets of various strengths. Successful vaccination against murine salmonellosis was demonstrated as a biological application of this device. The penetration depths achieved in the experimental targets are very encouraging to develop a future device for biological and biomedical applications.

As(3)p: A Fast Algorithm to Search Structurally Similar Protiens

Protein structure comparison is essential for understanding various aspects of protein structure, function and evolution. It can be used to explore the structural diversity and evolutionary patterns of protein families. In view of the above, a new algorithm is proposed which performs faster protein structure comparison using the peptide backbone torsional angles. It is fast, robust, computationally less expensive and efficient in finding structural similarities between two different protein structures and is also capable of identifying structural repeats within the same protein molecule.

Breakup and coalescence characteristics of a hollow cone swirling spray

This paper deals with an experimental study of the breakup characteristics of water emanating from hollow cone hydraulic injector nozzles induced by pressure-swirling. The experiments were conducted using two nozzles with different orifice diameters 0.3 mm and 0.5 mm and injection pressures (0.3-4 MPa) which correspond to Rep = 7000-26 000. Two types of laser diagnostic techniques were utilized: shadowgraph and phase Doppler particle anemometry for a complete study of the atomization process. Measurements that were made in the spray in both axial and radial directions indicate that both velocity and average droplet diameter profiles are highly dependent on the nozzle characteristics, Weber number and Reynolds number. The spatial variation of diameter and velocity arises principally due to primary breakup of liquid films and subsequent secondary breakup of large droplets due to aerodynamic shear. Downstream of the nozzle, coalescence of droplets due to collision was also found to be significant. Different types of liquid film breakup were considered and found to match well with the theory. Secondary breakup due to shear was also studied theoretically and compared to the experimental data. Coalescence probability at different axial and radial locations was computed to explain the experimental results. The spray is subdivided into three zones: near the nozzle, a zone consisting of film and ligament regime, where primary breakup and some secondary breakup take place; a second zone where the secondary breakup process continues, but weakens, and the centrifugal dispersion becomes dominant; and a third zone away from the spray where coalescence is dominant. Each regime has been analyzed in detail, characterized by timescale and Weber number and validated using experimental data. (C) 2012 American Institute of Physics. http://dx.doi.org/10.1063/1.4773065]

AN ITERATIVE ALGORITHM FOR PHASE RETRIEVAL WITH SPARSITY CONSTRAINTS: APPLICATION TO FREQUENCY DOMAIN OPTICAL COHERENCE TOMOGRAPHY

We address the problem of phase retrieval, which is frequently encountered in optical imaging. The measured quantity is the magnitude of the Fourier spectrum of a function (in optics, the function is also referred to as an object). The goal is to recover the object based on the magnitude measurements. In doing so, the standard assumptions are that the object is compactly supported and positive. In this paper, we consider objects that admit a sparse representation in some orthonormal basis. We develop a variant of the Fienup algorithm to incorporate the condition of sparsity and to successively estimate and refine the phase starting from the magnitude measurements. We show that the proposed iterative algorithm possesses Cauchy convergence properties. As far as the modality is concerned, we work with measurements obtained using a frequency-domain optical-coherence tomography experimental setup. The experimental results on real measured data show that the proposed technique exhibits good reconstruction performance even with fewer coefficients taken into account for reconstruction. It also suppresses the autocorrelation artifacts to a significant extent since it estimates the phase accurately.

Application of Artificial Neural Networks and Particle Swarm Optimization for the Management of Groundwater Resources

Ground management problems are typically solved by the simulation-optimization approach where complex numerical models are used to simulate the groundwater flow and/or contamination transport. These numerical models take a lot of time to solve the management problems and hence become computationally expensive. In this study, Artificial Neural Network (ANN) and Particle Swarm Optimization (PSO) models were developed and coupled for the management of groundwater of Dore river basin in France. The Analytic Element Method (AEM) based flow model was developed and used to generate the dataset for the training and testing of the ANN model. This developed ANN-PSO model was applied to minimize the pumping cost of the wells, including cost of the pipe line. The discharge and location of the pumping wells were taken as the decision variable and the ANN-PSO model was applied to find out the optimal location of the wells. The results of the ANN-PSO model are found similar to the results obtained by AEM-PSO model. The results show that the ANN model can reduce the computational burden significantly as it is able to analyze different scenarios, and the ANN-PSO model is capable of identifying the optimal location of wells efficiently.

A constant factor approximation algorithm for boxicity of circular arc graphs

Boxicity of a graph G(V, E) is the minimum integer k such that G can be represented as the intersection graph of k-dimensional axis parallel boxes in Rk. Equivalently, it is the minimum number of interval graphs on the vertex set V such that the intersection of their edge sets is E. It is known that boxicity cannot be approximated even for graph classes like bipartite, co-bipartite and split graphs below O(n0.5-ε)-factor, for any ε > 0 in polynomial time unless NP = ZPP. Till date, there is no well known graph class of unbounded boxicity for which even an nε-factor approximation algorithm for computing boxicity is known, for any ε < 1. In this paper, we study the boxicity problem on Circular Arc graphs - intersection graphs of arcs of a circle. We give a (2+ 1/k)-factor polynomial time approximation algorithm for computing the boxicity of any circular arc graph along with a corresponding box representation, where k ≥ 1 is its boxicity. For Normal Circular Arc(NCA) graphs, with an NCA model given, this can be improved to an additive 2-factor approximation algorithm. The time complexity of the algorithms to approximately compute the boxicity is O(mn+n2) in both these cases and in O(mn+kn2) which is at most O(n3) time we also get their corresponding box representations, where n is the number of vertices of the graph and m is its number of edges. The additive 2-factor algorithm directly works for any Proper Circular Arc graph, since computing an NCA model for it can be done in polynomial time.

Infinite push: a new support vector ranking algorithm that directly optimizes accuracy at the absolute top of the list

Ranking problems have become increasingly important in machine learning and data mining in recent years, with applications ranging from information retrieval and recommender systems to computational biology and drug discovery. In this paper, we describe a new ranking algorithm that directly maximizes the number of relevant objects retrieved at the absolute top of the list. The algorithm is a support vector style algorithm, but due to the different objective, it no longer leads to a quadratic programming problem. Instead, the dual optimization problem involves l1, ∞ constraints; we solve this dual problem using the recent l1, ∞ projection method of Quattoni et al (2009). Our algorithm can be viewed as an l∞-norm extreme of the lp-norm based algorithm of Rudin (2009) (albeit in a support vector setting rather than a boosting setting); thus we refer to the algorithm as the ‘Infinite Push’. Experiments on real-world data sets confirm the algorithm’s focus on accuracy at the absolute top of the list.

An algorithm to find all palindromic sequences in proteins

A palindrome is a set of characters that reads the same forwards and backwards. Since the discovery of palindromic peptide sequences two decades ago, little effort has been made to understand its structural, functional and evolutionary significance. Therefore, in view of this, an algorithm has been developed to identify all perfect palindromes (excluding the palindromic subset and tandem repeats) in a single protein sequence. The proposed algorithm does not impose any restriction on the number of residues to be given in the input sequence. This avant-garde algorithm will aid in the identification of palindromic peptide sequences of varying lengths in a single protein sequence.

Monoclonal Antibodies against Hepatitis C Genotype 3a Virus Like Particle Inhibit Virus Entry in Cell Culture System

The envelope protein (E1-E2) of Hepatitis C virus (HCV) is a major component of the viral structure. The glycosylated envelope protein is considered to be important for initiation of infection by binding to cellular receptor(s) and also known as one of the major antigenic targets to host immune response. The present study was aimed at identifying mouse monoclonal antibodies which inhibit binding of virus like particles of HCV to target cells. The first step in this direction was to generate recombinant HCV-like particles (HCV-LPs) specific for genotypes 3a of HCV (prevalent in India) using the genes encoding core, E1 and E2 envelop proteins in a baculovirus expression system. The purified HCV-LPs were characterized by ELISA and electron microscopy and were used to generate monoclonal antibodies (mAbs) in mice. Two monoclonal antibodies (E8G9 and H1H10) specific for the E2 region of envelope protein of HCV genotype 3a, were found to reduce the virus binding to Huh7 cells. However, the mAbs generated against HCV genotype 1b (D2H3, G2C7, E1B11) were not so effective. More importantly, mAb E8G9 showed significant inhibition of the virus entry in HCV JFH1 cell culture system. Finally, the epitopic regions on E2 protein which bind to the mAbs have also been identified. Results suggest a new therapeutic strategy and provide the proof of concept that mAb against HCV-LP could be effective in preventing virus entry into liver cells to block HCV replication.

MULTI-OBJECTIVE GENETIC ALGORITHM FOR EFFICIENT POINT MATCHING IN MULTI-SENSOR SATELLITE IMAGE

This paper investigates a new approach for point matching in multi-sensor satellite images. The feature points are matched using multi-objective optimization (angle criterion and distance condition) based on Genetic Algorithm (GA). This optimization process is more efficient as it considers both the angle criterion and distance condition to incorporate multi-objective switching in the fitness function. This optimization process helps in matching three corresponding corner points detected in the reference and sensed image and thereby using the affine transformation, the sensed image is aligned with the reference image. From the results obtained, the performance of the image registration is evaluated and it is concluded that the proposed approach is efficient.

A method of designing seamless connectivity algorithm in ubiquitous networks

The b-phase of polyvinylidene fluoride (PVDF) is well known for its piezoelectric properties. PVDF films have been developed using solvent cast method. The films thus produced are in a-phase. The a-phase is transformed to piezoelectric b-phase when the film is hotstretched with various different stretching factors at various different temperatures. The films are then characterized in terms of their mechanical properties and surface morphological changes during the transformation from a- to b-phases by using X-ray diffraction, differential scanning calorimeter, Raman spectra, Infrared spectra, tensile testing, and scanning electron microscopy. The films showed increased crystallinity with stretching at temperature up to 808C. The optimum conditions to achieve b-phase have been discussed in detail. The fabricated PVDF sensors have been tested for free vibration and impact on plate structure, and its response is compared with conventional piezoelectric wafer type sensor. The resonant and antiresonant peaks in the frequency response of PVDF sensor match well with that of lead zirconate titanate wafer sensors. Effective piezoelectric properties and the variations in the frequency response spectra due to free vibration and impact loading conditions are reported. POLYM. ENG. SCI., 00:000–000, 2012. ª2012 Society of Plastics Engineers

Speeded up Gaussian mixture model algorithm for background subtraction

Adaptive Gaussian Mixture Models (GMM) have been one of the most popular and successful approaches to perform foreground segmentation on multimodal background scenes. However, the good accuracy of the GMM algorithm comes at a high computational cost. An improved GMM technique was proposed by Zivkovic to reduce computational cost by minimizing the number of modes adaptively. In this paper, we propose a modification to his adaptive GMM algorithm that further reduces execution time by replacing expensive floating point computations with low cost integer operations. To maintain accuracy, we derive a heuristic that computes periodic floating point updates for the GMM weight parameter using the value of an integer counter. Experiments show speedups in the range of 1.33 - 1.44 on standard video datasets where a large fraction of pixels are multimodal.

Quasi-based hierarchical clustering for land cover mapping using satellite images

This paper presents an improved hierarchical clustering algorithm for land cover mapping problem using quasi-random distribution. Initially, Niche Particle Swarm Optimization (NPSO) with pseudo/quasi-random distribution is used for splitting the data into number of cluster centers by satisfying Bayesian Information Criteria (BIC). Themain objective is to search and locate the best possible number of cluster and its centers. NPSO which highly depends on the initial distribution of particles in search space is not been exploited to its full potential. In this study, we have compared more uniformly distributed quasi-random with pseudo-random distribution with NPSO for splitting data set. Here to generate quasi-random distribution, Faure method has been used. Performance of previously proposed methods namely K-means, Mean Shift Clustering (MSC) and NPSO with pseudo-random is compared with the proposed approach - NPSO with quasi distribution(Faure). These algorithms are used on synthetic data set and multi-spectral satellite image (Landsat 7 thematic mapper). From the result obtained we conclude that use of quasi-random sequence with NPSO for hierarchical clustering algorithm results in a more accurate data classification.

Clustering using Levy Flight Cuckoo Search

In this paper, a comparative study is carried using three nature-inspired algorithms namely Genetic Algorithm (GA), Particle Swarm Optimization (PSO) and Cuckoo Search (CS) on clustering problem. Cuckoo search is used with levy flight. The heavy-tail property of levy flight is exploited here. These algorithms are used on three standard benchmark datasets and one real-time multi-spectral satellite dataset. The results are tabulated and analysed using various techniques. Finally we conclude that under the given set of parameters, cuckoo search works efficiently for majority of the dataset and levy flight plays an important role.