Multiple contour extraction from graylevel images using an artificial neural network

For active contour modeling (ACM), we propose a novel self-organizing map (SOM)-based approach, called the batch-SOM (BSOM), that attempts to integrate the advantages of SOM- and snake-based ACMs in order to extract the desired contours from images. We employ feature points, in the form of ail edge-map (as obtained from a standard edge-detection operation), to guide the contour (as in the case of SOM-based ACMs) along with the gradient and intensity variations in a local region to ensure that the contour does not "leak" into the object boundary in case of faulty feature points (weak or broken edges). In contrast with the snake-based ACMs, however, we do not use an explicit energy functional (based on gradient or intensity) for controlling the contour movement. We extend the BSOM to handle extraction of contours of multiple objects, by splitting a single contour into as many subcontours as the objects in the image. The BSOM and its extended version are tested on synthetic binary and gray-level images with both single and multiple objects. We also demonstrate the efficacy of the BSOM on images of objects having both convex and nonconvex boundaries. The results demonstrate the superiority of the BSOM over others. Finally, we analyze the limitations of the BSOM.

Joint Source-Channel Coding over a Fading Multiple Access Channel with Partial Channel State Information

In this paper we address the problem of transmission of correlated sources over a fast fading multiple access channel (MAC) with partial channel state information available at both the encoders and the decoder. We provide sufficient conditions for transmission with given distortions. Next these conditions are specialized to a Gaussian MAC (GMAC). We provide the optimal power allocation strategy and compare the strategy with various levels of channel state information.

Multi-Pattern Viterbi Algorithm for joint decoding of multiple speech patterns

Joint decoding of multiple speech patterns so as to improve speech recognition performance is important, especially in the presence of noise. In this paper, we propose a Multi-Pattern Viterbi algorithm (MPVA) to jointly decode and recognize multiple speech patterns for automatic speech recognition (ASR). The MPVA is a generalization of the Viterbi Algorithm to jointly decode multiple patterns given a Hidden Markov Model (HMM). Unlike the previously proposed two stage Constrained Multi-Pattern Viterbi Algorithm (CMPVA),the MPVA is a single stage algorithm. MPVA has the advantage that it cart be extended to connected word recognition (CWR) and continuous speech recognition (CSR) problems. MPVA is shown to provide better speech recognition performance than the earlier techniques: using only two repetitions of noisy speech patterns (-5 dB SNR, 10% burst noise), the word error rate using MPVA decreased by 28.5%, when compared to using individual decoding. (C) 2010 Elsevier B.V. All rights reserved.

Interplay between multiple length and time scales in complex chemical systems

Processes in complex chemical systems, such as macromolecules, electrolytes, interfaces, micelles and enzymes, can span several orders of magnitude in length and time scales. The length and time scales of processes occurring over this broad time and space window are frequently coupled to give rise to the control necessary to ensure specificity and the uniqueness of the chemical phenomena. A combination of experimental, theoretical and computational techniques that can address a multiplicity of length and time scales is required in order to understand and predict structure and dynamics in such complex systems. This review highlights recent experimental developments that allow one to probe structure and dynamics at increasingly smaller length and time scales. The key theoretical approaches and computational strategies for integrating information across time-scales are discussed. The application of these ideas to understand phenomena in various areas, ranging from materials science to biology, is illustrated in the context of current developments in the areas of liquids and solvation, protein folding and aggregation and phase transitions, nucleation and self-assembly.

Assessment of the mutagenic potential of a fungicide Bavistin using multiple assays

The fungicide Bavistin was assessed for mutagenic potential by various assays. Bavistin was found to be unable to induce gene mutation in Salmonella typhimurium, but it was able to induce transfection inhibition in Mycobacterium smegmatis. Bavistin was able to induce immediate genotoxic effects in plants but these were not carried through in development as in the long term no genotoxic effects were observed by the progeny test. Bavistin did induce micronuclei formation and did cause an increase in the ratio of normochromatic to polychromatic erythrocytes in mice. It was able to induce a very low frequency of sister-chromatid exchange in human lymphocytes and in addition, it was observed that the chemical affected the mitotic index but did not affect the cell cycle duration. Present studies indicate that the pesticide shows a positive response in 4 out of 5 different test systems (Table 8) and most of the observations support that Bavistin is genotoxic.

Computing a matrix symmetrizer exactly using modified multiple modulus residue arithmetic

A symmetric solution X satisfying the matrix equation XA = AtX is called a symmetrizer of the matrix A. A general algorithm to compute a matrix symmetrizer is obtained. A new multiple-modulus residue arithmetic called floating-point modular arithmetic is described and implemented on the algorithm to compute an error-free matrix symmetrizer.

Medium access control schemes for local area networks with multiple priority function

This paper deals with the development and performance evaluation of three modified versions of a scheme proposed for medium access control in local area networks. The original scheme implements a collision-free and fair medium arbitration by using a control wire in conjunction with a data bus. The modifications suggested in this paper are intended to realize the multiple priority function in local area networks.

Multiplexing in multiple imaging through the theta modulation technique

We apply the theta modulation technique to simultaneously multiple image more than one object independently with a Fourier plane sampling type of multiple imaging system. Experimental results of multiple imaging two objects is presented.

Optimal reservoir operation for irrigation of multiple crops using genetic algorithms

This paper presents a genetic algorithm (GA) model for obtaining an optimal operating policy and optimal crop water allocations from an irrigation reservoir. The objective is to maximize the sum of the relative yields from all crops in the irrigated area. The model takes into account reservoir inflow, rainfall on the irrigated area, intraseasonal competition for water among multiple crops, the soil moisture dynamics in each cropped area, the heterogeneous nature of soils. and crop response to the level of irrigation applied. The model is applied to the Malaprabha single-purpose irrigation reservoir in Karnataka State, India. The optimal operating policy obtained using the GA is similar to that obtained by linear programming. This model can be used for optimal utilization of the available water resources of any reservoir system to obtain maximum benefits.

Classification of Protein Kinases on the Basis of Both Kinase and Non-Kinase Regions

Background: Protein phosphorylation is a generic way to regulate signal transduction pathways in all kingdoms of life. In many organisms, it is achieved by the large family of Ser/Thr/Tyr protein kinases which are traditionally classified into groups and subfamilies on the basis of the amino acid sequence of their catalytic domains. Many protein kinases are multidomain in nature but the diversity of the accessory domains and their organization are usually not taken into account while classifying kinases into groups or subfamilies. Methodology: Here, we present an approach which considers amino acid sequences of complete gene products, in order to suggest refinements in sets of pre-classified sequences. The strategy is based on alignment-free similarity scores and iterative Area Under the Curve (AUC) computation. Similarity scores are computed by detecting common patterns between two sequences and scoring them using a substitution matrix, with a consistent normalization scheme. This allows us to handle full-length sequences, and implicitly takes into account domain diversity and domain shuffling. We quantitatively validate our approach on a subset of 212 human protein kinases. We then employ it on the complete repertoire of human protein kinases and suggest few qualitative refinements in the subfamily assignment stored in the KinG database, which is based on catalytic domains only. Based on our new measure, we delineate 37 cases of potential hybrid kinases: sequences for which classical classification based entirely on catalytic domains is inconsistent with the full-length similarity scores computed here, which implicitly consider multi-domain nature and regions outside the catalytic kinase domain. We also provide some examples of hybrid kinases of the protozoan parasite Entamoeba histolytica. Conclusions: The implicit consideration of multi-domain architectures is a valuable inclusion to complement other classification schemes. The proposed algorithm may also be employed to classify other families of enzymes with multidomain architecture.

Multiple imaging and multichannel optical processing with split lenses

The use of split lenses for multiple imaging and multichannel optical processing is demonstrated. Conditions are obtained for nonoverlapping of multipled images and avoiding crosstalk in the multichannel processing. Almost uniform intensity across the multipled images is an advantage here, while the low ƒ/No. of the split lens segments puts a limit in the resolution in image processing. Experimental results of multiple imaging and of a few multichannel processing are presented.

A nonhelical, multiple β-turn conformation in a glycine-rich heptapeptide fragment of trichogin A IV containing a single central α-aminoisobutyric acid residue

The conformational properties of the protected seven-residue C-terminal fragment the lipopeptaibol antibiotic Trichogin A IV (Boc-Gly-Gly-Leu-Aib-Gly-Ile-Leu-OMe) has been examined in CDCl3 and (CD3)2SO by 1H-nmr. Evidence for a multiple β-turn conformation [type I′ at Gly(1)-Gly(2), type II at Leu(3)-Aib(4), and a type I′ at Aib(4)-Gly(5)] suggests that Leu(3) has preferred an extended or semiextended conformation over a helical conformation in CDCl3. This structure is thus in contrast to earlier observations of seven-residue peptides containing a single central Aib preferring helical conformations in both solution and crystalline slates. A structural transition to a frayed right-handed helix is absented in (CD3)2SO. These results suggest that nonhelical conformations may be important in Gly-rich peptides containing Aib. Further, the presence of amino acids with contradictory influences on backbone conformational freedom can lead to well-defined conformational transitions even in small peptides

Semi-Supervised Classification Using Sparse Gaussian Process Regression

Gaussian Processes (GPs) are promising Bayesian methods for classification and regression problems. They have also been used for semi-supervised learning tasks. In this paper, we propose a new algorithm for solving semi-supervised binary classification problem using sparse GP regression (GPR) models. It is closely related to semi-supervised learning based on support vector regression (SVR) and maximum margin clustering. The proposed algorithm is simple and easy to implement. It gives a sparse solution directly unlike the SVR based algorithm. Also, the hyperparameters are estimated easily without resorting to expensive cross-validation technique. Use of sparse GPR model helps in making the proposed algorithm scalable. Preliminary results on synthetic and real-world data sets demonstrate the efficacy of the new algorithm.