Search NASA⌕ Search

Engineering topics

Xu, You

Publications and source records attributed to Xu, You.

A spongy nickel-organic CO 2 reduction photocatalyst for nearly 100% selective CO production

Solar-driven photocatalytic conversion of CO 2 into fuels has attracted a lot of interest; however, developing active catalysts that can selectively convert CO 2 to fuels with desirable reaction products remains a grand challenge. For instance, complete suppression of the competing H 2 evolution during photocatalytic CO 2 -to-CO conversion has not been achieved before. We design and synthesize a spongy nickel-organic heterogeneous photocatalyst via a photochemical route. The catalyst has a crystalline network architecture with a high concentration of defects. It is highly active in converting CO 2 to CO, with a production rate of ~1.6 × 10 4 μmol hour –1 g –1 . No measurable H 2 is generated during the reaction, leading to nearly 100% selective CO production over H 2 evolution. When the spongy Ni-organic catalyst is enriched with Rh or Ag nanocrystals, the controlled photocatalytic CO 2 reduction reactions generate formic acid and acetic acid. As a result, achieving such a spongy nickel-organic photocatalyst is a critical step toward practical production of high-value multicarbon fuels using solar energy.

36 MATERIALS SCIENCE↗

MicrobesFlux: a web platform for drafting metabolic models from the KEGG database

Concurrent with the efforts currently underway in mapping microbial genomes using high-throughput sequencing methods, systems biologists are building metabolic models to characterize and predict cell metabolisms. One of the key steps in building a metabolic model is using multiple databases to collect and assemble essential information about genome-annotations and the architecture of the metabolic network for a specific organism. To speed up metabolic model development for a large number of microorganisms, we need a user-friendly platform to construct metabolic networks and to perform constraint-based flux balance analysis based on genome databases and experimental results. We have developed a semi-automatic, web-based platform (MicrobesFlux) for generating and reconstructing metabolic models for annotated microorganisms. MicrobesFlux is able to automatically download the metabolic network (including enzymatic reactions and metabolites) of ~1,200 species from the KEGG database (Kyoto Encyclopedia of Genes and Genomes) and then convert it to a metabolic model draft. The platform also provides diverse customized tools, such as gene knockouts and the introduction of heterologous pathways, for users to reconstruct the model network. The reconstructed metabolic network can be formulated to a constraint-based flux model to predict and analyze the carbon fluxes in microbial metabolisms. The simulation results can be exported in the SBML format (The Systems Biology Markup Language). Furthermore, we also demonstrated the platform functionalities by developing an FBA model (including 229 reactions) for a recent annotated bioethanol producer, Thermoanaerobacter sp. strain X514, to predict its biomass growth and ethanol production. MicrobesFlux is an installation-free and open-source platform that enables biologists without prior programming knowledge to develop metabolic models for annotated microorganisms in the KEGG database. Our system facilitates users to reconstruct metabolic networks of organisms based on experimental information. Through human-computer interaction, MicrobesFlux provides users with reasonable predictions of microbial metabolism via flux balance analysis. This prototype platform can be a springboard for advanced and broad-scope modeling of complex biological systems by integrating other “omics” data or 13 C- metabolic flux analysis results.

97 MATHEMATICS AND COMPUTING↗

A Framework for Parallel Nonlinear Optimization by Partitioning Localized Constraints

We present a novel parallel framework for solving large-scale continuous nonlinear optimization problems based on constraint partitioning. The framework distributes constraints and variables to parallel processors and uses an existing solver to handle the partitioned subproblems. In contrast to most previous decomposition methods that require either separability or convexity of constraints, our approach is based on a new constraint partitioning theory and can handle nonconvex problems with inseparable global constraints. We also propose a hypergraph partitioning method to recognize the problem structure. Experimental results show that the proposed parallel algorithm can efficiently solve some difficult test cases.

97 MATHEMATICS AND COMPUTING↗