Synthesis and structure of a novel open-framework zincophosphate with intersecting three-dimensional helical channels

A new open-framework zincophosphate, Zn-0.5(H2PO4).0.5H(2)O (denoted as FJ-13), possessing intersecting three-dimensional helical channels, has been synthesized under solvothermal conditions.

BRITE: Universal Topology Generation from a User's Perspective

Effective engineering of the Internet is predicated upon a detailed understanding of issues such as the large-scale structure of its underlying physical topology, the manner in which it evolves over time, and the way in which its constituent components contribute to its overall function. Unfortunately, developing a deep understanding of these issues has proven to be a challenging task, since it in turn involves solving difficult problems such as mapping the actual topology, characterizing it, and developing models that capture its emergent behavior. Consequently, even though there are a number of topology models, it is an open question as to how representative the topologies they generate are of the actual Internet. Our goal is to produce a topology generation framework which improves the state of the art and is based on design principles which include representativeness, inclusiveness, and interoperability. Representativeness leads to synthetic topologies that accurately reflect many aspects of the actual Internet topology (e.g. hierarchical structure, degree distribution, etc.). Inclusiveness combines the strengths of as many generation models as possible in a single generation tool. Interoperability provides interfaces to widely-used simulation and visualization applications such as ns and SSF. We call such a tool a universal topology generator. In this paper we discuss the design, implementation and usage of the BRITE universal topology generation tool that we have built. We also describe the BRITE Analysis Engine, BRIANA, which is an independent piece of software designed and built upon BRITE design goals of flexibility and extensibility. The purpose of BRIANA is to act as a repository of analysis routines along with a user–friendly interface that allows its use on different topology formats.

Sequence and Structure Based Protein Folding Studies With Implications

As the expression of the genetic blueprint, proteins are at the heart of all biological systems. The ever increasing set of available protein structures has taught us that diversity is the hallmark of their architecture, a fundamental characteristic that enables them to perform the vast array of functionality upon which all of life depends. This diversity, however, is central to one of the most challenging problems in molecular biology: how does a folding polypeptide chain navigate its way through all of the myriad of possible conformations to find its own particular biologically active form? With few overarching structural principles to draw upon that can be applied to all protein architecture, the search for a solution to the protein folding problem has yet to produce an algorithm that can explain and duplicate this fundamental biological process. In this thesis, we take a two-pronged approach for investigating the protein folding process. Our initial statistical studies of the distributions of hydrophobic and hydrophilic residues within α-helices and β-sheets suggest (i) that hydrophobicity plays a critical role in helix and sheet formation; and (ii) that the nucleation of these motifs may result in largely unidirectional growth. Most tellingly, from an examination of the amino acids found in the smallest β-sheets, we do not find any evidence of a β-nucleating code in the primary protein sequence. Complementing these statistical analyses, we have analyzed the structural environments of several ever-widening aspects of protein topology. Our examination of the gaps between strands in the smallest β-sheets reveals a common organizational principle underlying β-formation involving strands separated by large sequential gaps: with very few exceptions, these large gaps fold into single, compact structural modules, bringing the β-strands that are otherwise far apart in the sequence close together in space. We conclude, therefore, that β-nucleation in the smallest sheets results from the co-location of two strands that are either local in sequence, or local in space following prior folding events. A second study of larger β-sheets both corroborates and extends these findings: virtually all large sequential gaps between pairs of β-strands organize themselves into an hierarchical arrangement, creating a bread-crumb model of go-and-come-back structural organization that ultimately juxtaposes two strands of a parental β-structure that are far apart in the sequence in close spatial proximity. In a final study, we have formalized this go-and-come-back notion into the concept of anti-parallel double-strandedness (DS), and measure this property across protein architecture in general. With over 90% of all residues in a large, non-redundant set of protein structures classified as DS, we conclude that DS is a unifying structural principle that underpins all globular proteins. We postulate, moreover, that this one simple principle, anti-parallel double-strandedness, unites protein structure, protein folding and protein evolution.

Some properties of the speciation model for food-web structure - Mechanisms for degree distributions and intervality

We present a mathematical analysis of the speciation model for food-web structure, which had in previous work been shown to yield a good description of empirical data of food-web topology. The degree distributions of the network are derived. Properties of the speciation model are compared to those of other models that successfully describe empirical data. It is argued that the speciation model unities the underlying ideas of previous theories. In particular, it offers a mechanistic explanation for the success of the niche model of Williams and Martinez and the frequent observation of intervality in empirical food webs. (c) 2005 Elsevier Ltd. All rights reserved.

An explanatory model for food-web structure and evolution

Food webs are networks describing who is eating whom in an ecological community. By now it is clear that many aspects of food-web structure are reproducible across diverse habitats, yet little is known about the driving force behind this structure. Evolutionary and population dynamical mechanisms have been considered. We propose a model for the evolutionary dynamics of food-web topology and show that it accurately reproduces observed food-web characteristics in the steady state. It is based on the observation that most consumers are larger than their resource species and the hypothesis that speciation and extinction rates decrease with increasing body mass. Results give strong support to the evolutionary hypothesis. (C) 2005 Elsevier B.V. All rights reserved.

The forgiving tree: a self-healing distributed data structure

We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that the following process continues for up to n rounds where n is the total number of nodes initially in the network: the adversary deletesan arbitrary node from the network, then the network responds by quickly adding a small number of new edges.

We present a distributed data structure that ensures two key properties. First, the diameter of the network is never more than O(log Delta) times its original diameter, where Delta is the maximum degree of the network initially. We note that for many peer-to-peer systems, Delta is polylogarithmic, so the diameter increase would be a O(loglog n) multiplicative factor. Second, the degree of any node never increases by more than 3 over its original degree. Our data structure is fully distributed, has O(1) latency per round and requires each node to send and receive O(1) messages per round. The data structure requires an initial setup phase that has latency equal to the diameter of the original network, and requires, with high probability, each node v to send O(log n) messages along every edge incident to v. Our approach is orthogonal and complementary to traditional topology-based approaches to defending against attack.

Central-Tapped Node Linked Modular Fault-Tolerance Topology for SRM Applications

Electric vehicles (EVs) and hybrid electric vehicles (HEVs) can reduce greenhouse gas emissions while switched reluctance motor (SRM) is one of the promising motor for such applications. This paper presents a novel SRM fault-diagnosis and fault-tolerance operation solution. Based on the traditional asymmetric half-bridge topology for the SRM driving, the central tapped winding of the SRM in modular half-bridge configuration are introduced to provide fault-diagnosis and fault-tolerance functions, which are set idle in normal conditions. The fault diagnosis can be achieved by detecting the characteristic of the excitation and demagnetization currents. An SRM fault-tolerance operation strategy is also realized by the proposed topology, which compensates for the missing phase torque under the open-circuit fault, and reduces the unbalanced phase current under the short-circuit fault due to the uncontrolled faulty phase. Furthermore, the current sensor placement strategy is also discussed to give two placement methods for low cost or modular structure. Simulation results in MATLAB/Simulink and experiments on a 750-W SRM validate the effectiveness of the proposed strategy, which may have significant implications and improve the reliability of EVs/HEVs.

Generating analysis topology using virtual topology operators

Virtual topology operations have been utilized to generate an analysis topology definition suitable for downstream mesh generation. Detailed descriptions are provided for virtual topology merge and split operations for all topological entities, where virtual decompositions are robustly linked to the underlying geometry. Current virtual topology technology is extended to allow the virtual partitioning of volume cells. A valid description of the topology, including relative orientations, is maintained which enables downstream interrogations to be performed on the analysis topology description, such as determining if a specific meshing strategy can be applied to the virtual volume cells. As the virtual representation is a true non-manifold description of the sub-divided domain the interfaces between cells are recorded automatically. Therefore, the advantages of non-manifold modelling are exploited within the manifold modelling environment of a major commercial CAD system without any adaptation of the underlying CAD model. A hierarchical virtual structure is maintained where virtual entities are merged or partitioned. This has a major benefit over existing solutions as the virtual dependencies here are stored in an open and accessible manner, providing the analyst with the freedom to create, modify and edit the analysis topology in any preferred sequence.

Structure of the snake-venom toxin convulxin

Snake venoms contain a number of proteins that interact with components of the haemostatic system that promote or inhibit events leading to blood- clot formation. The snake- venom protein convulxin ( Cvx) binds glycoprotein ( GP) VI, the platelet receptor for collagen, and triggers signal transduction. Here, the 2.7 Angstrom resolution crystal structure of Cvx is presented. In common with other members of this snake-venom protein family, Cvx is an alphabeta- heterodimer and conforms to the C- type lectin- fold topology. Comparison with other family members allows a set of Cvx residues that form a concave surface to be putatively implicated in GPVI binding. Unlike other family members, with the exception of flavocetin- A ( FL- A), Cvx forms an (alphabeta)(4) tetramer. This oligomeric structure is consistent with Cvx clustering GPVI molecules on the surface of platelets and as a result promoting signal transduction activity. The Cvx structure and the location of the putative binding sites suggest a model for this multimeric signalling assembly.

Protein structure prediction servers at University College London

A number of state-of-the-art protein structure prediction servers have been developed by researchers working in the Bioinformatics Unit at University College London. The popular PSIPRED server allows users to perform secondary structure prediction, transmembrane topology prediction and protein fold recognition. More recent servers include DISOPRED for the prediction of protein dynamic disorder and DomPred for domain boundary prediction.

Rapid protein domain assignment from amino acid sequence using predicted secondary structure

The elucidation of the domain content of a given protein sequence in the absence of determined structure or significant sequence homology to known domains is an important problem in structural biology. Here we address how successfully the delineation of continuous domains can be accomplished in the absence of sequence homology using simple baseline methods, an existing prediction algorithm (Domain Guess by Size), and a newly developed method (DomSSEA). The study was undertaken with a view to measuring the usefulness of these prediction methods in terms of their application to fully automatic domain assignment. Thus, the sensitivity of each domain assignment method was measured by calculating the number of correctly assigned top scoring predictions. We have implemented a new continuous domain identification method using the alignment of predicted secondary structures of target sequences against observed secondary structures of chains with known domain boundaries as assigned by Class Architecture Topology Homology (CATH). Taking top predictions only, the success rate of the method in correctly assigning domain number to the representative chain set is 73.3%. The top prediction for domain number and location of domain boundaries was correct for 24% of the multidomain set (±20 residues). These results have been put into context in relation to the results obtained from the other prediction methods assessed

The PSIPRED protein structure prediction server

The PSIPRED protein structure prediction server allows users to submit a protein sequence, perform a prediction of their choice and receive the results of the prediction both textually via e-mail and graphically via the web. The user may select one of three prediction methods to apply to their sequence: PSIPRED, a highly accurate secondary structure prediction method; MEMSAT 2, a new version of a widely used transmembrane topology prediction method; or GenTHREADER, a sequence profile based fold recognition method.

A new topology of ACBP from Moniliophthora perniciosa

Acyl-CoA binding protein (ACBP) is a housekeeping protein and is an essential protein in human cell lines and in Trypanosoma brucei. The ACBP of Moniliophthora perniciosa is composed of 104 amino acids and is possibly a non-classic isoform exclusively from Basidiomycetes. The M. perniciosa acbp gene was cloned, and the protein was expressed and purified. Acyl-CoA ester binding was analyzed by isoelectric focusing, native gel electrophoresis and isothermal titration calorimetry. Our results suggest an increasing affinity of ACBP for longer acyl-CoA esters, such as myristoyl-CoA to arachidoyl-CoA, and best fit modeling indicates two binding sites. ACBP undergoes a shift from a monomeric to a dimeric state, as shown by dynamic light scattering, fluorescence anisotropy and native gel electrophoresis in the absence and presence of the ligand. The protein`s structure was determined at 1.6 angstrom resolution and revealed a new topology for ACBP, containing five a-helices instead of four. alpha-helices 1, 2, 3 and 4 adopted a bundled arrangement that is unique from the previously determined four-helix folds of ACBP, while alpha-helices 1, 2, 4 and 5 formed a classical four-helix bundle. A MES molecule was found in the CoA binding site, suggesting that the CoA site could be a target for small compound screening. (C) 2009 Elsevier B.V. All rights reserved.

Integrable maps with non-trivial topology: application to divertor configurations

We explore a method for constructing two-dimensional area-preserving, integrable maps associated with Hamiltonian systems, with a given set of fixed points and given invariant curves. The method is used to find an integrable Poincare map for the field lines in a large aspect ratio tokamak with a poloidal single-null divertor. The divertor field is a superposition of a magnetohydrodynamic equilibrium with an arbitrarily chosen safety factor profile, with a wire carrying an electric current to create an X-point. This integrable map is perturbed by an impulsive perturbation that describes non-axisymmetric magnetic resonances at the plasma edge. The non-integrable perturbed map is applied to study the structure of the open field lines in the scrape-off layer, reproducing the main transport features obtained by integrating numerically the magnetic field line equations, such as the connection lengths and magnetic footprints on the divertor plate.

SZNAJD MODEL AND PROPORTIONAL ELECTIONS: THE ROLE OF THE TOPOLOGY OF THE NETWORK

The Sznajd model (SM) has been employed with success in the last years to describe opinion propagation in a community. In particular, it has been claimed that its transient is able to reproduce some scale properties observed in data of proportional elections, in different countries, if the community structure (the network) is scale-free. In this work, we investigate the properties of the transient of a particular version of the SM, introduced by Bernardes and co-authors in 2002. We studied the behavior of the model in networks of different topologies through the time evolution of an order parameter known as interface density, and concluded that regular lattices with high dimensionality also leads to a power-law distribution of the number of candidates with v votes. Also, we show that the particular absorbing state achieved in the stationary state (or else, the winner candidate), is related to a particular feature of the model, that may not be realistic in all situations.