Prediction of separation factor in foam separation of proteins

A phenomenological model has been developed for predicting separation factors obtained in concentrating protein solutions using batch-foam columns. The model considers the adsorption of surface active proteins onto the air-water interface of bubbles, and drainage of liquid from the foam, which are the two predominant processes responsible for separation in foam columns. The model has been verified with data collected on casein and bovine serum albumin (BSA) solutions, for which adsorption isotherms are available in the literature. It has been found that an increase in liquid pool height above the gas distributor and the time allowed for drainage result in a better separation. Further, taller foam columns yield poorer separation at constant time of drainage. The model successfully predicts the observed results. (C) 1997 Elsevier Science Ltd.

The actor-critic algorithm as multi-time-scale stochastic approximation

The actor-critic algorithm of Barto and others for simulation-based optimization of Markov decision processes is cast as a two time Scale stochastic approximation. Convergence analysis, approximation issues and an example are studied.

Process-kinetics in facing targets sputtering of multi-component oxide thin films

The kinetics of the processes in facing targets sputtering of multicomponent oxide films is presented. The novel configuration of the process exhibits an enhanced ionization efficiency. Discharge diagnostics performed using optical emission spectroscopy revealed strong dependence of plasma parameters on process conditions. Numerical simulation based on thermalization and diffusion of sputtered atoms has been performed to estimate the transport efficiency in off-axis mode. Composition, structure and epitaxial quality of YBa2Cu3O7-x films prepared was found to be strongly dependent on atomic flux ratios (of Cu/Y and Ba/Y) arriving at the substrate, resputtering effect and phase stability of YBa2Cu3O7-x These studies have been shown to be useful in understanding the complex processes that occur in sputtering of multicomponent films. (C) 1999 Elsevier Science S.A. All rights reserved.

Modulation of Catalytic Activity in Multi-Domain Protein Tyrosine Phosphatases

Signaling mechanisms involving protein tyrosine phosphatases govern several cellular and developmental processes. These enzymes are regulated by several mechanisms which include variation in the catalytic turnover rate based on redox stimuli, subcellular localization or protein-protein interactions. In the case of Receptor Protein Tyrosine Phosphatases (RPTPs) containing two PTP domains, phosphatase activity is localized in their membrane-proximal (D1) domains, while the membrane-distal (D2) domain is believed to play a modulatory role. Here we report our analysis of the influence of the D2 domain on the catalytic activity and substrate specificity of the D1 domain using two Drosophila melanogaster RPTPs as a model system. Biochemical studies reveal contrasting roles for the D2 domain of Drosophila Leukocyte antigen Related (DLAR) and Protein Tyrosine Phosphatase on Drosophila chromosome band 99A (PTP99A). While D2 lowers the catalytic activity of the D1 domain in DLAR, the D2 domain of PTP99A leads to an increase in the catalytic activity of its D1 domain. Substrate specificity, on the other hand, is cumulative, whereby the individual specificities of the D1 and D2 domains contribute to the substrate specificity of these two-domain enzymes. Molecular dynamics simulations on structural models of DLAR and PTP99A reveal a conformational rationale for the experimental observations. These studies reveal that concerted structural changes mediate inter-domain communication resulting in either inhibitory or activating effects of the membrane distal PTP domain on the catalytic activity of the membrane proximal PTP domain.

An Online Actor-Critic Algorithm with Function Approximation for Constrained Markov Decision Processes

We develop an online actor-critic reinforcement learning algorithm with function approximation for a problem of control under inequality constraints. We consider the long-run average cost Markov decision process (MDP) framework in which both the objective and the constraint functions are suitable policy-dependent long-run averages of certain sample path functions. The Lagrange multiplier method is used to handle the inequality constraints. We prove the asymptotic almost sure convergence of our algorithm to a locally optimal solution. We also provide the results of numerical experiments on a problem of routing in a multi-stage queueing network with constraints on long-run average queue lengths. We observe that our algorithm exhibits good performance on this setting and converges to a feasible point.

Spacelike pion form factor from analytic continuation and the onset of perturbative QCD

The factorization theorem for exclusive processes in perturbative QCD predicts the behavior of the pion electromagnetic form factor F(t) at asymptotic spacelike momenta t(= -Q(2)) < 0. We address the question of the onset energy using a suitable mathematical framework of analytic continuation, which uses as input the phase of the form factor below the first inelastic threshold, known with great precision through the Fermi-Watson theorem from pi pi elastic scattering, and the modulus measured from threshold up to 3 GeV by the BABAR Collaboration. The method leads to almost model-independent upper and lower bounds on the spacelike form factor. Further inclusion of the value of the charge radius and the experimental value at -2.45 GeV2 measured at JLab considerably increases the strength of the bounds in the region Q(2) less than or similar to 10 GeV2, excluding the onset of the asymptotic perturbative QCD regime for Q(2) < 7 GeV2. We also compare the bounds with available experimental data and with several theoretical models proposed for the low and intermediate spacelike region.

Antibodies against the extracellular domain of human Notch1 receptor reveal the critical role of epidermal-growth-factor-like repeats 25-26 in ligand binding and receptor activation

The Notch signalling pathway is implicated in a wide variety of cellular processes throughout metazoan development. Although the downstream mechanism of Notch signalling has been extensively studied, the details of its ligand-mediated receptor activation are not clearly understood. Although the role of Notch ELRs EGF (epidermal growth factor)-like-repeats] 11-12 in ligand binding is known, recent studies have suggested interactions within different ELRs of the Notch receptor whose significance remains to be understood. Here, we report critical inter-domain interactions between human Notch1 ELRs 21-30 and the ELRs 11-15 that are modulated by calcium. Surface plasmon resonance analysis revealed that the interaction between ELRs 21-30 and ELRs 11-15 is similar to 10-fold stronger than that between ELRs 11-15 and the ligands. Although there was no interaction between Notch 1 ELRs 21-30 and the ligands in vitro, addition of pre-clustered Jagged1Fc resulted in the dissociation of the preformed complex between ELRs 21-30 and 11-15, suggesting that inter-domain interactions compete for ligand binding. Furthermore, the antibodies against ELRs 21-30 inhibited ligand binding to the full-length Notch1 and subsequent receptor activation, with the antibodies against ELRs 25-26 being the most effective. These results suggest that the ELRs 25-26 represent a cryptic ligand-binding site which becomes exposed only upon the presence of the ligand. Thus, using specific antibodies against various domains of the Notch1 receptor, we demonstrate that, although ELRs 11-12 are the principal ligand-binding site, the ELRs 25-26 serve as a secondary binding site and play an important role in receptor activation.

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.

Multi-objective optimization of satellite image registration using discrete Pparticle swarm optimisation

A new multi-sensor image registration technique is proposed based on detecting the feature corner points using modified Harris Corner Detector (HDC). These feature points are matched using multi-objective optimization (distance condition and angle criterion) based on Discrete Particle Swarm Optimization (DPSO). This optimization process is more efficient as it considers both the distance and angle criteria to incorporate multi-objective switching in the fitness function. This optimization process helps in picking up three corresponding corner points detected in the sensed and base image and thereby using the affine transformation, the sensed image is aligned with the base image. Further, the results show that the new approach can provide a new dimension in solving multi-sensor image registration problems. From the obtained results, the performance of image registration is evaluated and is concluded that the proposed approach is efficient.

Mycobacterium tuberculosis RsdA provides a conformational rationale for selective regulation of sigma-factor activity by proteolysis

The relative levels of different sigma factors dictate the expression profile of a bacterium. Extracytoplasmic function sigma factors synchronize the transcriptional profile with environmental conditions. The cellular concentration of free extracytoplasmic function sigma factors is regulated by the localization of this protein in a sigma/anti-sigma complex. Anti-sigma factors are multi-domain proteins with a receptor to sense environmental stimuli and a conserved anti-sigma domain (ASD) that binds a sigma factor. Here we describe the structure of Mycobacterium tuberculosis anti-sigma(D) (RsdA) in complex with the -35 promoter binding domain of sigma(D) (sigma(D)(4)). We note distinct conformational features that enable the release of sigma(D) by the selective proteolysis of the ASD in RsdA. The structural and biochemical features of the sigma(D)/RsdA complex provide a basis to reconcile diverse regulatory mechanisms that govern sigma/anti-sigma interactions despite high overall structural similarity. Multiple regulatory mechanisms embedded in an ASD scaffold thus provide an elegant route to rapidly re-engineer the expression profile of a bacterium in response to an environmental stimulus.

A novel Q-learning algorithm with function approximation for constrained Markov decision processes

We present a novel multi-timescale Q-learning algorithm for average cost control in a Markov decision process subject to multiple inequality constraints. We formulate a relaxed version of this problem through the Lagrange multiplier method. Our algorithm is different from Q-learning in that it updates two parameters - a Q-value parameter and a policy parameter. The Q-value parameter is updated on a slower time scale as compared to the policy parameter. Whereas Q-learning with function approximation can diverge in some cases, our algorithm is seen to be convergent as a result of the aforementioned timescale separation. We show the results of experiments on a problem of constrained routing in a multistage queueing network. Our algorithm is seen to exhibit good performance and the various inequality constraints are seen to be satisfied upon convergence of the algorithm.

Support vector clustering-based direct coherency identification of generators in a multi-machine power system

This study investigates the application of support vector clustering (SVC) for the direct identification of coherent synchronous generators in large interconnected multi-machine power systems. The clustering is based on coherency measure, which indicates the degree of coherency between any pair of generators. The proposed SVC algorithm processes the coherency measure matrix that is formulated using the generator rotor measurements to cluster the coherent generators. The proposed approach is demonstrated on IEEE 10 generator 39-bus system and an equivalent 35 generators, 246-bus system of practical Indian southern grid. The effect of number of data samples and fault locations are also examined for determining the accuracy of the proposed approach. An extended comparison with other clustering techniques is also included, to show the effectiveness of the proposed approach in grouping the data into coherent groups of generators. This effectiveness of the coherent clusters obtained with the proposed approach is compared in terms of a set of clustering validity indicators and in terms of statistical assessment that is based on the coherency degree of a generator pair.

Automatic Data Allocation and Buffer Management for Multi-GPU Machines

Multi-GPU machines are being increasingly used in high-performance computing. Each GPU in such a machine has its own memory and does not share the address space either with the host CPU or other GPUs. Hence, applications utilizing multiple GPUs have to manually allocate and manage data on each GPU. Existing works that propose to automate data allocations for GPUs have limitations and inefficiencies in terms of allocation sizes, exploiting reuse, transfer costs, and scalability. We propose a scalable and fully automatic data allocation and buffer management scheme for affine loop nests on multi-GPU machines. We call it the Bounding-Box-based Memory Manager (BBMM). BBMM can perform at runtime, during standard set operations like union, intersection, and difference, finding subset and superset relations on hyperrectangular regions of array data (bounding boxes). It uses these operations along with some compiler assistance to identify, allocate, and manage data required by applications in terms of disjoint bounding boxes. This allows it to (1) allocate exactly or nearly as much data as is required by computations running on each GPU, (2) efficiently track buffer allocations and hence maximize data reuse across tiles and minimize data transfer overhead, and (3) and as a result, maximize utilization of the combined memory on multi-GPU machines. BBMM can work with any choice of parallelizing transformations, computation placement, and scheduling schemes, whether static or dynamic. Experiments run on a four-GPU machine with various scientific programs showed that BBMM reduces data allocations on each GPU by up to 75% compared to current allocation schemes, yields performance of at least 88% of manually written code, and allows excellent weak scaling.

Accurate point matching based on multi-objective Genetic Algorithm for multi-sensor satellite imagery

This paper investigates a novel approach for point matching of multi-sensor satellite imagery. The feature (corner) points extracted using an improved version of the Harris Corner Detector (HCD) is matched using multi-objective optimization based on a Genetic Algorithm (GA). An objective switching approach to optimization that incorporates an angle criterion, distance condition and point matching condition in the multi-objective fitness function is applied to match corresponding corner-points between the reference image and the sensed image. The matched points obtained in this way are used to align the sensed image with a reference image by applying an affine transformation. From the results obtained, the performance of the image registration is evaluated and compared with existing methods, namely Nearest Neighbor-Random SAmple Consensus (NN-Ran-SAC) and multi-objective Discrete Particle Swarm Optimization (DPSO). From the performed experiments it can be concluded that the proposed approach is an accurate method for registration of multi-sensor satellite imagery. (C) 2014 Elsevier Inc. All rights reserved.

Computational framework to integrate the effect of antigen recognition on disease epidemiology outcome: multi-scale approach

Human Leukocyte Antigen (HLA) plays an important role, in presenting foreign pathogens to our immune system, there by eliciting early immune responses. HLA genes are highly polymorphic, giving rise to diverse antigen presentation capability. An important factor contributing to enormous variations in individual responses to diseases is differences in their HLA profiles. The heterogeneity in allele specific disease responses decides the overall disease epidemiological outcome. Here we propose an agent based computational framework, capable of incorporating allele specific information, to analyze disease epidemiology. This framework assumes a SIR model to estimate average disease transmission and recovery rate. Using epitope prediction tool, it performs sequence based epitope detection for a given the pathogenic genome and derives an allele specific disease susceptibility index depending on the epitope detection efficiency. The allele specific disease transmission rate, that follows, is then fed to the agent based epidemiology model, to analyze the disease outcome. The methodology presented here has a potential use in understanding how a disease spreads and effective measures to control the disease.