Families of asymptotic tensile crack tip stress fields in elastic-perfectly plastic single crystals

In this work, two families of asymptotic near-tip stress fields are constructed in an elastic-ideally plastic FCC single crystal under mode I plane strain conditions. A crack is taken to lie on the (010) plane and its front is aligned along the [(1) over bar 01] direction. Finite element analysis is first used to systematically examine the stress distributions corresponding to different constraint levels. The general framework developed by Rice (Mech Mater 6:317-335, 1987) and Drugan (J Mech Phys Solids 49:2155-2176, 2001) is then adopted to generate low triaxiality solutions by introducing an elastic sector near the crack tip. The two families of stress fields are parameterized by the normalized opening stress (tau(A)(22)/tau(o)) prevailing in the plastic sector in front of the tip and by the coordinates of a point where elastic unloading commences in stress space. It is found that the angular stress variations obtained from the analytical solutions show good agreement with finite element analysis.

Two new families of low-correlation interleaved QAM sequence

Two families of low correlation QAM sequences are presented here. In a CDMA setting, these sequences have the ability to transport a large amount of data as well as enable variable-rate signaling on the reverse link. The first family Á2SQ - B2− is constructed by interleaving 2 selected QAM sequences. This family is defined over M 2-QAM, where M = 2 m , m ≥ 2. Over 16-QAM, the normalized maximum correlation [`(q)]maxmax is bounded above by <~1.17 ÖNUnknown control sequence '\lesssim' , where N is the period of the sequences in the family. This upper bound on [`(q)]maxmax is the lowest among all known sequence families over 16-QAM.The second family Á4SQ4 is constructed by interleaving 4 selected QAM sequences. This family is defined over M 2-QAM, where M = 2 m , m ≥ 3, i.e., 64-QAM and beyond. The [`(q)]maxmax for sequences in this family over 64-QAM is upper bounded by <~1.60 ÖNUnknown control sequence '\lesssim' . For large M, [`(q)]max <~1.64 ÖNUnknown control sequence '\lesssim' . These upper bounds on [`(q)]maxmax are the lowest among all known sequence families over M 2-QAM, M = 2 m , m ≥ 3.

Common recognition principles across diverse sequence and structural families of sialic acid binding proteins

Sialic acids form a large family of 9-carbon monosaccharides and are integral components of glycoconjugates. They are known to bind to a wide range of receptors belonging to diverse sequence families and fold classes and are key mediators in a plethora of cellular processes. Thus, it is of great interest to understand the features that give rise to such a recognition capability. Structural analyses using a non-redundant data set of known sialic acid binding proteins was carried out, which included exhaustive binding site comparisons and site alignments using in-house algorithms, followed by clustering and tree computation, which has led to derivation of sialic acid recognition principles. Although the proteins in the data set belong to several sequence and structure families, their binding sites could be grouped into only six types. Structural comparison of the binding sites indicates that all sites contain one or more different combinations of key structural features over a common scaffold. The six binding site types thus serve as structural motifs for recognizing sialic acid. Scanning the motifs against a non-redundant set of binding sites from PDB indicated the motifs to be specific for sialic acid recognition. Knowledge of determinants obtained from this study will be useful for detecting function in unknown proteins. As an example analysis, a genome-wide scan for the motifs in structures of Mycobacterium tuberculosis proteome identified 17 hits that contain combinations of the features, suggesting a possible function of sialic acid binding by these proteins.

Analysis on conservation of disulphide bonds and their structural features in homologous protein domain families

Background: Disulphide bridges are well known to play key roles in stability, folding and functions of proteins. Introduction or deletion of disulphides by site-directed mutagenesis have produced varying effects on stability and folding depending upon the protein and location of disulphide in the 3-D structure. Given the lack of complete understanding it is worthwhile to learn from an analysis of extent of conservation of disulphides in homologous proteins. We have also addressed the question of what structural interactions replaces a disulphide in a homologue in another homologue. Results: Using a dataset involving 34,752 pairwise comparisons of homologous protein domains corresponding to 300 protein domain families of known 3-D structures, we provide a comprehensive analysis of extent of conservation of disulphide bridges and their structural features. We report that only 54% of all the disulphide bonds compared between the homologous pairs are conserved, even if, a small fraction of the non-conserved disulphides do include cytoplasmic proteins. Also, only about one fourth of the distinct disulphides are conserved in all the members in protein families. We note that while conservation of disulphide is common in many families, disulphide bond mutations are quite prevalent. Interestingly, we note that there is no clear relationship between sequence identity between two homologous proteins and disulphide bond conservation. Our analysis on structural features at the sites where cysteines forming disulphide in one homologue are replaced by non-Cys residues show that the elimination of a disulphide in a homologue need not always result in stabilizing interactions between equivalent residues. Conclusion: We observe that in the homologous proteins, disulphide bonds are conserved only to a modest extent. Very interestingly, we note that extent of conservation of disulphide in homologous proteins is unrelated to the overall sequence identity between homologues. The non-conserved disulphides are often associated with variable structural features that were recruited to be associated with differentiation or specialisation of protein function.

Improved Detection of Remote Homologues Using Cascade PSI-BLAST: Influence of Neighbouring Protein Families on Sequence Coverage

Background: Development of sensitive sequence search procedures for the detection of distant relationships between proteins at superfamily/fold level is still a big challenge. The intermediate sequence search approach is the most frequently employed manner of identifying remote homologues effectively. In this study, examination of serine proteases of prolyl oligopeptidase, rhomboid and subtilisin protein families were carried out using plant serine proteases as queries from two genomes including A. thaliana and O. sativa and 13 other families of unrelated folds to identify the distant homologues which could not be obtained using PSI-BLAST. Methodology/Principal Findings: We have proposed to start with multiple queries of classical serine protease members to identify remote homologues in families, using a rigorous approach like Cascade PSI-BLAST. We found that classical sequence based approaches, like PSI-BLAST, showed very low sequence coverage in identifying plant serine proteases. The algorithm was applied on enriched sequence database of homologous domains and we obtained overall average coverage of 88% at family, 77% at superfamily or fold level along with specificity of similar to 100% and Mathew's correlation coefficient of 0.91. Similar approach was also implemented on 13 other protein families representing every structural class in SCOP database. Further investigation with statistical tests, like jackknifing, helped us to better understand the influence of neighbouring protein families. Conclusions/Significance: Our study suggests that employment of multiple queries of a family for the Cascade PSI-BLAST searches is useful for predicting distant relationships effectively even at superfamily level. We have proposed a generalized strategy to cover all the distant members of a particular family using multiple query sequences. Our findings reveal that prior selection of sequences as query and the presence of neighbouring families can be important for covering the search space effectively in minimal computational time. This study also provides an understanding of the `bridging' role of related families.

Fuel-optimal G-MPSP Guidance for Powered Descent Phase of Soft Lunar Landing

A fuel optimal nonlinear sub-optimal guidance scheme is presented in this paper for soft landing of a lunar craft during the powered descent phase. The recently developed Generalized Model Predictive Static Programming (G-MPSP) is used to compute the required magnitude and angle of the thrust vector. Both terminal position and velocity vector are imposed as hard constraints, which ensures high position accuracy and facilitates initiation of vertical descent at the end of the powered descent phase. A key feature of the G-MPSP algorithm is that it converts the nonlinear dynamic programming problem into a low-dimensional static optimization problem (of the same dimension as the output vector). The control history update is done in closed form after computing a time-varying weighting matrix through a backward integration process. This feature makes the algorithm computationally efficient, which makes it suitable for on-board applications. The effectiveness of the proposed guidance algorithm is demonstrated through promising simulation results.

Probing into the role of conserved N-glycosylation sites in the Tyrosinase glycoprotein family

N-linked glycosylation has a profound effect on the proper folding, oligomerization and stability of glycoproteins. These glycans impart many properties to proteins that may be important for their proper functioning, besides having a tendency to exert a chaperone-like effect on them. Certain glycosylation sites in a protein however, are more important than other sites for their function and stability. It has been observed that some N-glycosylation sites are conserved over families of glycoproteins over evolution, one such being the tyrosinase related protein family. The role of these conserved N-glycosylation sites in their trafficking, sorting, stability and activity has been examined here. By scrutinizing the different glycosylation sites on this family of glycoproteins it was inferred that different sites in the same family of polypeptides can perform distinct functions and conserved sites across the paralogues may perform diverse functions.

Multiaction learning automata possessing ergodicity of the mean

Multiaction learning automata which update their action probabilities on the basis of the responses they get from an environment are considered in this paper. The automata update the probabilities according to whether the environment responds with a reward or a penalty. Learning automata are said to possess ergodicity of the mean if the mean action probability is the state probability (or unconditional probability) of an ergodic Markov chain. In an earlier paper [11] we considered the problem of a two-action learning automaton being ergodic in the mean (EM). The family of such automata was characterized completely by proving the necessary and sufficient conditions for automata to be EM. In this paper, we generalize the results of [11] and obtain necessary and sufficient conditions for the multiaction learning automaton to be EM. These conditions involve two families of probability updating functions. It is shown that for the automaton to be EM the two families must be linearly dependent. The vector defining the linear dependence is the only vector parameter which controls the rate of convergence of the automaton. Further, the technique for reducing the variance of the limiting distribution is discussed. Just as in the two-action case, it is shown that the set of absolutely expedient schemes and the set of schemes which possess ergodicity of the mean are mutually disjoint.

Effects of environment on surface-wave characteristics of a dielectric-coated conductor .4.

The problem of excitation of 11zultilayercd-graded-dielectric-coatedc onductor by a magnetic ring source is fornzulated in the ,form of a contour integrul which is rolved by using the method of steepest descent. Numerical evaluation of launching efiiency shows that high value of about 90 percent can be attained by choosing proper dimensions of the launcher with respect to the dimension of the surface wave line.

Analysis of the amino acid sequences of plant Bowman-Birk inhibitors

Plant seeds contain a large number of protease inhibitors of animal, fungal, and bacterial origin. One of the well-studied families of these inhibitors is the Bowman-Birk family(BBI). The BBIs from dicotyledonous seeds are 8K, double-headed proteins. In contrast, the 8K inhibitors from monocotyledonous seeds are single headed. Monocots also have a 16K, double-headed inhibitor. We have determined the primary structure of a Bowman-Birk inhibitor from a dicot, horsegram, by sequential edman analysis of the intact protein and peptides derived from enzymatic and chemical cleavage. The 76-residue-long inhibitor is very similar to that ofMacrotyloma axillare. An analysis of this inhibitor along with 26 other Bowman-Birk inhibitor domains (MW 8K) available in the SWISSPROT databank revealed that the proteins from monocots and dicots belong to related but distinct families. Inhibitors from monocots show larger variation in sequence. Sequence comparison shows that a crucial disulphide which connects the amino and carboxy termini of the active site loop is lost in monocots. The loss of a reactive site in monocots seems to be correlated to this. However, it appears that this disulphide is not absolutely essential for retention of inhibitory function. Our analysis suggests that gene duplication leading to a 16K inhibitor in monocots has occurred, probably after the divergence of monocots and dicots, and also after the loss of second reactive site in monocots.

DMT of Multi-hop Cooperative Networks-Part I: K-Parallel-Path Networks

We consider single-source, single-sink multi-hop relay networks, with slow-fading Rayleigh fading links and single-antenna relay nodes operating under the half-duplex constraint. While two hop relay networks have been studied in great detail in terms of the diversity-multiplexing tradeoff (DMT), few results are available for more general networks. In this two-part paper, we identify two families of networks that are multi-hop generalizations of the two hop network: K-Parallel-Path (KPP) networks and Layered networks. In the first part, we initially consider KPP networks, which can be viewed as the union of K node-disjoint parallel paths, each of length > 1. The results are then generalized to KPP(I) networks, which permit interference between paths and to KPP(D) networks, which possess a direct link from source to sink. We characterize the optimal DMT of KPP(D) networks with K >= 4, and KPP(I) networks with K >= 3. Along the way, we derive lower bounds for the DMT of triangular channel matrices, which are useful in DMT computation of various protocols. As a special case, the DMT of two-hop relay network without direct link is obtained. Two key implications of the results in the two-part paper are that the half-duplex constraint does not necessarily entail rate loss by a factor of two, as previously believed and that, simple AF protocols are often sufficient to attain the best possible DMT.

d-Regular Graphs of Acyclic Chromatic Index at Least d+2

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). It was conjectured by Alon, Suclakov and Zaks (and earlier by Fiamcik) that a'(G) <= Delta+2, where Delta = Delta(G) denotes the maximum degree of the graph. Alon et al. also raised the question whether the complete graphs of even order are the only regular graphs which require Delta+2 colors to be acyclically edge colored. In this article, using a simple counting argument we observe not only that this is not true, but in fact all d-regular graphs with 2n vertices and d>n, requires at least d+2 colors. We also show that a'(K-n,K-n) >= n+2, when n is odd using a more non-trivial argument. (Here K-n,K-n denotes the complete bipartite graph with n vertices on each side.) This lower bound for Kn,n can be shown to be tight for some families of complete bipartite graphs and for small values of n. We also infer that for every d, n such that d >= 5, n >= 2d+3 and dn even, there exist d-regular graphs which require at least d+2-colors to be acyclically edge colored. (C) 2009 Wiley Periodicals, Inc. J Graph Theory 63: 226-230, 2010.

Conformations of disulfide bridges in proteins

The conformational characteristics of disulfide bridges in proteins have been analyzed using a dataset of 22 protein structures, available at a resolution of 2.0 Å, containing a total of 72 disulfide crosslinks. The parameters used in the analysis include (φ, Ψ) values at Cys residues, bridge dihedral angles χss, χ1i, χ1j, χ2i and χ2j the distances Cαi-Cαj and Cβi-Cβj between the Cα and Cβ atoms of Cys(i) and Cys(j). Eight families of bridge conformations with three or more occurrences have been identified on the basis of these stereochemical parameters. The most populated family corresponds to the "left handed spiral" identified earlier by Richardson ((1981) Adv. Protein Chem. 34, 167–330). Disulfide bridging across antiparallel extended strands is observed in α-lytic protease, crambin, and β-trypsin and this structure is shown to be very similar to those obtained in small cystine peptides. Solvent accessible surface area calculations show that the overwhelming majority of disulfide bridges are inaccessible to solvent.

Undamped Oscillations of Collisionless Stellar Systems: Spheres,Spheroids and Discs.

The collisionless Boltzmann equation governing self-gravitating systems such as galaxies has recently been shown to admit exact oscillating solutions with planar and spherical symmetry. The relation of the spherically symmetric solutions to the Virial theorem, as well as generalizations to non-uniform spheres, uniform spheroids and discs form the subject of this paper. These models generalize known families of static solutions. The case of the spheroid is worked out in some detail. Quasiperiodic as well as chaotic time variation of the two axes is demonstrated by studying the surface of section for the associated Hamiltonian system with two degrees of freedom. The relation to earlier work and possible implications for the general problem of collisionless relaxation in self gravitating systems are also discussed.

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.