Empirical analysis of the Lieb-Oxford bound in ions and molecules

Universal properties of the Coulomb interaction energy apply to all many-electron systems. Bounds on the exchange-correlation energy, in particular, are important for the construction of improved density functionals. Here we investigate one such universal property-the Lieb-Oxford lower bound-for ionic and molecular systems. In recent work [J Chem Phys 127, 054106 (2007)], we observed that for atoms and electron liquids this bound may be substantially tightened. Calculations for a few ions and molecules suggested the same tendency, but were not conclusive due to the small number of systems considered. Here we extend that analysis to many different families of ions and molecules, and find that for these, too, the bound can be empirically tightened by a similar margin as for atoms and electron liquids. Tightening the Lieb-Oxford bound will have consequences for the performance of various approximate exchange-correlation functionals. (C) 2008 Wiley Periodicals Inc.

Crystal structure of a soluble decoy receptor IL-22BP bound to interleukin-22

Interleukin-22 (IL-22) plays an important role in the regulation of immune and inflammatory responses in mammals. The IL-22 binding protein (IL-22BP), a soluble receptor that specifically binds IL-22, prevents the IL-22/interleukin-22 receptor 1 (IL-22R1)/interleukin-10 receptor 2 (IL-10R2) complex assembly and blocks IL-22 biological activity. Here we present the crystal structure of the IL-22/IL-22BP complex at 2.75 angstrom resolution. The structure reveals IL-22BP residues critical for IL-22 binding, which were confirmed by site-directed mutagenesis and functional studies. Comparison of IL-22/IL-22BP and IL-22/IL-22R1 crystal structures shows that both receptors display an overlapping IL-22 binding surface, which is consistent with the inhibitory role played by IL-22 binding protein.

Continuous GRASP with a local active-set method for bound-constrained global optimization

Global optimization seeks a minimum or maximum of a multimodal function over a discrete or continuous domain. In this paper, we propose a hybrid heuristic-based on the CGRASP and GENCAN methods-for finding approximate solutions for continuous global optimization problems subject to box constraints. Experimental results illustrate the relative effectiveness of CGRASP-GENCAN on a set of benchmark multimodal test functions.

U-curve: A branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem

This paper presents the formulation of a combinatorial optimization problem with the following characteristics: (i) the search space is the power set of a finite set structured as a Boolean lattice; (ii) the cost function forms a U-shaped curve when applied to any lattice chain. This formulation applies for feature selection in the context of pattern recognition. The known approaches for this problem are branch-and-bound algorithms and heuristics that explore partially the search space. Branch-and-bound algorithms are equivalent to the full search, while heuristics are not. This paper presents a branch-and-bound algorithm that differs from the others known by exploring the lattice structure and the U-shaped chain curves of the search space. The main contribution of this paper is the architecture of this algorithm that is based on the representation and exploration of the search space by new lattice properties proven here. Several experiments, with well known public data, indicate the superiority of the proposed method to the sequential floating forward selection (SFFS), which is a popular heuristic that gives good results in very short computational time. In all experiments, the proposed method got better or equal results in similar or even smaller computational time. (C) 2009 Elsevier Ltd. All rights reserved.

The bound quiver of a split extension

In this paper, we give a sufficient (which is also necessary under a compatibility hypothesis) condition on a set of arrows in the quiver of an algebra A so that A is a split extension of A/M, where M is the ideal of A generated by the classes of these arrows. We also compare the notion of split extension with that of semiconvex extension of algebras.

Purification and partial characterization of a midgut membrane-bound alpha-glucosidase from Quesada gigas (Hemiptera: Cicadidae)

Adults of Quesada gigas (Hemiptera: Cicadidae) have a major alpha-glucosidase bound to the perimicrovillar membranes, which are lipoprotein membranes that surround the midgut cell microvilli in Hemiptera and Thysanoptera. Determination of the spatial distribution of alpha-glucosidases in Q. gigas midgut showed that this activity is not equally distributed between soluble and membrane-bound isoforms. The major membrane-bound enzyme was solubilized in the detergent Triton X-100 and purified to homogeneity by means of gel filtration on Sephacryl S-100, and ion-exchange on High Q and Mono Q columns. The purified alpha-glucosidase is a protein with a pH optimum of 6.0 against the synthetic substrate p-nitrophenyl alpha-D-glucoside and M(r) of 61,000 (SDS-PAGE). Taking into account V(Max)/K(M) ratios, the enzyme is more active on maltose than sucrose and prefers oligomaltodextrins up to maltopentaose, with lower efficiency for longer chain maltodextrins. The Q gigas alpha-glucosidase was immunolocalized in perimicrovillar membranes by using a monospecific polyclonal antibody raised against the purified enzyme from Dysdercus peruvianus. The role of this enzyme in xylem fluid digestion and its possible involvement in osmoregulation is discussed. (C) 2009 Elsevier Inc. All rights reserved.