NMR Analysis of Cross Strand Aromatic Interactions in an 8 Residue Hairpin and a 14 Residue Three Stranded beta-Sheet Peptide

Cross strand aromatic interactions between a facing pair of phenylalanine residues in antiparallel beta-sheet structures have been probed using two structurally defined model peptides. The octapeptide Boc-(LFVPPLFV)-P-D-P-L-OMe (peptide 1) favors the beta-hairpin conformation nucleated by the type II' beta-turn formed by the (D)Pro-(L)Pro segment, placing Phe2 and Phe7 side chains in proximity. Two centrally positioned (D)Pro-(L)Pro segments facilitate the three stranded beta-sheet formation in the 14 residue peptide Boc-LFV(D)P(L)PLFVA(D)P(L)PLFV-OMe (peptide 2) in which the Phe2/Phe7 orientations are similar to that in the octapeptide. The anticipated folded conformations of peptides 1 and 2 are established by the delineation of intramolecularly hydrogen bonded NH groups and by the observation of specific cross strand NOEs. The observation of ring current shifted aromatic protons is a diagnostic of close approach of the Phe2 and Phe7 side chains. Specific assignment of aromatic proton resonances using HSQC and HSQC-TOCSY methods allow an analysis of interproton NOEs between the spatially proximate aromatic rings. This approach facilitates specific assignments in systems containing multiple aromatic rings in spectra at natural abundance. Evidence is presented for a dynamic process which invokes a correlated conformational change about the C-alpha-C-beta(chi(1)) bond for the pair of interacting Phe residues. NMR results suggest that aromatic ring orientations observed in crystals are maintained in solution. Anomalous temperature dependence of ring current induced proton chemical shifts suggests that solvophobic effects may facilitate aromatic ring clustering in apolar solvents.

A smart approach to precision attitude maneuvers of spacecrafts

A nonlinear adaptive approach is presented to achieve rest-to-rest attitude maneuvers for spacecrafts in the presence of parameter uncertainties and unknown disturbances. A nonlinear controller, designed on the principle of dynamic inversion achieves the goals for the nominal model but suffers performance degradation in the presence of off-nominal parameter values and unwanted inputs. To address this issue, a model-following neuro-adaptive control design is carried out by taking the help of neural networks. Due to the structured approach followed here, the adaptation is restricted to the momentum level equations.The adaptive technique presented is computationally nonintensive and hence can be implemented in real-time. Because of these features, this new approach is named as structured model-following adaptive real-time technique (SMART). From simulation studies, this SMART approach is found to be very effective in achieving precision attitude maneuvers in the presence of parameter uncertainties and unknown disturbances.

Electrochemisorption - A Cluster Approach

A simple semiempirical quantum chemical approach (Extended Huckel Theory) is shown to give a reasonable description of the electronic structural aspects of chemisorption on the mercury model surface. Chemisorptive interaction of alkali metal atoms and cations, halogen atoms and anions, and water molecules with a charge-neutralized hexagonal close-packed cluster of seven Hg atoms is studied. Adsorption of H, C, N and O atoms on the same model cluster is studied for comparison with earlier work. Chemisorption energies, charge transfer, interaction distance and hydration effects are discussed and compared with experimental results where available.

Neural network approach for fault location in unbalanced distribution networks with limited measurements

This paper presents an Artificial Neural Network (ANN) approach for locating faults in distribution systems. Different from the traditional Fault Section Estimation methods, the proposed approach uses only limited measurements. Faults are located according to the impedances of their path using a Feed Forward Neural Networks (FFNN). Various practical situations in distribution systems, such as protective devices placed only at the substation, limited measurements available, various types of faults viz., three-phase, line (a, b, c) to ground, line to line (a-b, b-c, c-a) and line to line to ground (a-b-g, b-c-g, c-a-g) faults and a wide range of varying short circuit levels at substation, are considered for studies. A typical IEEE 34 bus practical distribution system with unbalanced loads and with three- and single- phase laterals and a 69 node test feeder with different configurations are considered for studies. The results presented show that the proposed approach of fault location gives close to accurate results in terms of the estimated fault location.

Guessing Revisited: A Large Deviations Approach

The problem of guessing a random string is revisited. A close relation between guessing and compression is first established. Then it is shown that if the sequence of distributions of the information spectrum satisfies the large deviation property with a certain rate function, then the limiting guessing exponent exists and is a scalar multiple of the Legendre-Fenchel dual of the rate function. Other sufficient conditions related to certain continuity properties of the information spectrum are briefly discussed. This approach highlights the importance of the information spectrum in determining the limiting guessing exponent. All known prior results are then re-derived as example applications of our unifying approach.

Direction of arrival estimation in the presence of distributed noise sources: Cumulant based approach

In the past few years there have been attempts to develop subspace methods for DoA (direction of arrival) estimation using a fourth?order cumulant which is known to de?emphasize Gaussian background noise. To gauge the relative performance of the cumulant MUSIC (MUltiple SIgnal Classification) (c?MUSIC) and the standard MUSIC, based on the covariance function, an extensive numerical study has been carried out, where a narrow?band signal source has been considered and Gaussian noise sources, which produce a spatially correlated background noise, have been distributed. These simulations indicate that, even though the cumulant approach is capable of de?emphasizing the Gaussian noise, both bias and variance of the DoA estimates are higher than those for MUSIC. To achieve comparable results the cumulant approach requires much larger data, three to ten times that for MUSIC, depending upon the number of sources and how close they are. This is attributed to the fact that in the estimation of the cumulant, an average of a product of four random variables is needed to make an evaluation. Therefore, compared to those in the evaluation of the covariance function, there are more cross terms which do not go to zero unless the data length is very large. It is felt that these cross terms contribute to the large bias and variance observed in c?MUSIC. However, the ability to de?emphasize Gaussian noise, white or colored, is of great significance since the standard MUSIC fails when there is colored background noise. Through simulation it is shown that c?MUSIC does yield good results, but only at the cost of more data.

Uniform algebras generated by holomorphic and close-to-harmonic functions

The initial motivation for this paper is to discuss a more concrete approach to an approximation theorem of Axler and Shields, which says that the uniform algebra on the closed unit disc (D) over bar generated by z and h, where h is a nowhere-holomorphic harmonic function on D that is continuous up to partial derivative D, equals C((D) over bar). The abstract tools used by Axler and Shields make harmonicity of h an essential condition for their result. We use the concepts of plurisubharmonicity and polynomial convexity to show that, in fact, the same conclusion is reached if h is replaced by h + R, where R is a non-harmonic perturbation whose Laplacian is ``small'' in a certain sense.

Stream-Close: Fast mining of Closed Frequent Itemsets in high speed data streams

With the emergence of large-volume and high-speed streaming data, the recent techniques for stream mining of CFIpsilas (closed frequent itemsets) will become inefficient. When concept drift occurs at a slow rate in high speed data streams, the rate of change of information across different sliding windows will be negligible. So, the user wonpsilat be devoid of change in information if we slide window by multiple transactions at a time. Therefore, we propose a novel approach for mining CFIpsilas cumulatively by making sliding width(ges1) over high speed data streams. However, it is nontrivial to mine CFIpsilas cumulatively over stream, because such growth may lead to the generation of exponential number of candidates for closure checking. In this study, we develop an efficient algorithm, stream-close, for mining CFIpsilas over stream by exploring some interesting properties. Our performance study reveals that stream-close achieves good scalability and has promising results.

Generalization of the collision cone approach for motion safety in 3-D environments

Avoidance of collision between moving objects in a 3-D environment is fundamental to the problem of planning safe trajectories in dynamic environments. This problem appears in several diverse fields including robotics, air vehicles, underwater vehicles and computer animation. Most of the existing literature on collision prediction assumes objects to be modelled as spheres. While the conservative spherical bounding box is valid in many cases, in many other cases, where objects operate in close proximity, a less conservative approach, that allows objects to be modelled using analytic surfaces that closely mimic the shape of the object, is more desirable. In this paper, a collision cone approach (previously developed only for objects moving on a plane) is used to determine collision between objects, moving in 3-D space, whose shapes can be modelled by general quadric surfaces. Exact collision conditions for such quadric surfaces are obtained and used to derive dynamic inversion based avoidance strategies.

Deorphanization of Malonyl CoA:ACP Transacylase Drug Target in Plasmodium falciparum (PfFabD) Using Bacterial Antagonists: A Piggyback' Approach for Antimalarial Drug Discovery

Quest for new drug targets in Plasmodium sp. has underscored malonyl CoA:ACP transacylase (PfFabD) of fatty acid biosynthetic pathway in apicoplast. In this study, a piggyback approach was employed for the receptor deorphanization using inhibitors of bacterial FabD enzymes. Due to the lack of crystal structure, theoretical model was constructed using the structural details of homologous enzymes. Sequence and structure analysis has localized the presence of two conserved pentapeptide motifs: GQGXG and GXSXG and five key invariant residues viz., Gln109, Ser193, Arg218, His305 and Gln354 characteristic of FabD enzyme. Active site mapping of PfFabD using substrate molecules has disclosed the spatial arrangement of key residues in the cavity. As structurally similar molecules exhibit similar biological activities, signature pharmacophore fingerprints of FabD antagonists were generated using 0D-3D descriptors for molecular similarity-based cluster analysis and to correlate with their binding profiles. It was observed that antagonists showing good geometrical fitness score were grouped in cluster-1, whereas those exhibiting high binding affinities in cluster-2. This study proves important to shed light on the active site environment to reveal the hotspot for binding with higher affinity and to narrow down the virtual screening process by searching for close neighbors of the active compounds.

An efficient hybrid approach for design of automotive wheel bearings

Wheel bearings play a crucial role in the mobility of a vehicle by minimizing motive power loss and providing stability in cornering maneuvers. Detailed engineering analysis of a wheel bearing subsystem under dynamic conditions poses enormous challenges due to the nonlinearity of the problem caused by multiple factional contacts between rotating and stationary parts and difficulties in prediction of dynamic loads that wheels are subject to. Commonly used design methodologies are based on equivalent static analysis of ball or roller bearings in which the latter elements may even be represented with springs. In the present study, an advanced hybrid approach is suggested for realistic dynamic analysis of wheel bearings by combining lumped parameter and finite element modeling techniques. A validated lumped parameter representation serves as an efficient tool for the prediction of radial wheel load due to ground reaction which is then used in detailed finite element analysis that automatically accounts for contact forces in an explicit formulation.

Dislocation dynamical approach to force fluctuations in nanoindentation experiments

We develop an approach that combines the power of nonlinear dynamics with the evolution equations for the mobile and immobile dislocation densities and force to explain force fluctuations in nanoindentation experiments. The model includes nucleation, multiplication, and propagation thresholds for mobile dislocations, and other well known dislocation transformation mechanisms. The model predicts all the generic features of nanoindentation such as the Hertzian elastic branch followed by several force drops of decreasing magnitudes, and residual plasticity after unloading. The stress corresponding to the elastic force maximum is close to the yield stress of an ideal solid. The predicted values for all the quantities are close to those reported by experiments. Our model allows us to address the indentation-size effect including the ambiguity in defining the hardness in the force drop dominated regime. At large indentation depths, the hardness remains nearly constant with a marginal decreasing trend.

Precoding-Based Network Alignment Using Transform Approach for Acyclic Networks With Delay

The algebraic formulation for linear network coding in acyclic networks with the links having integer delay is well known. Based on this formulation, for a given set of connections over an arbitrary acyclic network with integer delay assumed for the links, the output symbols at the sink nodes, at any given time instant, is a F(p)m-linear combination of the input symbols across different generations, where F(p)m denotes the field over which the network operates (p is prime and m is a positive integer). We use finite-field discrete Fourier transform to convert the output symbols at the sink nodes, at any given time instant, into a F(p)m-linear combination of the input symbols generated during the same generation without making use of memory at the intermediate nodes. We call this as transforming the acyclic network with delay into n-instantaneous networks (n is sufficiently large). We show that under certain conditions, there exists a network code satisfying sink demands in the usual (nontransform) approach if and only if there exists a network code satisfying sink demands in the transform approach. When the zero-interference conditions are not satisfied, we propose three precoding-based network alignment (PBNA) schemes for three-source three-destination multiple unicast network with delays (3-S 3-D MUN-D) termed as PBNA using transform approach and time-invariant local encoding coefficients (LECs), PBNA using time-varying LECs, and PBNA using transform approach and block time-varying LECs. We derive sets of necessary and sufficient conditions under which throughputs close to n' + 1/2n' + 1, n'/2n' + 1, and n'/2n' + 1 are achieved for the three source-destination pairs in a 3-S 3-D MUN-D employing PBNA using transform approach and time-invariant LECs, and PBNA using transform approach and block time-varying LECs, where n' is a positive integer. For PBNA using time-varying LECs, we obtain a sufficient condition under which a throughput demand of n(1)/n, n(2)/n, and n(3)/n can be met for the three source-destination pairs in a 3-S 3-D MUN-D, where n(1), n(2), and n(3) are positive integers less than or equal to the positive integer n. This condition is also necessary when n(1) + n(3) = n(1) + n(2) = n where n(1) >= n(2) >= n(3).

Estimation of `drainable' storage - A geomorphological approach

Storage of water within a river basin is often estimated by analyzing recession flow curves as it cannot be `instantly' estimated with the aid of available technologies. In this study we explicitly deal with the issue of estimation of `drainable' storage, which is equal to the area under the `complete' recession flow curve (i.e. a discharge vs. time curve where discharge continuously decreases till it approaches zero). But a major challenge in this regard is that recession curves are rarely `complete' due to short inter-storm time intervals. Therefore, it is essential to analyze and model recession flows meaningfully. We adopt the wellknown Brutsaert and Nieber analytical method that expresses time derivative of discharge (dQ/dt) as a power law function of Q : -dQ/dt = kQ(alpha). However, the problem with dQ/dt-Q analysis is that it is not suitable for late recession flows. Traditional studies often compute alpha considering early recession flows and assume that its value is constant for the whole recession event. But this approach gives unrealistic results when alpha >= 2, a common case. We address this issue here by using the recently proposed geomorphological recession flow model (GRFM) that exploits the dynamics of active drainage networks. According to the model, alpha is close to 2 for early recession flows and 0 for late recession flows. We then derive a simple expression for drainable storage in terms the power law coefficient k, obtained by considering early recession flows only, and basin area. Using 121 complete recession curves from 27 USGS basins we show that predicted drainable storage matches well with observed drainable storage, indicating that the model can also reliably estimate drainable storage for `incomplete' recession events to address many challenges related to water resources. (C) 2014 Elsevier Ltd. All rights reserved.

An integrated estimation/guidance approach for seeker-less interceptors

This paper addresses the problem of intercepting highly maneuverable threats using seeker-less interceptors that operate in the command guidance mode. These systems are more prone to estimation errors than standard seeker-based systems. In this paper, an integrated estimation/guidance (IEG) algorithm, which combines interactive multiple model (IMM) estimator with differential game guidance law (DGL), is proposed for seeker-less interception. In this interception scenario, the target performs an evasive bang-bang maneuver, while the sensor has noisy measurements and the interceptor is subject to acceleration bound. The IMM serves as a basis for the synthesis of efficient filters for tracking maneuvering targets and reducing estimation errors. The proposed game-based guidance law for two-dimensional interception, later extended to three-dimensional interception scenarios, is used to improve the endgame performance of the command-guided seeker-less interceptor. The IMM scheme and an optimal selection of filters, to cater to various maneuvers that are expected during the endgame, are also described. Furthermore, a chatter removal algorithm is introduced, thus modifying the differential game guidance law (modified DGL). A comparison between modified DGL guidance law and conventional proportional navigation guidance law demonstrates significant improvement in miss distance in a pursuer-evader scenario. Simulation results are also presented for varying flight path angle errors. A numerical study is provided which demonstrates the performance of the combined interactive multiple model with game-based guidance law (IMM/DGL). Simulation study is also carried out for combined IMM and modified DGL (IMM/modified DGL) which exhibits the superior performance and viability of the algorithm reducing the chattering phenomenon. The results are illustrated by an extensive Monte Carlo simulation study in the presence of estimation errors.