One protein�many functions

The concept of one enzyme-one activity had influenced biochemistry for over half a century. Over 1000 enzymes are now described. Many of them are highly 'specific'. Some of them are crystallized and their three-dimensional structures determined. They range from 12 to 1000 kDa in molecular weight and possess 124 to several hundreds of amino acids. They occur as single polypeptides or multiple-subunit proteins. The active sites are assembled on these by appropriate tertiary folding of the polypeptide chain, or by interaction of the constituent subunits. The substrate is held by the side-chains of a few amino acids at the active site on the surface, occupying a tiny fraction of the total area. What is the bulk of the protein behind the active site doing? Do all proteins have only one function each? Why not a protein have more than one active site on its large surface? Will we discover more than one activity for some proteins? These newer possibilities are emerging and are finding experimental support. Some proteins purified to homogeneity using assay methods for different activities are now recognized to have the same molecular weight and a high degree of homology of amino acid sequence. Obviously they are identical. They represent the phenomenon of one protein-many functions.

CM defect and Hilbert functions of monomial curves

In this article we consider a semigroup ring R = KGamma] of a numerical semigroup Gamma and study the Cohen- Macaulayness of the associated graded ring G(Gamma) := gr(m), (R) := circle plus(n is an element of N) m(n)/m(n+1) and the behaviour of the Hilbert function H-R of R. We define a certain (finite) subset B(Gamma) subset of F and prove that G(Gamma) is Cohen-Macaulay if and only if B(Gamma) = empty set. Therefore the subset B(Gamma) is called the Cohen-Macaulay defect of G(Gamma). Further, we prove that if the degree sequence of elements of the standard basis of is non-decreasing, then B(F) = empty set and hence G(Gamma) is Cohen-Macaulay. We consider a class of numerical semigroups Gamma = Sigma(3)(i=0) Nm(i) generated by 4 elements m(0), m(1), m(2), m(3) such that m(1) + m(2) = mo m3-so called ``balanced semigroups''. We study the structure of the Cohen-Macaulay defect B(Gamma) of Gamma and particularly we give an estimate on the cardinality |B(Gamma, r)| for every r is an element of N. We use these estimates to prove that the Hilbert function of R is non-decreasing. Further, we prove that every balanced ``unitary'' semigroup Gamma is ``2-good'' and is not ``1-good'', in particular, in this case, c(r) is not Cohen-Macaulay. We consider a certain special subclass of balanced semigroups Gamma. For this subclass we try to determine the Cohen-Macaulay defect B(Gamma) using the explicit description of the standard basis of Gamma; in particular, we prove that these balanced semigroups are 2-good and determine when exactly G(Gamma) is Cohen-Macaulay. (C) 2011 Published by Elsevier B.V.

Using Correlated Parameters for Improved Ranking of Protein-Protein Docking Decoys

A successful protein-protein docking study culminates in identification of decoys at top ranks with near-native quaternary structures. However, this task remains enigmatic because no generalized scoring functions exist that effectively infer decoys according to the similarity to near-native quaternary structures. Difficulties arise because of the highly irregular nature of the protein surface and the significant variation of the nonbonding and solvation energies based on the chemical composition of the protein-protein interface. In this work, we describe a novel method combining an interface-size filter, a regression model for geometric compatibility (based on two correlated surface and packing parameters), and normalized interaction energy (calculated from correlated nonbonded and solvation energies), to effectively rank decoys from a set of 10,000 decoys. Tests on 30 unbound binary protein-protein complexes show that in 16 cases we can identify at least one decoy in top three ranks having <= 10 angstrom backbone root mean square deviation from true binding geometry. Comparisons with other state-of-art methods confirm the improved ranking power of our method without the use of any experiment-guided restraints, evolutionary information, statistical propensities, or modified interaction energy equations. Tests on 118 less-difficult bound binary protein-protein complexes with <= 35% sequence redundancy at the interface showed that in 77% cases, at least 1 in 10,000 decoys were identified with <= 5 angstrom backbone root mean square deviation from true geometry at first rank. The work will promote the use of new concepts where correlations among parameters provide more robust scoring models. It will facilitate studies involving molecular interactions, including modeling of large macromolecular assemblies and protein structure prediction. (C) 2010 Wiley Periodicals, Inc. J Comput Chem 32: 787-796, 2011.

Capturability of realistic generalized true proportional navigation

The capturability of a realistic generalized true proportional navigation (RGTPN) guidance law, against a nonmaneuvering target, is analyzed. The RGTPN law is obtained by relaxing the somewhat unrealistic assumption of constant closing velocity, made in all earlier studies on generalized true proportional navigation (GTPN), and incorporating the actual time-varying value in the guidance law. Closed-form solutions for the complete capture region of RGTPN is obtained in terms of both zero and acceptable non-zero miss distances. It is shown that the capture region of RGTPN in the initial relative velocity space is significantly smaller than that of GTPN, for reasonable values of navigation constant (N) and angular direction (eta) of the missile commanded latax. However, for certain values of N and eta, capturability of RGTPN is found to be better. It is also shown that if in one of the versions of GTPN, which uses constant values of both the closing velocity and the line-of-sight (LOS) angular velocity in the guidance law, the corresponding realistic time-varying quantities are used, the capture region actually expands to cover the whole of the initial relative velocity space. A number of examples are given to compare the capture performance of RGTPN with other versions of the GTPN guidance laws.

Derivation and consistency of the partial functions of the ternary system involving interaction coefficients

The logarithm of activity coefficients of the components of the ternary system is derived based on the Maclaurin infinite series, which is expressed in terms of the integral property of the system and subjected to appropriate boundary conditions. The derivation of the functions involves extensive summation of various infinite series pertaining to the first-order interaction coefficients that have been shown completely to remove any truncational error. Since the conventional equations involving interaction coefficients are internally inconsistent, a consistent form of the partial functions is developed in the article using the technique just described. The thermodynamic consistency of the functions based on the Maxwell and the Gibbs-Duhem relations has been established. The derived values of the logarithmic activity coefficients of the components have been found to be in agreement with the thermodynamic data of the Fe-Cr-Ni system at 1873 K and have been found to be independent of the compositional paths.

Spatially dependent zero-frequency response functions and correlation functions in the Kondo model

We present the details of a formalism for calculating spatially varying zero-frequency response functions and equal-time correlation functions in models of magnetic and mixed-valence impurities of metals. The method is based on a combination of perturbative, thermodynamic scaling theory [H. R. Krishna-murthy and C. Jayaprakash, Phys. Rev. B 30, 2806 (1984)] and a nonperturbative technique such as the Wilson renormalization group. We illustrate the formalism for the spin-1/2 Kondo problem and present results for the conduction-spin-density�impurity-spin correlation function and conduction-electron charge density near the impurity. We also discuss qualitative features that emerge from our calculations and discuss how they can be carried over to the case of realistic models for transition-metal impurities.

Transmembrane domains participate in functions of integral membrane proteins

Integral membrane proteins have one or more transmembrane a-helical domains and carry out a variety of functions such as enzyme catalysis, transport across membranes, transducing signals as receptors of hormones and growth factors, and energy transfer in ATP synthesis. These transmembrane domains are not mere structural units anchoring the protein to the lipid bilayer but seem to-contribute in the overall activity. Recent findings in support of this are described using some typical examples-LDL receptor, growth factor receptor tyrosine kinase, HMG-CoA reductase, F-0-ATPase and adrenergic receptors. The trends in research indicate that these transmembrane domains participate in a variety of ways such as a linker, a transducer or an exchanger in the overall functions of these proteins in transfer of materials, energy and signals.

Flat connections, geometric invariants and energy of harmonic functions on compact Riemann surfaces

A geometric invariant is associated to the space of fiat connections on a G-bundle over a compact Riemann surface and is related to the energy of harmonic functions.

Performance of the generalized delta rule in structural damage detection

The paper examines the suitability of the generalized data rule in training artificial neural networks (ANN) for damage identification in structures. Several multilayer perceptron architectures are investigated for a typical bridge truss structure with simulated damage stares generated randomly. The training samples have been generated in terms of measurable structural parameters (displacements and strains) at suitable selected locations in the structure. Issues related to the performance of the network with reference to hidden layers and hidden. neurons are examined. Some heuristics are proposed for the design of neural networks for damage identification in structures. These are further supported by an investigation conducted on five other bridge truss configurations.

Thomas-Fermi Method For Particles Obeying Generalized Exclusion Statistics

We use the Thomas-Fermi method to examine the thermodynamics of particles obeying Haldane exclusion statistics. Specifically, we study Calogero-Sutherland particles placed in a given external potential in one dimension. For the case of a simple harmonic potential (constant density of states), we obtain the exact one-particle spatial density and a {\it closed} form for the equation of state at finite temperature, which are both new results. We then solve the problem of particles in a $x^{2/3} ~$ potential (linear density of states) and show that Bose-Einstein condensation does not occur for any statistics other than bosons.

Direct Cartesian-Space Solutions of Generalized Bloch Equations in the Rotating Frame

Analytical solutions of the generalized Bloch equations for an arbitrary set of initial values of the x, y, and z magnetization components are given in the rotating frame. The solutions involve the decoupling of the three coupled differential equations such that a third-order differential equation in each magnetization variable is obtained. In contrast to the previously reported solutions given by Torrey, the present attempt paves the way for more direct physical insight into the behavior of each magnetization component. Special cases have been discussed that highlight the utility of the general solutions. Representative trajectories of magnetization components are given, illustrating their behavior with respect to the values of off-resonance and initial conditions. (C) 1995 Academic Press, Inc.

Generation of an eight node brick element using Papcovitch-Neuber functions

Some conventional finite elements suffer from drawbacks, such as shear locking, membrane locking, etc. To overcome them researchers have developed various techniques, termed as tricks by some and variational crimes by others. Many attempts have been made, but satisfactory explanations for why some of these techniques work have not been obtained, especially in the case of solid elements. This paper attempts a simple non-conforming solid element using assumed displacement fields which satisfy the Navier equation exactly. Its behaviour under simple loadings like bending, torsion and tension is examined and comparisons are made with existing elements.

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.

Violin string shape functions for finite element analysis of rotating Timoshenko beams

Violin strings are relatively short and stiff and are well modeled by Timoshenko beam theory. We use the static part of the homogeneous differential equation of violin strings to obtain new shape functions for the finite element analysis of rotating Timoshenko beams. For deriving the shape functions, the rotating beam is considered as a sequence of violin strings. The violin string shape functions depend on rotation speed and element position along the beam length and account for centrifugal stiffening effects as well as rotary inertia and shear deformation on dynamic characteristics of rotating Timoshenko beams. Numerical results show that the violin string basis functions perform much better than the conventional polynomials at high rotation speeds and are thus useful for turbo machine applications. (C) 2011 Elsevier B.V. All rights reserved.

On an exact populationary model of genetic algorithms

Genetic algorithms (GAs) are search methods that are being employed in a multitude of applications with extremely large search spaces. Recently, there has been considerable interest among GA researchers in understanding and formalizing the working of GAs. In an earlier paper, we have introduced the notion of binomially distributed populations as the central idea behind an exact ''populationary'' model of the large-population dynamics of the GA operators for objective functions called ''functions of unitation.'' In this paper, we extend this populationary model of GA dynamics to a more general class of objective functions called functions of unitation variables. We generalize the notion of a binomially distributed population to a generalized binomially distributed population (GBDP). We show that the effects of selection, crossover, and mutation can be exactly modelled after decomposing the population into GBDPs. Based on this generalized model, we have implemented a GA simulator for functions of two unitation variables-GASIM 2, and the distributions predicted by GASIM 2 match with those obtained from actual GA runs. The generalized populationary model of GA dynamics not only presents a novel and natural way of interpreting the workings of GAs with large populations, but it also provides for an efficient implementation of the model as a GA simulator. (C) Elsevier Science Inc. 1997.