Disaggregative Clustering Using the Concept of Mutual Nearest Neighborhood

A nonparametric, hierarchical, disaggregative clustering algorithm is developed using a novel similarity measure, called the mutual neighborhood value (MNV), which takes into account the conventional nearest neighbor ranks of two samples with respect to each other. The algorithm is simple, noniterative, requires low storage, and needs no specification of the expected number of clusters. The algorithm appears very versatile as it is capable of discerning spherical and nonspherical clusters, linearly nonseparable clusters, clusters with unequal populations, and clusters with lowdensity bridges. Changing of the neighborhood size enables discernment of strong or weak patterns.

Ordered Ports – a Language Concept for High-level Distributed Programming

A new language concept for high-level distributed programming is proposed. Programs are organised as a collection of concurrently executing processes. Some of these processes, referred to as liaison processes, have a monitor-like structure and contain ports which may be invoked by other processes for the purposes of synchronisation and communication. Synchronisation is achieved by conditional activation of ports and also through port control constructs which may directly specify the execution ordering of ports. These constructs implement a path-expression-like mechanism for synchronisation and are also equipped with options to provide conditional, non-deterministic and priority ordering of ports. The usefulness and expressive power of the proposed concepts are illustrated through solutions of several representative programming problems. Some implementation issues are also considered.

Physical mapping of the genomic DNA of the Oryctes rhinoceros baculovirus, KI

A non-occluded baculovirus, OBV-KI has been isolated from the insect pest, Oryctes rhinoceros. The viral genome is estimated to be 123 kb, with a G + C content of 43 mol% and no detectible methylated bases. A restriction map of the OBV-KI genome for BamHI, EcoRI, HindIII, PstI, SalI and XbaI has been constructed.

A novel method for mapping assembled epitopes in batches: Identification of three epitopes at the receptor binding region of human chorionic gonadotropin

Identification of conformation-specific epitopes of hCG beta has been done using a simple batch method, Chemically or enzymatically-modified hCG beta has been prepared in a batch and the effect of modifications on the integrity of different epitope regions has been investigated in a quantitative manner using monoclonal antibodies (MAbs) immobilized on plastic tubes from culture supernatants. Based on the extent of damage done to different regions by different modifications, three conformation-specific epitopes of hCG beta have been identified. The method has been shown to have important advantages over the existing methods on many considerations, Using this approach, these epitopes have been shown to be at/near the receptor-binding region.

Antigenic determinants at the carboxy terminus of chicken egg white riboflavin carrier protein (RCP): Epitope mapping and antibody-mediated pregnancy curtailment in rodents

The epitopic core sequences recognized by three monoclonal antibodies raised to chicken riboflavin carrier protein (RCP) were mapped to the C-terminal tail-end of the protein using the pepscan method A 21-residue synthetic peptide corresponding to residues 200-219 of the protein and comprising the regions corresponding to the antibodies was synthesized. Administration of polyclonal antibodies specific to this peptide led to termination of early pregnancy in mice. Also, active immunization of rats with the peptide-purified protein derivative conjugate inhibited establishment of pregnancy. These results demonstrate the functional importance of the C-terminal 200-219 region of chicken RCP. Copyright (C) 1996 Elsevier Science Ltd.

RS and GIS in mapping of geomorphic records and understanding the local controls of glacial retreat from the Baspa Valley, Himachal Pradesh, India

We report here the role of remote sensing (RS) and geographical information system (GIS) in the identification of geomorphic records and understanding of the local controls on the retreat of glaciers of the Baspa Valley, Himachal Pradesh, India. The geomorphic records mapped are accumulation zone, exposed ablation zone, moraine-covered ablation zone, snout, deglaciated valley, lateral moraine, medial moraine, terminal moraine and hanging glacier. Details of these features and stages of deglaciation have been extracted from RS data and mapped in a GIS environment. Glacial geomorphic data have been generated for 22 glaciers of the Baspa Valley. The retreat of glaciers has been estimated using the glacial maxima observed on satellite images. On the basis of percentage of retreat and the critical analysis of glacial geomorphic data for 22 glaciers of the Baspa Valley, they are classified into seven categories of very low to very very high retreat. From the analysis of the above 22 glaciers, it has been found that other than global warming, the retreat of glaciers of the Baspa Valley is inversely proportional to the size of the accumulation zone and the ratio of the moraine covered ablation/exposed ablation zone.

Mapping adaptive resonance theory onto ring and mesh architectures

In recent years, parallel computers have been attracting attention for simulating artificial neural networks (ANN). This is due to the inherent parallelism in ANN. This work is aimed at studying ways of parallelizing adaptive resonance theory (ART), a popular neural network algorithm. The core computations of ART are separated and different strategies of parallelizing ART are discussed. We present mapping strategies for ART 2-A neural network onto ring and mesh architectures. The required parallel architecture is simulated using a parallel architectural simulator, PROTEUS and parallel programs are written using a superset of C for the algorithms presented. A simulation-based scalability study of the algorithm-architecture match is carried out. The various overheads are identified in order to suggest ways of improving the performance. Our main objective is to find out the performance of the ART2-A network on different parallel architectures. (C) 1999 Elsevier Science B.V. All rights reserved.

Mapping of B-cell epitopes of hemagglutinin protein of rinderpest virus

Monoclonal antibodies (mAbs) against secreted hemagglutinin (H) protein of rinderpest virus (RPV) expressed by a recombinant baculovirus were generated to characterize the antigenic sites on H protein and regions of functional significance. Three of the mAbs displayed hemagglutination inhibition activity and these mAbs were unable to neutralize virus infectivity. Western immunoblot analysis of overlapping deletion mutants indicated that three mAbs recognize antigenic regions at the extreme carboxy terminus (between amino acids 569 and 609) and the fourth mAb between amino acids 512 and 568. Using synthetic peptides, aa 569-577 and 575-583 were identified as the epitopes for E2G4 and D2F4, respectively. The epitopic domains of A12A9 and E2B6 mAbs were mapped to regions encompassing aa 527-554 and 588-609. Two epitopes spanning the extreme carboxy terminal region of aa 573 to 587 and 588 to 609 were shown to be immunodominant employing a competitive ELISA with polyclonal sera form vaccinated cattle. The D2F4 mAb which recognizes a unique epitope on RPV-H is not present on the closely related peste des petits ruminant virus FIN protein and this mAb could serve as a tool in the seromonitoring program after rinderpest vaccination. (C) 2002 Elsevier Science (USA).

The restriction mapping problem revisited

In computational molecular biology, the aim of restriction mapping is to locate the restriction sites of a given enzyme on a DNA molecule. Double digest and partial digest are two well-studied techniques for restriction mapping. While double digest is NP-complete, there is no known polynomial-time algorithm for partial digest. Another disadvantage of the above techniques is that there can be multiple solutions for reconstruction. In this paper, we study a simple technique called labeled partial digest for restriction mapping. We give a fast polynomial time (O(n(2) log n) worst-case) algorithm for finding all the n sites of a DNA molecule using this technique. An important advantage of the algorithm is the unique reconstruction of the DNA molecule from the digest. The technique is also robust in handling errors in fragment lengths which arises in the laboratory. We give a robust O(n(4)) worst-case algorithm that can provably tolerate an absolute error of O(Delta/n) (where Delta is the minimum inter-site distance), while giving a unique reconstruction. We test our theoretical results by simulating the performance of the algorithm on a real DNA molecule. Motivated by the similarity to the labeled partial digest problem, we address a related problem of interest-the de novo peptide sequencing problem (ACM-SIAM Symposium on Discrete Algorithms (SODA), 2000, pp. 389-398), which arises in the reconstruction of the peptide sequence of a protein molecule. We give a simple and efficient algorithm for the problem without using dynamic programming. The algorithm runs in time O(k log k), where k is the number of ions and is an improvement over the algorithm in Chen et al. (C) 2002 Elsevier Science (USA). All rights reserved.

Mapping of local electronic properties in nanostructured CMR thin films by Scanning Tunneling Microscopy (STM) and Local Conductance Map (LCMAP)

We have investigated the local electronic properties and the spatially resolved magnetoresistance of a nanostructured film of a colossal magnetoresistive (CMR) material by local conductance mapping (LCMAP) using a variable temperature Scanning Tunneling Microscope (STM) operating in a magnetic field. The nanostructured thin films (thickness ≈500nm) of the CMR material La0.67Sr0.33MnO3 (LSMO) on quartz substrates were prepared using chemical solution deposition (CSD) process. The CSD grown films were imaged by both STM and atomic force microscopy (AFM). Due to the presence of a large number of grain boundaries (GB's), these films show low field magnetoresistance (LFMR) which increases at lower temperatures. The measurement of spatially resolved electronic properties reveal the extent of variation of the density of states (DOS) at and close to the Fermi level (EF) across the grain boundaries and its role in the electrical resistance of the GB. Measurement of the local conductance maps (LCMAP) as a function of magnetic field as well as temperature reveals that the LFMR occurs at the GB. While it was known that LFMR in CMR films originates from the GB, this is the first investigation that maps the local electronic properties at a GB in a magnetic field and traces the origin of LFMR at the GB.