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.

Evolutionary fuzzy clustering of relational data

This paper is concerned with the computational efficiency of fuzzy clustering algorithms when the data set to be clustered is described by a proximity matrix only (relational data) and the number of clusters must be automatically estimated from such data. A fuzzy variant of an evolutionary algorithm for relational clustering is derived and compared against two systematic (pseudo-exhaustive) approaches that can also be used to automatically estimate the number of fuzzy clusters in relational data. An extensive collection of experiments involving 18 artificial and two real data sets is reported and analyzed. (C) 2011 Elsevier B.V. All rights reserved.

On the efficiency of evolutionary fuzzy clustering

This paper tackles the problem of showing that evolutionary algorithms for fuzzy clustering can be more efficient than systematic (i.e. repetitive) approaches when the number of clusters in a data set is unknown. To do so, a fuzzy version of an Evolutionary Algorithm for Clustering (EAC) is introduced. A fuzzy cluster validity criterion and a fuzzy local search algorithm are used instead of their hard counterparts employed by EAC. Theoretical complexity analyses for both the systematic and evolutionary algorithms under interest are provided. Examples with computational experiments and statistical analyses are also presented.

Chaotic synchronization in general network topology for scene segmentation

Chaotic synchronization has been discovered to be an important property of neural activities, which in turn has encouraged many researchers to develop chaotic neural networks for scene and data analysis. In this paper, we study the synchronization role of coupled chaotic oscillators in networks of general topology. Specifically, a rigorous proof is presented to show that a large number of oscillators with arbitrary geometrical connections can be synchronized by providing a sufficiently strong coupling strength. Moreover, the results presented in this paper not only are valid to a wide class of chaotic oscillators, but also cover the parameter mismatch case. Finally, we show how the obtained result can be applied to construct an oscillatory network for scene segmentation.

A Productivity-Based Approach to LAN Topology Design

Over the useful life of a LAN, network downtimes will have a negative impact on organizational productivity not included in current Network Topological Design (NTD) problems. We propose a new approach to LAN topological design that includes the impact of these productivity losses into the network design, minimizing not only the CAPEX but also the expected cost of unproductiveness attributable to network downtimes over a certain period of network operation.

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.

A non-normal topology generated by a two-point selection

We construct a two-point selection f : [P](2) -> P, where P is the set of the irrational numbers, such that the space (P, tau(f)) is not normal and it is not collectionwise Hausdorff either. Here, tau(f) denotes the topology generated by the two-point selection f. This example answers a question posed by V. Gutev and T. Nogura. We also show that if f :[X](2) -> X is a two-point selection such that the topology tau(f) has countable pseudocharacter, then tau(f) is a Tychonoff topology. (C) 2008 Elsevier B.V. All rights reserved.

A group topology on the free abelian group of cardinality c that makes its square countably compact

Under p = c, we prove that it is possible to endow the free abelian group of cardinality c with a group topology that makes its square countably compact. This answers a question posed by Madariaga-Garcia and Tomita and by Tkachenko. We also prove that there exists a Wallace semigroup (i.e., a countably compact both-sided cancellative topological semigroup which is not a topological group) whose square is countably compact. This answers a question posed by Grant.

Abelian torsion groups with a countably compact group topology

Comfort and Remus [W.W. Comfort, D. Remus, Abelian torsion groups with a pseudo-compact group topology, Forum Math. 6 (3) (1994) 323-337] characterized algebraically the Abelian torsion groups that admit a pseudocompact group topology using the Ulm-Kaplansky invariants. We show, under a condition weaker than the Generalized Continuum Hypothesis, that an Abelian torsion group (of any cardinality) admits a pseudocompact group topology if and only if it admits a countably compact group topology. Dikranjan and Tkachenko [D. Dikranjan. M. Tkachenko, Algebraic structure of small countably compact Abelian groups, Forum Math. 15 (6) (2003) 811-837], and Dikranjan and Shakhmatov [D. Dikranjan. D. Shakhmatov, Forcing hereditarily separable compact-like group topologies on Abelian groups, Topology Appl. 151 (1-3) (2005) 2-54] showed this equivalence for groups of cardinality not greater than 2(c). We also show, from the existence of a selective ultrafilter, that there are countably compact groups without non-trivial convergent sequences of cardinality kappa(omega), for any infinite cardinal kappa. In particular, it is consistent that for every cardinal kappa there are countably compact groups without non-trivial convergent sequences whose weight lambda has countable cofinality and lambda > kappa. (C) 2009 Elsevier B.V. All rights reserved.