Erythrocyte-binding studies on an acidic lectin from winged bean (Psophocarpus tetragonolobus)

n acidic lectin (WBA II) was isolated to homogeneity from the crude seed extract of the winged bean (Psophocarpus tetragonolobus) by affinity chromatography on lactosylaminoethyl-Bio-Gel. Binding of WBA II to human erythrocytes of type-A, -B and -O blood groups showed the presence of 10(5) receptors/cell, with high association constants (10(6)-10(8) M-1). Competitive binding studies with blood-group-specific lectins reveal that WBA II binds to H- and T-antigenic determinants on human erythrocytes. Affinity-chromatographic studies using A-, B-, H- and T-antigenic determinants coupled to an insoluble matrix confirm the specificity of WBA II towards H- and T-antigenic determinants. Inhibition of the binding of WBA II by various sugars show that N-acetylgalactosamine and T-antigenic disaccharide (Thomsen-Friedenreich antigen, Gal beta 1-3GalNAc) are the most potent mono- and di-saccharide inhibitors respectively. In addition, inhibition of the binding of WBA II to erythrocytes by dog intestine H-fucolipid prove that the lectin binds to H-antigenic determinant.

Self-regularized pseudo time-marching schemes for structural system identification with static measurements

We explore the application of pseudo time marching schemes, involving either deterministic integration or stochastic filtering, to solve the inverse problem of parameter identification of large dimensional structural systems from partial and noisy measurements of strictly static response. Solutions of such non-linear inverse problems could provide useful local stiffness variations and do not have to confront modeling uncertainties in damping, an important, yet inadequately understood, aspect in dynamic system identification problems. The usual method of least-square solution is through a regularized Gauss-Newton method (GNM) whose results are known to be sensitively dependent on the regularization parameter and data noise intensity. Finite time,recursive integration of the pseudo-dynamical GNM (PD-GNM) update equation addresses the major numerical difficulty associated with the near-zero singular values of the linearized operator and gives results that are not sensitive to the time step of integration. Therefore, we also propose a pseudo-dynamic stochastic filtering approach for the same problem using a parsimonious representation of states and specifically solve the linearized filtering equations through a pseudo-dynamic ensemble Kalman filter (PD-EnKF). For multiple sets of measurements involving various load cases, we expedite the speed of thePD-EnKF by proposing an inner iteration within every time step. Results using the pseudo-dynamic strategy obtained through PD-EnKF and recursive integration are compared with those from the conventional GNM, which prove that the PD-EnKF is the best performer showing little sensitivity to process noise covariance and yielding reconstructions with less artifacts even when the ensemble size is small.

Self-regularized pseudo time-marching schemes for structural system identification with static measurements

We explore the application of pseudo time marching schemes, involving either deterministic integration or stochastic filtering, to solve the inverse problem of parameter identification of large dimensional structural systems from partial and noisy measurements of strictly static response. Solutions of such non-linear inverse problems could provide useful local stiffness variations and do not have to confront modeling uncertainties in damping, an important, yet inadequately understood, aspect in dynamic system identification problems. The usual method of least-square solution is through a regularized Gauss-Newton method (GNM) whose results are known to be sensitively dependent on the regularization parameter and data noise intensity. Finite time, recursive integration of the pseudo-dynamical GNM (PD-GNM) update equation addresses the major numerical difficulty associated with the near-zero singular values of the linearized operator and gives results that are not sensitive to the time step of integration. Therefore, we also propose a pseudo-dynamic stochastic filtering approach for the same problem using a parsimonious representation of states and specifically solve the linearized filtering equations through apseudo-dynamic ensemble Kalman filter (PD-EnKF). For multiple sets ofmeasurements involving various load cases, we expedite the speed of the PD-EnKF by proposing an inner iteration within every time step. Results using the pseudo-dynamic strategy obtained through PD-EnKF and recursive integration are compared with those from the conventional GNM, which prove that the PD-EnKF is the best performer showing little sensitivity to process noise covariance and yielding reconstructions with less artifacts even when the ensemble size is small. Copyright (C) 2009 John Wiley & Sons, Ltd.

Use of Abel integral equations in water wave scattering by two surface-piercing barriers

In this paper the classical problem of water wave scattering by two partially immersed plane vertical barriers submerged in deep water up to the same depth is investigated. This problem has an exact but complicated solution and an approximate solution in the literature of linearised theory of water waves. Using the Havelock expansion for the water wave potential, the problem is reduced here to solving Abel integral equations having exact solutions. Utilising these solutions,two sets of expressions for the reflection and transmission coefficients are obtained in closed forms in terms of computable integrals in contrast to the results given in the literature which,involved six complicated integrals in terms of elliptic functions. The two different expressions for each coefficient produce almost the same numerical results although it has not been possible to prove their equivalence analytically. The reflection coefficient is depicted against the wave number in a number of figures which almost coincide with the figures available in the literature wherein the problem was solved approximately by employing complementary approximations. (C) 2009 Elsevier B.V. All rights reserved.

Equivalence conditions for classes of linear and non-linear distributed parameter systems

Equivalence of certain classes of second-order non-linear distributed parameter systems and corresponding linear third-order systems is established through a differential transformation technique. As linear systems are amenable to analysis through existing techniques, this study is expected to offer a method of tackling certain classes of non-linear problems which may otherwise prove to be formidable in nature.

Approximation of solutions to fractional integral equation

In this paper we shall study a fractional integral equation in an arbitrary Banach space X. We used the analytic semigroups theory of linear operators and the fixed point method to establish the existence and uniqueness of solutions of the given problem. We also prove the existence of global solution. The existence and convergence of the Faedo–Galerkin solution to the given problem is also proved in a separable Hilbert space with some additional assumptions on the operator A. Finally we give an example to illustrate the applications of the abstract results.

Dual-Drug Delivery System Based on In Situ Gel-Forming Nanosuspension of Forskolin to Enhance Antiglaucoma Efficacy

The present study was designed to improve the bioavailability of forskolin by the influence of precorneal residence time and dissolution characteristics. Nanosizing is an advanced approach to overcome the issue of poor aqueous solubility of active pharmaceutical ingredients. Forskolin nanocrystals have been successfully manufactured and stabilized by poloxamer 407. These nanocrystals have been characterized in terms of particle size by scanning electron microscopy and dynamic light scattering. By formulating Noveon AA-1 polycarbophil/poloxamer 407 platforms, at specific concentrations, it was possible to obtain a pH and thermoreversible gel with a pH(gel)/T-gel close to eye pH/temperature. The addition of forskolin nanocrystals did not alter the gelation properties of Noveon AA-1 polycarbophil/poloxamer 407 and nanocrystal properties of forskolin. The formulation was stable over a period of 6 months at room temperature. In vitro release experiments indicated that the optimized platform was able to prolong and control forskolin release for more than 5 h. The in vivo studies on dexamethasone-induced glaucomatous rabbits indicated that the intraocular pressure lowering efficacy for nanosuspension/hydrogel systems was 31% and lasted for 12 h, which is significantly better than the effect of traditional eye suspension (18%, 4-6 h). Hence, our investigations successfully prove that the pH and thermoreversible polymeric in situ gel-forming nanosuspension with ability of controlled drug release exhibits a greater potential for glaucoma therapy.

Single-File Diffusion of Water Inside Narrow Carbon Nanorings

We use atomistic molecular dynamics (MD) simulations to study the diffusion of water molecules confined inside narrow (6,6) carbon nanorings. The water molecules form two oppositely polarized chains. It is shown that the effective interaction between these two chains is repulsive in nature. The computed mean-squared displacement (MSD) clearly shows a scaling with time similar to t(1/2), which is consistent with single-file diffusion (SFD). The time up to which the water molecules undergo SFD is shown to be the lifetime of the water molecules inside these chains. Simulations of "uncharged" water molecules inside the nanoring show the formation of several water chains and yield SFD. These observations conclusively prove that the diffusion is Fickian when there is a single chain of water and SFD is observed only when two or more chains are present.

On the compactness of isometry groups in complex analysis

We prove that the group of continuous isometries for the Kobayashi or Caratheodory metrics of a strongly convex domain in C-n is compact unless the domain is biholomorphic to the ball. A key ingredient, proved using differential geometric ideas, is that a continuous isometry between a strongly convex domain and the ball has to be biholomorphic or anti-biholomorphic. Combining this with a metric version of Pinchuk's rescaling technique gives the main result.

A new class of separators and planarity of chordal graphs

We introduce a new class of clique separators, called base sets, for chordal graphs. Base sets of a chordal graph closely reflect its structure. We show that the notion of base sets leads to structural characterizations of planar k-trees and planar chordal graphs. Using these characterizations, we develop linear time algorithms for recognizing planar k-trees and planar chordal graphs. These algorithms are extensions of the Lexicographic_Breadth_First_Search algorithm for recognizing chordal graphs and are much simpler than the general planarity checking algorithm. Further, we use the notion of base sets to prove the equivalence of hamiltonian 2-trees and maximal outerplanar graphs.

GAP-RBF based NR image quality measurement for JPEG coded images

In this paper, we present a growing and pruning radial basis function based no-reference (NR) image quality model for JPEG-coded images. The quality of the images are estimated without referring to their original images. The features for predicting the perceived image quality are extracted by considering key human visual sensitivity factors such as edge amplitude, edge length, background activity and background luminance. Image quality estimation involves computation of functional relationship between HVS features and subjective test scores. Here, the problem of quality estimation is transformed to a function approximation problem and solved using GAP-RBF network. GAP-RBF network uses sequential learning algorithm to approximate the functional relationship. The computational complexity and memory requirement are less in GAP-RBF algorithm compared to other batch learning algorithms. Also, the GAP-RBF algorithm finds a compact image quality model and does not require retraining when the new image samples are presented. Experimental results prove that the GAP-RBF image quality model does emulate the mean opinion score (MOS). The subjective test results of the proposed metric are compared with JPEG no-reference image quality index as well as full-reference structural similarity image quality index and it is observed to outperform both.

A new scheme for establishing pairwise keys for wireless sensor networks

This paper addresses the problem of secure path key establishment in wireless sensor networks that uses the random key predistribution technique. Inspired by the recent proxy-based scheme in [1] and [2], we introduce a fiiend-based scheme for establishing pairwise keys securely. We show that the chances of finding friends in a neighbourhood are considerably more than that of finding proxies, leading to lower communication overhead. Further, we prove that the friendbased scheme performs better than the proxy-based scheme in terms of resilience against node capture.

Explicit Construction of Optimal Exact Regenerating Codes for Distributed Storage

Erasure coding techniques are used to increase the reliability of distributed storage systems while minimizing storage overhead. Also of interest is minimization of the bandwidth required to repair the system following a node failure. In a recent paper, Wu et al. characterize the tradeoff between the repair bandwidth and the amount of data stored per node. They also prove the existence of regenerating codes that achieve this tradeoff. In this paper, we introduce Exact Regenerating Codes, which are regenerating codes possessing the additional property of being able to duplicate the data stored at a failed node. Such codes require low processing and communication overheads, making the system practical and easy to maintain. Explicit construction of exact regenerating codes is provided for the minimum bandwidth point on the storage-repair bandwidth tradeoff, relevant to distributed-mail-server applications. A sub-space based approach is provided and shown to yield necessary and sufficient conditions on a linear code to possess the exact regeneration property as well as prove the uniqueness of our construction. Also included in the paper, is an explicit construction of regenerating codes for the minimum storage point for parameters relevant to storage in peer-to-peer systems. This construction supports a variable number of nodes and can handle multiple, simultaneous node failures. All constructions given in the paper are of low complexity, requiring low field size in particular.

Triangular Ising antiferromagnet in a staggered field

We study the equilibrium properties of the nearest-neighbor Ising antiferromagnet on a triangular lattice in the presence of a staggered field conjugate to one of the degenerate ground states. Using a mapping of the ground states of the model without the staggered field to dimer coverings on the dual lattice, we classify the ground states into sectors specified by the number of "strings." We show that the effect of the staggered field is to generate long-range interactions between strings. In the limiting case of the antiferromagnetic coupling constant J becoming infinitely large, we prove the existence of a phase transition in this system and obtain a finite lower bound for the transition temperature. For finite J, we study the equilibrium properties of the system using Monte Carlo simulations with three different dynamics. We find that in all the three cases, equilibration times for low-field values increase rapidly with system size at low temperatures. Due to this difficulty in equilibrating sufficiently large systems at low temperatures, our finite-size scaling analysis of the numerical results does not permit a definite conclusion about the existence of st phase transition for finite values of J. A surprising feature in the system is the fact that unlike usual glassy systems; a zero-temperature quench almost always leads to the ground state, while a slow cooling does not.

Coding for Two-User Gaussian MAC with PSK and PAM Signal Sets

Constellation Constrained (CC) capacity regions of a two-user Gaussian Multiple Access Channel(GMAC) have been recently reported. For such a channel, code pairs based on trellis coded modulation are proposed in this paper with MPSK and M-PAM alphabet pairs, for arbitrary values of M,toachieve sum rates close to the CC sum capacity of the GMAC. In particular, the structure of the sum alphabets of M-PSK and M-PAMmalphabet pairs are exploited to prove that, for certain angles of rotation between the alphabets, Ungerboeck labelling on the trellis of each user maximizes the guaranteed squared Euclidean distance of the sum trellis. Hence, such a labelling scheme can be used systematically,to construct trellis code pairs to achieve sum rates close to the CC sum capacity. More importantly, it is shown for the first time that ML decoding complexity at the destination is significantly reduced when M-PAM alphabet pairs are employed with almost no loss in the sum capacity.