Middle-down hybrid chromatography/tandem mass spectrometry workflow for characterization of combinatorial post-translational modifications in histones.

Science.gov (United States)

Sidoli, Simone; Schwämmle, Veit; Ruminowicz, Chrystian; Hansen, Thomas A; Wu, Xudong; Helin, Kristian; Jensen, Ole N

2014-10-01

We present an integrated middle-down proteomics platform for sensitive mapping and quantification of coexisting PTMs in large polypeptides (5-7 kDa). We combined an RP trap column with subsequent weak cation exchange-hydrophilic interaction LC interfaced directly to high mass accuracy ESI MS/MS using electron transfer dissociation. This enabled automated and efficient separation and sequencing of hypermodified histone N-terminal tails for unambiguous localization of combinatorial PTMs. We present Histone Coder and IsoScale software to extract, filter, and analyze MS/MS data, including quantification of cofragmenting isobaric polypeptide species. We characterized histone tails derived from murine embryonic stem cells knockout in suppressor of zeste12 (Suz12(-/-) ) and quantified 256 combinatorial histone marks in histones H3, H4, and H2A. Furthermore, a total of 713 different combinatorial histone marks were identified in purified histone H3. We measured a seven-fold reduction of H3K27me2/me3 (where me2 and me3 are dimethylation and trimethylation, respectively) in Suz12(-) (/) (-) cells and detected significant changes of the relative abundance of 16 other single PTMs of histone H3 and other combinatorial marks. We conclude that the inactivation of Suz12 is associated with changes in the abundance of not only H3K27 methylation but also multiple other PTMs in histone H3 tails. © 2014 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

27 CFR 24.282 - Multiple transfers.

Science.gov (United States)

2010-04-01

... 27 Alcohol, Tobacco Products and Firearms 1 2010-04-01 2010-04-01 false Multiple transfers. 24.282 Section 24.282 Alcohol, Tobacco Products and Firearms ALCOHOL AND TOBACCO TAX AND TRADE BUREAU, DEPARTMENT... transfer record for all wine (including distilling material and vinegar stock) transferred by pipeline to...

Combinatorial Aspects of the Generalized Euler's Totient

Directory of Open Access Journals (Sweden)

Nittiya Pabhapote

2010-01-01

Full Text Available A generalized Euler's totient is defined as a Dirichlet convolution of a power function and a product of the Souriau-Hsu-Möbius function with a completely multiplicative function. Two combinatorial aspects of the generalized Euler's totient, namely, its connections to other totients and its relations with counting formulae, are investigated.

Dynamic combinatorial chemistry to identify binders of ThiT, an S-component of the energy-coupling factor transporter for thiamine

NARCIS (Netherlands)

Monjas, Leticia; Swier, Lotteke J Y M; Setyawati, Inda; Slotboom, Dirk Jan; Hirsch, Anna Katharina Herta

2017-01-01

We applied dynamic combinatorial chemistry (DCC) to identify ligands of ThiT, the S-component of the energy-coupling factor (ECF) transporter for thiamine in Lactococcus lactis. We used a pre-equilibrated dynamic combinatorial library (DCL) and saturation-transfer difference (STD) NMR spectroscopy

Design and spectroscopic reflectometry characterization of pulsed laser deposition combinatorial libraries

International Nuclear Information System (INIS)

Schenck, Peter K.; Bassim, Nabil D.; Otani, Makoto; Oguchi, Hiroyuki; Green, Martin L.

2007-01-01

The goal of the design of pulsed laser deposition (PLD) combinatorial library films is to optimize the compositional coverage of the films while maintaining a uniform thickness. The deposition pattern of excimer laser PLD films can be modeled with a bimodal cos n distribution. Deposited films were characterized using a spectroscopic reflectometer (250-1000 nm) to map the thickness of both single composition calibration films and combinatorial library films. These distribution functions were used to simulate the composition and thickness of multiple target combinatorial library films. The simulations were correlated with electron-probe microanalysis wavelength-dispersive spectroscopy (EPMA-WDS) composition maps. The composition and thickness of the library films can be fine-tuned by adjusting the laser spot size, fluence, background gas pressure, target geometry and other processing parameters which affect the deposition pattern. Results from compositionally graded combinatorial library films of the ternary system Al 2 O 3 -HfO 2 -Y 2 O 3 are discussed

Criticism of EFSA's scientific opinion on combinatorial effects of 'stacked' GM plants.

Science.gov (United States)

Bøhn, Thomas

2018-01-01

Recent genetically modified plants tend to include both insect resistance and herbicide tolerance traits. Some of these 'stacked' GM plants have multiple Cry-toxins expressed as well as tolerance to several herbicides. This means that non-target organisms in the environment (biodiversity) will be co-exposed to multiple stressors simultaneously. A similar co-exposure may happen to consumers through chemical residues in the food chain. EFSA, the responsible unit for minimizing risk of harm in European food chains, has expressed its scientific interest in combinatorial effects. However, when new data showed how two Cry-toxins acted in combination (added toxicity), and that the same Cry-toxins showed combinatorial effects when co-exposed with Roundup (Bøhn et al., 2016), EFSA dismissed these new peer-reviewed results. In effect, EFSA claimed that combinatorial effects are not relevant for itself. EFSA was justifying this by referring to a policy question, and by making invalid assumptions, which could have been checked directly with the lead-author. With such approach, EFSA may miss the opportunity to improve its environmental and health risk assessment of toxins and pesticides in the food chain. Failure to follow its own published requests for combinatorial effects research, may also risk jeopardizing EFSA's scientific and public reputation. Copyright © 2017. Published by Elsevier Ltd.

A combinatorial approximation algorithm for CDMA downlink rate allocation

NARCIS (Netherlands)

Boucherie, Richardus J.; Bumb, A.F.; Endrayanto, A.I.; Woeginger, Gerhard; Raghavan, S.; Anandalingam, G.

2006-01-01

This paper presents a combinatorial algorithm for downlink rate allocation in Code Division Multiple Access (CDMA) mobile networks. By discretizing the coverage area into small segments, the transmit power requirements are characterized via a matrix representation that separates user and system

A combinatorial approximation algorithm for CDMA downlink rate allocation

NARCIS (Netherlands)

Boucherie, Richardus J.; Bumb, A.F.; Endrayanto, A.I.; Woeginger, Gerhard

2004-01-01

This paper presents a combinatorial algorithm for downlink rate allocation in Code Division Multiple Access (CDMA) mobile networks. By discretizing the coverage area into small segments, the transmit power requirements are characterized via a matrix representation that separates user and system

On-bead combinatorial synthesis and imaging of chemical exchange saturation transfer magnetic resonance imaging agents to identify factors that influence water exchange.

Science.gov (United States)

Napolitano, Roberta; Soesbe, Todd C; De León-Rodríguez, Luis M; Sherry, A Dean; Udugamasooriya, D Gomika

2011-08-24

The sensitivity of magnetic resonance imaging (MRI) contrast agents is highly dependent on the rate of water exchange between the inner sphere of a paramagnetic ion and bulk water. Normally, identifying a paramagnetic complex that has optimal water exchange kinetics is done by synthesizing and testing one compound at a time. We report here a rapid, economical on-bead combinatorial synthesis of a library of imaging agents. Eighty different 1,4,7,10-tetraazacyclododecan-1,4,7,10-tetraacetic acid (DOTA)-tetraamide peptoid derivatives were prepared on beads using a variety of charged, uncharged but polar, hydrophobic, and variably sized primary amines. A single chemical exchange saturation transfer image of the on-bead library easily distinguished those compounds having the most favorable water exchange kinetics. This combinatorial approach will allow rapid screening of libraries of imaging agents to identify the chemical characteristics of a ligand that yield the most sensitive imaging agents. This technique could be automated and readily adapted to other types of MRI or magnetic resonance/positron emission tomography agents as well.

Combinatorial commutative algebra

CERN Document Server

Miller, Ezra

2005-01-01

Offers an introduction to combinatorial commutative algebra, focusing on combinatorial techniques for multigraded polynomial rings, semigroup algebras, and determined rings. The chapters in this work cover topics ranging from homological invariants of monomial ideals and their polyhedral resolutions, to tools for studying algebraic varieties.

Dynamic combinatorial chemistry

NARCIS (Netherlands)

Otto, Sijbren; Furlan, Ricardo L.E.; Sanders, Jeremy K.M.

2002-01-01

A combinatorial library that responds to its target by increasing the concentration of strong binders at the expense of weak binders sounds ideal. Dynamic combinatorial chemistry has the potential to achieve exactly this. In this review, we will highlight the unique features that distinguish dynamic

Lexicographic goal programming and assessment tools for a combinatorial production problem.

Science.gov (United States)

2008-01-01

NP-complete combinatorial problems often necessitate the use of near-optimal solution techniques including : heuristics and metaheuristics. The addition of multiple optimization criteria can further complicate : comparison of these solution technique...

Relativity in Combinatorial Gravitational Fields

Directory of Open Access Journals (Sweden)

Mao Linfan

2010-04-01

Full Text Available A combinatorial spacetime $(mathscr{C}_G| uboverline{t}$ is a smoothly combinatorial manifold $mathscr{C}$ underlying a graph $G$ evolving on a time vector $overline{t}$. As we known, Einstein's general relativity is suitable for use only in one spacetime. What is its disguise in a combinatorial spacetime? Applying combinatorial Riemannian geometry enables us to present a combinatorial spacetime model for the Universe and suggest a generalized Einstein gravitational equation in such model. Forfinding its solutions, a generalized relativity principle, called projective principle is proposed, i.e., a physics law ina combinatorial spacetime is invariant under a projection on its a subspace and then a spherically symmetric multi-solutions ofgeneralized Einstein gravitational equations in vacuum or charged body are found. We also consider the geometrical structure in such solutions with physical formations, and conclude that an ultimate theory for the Universe maybe established if all such spacetimes in ${f R}^3$. Otherwise, our theory is only an approximate theory and endless forever.

Combinatorial Nano-Bio Interfaces.

Science.gov (United States)

Cai, Pingqiang; Zhang, Xiaoqian; Wang, Ming; Wu, Yun-Long; Chen, Xiaodong

2018-06-08

Nano-bio interfaces are emerging from the convergence of engineered nanomaterials and biological entities. Despite rapid growth, clinical translation of biomedical nanomaterials is heavily compromised by the lack of comprehensive understanding of biophysicochemical interactions at nano-bio interfaces. In the past decade, a few investigations have adopted a combinatorial approach toward decoding nano-bio interfaces. Combinatorial nano-bio interfaces comprise the design of nanocombinatorial libraries and high-throughput bioevaluation. In this Perspective, we address challenges in combinatorial nano-bio interfaces and call for multiparametric nanocombinatorics (composition, morphology, mechanics, surface chemistry), multiscale bioevaluation (biomolecules, organelles, cells, tissues/organs), and the recruitment of computational modeling and artificial intelligence. Leveraging combinatorial nano-bio interfaces will shed light on precision nanomedicine and its potential applications.

Systematic identification of combinatorial drivers and targets in cancer cell lines.

Directory of Open Access Journals (Sweden)

Adel Tabchy

Full Text Available There is an urgent need to elicit and validate highly efficacious targets for combinatorial intervention from large scale ongoing molecular characterization efforts of tumors. We established an in silico bioinformatic platform in concert with a high throughput screening platform evaluating 37 novel targeted agents in 669 extensively characterized cancer cell lines reflecting the genomic and tissue-type diversity of human cancers, to systematically identify combinatorial biomarkers of response and co-actionable targets in cancer. Genomic biomarkers discovered in a 141 cell line training set were validated in an independent 359 cell line test set. We identified co-occurring and mutually exclusive genomic events that represent potential drivers and combinatorial targets in cancer. We demonstrate multiple cooperating genomic events that predict sensitivity to drug intervention independent of tumor lineage. The coupling of scalable in silico and biologic high throughput cancer cell line platforms for the identification of co-events in cancer delivers rational combinatorial targets for synthetic lethal approaches with a high potential to pre-empt the emergence of resistance.

Systematic identification of combinatorial drivers and targets in cancer cell lines.

Science.gov (United States)

Tabchy, Adel; Eltonsy, Nevine; Housman, David E; Mills, Gordon B

2013-01-01

There is an urgent need to elicit and validate highly efficacious targets for combinatorial intervention from large scale ongoing molecular characterization efforts of tumors. We established an in silico bioinformatic platform in concert with a high throughput screening platform evaluating 37 novel targeted agents in 669 extensively characterized cancer cell lines reflecting the genomic and tissue-type diversity of human cancers, to systematically identify combinatorial biomarkers of response and co-actionable targets in cancer. Genomic biomarkers discovered in a 141 cell line training set were validated in an independent 359 cell line test set. We identified co-occurring and mutually exclusive genomic events that represent potential drivers and combinatorial targets in cancer. We demonstrate multiple cooperating genomic events that predict sensitivity to drug intervention independent of tumor lineage. The coupling of scalable in silico and biologic high throughput cancer cell line platforms for the identification of co-events in cancer delivers rational combinatorial targets for synthetic lethal approaches with a high potential to pre-empt the emergence of resistance.

Recent advances in combinatorial biosynthesis for drug discovery

Directory of Open Access Journals (Sweden)

Sun H

2015-02-01

Full Text Available Huihua Sun,1,* Zihe Liu,1,* Huimin Zhao,1,2 Ee Lui Ang1 1Metabolic Engineering Research Laboratory, Institute of Chemical and Engineering Sciences, Agency for Science, Technology and Research, Singapore; 2Department of Chemical and Biomolecular Engineering, University of Illinois at Urbana-Champaign, Urbana, IL, USA *These authors contributed equally to this work Abstract: Because of extraordinary structural diversity and broad biological activities, natural products have played a significant role in drug discovery. These therapeutically important secondary metabolites are assembled and modified by dedicated biosynthetic pathways in their host living organisms. Traditionally, chemists have attempted to synthesize natural product analogs that are important sources of new drugs. However, the extraordinary structural complexity of natural products sometimes makes it challenging for traditional chemical synthesis, which usually involves multiple steps, harsh conditions, toxic organic solvents, and byproduct wastes. In contrast, combinatorial biosynthesis exploits substrate promiscuity and employs engineered enzymes and pathways to produce novel “unnatural” natural products, substantially expanding the structural diversity of natural products with potential pharmaceutical value. Thus, combinatorial biosynthesis provides an environmentally friendly way to produce natural product analogs. Efficient expression of the combinatorial biosynthetic pathway in genetically tractable heterologous hosts can increase the titer of the compound, eventually resulting in less expensive drugs. In this review, we will discuss three major strategies for combinatorial biosynthesis: 1 precursor-directed biosynthesis; 2 enzyme-level modification, which includes swapping of the entire domains, modules and subunits, site-specific mutagenesis, and directed evolution; 3 pathway-level recombination. Recent examples of combinatorial biosynthesis employing these

Quantum fields and processes a combinatorial approach

CERN Document Server

Gough, John

2018-01-01

Wick ordering of creation and annihilation operators is of fundamental importance for computing averages and correlations in quantum field theory and, by extension, in the Hudson-Parthasarathy theory of quantum stochastic processes, quantum mechanics, stochastic processes, and probability. This book develops the unified combinatorial framework behind these examples, starting with the simplest mathematically, and working up to the Fock space setting for quantum fields. Emphasizing ideas from combinatorics such as the role of lattice of partitions for multiple stochastic integrals by Wallstrom-Rota and combinatorial species by Joyal, it presents insights coming from quantum probability. It also introduces a 'field calculus' which acts as a succinct alternative to standard Feynman diagrams and formulates quantum field theory (cumulant moments, Dyson-Schwinger equation, tree expansions, 1-particle irreducibility) in this language. Featuring many worked examples, the book is aimed at mathematical physicists, quant...

Quantum fields and processes a combinatorial approach

CERN Document Server

Gough, John

2018-01-01

Wick ordering of creation and annihilation operators is of fundamental importance for computing averages and correlations in quantum field theory and, by extension, in the Hudson–Parthasarathy theory of quantum stochastic processes, quantum mechanics, stochastic processes, and probability. This book develops the unified combinatorial framework behind these examples, starting with the simplest mathematically, and working up to the Fock space setting for quantum fields. Emphasizing ideas from combinatorics such as the role of lattice of partitions for multiple stochastic integrals by Wallstrom–Rota and combinatorial species by Joyal, it presents insights coming from quantum probability. It also introduces a 'field calculus' which acts as a succinct alternative to standard Feynman diagrams and formulates quantum field theory (cumulant moments, Dyson–Schwinger equation, tree expansions, 1-particle irreducibility) in this language. Featuring many worked examples, the book is aimed at mathematical physicists,...

Integer and combinatorial optimization

CERN Document Server

Nemhauser, George L

1999-01-01

Rave reviews for INTEGER AND COMBINATORIAL OPTIMIZATION ""This book provides an excellent introduction and survey of traditional fields of combinatorial optimization . . . It is indeed one of the best and most complete texts on combinatorial optimization . . . available. [And] with more than 700 entries, [it] has quite an exhaustive reference list.""-Optima ""A unifying approach to optimization problems is to formulate them like linear programming problems, while restricting some or all of the variables to the integers. This book is an encyclopedic resource for such f

Obfuscation Framework Based on Functionally Equivalent Combinatorial Logic Families

Science.gov (United States)

2008-03-01

of Defense, or the United States Government . AFIT/GCS/ENG/08-12 Obfuscation Framework Based on Functionally Equivalent Combinatorial Logic Families...time, United States policy strongly encourages the sale and transfer of some military equipment to foreign governments and makes it easier for...Proceedings of the International Conference on Availability, Reliability and Security, 2007. 14. McDonald, J. Todd and Alec Yasinsac. “Of unicorns and random

The construction of combinatorial manifolds with prescribed sets of links of vertices

International Nuclear Information System (INIS)

Gaifullin, A A

2008-01-01

To every oriented closed combinatorial manifold we assign the set (with repetitions) of isomorphism classes of links of its vertices. The resulting transformation L is the main object of study in this paper. We pose an inversion problem for L and show that this problem is closely related to Steenrod's problem on the realization of cycles and to the Rokhlin-Schwartz-Thom construction of combinatorial Pontryagin classes. We obtain a necessary condition for a set of isomorphism classes of combinatorial spheres to belong to the image of L. (Sets satisfying this condition are said to be balanced.) We give an explicit construction showing that every balanced set of isomorphism classes of combinatorial spheres falls into the image of L after passing to a multiple set and adding several pairs of the form (Z,-Z), where -Z is the sphere Z with the orientation reversed. Given any singular simplicial cycle ξ of a space X, this construction enables us to find explicitly a combinatorial manifold M and a map φ:M→X such that φ * [M]=r[ξ] for some positive integer r. The construction is based on resolving singularities of ξ. We give applications of the main construction to cobordisms of manifolds with singularities and cobordisms of simple cells. In particular, we prove that every rational additive invariant of cobordisms of manifolds with singularities admits a local formula. Another application is the construction of explicit (though inefficient) local combinatorial formulae for polynomials in the rational Pontryagin classes of combinatorial manifolds

On an extension of a combinatorial identity

Indian Academy of Sciences (India)

to an infinite family of 4-way combinatorial identities. In some particular cases we get even 5-way combinatorial identities which give us four new combinatorial versions of. Göllnitz–Gordon identities. Keywords. n-Color partitions; lattice paths; Frobenius partitions; Göllnitz–Gordon identities; combinatorial interpretations. 1.

Non-unique factorizations algebraic, combinatorial and analytic theory

CERN Document Server

Geroldinger, Alfred

2006-01-01

From its origins in algebraic number theory, the theory of non-unique factorizations has emerged as an independent branch of algebra and number theory. Focused efforts over the past few decades have wrought a great number and variety of results. However, these remain dispersed throughout the vast literature. For the first time, Non-Unique Factorizations: Algebraic, Combinatorial, and Analytic Theory offers a look at the present state of the theory in a single, unified resource.Taking a broad look at the algebraic, combinatorial, and analytic fundamentals, this book derives factorization results and applies them in concrete arithmetical situations using appropriate transfer principles. It begins with a basic introduction that can be understood with knowledge of standard basic algebra. The authors then move to the algebraic theory of monoids, arithmetic theory of monoids, the structure of sets of lengths, additive group theory, arithmetical invariants, and the arithmetic of Krull monoids. They also provide a s...

Paths and partitions: Combinatorial descriptions of the parafermionic states

Science.gov (United States)

Mathieu, Pierre

2009-09-01

The Zk parafermionic conformal field theories, despite the relative complexity of their modes algebra, offer the simplest context for the study of the bases of states and their different combinatorial representations. Three bases are known. The classic one is given by strings of the fundamental parafermionic operators whose sequences of modes are in correspondence with restricted partitions with parts at distance k -1 differing at least by 2. Another basis is expressed in terms of the ordered modes of the k -1 different parafermionic fields, which are in correspondence with the so-called multiple partitions. Both types of partitions have a natural (Bressoud) path representation. Finally, a third basis, formulated in terms of different paths, is inherited from the solution of the restricted solid-on-solid model of Andrews-Baxter-Forrester. The aim of this work is to review, in a unified and pedagogical exposition, these four different combinatorial representations of the states of the Zk parafermionic models. The first part of this article presents the different paths and partitions and their bijective relations; it is purely combinatorial, self-contained, and elementary; it can be read independently of the conformal-field-theory applications. The second part links this combinatorial analysis with the bases of states of the Zk parafermionic theories. With the prototypical example of the parafermionic models worked out in detail, this analysis contributes to fix some foundations for the combinatorial study of more complicated theories. Indeed, as we briefly indicate in ending, generalized versions of both the Bressoud and the Andrews-Baxter-Forrester paths emerge naturally in the description of the minimal models.

High performance multiple stream data transfer

International Nuclear Information System (INIS)

Rademakers, F.; Saiz, P.

2001-01-01

The ALICE detector at LHC (CERN), will record raw data at a rate of 1.2 Gigabytes per second. Trying to analyse all this data at CERN will not be feasible. As originally proposed by the MONARC project, data collected at CERN will be transferred to remote centres to use their computing infrastructure. The remote centres will reconstruct and analyse the events, and make available the results. Therefore high-rate data transfer between computing centres (Tiers) will become of paramount importance. The authors will present several tests that have been made between CERN and remote centres in Padova (Italy), Torino (Italy), Catania (Italy), Lyon (France), Ohio (United States), Warsaw (Poland) and Calcutta (India). These tests consisted, in a first stage, of sending raw data from CERN to the remote centres and back, using a ftp method that allows connections of several streams at the same time. Thanks to these multiple streams, it is possible to increase the rate at which the data is transferred. While several 'multiple stream ftp solutions' already exist, the authors' method is based on a parallel socket implementation which allows, besides files, also objects (or any large message) to be send in parallel. A prototype will be presented able to manage different transfers. This is the first step of a system to be implemented that will be able to take care of the connections with the remote centres to exchange data and monitor the status of the transfer

Combinatorial Hybrid Systems

DEFF Research Database (Denmark)

Larsen, Jesper Abildgaard; Wisniewski, Rafal; Grunnet, Jacob Deleuran

2008-01-01

indicates for a given face the future simplex. In the suggested definition we allow nondeterminacy in form of splitting and merging of solution trajectories. The combinatorial vector field gives rise to combinatorial counterparts of most concepts from dynamical systems, such as duals to vector fields, flow......, flow lines, fixed points and Lyapunov functions. Finally it will be shown how this theory extends to switched dynamical systems and an algorithmic overview of how to do supervisory control will be shown towards the end....

Combinatorial designs constructions and analysis

CERN Document Server

Stinson, Douglas R

2004-01-01

Created to teach students many of the most important techniques used for constructing combinatorial designs, this is an ideal textbook for advanced undergraduate and graduate courses in combinatorial design theory. The text features clear explanations of basic designs, such as Steiner and Kirkman triple systems, mutual orthogonal Latin squares, finite projective and affine planes, and Steiner quadruple systems. In these settings, the student will master various construction techniques, both classic and modern, and will be well-prepared to construct a vast array of combinatorial designs. Design theory offers a progressive approach to the subject, with carefully ordered results. It begins with simple constructions that gradually increase in complexity. Each design has a construction that contains new ideas or that reinforces and builds upon similar ideas previously introduced. A new text/reference covering all apsects of modern combinatorial design theory. Graduates and professionals in computer science, applie...

Integrative Analysis of Transcription Factor Combinatorial Interactions Using a Bayesian Tensor Factorization Approach

Science.gov (United States)

Ye, Yusen; Gao, Lin; Zhang, Shihua

2017-01-01

Transcription factors play a key role in transcriptional regulation of genes and determination of cellular identity through combinatorial interactions. However, current studies about combinatorial regulation is deficient due to lack of experimental data in the same cellular environment and extensive existence of data noise. Here, we adopt a Bayesian CANDECOMP/PARAFAC (CP) factorization approach (BCPF) to integrate multiple datasets in a network paradigm for determining precise TF interaction landscapes. In our first application, we apply BCPF to integrate three networks built based on diverse datasets of multiple cell lines from ENCODE respectively to predict a global and precise TF interaction network. This network gives 38 novel TF interactions with distinct biological functions. In our second application, we apply BCPF to seven types of cell type TF regulatory networks and predict seven cell lineage TF interaction networks, respectively. By further exploring the dynamics and modularity of them, we find cell lineage-specific hub TFs participate in cell type or lineage-specific regulation by interacting with non-specific TFs. Furthermore, we illustrate the biological function of hub TFs by taking those of cancer lineage and blood lineage as examples. Taken together, our integrative analysis can reveal more precise and extensive description about human TF combinatorial interactions. PMID:29033978

Pregnancy and Multiple Births rate after Transferring 2 or 3 Embryos

Directory of Open Access Journals (Sweden)

F Mostajeran

2006-05-01

Full Text Available Background: In vitro fertilization (IVF is a progressing common reproduction method and if the number of transferred embryo increases, the pregnancy rate and multiple pregnancies will increase which may lead to higher medical costs and human suffering. We compared pregnancy and multiple pregnancies rate after two or three transferred embryo via IVF. Methods: From April 2003 to June 2004, 301 referred infertile women to Isfahan infertility center underwent IVF with transferring two or three good quality embryos. Results: From 298 patients, 2 and 3 embryos were transferred in 155 patients and in 143 patients, respectively. Pregnancy rate was 19.4% versus 24.5% in 2 and 3 embryos transferred patients, respectively. Twin gestations were found in 5(3.2% of 2 embryos transferred patients and in 11(7.7% of 3 embryos transferred patients. Discussion: Transferring two or three embryos with good quality increase the rate of twin gestations in young women, without significant improve in the chance of singleton conception. Key words: In Vitro Fertilization, Multiple gestations, Embryo transfer

Combinatorial structures to modeling simple games and applications

Science.gov (United States)

Molinero, Xavier

2017-09-01

We connect three different topics: combinatorial structures, game theory and chemistry. In particular, we establish the bases to represent some simple games, defined as influence games, and molecules, defined from atoms, by using combinatorial structures. First, we characterize simple games as influence games using influence graphs. It let us to modeling simple games as combinatorial structures (from the viewpoint of structures or graphs). Second, we formally define molecules as combinations of atoms. It let us to modeling molecules as combinatorial structures (from the viewpoint of combinations). It is open to generate such combinatorial structures using some specific techniques as genetic algorithms, (meta-)heuristics algorithms and parallel programming, among others.

Dynamic combinatorial libraries : new opportunities in systems chemistry

NARCIS (Netherlands)

Hunt, Rosemary A. R.; Otto, Sijbren; Hunt, Rosemary A.R.

2011-01-01

Combinatorial chemistry is a tool for selecting molecules with special properties. Dynamic combinatorial chemistry started off aiming to be just that. However, unlike ordinary combinatorial chemistry, the interconnectedness of dynamic libraries gives them an extra dimension. An understanding of

Boltzmann Oracle for Combinatorial Systems

OpenAIRE

Pivoteau , Carine; Salvy , Bruno; Soria , Michèle

2008-01-01

International audience; Boltzmann random generation applies to well-defined systems of recursive combinatorial equations. It relies on oracles giving values of the enumeration generating series inside their disk of convergence. We show that the combinatorial systems translate into numerical iteration schemes that provide such oracles. In particular, we give a fast oracle based on Newton iteration.

Combinatorial Interpretation of General Eulerian Numbers

OpenAIRE

Tingyao Xiong; Jonathan I. Hall; Hung-Ping Tsao

2014-01-01

Since 1950s, mathematicians have successfully interpreted the traditional Eulerian numbers and $q-$Eulerian numbers combinatorially. In this paper, the authors give a combinatorial interpretation to the general Eulerian numbers defined on general arithmetic progressions { a, a+d, a+2d,...}.

Combinatorial optimization on a Boltzmann machine

NARCIS (Netherlands)

Korst, J.H.M.; Aarts, E.H.L.

1989-01-01

We discuss the problem of solving (approximately) combinatorial optimization problems on a Boltzmann machine. It is shown for a number of combinatorial optimization problems how they can be mapped directly onto a Boltzmann machine by choosing appropriate connection patterns and connection strengths.

Combinatorial synthesis of natural products

DEFF Research Database (Denmark)

Nielsen, John

2002-01-01

Combinatorial syntheses allow production of compound libraries in an expeditious and organized manner immediately applicable for high-throughput screening. Natural products possess a pedigree to justify quality and appreciation in drug discovery and development. Currently, we are seeing a rapid...... increase in application of natural products in combinatorial chemistry and vice versa. The therapeutic areas of infectious disease and oncology still dominate but many new areas are emerging. Several complex natural products have now been synthesised by solid-phase methods and have created the foundation...... for preparation of combinatorial libraries. In other examples, natural products or intermediates have served as building blocks or scaffolds in the synthesis of complex natural products, bioactive analogues or designed hybrid molecules. Finally, structural motifs from the biologically active parent molecule have...

Tumor-targeting peptides from combinatorial libraries*

Science.gov (United States)

Liu, Ruiwu; Li, Xiaocen; Xiao, Wenwu; Lam, Kit S.

2018-01-01

Cancer is one of the major and leading causes of death worldwide. Two of the greatest challenges infighting cancer are early detection and effective treatments with no or minimum side effects. Widespread use of targeted therapies and molecular imaging in clinics requires high affinity, tumor-specific agents as effective targeting vehicles to deliver therapeutics and imaging probes to the primary or metastatic tumor sites. Combinatorial libraries such as phage-display and one-bead one-compound (OBOC) peptide libraries are powerful approaches in discovering tumor-targeting peptides. This review gives an overview of different combinatorial library technologies that have been used for the discovery of tumor-targeting peptides. Examples of tumor-targeting peptides identified from each combinatorial library method will be discussed. Published tumor-targeting peptide ligands and their applications will also be summarized by the combinatorial library methods and their corresponding binding receptors. PMID:27210583

Middle-down hybrid chromatography/tandem mass spectrometry workflow for characterization of combinatorial post-translational modifications in histones

DEFF Research Database (Denmark)

Sidoli, Simone; Schwämmle, Veit; Ruminowicz, Chrystian

2014-01-01

chromatography (WCX-HILIC) interfaced directly to high mass accuracy ESI MS/MS using electron transfer dissociation (ETD). This enabled automated and efficient separation and sequencing of hypermodified histone N-terminal tails for unambiguous localization of combinatorial PTMs. We present Histone Coder and Iso...

Neural Meta-Memes Framework for Combinatorial Optimization

Science.gov (United States)

Song, Li Qin; Lim, Meng Hiot; Ong, Yew Soon

In this paper, we present a Neural Meta-Memes Framework (NMMF) for combinatorial optimization. NMMF is a framework which models basic optimization algorithms as memes and manages them dynamically when solving combinatorial problems. NMMF encompasses neural networks which serve as the overall planner/coordinator to balance the workload between memes. We show the efficacy of the proposed NMMF through empirical study on a class of combinatorial problem, the quadratic assignment problem (QAP).

Number systems and combinatorial problems

OpenAIRE

Yordzhev, Krasimir

2014-01-01

The present work has been designed for students in secondary school and their teachers in mathematics. We will show how with the help of our knowledge of number systems we can solve problems from other fields of mathematics for example in combinatorial analysis and most of all when proving some combinatorial identities. To demonstrate discussed in this article method we have chosen several suitable mathematical tasks.

Introduction to combinatorial geometry

International Nuclear Information System (INIS)

Gabriel, T.A.; Emmett, M.B.

1985-01-01

The combinatorial geometry package as used in many three-dimensional multimedia Monte Carlo radiation transport codes, such as HETC, MORSE, and EGS, is becoming the preferred way to describe simple and complicated systems. Just about any system can be modeled using the package with relatively few input statements. This can be contrasted against the older style geometry packages in which the required input statements could be large even for relatively simple systems. However, with advancements come some difficulties. The users of combinatorial geometry must be able to visualize more, and, in some instances, all of the system at a time. Errors can be introduced into the modeling which, though slight, and at times hard to detect, can have devastating effects on the calculated results. As with all modeling packages, the best way to learn the combinatorial geometry is to use it, first on a simple system then on more complicated systems. The basic technique for the description of the geometry consists of defining the location and shape of the various zones in terms of the intersections and unions of geometric bodies. The geometric bodies which are generally included in most combinatorial geometry packages are: (1) box, (2) right parallelepiped, (3) sphere, (4) right circular cylinder, (5) right elliptic cylinder, (6) ellipsoid, (7) truncated right cone, (8) right angle wedge, and (9) arbitrary polyhedron. The data necessary to describe each of these bodies are given. As can be easily noted, there are some subsets included for simplicity

Affinity-based screening of combinatorial libraries using automated, serial-column chromatography

Energy Technology Data Exchange (ETDEWEB)

Evans, D.M.; Williams, K.P.; McGuinness, B. [PerSeptive Biosystems, Framingham, MA (United States)] [and others

1996-04-01

The authors have developed an automated serial chromatographic technique for screening a library of compounds based upon their relative affinity for a target molecule. A {open_quotes}target{close_quotes} column containing the immobilized target molecule is set in tandem with a reversed-phase column. A combinatorial peptide library is injected onto the target column. The target-bound peptides are eluted from the first column and transferred automatically to the reversed-phase column. The target-specific peptide peaks from the reversed-phase column are identified and sequenced. Using a monoclonal antibody (3E-7) against {beta}-endorphin as a target, we selected a single peptide with sequence YGGFL from approximately 5800 peptides present in a combinatorial library. We demonstrated the applicability of the technology towards selection of peptides with predetermined affinity for bacterial lipopolysaccharide (LPS, endotoxin). We expect that this technology will have broad applications for high throughput screening of chemical libraries or natural product extracts. 21 refs., 4 figs.

Introduction to combinatorial designs

CERN Document Server

Wallis, WD

2007-01-01

Combinatorial theory is one of the fastest growing areas of modern mathematics. Focusing on a major part of this subject, Introduction to Combinatorial Designs, Second Edition provides a solid foundation in the classical areas of design theory as well as in more contemporary designs based on applications in a variety of fields. After an overview of basic concepts, the text introduces balanced designs and finite geometries. The author then delves into balanced incomplete block designs, covering difference methods, residual and derived designs, and resolvability. Following a chapter on the e

Use of combinatorial chemistry to speed drug discovery.

Science.gov (United States)

Rádl, S

1998-10-01

IBC's International Conference on Integrating Combinatorial Chemistry into the Discovery Pipeline was held September 14-15, 1998. The program started with a pre-conference workshop on High-Throughput Compound Characterization and Purification. The agenda of the main conference was divided into sessions of Synthesis, Automation and Unique Chemistries; Integrating Combinatorial Chemistry, Medicinal Chemistry and Screening; Combinatorial Chemistry Applications for Drug Discovery; and Information and Data Management. This meeting was an excellent opportunity to see how big pharma, biotech and service companies are addressing the current bottlenecks in combinatorial chemistry to speed drug discovery. (c) 1998 Prous Science. All rights reserved.

A binary plasmid system for shuffling combinatorial antibody libraries.

OpenAIRE

Collet, T A; Roben, P; O'Kennedy, R; Barbas, C F; Burton, D R; Lerner, R A

1992-01-01

We have used a binary system of replicon-compatible plasmids to test the potential for promiscuous recombination of heavy and light chains within sets of human Fab fragments isolated from combinatorial antibody libraries. Antibody molecules showed a surprising amount of promiscuity in that a particular heavy chain could recombine with multiple light chains with retention of binding to a protein antigen. The degree to which a given heavy chain productively paired with any light chain to bind a...

Asessing for Structural Understanding in Childrens' Combinatorial Problem Solving.

Science.gov (United States)

English, Lyn

1999-01-01

Assesses children's structural understanding of combinatorial problems when presented in a variety of task situations. Provides an explanatory model of students' combinatorial understandings that informs teaching and assessment. Addresses several components of children's structural understanding of elementary combinatorial problems. (Contains 50…

Dynamic combinatorial chemistry with diselenides and disulfides in water

DEFF Research Database (Denmark)

Rasmussen, Brian; Sørensen, Anne; Gotfredsen, Henrik

2014-01-01

Diselenide exchange is introduced as a reversible reaction in dynamic combinatorial chemistry in water. At neutral pH, diselenides are found to mix with disulfides and form dynamic combinatorial libraries of diselenides, disulfides, and selenenylsulfides. This journal is......Diselenide exchange is introduced as a reversible reaction in dynamic combinatorial chemistry in water. At neutral pH, diselenides are found to mix with disulfides and form dynamic combinatorial libraries of diselenides, disulfides, and selenenylsulfides. This journal is...

Fourier analysis in combinatorial number theory

International Nuclear Information System (INIS)

Shkredov, Il'ya D

2010-01-01

In this survey applications of harmonic analysis to combinatorial number theory are considered. Discussion topics include classical problems of additive combinatorics, colouring problems, higher-order Fourier analysis, theorems about sets of large trigonometric sums, results on estimates for trigonometric sums over subgroups, and the connection between combinatorial and analytic number theory. Bibliography: 162 titles.

Fourier analysis in combinatorial number theory

Energy Technology Data Exchange (ETDEWEB)

Shkredov, Il' ya D [M. V. Lomonosov Moscow State University, Moscow (Russian Federation)

2010-09-16

In this survey applications of harmonic analysis to combinatorial number theory are considered. Discussion topics include classical problems of additive combinatorics, colouring problems, higher-order Fourier analysis, theorems about sets of large trigonometric sums, results on estimates for trigonometric sums over subgroups, and the connection between combinatorial and analytic number theory. Bibliography: 162 titles.

Solid-Phase Synthesis of Small Molecule Libraries using Double Combinatorial Chemistry

DEFF Research Database (Denmark)

Nielsen, John; Jensen, Flemming R.

1997-01-01

The first synthesis of a combinatorial library using double combinatorial chemistry is presented. Coupling of unprotected Fmoc-tyrosine to the solid support was followed by Mitsunobu O-alkylation. Introduction of a diacid linker yields a system in which the double combinatorial step can be demons......The first synthesis of a combinatorial library using double combinatorial chemistry is presented. Coupling of unprotected Fmoc-tyrosine to the solid support was followed by Mitsunobu O-alkylation. Introduction of a diacid linker yields a system in which the double combinatorial step can...

Local formulae for combinatorial Pontryagin classes

International Nuclear Information System (INIS)

Gaifullin, Alexander A

2004-01-01

Let p(|K|) be the characteristic class of a combinatorial manifold K given by a polynomial p in the rational Pontryagin classes of K. We prove that for any polynomial p there is a function taking each combinatorial manifold K to a cycle z p (K) in its rational simplicial chains such that: 1) the Poincare dual of z p (K) represents the cohomology class p(|K|); 2) the coefficient of each simplex Δ in the cycle z p (K) is determined solely by the combinatorial type of linkΔ. We explicitly describe all such functions for the first Pontryagin class. We obtain estimates for the denominators of the coefficients of the simplices in the cycles z p (K)

Heterogenous phase as a mean in combinatorial chemistry

International Nuclear Information System (INIS)

Abdel-Hamid, S.G.

2007-01-01

Combinatorial chemistry is a rapid and inexpensive technique for the synthesis of hundreds of thousands of organic compounds of potential medicinal activity. In the past few decades a large number of combinatorial libraries have been constructed, and significantly supplement the chemical diversity of the traditional collections of the potentially active medicinal compounds. Solid phase synthesis was used to enrich the combinatorial chemistry libraries, through the use of solid supports (resins) and their modified forms. Most of the new libraries of compounds appeared recently, were synthesized by the use of solid-phase. Solid-phase combinatorial chemistry (SPCC) is now considered as an outstanding branch in pharmaceutical chemistry research and used extensively as a tool for drug discovery within the context of high-throughput chemical synthesis. The best pure libraries synthesized by the use of solid phase combinatorial chemistry (SPCC) may well be those of intermediate complexity that are free of artifact-causing nuisance compounds. (author)

MIFT: GIFT Combinatorial Geometry Input to VCS Code

Science.gov (United States)

1977-03-01

r-w w-^ H ^ß0318is CQ BRL °RCUMr REPORT NO. 1967 —-S: ... MIFT: GIFT COMBINATORIAL GEOMETRY INPUT TO VCS CODE Albert E...TITLE (and Subtitle) MIFT: GIFT Combinatorial Geometry Input to VCS Code S. TYPE OF REPORT & PERIOD COVERED FINAL 6. PERFORMING ORG. REPORT NUMBER...Vehicle Code System (VCS) called MORSE was modified to accept the GIFT combinatorial geometry package. GIFT , as opposed to the geometry package

Combinatorial optimization theory and algorithms

CERN Document Server

Korte, Bernhard

2018-01-01

This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This sixth edition has again been updated, revised, and significantly extended. Among other additions, there are new sections on shallow-light trees, submodular function maximization, smoothed analysis of the knapsack problem, the (ln 4+ɛ)-approximation for Steiner trees, and the VPN theorem. Thus, this book continues to represent the state of the art of combinatorial opti...

Combinatorial stresses kill pathogenic Candida species

Science.gov (United States)

Kaloriti, Despoina; Tillmann, Anna; Cook, Emily; Jacobsen, Mette; You, Tao; Lenardon, Megan; Ames, Lauren; Barahona, Mauricio; Chandrasekaran, Komelapriya; Coghill, George; Goodman, Daniel; Gow, Neil A. R.; Grebogi, Celso; Ho, Hsueh-Lui; Ingram, Piers; McDonagh, Andrew; De Moura, Alessandro P. S.; Pang, Wei; Puttnam, Melanie; Radmaneshfar, Elahe; Romano, Maria Carmen; Silk, Daniel; Stark, Jaroslav; Stumpf, Michael; Thiel, Marco; Thorne, Thomas; Usher, Jane; Yin, Zhikang; Haynes, Ken; Brown, Alistair J. P.

2012-01-01

Pathogenic microbes exist in dynamic niches and have evolved robust adaptive responses to promote survival in their hosts. The major fungal pathogens of humans, Candida albicans and Candida glabrata, are exposed to a range of environmental stresses in their hosts including osmotic, oxidative and nitrosative stresses. Significant efforts have been devoted to the characterization of the adaptive responses to each of these stresses. In the wild, cells are frequently exposed simultaneously to combinations of these stresses and yet the effects of such combinatorial stresses have not been explored. We have developed a common experimental platform to facilitate the comparison of combinatorial stress responses in C. glabrata and C. albicans. This platform is based on the growth of cells in buffered rich medium at 30°C, and was used to define relatively low, medium and high doses of osmotic (NaCl), oxidative (H 2O2) and nitrosative stresses (e.g., dipropylenetriamine (DPTA)-NONOate). The effects of combinatorial stresses were compared with the corresponding individual stresses under these growth conditions. We show for the first time that certain combinations of combinatorial stress are especially potent in terms of their ability to kill C. albicans and C. glabrata and/or inhibit their growth. This was the case for combinations of osmotic plus oxidative stress and for oxidative plus nitrosative stress. We predict that combinatorial stresses may be highly signif cant in host defences against these pathogenic yeasts. PMID:22463109

Toward Chemical Implementation of Encoded Combinatorial Libraries

DEFF Research Database (Denmark)

Nielsen, John; Janda, Kim D.

1994-01-01

The recent application of "combinatorial libraries" to supplement existing drug screening processes might simplify and accelerate the search for new lead compounds or drugs. Recently, a scheme for encoded combinatorial chemistry was put forward to surmount a number of the limitations possessed...

A New Approach for Proving or Generating Combinatorial Identities

Science.gov (United States)

Gonzalez, Luis

2010-01-01

A new method for proving, in an immediate way, many combinatorial identities is presented. The method is based on a simple recursive combinatorial formula involving n + 1 arbitrary real parameters. Moreover, this formula enables one not only to prove, but also generate many different combinatorial identities (not being required to know them "a…

Combinatorial methods with computer applications

CERN Document Server

Gross, Jonathan L

2007-01-01

Combinatorial Methods with Computer Applications provides in-depth coverage of recurrences, generating functions, partitions, and permutations, along with some of the most interesting graph and network topics, design constructions, and finite geometries. Requiring only a foundation in discrete mathematics, it can serve as the textbook in a combinatorial methods course or in a combined graph theory and combinatorics course.After an introduction to combinatorics, the book explores six systematic approaches within a comprehensive framework: sequences, solving recurrences, evaluating summation exp

The priming of basic combinatory responses in MEG.

Science.gov (United States)

Blanco-Elorrieta, Esti; Ferreira, Victor S; Del Prato, Paul; Pylkkänen, Liina

2018-01-01

Priming has been a powerful tool for the study of human memory and especially the memory representations relevant for language. However, although it is well established that lexical access can be primed, we do not know exactly what types of computations can be primed above the word level. This work took a neurobiological approach and assessed the ways in which the complex representation of a minimal combinatory phrase, such as red boat, can be primed, as evidenced by the spatiotemporal profiles of magnetoencephalography (MEG) signals. Specifically, we built upon recent progress on the neural signatures of phrasal composition and tested whether the brain activities implicated for the basic combination of two words could be primed. In two experiments, MEG was recorded during a picture naming task where the prime trials were designed to replicate previously reported combinatory effects and the target trials to test whether those combinatory effects could be primed. The manipulation of the primes was successful in eliciting larger activity for adjective-noun combinations than single nouns in left anterior temporal and ventromedial prefrontal cortices, replicating prior MEG studies on parallel contrasts. Priming of similarly timed activity was observed during target trials in anterior temporal cortex, but only when the prime and target shared an adjective. No priming in temporal cortex was observed for single word repetition and two control tasks showed that the priming effect was not elicited if the prime pictures were simply viewed but not named. In sum, this work provides evidence that very basic combinatory operations can be primed, with the necessity for some lexical overlap between prime and target suggesting combinatory conceptual, as opposed to syntactic processing. Both our combinatory and priming effects were early, onsetting between 100 and 150ms after picture onset and thus are likely to reflect the very earliest planning stages of a combinatory message

Analysis and design of algorithms for combinatorial problems

CERN Document Server

Ausiello, G

1985-01-01

Combinatorial problems have been from the very beginning part of the history of mathematics. By the Sixties, the main classes of combinatorial problems had been defined. During that decade, a great number of research contributions in graph theory had been produced, which laid the foundations for most of the research in graph optimization in the following years. During the Seventies, a large number of special purpose models were developed. The impressive growth of this field since has been strongly determined by the demand of applications and influenced by the technological increases in computing power and the availability of data and software. The availability of such basic tools has led to the feasibility of the exact or well approximate solution of large scale realistic combinatorial optimization problems and has created a number of new combinatorial problems.

Bifurcation-based approach reveals synergism and optimal combinatorial perturbation.

Science.gov (United States)

Liu, Yanwei; Li, Shanshan; Liu, Zengrong; Wang, Ruiqi

2016-06-01

Cells accomplish the process of fate decisions and form terminal lineages through a series of binary choices in which cells switch stable states from one branch to another as the interacting strengths of regulatory factors continuously vary. Various combinatorial effects may occur because almost all regulatory processes are managed in a combinatorial fashion. Combinatorial regulation is crucial for cell fate decisions because it may effectively integrate many different signaling pathways to meet the higher regulation demand during cell development. However, whether the contribution of combinatorial regulation to the state transition is better than that of a single one and if so, what the optimal combination strategy is, seem to be significant issue from the point of view of both biology and mathematics. Using the approaches of combinatorial perturbations and bifurcation analysis, we provide a general framework for the quantitative analysis of synergism in molecular networks. Different from the known methods, the bifurcation-based approach depends only on stable state responses to stimuli because the state transition induced by combinatorial perturbations occurs between stable states. More importantly, an optimal combinatorial perturbation strategy can be determined by investigating the relationship between the bifurcation curve of a synergistic perturbation pair and the level set of a specific objective function. The approach is applied to two models, i.e., a theoretical multistable decision model and a biologically realistic CREB model, to show its validity, although the approach holds for a general class of biological systems.

Similarity searching and scaffold hopping in synthetically accessible combinatorial chemistry spaces.

Science.gov (United States)

Boehm, Markus; Wu, Tong-Ying; Claussen, Holger; Lemmen, Christian

2008-04-24

Large collections of combinatorial libraries are an integral element in today's pharmaceutical industry. It is of great interest to perform similarity searches against all virtual compounds that are synthetically accessible by any such library. Here we describe the successful application of a new software tool CoLibri on 358 combinatorial libraries based on validated reaction protocols to create a single chemistry space containing over 10 (12) possible products. Similarity searching with FTrees-FS allows the systematic exploration of this space without the need to enumerate all product structures. The search result is a set of virtual hits which are synthetically accessible by one or more of the existing reaction protocols. Grouping these virtual hits by their synthetic protocols allows the rapid design and synthesis of multiple follow-up libraries. Such library ideas support hit-to-lead design efforts for tasks like follow-up from high-throughput screening hits or scaffold hopping from one hit to another attractive series.

Morphological Constraints on Cerebellar Granule Cell Combinatorial Diversity.

Science.gov (United States)

Gilmer, Jesse I; Person, Abigail L

2017-12-13

Combinatorial expansion by the cerebellar granule cell layer (GCL) is fundamental to theories of cerebellar contributions to motor control and learning. Granule cells (GrCs) sample approximately four mossy fiber inputs and are thought to form a combinatorial code useful for pattern separation and learning. We constructed a spatially realistic model of the cerebellar GCL and examined how GCL architecture contributes to GrC combinatorial diversity. We found that GrC combinatorial diversity saturates quickly as mossy fiber input diversity increases, and that this saturation is in part a consequence of short dendrites, which limit access to diverse inputs and favor dense sampling of local inputs. This local sampling also produced GrCs that were combinatorially redundant, even when input diversity was extremely high. In addition, we found that mossy fiber clustering, which is a common anatomical pattern, also led to increased redundancy of GrC input combinations. We related this redundancy to hypothesized roles of temporal expansion of GrC information encoding in service of learned timing, and we show that GCL architecture produces GrC populations that support both temporal and combinatorial expansion. Finally, we used novel anatomical measurements from mice of either sex to inform modeling of sparse and filopodia-bearing mossy fibers, finding that these circuit features uniquely contribute to enhancing GrC diversification and redundancy. Our results complement information theoretic studies of granule layer structure and provide insight into the contributions of granule layer anatomical features to afferent mixing. SIGNIFICANCE STATEMENT Cerebellar granule cells are among the simplest neurons, with tiny somata and, on average, just four dendrites. These characteristics, along with their dense organization, inspired influential theoretical work on the granule cell layer as a combinatorial expander, where each granule cell represents a unique combination of inputs

Torus actions, combinatorial topology, and homological algebra

International Nuclear Information System (INIS)

Bukhshtaber, V M; Panov, T E

2000-01-01

This paper is a survey of new results and open problems connected with fundamental combinatorial concepts, including polytopes, simplicial complexes, cubical complexes, and arrangements of subspaces. Attention is concentrated on simplicial and cubical subdivisions of manifolds, and especially on spheres. Important constructions are described that enable one to study these combinatorial objects by using commutative and homological algebra. The proposed approach to combinatorial problems is based on the theory of moment-angle complexes recently developed by the authors. The crucial construction assigns to each simplicial complex K with m vertices a T m -space Z K with special bigraded cellular decomposition. In the framework of this theory, well-known non-singular toric varieties arise as orbit spaces of maximally free actions of subtori on moment-angle complexes corresponding to simplicial spheres. It is shown that diverse invariants of simplicial complexes and related combinatorial-geometric objects can be expressed in terms of bigraded cohomology rings of the corresponding moment-angle complexes. Finally, it is shown that the new relationships between combinatorics, geometry, and topology lead to solutions of some well-known topological problems

Combinatorial Screening for Transgenic Yeasts with High Cellulase Activities in Combination with a Tunable Expression System.

Directory of Open Access Journals (Sweden)

Yoichiro Ito

Full Text Available Combinatorial screening used together with a broad library of gene expression cassettes is expected to produce a powerful tool for the optimization of the simultaneous expression of multiple enzymes. Recently, we proposed a highly tunable protein expression system that utilized multiple genome-integrated target genes to fine-tune enzyme expression in yeast cells. This tunable system included a library of expression cassettes each composed of three gene-expression control elements that in different combinations produced a wide range of protein expression levels. In this study, four gene expression cassettes with graded protein expression levels were applied to the expression of three cellulases: cellobiohydrolase 1, cellobiohydrolase 2, and endoglucanase 2. After combinatorial screening for transgenic yeasts simultaneously secreting these three cellulases, we obtained strains with higher cellulase expressions than a strain harboring three cellulase-expression constructs within one high-performance gene expression cassette. These results show that our method will be of broad use throughout the field of metabolic engineering.

Combinatorial Screening for Transgenic Yeasts with High Cellulase Activities in Combination with a Tunable Expression System

Science.gov (United States)

Ito, Yoichiro; Yamanishi, Mamoru; Ikeuchi, Akinori; Imamura, Chie; Matsuyama, Takashi

2015-01-01

Combinatorial screening used together with a broad library of gene expression cassettes is expected to produce a powerful tool for the optimization of the simultaneous expression of multiple enzymes. Recently, we proposed a highly tunable protein expression system that utilized multiple genome-integrated target genes to fine-tune enzyme expression in yeast cells. This tunable system included a library of expression cassettes each composed of three gene-expression control elements that in different combinations produced a wide range of protein expression levels. In this study, four gene expression cassettes with graded protein expression levels were applied to the expression of three cellulases: cellobiohydrolase 1, cellobiohydrolase 2, and endoglucanase 2. After combinatorial screening for transgenic yeasts simultaneously secreting these three cellulases, we obtained strains with higher cellulase expressions than a strain harboring three cellulase-expression constructs within one high-performance gene expression cassette. These results show that our method will be of broad use throughout the field of metabolic engineering. PMID:26692026

Combinatorial matrix theory

CERN Document Server

Mitjana, Margarida

2018-01-01

This book contains the notes of the lectures delivered at an Advanced Course on Combinatorial Matrix Theory held at Centre de Recerca Matemàtica (CRM) in Barcelona. These notes correspond to five series of lectures. The first series is dedicated to the study of several matrix classes defined combinatorially, and was delivered by Richard A. Brualdi. The second one, given by Pauline van den Driessche, is concerned with the study of spectral properties of matrices with a given sign pattern. Dragan Stevanović delivered the third one, devoted to describing the spectral radius of a graph as a tool to provide bounds of parameters related with properties of a graph. The fourth lecture was delivered by Stephen Kirkland and is dedicated to the applications of the Group Inverse of the Laplacian matrix. The last one, given by Ángeles Carmona, focuses on boundary value problems on finite networks with special in-depth on the M-matrix inverse problem.

Combinatorial identities for tenth order mock theta functions

Indian Academy of Sciences (India)

44

which lead us to one 4-way and one 3-way combinatorial identity. ... mock theta functions, partition identities and different combinatorial parameters, see for ... 3. Example 1.1. There are twelve (n + 1)–color partitions of 2: 21, 21 + 01, 11 + 11, ...

On the combinatorial foundations of Regge-calculus

International Nuclear Information System (INIS)

Budach, L.

1989-01-01

Lipschitz-Killing curvatures of piecewise flat spaces are combinatorial analogues of Lipschitz-Killing curvatures of Riemannian manifolds. In the following paper rigorous combinatorial representations and proofs of all basic results for Lipschitz-Killing curvatures not using analytic arguments are given. The principal tools for an elementary representation of Regge calculus can be developed by means of basic properties of dihedral angles. (author)

Combinatorial Speculations and the Combinatorial Conjecture for Mathematics

OpenAIRE

Mao, Linfan

2006-01-01

Combinatorics is a powerful tool for dealing with relations among objectives mushroomed in the past century. However, an more important work for mathematician is to apply combinatorics to other mathematics and other sciences not merely to find combinatorial behavior for objectives. Recently, such research works appeared on journals for mathematics and theoretical physics on cosmos. The main purpose of this paper is to survey these thinking and ideas for mathematics and cosmological physics, s...

Manipulating Combinatorial Structures.

Science.gov (United States)

Labelle, Gilbert

This set of transparencies shows how the manipulation of combinatorial structures in the context of modern combinatorics can easily lead to interesting teaching and learning activities at every level of education from elementary school to university. The transparencies describe: (1) the importance and relations of combinatorics to science and…

Cubical version of combinatorial differential forms

DEFF Research Database (Denmark)

Kock, Anders

2010-01-01

The theory of combinatorial differential forms is usually presented in simplicial terms. We present here a cubical version; it depends on the possibility of forming affine combinations of mutual neighbour points in a manifold, in the context of synthetic differential geometry.......The theory of combinatorial differential forms is usually presented in simplicial terms. We present here a cubical version; it depends on the possibility of forming affine combinations of mutual neighbour points in a manifold, in the context of synthetic differential geometry....

Some experience of shielding calculations by combinatorial method

International Nuclear Information System (INIS)

Korobejnikov, V.V.; Oussanov, V.I.

1996-01-01

Some aspects of the compound systems shielding calculations by a combinatorial approach are discussed. The effectiveness of such an approach is based on the fundamental characteristic of a compound system: if some element of the system have in itself mathematical or physical properties favorable for calculation, these properties may be used in a combinatorial approach and are lost when the system is being calculated in the whole by a direct approach. The combinatorial technique applied is well known. A compound system are being splitting for two or more auxiliary subsystems (so that calculation each of them is a more simple problem than calculation of the original problem (or at last is a soluble problem if original one is not). Calculation of every subsystem are carried out by suitable method and code, the coupling being made through boundary conditions or boundary source. The special consideration in the paper is given to a fast reactor shielding combinatorial analysis and to the testing of the results received. (author)

Solid-Phase Synthesis of Small Molecule Libraries using Double Combinatorial Chemistry

DEFF Research Database (Denmark)

Nielsen, John; Jensen, Flemming R.

1997-01-01

The first synthesis of a combinatorial library using double combinatorial chemistry is presented. Coupling of unprotected Fmoc-tyrosine to the solid support was followed by Mitsunobu O-alkylation. Introduction of a diacid linker yields a system in which the double combinatorial step can be demons...

Accessing Specific Peptide Recognition by Combinatorial Chemistry

DEFF Research Database (Denmark)

Li, Ming

Molecular recognition is at the basis of all processes for life, and plays a central role in many biological processes, such as protein folding, the structural organization of cells and organelles, signal transduction, and the immune response. Hence, my PhD project is entitled “Accessing Specific...... Peptide Recognition by Combinatorial Chemistry”. Molecular recognition is a specific interaction between two or more molecules through noncovalent bonding, such as hydrogen bonding, metal coordination, van der Waals forces, π−π, hydrophobic, or electrostatic interactions. The association involves kinetic....... Combinatorial chemistry was invented in 1980s based on observation of functional aspects of the adaptive immune system. It was employed for drug development and optimization in conjunction with high-throughput synthesis and screening. (chapter 2) Combinatorial chemistry is able to rapidly produce many thousands...

Laplace transform analysis of a multiplicative asset transfer model

Science.gov (United States)

Sokolov, Andrey; Melatos, Andrew; Kieu, Tien

2010-07-01

We analyze a simple asset transfer model in which the transfer amount is a fixed fraction f of the giver’s wealth. The model is analyzed in a new way by Laplace transforming the master equation, solving it analytically and numerically for the steady-state distribution, and exploring the solutions for various values of f∈(0,1). The Laplace transform analysis is superior to agent-based simulations as it does not depend on the number of agents, enabling us to study entropy and inequality in regimes that are costly to address with simulations. We demonstrate that Boltzmann entropy is not a suitable (e.g. non-monotonic) measure of disorder in a multiplicative asset transfer system and suggest an asymmetric stochastic process that is equivalent to the asset transfer model.

Immune-Stimulating Combinatorial Therapy for Prostate Cancer

Science.gov (United States)

2016-10-01

Overlap: None 20 90061946 (Drake) Title: Epigenetic Drugs and Immuno Therapy for Prostate Cancer (EDIT-PC) Effort: 1.2 calendar months (10% effort...AWARD NUMBER: W81XWH-15-1-0667 TITLE: Immune-Stimulating Combinatorial Therapy for Prostate Cancer PRINCIPAL INVESTIGATOR: Robert Ivkov...Stimulating Combinatorial Therapy for Prostate Cancer 5a. CONTRACT NUMBER 5b. GRANT NUMBER W81XWH-15-1-0667 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S

On the Cut-off Point for Combinatorial Group Testing

DEFF Research Database (Denmark)

Fischer, Paul; Klasner, N.; Wegener, I.

1999-01-01

is answered by 1 if Q contains at least one essential object and by 0 otherwise. In the statistical setting the objects are essential, independently of each other, with a given probability p combinatorial setting the number k ... group testing is equal to p* = 12(3 - 5), i.e., the strategy of testing each object individually minimizes the average number of queries iff p >= p* or n = 1. In the combinatorial setting the worst case number of queries is of interest. It has been conjectured that the cut-off point of combinatorial...

Co-LncRNA: investigating the lncRNA combinatorial effects in GO annotations and KEGG pathways based on human RNA-Seq data.

Science.gov (United States)

Zhao, Zheng; Bai, Jing; Wu, Aiwei; Wang, Yuan; Zhang, Jinwen; Wang, Zishan; Li, Yongsheng; Xu, Juan; Li, Xia

2015-01-01

Long non-coding RNAs (lncRNAs) are emerging as key regulators of diverse biological processes and diseases. However, the combinatorial effects of these molecules in a specific biological function are poorly understood. Identifying co-expressed protein-coding genes of lncRNAs would provide ample insight into lncRNA functions. To facilitate such an effort, we have developed Co-LncRNA, which is a web-based computational tool that allows users to identify GO annotations and KEGG pathways that may be affected by co-expressed protein-coding genes of a single or multiple lncRNAs. LncRNA co-expressed protein-coding genes were first identified in publicly available human RNA-Seq datasets, including 241 datasets across 6560 total individuals representing 28 tissue types/cell lines. Then, the lncRNA combinatorial effects in a given GO annotations or KEGG pathways are taken into account by the simultaneous analysis of multiple lncRNAs in user-selected individual or multiple datasets, which is realized by enrichment analysis. In addition, this software provides a graphical overview of pathways that are modulated by lncRNAs, as well as a specific tool to display the relevant networks between lncRNAs and their co-expressed protein-coding genes. Co-LncRNA also supports users in uploading their own lncRNA and protein-coding gene expression profiles to investigate the lncRNA combinatorial effects. It will be continuously updated with more human RNA-Seq datasets on an annual basis. Taken together, Co-LncRNA provides a web-based application for investigating lncRNA combinatorial effects, which could shed light on their biological roles and could be a valuable resource for this community. Database URL: http://www.bio-bigdata.com/Co-LncRNA/. © The Author(s) 2015. Published by Oxford University Press.

Infinitary Combinatory Reduction Systems

DEFF Research Database (Denmark)

Ketema, Jeroen; Simonsen, Jakob Grue

2011-01-01

We define infinitary Combinatory Reduction Systems (iCRSs), thus providing the first notion of infinitary higher-order rewriting. The systems defined are sufficiently general that ordinary infinitary term rewriting and infinitary ¿-calculus are special cases. Furthermore,we generalise a number...

Combinatorial Libraries of Bis-Heterocyclic Compounds with Skeletal Diversity

OpenAIRE

Soural, Miroslav; Bouillon, Isabelle; Krchňák, Viktor

2008-01-01

Combinatorial solid-phase synthesis of bis-heterocyclic compounds, characterized by the presence of two heterocyclic cores connected by a spacer of variable length/structure, provided structurally heterogeneous libraries with skeletal diversity. Both heterocyclic rings were assembled on resin in a combinatorial fashion.

Combinatorial Quantum Field Theory and Gluing Formula for Determinants

NARCIS (Netherlands)

Reshetikhin, N.; Vertman, B.

2015-01-01

We define the combinatorial Dirichlet-to-Neumann operator and establish a gluing formula for determinants of discrete Laplacians using a combinatorial Gaussian quantum field theory. In case of a diagonal inner product on cochains we provide an explicit local expression for the discrete

Combinatorial Libraries of Bis-Heterocyclic Compounds with Skeletal Diversity

Science.gov (United States)

Soural, Miroslav; Bouillon, Isabelle; Krchňák, Viktor

2009-01-01

Combinatorial solid-phase synthesis of bis-heterocyclic compounds, characterized by the presence of two heterocyclic cores connected by a spacer of variable length/structure, provided structurally heterogeneous libraries with skeletal diversity. Both heterocyclic rings were assembled on resin in a combinatorial fashion. PMID:18811208

Combinatorial Cis-regulation in Saccharomyces Species

Directory of Open Access Journals (Sweden)

Aaron T. Spivak

2016-03-01

Full Text Available Transcriptional control of gene expression requires interactions between the cis-regulatory elements (CREs controlling gene promoters. We developed a sensitive computational method to identify CRE combinations with conserved spacing that does not require genome alignments. When applied to seven sensu stricto and sensu lato Saccharomyces species, 80% of the predicted interactions displayed some evidence of combinatorial transcriptional behavior in several existing datasets including: (1 chromatin immunoprecipitation data for colocalization of transcription factors, (2 gene expression data for coexpression of predicted regulatory targets, and (3 gene ontology databases for common pathway membership of predicted regulatory targets. We tested several predicted CRE interactions with chromatin immunoprecipitation experiments in a wild-type strain and strains in which a predicted cofactor was deleted. Our experiments confirmed that transcription factor (TF occupancy at the promoters of the CRE combination target genes depends on the predicted cofactor while occupancy of other promoters is independent of the predicted cofactor. Our method has the additional advantage of identifying regulatory differences between species. By analyzing the S. cerevisiae and S. bayanus genomes, we identified differences in combinatorial cis-regulation between the species and showed that the predicted changes in gene regulation explain several of the species-specific differences seen in gene expression datasets. In some instances, the same CRE combinations appear to regulate genes involved in distinct biological processes in the two different species. The results of this research demonstrate that (1 combinatorial cis-regulation can be inferred by multi-genome analysis and (2 combinatorial cis-regulation can explain differences in gene expression between species.

Conferences on Combinatorial and Additive Number Theory

CERN Document Server

2014-01-01

This proceedings volume is based on papers presented at the Workshops on Combinatorial and Additive Number Theory (CANT), which were held at the Graduate Center of the City University of New York in 2011 and 2012. The goal of the workshops is to survey recent progress in combinatorial number theory and related parts of mathematics. The workshop attracts researchers and students who discuss the state-of-the-art, open problems, and future challenges in number theory.

Fast Combinatorial Algorithm for the Solution of Linearly Constrained Least Squares Problems

Science.gov (United States)

Van Benthem, Mark H.; Keenan, Michael R.

2008-11-11

A fast combinatorial algorithm can significantly reduce the computational burden when solving general equality and inequality constrained least squares problems with large numbers of observation vectors. The combinatorial algorithm provides a mathematically rigorous solution and operates at great speed by reorganizing the calculations to take advantage of the combinatorial nature of the problems to be solved. The combinatorial algorithm exploits the structure that exists in large-scale problems in order to minimize the number of arithmetic operations required to obtain a solution.

A computational procedure for finding multiple solutions of convective heat transfer equations

International Nuclear Information System (INIS)

Mishra, S; DebRoy, T

2005-01-01

In recent years numerical solutions of the convective heat transfer equations have provided significant insight into the complex materials processing operations. However, these computational methods suffer from two major shortcomings. First, these procedures are designed to calculate temperature fields and cooling rates as output and the unidirectional structure of these solutions preclude specification of these variables as input even when their desired values are known. Second, and more important, these procedures cannot determine multiple pathways or multiple sets of input variables to achieve a particular output from the convective heat transfer equations. Here we propose a new method that overcomes the aforementioned shortcomings of the commonly used solutions of the convective heat transfer equations. The procedure combines the conventional numerical solution methods with a real number based genetic algorithm (GA) to achieve bi-directionality, i.e. the ability to calculate the required input variables to achieve a specific output such as temperature field or cooling rate. More important, the ability of the GA to find a population of solutions enables this procedure to search for and find multiple sets of input variables, all of which can lead to the desired specific output. The proposed computational procedure has been applied to convective heat transfer in a liquid layer locally heated on its free surface by an electric arc, where various sets of input variables are computed to achieve a specific fusion zone geometry defined by an equilibrium temperature. Good agreement is achieved between the model predictions and the independent experimental results, indicating significant promise for the application of this procedure in finding multiple solutions of convective heat transfer equations

Simultaneous Disulfide and Boronic Acid Ester Exchange in Dynamic Combinatorial Libraries

Directory of Open Access Journals (Sweden)

Sanna L. Diemer

2015-09-01

Full Text Available Dynamic combinatorial chemistry has emerged as a promising tool for the discovery of complex receptors in supramolecular chemistry. At the heart of dynamic combinatorial chemistry are the reversible reactions that enable the exchange of building blocks between library members in dynamic combinatorial libraries (DCLs ensuring thermodynamic control over the system. If more than one reversible reaction operates in a single dynamic combinatorial library, the complexity of the system increases dramatically, and so does its possible applications. One can imagine two reversible reactions that operate simultaneously or two reversible reactions that operate independently. Both these scenarios have advantages and disadvantages. In this contribution, we show how disulfide exchange and boronic ester transesterification can function simultaneous in dynamic combinatorial libraries under appropriate conditions. We describe the detailed studies necessary to establish suitable reaction conditions and highlight the analytical techniques appropriate to study this type of system.

Dynamic combinatorial libraries: from exploring molecular recognition to systems chemistry.

Science.gov (United States)

Li, Jianwei; Nowak, Piotr; Otto, Sijbren

2013-06-26

Dynamic combinatorial chemistry (DCC) is a subset of combinatorial chemistry where the library members interconvert continuously by exchanging building blocks with each other. Dynamic combinatorial libraries (DCLs) are powerful tools for discovering the unexpected and have given rise to many fascinating molecules, ranging from interlocked structures to self-replicators. Furthermore, dynamic combinatorial molecular networks can produce emergent properties at systems level, which provide exciting new opportunities in systems chemistry. In this perspective we will highlight some new methodologies in this field and analyze selected examples of DCLs that are under thermodynamic control, leading to synthetic receptors, catalytic systems, and complex self-assembled supramolecular architectures. Also reviewed are extensions of the principles of DCC to systems that are not at equilibrium and may therefore harbor richer functional behavior. Examples include self-replication and molecular machines.

Combinatorial Micro-Macro Dynamical Systems

OpenAIRE

Diaz, Rafael; Villamarin, Sergio

2015-01-01

The second law of thermodynamics states that the entropy of an isolated system is almost always increasing. We propose combinatorial formalizations of the second law and explore their conditions of possibilities.

Deciphering Cis-Regulatory Element Mediated Combinatorial Regulation in Rice under Blast Infected Condition.

Directory of Open Access Journals (Sweden)

Arindam Deb

Full Text Available Combinations of cis-regulatory elements (CREs present at the promoters facilitate the binding of several transcription factors (TFs, thereby altering the consequent gene expressions. Due to the eminent complexity of the regulatory mechanism, the combinatorics of CRE-mediated transcriptional regulation has been elusive. In this work, we have developed a new methodology that quantifies the co-occurrence tendencies of CREs present in a set of promoter sequences; these co-occurrence scores are filtered in three consecutive steps to test their statistical significance; and the significantly co-occurring CRE pairs are presented as networks. These networks of co-occurring CREs are further transformed to derive higher order of regulatory combinatorics. We have further applied this methodology on the differentially up-regulated gene-sets of rice tissues under fungal (Magnaporthe infected conditions to demonstrate how it helps to understand the CRE-mediated combinatorial gene regulation. Our analysis includes a wide spectrum of biologically important results. The CRE pairs having a strong tendency to co-occur often exhibit very similar joint distribution patterns at the promoters of rice. We couple the network approach with experimental results of plant gene regulation and defense mechanisms and find evidences of auto and cross regulation among TF families, cross-talk among multiple hormone signaling pathways, similarities and dissimilarities in regulatory combinatorics between different tissues, etc. Our analyses have pointed a highly distributed nature of the combinatorial gene regulation facilitating an efficient alteration in response to fungal attack. All together, our proposed methodology could be an important approach in understanding the combinatorial gene regulation. It can be further applied to unravel the tissue and/or condition specific combinatorial gene regulation in other eukaryotic systems with the availability of annotated genomic

Binomial Rings: Axiomatisation, Transfer and Classification

OpenAIRE

Xantcha, Qimh Richey

2011-01-01

Hall's binomial rings, rings with binomial coefficients, are given an axiomatisation and proved identical to the numerical rings studied by Ekedahl. The Binomial Transfer Principle is established, enabling combinatorial proofs of algebraical identities. The finitely generated binomial rings are completely classified. An application to modules over binomial rings is given.

Iterative optimization of xylose catabolism in Saccharomyces cerevisiae using combinatorial expression tuning.

Science.gov (United States)

Latimer, Luke N; Dueber, John E

2017-06-01

A common challenge in metabolic engineering is rapidly identifying rate-controlling enzymes in heterologous pathways for subsequent production improvement. We demonstrate a workflow to address this challenge and apply it to improving xylose utilization in Saccharomyces cerevisiae. For eight reactions required for conversion of xylose to ethanol, we screened enzymes for functional expression in S. cerevisiae, followed by a combinatorial expression analysis to achieve pathway flux balancing and identification of limiting enzymatic activities. In the next round of strain engineering, we increased the copy number of these limiting enzymes and again tested the eight-enzyme combinatorial expression library in this new background. This workflow yielded a strain that has a ∼70% increase in biomass yield and ∼240% increase in xylose utilization. Finally, we chromosomally integrated the expression library. This library enriched for strains with multiple integrations of the pathway, which likely were the result of tandem integrations mediated by promoter homology. Biotechnol. Bioeng. 2017;114: 1301-1309. © 2017 Wiley Periodicals, Inc. © 2017 Wiley Periodicals, Inc.

On Definitions and Existence of Combinatorial Entropy of 2d Fields

DEFF Research Database (Denmark)

Forchhammer, Søren Otto; Shtarkov, Yuri; Justesen, Jørn

1998-01-01

Different definitions of combinatorial entropy is presented and conditions for their existence examined.......Different definitions of combinatorial entropy is presented and conditions for their existence examined....

Enabling high performance computational science through combinatorial algorithms

International Nuclear Information System (INIS)

Boman, Erik G; Bozdag, Doruk; Catalyurek, Umit V; Devine, Karen D; Gebremedhin, Assefaw H; Hovland, Paul D; Pothen, Alex; Strout, Michelle Mills

2007-01-01

The Combinatorial Scientific Computing and Petascale Simulations (CSCAPES) Institute is developing algorithms and software for combinatorial problems that play an enabling role in scientific and engineering computations. Discrete algorithms will be increasingly critical for achieving high performance for irregular problems on petascale architectures. This paper describes recent contributions by researchers at the CSCAPES Institute in the areas of load balancing, parallel graph coloring, performance improvement, and parallel automatic differentiation

Enabling high performance computational science through combinatorial algorithms

Energy Technology Data Exchange (ETDEWEB)

Boman, Erik G [Discrete Algorithms and Math Department, Sandia National Laboratories (United States); Bozdag, Doruk [Biomedical Informatics, and Electrical and Computer Engineering, Ohio State University (United States); Catalyurek, Umit V [Biomedical Informatics, and Electrical and Computer Engineering, Ohio State University (United States); Devine, Karen D [Discrete Algorithms and Math Department, Sandia National Laboratories (United States); Gebremedhin, Assefaw H [Computer Science and Center for Computational Science, Old Dominion University (United States); Hovland, Paul D [Mathematics and Computer Science Division, Argonne National Laboratory (United States); Pothen, Alex [Computer Science and Center for Computational Science, Old Dominion University (United States); Strout, Michelle Mills [Computer Science, Colorado State University (United States)

2007-07-15

The Combinatorial Scientific Computing and Petascale Simulations (CSCAPES) Institute is developing algorithms and software for combinatorial problems that play an enabling role in scientific and engineering computations. Discrete algorithms will be increasingly critical for achieving high performance for irregular problems on petascale architectures. This paper describes recent contributions by researchers at the CSCAPES Institute in the areas of load balancing, parallel graph coloring, performance improvement, and parallel automatic differentiation.

Combinatorial Mathematics: Research into Practice

Science.gov (United States)

Sriraman, Bharath; English, Lyn D.

2004-01-01

Implications and suggestions for using combinatorial mathematics in the classroom through a survey and synthesis of numerous research studies are presented. The implications revolve around five major themes that emerge from analysis of these studies.

Combinatorial designs a tribute to Haim Hanani

CERN Document Server

Hartman, A

1989-01-01

Haim Hanani pioneered the techniques for constructing designs and the theory of pairwise balanced designs, leading directly to Wilson''s Existence Theorem. He also led the way in the study of resolvable designs, covering and packing problems, latin squares, 3-designs and other combinatorial configurations.The Hanani volume is a collection of research and survey papers at the forefront of research in combinatorial design theory, including Professor Hanani''s own latest work on Balanced Incomplete Block Designs. Other areas covered include Steiner systems, finite geometries, quasigroups, and t-designs.

A quark interpretation of the combinatorial hierarchy

International Nuclear Information System (INIS)

Enqvist, Kari.

1979-01-01

We propose a physical interpretation of the second level of the combinatorial hierarchy in terms of three quarks, three antiquarks and the vacuum. This interpretation allows us to introduce a new quantum number, which measures electromagnetic mass splitting of the quarks. We extend our argument by analogue to baryons, and find some SU(3) and some new mass formulas for baryons. The generalization of our approach to other hierarchy levels is discussed. We present also an empirical mass formula for baryons, which seems to be loosely connected with the combinatorial hierarchy. (author)

Combinatorial binding in human and mouse embryonic stem cells identifies conserved enhancers active in early embryonic development.

Directory of Open Access Journals (Sweden)

Jonathan Göke

2011-12-01

Full Text Available Transcription factors are proteins that regulate gene expression by binding to cis-regulatory sequences such as promoters and enhancers. In embryonic stem (ES cells, binding of the transcription factors OCT4, SOX2 and NANOG is essential to maintain the capacity of the cells to differentiate into any cell type of the developing embryo. It is known that transcription factors interact to regulate gene expression. In this study we show that combinatorial binding is strongly associated with co-localization of the transcriptional co-activator Mediator, H3K27ac and increased expression of nearby genes in embryonic stem cells. We observe that the same loci bound by Oct4, Nanog and Sox2 in ES cells frequently drive expression in early embryonic development. Comparison of mouse and human ES cells shows that less than 5% of individual binding events for OCT4, SOX2 and NANOG are shared between species. In contrast, about 15% of combinatorial binding events and even between 53% and 63% of combinatorial binding events at enhancers active in early development are conserved. Our analysis suggests that the combination of OCT4, SOX2 and NANOG binding is critical for transcription in ES cells and likely plays an important role for embryogenesis by binding at conserved early developmental enhancers. Our data suggests that the fast evolutionary rewiring of regulatory networks mainly affects individual binding events, whereas "gene regulatory hotspots" which are bound by multiple factors and active in multiple tissues throughout early development are under stronger evolutionary constraints.

Horizontal antimicrobial resistance transfer drives epidemics of multiple Shigella species.

Science.gov (United States)

Baker, Kate S; Dallman, Timothy J; Field, Nigel; Childs, Tristan; Mitchell, Holly; Day, Martin; Weill, François-Xavier; Lefèvre, Sophie; Tourdjman, Mathieu; Hughes, Gwenda; Jenkins, Claire; Thomson, Nicholas

2018-04-13

Horizontal gene transfer has played a role in developing the global public health crisis of antimicrobial resistance (AMR). However, the dynamics of AMR transfer through bacterial populations and its direct impact on human disease is poorly elucidated. Here, we study parallel epidemic emergences of multiple Shigella species, a priority AMR organism, in men who have sex with men to gain insight into AMR emergence and spread. Using genomic epidemiology, we show that repeated horizontal transfer of a single AMR plasmid among Shigella enhanced existing and facilitated new epidemics. These epidemic patterns contrasted with slighter, slower increases in disease caused by organisms with vertically inherited (chromosomally encoded) AMR. This demonstrates that horizontal transfer of AMR directly affects epidemiological outcomes of globally important AMR pathogens and highlights the need for integration of genomic analyses into all areas of AMR research, surveillance and management.

Combinatorial Dyson-Schwinger equations and inductive data types

Science.gov (United States)

Kock, Joachim

2016-06-01

The goal of this contribution is to explain the analogy between combinatorial Dyson-Schwinger equations and inductive data types to a readership of mathematical physicists. The connection relies on an interpretation of combinatorial Dyson-Schwinger equations as fixpoint equations for polynomial functors (established elsewhere by the author, and summarised here), combined with the now-classical fact that polynomial functors provide semantics for inductive types. The paper is expository, and comprises also a brief introduction to type theory.

Solving the neutron diffusion equation on combinatorial geometry computational cells for reactor physics calculations

International Nuclear Information System (INIS)

Azmy, Y. Y.

2004-01-01

An approach is developed for solving the neutron diffusion equation on combinatorial geometry computational cells, that is computational cells composed by combinatorial operations involving simple-shaped component cells. The only constraint on the component cells from which the combinatorial cells are assembled is that they possess a legitimate discretization of the underlying diffusion equation. We use the Finite Difference (FD) approximation of the x, y-geometry diffusion equation in this work. Performing the same combinatorial operations involved in composing the combinatorial cell on these discrete-variable equations yields equations that employ new discrete variables defined only on the combinatorial cell's volume and faces. The only approximation involved in this process, beyond the truncation error committed in discretizing the diffusion equation over each component cell, is a consistent-order Legendre series expansion. Preliminary results for simple configurations establish the accuracy of the solution to the combinatorial geometry solution compared to straight FD as the system dimensions decrease. Furthermore numerical results validate the consistent Legendre-series expansion order by illustrating the second order accuracy of the combinatorial geometry solution, the same as standard FD. Nevertheless the magnitude of the error for the new approach is larger than FD's since it incorporates the additional truncated series approximation. (authors)

The Combinatorial Rigidity Conjecture is False for Cubic Polynomials

DEFF Research Database (Denmark)

Henriksen, Christian

2003-01-01

We show that there exist two cubic polynomials with connected Julia sets which are combinatorially equivalent but not topologically conjugate on their Julia sets. This disproves a conjecture by McMullen from 1995.......We show that there exist two cubic polynomials with connected Julia sets which are combinatorially equivalent but not topologically conjugate on their Julia sets. This disproves a conjecture by McMullen from 1995....

Computational Complexity of Combinatorial Surfaces

NARCIS (Netherlands)

Vegter, Gert; Yap, Chee K.

1990-01-01

We investigate the computational problems associated with combinatorial surfaces. Specifically, we present an algorithm (based on the Brahana-Dehn-Heegaard approach) for transforming the polygonal schema of a closed triangulated surface into its canonical form in O(n log n) time, where n is the

Combinatorial auctions for electronic business

Indian Academy of Sciences (India)

R. Narasimhan (Krishtel eMaging) 1461 1996 Oct 15 13:05:22

(6) Information feedback: An auction protocol may be a direct mechanism or an .... transparency of allocation decisions arise in resolving these ties. .... bidding, however more recently, combinatorial bids are allowed [50] making ...... Also, truth revelation and other game theoretic considerations are not taken into account.

Combinatorial Proofs and Algebraic Proofs

Indian Academy of Sciences (India)

Permanent link: https://www.ias.ac.in/article/fulltext/reso/018/07/0630-0645. Keywords. Combinatorial proof; algebraic proof; binomial identity; recurrence relation; composition; Fibonacci number; Fibonacci identity; Pascal triangle. Author Affiliations. Shailesh A Shirali1. Sahyadri School Tiwai Hill, Rajgurunagar Pune 410 ...

Polyhedral and semidefinite programming methods in combinatorial optimization

CERN Document Server

Tunçel, Levent

2010-01-01

Since the early 1960s, polyhedral methods have played a central role in both the theory and practice of combinatorial optimization. Since the early 1990s, a new technique, semidefinite programming, has been increasingly applied to some combinatorial optimization problems. The semidefinite programming problem is the problem of optimizing a linear function of matrix variables, subject to finitely many linear inequalities and the positive semidefiniteness condition on some of the matrix variables. On certain problems, such as maximum cut, maximum satisfiability, maximum stable set and geometric r

Hospital daily outpatient visits forecasting using a combinatorial model based on ARIMA and SES models.

Science.gov (United States)

Luo, Li; Luo, Le; Zhang, Xinli; He, Xiaoli

2017-07-10

Accurate forecasting of hospital outpatient visits is beneficial for the reasonable planning and allocation of healthcare resource to meet the medical demands. In terms of the multiple attributes of daily outpatient visits, such as randomness, cyclicity and trend, time series methods, ARIMA, can be a good choice for outpatient visits forecasting. On the other hand, the hospital outpatient visits are also affected by the doctors' scheduling and the effects are not pure random. Thinking about the impure specialty, this paper presents a new forecasting model that takes cyclicity and the day of the week effect into consideration. We formulate a seasonal ARIMA (SARIMA) model on a daily time series and then a single exponential smoothing (SES) model on the day of the week time series, and finally establish a combinatorial model by modifying them. The models are applied to 1 year of daily visits data of urban outpatients in two internal medicine departments of a large hospital in Chengdu, for forecasting the daily outpatient visits about 1 week ahead. The proposed model is applied to forecast the cross-sectional data for 7 consecutive days of daily outpatient visits over an 8-weeks period based on 43 weeks of observation data during 1 year. The results show that the two single traditional models and the combinatorial model are simplicity of implementation and low computational intensiveness, whilst being appropriate for short-term forecast horizons. Furthermore, the combinatorial model can capture the comprehensive features of the time series data better. Combinatorial model can achieve better prediction performance than the single model, with lower residuals variance and small mean of residual errors which needs to be optimized deeply on the next research step.

Combinatorial algebra syntax and semantics

CERN Document Server

Sapir, Mark V

2014-01-01

Combinatorial Algebra: Syntax and Semantics provides a comprehensive account of many areas of combinatorial algebra. It contains self-contained proofs of  more than 20 fundamental results, both classical and modern. This includes Golod–Shafarevich and Olshanskii's solutions of Burnside problems, Shirshov's solution of Kurosh's problem for PI rings, Belov's solution of Specht's problem for varieties of rings, Grigorchuk's solution of Milnor's problem, Bass–Guivarc'h theorem about the growth of nilpotent groups, Kleiman's solution of Hanna Neumann's problem for varieties of groups, Adian's solution of von Neumann-Day's problem, Trahtman's solution of the road coloring problem of Adler, Goodwyn and Weiss. The book emphasize several ``universal" tools, such as trees, subshifts, uniformly recurrent words, diagrams and automata.   With over 350 exercises at various levels of difficulty and with hints for the more difficult problems, this book can be used as a textbook, and aims to reach a wide and diversified...

Combinatorial methods for advanced materials research and development

Energy Technology Data Exchange (ETDEWEB)

Cremer, R.; Dondorf, S.; Hauck, M.; Horbach, D.; Kaiser, M.; Krysta, S.; Kyrylov, O.; Muenstermann, E.; Philipps, M.; Reichert, K.; Strauch, G. [Rheinisch-Westfaelische Technische Hochschule Aachen (Germany). Lehrstuhl fuer Theoretische Huettenkunde

2001-10-01

The applicability of combinatorial methods in developing advanced materials is illustrated presenting four examples for the deposition and characterization of one- and two-dimensionally laterally graded coatings, which were deposited by means of (reactive) magnetron sputtering and plasma-enhanced chemical vapor deposition. To emphasize the advantages of combinatorial approaches, metastable hard coatings like (Ti,Al)N and (Ti,Al,Hf)N respectively, as well as Ge-Sb-Te based films for rewritable optical data storage were investigated with respect to the relations between structure, composition, and the desired materials properties. (orig.)

Markov's theorem and algorithmically non-recognizable combinatorial manifolds

International Nuclear Information System (INIS)

Shtan'ko, M A

2004-01-01

We prove the theorem of Markov on the existence of an algorithmically non-recognizable combinatorial n-dimensional manifold for every n≥4. We construct for the first time a concrete manifold which is algorithmically non-recognizable. A strengthened form of Markov's theorem is proved using the combinatorial methods of regular neighbourhoods and handle theory. The proofs coincide for all n≥4. We use Borisov's group with insoluble word problem. It has two generators and twelve relations. The use of this group forms the base for proving the strengthened form of Markov's theorem

An Investigation into Post-Secondary Students' Understanding of Combinatorial Questions

Science.gov (United States)

Bulone, Vincent William

2017-01-01

The purpose of this dissertation was to study aspects of how post-secondary students understand combinatorial problems. Within this dissertation, I considered understanding through two different lenses: i) student connections to previous problems; and ii) common combinatorial distinctions such as ordered versus unordered and repetitive versus…

A new evolutionary algorithm with LQV learning for combinatorial problems optimization

International Nuclear Information System (INIS)

Machado, Marcelo Dornellas; Schirru, Roberto

2000-01-01

Genetic algorithms are biologically motivated adaptive systems which have been used, with good results, for combinatorial problems optimization. In this work, a new learning mode, to be used by the population-based incremental learning algorithm, has the aim to build a new evolutionary algorithm to be used in optimization of numerical problems and combinatorial problems. This new learning mode uses a variable learning rate during the optimization process, constituting a process known as proportional reward. The development of this new algorithm aims its application in the optimization of reload problem of PWR nuclear reactors, in order to increase the useful life of the nuclear fuel. For the test, two classes of problems are used: numerical problems and combinatorial problems. Due to the fact that the reload problem is a combinatorial problem, the major interest relies on the last class. The results achieved with the tests indicate the applicability of the new learning mode, showing its potential as a developing tool in the solution of reload problem. (author)

Enumeration of Combinatorial Classes of Single Variable Complex Polynomial Vector Fields

DEFF Research Database (Denmark)

Dias, Kealey

A vector field in the space of degree d monic, centered single variable complex polynomial vector fields has a combinatorial structure which can be fully described by a combinatorial data set consisting of an equivalence relation and a marked subset on the integers mod 2d-2, satisfying certain...

SignalSpider: Probabilistic pattern discovery on multiple normalized ChIP-Seq signal profiles

KAUST Repository

Wong, Kachun

2014-09-05

Motivation: Chromatin immunoprecipitation (ChIP) followed by high-throughput sequencing (ChIP-Seq) measures the genome-wide occupancy of transcription factors in vivo. Different combinations of DNA-binding protein occupancies may result in a gene being expressed in different tissues or at different developmental stages. To fully understand the functions of genes, it is essential to develop probabilistic models on multiple ChIP-Seq profiles to decipher the combinatorial regulatory mechanisms by multiple transcription factors. Results: In this work, we describe a probabilistic model (SignalSpider) to decipher the combinatorial binding events of multiple transcription factors. Comparing with similar existing methods, we found SignalSpider performs better in clustering promoter and enhancer regions. Notably, SignalSpider can learn higher-order combinatorial patterns from multiple ChIP-Seq profiles. We have applied SignalSpider on the normalized ChIP-Seq profiles from the ENCODE consortium and learned model instances. We observed different higher-order enrichment and depletion patterns across sets of proteins. Those clustering patterns are supported by Gene Ontology (GO) enrichment, evolutionary conservation and chromatin interaction enrichment, offering biological insights for further focused studies. We also proposed a specific enrichment map visualization method to reveal the genome-wide transcription factor combinatorial patterns from the models built, which extend our existing fine-scale knowledge on gene regulation to a genome-wide level. Availability and implementation: The matrix-algebra-optimized executables and source codes are available at the authors\\' websites: http://www.cs.toronto.edu/∼wkc/SignalSpider. Contact: Supplementary information: Supplementary data are available at Bioinformatics online.

Unravelling radiative energy transfer in solid-state lighting

Science.gov (United States)

Melikov, Rustamzhon; Press, Daniel Aaron; Ganesh Kumar, Baskaran; Sadeghi, Sadra; Nizamoglu, Sedat

2018-01-01

Today, a wide variety of organic and inorganic luminescent materials (e.g., phosphors, quantum dots, etc.) are being used for lighting and new materials (e.g., graphene, perovskite, etc.) are currently under investigation. However, the understanding of radiative energy transfer is limited, even though it is critical to understand and improve the performance levels of solid-state lighting devices. In this study, we derived a matrix approach that includes absorption, reabsorption, inter-absorption and their iterative and combinatorial interactions for one and multiple types of fluorophores, which is simplified to an analytical matrix. This mathematical approach gives results that agree well with the measured spectral and efficiency characteristics of color-conversion light-emitting diodes. Moreover, it also provides a deep physical insight by uncovering the entire radiative interactions and their contribution to the output optical spectrum. The model is universal and applicable for all kinds of fluorophores.

Combinatorial vector fields and the valley structure of fitness landscapes.

Science.gov (United States)

Stadler, Bärbel M R; Stadler, Peter F

2010-12-01

Adaptive (downhill) walks are a computationally convenient way of analyzing the geometric structure of fitness landscapes. Their inherently stochastic nature has limited their mathematical analysis, however. Here we develop a framework that interprets adaptive walks as deterministic trajectories in combinatorial vector fields and in return associate these combinatorial vector fields with weights that measure their steepness across the landscape. We show that the combinatorial vector fields and their weights have a product structure that is governed by the neutrality of the landscape. This product structure makes practical computations feasible. The framework presented here also provides an alternative, and mathematically more convenient, way of defining notions of valleys, saddle points, and barriers in landscape. As an application, we propose a refined approximation for transition rates between macrostates that are associated with the valleys of the landscape.

Logging to Facilitate Combinatorial System Testing

NARCIS (Netherlands)

Kruse, P.M.; Prasetya, I.S.W.B.; Hage, J; Elyasov, Alexander

2014-01-01

Testing a web application is typically very complicated. Imposing simple coverage criteria such as function or line coverage is often not sufficient to uncover bugs due to incorrect components integration. Combinatorial testing can enforce a stronger criterion, while still allowing the

Combinatorial computational chemistry approach to the design of metal catalysts for deNOx

International Nuclear Information System (INIS)

Endou, Akira; Jung, Changho; Kusagaya, Tomonori; Kubo, Momoji; Selvam, Parasuraman; Miyamoto, Akira

2004-01-01

Combinatorial chemistry is an efficient technique for the synthesis and screening of a large number of compounds. Recently, we introduced the combinatorial approach to computational chemistry for catalyst design and proposed a new method called ''combinatorial computational chemistry''. In the present study, we have applied this combinatorial computational chemistry approach to the design of precious metal catalysts for deNO x . As the first step of the screening of the metal catalysts, we studied Rh, Pd, Ag, Ir, Pt, and Au clusters regarding the adsorption properties towards NO molecule. It was demonstrated that the energetically most stable adsorption state of NO on Ir model cluster, which was irrespective of both the shape and number of atoms including the model clusters

Superlubricity of Graphite Induced by Multiple Transferred Graphene Nanoflakes.

Science.gov (United States)

Li, Jinjin; Gao, Tianyang; Luo, Jianbin

2018-03-01

2D or 3D layered materials, such as graphene, graphite, and molybdenum disulfide, usually exhibit superlubricity properties when sliding occurs between the incommensurate interface lattices. This study reports the superlubricity between graphite and silica under ambient conditions, induced by the formation of multiple transferred graphene nanoflakes on the asperities of silica surfaces after the initial frictional sliding. The friction coefficient can be reduced to as low as 0.0003 with excellent robustness and is independent of the surface roughness, sliding velocities, and rotation angles. The superlubricity mechanism can be attributed to the extremely weak interaction and easy sliding between the transferred graphene nanoflakes and graphite in their incommensurate contact. This finding has important implications for developing approaches to achieve superlubricity of layered materials at the nanoscale by tribointeractions.

The combinatorial derivation

Directory of Open Access Journals (Sweden)

Igor V. Protasov

2013-09-01

$\\Delta(A=\\{g\\in G:|gA\\cap A|=\\infty\\}$. The mapping $\\Delta:\\mathcal{P}_G\\rightarrow\\mathcal{P}_G$, $A\\mapsto\\Delta(A$, is called a combinatorial derivation and can be considered as an analogue of the topological derivation $d:\\mathcal{P}_X\\rightarrow\\mathcal{P}_X$, $A\\mapsto A^d$, where $X$ is a topological space and $A^d$ is the set of all limit points of $A$. Content: elementary properties, thin and almost thin subsets, partitions, inverse construction and $\\Delta$-trajectories,  $\\Delta$ and $d$.

Dynamic Combinatorial Chemistry

DEFF Research Database (Denmark)

Lisbjerg, Micke

This thesis is divided into seven chapters, which can all be read individually. The first chapter, however, contains a general introduction to the chemistry used in the remaining six chapters, and it is therefore recommended to read chapter one before reading the other chapters. Chapter 1...... is a general introductory chapter for the whole thesis. The history and concepts of dynamic combinatorial chemistry are described, as are some of the new and intriguing results recently obtained. Finally, the properties of a broad range of hexameric macrocycles are described in detail. Chapter 2 gives...

A binary plasmid system for shuffling combinatorial antibody libraries.

Science.gov (United States)

Collet, T A; Roben, P; O'Kennedy, R; Barbas, C F; Burton, D R; Lerner, R A

1992-11-01

We have used a binary system of replicon-compatible plasmids to test the potential for promiscuous recombination of heavy and light chains within sets of human Fab fragments isolated from combinatorial antibody libraries. Antibody molecules showed a surprising amount of promiscuity in that a particular heavy chain could recombine with multiple light chains with retention of binding to a protein antigen. The degree to which a given heavy chain productively paired with any light chain to bind antigen varied from 43% to 100% and depended strongly on the heavy-chain sequence. Such productive crosses resulted in a set of Fab fragments of similar apparent binding constants, which seemed to differ mainly in the amount of active Fab fragment produced in the bacterial cell. The dominance of the heavy chain in the antibody-antigen interaction was further explored in a set of directed crosses, in which heavy and light chains derived from antigen-specific clones were crossed with nonrelated heavy and light chains. In these crosses, an Fab fragment retained antigen binding only if it contained a heavy chain from an antigen-specific clone. In no case did the light chain confer detectable affinity when paired with indifferent heavy chains. The surprising promiscuity of heavy chains has ramifications for the evaluation of the diversity of combinatorial libraries made against protein antigens and should allow the combination of one such promiscuous heavy chain with an engineered light chain to form an Fab fragment carrying synthetic cofactors to assist in antibody catalysis.

Some results from the combinatorial approach to quantum logic

International Nuclear Information System (INIS)

Greechie, R.J.

1976-01-01

The combinatorial approach to quantum logic focuses on certain interconnections between graphs, combinatorial designs, and convex sets as applied to a quantum logic. This article is concerned only with orthomodular lattices and associated structures. A class of complete atomic irreducible semimodular orthomodular lattices is derived which may not be represented as linear subspaces of a vector space over a division ring. Each of these lattices is a proposition system of dimension three. These proposition systems form orthocomplemented non-Desarguesian projective geometries. (B.R.H.)

Multiple recent horizontal transfers of a large genomic region in cheese making fungi.

Science.gov (United States)

Cheeseman, Kevin; Ropars, Jeanne; Renault, Pierre; Dupont, Joëlle; Gouzy, Jérôme; Branca, Antoine; Abraham, Anne-Laure; Ceppi, Maurizio; Conseiller, Emmanuel; Debuchy, Robert; Malagnac, Fabienne; Goarin, Anne; Silar, Philippe; Lacoste, Sandrine; Sallet, Erika; Bensimon, Aaron; Giraud, Tatiana; Brygoo, Yves

2014-01-01

While the extent and impact of horizontal transfers in prokaryotes are widely acknowledged, their importance to the eukaryotic kingdom is unclear and thought by many to be anecdotal. Here we report multiple recent transfers of a huge genomic island between Penicillium spp. found in the food environment. Sequencing of the two leading filamentous fungi used in cheese making, P. roqueforti and P. camemberti, and comparison with the penicillin producer P. rubens reveals a 575 kb long genomic island in P. roqueforti--called Wallaby--present as identical fragments at non-homologous loci in P. camemberti and P. rubens. Wallaby is detected in Penicillium collections exclusively in strains from food environments. Wallaby encompasses about 250 predicted genes, some of which are probably involved in competition with microorganisms. The occurrence of multiple recent eukaryotic transfers in the food environment provides strong evidence for the importance of this understudied and probably underestimated phenomenon in eukaryotes.

Combinatorial enzyme technology for the conversion of agricultural fibers to functional properties

Science.gov (United States)

The concept of combinatorial chemistry has received little attention in agriculture and food research, although its applications in this area were described more than fifteen years ago (1, 2). More recently, interest in the use of combinatorial chemistry in agrochemical discovery has been revitalize...

DNA-Encoded Dynamic Combinatorial Chemical Libraries.

Science.gov (United States)

Reddavide, Francesco V; Lin, Weilin; Lehnert, Sarah; Zhang, Yixin

2015-06-26

Dynamic combinatorial chemistry (DCC) explores the thermodynamic equilibrium of reversible reactions. Its application in the discovery of protein binders is largely limited by difficulties in the analysis of complex reaction mixtures. DNA-encoded chemical library (DECL) technology allows the selection of binders from a mixture of up to billions of different compounds; however, experimental results often show low a signal-to-noise ratio and poor correlation between enrichment factor and binding affinity. Herein we describe the design and application of DNA-encoded dynamic combinatorial chemical libraries (EDCCLs). Our experiments have shown that the EDCCL approach can be used not only to convert monovalent binders into high-affinity bivalent binders, but also to cause remarkably enhanced enrichment of potent bivalent binders by driving their in situ synthesis. We also demonstrate the application of EDCCLs in DNA-templated chemical reactions. © 2015 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Combinatorial synthesis of ceramic materials

Science.gov (United States)

Lauf, Robert J.; Walls, Claudia A.; Boatner, Lynn A.

2006-11-14

A combinatorial library includes a gelcast substrate defining a plurality of cavities in at least one surface thereof; and a plurality of gelcast test materials in the cavities, at least two of the test materials differing from the substrate in at least one compositional characteristic, the two test materials differing from each other in at least one compositional characteristic.

Cross Talk Analysis on Multiple Coupled Transmission Lines; (The calculation of transfer functions on multiple coupled tansmission lines in an inhomogeneous dielectric medium)

DEFF Research Database (Denmark)

Dalby, Arne Brejning

1994-01-01

A flow graph relating voltages and the forward and reflected propagation modes (¿ TEM) on multiple coupled transmission lines in an inhomogeneous dielectric medium is presented. This flow graph directy gives the different transfer functions, including S-parameters, in matrix form needed to calcul......A flow graph relating voltages and the forward and reflected propagation modes (¿ TEM) on multiple coupled transmission lines in an inhomogeneous dielectric medium is presented. This flow graph directy gives the different transfer functions, including S-parameters, in matrix form needed...

Combinatorial thin film materials science: From alloy discovery and optimization to alloy design

Energy Technology Data Exchange (ETDEWEB)

Gebhardt, Thomas, E-mail: gebhardt@mch.rwth-aachen.de; Music, Denis; Takahashi, Tetsuya; Schneider, Jochen M.

2012-06-30

This paper provides an overview of modern alloy development, from discovery and optimization towards alloy design, based on combinatorial thin film materials science. The combinatorial approach, combining combinatorial materials synthesis of thin film composition-spreads with high-throughput property characterization has proven to be a powerful tool to delineate composition-structure-property relationships, and hence to efficiently identify composition windows with enhanced properties. Furthermore, and most importantly for alloy design, theoretical models and hypotheses can be critically appraised. Examples for alloy discovery, optimization, and alloy design of functional as well as structural materials are presented. Using Fe-Mn based alloys as an example, we show that the combination of modern electronic-structure calculations with the highly efficient combinatorial thin film composition-spread method constitutes an effective tool for knowledge-based alloy design.

Combinatorial thin film materials science: From alloy discovery and optimization to alloy design

International Nuclear Information System (INIS)

Gebhardt, Thomas; Music, Denis; Takahashi, Tetsuya; Schneider, Jochen M.

2012-01-01

This paper provides an overview of modern alloy development, from discovery and optimization towards alloy design, based on combinatorial thin film materials science. The combinatorial approach, combining combinatorial materials synthesis of thin film composition-spreads with high-throughput property characterization has proven to be a powerful tool to delineate composition–structure–property relationships, and hence to efficiently identify composition windows with enhanced properties. Furthermore, and most importantly for alloy design, theoretical models and hypotheses can be critically appraised. Examples for alloy discovery, optimization, and alloy design of functional as well as structural materials are presented. Using Fe-Mn based alloys as an example, we show that the combination of modern electronic-structure calculations with the highly efficient combinatorial thin film composition-spread method constitutes an effective tool for knowledge-based alloy design.

Laguerre-type derivatives: Dobinski relations and combinatorial identities

International Nuclear Information System (INIS)

Penson, K. A.; Blasiak, P.; Horzela, A.; Duchamp, G. H. E.; Solomon, A. I.

2009-01-01

We consider properties of the operators D(r,M)=a r (a † a) M (which we call generalized Laguerre-type derivatives), with r=1,2,..., M=0,1,..., where a and a † are boson annihilation and creation operators, respectively, satisfying [a,a † ]=1. We obtain explicit formulas for the normally ordered form of arbitrary Taylor-expandable functions of D(r,M) with the help of an operator relation that generalizes the Dobinski formula. Coherent state expectation values of certain operator functions of D(r,M) turn out to be generating functions of combinatorial numbers. In many cases the corresponding combinatorial structures can be explicitly identified.

Distributing the computation in combinatorial optimization experiments over the cloud

OpenAIRE

Mario Brcic; Nikica Hlupic; Nenad Katanic

2017-01-01

Combinatorial optimization is an area of great importance since many of the real-world problems have discrete parameters which are part of the objective function to be optimized. Development of combinatorial optimization algorithms is guided by the empirical study of the candidate ideas and their performance over a wide range of settings or scenarios to infer general conclusions. Number of scenarios can be overwhelming, especially when modeling uncertainty in some of the problem’s parameters....

Quantum Resonance Approach to Combinatorial Optimization

Science.gov (United States)

Zak, Michail

1997-01-01

It is shown that quantum resonance can be used for combinatorial optimization. The advantage of the approach is in independence of the computing time upon the dimensionality of the problem. As an example, the solution to a constraint satisfaction problem of exponential complexity is demonstrated.

Combinatorial pretreatment and fermentation optimization enabled a record yield on lignin bioconversion.

Science.gov (United States)

Liu, Zhi-Hua; Xie, Shangxian; Lin, Furong; Jin, Mingjie; Yuan, Joshua S

2018-01-01

Lignin valorization has recently been considered to be an essential process for sustainable and cost-effective biorefineries. Lignin represents a potential new feedstock for value-added products. Oleaginous bacteria such as Rhodococcus opacus can produce intracellular lipids from biodegradation of aromatic substrates. These lipids can be used for biofuel production, which can potentially replace petroleum-derived chemicals. However, the low reactivity of lignin produced from pretreatment and the underdeveloped fermentation technology hindered lignin bioconversion to lipids. In this study, combinatorial pretreatment with an optimized fermentation strategy was evaluated to improve lignin valorization into lipids using R. opacus PD630. As opposed to single pretreatment, combinatorial pretreatment produced a 12.8-75.6% higher lipid concentration in fermentation using lignin as the carbon source. Gas chromatography-mass spectrometry analysis showed that combinatorial pretreatment released more aromatic monomers, which could be more readily utilized by lignin-degrading strains. Three detoxification strategies were used to remove potential inhibitors produced from pretreatment. After heating detoxification of the lignin stream, the lipid concentration further increased by 2.9-9.7%. Different fermentation strategies were evaluated in scale-up lipid fermentation using a 2.0-l fermenter. With laccase treatment of the lignin stream produced from combinatorial pretreatment, the highest cell dry weight and lipid concentration were 10.1 and 1.83 g/l, respectively, in fed-batch fermentation, with a total soluble substrate concentration of 40 g/l. The improvement of the lipid fermentation performance may have resulted from lignin depolymerization by the combinatorial pretreatment and laccase treatment, reduced inhibition effects by fed-batch fermentation, adequate oxygen supply, and an accurate pH control in the fermenter. Overall, these results demonstrate that combinatorial

Combinatorial reasoning an introduction to the art of counting

CERN Document Server

DeTemple, Duane

2014-01-01

Written by well-known scholars in the field, this book introduces combinatorics alongside modern techniques, showcases the interdisciplinary aspects of the topic, and illustrates how to problem solve with a multitude of exercises throughout. The authors' approach is very reader-friendly and avoids the ""scholarly tone"" found in many books on this topic. Combinatorial Reasoning: An Introduction to the Art of Counting: Focuses on enumeration and combinatorial thinking as a way to develop a variety of effective approaches to solving counting problemsIncludes brief summaries of basic concepts f

Combinatorial interpretations of particular evaluations of complete and elementary symmetric functions

OpenAIRE

Mongelli, Pietro

2011-01-01

The Jacobi-Stirling numbers and the Legendre-Stirling numbers of the first and second kind were first introduced in [6], [7]. In this paper we note that Jacobi-Stirling numbers and Legendre-Stirling numbers are specializations of elementary and complete symmetric functions. We then study combinatorial interpretations of this specialization and obtain new combinatorial interpretations of the Jacobi-Stirling and Legendre-Stirling numbers.

Multiple ovulation and embryo transfer (MOET in camels: An overview

Directory of Open Access Journals (Sweden)

Binoy S. Vettical

2016-04-01

Full Text Available Unlike in other domestic animal species like cattle, reproductive biotechnologies like Artificial Insemination (AI and Embryo Transfer (ET are not well developed and thus are not being used as routine breeding procedures in camels. One of the important objectives of this manuscript is to focus on analyzing the present status of Multiple Ovulation and Embryo Transfer (MOET in camels and its future perspectives. Camels are induced ovulators, thus require hormonal treatment to induce ovulation and control the follicular cycles, which is the main reason why protocols used in other domestic animal species cannot be directly used in this species. The review suggests that the best method for super stimulation of ovaries in camels is use of a combination of Equine Chorionic Gonadotropin (eCG and Follicle Stimulating Hormone (FSH at any stage after elimination of dominant follicle if any or at the early stage of the follicular wave and ovulation of the developed multiple follicles can be achieved by mating donors. The review highlights that a better pregnancy rate is achieved with recipients who ovulate 24 h after the donor.

Novel modeling of combinatorial miRNA targeting identifies SNP with potential role in bone density.

Directory of Open Access Journals (Sweden)

Claudia Coronnello

Full Text Available MicroRNAs (miRNAs are post-transcriptional regulators that bind to their target mRNAs through base complementarity. Predicting miRNA targets is a challenging task and various studies showed that existing algorithms suffer from high number of false predictions and low to moderate overlap in their predictions. Until recently, very few algorithms considered the dynamic nature of the interactions, including the effect of less specific interactions, the miRNA expression level, and the effect of combinatorial miRNA binding. Addressing these issues can result in a more accurate miRNA:mRNA modeling with many applications, including efficient miRNA-related SNP evaluation. We present a novel thermodynamic model based on the Fermi-Dirac equation that incorporates miRNA expression in the prediction of target occupancy and we show that it improves the performance of two popular single miRNA target finders. Modeling combinatorial miRNA targeting is a natural extension of this model. Two other algorithms show improved prediction efficiency when combinatorial binding models were considered. ComiR (Combinatorial miRNA targeting, a novel algorithm we developed, incorporates the improved predictions of the four target finders into a single probabilistic score using ensemble learning. Combining target scores of multiple miRNAs using ComiR improves predictions over the naïve method for target combination. ComiR scoring scheme can be used for identification of SNPs affecting miRNA binding. As proof of principle, ComiR identified rs17737058 as disruptive to the miR-488-5p:NCOA1 interaction, which we confirmed in vitro. We also found rs17737058 to be significantly associated with decreased bone mineral density (BMD in two independent cohorts indicating that the miR-488-5p/NCOA1 regulatory axis is likely critical in maintaining BMD in women. With increasing availability of comprehensive high-throughput datasets from patients ComiR is expected to become an essential

Application of computer assisted combinatorial chemistry in antivirial, antimalarial and anticancer agents design

Science.gov (United States)

Burello, E.; Bologa, C.; Frecer, V.; Miertus, S.

Combinatorial chemistry and technologies have been developed to a stage where synthetic schemes are available for generation of a large variety of organic molecules. The innovative concept of combinatorial design assumes that screening of a large and diverse library of compounds will increase the probability of finding an active analogue among the compounds tested. Since the rate at which libraries are screened for activity currently constitutes a limitation to the use of combinatorial technologies, it is important to be selective about the number of compounds to be synthesized. Early experience with combinatorial chemistry indicated that chemical diversity alone did not result in a significant increase in the number of generated lead compounds. Emphasis has therefore been increasingly put on the use of computer assisted combinatorial chemical techniques. Computational methods are valuable in the design of virtual libraries of molecular models. Selection strategies based on computed physicochemical properties of the models or of a target compound are introduced to reduce the time and costs of library synthesis and screening. In addition, computational structure-based library focusing methods can be used to perform in silico screening of the activity of compounds against a target receptor by docking the ligands into the receptor model. Three case studies are discussed dealing with the design of targeted combinatorial libraries of inhibitors of HIV-1 protease, P. falciparum plasmepsin and human urokinase as potential antivirial, antimalarial and anticancer drugs. These illustrate library focusing strategies.

Gian-Carlos Rota and Combinatorial Math.

Science.gov (United States)

Kolata, Gina Bari

1979-01-01

Presents the first of a series of occasional articles about mathematics as seen through the eyes of its prominent scholars. In an interview with Gian-Carlos Rota of the Massachusetts Institute of Technology he discusses how combinatorial mathematics began as a field and its future. (HM)

A Model of Students' Combinatorial Thinking

Science.gov (United States)

Lockwood, Elise

2013-01-01

Combinatorial topics have become increasingly prevalent in K-12 and undergraduate curricula, yet research on combinatorics education indicates that students face difficulties when solving counting problems. The research community has not yet addressed students' ways of thinking at a level that facilitates deeper understanding of how students…

Capability of focused Ar ion beam sputtering for combinatorial synthesis of metal films

International Nuclear Information System (INIS)

Nagata, T.; Haemori, M.; Chikyow, T.

2009-01-01

The authors examined the use of focused Ar ion beam sputtering (FAIS) for combinatorial synthesis. A Langmuir probe revealed that the electron temperature and density for FAIS of metal film deposition was lower than that of other major combinatorial thin film growth techniques such as pulsed laser deposition. Combining FAIS with the combinatorial method allowed the compositional fraction of the Pt-Ru binary alloy to be systematically controlled. Pt-Ru alloy metal film grew epitaxially on ZnO substrates, and crystal structures changed from the Pt phase (cubic structure) to the Ru phase (hexagonal structure) in the Pt-Ru alloy phase diagram. The alloy film has a smooth surface, with the Ru phase, in particular, showing a clear step-and-terrace structure. The combination of FAIS and the combinatorial method has major potential for the fabrication of high quality composition-spread metal film.

Capability of focused Ar ion beam sputtering for combinatorial synthesis of metal films

Energy Technology Data Exchange (ETDEWEB)

Nagata, T.; Haemori, M.; Chikyow, T. [Advanced Electric Materials Center, National Institute for Materials Science, 1-1 Namiki, Tsukuba, Ibaraki 305-0044 (Japan)

2009-05-15

The authors examined the use of focused Ar ion beam sputtering (FAIS) for combinatorial synthesis. A Langmuir probe revealed that the electron temperature and density for FAIS of metal film deposition was lower than that of other major combinatorial thin film growth techniques such as pulsed laser deposition. Combining FAIS with the combinatorial method allowed the compositional fraction of the Pt-Ru binary alloy to be systematically controlled. Pt-Ru alloy metal film grew epitaxially on ZnO substrates, and crystal structures changed from the Pt phase (cubic structure) to the Ru phase (hexagonal structure) in the Pt-Ru alloy phase diagram. The alloy film has a smooth surface, with the Ru phase, in particular, showing a clear step-and-terrace structure. The combination of FAIS and the combinatorial method has major potential for the fabrication of high quality composition-spread metal film.

Algorithms in combinatorial design theory

CERN Document Server

Colbourn, CJ

1985-01-01

The scope of the volume includes all algorithmic and computational aspects of research on combinatorial designs. Algorithmic aspects include generation, isomorphism and analysis techniques - both heuristic methods used in practice, and the computational complexity of these operations. The scope within design theory includes all aspects of block designs, Latin squares and their variants, pairwise balanced designs and projective planes and related geometries.

Combinatorial optimization networks and matroids

CERN Document Server

Lawler, Eugene

2011-01-01

Perceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. A suitable text or reference for courses in combinatorial computing and concrete computational complexity in departments of computer science and mathematics.

Summation on the basis of combinatorial representation of equal powers

Directory of Open Access Journals (Sweden)

Alexander I. Nikonov

2016-03-01

Full Text Available In the paper the conclusion of combinatorial expressions for the sums of members of several sequences is considered. Conclusion is made on the basis of combinatorial representation of the sum of the weighted equal powers. The weighted members of a geometrical progression, the simple arithmetic-geometrical and combined progressions are subject to summation. One of principal places in the given conclusion occupies representation of members of each of the specified progressions in the form of matrix elements. The row of this matrix is formed with use of a gang of equal powers with the set weight factor. Besides, in work formulas of combinatorial identities with participation of free components of the sums of equal powers, and also separate power-member of sequence of equal powers or a geometrical progression are presented. All presented formulas have the general basis-components of the sums of equal powers.

View Discovery in OLAP Databases through Statistical Combinatorial Optimization

Energy Technology Data Exchange (ETDEWEB)

Joslyn, Cliff A.; Burke, Edward J.; Critchlow, Terence J.

2009-05-01

The capability of OLAP database software systems to handle data complexity comes at a high price for analysts, presenting them a combinatorially vast space of views of a relational database. We respond to the need to deploy technologies sufficient to allow users to guide themselves to areas of local structure by casting the space of ``views'' of an OLAP database as a combinatorial object of all projections and subsets, and ``view discovery'' as an search process over that lattice. We equip the view lattice with statistical information theoretical measures sufficient to support a combinatorial optimization process. We outline ``hop-chaining'' as a particular view discovery algorithm over this object, wherein users are guided across a permutation of the dimensions by searching for successive two-dimensional views, pushing seen dimensions into an increasingly large background filter in a ``spiraling'' search process. We illustrate this work in the context of data cubes recording summary statistics for radiation portal monitors at US ports.

Validation of an Instrument and Testing Protocol for Measuring the Combinatorial Analysis Schema.

Science.gov (United States)

Staver, John R.; Harty, Harold

1979-01-01

Designs a testing situation to examine the presence of combinatorial analysis, to establish construct validity in the use of an instrument, Combinatorial Analysis Behavior Observation Scheme (CABOS), and to investigate the presence of the schema in young adolescents. (Author/GA)

Multiple scattering theory of radiative transfer in inhomogeneous atmospheres.

Science.gov (United States)

Kanal, M.

1973-01-01

In this paper we treat the multiple scattering theory of radiative transfer in plane-parallel inhomogeneous atmospheres. The treatment presented here may be adopted to model atmospheres characterized by an optical depth dependent coherent scattering phase function. For the purpose of illustration we consider the semi-infinite medium in which the absorption property of the atmosphere is characterized by an exponential function. The methodology employed here is the extension of the case treated previously by the author for homogeneous atmospheres.

MARCC (Matrix-Assisted Reader Chromatin Capture): an antibody-free method to enrich and analyze combinatorial nucleosome modifications

Science.gov (United States)

Su, Zhangli

2016-01-01

Combinatorial patterns of histone modifications are key indicators of different chromatin states. Most of the current approaches rely on the usage of antibodies to analyze combinatorial histone modifications. Here we detail an antibody-free method named MARCC (Matrix-Assisted Reader Chromatin Capture) to enrich combinatorial histone modifications. The combinatorial patterns are enriched on native nucleosomes extracted from cultured mammalian cells and prepared by micrococcal nuclease digestion. Such enrichment is achieved by recombinant chromatin-interacting protein modules, or so-called reader domains, which can bind in a combinatorial modification-dependent manner. The enriched chromatin can be quantified by western blotting or mass spectrometry for the co-existence of histone modifications, while the associated DNA content can be analyzed by qPCR or next-generation sequencing. Altogether, MARCC provides a reproducible, efficient and customizable solution to enrich and analyze combinatorial histone modifications. PMID:26131849

Frequency Splitting Elimination and Cross-Coupling Rejection of Wireless Power Transfer to Multiple Dynamic Receivers

Directory of Open Access Journals (Sweden)

Narayanamoorthi R.

2018-01-01

Full Text Available Simultaneous power transfer to multiple receiver (Rx system is one of the key advantages of wireless power transfer (WPT system using magnetic resonance. However, determining the optimal condition to uniformly transfer the power to a selected Rx at high efficiency is the challenging task under the dynamic environment. The cross-coupling and frequency splitting are the dominant issues present in the multiple Rx dynamic WPT system. The existing analysis is performed by considering any one issue present in the system; on the other hand, the cross coupling and frequency splitting issues are interrelated in dynamic Rx’s, which requires a comprehensive design strategy by considering both the problems. This paper proposes an optimal design of multiple Rx WPT system, which can eliminate cross coupling, frequency splitting issues and increase the power transfer efficiency (PTE of selected Rx. The cross-coupling rejection, uniform power transfer is performed by adding an additional relay coil and independent resonance frequency tuning with capacitive compensation to each Rx unit. The frequency splitting phenomena are eliminated using non-identical transmitter (Tx and Rx coil structure which can maintain the coupling between the coil under the critical coupling limit. The mathematical analysis of the compensation capacitance calculation and optimal Tx coil size identification is performed for the four Rx WPT system. Finite element analysis and experimental investigation are carried out for the proposed design in static and dynamic conditions.

Combinatorial application of two aldehyde oxidoreductases on isobutanol production in the presence of furfural.

Science.gov (United States)

Seo, Hyung-Min; Jeon, Jong-Min; Lee, Ju Hee; Song, Hun-Suk; Joo, Han-Byul; Park, Sung-Hee; Choi, Kwon-Young; Kim, Yong Hyun; Park, Kyungmoon; Ahn, Jungoh; Lee, Hongweon; Yang, Yung-Hun

2016-01-01

Furfural is a toxic by-product formulated from pretreatment processes of lignocellulosic biomass. In order to utilize the lignocellulosic biomass on isobutanol production, inhibitory effect of the furfural on isobutanol production was investigated and combinatorial application of two oxidoreductases, FucO and YqhD, was suggested as an alternative strategy. Furfural decreased cell growth and isobutanol production when only YqhD or FucO was employed as an isobutyraldehyde oxidoreductase. However, combinatorial overexpression of FucO and YqhD could overcome the inhibitory effect of furfural giving higher isobutanol production by 110% compared with overexpression of YqhD. The combinatorial oxidoreductases increased furfural detoxification rate 2.1-fold and also accelerated glucose consumption 1.4-fold. When it compares to another known system increasing furfural tolerance, membrane-bound transhydrogenase (pntAB), the combinatorial aldehyde oxidoreductases were better on cell growth and production. Thus, to control oxidoreductases is important to produce isobutanol using furfural-containing biomass and the combinatorial overexpression of FucO and YqhD can be an alternative strategy.

INdAM conference "CoMeTA 2013 - Combinatorial Methods in Topology and Algebra"

CERN Document Server

Delucchi, Emanuele; Moci, Luca

2015-01-01

Combinatorics plays a prominent role in contemporary mathematics, due to the vibrant development it has experienced in the last two decades and its many interactions with other subjects. This book arises from the INdAM conference "CoMeTA 2013 - Combinatorial Methods in Topology and Algebra,'' which was held in Cortona in September 2013. The event brought together emerging and leading researchers at the crossroads of Combinatorics, Topology and Algebra, with a particular focus on new trends in subjects such as: hyperplane arrangements; discrete geometry and combinatorial topology; polytope theory and triangulations of manifolds; combinatorial algebraic geometry and commutative algebra; algebraic combinatorics; and combinatorial representation theory. The book is divided into two parts. The first expands on the topics discussed at the conference by providing additional background and explanations, while the second presents original contributions on new trends in the topics addressed by the conference.

Combinatorial algebraic geometry selected papers from the 2016 apprenticeship program

CERN Document Server

Sturmfels, Bernd

2017-01-01

This volume consolidates selected articles from the 2016 Apprenticeship Program at the Fields Institute, part of the larger program on Combinatorial Algebraic Geometry that ran from July through December of 2016. Written primarily by junior mathematicians, the articles cover a range of topics in combinatorial algebraic geometry including curves, surfaces, Grassmannians, convexity, abelian varieties, and moduli spaces. This book bridges the gap between graduate courses and cutting-edge research by connecting historical sources, computation, explicit examples, and new results.

PIPERIDINE OLIGOMERS AND COMBINATORIAL LIBRARIES THEREOF

DEFF Research Database (Denmark)

1999-01-01

The present invention relates to piperidine oligomers, methods for the preparation of piperidine oligomers and compound libraries thereof, and the use of piperidine oligomers as drug substances. The present invention also relates to the use of combinatorial libraries of piperidine oligomers...... in libraries (arrays) of compounds especially suitable for screening purposes....

Three Syntactic Theories for Combinatory Graph Reduction

DEFF Research Database (Denmark)

Danvy, Olivier; Zerny, Ian

2011-01-01

in a third syntactic theory. The structure of the store-based abstract machine corresponding to this third syntactic theory oincides with that of Turner's original reduction machine. The three syntactic theories presented here The three syntactic heories presented here therefore have the following......We present a purely syntactic theory of graph reduction for the canonical combinators S, K, and I, where graph vertices are represented with evaluation contexts and let expressions. We express this syntactic theory as a reduction semantics, which we refocus into the first storeless abstract machine...... for combinatory graph reduction, which we refunctionalize into the first storeless natural semantics for combinatory graph reduction.We then factor out the introduction of let expressions to denote as many graph vertices as possible upfront instead of on demand, resulting in a second syntactic theory, this one...

Three Syntactic Theories for Combinatory Graph Reduction

DEFF Research Database (Denmark)

Danvy, Olivier; Zerny, Ian

2013-01-01

, as a store-based reduction semantics of combinatory term graphs. We then refocus this store-based reduction semantics into a store-based abstract machine. The architecture of this store-based abstract machine coincides with that of Turner's original reduction machine. The three syntactic theories presented......We present a purely syntactic theory of graph reduction for the canonical combinators S, K, and I, where graph vertices are represented with evaluation contexts and let expressions. We express this rst syntactic theory as a storeless reduction semantics of combinatory terms. We then factor out...... the introduction of let expressions to denote as many graph vertices as possible upfront instead of on demand . The factored terms can be interpreted as term graphs in the sense of Barendregt et al. We express this second syntactic theory, which we prove equivalent to the rst, as a storeless reduction semantics...

Set Partitions and the Multiplication Principle

Science.gov (United States)

Lockwood, Elise; Caughman, John S., IV

2016-01-01

To further understand student thinking in the context of combinatorial enumeration, we examine student work on a problem involving set partitions. In this context, we note some key features of the multiplication principle that were often not attended to by students. We also share a productive way of thinking that emerged for several students who…

Specificity and combinatorial effects of Bacillus thuringiensis Cry toxins in the context of GMO environmental risk assessment

Directory of Open Access Journals (Sweden)

Angelika eHilbeck

2015-11-01

Full Text Available Stacked GM crops expressing up to six Cry toxins from Bacillus thuringiensis are today replacing the formerly grown single- transgene GM crop varieties. Stacking of multiple Cry toxins not only increase the environmental load of toxins but also raise the question on how possible interactions of the toxins can be assessed for risk assessment, which is mandatory for GM crops. However, no operational guidelines for a testing strategy or testing procedures exist. From the developers point of view, little data testing for combinatorial effects of Cry toxins is necessary as the range of affected organisms is focused on pest species and no evidence is claimed to exists pointing to combinatorial effects on nontarget organisms. We have examined this rationale critically using information reported in the scientific literature. To do so we address the hypothesis of narrow specificity of Cry toxins subdivided into three underlying different conceptual conditions i 'efficacy' in target pests as indicator for 'narrow specificity', ii lack of reported adverse effects of Cry toxins on nontarget organisms, and iii proposed modes of action of Cry toxins (or the lack thereof as mechanisms underlying the reported activity/efficacy/specificity of Cry toxins. Complementary to this information we evaluate reports about outcomes of combinatorial effect testing of Cry toxins in the scientific literature and relate those findings to the practice of the environmental risk assessment of Bt-corps in general and of stacked Bt-events in particular.

A Convergent Solid-Phase Synthesis of Actinomycin Analogues - Towards Implementation of Double-Combinatorial Chemistry

DEFF Research Database (Denmark)

Tong, Glenn; Nielsen, John

1996-01-01

The actinomycin antibiotics bind to nucleic acids via both intercalation and hydrogen bonding. We found this 'double-action attack' mechanism very attractive in our search for a novel class of nucleic acid binders. A highly convergent, solid-phase synthetic strategy has been developed for a class...... with the requirements for combinatorial synthesis and furthermore, the final segment condensation allows, for the first time, double-combinatorial chemistry to be performed where two combinatorial libraries can be reacted with each other. Copyright (C) 1996 Elsevier Science Ltd....

Single blastocyst transfer: The key to reduce multiple pregnancy rates without compromising the live birth rate

Directory of Open Access Journals (Sweden)

Uma M Sundhararaj

2017-01-01

Full Text Available Background: Historically, to achieve higher pregnancy rates, multiple embryos were transferred after an in-vitro fertilisation (IVF. However, this practice is being reassessed, because it leads to multiple pregnancies that is known to cause adverse maternal and fetal outcomes. Aim: To compare the pregnancy outcomes in fresh IVF or intracytoplasmic sperm injection (ICSI cycles among women undergoing elective single blastocyst transfer (eSBT vs. those undergoing double blastocyst transfer (DBT. Settings and Design: It is a retrospective data analysis of 582 patients undergoing fresh IVF/ICSI cycles performed from January 2012 to June 2015. Materials and Methods: Patients, who underwent IVF/ICSI and developed more than one blastocyst, were included in the study. Donor cycles were excluded from the study. All the embryos were cultured to blastocyst stage in sequential media followed by transfer of two blastocysts (DBT or eSBT and cryopreservation of the remaining. Statistical Analysis: Statistical analysis was performed using chi square test. Results: Out of 582 patients, in 149 patients one blastocyst was transferred and in 433 patients two blastocysts were transferred. There was no statistical difference in the biochemical pregnancy rate, clinical pregnancy rate and live birth rate in both the groups. Statistics demonstrated a significant drop in miscarriage rate in eSBT group. There was no incidence of twins in eSBT group, whereas twin birth rate per clinical pregnancy was 29.02% in DBT group. Conclusion: Single blastocyst transfer is an effective method to reduce the risk of multiple births without compromising the pregnancy outcomes. Given the promising potential of vitrification; the remaining blastocyst can be cryopreserved.

Log-balanced combinatorial sequences

Directory of Open Access Journals (Sweden)

Tomislav Došlic

2005-01-01

Full Text Available We consider log-convex sequences that satisfy an additional constraint imposed on their rate of growth. We call such sequences log-balanced. It is shown that all such sequences satisfy a pair of double inequalities. Sufficient conditions for log-balancedness are given for the case when the sequence satisfies a two- (or more- term linear recurrence. It is shown that many combinatorially interesting sequences belong to this class, and, as a consequence, that the above-mentioned double inequalities are valid for all of them.

Theory of site-specific interactions of the combinatorial transcription factors with DNA

International Nuclear Information System (INIS)

Murugan, R

2010-01-01

We derive a functional relationship between the mean first passage time associated with the concurrent binding of multiple transcription factors (TFs) at their respective combinatorial cis-regulatory module sites (CRMs) and the number n of TFs involved in the regulation of the initiation of transcription of a gene of interest. Our results suggest that the overall search time τ s that is required by the n TFs to locate their CRMs which are all located on the same DNA chain scales with n as τ s ∼n α where α ∼ (2/5). When the jump size k that is associated with the dynamics of all the n TFs along DNA is higher than that of the critical jump size k c that scales with the size of DNA N as k c ∼ N 2/3 , we observe a similar power law scaling relationship and also the exponent α. When k c , α shows a strong dependence on both n and k. Apparently there is a critical number of combinatorial TFs n c ∼ 20 that is required to efficiently regulate the initiation of transcription of a given gene below which (2/5) 1. These results seem to be independent of the initial distances between the TFs and their corresponding CRMs and also suggest that the maximum number of TFs involved in a given combinatorial regulation of the initiation of transcription of a gene of interest seems to be restricted by the degree of condensation of the genomic DNA. The optimum number m opt of roadblock protein molecules per genome at which the search time associated with these n TFs to locate their binding sites is a minimum seems to scale as m opt ∼Ln α/2 where L is the sliding length of TFs whose maximum value seems to be such that L ≤ 10 4 bps for the E. coli bacterial genome.

Novel Combinatorial Chemistry-Derived Inhibitors of Oncogenic Phosphatases

National Research Council Canada - National Science Library

Lazo, John

1999-01-01

Our overall goal of this US Army Breast Cancer Grant entitled "Novel Combinatorial Chemistry-Derived Inhibitors of Oncogenic Phosphatases" is to identity and develop novel therapeutic agents for human breast cancer...

Combinatorial Solid-Phase Synthesis of Balanol Analogues

DEFF Research Database (Denmark)

Nielsen, John; Lyngsø, Lars Ole

1996-01-01

The natural product balanol has served as a template for the design and synthesis of a combinatorial library using solid-phase chemistry. Using a retrosynthetic analysis, the structural analogues have been assembled from three relatively accessible building blocks. The solid-phase chemistry inclu...

Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies

NARCIS (Netherlands)

Ketema, J.; Simonsen, Jakob Grue

2010-01-01

We study normalising reduction strategies for infinitary Combinatory Reduction Systems (iCRSs). We prove that all fair, outermost-fair, and needed-fair strategies are normalising for orthogonal, fully-extended iCRSs. These facts properly generalise a number of results on normalising strategies in

Mitigation of Control Channel Jamming via Combinatorial Key Distribution

Science.gov (United States)

Falahati, Abolfazl; Azarafrooz, Mahdi

The problem of countering control channel jamming against internal adversaries in wireless ad hoc networks is addressed. Using combinatorial key distribution, a new method to secure the control channel access is introduced. This method, utilizes the established keys in the key establishment phase to hide the location of control channels without the need for a secure BS. This is in obtained by combination of a collision free one-way function and a combinatorial key establishment method. The proposed scheme can be considered as a special case of the ALOHA random access schemes which uses the common established keys as its seeds to generate the pattern of transmission.

On some interconnections between combinatorial optimization and extremal graph theory

Directory of Open Access Journals (Sweden)

Cvetković Dragoš M.

2004-01-01

Full Text Available The uniting feature of combinatorial optimization and extremal graph theory is that in both areas one should find extrema of a function defined in most cases on a finite set. While in combinatorial optimization the point is in developing efficient algorithms and heuristics for solving specified types of problems, the extremal graph theory deals with finding bounds for various graph invariants under some constraints and with constructing extremal graphs. We analyze by examples some interconnections and interactions of the two theories and propose some conclusions.

Functional completeness of the mixed λ-calculus and combinatory logic

DEFF Research Database (Denmark)

Nielson, Hanne Riis; Nielson, Flemming

1990-01-01

Functional completeness of the combinatory logic means that every lambda-expression may be translated into an equivalent combinator expression and this is the theoretical basis for the implementation of functional languages on combinator-based abstract machines. To obtain efficient implementations...... it is important to distinguish between early and late binding times, i.e. to distinguish between compile-time and run-time computations. The authors therefore introduce a two-level version of the lambda-calculus where this distinction is made in an explicit way. Turning to the combinatory logic they generate...

Gems of combinatorial optimization and graph algorithms

CERN Document Server

Skutella, Martin; Stiller, Sebastian; Wagner, Dorothea

2015-01-01

Are you looking for new lectures for your course on algorithms, combinatorial optimization, or algorithmic game theory?  Maybe you need a convenient source of relevant, current topics for a graduate student or advanced undergraduate student seminar?  Or perhaps you just want an enjoyable look at some beautiful mathematical and algorithmic results, ideas, proofs, concepts, and techniques in discrete mathematics and theoretical computer science?   Gems of Combinatorial Optimization and Graph Algorithms is a handpicked collection of up-to-date articles, carefully prepared by a select group of international experts, who have contributed some of their most mathematically or algorithmically elegant ideas.  Topics include longest tours and Steiner trees in geometric spaces, cartograms, resource buying games, congestion games, selfish routing, revenue equivalence and shortest paths, scheduling, linear structures in graphs, contraction hierarchies, budgeted matching problems, and motifs in networks.   This ...

Cryptographic Combinatorial Securities Exchanges

Science.gov (United States)

Thorpe, Christopher; Parkes, David C.

We present a useful new mechanism that facilitates the atomic exchange of many large baskets of securities in a combinatorial exchange. Cryptography prevents information about the securities in the baskets from being exploited, enhancing trust. Our exchange offers institutions who wish to trade large positions a new alternative to existing methods of block trading: they can reduce transaction costs by taking advantage of other institutions’ available liquidity, while third party liquidity providers guarantee execution—preserving their desired portfolio composition at all times. In our exchange, institutions submit encrypted orders which are crossed, leaving a “remainder”. The exchange proves facts about the portfolio risk of this remainder to third party liquidity providers without revealing the securities in the remainder, the knowledge of which could also be exploited. The third parties learn either (depending on the setting) the portfolio risk parameters of the remainder itself, or how their own portfolio risk would change if they were to incorporate the remainder into a portfolio they submit. In one setting, these third parties submit bids on the commission, and the winner supplies necessary liquidity for the entire exchange to clear. This guaranteed clearing, coupled with external price discovery from the primary markets for the securities, sidesteps difficult combinatorial optimization problems. This latter method of proving how taking on the remainder would change risk parameters of one’s own portfolio, without revealing the remainder’s contents or its own risk parameters, is a useful protocol of independent interest.

Conventional MRI and magnetisation transfer imaging of tumour-like multiple sclerosis in a child

International Nuclear Information System (INIS)

Metafratzi, Z.; Argyropoulou, M.I.; Efremidis, S.C.; Tzoufi, M.; Papadopoulou, Z.

2002-01-01

Tumefactive multiple sclerosis is a rare entity in children. Differential diagnosis includes other mass lesions such as neoplasm and abscess. A case of tumefactive multiple sclerosis in a child is presented. The open-ring pattern of enhancement on conventional MRI and magnetisation transfer imaging was important for the initial diagnosis and the evaluation of the course of the disease. (orig.)

The Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem

Directory of Open Access Journals (Sweden)

Denis Pinha

2016-11-01

Full Text Available This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practical situations where the definition of optimal changes on a regular basis. The proposed approach empowers the project manager to determine what is optimal, on a given day, under the current constraints, such as, change of priorities, lack of skilled worker. The proposed method utilizes a simulation approach to determine feasible solutions, under the current constraints. Resources can be non-consumable, consumable, or doubly constrained. The paper also presents a real-life case study dealing with scheduling of ship repair activities.

A combinatorial perspective of the protein inference problem.

Science.gov (United States)

Yang, Chao; He, Zengyou; Yu, Weichuan

2013-01-01

In a shotgun proteomics experiment, proteins are the most biologically meaningful output. The success of proteomics studies depends on the ability to accurately and efficiently identify proteins. Many methods have been proposed to facilitate the identification of proteins from peptide identification results. However, the relationship between protein identification and peptide identification has not been thoroughly explained before. In this paper, we devote ourselves to a combinatorial perspective of the protein inference problem. We employ combinatorial mathematics to calculate the conditional protein probabilities (protein probability means the probability that a protein is correctly identified) under three assumptions, which lead to a lower bound, an upper bound, and an empirical estimation of protein probabilities, respectively. The combinatorial perspective enables us to obtain an analytical expression for protein inference. Our method achieves comparable results with ProteinProphet in a more efficient manner in experiments on two data sets of standard protein mixtures and two data sets of real samples. Based on our model, we study the impact of unique peptides and degenerate peptides (degenerate peptides are peptides shared by at least two proteins) on protein probabilities. Meanwhile, we also study the relationship between our model and ProteinProphet. We name our program ProteinInfer. Its Java source code, our supplementary document and experimental results are available at: >http://bioinformatics.ust.hk/proteininfer.

Effects of Suboptimal Bidding in Combinatorial Auctions

Science.gov (United States)

Schneider, Stefan; Shabalin, Pasha; Bichler, Martin

Though the VCG auction assumes a central place in the mechanism design literature, there are a number of reasons for favoring iterative combinatorial auction designs. Several promising ascending auction formats have been developed throughout the past few years based on primal-dual and subgradient algorithms and linear programming theory. Prices are interpreted as a feasible dual solution and the provisional allocation is interpreted as a feasible primal solution. iBundle( 3) (Parkes and Ungar 2000), dVSV (de Vries et al. 2007) and the Ascending Proxy auction (Ausubel and Milgrom 2002) result in VCG payoffs when the coalitional value function satisfies the buyer submodularity condition and bidders bid straightforward, which is an expost Nash equilibrium in that case. iBEA and CreditDebit auctions (Mishra and Parkes 2007) do not even require the buyer submodularity condition and achieve the same properties for general valuations. In many situations, however, one cannot assume bidders to bid straightforward and it is not clear from the theory how these non-linear personalized price auctions (NLPPAs) perform in this case. Robustness of auctions with respect to different bidding behavior is therefore a critical issue for any application. We have conducted a large number of computational experiments to analyze the performance of NLPPA designs with respect to different bidding strategies and different valuation models. We compare the results of NLPPAs to those of the VCG auction and those of iterative combinatorial auctions with approximate linear prices, such as ALPS (Bichler et al. 2009) and the Combinatorial Clock auction (Porter et al. 2003).

Correction of measured multiplicity distributions by the simulated annealing method

International Nuclear Information System (INIS)

Hafidouni, M.

1993-01-01

Simulated annealing is a method used to solve combinatorial optimization problems. It is used here for the correction of the observed multiplicity distribution from S-Pb collisions at 200 GeV/c per nucleon. (author) 11 refs., 2 figs

Combinatorial biosynthesis of medicinal plant secondary metabolites

NARCIS (Netherlands)

Julsing, Mattijs K.; Koulman, Albert; Woerdenbag, Herman J.; Quax, Wim J.; Kayser, Oliver

2006-01-01

Combinatorial biosynthesis is a new tool in the generation of novel natural products and for the production of rare and expensive natural products. The basic concept is combining metabolic pathways in different organisms on a genetic level. As a consequence heterologous organisms provide precursors

A Combinatorial Kin Discrimination System in Bacillus subtilis.

Science.gov (United States)

Lyons, Nicholas A; Kraigher, Barbara; Stefanic, Polonca; Mandic-Mulec, Ines; Kolter, Roberto

2016-03-21

Multicellularity inherently involves a number of cooperative behaviors that are potentially susceptible to exploitation but can be protected by mechanisms such as kin discrimination. Discrimination of kin from non-kin has been observed in swarms of the bacterium Bacillus subtilis, but the underlying molecular mechanism has been unknown. We used genetic, transcriptomic, and bioinformatic analyses to uncover kin recognition factors in this organism. Our results identified many molecules involved in cell-surface modification and antimicrobial production and response. These genes varied significantly in expression level and mutation phenotype among B. subtilis strains, suggesting interstrain variation in the exact kin discrimination mechanism used. Genome analyses revealed a substantial diversity of antimicrobial genes present in unique combinations in different strains, with many likely acquired by horizontal gene transfer. The dynamic combinatorial effect derived from this plethora of kin discrimination genes creates a tight relatedness cutoff for cooperation that has likely led to rapid diversification within the species. Our data suggest that genes likely originally selected for competitive purposes also generate preferential interactions among kin, thus stabilizing multicellular lifestyles. Copyright © 2016 Elsevier Ltd. All rights reserved.

Binary Cockroach Swarm Optimization for Combinatorial Optimization Problem

Directory of Open Access Journals (Sweden)

Ibidun Christiana Obagbuwa

2016-09-01

Full Text Available The Cockroach Swarm Optimization (CSO algorithm is inspired by cockroach social behavior. It is a simple and efficient meta-heuristic algorithm and has been applied to solve global optimization problems successfully. The original CSO algorithm and its variants operate mainly in continuous search space and cannot solve binary-coded optimization problems directly. Many optimization problems have their decision variables in binary. Binary Cockroach Swarm Optimization (BCSO is proposed in this paper to tackle such problems and was evaluated on the popular Traveling Salesman Problem (TSP, which is considered to be an NP-hard Combinatorial Optimization Problem (COP. A transfer function was employed to map a continuous search space CSO to binary search space. The performance of the proposed algorithm was tested firstly on benchmark functions through simulation studies and compared with the performance of existing binary particle swarm optimization and continuous space versions of CSO. The proposed BCSO was adapted to TSP and applied to a set of benchmark instances of symmetric TSP from the TSP library. The results of the proposed Binary Cockroach Swarm Optimization (BCSO algorithm on TSP were compared to other meta-heuristic algorithms.

Combinatorial Models for Assembly and Decomposition of Products

Directory of Open Access Journals (Sweden)

A. N. Bojko

2015-01-01

Full Text Available The paper discusses the most popular combinatorial models that are used for the synthesis of design solutions at the stage of the assembly process flow preparation. It shows that while assembling the product the relations of parts can be represented as a structure of preferences, which is formed on the basis of objective design restrictions put in at the stage of the product design. This structure is a binary preference relation pre-order. Its symmetrical part is equivalence and describes the entry of parts into the assembly unit. The asymmetric part is a partial order. It specifies part- ordering time in in the course of the assembly process. The structure of preferences is a minimal description of the restrictions and constraints in the assembly process. It can serve as a source for generating multiple assembly sequences of a product and its components, which are allowed by design. This multiplicity increases the likelihood of rational choice under uncertainty, unpredictable changes in the properties of technological or industrial systems.Incomplete dominance relation gives grounds for further examination and better understanding of the project situation. Operation field of the study is limited to a set of disparate elements of the partial order. Different strategies for processing the disparate elements may be offered, e.g. selection of the most informative pairs, comparison of which foremost linearizes the original partial order.

Combinatorial aspects of covering arrays

Directory of Open Access Journals (Sweden)

Charles J. Colbourn

2004-11-01

Full Text Available Covering arrays generalize orthogonal arrays by requiring that t -tuples be covered, but not requiring that the appearance of t -tuples be balanced.Their uses in screening experiments has found application in software testing, hardware testing, and a variety of fields in which interactions among factors are to be identified. Here a combinatorial view of covering arrays is adopted, encompassing basic bounds, direct constructions, recursive constructions, algorithmic methods, and applications.

KENO-IV/CG, the combinatorial geometry version of the KENO Monte Carlo criticality safety program

International Nuclear Information System (INIS)

West, J.T.; Petrie, L.M.; Fraley, S.K.

1979-09-01

KENO-IV/CG was developed to merge the simple geometry input description utilized by combinatorial geometry with the repeating lattice feature of the original KENO geometry package. The result is a criticality code with the ability to model a complex system of repeating rectangular lattices inside a complicated three-dimensional geometry system. Furthermore, combinatorial geometry was modified to differentiate between combinatorial zones describing a particular KENO BOX to be repeated in a KENO array and those combinatorial zones describing geometry external to an array. This allows the user to maintain a simple coordinate system without any geometric conflict due to spatial overlap. Several difficult criticality design problems have been solved with the new geometry package in KENO-IV/CG, thus illustrating the power of the code to model difficult geometries with a minimum of effort

Multiple Scattering Principal Component-based Radiative Transfer Model (PCRTM) from Far IR to UV-Vis

Science.gov (United States)

Liu, X.; Wu, W.; Yang, Q.

2017-12-01

Modern satellite hyperspectral satellite remote sensors such as AIRS, CrIS, IASI, CLARREO all require accurate and fast radiative transfer models that can deal with multiple scattering of clouds and aerosols to explore the information contents. However, performing full radiative transfer calculations using multiple stream methods such as discrete ordinate (DISORT), doubling and adding (AD), successive order of scattering order of scattering (SOS) are very time consuming. We have developed a principal component-based radiative transfer model (PCRTM) to reduce the computational burden by orders of magnitudes while maintain high accuracy. By exploring spectral correlations, the PCRTM reduce the number of radiative transfer calculations in frequency domain. It further uses a hybrid stream method to decrease the number of calls to the computational expensive multiple scattering calculations with high stream numbers. Other fast parameterizations have been used in the infrared spectral region reduce the computational time to milliseconds for an AIRS forward simulation (2378 spectral channels). The PCRTM has been development to cover spectral range from far IR to UV-Vis. The PCRTM model have been be used for satellite data inversions, proxy data generation, inter-satellite calibrations, spectral fingerprinting, and climate OSSE. We will show examples of applying the PCRTM to single field of view cloudy retrievals of atmospheric temperature, moisture, traces gases, clouds, and surface parameters. We will also show how the PCRTM are used for the NASA CLARREO project.

Adaptive Horizontal Gene Transfers between Multiple Cheese-Associated Fungi.

Science.gov (United States)

Ropars, Jeanne; Rodríguez de la Vega, Ricardo C; López-Villavicencio, Manuela; Gouzy, Jérôme; Sallet, Erika; Dumas, Émilie; Lacoste, Sandrine; Debuchy, Robert; Dupont, Joëlle; Branca, Antoine; Giraud, Tatiana

2015-10-05

Domestication is an excellent model for studies of adaptation because it involves recent and strong selection on a few, identified traits [1-5]. Few studies have focused on the domestication of fungi, with notable exceptions [6-11], despite their importance to bioindustry [12] and to a general understanding of adaptation in eukaryotes [5]. Penicillium fungi are ubiquitous molds among which two distantly related species have been independently selected for cheese making-P. roqueforti for blue cheeses like Roquefort and P. camemberti for soft cheeses like Camembert. The selected traits include morphology, aromatic profile, lipolytic and proteolytic activities, and ability to grow at low temperatures, in a matrix containing bacterial and fungal competitors [13-15]. By comparing the genomes of ten Penicillium species, we show that adaptation to cheese was associated with multiple recent horizontal transfers of large genomic regions carrying crucial metabolic genes. We identified seven horizontally transferred regions (HTRs) spanning more than 10 kb each, flanked by specific transposable elements, and displaying nearly 100% identity between distant Penicillium species. Two HTRs carried genes with functions involved in the utilization of cheese nutrients or competition and were found nearly identical in multiple strains and species of cheese-associated Penicillium fungi, indicating recent selective sweeps; they were experimentally associated with faster growth and greater competitiveness on cheese and contained genes highly expressed in the early stage of cheese maturation. These findings have industrial and food safety implications and improve our understanding of the processes of adaptation to rapid environmental changes. Copyright © 2015 The Authors. Published by Elsevier Ltd.. All rights reserved.

Phase Transitions in Combinatorial Optimization Problems Basics, Algorithms and Statistical Mechanics

CERN Document Server

Hartmann, Alexander K

2005-01-01

A concise, comprehensive introduction to the topic of statistical physics of combinatorial optimization, bringing together theoretical concepts and algorithms from computer science with analytical methods from physics. The result bridges the gap between statistical physics and combinatorial optimization, investigating problems taken from theoretical computing, such as the vertex-cover problem, with the concepts and methods of theoretical physics. The authors cover rapid developments and analytical methods that are both extremely complex and spread by word-of-mouth, providing all the necessary

Exploiting Quantum Resonance to Solve Combinatorial Problems

Science.gov (United States)

Zak, Michail; Fijany, Amir

2006-01-01

Quantum resonance would be exploited in a proposed quantum-computing approach to the solution of combinatorial optimization problems. In quantum computing in general, one takes advantage of the fact that an algorithm cannot be decoupled from the physical effects available to implement it. Prior approaches to quantum computing have involved exploitation of only a subset of known quantum physical effects, notably including parallelism and entanglement, but not including resonance. In the proposed approach, one would utilize the combinatorial properties of tensor-product decomposability of unitary evolution of many-particle quantum systems for physically simulating solutions to NP-complete problems (a class of problems that are intractable with respect to classical methods of computation). In this approach, reinforcement and selection of a desired solution would be executed by means of quantum resonance. Classes of NP-complete problems that are important in practice and could be solved by the proposed approach include planning, scheduling, search, and optimal design.

Orbit Clustering Based on Transfer Cost

Science.gov (United States)

Gustafson, Eric D.; Arrieta-Camacho, Juan J.; Petropoulos, Anastassios E.

2013-01-01

We propose using cluster analysis to perform quick screening for combinatorial global optimization problems. The key missing component currently preventing cluster analysis from use in this context is the lack of a useable metric function that defines the cost to transfer between two orbits. We study several proposed metrics and clustering algorithms, including k-means and the expectation maximization algorithm. We also show that proven heuristic methods such as the Q-law can be modified to work with cluster analysis.

Problems with multiple use of transfer buffer in protein electrophoretic transfer.

Science.gov (United States)

Dorri, Yaser; Kurien, Biji T; Scofield, R Hal

2010-04-01

Two-dimensional gel electrophoresis (2DE) and SDS-PAGE are the two most useful methods in protein separation. Proteins separated by 2DE or SDS-PAGE are usually transferred to membranes using a variety of methods, such as electrophoretic transfer, heat-mediated transfer, or nonelectrophoretic transfer, for specific protein detection and/or analysis. In a recent study, Pettegrew et al. claim to reuse transfer buffer containing methanol for at least five times for transferring proteins from SDS-PAGE to polyvinylidene difluoride. They add 150-200 ml fresh transfer solution each time for extended use as a result of loss of transfer buffer. Finally, they test efficiency of each protein transfer by chemiluminescence detection. Here, we comment on this report, as we believe this method is not accurate and useful for protein analysis, and it can cause background binding as well as inaccurate protein analysis.

Combinatorial chemistry on solid support in the search for central nervous system agents.

Science.gov (United States)

Zajdel, Paweł; Pawłowski, Maciej; Martinez, Jean; Subra, Gilles

2009-08-01

The advent of combinatorial chemistry was one of the most important developments, that has significantly contributed to the drug discovery process. Within just a few years, its initial concept aimed at production of libraries containing huge number of compounds (thousands to millions), so called screening libraries, has shifted towards preparation of small and medium-sized rationally designed libraries. When applicable, the use of solid supports for the generation of libraries has been a real breakthrough in enhancing productivity. With a limited amount of resin and simple manual workups, the split/mix procedure may generate thousands of bead-tethered compounds. Beads can be chemically or physically encoded to facilitate the identification of a hit after the biological assay. Compartmentalization of solid supports using small reactors like teabags, kans or pellicular discrete supports like Lanterns resulted in powerful sort and combine technologies, relying on codes 'written' on the reactor, and thus reducing the need for automation and improving the number of compounds synthesized. These methods of solid-phase combinatorial chemistry have been recently supported by introduction of solid-supported reagents and scavenger resins. The first part of this review discusses the general premises of combinatorial chemistry and some methods used in the design of primary and focused combinatorial libraries. The aim of the second part is to present combinatorial chemistry methodologies aimed at discovering bioactive compounds acting on diverse GPCR involved in central nervous system disorders.

Combinatorial Clustering Algorithm of Quantum-Behaved Particle Swarm Optimization and Cloud Model

Directory of Open Access Journals (Sweden)

Mi-Yuan Shan

2013-01-01

Full Text Available We propose a combinatorial clustering algorithm of cloud model and quantum-behaved particle swarm optimization (COCQPSO to solve the stochastic problem. The algorithm employs a novel probability model as well as a permutation-based local search method. We are setting the parameters of COCQPSO based on the design of experiment. In the comprehensive computational study, we scrutinize the performance of COCQPSO on a set of widely used benchmark instances. By benchmarking combinatorial clustering algorithm with state-of-the-art algorithms, we can show that its performance compares very favorably. The fuzzy combinatorial optimization algorithm of cloud model and quantum-behaved particle swarm optimization (FCOCQPSO in vague sets (IVSs is more expressive than the other fuzzy sets. Finally, numerical examples show the clustering effectiveness of COCQPSO and FCOCQPSO clustering algorithms which are extremely remarkable.

Implementation of a combinatorial cleavage and deprotection scheme

DEFF Research Database (Denmark)

Nielsen, John; Rasmussen, Palle H.

1996-01-01

Phthalhydrazide libraries are synthesized in solution from substituted hydrazines and phthalimides in several different library formats including single compounds, indexed sub-libraries and a full library. When carried out during solid-phase synthesis, this combinatorial cleavage and deprotection...

Combinatorial Optimization in Project Selection Using Genetic Algorithm

Science.gov (United States)

Dewi, Sari; Sawaluddin

2018-01-01

This paper discusses the problem of project selection in the presence of two objective functions that maximize profit and minimize cost and the existence of some limitations is limited resources availability and time available so that there is need allocation of resources in each project. These resources are human resources, machine resources, raw material resources. This is treated as a consideration to not exceed the budget that has been determined. So that can be formulated mathematics for objective function (multi-objective) with boundaries that fulfilled. To assist the project selection process, a multi-objective combinatorial optimization approach is used to obtain an optimal solution for the selection of the right project. It then described a multi-objective method of genetic algorithm as one method of multi-objective combinatorial optimization approach to simplify the project selection process in a large scope.

Evaluation of the Optimum Composition of Low-Temperature Fuel Cell Electrocatalysts for Methanol Oxidation by Combinatorial Screening.

Science.gov (United States)

Antolini, Ermete

2017-02-13

Combinatorial chemistry and high-throughput screening represent an innovative and rapid tool to prepare and evaluate a large number of new materials, saving time and expense for research and development. Considering that the activity and selectivity of catalysts depend on complex kinetic phenomena, making their development largely empirical in practice, they are prime candidates for combinatorial discovery and optimization. This review presents an overview of recent results of combinatorial screening of low-temperature fuel cell electrocatalysts for methanol oxidation. Optimum catalyst compositions obtained by combinatorial screening were compared with those of bulk catalysts, and the effect of the library geometry on the screening of catalyst composition is highlighted.

The Combinatorial Trace Method in Action

Science.gov (United States)

Krebs, Mike; Martinez, Natalie C.

2013-01-01

On any finite graph, the number of closed walks of length k is equal to the sum of the kth powers of the eigenvalues of any adjacency matrix. This simple observation is the basis for the combinatorial trace method, wherein we attempt to count (or bound) the number of closed walks of a given length so as to obtain information about the graph's…

Weyl Group Multiple Dirichlet Series Type A Combinatorial Theory (AM-175)

CERN Document Server

Brubaker, Ben; Friedberg, Solomon

2011-01-01

Weyl group multiple Dirichlet series are generalizations of the Riemann zeta function. Like the Riemann zeta function, they are Dirichlet series with analytic continuation and functional equations, having applications to analytic number theory. By contrast, these Weyl group multiple Dirichlet series may be functions of several complex variables and their groups of functional equations may be arbitrary finite Weyl groups. Furthermore, their coefficients are multiplicative up to roots of unity, generalizing the notion of Euler products. This book proves foundational results about these series an

Dynamic combinatorial chemistry at the phospholipid bilayer interface

NARCIS (Netherlands)

Mansfeld, Friederike M.; Au-Yeung, Ho Yu; Sanders, Jeremy K.M.; Otto, Sijbren

2010-01-01

Background: Molecular recognition at the environment provided by the phospholipid bilayer interface plays an important role in biology and is subject of intense investigation. Dynamic combinatorial chemistry is a powerful approach for exploring molecular recognition, but has thus far not been

Programme for test generation for combinatorial and sequential systems

International Nuclear Information System (INIS)

Tran Huy Hoan

1973-01-01

This research thesis reports the computer-assisted search for tests aimed at failure detection in combinatorial and sequential logic circuits. As he wants to deal with complex circuits with many modules such as those met in large scale integrated circuits (LSI), the author used propagation paths. He reports the development of a method which is valid for combinatorial systems and for several sequential circuits comprising elementary logic modules and JK and RS flip-flops. This method is developed on an IBM 360/91 computer in PL/1 language. The used memory space is limited and adjustable with respect to circuit dimension. Computing time is short when compared to that needed by other programmes. The solution is practical and efficient for failure test and localisation

Combinatorial nuclear level density by a Monte Carlo method

International Nuclear Information System (INIS)

Cerf, N.

1994-01-01

We present a new combinatorial method for the calculation of the nuclear level density. It is based on a Monte Carlo technique, in order to avoid a direct counting procedure which is generally impracticable for high-A nuclei. The Monte Carlo simulation, making use of the Metropolis sampling scheme, allows a computationally fast estimate of the level density for many fermion systems in large shell model spaces. We emphasize the advantages of this Monte Carlo approach, particularly concerning the prediction of the spin and parity distributions of the excited states,and compare our results with those derived from a traditional combinatorial or a statistical method. Such a Monte Carlo technique seems very promising to determine accurate level densities in a large energy range for nuclear reaction calculations

Optical tools for high-throughput screening of abrasion resistance of combinatorial libraries of organic coatings

Science.gov (United States)

Potyrailo, Radislav A.; Chisholm, Bret J.; Olson, Daniel R.; Brennan, Michael J.; Molaison, Chris A.

2002-02-01

Design, validation, and implementation of an optical spectroscopic system for high-throughput analysis of combinatorially developed protective organic coatings are reported. Our approach replaces labor-intensive coating evaluation steps with an automated system that rapidly analyzes 8x6 arrays of coating elements that are deposited on a plastic substrate. Each coating element of the library is 10 mm in diameter and 2 to 5 micrometers thick. Performance of coatings is evaluated with respect to their resistance to wear abrasion because this parameter is one of the primary considerations in end-use applications. Upon testing, the organic coatings undergo changes that are impossible to quantitatively predict using existing knowledge. Coatings are abraded using industry-accepted abrasion test methods at single-or multiple-abrasion conditions, followed by high- throughput analysis of abrasion-induced light scatter. The developed automated system is optimized for the analysis of diffusively scattered light that corresponds to 0 to 30% haze. System precision of 0.1 to 2.5% relative standard deviation provides capability for the reliable ranking of coatings performance. While the system was implemented for high-throughput screening of combinatorially developed organic protective coatings for automotive applications, it can be applied to a variety of other applications where materials ranking can be achieved using optical spectroscopic tools.

The Yoccoz Combinatorial Analytic Invariant

DEFF Research Database (Denmark)

Petersen, Carsten Lunde; Roesch, Pascale

2008-01-01

In this paper we develop a combinatorial analytic encoding of the Mandelbrot set M. The encoding is implicit in Yoccoz' proof of local connectivity of M at any Yoccoz parameter, i.e. any at most finitely renormalizable parameter for which all periodic orbits are repelling. Using this encoding we ...... to reprove that the dyadic veins of M are arcs and that more generally any two Yoccoz parameters are joined by a unique ruled (in the sense of Douady-Hubbard) arc in M....

Modulating weak interactions for molecular recognition: a dynamic combinatorial analysis for assessing the contribution of electrostatics to the stability of CH-π bonds in water.

Science.gov (United States)

Jiménez-Moreno, Ester; Gómez, Ana M; Bastida, Agatha; Corzana, Francisco; Jiménez-Oses, Gonzalo; Jiménez-Barbero, Jesús; Asensio, Juan Luis

2015-03-27

Electrostatic and charge-transfer contributions to CH-π complexes can be modulated by attaching electron-withdrawing substituents to the carbon atom. While clearly stabilizing in the gas phase, the outcome of this chemical modification in water is more difficult to predict. Herein we provide a definitive and quantitative answer to this question employing a simple strategy based on dynamic combinatorial chemistry. © 2015 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Comprehensive human transcription factor binding site map for combinatory binding motifs discovery.

Directory of Open Access Journals (Sweden)

Arnoldo J Müller-Molina

Full Text Available To know the map between transcription factors (TFs and their binding sites is essential to reverse engineer the regulation process. Only about 10%-20% of the transcription factor binding motifs (TFBMs have been reported. This lack of data hinders understanding gene regulation. To address this drawback, we propose a computational method that exploits never used TF properties to discover the missing TFBMs and their sites in all human gene promoters. The method starts by predicting a dictionary of regulatory "DNA words." From this dictionary, it distills 4098 novel predictions. To disclose the crosstalk between motifs, an additional algorithm extracts TF combinatorial binding patterns creating a collection of TF regulatory syntactic rules. Using these rules, we narrowed down a list of 504 novel motifs that appear frequently in syntax patterns. We tested the predictions against 509 known motifs confirming that our system can reliably predict ab initio motifs with an accuracy of 81%-far higher than previous approaches. We found that on average, 90% of the discovered combinatorial binding patterns target at least 10 genes, suggesting that to control in an independent manner smaller gene sets, supplementary regulatory mechanisms are required. Additionally, we discovered that the new TFBMs and their combinatorial patterns convey biological meaning, targeting TFs and genes related to developmental functions. Thus, among all the possible available targets in the genome, the TFs tend to regulate other TFs and genes involved in developmental functions. We provide a comprehensive resource for regulation analysis that includes a dictionary of "DNA words," newly predicted motifs and their corresponding combinatorial patterns. Combinatorial patterns are a useful filter to discover TFBMs that play a major role in orchestrating other factors and thus, are likely to lock/unlock cellular functional clusters.

Isocyanide based multi component reactions in combinatorial chemistry.

NARCIS (Netherlands)

Dömling, A.

1998-01-01

Although usually regarded as a recent development, the combinatorial approach to the synthesis of libraries of new drug candidates was first described as early as 1961 using the isocyanide-based one-pot multicomponent Ugi reaction. Isocyanide-based multi component reactions (MCR's) markedly differ

View discovery in OLAP databases through statistical combinatorial optimization

Energy Technology Data Exchange (ETDEWEB)

Hengartner, Nick W [Los Alamos National Laboratory; Burke, John [PNNL; Critchlow, Terence [PNNL; Joslyn, Cliff [PNNL; Hogan, Emilie [PNNL

2009-01-01

OnLine Analytical Processing (OLAP) is a relational database technology providing users with rapid access to summary, aggregated views of a single large database, and is widely recognized for knowledge representation and discovery in high-dimensional relational databases. OLAP technologies provide intuitive and graphical access to the massively complex set of possible summary views available in large relational (SQL) structured data repositories. The capability of OLAP database software systems to handle data complexity comes at a high price for analysts, presenting them a combinatorially vast space of views of a relational database. We respond to the need to deploy technologies sufficient to allow users to guide themselves to areas of local structure by casting the space of 'views' of an OLAP database as a combinatorial object of all projections and subsets, and 'view discovery' as an search process over that lattice. We equip the view lattice with statistical information theoretical measures sufficient to support a combinatorial optimization process. We outline 'hop-chaining' as a particular view discovery algorithm over this object, wherein users are guided across a permutation of the dimensions by searching for successive two-dimensional views, pushing seen dimensions into an increasingly large background filter in a 'spiraling' search process. We illustrate this work in the context of data cubes recording summary statistics for radiation portal monitors at US ports.

Transfer functions of double- and multiple-cavity Fabry-Perot filters driven by Lorentzian sources.

Science.gov (United States)

Marti, J; Capmany, J

1996-12-20

We derive expressions for the transfer functions of double- and multiple-cavity Fabry-Perot filters driven by laser sources with Lorentzian spectrum. These are of interest because of their applications in sensing and channel filtering in optical frequency-division multiplexing networks.

ON 3-WAY COMBINATORIAL IDENTITIES A. K. AGARWAL MEGHA ...

Indian Academy of Sciences (India)

36

∗Corresponding author: Department of Basic and Applied Sciences, University College of Engineering,. Punjabi ... In this paper we provide combinatorial meanings to two generalized basic ... 2010 Mathematics Subject Classification. 05A15 ...

Exact model reduction of combinatorial reaction networks

Directory of Open Access Journals (Sweden)

Fey Dirk

2008-08-01

Full Text Available Abstract Background Receptors and scaffold proteins usually possess a high number of distinct binding domains inducing the formation of large multiprotein signaling complexes. Due to combinatorial reasons the number of distinguishable species grows exponentially with the number of binding domains and can easily reach several millions. Even by including only a limited number of components and binding domains the resulting models are very large and hardly manageable. A novel model reduction technique allows the significant reduction and modularization of these models. Results We introduce methods that extend and complete the already introduced approach. For instance, we provide techniques to handle the formation of multi-scaffold complexes as well as receptor dimerization. Furthermore, we discuss a new modeling approach that allows the direct generation of exactly reduced model structures. The developed methods are used to reduce a model of EGF and insulin receptor crosstalk comprising 5,182 ordinary differential equations (ODEs to a model with 87 ODEs. Conclusion The methods, presented in this contribution, significantly enhance the available methods to exactly reduce models of combinatorial reaction networks.

Combinatorial structures and processing in neural blackboard architectures

NARCIS (Netherlands)

van der Velde, Frank; van der Velde, Frank; de Kamps, Marc; Besold, Tarek R.; d'Avila Garcez, Artur; Marcus, Gary F.; Miikkulainen, Risto

2015-01-01

We discuss and illustrate Neural Blackboard Architectures (NBAs) as the basis for variable binding and combinatorial processing the brain. We focus on the NBA for sentence structure. NBAs are based on the notion that conceptual representations are in situ, hence cannot be copied or transported.

Random vs. Combinatorial Methods for Discrete Event Simulation of a Grid Computer Network

Science.gov (United States)

Kuhn, D. Richard; Kacker, Raghu; Lei, Yu

2010-01-01

This study compared random and t-way combinatorial inputs of a network simulator, to determine if these two approaches produce significantly different deadlock detection for varying network configurations. Modeling deadlock detection is important for analyzing configuration changes that could inadvertently degrade network operations, or to determine modifications that could be made by attackers to deliberately induce deadlock. Discrete event simulation of a network may be conducted using random generation, of inputs. In this study, we compare random with combinatorial generation of inputs. Combinatorial (or t-way) testing requires every combination of any t parameter values to be covered by at least one test. Combinatorial methods can be highly effective because empirical data suggest that nearly all failures involve the interaction of a small number of parameters (1 to 6). Thus, for example, if all deadlocks involve at most 5-way interactions between n parameters, then exhaustive testing of all n-way interactions adds no additional information that would not be obtained by testing all 5-way interactions. While the maximum degree of interaction between parameters involved in the deadlocks clearly cannot be known in advance, covering all t-way interactions may be more efficient than using random generation of inputs. In this study we tested this hypothesis for t = 2, 3, and 4 for deadlock detection in a network simulation. Achieving the same degree of coverage provided by 4-way tests would have required approximately 3.2 times as many random tests; thus combinatorial methods were more efficient for detecting deadlocks involving a higher degree of interactions. The paper reviews explanations for these results and implications for modeling and simulation.

Bioinspired computation in combinatorial optimization: algorithms and their computational complexity

DEFF Research Database (Denmark)

Neumann, Frank; Witt, Carsten

2012-01-01

Bioinspired computation methods, such as evolutionary algorithms and ant colony optimization, are being applied successfully to complex engineering and combinatorial optimization problems, and it is very important that we understand the computational complexity of these algorithms. This tutorials...... problems. Classical single objective optimization is examined first. They then investigate the computational complexity of bioinspired computation applied to multiobjective variants of the considered combinatorial optimization problems, and in particular they show how multiobjective optimization can help...... to speed up bioinspired computation for single-objective optimization problems. The tutorial is based on a book written by the authors with the same title. Further information about the book can be found at www.bioinspiredcomputation.com....

Advanced Aqueous Phase Catalyst Development using Combinatorial Methods, Phase II

Data.gov (United States)

National Aeronautics and Space Administration — Combinatorial methods are proposed to develop advanced Aqueous Oxidation Catalysts (AOCs) with the capability to mineralize organic contaminants present in effluents...

Device for preparing combinatorial libraries in powder metallurgy.

Science.gov (United States)

Yang, Shoufeng; Evans, Julian R G

2004-01-01

This paper describes a powder-metering, -mixing, and -dispensing mechanism that can be used as a method for producing large numbers of samples for metallurgical evaluation or electrical or mechanical testing from multicomponent metal and cermet powder systems. It is designed to make use of the same commercial powders that are used in powder metallurgy and, therefore, to produce samples that are faithful to the microstructure of finished products. The particle assemblies produced by the device could be consolidated by die pressing, isostatic pressing, laser sintering, or direct melting. The powder metering valve provides both on/off and flow rate control of dry powders in open capillaries using acoustic vibration. The valve is simple and involves no relative movement, avoiding seizure with fine powders. An orchestra of such valves can be arranged on a building platform to prepare multicomponent combinatorial libraries. As with many combinatorial devices, identification and evaluation of sources of mixing error as a function of sample size is mandatory. Such an analysis is presented.

Probabilistic methods in combinatorial analysis

CERN Document Server

Sachkov, Vladimir N

2014-01-01

This 1997 work explores the role of probabilistic methods for solving combinatorial problems. These methods not only provide the means of efficiently using such notions as characteristic and generating functions, the moment method and so on but also let us use the powerful technique of limit theorems. The basic objects under investigation are nonnegative matrices, partitions and mappings of finite sets, with special emphasis on permutations and graphs, and equivalence classes specified on sequences of finite length consisting of elements of partially ordered sets; these specify the probabilist

Steam explosion and its combinatorial pretreatment refining technology of plant biomass to bio-based products.

Science.gov (United States)

Chen, Hong-Zhang; Liu, Zhi-Hua

2015-06-01

Pretreatment is a key unit operation affecting the refinery efficiency of plant biomass. However, the poor efficiency of pretreatment and the lack of basic theory are the main challenges to the industrial implementation of the plant biomass refinery. The purpose of this work is to review steam explosion and its combinatorial pretreatment as a means of overcoming the intrinsic characteristics of plant biomass, including recalcitrance, heterogeneity, multi-composition, and diversity. The main advantages of the selective use of steam explosion and other combinatorial pretreatments across the diversity of raw materials are introduced. Combinatorial pretreatment integrated with other unit operations is proposed as a means to exploit the high-efficiency production of bio-based products from plant biomass. Finally, several pilot- and demonstration-scale operations of the plant biomass refinery are described. Based on the principle of selective function and structure fractionation, and multi-level and directional composition conversion, an integrated process with the combinatorial pretreatments of steam explosion and other pretreatments as the core should be feasible and conform to the plant biomass refinery concept. Combinatorial pretreatments of steam explosion and other pretreatments should be further exploited based on the type and intrinsic characteristics of the plant biomass used, the bio-based products to be made, and the complementarity of the processes. Copyright © 2015 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Numerical Computation of Underground Inundation in Multiple Layers Using the Adaptive Transfer Method

Directory of Open Access Journals (Sweden)

Hyung-Jun Kim

2018-01-01

Full Text Available Extreme rainfall causes surface runoff to flow towards lowlands and subterranean facilities, such as subway stations and buildings with underground spaces in densely packed urban areas. These facilities and areas are therefore vulnerable to catastrophic submergence. However, flood modeling of underground space has not yet been adequately studied because there are difficulties in reproducing the associated multiple horizontal layers connected with staircases or elevators. This study proposes a convenient approach to simulate underground inundation when two layers are connected. The main facet of this approach is to compute the flow flux passing through staircases in an upper layer and to transfer the equivalent quantity to a lower layer. This is defined as the ‘adaptive transfer method’. This method overcomes the limitations of 2D modeling by introducing layers connecting concepts to prevent large variations in mesh sizes caused by complicated underlying obstacles or local details. Consequently, this study aims to contribute to the numerical analysis of flow in inundated underground spaces with multiple floors.

Development of combinatorial chemistry methods for coatings: high-throughput adhesion evaluation and scale-up of combinatorial leads.

Science.gov (United States)

Potyrailo, Radislav A; Chisholm, Bret J; Morris, William G; Cawse, James N; Flanagan, William P; Hassib, Lamyaa; Molaison, Chris A; Ezbiansky, Karin; Medford, George; Reitz, Hariklia

2003-01-01

Coupling of combinatorial chemistry methods with high-throughput (HT) performance testing and measurements of resulting properties has provided a powerful set of tools for the 10-fold accelerated discovery of new high-performance coating materials for automotive applications. Our approach replaces labor-intensive steps with automated systems for evaluation of adhesion of 8 x 6 arrays of coating elements that are discretely deposited on a single 9 x 12 cm plastic substrate. Performance of coatings is evaluated with respect to their resistance to adhesion loss, because this parameter is one of the primary considerations in end-use automotive applications. Our HT adhesion evaluation provides previously unavailable capabilities of high speed and reproducibility of testing by using a robotic automation, an expanded range of types of tested coatings by using the coating tagging strategy, and an improved quantitation by using high signal-to-noise automatic imaging. Upon testing, the coatings undergo changes that are impossible to quantitatively predict using existing knowledge. Using our HT methodology, we have developed several coatings leads. These HT screening results for the best coating compositions have been validated on the traditional scales of coating formulation and adhesion loss testing. These validation results have confirmed the superb performance of combinatorially developed coatings over conventional coatings on the traditional scale.

Combinatorial computational chemistry approach of tight-binding quantum chemical molecular dynamics method to the design of the automotive catalysts

International Nuclear Information System (INIS)

Ito, Yuki; Jung, Changho; Luo, Yi; Koyama, Michihisa; Endou, Akira; Kubo, Momoji; Imamura, Akira; Miyamoto, Akira

2006-01-01

Recently, we have developed a new tight-binding quantum chemical molecular dynamics program 'Colors' for combinatorial computational chemistry approach. This methodology is based on our original tight-binding approximation and realized over 5000 times acceleration compared to the conventional first-principles molecular dynamics method. In the present study, we applied our new program to the simulations on various realistic large-scale models of the automotive three-way catalysts, ultrafine Pt particle/CeO 2 (111) support. Significant electron transfer from the Pt particle to the CeO 2 (111) surface was observed and it was found to strongly depend on the size of the Pt particle. Furthermore, our simulation results suggest that the reduction of the Ce atom due to the electron transfer from the Pt particle to the CeO 2 surface is a main reason for the strong interaction of the Pt particle and CeO 2 (111) support

A combinatorial enumeration problem of RNA secondary structures

African Journals Online (AJOL)

use

2011-12-21

Dec 21, 2011 ... interesting combinatorial questions (Chen et al., 2005;. Liu, 2006; Schmitt and Waterman 1994; Stein and. Waterman 1978). The research on the enumeration of. RNA secondary structures becomes one of the hot topics in Computational Molecular Biology. An RNA molecule is described by its sequences of.

Using Multiple Schedules during Functional Communication Training to Promote Rapid Transfer of Treatment Effects

Science.gov (United States)

Fisher, Wayne W.; Greer, Brian D.; Fuhrman, Ashley M.; Querim, Angie C.

2015-01-01

Multiple schedules with signaled periods of reinforcement and extinction have been used to thin reinforcement schedules during functional communication training (FCT) to make the intervention more practical for parents and teachers. We evaluated whether these signals would also facilitate rapid transfer of treatment effects across settings and…

Study on oxygen transfer by solid jet aerator with multiple openings

Directory of Open Access Journals (Sweden)

B.K. Shukla

2018-04-01

Full Text Available In the current study, two different sets of solid jet aerators having area of openings equal to 594.96 mm2 and 246.30 mm2 with rectangular nozzles having rounded ends were studied. Each set consisted of aerators having one, two, four and eight openings. The oxygenation performance of every model was studied for five different discharges of 1.11 l/s, 2.10 l/s, 2.96 l/s, 3.83 l/s and 4.69 l/s were studied. At low discharges, the aerator having lesser number of openings demonstrated more oxygen-transfer efficiency whereas at higher discharges, the aerator having more number of openings yielded more oxygenation-efficiency. Maximum value of oxygen-transfer efficiency of 21.53 kg-O2/kW-hr was obtained for the discharge of 1.11 l/s for single nozzle aerator; however the maximum oxygen-transfer factor of 2.0 × 10−2 s−1 was obtained at discharge of 4.69 l/s for aerator having eight numbers of openings having area of 594.96 mm2. On the other hand, maximum oxygen transfer efficiency of 10.93 kg-O2/kW-hr was demonstrated by aerator with single opening at a discharge of 1.11 l/s and maximum oxygen transfer factor of 7.83 × 10−3 s−1 was obtained from aerator with eight openings at a discharge of 4.69 l/s corresponding to set of aerators with area of openings equal to 246.30 mm2. Multiple non-linear regression modelling was applied to predict oxygen transfer of the aerators for different combinations of input parameters. At the end, the models were compared with conventional methods of aeration and were found to be competitive with traditional devices. Keywords: Plunging jet, Jet aerator, Oxygen transfer, Aeration, Dissolved oxygen

Combinatorial geometry domain decomposition strategies for Monte Carlo simulations

Energy Technology Data Exchange (ETDEWEB)

Li, G.; Zhang, B.; Deng, L.; Mo, Z.; Liu, Z.; Shangguan, D.; Ma, Y.; Li, S.; Hu, Z. [Institute of Applied Physics and Computational Mathematics, Beijing, 100094 (China)

2013-07-01

Analysis and modeling of nuclear reactors can lead to memory overload for a single core processor when it comes to refined modeling. A method to solve this problem is called 'domain decomposition'. In the current work, domain decomposition algorithms for a combinatorial geometry Monte Carlo transport code are developed on the JCOGIN (J Combinatorial Geometry Monte Carlo transport INfrastructure). Tree-based decomposition and asynchronous communication of particle information between domains are described in the paper. Combination of domain decomposition and domain replication (particle parallelism) is demonstrated and compared with that of MERCURY code. A full-core reactor model is simulated to verify the domain decomposition algorithms using the Monte Carlo particle transport code JMCT (J Monte Carlo Transport Code), which has being developed on the JCOGIN infrastructure. Besides, influences of the domain decomposition algorithms to tally variances are discussed. (authors)

Combinatorial geometry domain decomposition strategies for Monte Carlo simulations

International Nuclear Information System (INIS)

Li, G.; Zhang, B.; Deng, L.; Mo, Z.; Liu, Z.; Shangguan, D.; Ma, Y.; Li, S.; Hu, Z.

2013-01-01

Analysis and modeling of nuclear reactors can lead to memory overload for a single core processor when it comes to refined modeling. A method to solve this problem is called 'domain decomposition'. In the current work, domain decomposition algorithms for a combinatorial geometry Monte Carlo transport code are developed on the JCOGIN (J Combinatorial Geometry Monte Carlo transport INfrastructure). Tree-based decomposition and asynchronous communication of particle information between domains are described in the paper. Combination of domain decomposition and domain replication (particle parallelism) is demonstrated and compared with that of MERCURY code. A full-core reactor model is simulated to verify the domain decomposition algorithms using the Monte Carlo particle transport code JMCT (J Monte Carlo Transport Code), which has being developed on the JCOGIN infrastructure. Besides, influences of the domain decomposition algorithms to tally variances are discussed. (authors)

Graphical-based construction of combinatorial geometries for radiation transport and shielding applications

International Nuclear Information System (INIS)

Burns, T.J.

1992-01-01

A graphical-based code system is being developed at ORNL to manipulate combinatorial geometries for radiation transport and shielding applications. The current version (basically a combinatorial geometry debugger) consists of two parts: a FORTRAN-based ''view'' generator and a Microsoft Windows application for displaying the geometry. Options and features of both modules are discussed. Examples illustrating the various options available are presented. The potential for utilizing the images produced using the debugger as a visualization tool for the output of the radiation transport codes is discussed as is the future direction of the development

Solutions manual to accompany Combinatorial reasoning an introduction to the art of counting

CERN Document Server

DeTemple, Duane

2014-01-01

This is a solutions manual to accompany Combinatorial Reasoning: An Introduction to the Art of CountingWritten by well-known scholars in the field, Combinatorial Reasoning: An Introduction to the Art of Counting introduces combinatorics alongside modern techniques, showcases the interdisciplinary aspects of the topic, and illustrates how to problem solve with a multitude of exercises throughout. The authors'' approach is very reader-friendly and avoids the ""scholarly tone"" found in many books on this topic.  

MicroRNA Transfer Between Bone Marrow Adipose and Multiple Myeloma Cells.

Science.gov (United States)

Soley, Luna; Falank, Carolyne; Reagan, Michaela R

2017-06-01

Multiple myeloma remains an incurable disease, largely due to the tumor-supportive role of the bone marrow microenvironment. Bone marrow adipose tissue (BMAT) is one component of the fertile microenvironment which is believed to contribute to myeloma progression and drug resistance, as well as participate in a vicious cycle of osteolysis and tumor growth. MicroRNAs (miRNAs) have recently emerged as instrumental regulators of cellular processes that enable the development and dissemination of cancer. This review highlights the intersection between two emerging research fields and pursues the scientific and clinical implications of miRNA transfer between BMAT and myeloma cells. This review provides a concise and provocative summary of the evidence to support exosome-mediated transfer of tumor-supportive miRNAs. The work may prompt researchers to better elucidate the mechanisms by which this novel means of genetic communication between tumor cells and their environment could someday yield targeted therapeutics.

Olefin Metathesis in Peptidomimetics, Dynamic Combinatorial Chemistry, and Molecular Imprinting

National Research Council Canada - National Science Library

Low, Tammy K

2006-01-01

.... Our research goals consisted of employing olefin metathesis in the synthesis of peptidomimetics, and studying the feasibility of this method in dynamic combinatorial chemistry and molecular imprinting of nerve agents...

CUNY Graduate Center Workshops on Combinatorial and Additive Number Theory

CERN Document Server

2017-01-01

Based on talks from the 2015 and 2016 Combinatorial and Additive Number Theory (CANT) workshops at the City University of New York, these proceedings offer 19 peer-reviewed and edited papers on current topics in number theory. Held every year since 2003, the workshop series surveys state-of-the-art open problems in combinatorial and additive number theory and related parts of mathematics. Sumsets, partitions, convex polytopes and discrete geometry, Ramsey theory, primality testing, and cryptography are among the topics featured in this volume. Each contribution is dedicated to a specific topic that reflects the latest results by experts in the field. Researchers and graduate students interested in the current progress in number theory will find this selection of articles relevant and compelling. .

Sentence processing in an artificial language: Learning and using combinatorial constraints.

Science.gov (United States)

Amato, Michael S; MacDonald, Maryellen C

2010-07-01

A study combining artificial grammar and sentence comprehension methods investigated the learning and online use of probabilistic, nonadjacent combinatorial constraints. Participants learned a small artificial language describing cartoon monsters acting on objects. Self-paced reading of sentences in the artificial language revealed comprehenders' sensitivity to nonadjacent combinatorial constraints, without explicit awareness of the probabilities embedded in the language. These results show that even newly-learned constraints have an identifiable effect on online sentence processing. The rapidity of learning in this paradigm relative to others has implications for theories of implicit learning and its role in language acquisition. 2010 Elsevier B.V. All rights reserved.

Combinatorial Testing for VDM

DEFF Research Database (Denmark)

Larsen, Peter Gorm; Lausdahl, Kenneth; Battle, Nick

2010-01-01

by forgotten preconditions as well as broken invariants and post-conditions. Trace definitions are defined as regular expressions describing possible sequences of operation calls, and are conceptually similar to UML sequence diagrams. In this paper we present a tool enabling test automation based on VDM traces......Abstract—Combinatorial testing in VDM involves the automatic generation and execution of a large collection of test cases derived from templates provided in the form of trace definitions added to a VDM specification. The main value of this is the rapid detection of run-time errors caused......, and explain how it is possible to reduce large collections of test cases in different ways. Its use is illustrated with a small case study....

Scaffold architecture and pharmacophoric properties of natural products and trade drugs: application in the design of natural product-based combinatorial libraries.

Science.gov (United States)

Lee, M L; Schneider, G

2001-01-01

Natural products were analyzed to determine whether they contain appealing novel scaffold architectures for potential use in combinatorial chemistry. Ring systems were extracted and clustered on the basis of structural similarity. Several such potential scaffolds for combinatorial chemistry were identified that are not present in current trade drugs. For one of these scaffolds a virtual combinatorial library was generated. Pharmacophoric properties of natural products, trade drugs, and the virtual combinatorial library were assessed using a self-organizing map. Obviously, current trade drugs and natural products have several topological pharmacophore patterns in common. These features can be systematically explored with selected combinatorial libraries based on a combination of natural product-derived and synthetic molecular building blocks.

Using multiple schedules during functional communication training to promote rapid transfer of treatment effects.

Science.gov (United States)

Fisher, Wayne W; Greer, Brian D; Fuhrman, Ashley M; Querim, Angie C

2015-12-01

Multiple schedules with signaled periods of reinforcement and extinction have been used to thin reinforcement schedules during functional communication training (FCT) to make the intervention more practical for parents and teachers. We evaluated whether these signals would also facilitate rapid transfer of treatment effects across settings and therapists. With 2 children, we conducted FCT in the context of mixed (baseline) and multiple (treatment) schedules introduced across settings or therapists using a multiple baseline design. Results indicated that when the multiple schedules were introduced, the functional communication response came under rapid discriminative control, and problem behavior remained at near-zero rates. We extended these findings with another individual by using a more traditional baseline in which problem behavior produced reinforcement. Results replicated those of the previous participants and showed rapid reductions in problem behavior when multiple schedules were implemented across settings. © Society for the Experimental Analysis of Behavior.

Multiple nucleon transfer in damped nuclear collisions. [Lectures, mass charge, and linear and angular momentum transport

Energy Technology Data Exchange (ETDEWEB)

Randrup, J.

1979-07-01

This lecture discusses a theory for the transport of mass, charge, linear, and angular momentum and energy in damped nuclear collisions, as induced by multiple transfer of individual nucleons. 11 references.

Multiple scattering effects with cyclical terms in active remote sensing of vegetated surface using vector radiative transfer theory

Science.gov (United States)

The energy transport in a vegetated (corn) surface layer is examined by solving the vector radiative transfer equation using a numerical iterative approach. This approach allows a higher order that includes the multiple scattering effects. Multiple scattering effects are important when the optical t...

Development of tight-binding, chemical-reaction-dynamics simulator for combinatorial computational chemistry

International Nuclear Information System (INIS)

Kubo, Momoji; Ando, Minako; Sakahara, Satoshi; Jung, Changho; Seki, Kotaro; Kusagaya, Tomonori; Endou, Akira; Takami, Seiichi; Imamura, Akira; Miyamoto, Akira

2004-01-01

Recently, we have proposed a new concept called 'combinatorial computational chemistry' to realize a theoretical, high-throughput screening of catalysts and materials. We have already applied our combinatorial, computational-chemistry approach, mainly based on static first-principles calculations, to various catalysts and materials systems and its applicability to the catalysts and materials design was strongly confirmed. In order to realize more effective and efficient combinatorial, computational-chemistry screening, a high-speed, chemical-reaction-dynamics simulator based on quantum-chemical, molecular-dynamics method is essential. However, to the best of our knowledge, there is no chemical-reaction-dynamics simulator, which has an enough high-speed ability to perform a high-throughput screening. In the present study, we have succeeded in the development of a chemical-reaction-dynamics simulator based on our original, tight-binding, quantum-chemical, molecular-dynamics method, which is more than 5000 times faster than the regular first-principles, molecular-dynamics method. Moreover, its applicability and effectiveness to the atomistic clarification of the methanol-synthesis dynamics at reaction temperature were demonstrated

In vitro transfer of multiple resistance observed in vivo during a Salmonella london epidemic.

Science.gov (United States)

Lantos, J; Marjai, E

1980-01-01

Between 1976 and 1978, waves of Salmonella london infections conveyed by raw meat and meat products were observed. The strains isolated during the epidemic were first susceptible then developed multiple antibiotic resistance. The identical antibiotic resistance patterns of the strain and their more frequent occurrence in hospital environments indicated plasmid-mediated resistance. R-plasmid transfer, minimum inhibition concentration and resistance elimination were studied in representative strains. The resistant S. london strain and transconjugants of Escherichia coli rendered resistant were compared. The results proved that multiple resistance was plasmid-mediated.

High-throughput flow injection analysis mass spectroscopy with networked delivery of color-rendered results. 2. Three-dimensional spectral mapping of 96-well combinatorial chemistry racks.

Science.gov (United States)

Görlach, E; Richmond, R; Lewis, I

1998-08-01

For the last two years, the mass spectroscopy section of the Novartis Pharma Research Core Technology group has analyzed tens of thousands of multiple parallel synthesis samples from the Novartis Pharma Combinatorial Chemistry program, using an in-house developed automated high-throughput flow injection analysis electrospray ionization mass spectroscopy system. The electrospray spectra of these samples reflect the many structures present after the cleavage step from the solid support. The overall success of the sequential synthesis is mirrored in the purity of the expected end product, but the partial success of individual synthesis steps is evident in the impurities in the mass spectrum. However this latter reaction information, which is of considerable utility to the combinatorial chemist, is effectively hidden from view by the very large number of analyzed samples. This information is now revealed at the workbench of the combinatorial chemist by a novel three-dimensional display of each rack's complete mass spectral ion current using the in-house RackViewer Visual Basic application. Colorization of "forbidden loss" and "forbidden gas-adduct" zones, normalization to expected monoisotopic molecular weight, colorization of ionization intensity, and sorting by row or column were used in combination to highlight systematic patterns in the mass spectroscopy data.

Distributing the computation in combinatorial optimization experiments over the cloud

Directory of Open Access Journals (Sweden)

Mario Brcic

2017-12-01

Full Text Available Combinatorial optimization is an area of great importance since many of the real-world problems have discrete parameters which are part of the objective function to be optimized. Development of combinatorial optimization algorithms is guided by the empirical study of the candidate ideas and their performance over a wide range of settings or scenarios to infer general conclusions. Number of scenarios can be overwhelming, especially when modeling uncertainty in some of the problem’s parameters. Since the process is also iterative and many ideas and hypotheses may be tested, execution time of each experiment has an important role in the efficiency and successfulness. Structure of such experiments allows for significant execution time improvement by distributing the computation. We focus on the cloud computing as a cost-efficient solution in these circumstances. In this paper we present a system for validating and comparing stochastic combinatorial optimization algorithms. The system also deals with selection of the optimal settings for computational nodes and number of nodes in terms of performance-cost tradeoff. We present applications of the system on a new class of project scheduling problem. We show that we can optimize the selection over cloud service providers as one of the settings and, according to the model, it resulted in a substantial cost-savings while meeting the deadline.

Some Combinatorial Interpretations and Applications of Fuss-Catalan Numbers

OpenAIRE

Lin, Chin-Hung

2011-01-01

Fuss-Catalan number is a family of generalized Catalan numbers. We begin by two definitions of Fuss-Catalan numbers and some basic properties. And we give some combinatorial interpretations different from original Catalan numbers. Finally we generalize the Jonah's theorem as its applications.

Construction of a virtual combinatorial library using SMILES strings to discover potential structure-diverse PPAR modulators.

Science.gov (United States)

Liao, Chenzhong; Liu, Bing; Shi, Leming; Zhou, Jiaju; Lu, Xian-Ping

2005-07-01

Based on the structural characters of PPAR modulators, a virtual combinatorial library containing 1226,625 compounds was constructed using SMILES strings. Selected ADME filters were employed to compel compounds having poor drug-like properties from this library. This library was converted to sdf and mol2 files by CONCORD 4.0, and was then docked to PPARgamma by DOCK 4.0 to identify new chemical entities that may be potential drug leads against type 2 diabetes and other metabolic diseases. The method to construct virtual combinatorial library using SMILES strings was further visualized by Visual Basic.net that can facilitate the needs of generating other type virtual combinatorial libraries.

Enabling techniques in the search for new antibiotics: Combinatorial biosynthesis of sugar-containing antibiotics.

Science.gov (United States)

Park, Je Won; Nam, Sang-Jip; Yoon, Yeo Joon

2017-06-15

Nature has a talent for inventing a vast number of natural products, including hybrids generated by blending different scaffolds, resulting in a myriad of bioactive chemical entities. Herein, we review the highlights and recent trends (2010-2016) in the combinatorial biosynthesis of sugar-containing antibiotics where nature's structural diversification capabilities are exploited to enable the creation of new anti-infective and anti-proliferative drugs. In this review, we describe the modern combinatorial biosynthetic approaches for polyketide synthase-derived complex and aromatic polyketides, non-ribosomal peptide synthetase-directed lipo-/glycopeptides, aminoglycosides, nucleoside antibiotics, and alkaloids, along with their therapeutic potential. Finally, we present the feasible nexus between combinatorial biosynthesis, systems biology, and synthetic biology as a toolbox to provide new antibiotics that will be indispensable in the post-antibiotic era. Copyright © 2016 Elsevier Inc. All rights reserved.

An Atlas of Combinatorial Transcriptional Regulation in Mouse and Man

KAUST Repository

Ravasi, Timothy; Suzuki, Harukazu; Cannistraci, Carlo; Katayama, Shintaro; Bajic, Vladimir B.; Tan, Kai; Akalin, Altuna; Schmeier, Sebastian; Kanamori-Katayama, Mutsumi; Bertin, Nicolas; Carninci, Piero; Daub, Carsten O.; Forrest, Alistair R.R.; Gough, Julian; Grimmond, Sean; Han, Jung-Hoon; Hashimoto, Takehiro; Hide, Winston; Hofmann, Oliver; Kamburov, Atanas; Kaur, Mandeep; Kawaji, Hideya; Kubosaki, Atsutaka; Lassmann, Timo; van Nimwegen, Erik; MacPherson, Cameron Ross; Ogawa, Chihiro; Radovanovic, Aleksandar; Schwartz, Ariel; Teasdale, Rohan D.; Tegné r, Jesper; Lenhard, Boris; Teichmann, Sarah A.; Arakawa, Takahiro; Ninomiya, Noriko; Murakami, Kayoko; Tagami, Michihira; Fukuda, Shiro; Imamura, Kengo; Kai, Chikatoshi; Ishihara, Ryoko; Kitazume, Yayoi; Kawai, Jun; Hume, David A.; Ideker, Trey; Hayashizaki, Yoshihide

2010-01-01

Combinatorial interactions among transcription factors are critical to directing tissue-specific gene expression. To build a global atlas of these combinations, we have screened for physical interactions among the majority of human and mouse DNA-binding transcription factors (TFs). The complete networks contain 762 human and 877 mouse interactions. Analysis of the networks reveals that highly connected TFs are broadly expressed across tissues, and that roughly half of the measured interactions are conserved between mouse and human. The data highlight the importance of TF combinations for determining cell fate, and they lead to the identification of a SMAD3/FLI1 complex expressed during development of immunity. The availability of large TF combinatorial networks in both human and mouse will provide many opportunities to study gene regulation, tissue differentiation, and mammalian evolution.

An Atlas of Combinatorial Transcriptional Regulation in Mouse and Man

KAUST Repository

Ravasi, Timothy

2010-03-01

Combinatorial interactions among transcription factors are critical to directing tissue-specific gene expression. To build a global atlas of these combinations, we have screened for physical interactions among the majority of human and mouse DNA-binding transcription factors (TFs). The complete networks contain 762 human and 877 mouse interactions. Analysis of the networks reveals that highly connected TFs are broadly expressed across tissues, and that roughly half of the measured interactions are conserved between mouse and human. The data highlight the importance of TF combinations for determining cell fate, and they lead to the identification of a SMAD3/FLI1 complex expressed during development of immunity. The availability of large TF combinatorial networks in both human and mouse will provide many opportunities to study gene regulation, tissue differentiation, and mammalian evolution.

Skeletal Diversity in Combinatorial Fashion: A New Format for the Castagnoli-Cushman Reaction.

Science.gov (United States)

Lepikhina, Anastasia; Dar'in, Dmitry; Bakulina, Olga; Chupakhin, Evgeny; Krasavin, Mikhail

2017-11-13

A new format for the Castagnoli-Cushman reaction of structurally diverse dicarboxylic acids, amines, and aldehydes in the presence of acetic anhydride as dehydrating agent is described. The reaction is distinctly amenable to parallel format: the combinatorial array of 180 reactions delivered 157 products of >85% purity without chromatographic purification (of this number, 143 compounds had >94% purity). The new method offers a convenient preparation of the skeletally and peripherally diverse, lead- and druglike γ- and δ-lactam carboxylic acids with high diastereoselectivity in combinatorial fashion.

Phase Transitions in Combinatorial Optimization Problems: Basics, Algorithms and Statistical Mechanics

Science.gov (United States)

Hartmann, Alexander K.; Weigt, Martin

2005-10-01

A concise, comprehensive introduction to the topic of statistical physics of combinatorial optimization, bringing together theoretical concepts and algorithms from computer science with analytical methods from physics. The result bridges the gap between statistical physics and combinatorial optimization, investigating problems taken from theoretical computing, such as the vertex-cover problem, with the concepts and methods of theoretical physics. The authors cover rapid developments and analytical methods that are both extremely complex and spread by word-of-mouth, providing all the necessary basics in required detail. Throughout, the algorithms are shown with examples and calculations, while the proofs are given in a way suitable for graduate students, post-docs, and researchers. Ideal for newcomers to this young, multidisciplinary field.

Development of automatic combinatorial system for synthesis of nanoparticles using microreactors

Energy Technology Data Exchange (ETDEWEB)

Watanabe, Kosuke; Maeda, Hideaki [Interdisciplinary Graduate School of Engineering Sciences, Kyushu University, 6-1 Kasuga-koen, Kasuga, Fukuoka, 816-8580 (Japan); Orimoto, Yuuichi; Yamashita, Kenichi; Uehara, Masato; Nakamura, Hiroyuki [Measurement Solution Research Center, National Institute of Advanced Industrial Science and Technology (AIST), 807-1, Shuku, Tosu, Saga, 841-0052 (Japan); Furuya, Takeshi, E-mail: maeda-h@aist.go.jp [Nanosystem Research Institute, National Institute of Advanced Industrial Science and Technology (AIST), Tsukuba, Ibaraki, 305-8565 (Japan)

2011-10-29

In this study, automatic system for combinatorial synthesis of nanoparticles (NPs) was developed and optimization of reaction parameter for NPs synthesis was performed. Microreactor was employed for kinetic control constantly. Programmable equipments were employed for additional speed up and used a microreactor. Six reaction condition parameters were systematically combined to produce CdSe synthesis condition sets. Reaction conditions of 3404 experimental sets were synthesized and characterized in 1 month. As a result of some multivariate analyses using the numerous and complicated data, we found as follows: 1) neural network is an effective method to analyze data from combinatorial synthesis, 2) weighting evaluation method was effective to find the condition for balanced NP properties.

Combinatorial algorithms enabling computational science: tales from the front

International Nuclear Information System (INIS)

Bhowmick, Sanjukta; Boman, Erik G; Devine, Karen; Gebremedhin, Assefaw; Hendrickson, Bruce; Hovland, Paul; Munson, Todd; Pothen, Alex

2006-01-01

Combinatorial algorithms have long played a crucial enabling role in scientific and engineering computations. The importance of discrete algorithms continues to grow with the demands of new applications and advanced architectures. This paper surveys some recent developments in this rapidly changing and highly interdisciplinary field

Combinatorial algorithms enabling computational science: tales from the front

Energy Technology Data Exchange (ETDEWEB)

Bhowmick, Sanjukta [Mathematics and Computer Science Division, Argonne National Laboratory (United States); Boman, Erik G [Discrete Algorithms and Math Department, Sandia National Laboratories (United States); Devine, Karen [Discrete Algorithms and Math Department, Sandia National Laboratories (United States); Gebremedhin, Assefaw [Computer Science Department, Old Dominion University (United States); Hendrickson, Bruce [Discrete Algorithms and Math Department, Sandia National Laboratories (United States); Hovland, Paul [Mathematics and Computer Science Division, Argonne National Laboratory (United States); Munson, Todd [Mathematics and Computer Science Division, Argonne National Laboratory (United States); Pothen, Alex [Computer Science Department, Old Dominion University (United States)

2006-09-15

Combinatorial algorithms have long played a crucial enabling role in scientific and engineering computations. The importance of discrete algorithms continues to grow with the demands of new applications and advanced architectures. This paper surveys some recent developments in this rapidly changing and highly interdisciplinary field.

Dynamic combinatorial libraries based on hydrogen-bonde molecular boxes

NARCIS (Netherlands)

Kerckhoffs, J.M.C.A.; Mateos timoneda, Miguel; Reinhoudt, David; Crego Calama, Mercedes

2007-01-01

This article describes two different types of dynamic combinatorial libraries of host and guest molecules. The first part of this article describes the encapsulation of alizarin trimer 2 a3 by dynamic mixtures of up to twenty different self-assembled molecular receptors together with the

Development of Combinatorial Methods for Alloy Design and Optimization

International Nuclear Information System (INIS)

Pharr, George M.; George, Easo P.; Santella, Michael L

2005-01-01

The primary goal of this research was to develop a comprehensive methodology for designing and optimizing metallic alloys by combinatorial principles. Because conventional techniques for alloy preparation are unavoidably restrictive in the range of alloy composition that can be examined, combinatorial methods promise to significantly reduce the time, energy, and expense needed for alloy design. Combinatorial methods can be developed not only to optimize existing alloys, but to explore and develop new ones as well. The scientific approach involved fabricating an alloy specimen with a continuous distribution of binary and ternary alloy compositions across its surface--an ''alloy library''--and then using spatially resolved probing techniques to characterize its structure, composition, and relevant properties. The three specific objectives of the project were: (1) to devise means by which simple test specimens with a library of alloy compositions spanning the range interest can be produced; (2) to assess how well the properties of the combinatorial specimen reproduce those of the conventionally processed alloys; and (3) to devise screening tools which can be used to rapidly assess the important properties of the alloys. As proof of principle, the methodology was applied to the Fe-Ni-Cr ternary alloy system that constitutes many commercially important materials such as stainless steels and the H-series and C-series heat and corrosion resistant casting alloys. Three different techniques were developed for making alloy libraries: (1) vapor deposition of discrete thin films on an appropriate substrate and then alloying them together by solid-state diffusion; (2) co-deposition of the alloying elements from three separate magnetron sputtering sources onto an inert substrate; and (3) localized melting of thin films with a focused electron-beam welding system. Each of the techniques was found to have its own advantages and disadvantages. A new and very powerful technique for

The effects of video-game training on broad cognitive transfer in multiple sclerosis: A pilot randomized controlled trial.

Science.gov (United States)

Janssen, Alisha; Boster, Aaron; Lee, HyunKyu; Patterson, Beth; Prakash, Ruchika Shaurya

2015-01-01

Multiple sclerosis (MS) is a neurodegenerative disease of the central nervous system that results in diffuse nerve damage and associated physical and cognitive impairments. Of the few comprehensive rehabilitation options that exist for populations with lower baseline cognitive functioning, those that have been successful at eliciting broad cognitive improvements have focused on a multimodal training approach, emphasizing complex cognitive processing that utilizes multiple domains simultaneously. The current study sought to determine the feasibility of an 8-week, hybrid-variable priority training (HVT) program, with a secondary aim to assess the success of this training paradigm at eliciting broad cognitive transfer effects. Capitalizing on the multimodal training modalities offered by the Space Fortress platform, we compared the HVT strategy-based intervention with a waitlist control group, to primarily assess skill acquisition and secondarily determine presence of cognitive transfer. Twenty-eight participants met inclusionary criteria for the study and were randomized to either training or waitlist control groups. To assess broad transfer effects, a battery of neuropsychological tests was administered pre- and post-intervention. The results indicated an overall improvement in skill acquisition and evidence for the feasibility of the intervention, but a lack of broad transfer to tasks of cognitive functioning. Participants in the training group, however, did show improvements on a measure of spatial short-term memory. The current investigation provided support for the feasibility of a multimodal training approach, using the HVT strategy, within the MS population, but lacked broad transfer to multiple domains of cognitive functioning. Future improvements to obtain greater cognitive transfer efficacy would include a larger sample size, a longer course of training to evoke greater game score improvement, the inclusion of only cognitively impaired individuals, and

High-efficiency combinatorial approach as an effective tool for accelerating metallic biomaterials research and discovery

Energy Technology Data Exchange (ETDEWEB)

Zhang, X.D. [School of Material Science and Engineering, Central South University, Changsha, Hunan, 410083 (China); Liu, L.B., E-mail: lbliu.csu@gmail.com [School of Material Science and Engineering, Central South University, Changsha, Hunan, 410083 (China); State Key Laboratory for Powder Metallurgy, Changsha, Hunan, 410083 (China); Zhao, J.-C. [State Key Laboratory for Powder Metallurgy, Changsha, Hunan, 410083 (China); Department of Materials Science and Engineering, The Ohio State University, 2041 College Road, Columbus, OH 43210 (United States); Wang, J.L.; Zheng, F.; Jin, Z.P. [School of Material Science and Engineering, Central South University, Changsha, Hunan, 410083 (China)

2014-06-01

A high-efficiency combinatorial approach has been applied to rapidly build the database of composition-dependent elastic modulus and hardness of the Ti–Ta and Ti–Zr–Ta systems. A diffusion multiple of the Ti–Zr–Ta system was manufactured, then annealed at 1173 K for 1800 h, and water quenched to room temperature. Extensive interdiffusion among Ti, Zr and Ta has taken place. Combining nanoindentation and electron probe micro-analysis (EPMA), the elastic modulus, hardness as well as composition across the diffusion multiple were determined. The composition/elastic modulus/hardness relationship of the Ti–Ta and Ti–Zr–Ta alloys has been obtained. It was found that the elastic modulus and hardness depend strongly on the Ta and Zr content. The result can be used to accelerate the discovery/development of bio-titanium alloys for different components in implant prosthesis. - Highlights: • High-efficiency diffusion multiple of Ti–Zr–Ta was manufactured. • Composition-dependent elastic modulus and hardness of the Ti–Ta and Ti–Zr–Ta systems have been obtained effectively, • The methodology and the information can be used to accelerate the discovery/development of bio-titanium alloys.

Quantum resonance for simulating combinatorial problems

International Nuclear Information System (INIS)

Zak, Michail; Fijany, Amir

2005-01-01

Quantum computing by simulations is based upon similarity between mathematical formalism of a quantum phenomenon and phenomena to be analyzed. In this Letter, the mathematical formalism of quantum resonance combined with tensor product decomposability of unitary evolutions is mapped onto a class of NP-complete combinatorial problems. It has been demonstrated that nature has polynomial resources for solving NP-complete problems and that will help to develop a new strategy for artificial intelligence, as well as to re-evaluate the role of natural selection in biological evolution

Automatic generation of combinatorial test data

CERN Document Server

Zhang, Jian; Ma, Feifei

2014-01-01

This book reviews the state-of-the-art in combinatorial testing, with particular emphasis on the automatic generation of test data. It describes the most commonly used approaches in this area - including algebraic construction, greedy methods, evolutionary computation, constraint solving and optimization - and explains major algorithms with examples. In addition, the book lists a number of test generation tools, as well as benchmarks and applications. Addressing a multidisciplinary topic, it will be of particular interest to researchers and professionals in the areas of software testing, combi

A combinatorial approach to diffeomorphism invariant quantum gauge theories

International Nuclear Information System (INIS)

Zapata, J.A.

1997-01-01

Quantum gauge theory in the connection representation uses functions of holonomies as configuration observables. Physical observables (gauge and diffeomorphism invariant) are represented in the Hilbert space of physical states; physical states are gauge and diffeomorphism invariant distributions on the space of functions of the holonomies of the edges of a certain family of graphs. Then a family of graphs embedded in the space manifold (satisfying certain properties) induces a representation of the algebra of physical observables. We construct a quantum model from the set of piecewise linear graphs on a piecewise linear manifold, and another manifestly combinatorial model from graphs defined on a sequence of increasingly refined simplicial complexes. Even though the two models are different at the kinematical level, they provide unitarily equivalent representations of the algebra of physical observables in separable Hilbert spaces of physical states (their s-knot basis is countable). Hence, the combinatorial framework is compatible with the usual interpretation of quantum field theory. copyright 1997 American Institute of Physics

Directed combinatorial mutagenesis of Escherichia coli for complex phenotype engineering

Energy Technology Data Exchange (ETDEWEB)

Liu, Rongming; Liang, Liya; Garst, Andrew D.; Choudhury, Alaksh; Nogué, Violeta Sànchez i.; Beckham, Gregg T.; Gill, Ryan T.

2018-05-01

Strain engineering for industrial production requires a targeted improvement of multiple complex traits, which range from pathway flux to tolerance to mixed sugar utilization. Here, we report the use of an iterative CRISPR EnAbled Trackable genome Engineering (iCREATE) method to engineer rapid glucose and xylose co-consumption and tolerance to hydrolysate inhibitors in E. coli. Deep mutagenesis libraries were rationally designed, constructed, and screened to target ~40,000 mutations across 30 genes. These libraries included global and high-level regulators that regulate global gene expression, transcription factors that play important roles in genome-level transcription, enzymes that function in the sugar transport system, NAD(P)H metabolism, and the aldehyde reduction system. Specific mutants that conferred increased growth in mixed sugars and hydrolysate tolerance conditions were isolated, confirmed, and evaluated for changes in genome-wide expression levels. We tested the strain with positive combinatorial mutations for 3-hydroxypropionic acid (3HP) production under high furfural and high acetate hydrolysate fermentation, which demonstrated a 7- and 8-fold increase in 3HP productivity relative to the parent strain, respectively.

Novel drug metabolism indices for pharmacogenetic functional status based on combinatory genotyping of CYP2C9, CYP2C19 and CYP2D6 genes

Science.gov (United States)

Villagra, David; Goethe, John; Schwartz, Harold I; Szarek, Bonnie; Kocherla, Mohan; Gorowski, Krystyna; Windemuth, Andreas; Ruaño, Gualberto

2011-01-01

Aims We aim to demonstrate clinical relevance and utility of four novel drug-metabolism indices derived from a combinatory (multigene) approach to CYP2C9, CYP2C19 and CYP2D6 allele scoring. Each index considers all three genes as complementary components of a liver enzyme drug metabolism system and uniquely benchmarks innate hepatic drug metabolism reserve or alteration through CYP450 combinatory genotype scores. Methods A total of 1199 psychiatric referrals were genotyped for polymorphisms in the CYP2C9, CYP2C19 and CYP2D6 gene loci and were scored on each of the four indices. The data were used to create distributions and rankings of innate drug metabolism capacity to which individuals can be compared. Drug-specific indices are a combination of the drug metabolism indices with substrate-specific coefficients. Results The combinatory drug metabolism indices proved useful in positioning individuals relative to a population with regard to innate drug metabolism capacity prior to pharmacotherapy. Drug-specific indices generate pharmacogenetic guidance of immediate clinical relevance, and can be further modified to incorporate covariates in particular clinical cases. Conclusions We believe that this combinatory approach represents an improvement over the current gene-by-gene reporting by providing greater scope while still allowing for the resolution of a single-gene index when needed. This method will result in novel clinical and research applications, facilitating the translation from pharmacogenomics to personalized medicine, particularly in psychiatry where many drugs are metabolized or activated by multiple CYP450 isoenzymes. PMID:21861665

Gas-Foamed Scaffold Gradients for Combinatorial Screening in 3D

Directory of Open Access Journals (Sweden)

Joachim Kohn

2012-03-01

Full Text Available Current methods for screening cell-material interactions typically utilize a two-dimensional (2D culture format where cells are cultured on flat surfaces. However, there is a need for combinatorial and high-throughput screening methods to systematically screen cell-biomaterial interactions in three-dimensional (3D tissue scaffolds for tissue engineering. Previously, we developed a two-syringe pump approach for making 3D scaffold gradients for use in combinatorial screening of salt-leached scaffolds. Herein, we demonstrate that the two-syringe pump approach can also be used to create scaffold gradients using a gas-foaming approach. Macroporous foams prepared by a gas-foaming technique are commonly used for fabrication of tissue engineering scaffolds due to their high interconnectivity and good mechanical properties. Gas-foamed scaffold gradient libraries were fabricated from two biodegradable tyrosine-derived polycarbonates: poly(desaminotyrosyl-tyrosine ethyl ester carbonate (pDTEc and poly(desaminotyrosyl-tyrosine octyl ester carbonate (pDTOc. The composition of the libraries was assessed with Fourier transform infrared spectroscopy (FTIR and showed that pDTEc/pDTOc gas-foamed scaffold gradients could be repeatably fabricated. Scanning electron microscopy showed that scaffold morphology was similar between the pDTEc-rich ends and the pDTOc-rich ends of the gradient. These results introduce a method for fabricating gas-foamed polymer scaffold gradients that can be used for combinatorial screening of cell-material interactions in 3D.

Combinatorial nuclear level-density model

International Nuclear Information System (INIS)

Uhrenholt, H.; Åberg, S.; Dobrowolski, A.; Døssing, Th.; Ichikawa, T.; Möller, P.

2013-01-01

A microscopic nuclear level-density model is presented. The model is a completely combinatorial (micro-canonical) model based on the folded-Yukawa single-particle potential and includes explicit treatment of pairing, rotational and vibrational states. The microscopic character of all states enables extraction of level-distribution functions with respect to pairing gaps, parity and angular momentum. The results of the model are compared to available experimental data: level spacings at neutron separation energy, data on total level-density functions from the Oslo method, cumulative level densities from low-lying discrete states, and data on parity ratios. Spherical and deformed nuclei follow basically different coupling schemes, and we focus on deformed nuclei

Nonelectrophoretic bidirectional transfer of a single SDS-PAGE gel with multiple antigens to obtain 12 immunoblots.

Science.gov (United States)

Kurien, Biji T; Scofield, R Hal

2009-01-01

Protein blotting is an invaluable technique in immunology to detect and characterize proteins of low abundance. Proteins resolved on sodium dodecyl sulfate (SDS) polyacrylamide gels are normally transferred electrophoretically to adsorbent membranes such as nitrocellulose or polyvinylidene diflouride membranes. Here, we describe the nonelectrophroretic transfer of the Ro 60 (or SSA) autoantigen, 220- and 240-kD spectrin antigens, and prestained molecular weight standards from SDS polyacrylamide gels to obtain up to 12 immunoblots from a single gel and multiple sera.

Individualized Pixel Synthesis and Characterization of Combinatorial Materials Chips

Directory of Open Access Journals (Sweden)

Xiao-Dong Xiang

2015-06-01

Full Text Available Conventionally, an experimentally determined phase diagram requires studies of phase formation at a range of temperatures for each composition, which takes years of effort from multiple research groups. Combinatorial materials chip technology, featuring high-throughput synthesis and characterization, is able to determine the phase diagram of an entire composition spread of a binary or ternary system at a single temperature on one materials library, which, though significantly increasing efficiency, still requires many libraries processed at a series of temperatures in order to complete a phase diagram. In this paper, we propose a “one-chip method” to construct a complete phase diagram by individually synthesizing each pixel step by step with a progressive pulse of energy to heat at different temperatures while monitoring the phase evolution on the pixel in situ in real time. Repeating this process pixel by pixel throughout the whole chip allows the entire binary or ternary phase diagram to be mapped on one chip in a single experiment. The feasibility of this methodology is demonstrated in a study of a Ge-Sb-Te ternary alloy system, on which the amorphous-crystalline phase boundary is determined.

Combinatorial optimization games

Energy Technology Data Exchange (ETDEWEB)

Deng, X. [York Univ., North York, Ontario (Canada); Ibaraki, Toshihide; Nagamochi, Hiroshi [Kyoto Univ. (Japan)

1997-06-01

We introduce a general integer programming formulation for a class of combinatorial optimization games, which immediately allows us to improve the algorithmic result for finding amputations in the core (an important solution concept in cooperative game theory) of the network flow game on simple networks by Kalai and Zemel. An interesting result is a general theorem that the core for this class of games is nonempty if and only if a related linear program has an integer optimal solution. We study the properties for this mathematical condition to hold for several interesting problems, and apply them to resolve algorithmic and complexity issues for their cores along the line as put forward in: decide whether the core is empty; if the core is empty, find an imputation in the core; given an imputation x, test whether x is in the core. We also explore the properties of totally balanced games in this succinct formulation of cooperative games.

Combinatorial effects of arginine and fluoride on oral bacteria.

Science.gov (United States)

Zheng, X; Cheng, X; Wang, L; Qiu, W; Wang, S; Zhou, Y; Li, M; Li, Y; Cheng, L; Li, J; Zhou, X; Xu, X

2015-02-01

Dental caries is closely associated with the microbial disequilibrium between acidogenic/aciduric pathogens and alkali-generating commensal residents within the dental plaque. Fluoride is a widely used anticaries agent, which promotes tooth hard-tissue remineralization and suppresses bacterial activities. Recent clinical trials have shown that oral hygiene products containing both fluoride and arginine possess a greater anticaries effect compared with those containing fluoride alone, indicating synergy between fluoride and arginine in caries management. Here, we hypothesize that arginine may augment the ecological benefit of fluoride by enriching alkali-generating bacteria in the plaque biofilm and thus synergizes with fluoride in controlling dental caries. Specifically, we assessed the combinatory effects of NaF/arginine on planktonic and biofilm cultures of Streptococcus mutans, Streptococcus sanguinis, and Porphyromonas gingivalis with checkerboard microdilution assays. The optimal NaF/arginine combinations were selected, and their combinatory effects on microbial composition were further examined in single-, dual-, and 3-species biofilm using bacterial species-specific fluorescence in situ hybridization and quantitative polymerase chain reaction. We found that arginine synergized with fluoride in suppressing acidogenic S. mutans in both planktonic and biofilm cultures. In addition, the NaF/arginine combination synergistically reduced S. mutans but enriched S. sanguinis within the multispecies biofilms. More importantly, the optimal combination of NaF/arginine maintained a "streptococcal pressure" against the potential growth of oral anaerobe P. gingivalis within the alkalized biofilm. Taken together, we conclude that the combinatory application of fluoride and arginine has a potential synergistic effect in maintaining a healthy oral microbial equilibrium and thus represents a promising ecological approach to caries management. © International & American

IκBα mediates prostate cancer cell death induced by combinatorial targeting of the androgen receptor

International Nuclear Information System (INIS)

Carter, Sarah Louise; Centenera, Margaret Mary; Tilley, Wayne Desmond; Selth, Luke Ashton; Butler, Lisa Maree

2016-01-01

Combining different clinical agents to target multiple pathways in prostate cancer cells, including androgen receptor (AR) signaling, is potentially an effective strategy to improve outcomes for men with metastatic disease. We have previously demonstrated that sub-effective concentrations of an AR antagonist, bicalutamide, and the histone deacetylase inhibitor, vorinostat, act synergistically when combined to cause death of AR-dependent prostate cancer cells. In this study, expression profiling of human prostate cancer cells treated with bicalutamide or vorinostat, alone or in combination, was employed to determine the molecular mechanisms underlying this synergistic action. Cell viability assays and quantitative real time PCR were used to validate identified candidate genes. A substantial proportion of the genes modulated by the combination of bicalutamide and vorinostat were androgen regulated. Independent pathway analysis identified further pathways and genes, most notably NFKBIA (encoding IκBα, an inhibitor of NF-κB and p53 signaling), as targets of this combinatorial treatment. Depletion of IκBα by siRNA knockdown enhanced apoptosis of prostate cancer cells, while ectopic overexpression of IκBα markedly suppressed cell death induced by the combination of bicalutamide and vorinostat. These findings implicate IκBα as a key mediator of the apoptotic action of this combinatorial AR targeting strategy and a promising new therapeutic target for prostate cancer. The online version of this article (doi:10.1186/s12885-016-2188-2) contains supplementary material, which is available to authorized users

Combinatorial Strategies for Synthesis and Characterization of Alloy Microstructures over Large Compositional Ranges.

Science.gov (United States)

Li, Yanglin; Jensen, Katharine E; Liu, Yanhui; Liu, Jingbei; Gong, Pan; Scanley, B Ellen; Broadbridge, Christine C; Schroers, Jan

2016-10-10

The exploration of new alloys with desirable properties has been a long-standing challenge in materials science because of the complex relationship between composition and microstructure. In this Research Article, we demonstrate a combinatorial strategy for the exploration of composition dependence of microstructure. This strategy is comprised of alloy library synthesis followed by high-throughput microstructure characterization. As an example, we synthesized a ternary Au-Cu-Si composition library containing over 1000 individual alloys using combinatorial sputtering. We subsequently melted and resolidified the entire library at controlled cooling rates. We used scanning optical microscopy and X-ray diffraction mapping to explore trends in phase formation and microstructural length scale with composition across the library. The integration of combinatorial synthesis with parallelizable analysis methods provides a efficient method for examining vast compositional ranges. The availability of microstructures from this vast composition space not only facilitates design of new alloys by controlling effects of composition on phase selection, phase sequence, length scale, and overall morphology, but also will be instrumental in understanding the complex process of microstructure formation in alloys.

Combinatorial programming of human neuronal progenitors using magnetically-guided stoichiometric mRNA delivery.

Science.gov (United States)

Azimi, Sayyed M; Sheridan, Steven D; Ghannad-Rezaie, Mostafa; Eimon, Peter M; Yanik, Mehmet Fatih

2018-05-01

Identification of optimal transcription-factor expression patterns to direct cellular differentiation along a desired pathway presents significant challenges. We demonstrate massively combinatorial screening of temporally-varying mRNA transcription factors to direct differentiation of neural progenitor cells using a dynamically-reconfigurable magnetically-guided spotting technology for localizing mRNA, enabling experiments on millimetre size spots. In addition, we present a time-interleaved delivery method that dramatically reduces fluctuations in the delivered transcription-factor copy-numbers per cell. We screened combinatorial and temporal delivery of a pool of midbrain-specific transcription factors to augment the generation of dopaminergic neurons. We show that the combinatorial delivery of LMX1A, FOXA2 and PITX3 is highly effective in generating dopaminergic neurons from midbrain progenitors. We show that LMX1A significantly increases TH -expression levels when delivered to neural progenitor cells either during proliferation or after induction of neural differentiation, while FOXA2 and PITX3 increase expression only when delivered prior to induction, demonstrating temporal dependence of factor addition. © 2018, Azimi et al.

Recursive deconvolution of combinatorial chemical libraries.

OpenAIRE

Erb, E; Janda, K D; Brenner, S

1994-01-01

A recursive strategy that solves for the active members of a chemical library is presented. A pentapeptide library with an alphabet of Gly, Leu, Phe, and Tyr (1024 members) was constructed on a solid support by the method of split synthesis. One member of this library (NH2-Tyr-Gly-Gly-Phe-Leu) is a native binder to a beta-endorphin antibody. A variation of the split synthesis approach is used to build the combinatorial library. In four vials, a member of the library's alphabet is coupled to a...

Characterizing the combinatorial beam angle selection problem

Science.gov (United States)

Bangert, Mark; Ziegenhein, Peter; Oelfke, Uwe

2012-10-01

The beam angle selection (BAS) problem in intensity-modulated radiation therapy is often interpreted as a combinatorial optimization problem, i.e. finding the best combination of η beams in a discrete set of candidate beams. It is well established that the combinatorial BAS problem may be solved efficiently with metaheuristics such as simulated annealing or genetic algorithms. However, the underlying parameters of the optimization process, such as the inclusion of non-coplanar candidate beams, the angular resolution in the space of candidate beams, and the number of evaluated beam ensembles as well as the relative performance of different metaheuristics have not yet been systematically investigated. We study these open questions in a meta-analysis of four strategies for combinatorial optimization in order to provide a reference for future research related to the BAS problem in intensity-modulated radiation therapy treatment planning. We introduce a high-performance inverse planning engine for BAS. It performs a full fluence optimization for ≈3600 treatment plans per hour while handling up to 50 GB of dose influence data (≈1400 candidate beams). For three head and neck patients, we compare the relative performance of a genetic, a cross-entropy, a simulated annealing and a naive iterative algorithm. The selection of ensembles with 5, 7, 9 and 11 beams considering either only coplanar or all feasible candidate beams is studied for an angular resolution of 5°, 10°, 15° and 20° in the space of candidate beams. The impact of different convergence criteria is investigated in comparison to a fixed termination after the evaluation of 10 000 beam ensembles. In total, our simulations comprise a full fluence optimization for about 3000 000 treatment plans. All four combinatorial BAS strategies yield significant improvements of the objective function value and of the corresponding dose distributions compared to standard beam configurations with equi

Characterizing the combinatorial beam angle selection problem

International Nuclear Information System (INIS)

Bangert, Mark; Ziegenhein, Peter; Oelfke, Uwe

2012-01-01

The beam angle selection (BAS) problem in intensity-modulated radiation therapy is often interpreted as a combinatorial optimization problem, i.e. finding the best combination of η beams in a discrete set of candidate beams. It is well established that the combinatorial BAS problem may be solved efficiently with metaheuristics such as simulated annealing or genetic algorithms. However, the underlying parameters of the optimization process, such as the inclusion of non-coplanar candidate beams, the angular resolution in the space of candidate beams, and the number of evaluated beam ensembles as well as the relative performance of different metaheuristics have not yet been systematically investigated. We study these open questions in a meta-analysis of four strategies for combinatorial optimization in order to provide a reference for future research related to the BAS problem in intensity-modulated radiation therapy treatment planning. We introduce a high-performance inverse planning engine for BAS. It performs a full fluence optimization for ≈3600 treatment plans per hour while handling up to 50 GB of dose influence data (≈1400 candidate beams). For three head and neck patients, we compare the relative performance of a genetic, a cross-entropy, a simulated annealing and a naive iterative algorithm. The selection of ensembles with 5, 7, 9 and 11 beams considering either only coplanar or all feasible candidate beams is studied for an angular resolution of 5°, 10°, 15° and 20° in the space of candidate beams. The impact of different convergence criteria is investigated in comparison to a fixed termination after the evaluation of 10 000 beam ensembles. In total, our simulations comprise a full fluence optimization for about 3000 000 treatment plans. All four combinatorial BAS strategies yield significant improvements of the objective function value and of the corresponding dose distributions compared to standard beam configurations with equi

Multiple scattering of polarized light: comparison of Maxwell theory and radiative transfer theory.

Science.gov (United States)

Voit, Florian; Hohmann, Ansgar; Schäfer, Jan; Kienle, Alwin

2012-04-01

For many research areas in biomedical optics, information about scattering of polarized light in turbid media is of increasing importance. Scattering simulations within this field are mainly performed on the basis of radiative transfer theory. In this study a polarization sensitive Monte Carlo solution of radiative transfer theory is compared to exact Maxwell solutions for all elements of the scattering Müller matrix. Different scatterer volume concentrations are modeled as a multitude of monodisperse nonabsorbing spheres randomly positioned in a cubic simulation volume which is irradiated with monochromatic incident light. For all Müller matrix elements effects due to dependent scattering and multiple scattering are analysed. The results are in overall good agreement between the two methods with deviations related to dependent scattering being prominent for high volume concentrations and high scattering angles.

New high-throughput material-exploration system based on combinatorial chemistry and electrostatic atomization

International Nuclear Information System (INIS)

Fujimoto, K.; Takahashi, H.; Ito, S.; Inoue, S.; Watanabe, M.

2006-01-01

As a tool to facilitate future material explorations, our group has developed a new combinatorial system for the high-throughput preparation of compounds made up of more than three components. The system works in two steps: the atomization of a liquid by a high electric field followed by deposition to a grounded substrate. The combinatorial system based on this method has plural syringe pumps. The each starting materials are fed through the syringe pumps into a manifold, thoroughly mixed as they pass through the manifold, and atomized from the tip of a stainless steel nozzle onto a grounded substrate

"One-sample concept" micro-combinatory for high throughput TEM of binary films.

Science.gov (United States)

Sáfrán, György

2018-04-01

Phases of thin films may remarkably differ from that of bulk. Unlike to the comprehensive data files of Binary Phase Diagrams [1] available for bulk, complete phase maps for thin binary layers do not exist. This is due to both the diverse metastable, non-equilibrium or instable phases feasible in thin films and the required volume of characterization work with analytical techniques like TEM, SAED and EDS. The aim of the present work was to develop a method that remarkably facilitates the TEM study of the diverse binary phases of thin films, or the creation of phase maps. A micro-combinatorial method was worked out that enables both preparation and study of a gradient two-component film within a single TEM specimen. For a demonstration of the technique thin Mn x Al 1- x binary samples with evolving concentration from x = 0 to x = 1 have been prepared so that the transition from pure Mn to pure Al covers a 1.5 mm long track within the 3 mm diameter TEM grid. The proposed method enables the preparation and study of thin combinatorial samples including all feasible phases as a function of composition or other deposition parameters. Contrary to known "combinatorial chemistry", in which a series of different samples are deposited in one run, and investigated, one at a time, the present micro-combinatorial method produces a single specimen condensing a complete library of a binary system that can be studied, efficiently, within a single TEM session. That provides extremely high throughput for TEM characterization of composition-dependent phases, exploration of new materials, or the construction of phase diagrams of binary films. Copyright © 2018 Elsevier B.V. All rights reserved.

Dynamic Combinatorial Chemistry with Diselenides, Disulfides, Imines and Metal Coordination

DEFF Research Database (Denmark)

Sørensen, Anne

combinatorial chemistry, namely the reversible diselenide exchange reaction. The first part of the thesis describes the development of a thermally induced OAr → SeAr migration reaction. Here, it was proven possible to rearrange a variety of substituted O-aryl selenocarbamates into the corresponding Se...

Confluence of an extension of combinatory logic by Boolean constants

DEFF Research Database (Denmark)

Czajka, Łukasz

2017-01-01

We show confluence of a conditional term rewriting system CL-pc1, which is an extension of Combinatory Logic by Boolean constants. This solves problem 15 from the RTA list of open problems. The proof has been fully formalized in the Coq proof assistant....

Combinatorial chemistry approach to development of molecular plastic solar cells

NARCIS (Netherlands)

Godovsky, Dmitri; Inganäs, Olle; Brabec, Christoph J.; Sariciftci, N. Serdar; Hummelen, Jan C.; Janssen, Rene A.J.; Prato, M.; Maggini, M.; Segura, Jose; Martin, Nazario

1999-01-01

We used a combinatorial chemistry approach to develop the molecular plastic solar cells based on soluble fullerene derivatives or solubilized TCNQ molecules in combination with conjugated polymers. Profiles, formed by the diffusion of low molecular weight component in the spin-cast polymer host were

Engineered, Spatially Varying Isothermal Holds: Enabling Combinatorial Studies of Temperature Effects, as Applied to Metastable Titanium Alloy β-21S

International Nuclear Information System (INIS)

Martin, Brian; Colorado School of Mines, Golden, CO; Samimi, Peyman; Colorado School of Mines, Golden, CO; Collins, Peter

2017-01-01

A novel method to systematically vary temperature and thus study the resulting microstructure of a material is presented. This new method has the potential to be used in a combinatorial fashion, allowing the rapid study of thermal holds on microstructures to be conducted. This is demonstrated on a beta titanium alloy, where the thermal history has a strong effect on microstructure. It is informed by simulation and executed using the resistive heating capabilities of a Gleeble 3800 thermomechanical simulator. Spatially varying isothermal holds of 4 h were affected, where the temperature range of the multiple isothermal holds varied by ~175 °C.

Combinatorial chemoenzymatic synthesis and high-throughput screening of sialosides.

Science.gov (United States)

Chokhawala, Harshal A; Huang, Shengshu; Lau, Kam; Yu, Hai; Cheng, Jiansong; Thon, Vireak; Hurtado-Ziola, Nancy; Guerrero, Juan A; Varki, Ajit; Chen, Xi

2008-09-19

Although the vital roles of structures containing sialic acid in biomolecular recognition are well documented, limited information is available on how sialic acid structural modifications, sialyl linkages, and the underlying glycan structures affect the binding or the activity of sialic acid-recognizing proteins and related downstream biological processes. A novel combinatorial chemoenzymatic method has been developed for the highly efficient synthesis of biotinylated sialosides containing different sialic acid structures and different underlying glycans in 96-well plates from biotinylated sialyltransferase acceptors and sialic acid precursors. By transferring the reaction mixtures to NeutrAvidin-coated plates and assaying for the yields of enzymatic reactions using lectins recognizing sialyltransferase acceptors but not the sialylated products, the biotinylated sialoside products can be directly used, without purification, for high-throughput screening to quickly identify the ligand specificity of sialic acid-binding proteins. For a proof-of-principle experiment, 72 biotinylated alpha2,6-linked sialosides were synthesized in 96-well plates from 4 biotinylated sialyltransferase acceptors and 18 sialic acid precursors using a one-pot three-enzyme system. High-throughput screening assays performed in NeutrAvidin-coated microtiter plates show that whereas Sambucus nigra Lectin binds to alpha2,6-linked sialosides with high promiscuity, human Siglec-2 (CD22) is highly selective for a number of sialic acid structures and the underlying glycans in its sialoside ligands.

Comprehensive genetic assessment of the human embryo: can empiric application of microarray comparative genomic hybridization reduce multiple gestation rate by single fresh blastocyst transfer?

Science.gov (United States)

Sills, Eric Scott; Yang, Zhihong; Walsh, David J; Salem, Shala A

2012-09-01

The unacceptable multiple gestation rate currently associated with in vitro fertilization (IVF) would be substantially alleviated if the routine practice of transferring more than one embryo were reconsidered. While transferring a single embryo is an effective method to reduce the clinical problem of multiple gestation, rigid adherence to this approach has been criticized for negatively impacting clinical pregnancy success in IVF. In general, single embryo transfer is viewed cautiously by IVF patients although greater acceptance would result from a more effective embryo selection method. Selection of one embryo for fresh transfer on the basis of chromosomal normalcy should achieve the dual objective of maintaining satisfactory clinical pregnancy rates and minimizing the multiple gestation problem, because embryo aneuploidy is a major contributing factor in implantation failure and miscarriage in IVF. The initial techniques for preimplantation genetic screening unfortunately lacked sufficient sensitivity and did not yield the expected results in IVF. However, newer molecular genetic methods could be incorporated with standard IVF to bring the goal of single embryo transfer within reach. Aiming to make multiple embryo transfers obsolete and unnecessary, and recognizing that array comparative genomic hybridization (aCGH) will typically require an additional 12 h of laboratory time to complete, we propose adopting aCGH for mainstream use in clinical IVF practice. As aCGH technology continues to develop and becomes increasingly available at lower cost, it may soon be considered unusual for IVF laboratories to select a single embryo for fresh transfer without regard to its chromosomal competency. In this report, we provide a rationale supporting aCGH as the preferred methodology to provide a comprehensive genetic assessment of the single embryo before fresh transfer in IVF. The logistics and cost of integrating aCGH with IVF to enable fresh embryo transfer are also

Anti-termite efficacy of Capparis decidua and its combinatorial ...

African Journals Online (AJOL)

Michael Horsfall

ABSTRACT: Capparis deciduas and its combinatorial mixtures were evaluated to observe the anti-termite efficacy against Indian white termite Odontotermes obesus. These have shown very high termiticidal activity and wood protection in the soil. It is proved by very low LD50 values i.e. 0.0218mg/g and 0.021mg/g obtained ...

Extensions of Dynamic Programming: Decision Trees, Combinatorial Optimization, and Data Mining

KAUST Repository

Hussain, Shahid

2016-01-01

This thesis is devoted to the development of extensions of dynamic programming to the study of decision trees. The considered extensions allow us to make multi-stage optimization of decision trees relative to a sequence of cost functions, to count the number of optimal trees, and to study relationships: cost vs cost and cost vs uncertainty for decision trees by construction of the set of Pareto-optimal points for the corresponding bi-criteria optimization problem. The applications include study of totally optimal (simultaneously optimal relative to a number of cost functions) decision trees for Boolean functions, improvement of bounds on complexity of decision trees for diagnosis of circuits, study of time and memory trade-off for corner point detection, study of decision rules derived from decision trees, creation of new procedure (multi-pruning) for construction of classifiers, and comparison of heuristics for decision tree construction. Part of these extensions (multi-stage optimization) was generalized to well-known combinatorial optimization problems: matrix chain multiplication, binary search trees, global sequence alignment, and optimal paths in directed graphs.

Extensions of Dynamic Programming: Decision Trees, Combinatorial Optimization, and Data Mining

KAUST Repository

Hussain, Shahid

2016-07-10

This thesis is devoted to the development of extensions of dynamic programming to the study of decision trees. The considered extensions allow us to make multi-stage optimization of decision trees relative to a sequence of cost functions, to count the number of optimal trees, and to study relationships: cost vs cost and cost vs uncertainty for decision trees by construction of the set of Pareto-optimal points for the corresponding bi-criteria optimization problem. The applications include study of totally optimal (simultaneously optimal relative to a number of cost functions) decision trees for Boolean functions, improvement of bounds on complexity of decision trees for diagnosis of circuits, study of time and memory trade-off for corner point detection, study of decision rules derived from decision trees, creation of new procedure (multi-pruning) for construction of classifiers, and comparison of heuristics for decision tree construction. Part of these extensions (multi-stage optimization) was generalized to well-known combinatorial optimization problems: matrix chain multiplication, binary search trees, global sequence alignment, and optimal paths in directed graphs.

Combinatorial drug screening identifies Ewing sarcoma-specific sensitivities

OpenAIRE

Radic-Sarikas, Branka; Tsafou, Kalliopi P.; Emdal, Kristina B.; Papamarkou, Theodore; Huber, Kilian V.M.; Mutz, Cornelia; Toretsky, Jeffrey A.; Bennett, Keiryn L.; Olsen, Jesper V.; Brunak, Søren; Kovar, Heinrich; Superti-Furga, Giulio

2017-01-01

Improvements in survival for Ewing sarcoma pediatric and adolescent patients have been modest over the past 20 years. Combinations of anticancer agents endure as an option to overcome resistance to single treatments caused by compensatory pathways. Moreover, combinations are thought to lessen any associated adverse side effects through reduced dosing, which is particularly important in childhood tumors. Using a parallel phenotypic combinatorial screening approach of cells derived from three p...

ON range searching in the group model and combinatorial discrepancy

DEFF Research Database (Denmark)

Larsen, Kasper Green

2014-01-01

In this paper we establish an intimate connection between dynamic range searching in the group model and combinatorial discrepancy. Our result states that, for a broad class of range searching data structures (including all known upper bounds), it must hold that $t_u t_q=\\Omega(\\mbox{disc}^2......)$, where $t_u$ is the worst case update time, $t_q$ is the worst case query time, and disc is the combinatorial discrepancy of the range searching problem in question. This relation immediately implies a whole range of exceptionally high and near-tight lower bounds for all of the basic range searching...... problems. We list a few of them in the following: (1) For $d$-dimensional halfspace range searching, we get a lower bound of $t_u t_q=\\Omega(n^{1-1/d})$. This comes within an lg lg $n$ factor of the best known upper bound. (2) For orthogonal range searching, we get a lower bound of $t_u t...

ACRE: Absolute concentration robustness exploration in module-based combinatorial networks

KAUST Repository

Kuwahara, Hiroyuki; Umarov, Ramzan; Almasri, Islam; Gao, Xin

2017-01-01

To engineer cells for industrial-scale application, a deep understanding of how to design molecular control mechanisms to tightly maintain functional stability under various fluctuations is crucial. Absolute concentration robustness (ACR) is a category of robustness in reaction network models in which the steady-state concentration of a molecular species is guaranteed to be invariant even with perturbations in the other molecular species in the network. Here, we introduce a software tool, absolute concentration robustness explorer (ACRE), which efficiently explores combinatorial biochemical networks for the ACR property. ACRE has a user-friendly interface, and it can facilitate efficient analysis of key structural features that guarantee the presence and the absence of the ACR property from combinatorial networks. Such analysis is expected to be useful in synthetic biology as it can increase our understanding of how to design molecular mechanisms to tightly control the concentration of molecular species. ACRE is freely available at https://github.com/ramzan1990/ACRE.

ACRE: Absolute concentration robustness exploration in module-based combinatorial networks

KAUST Repository

Kuwahara, Hiroyuki

2017-03-01

To engineer cells for industrial-scale application, a deep understanding of how to design molecular control mechanisms to tightly maintain functional stability under various fluctuations is crucial. Absolute concentration robustness (ACR) is a category of robustness in reaction network models in which the steady-state concentration of a molecular species is guaranteed to be invariant even with perturbations in the other molecular species in the network. Here, we introduce a software tool, absolute concentration robustness explorer (ACRE), which efficiently explores combinatorial biochemical networks for the ACR property. ACRE has a user-friendly interface, and it can facilitate efficient analysis of key structural features that guarantee the presence and the absence of the ACR property from combinatorial networks. Such analysis is expected to be useful in synthetic biology as it can increase our understanding of how to design molecular mechanisms to tightly control the concentration of molecular species. ACRE is freely available at https://github.com/ramzan1990/ACRE.

Solidified self-nanoemulsifying formulation for oral delivery of combinatorial therapeutic regimen

DEFF Research Database (Denmark)

Jain, Amit K; Thanki, Kaushik; Jain, Sanyog

2014-01-01

PURPOSE: The present work reports rationalized development and characterization of solidified self-nanoemulsifying drug delivery system for oral delivery of combinatorial (tamoxifen and quercetin) therapeutic regimen. METHODS: Suitable oil for the preparation of liquid SNEDDS was selected based...

Synthesis of new water-soluble metal-binding polymers: Combinatorial chemistry approach. 1998 annual progress report

International Nuclear Information System (INIS)

Kurth, M.J.; Miller, R.B.; Sawan, S.; Smith, B.F.

1998-01-01

'(1) Develop rapid discovery and optimization approaches to new water-soluble chelating polymers for use in Polymer Filtration (PF) systems, and (2) evaluate the concept of using water and organic soluble polymers as new solid supports for combinatorial synthesis. Polymer Filtration (PF), which uses water-soluble metal-binding polymers to sequester metal ions in dilute solution with ultrafiltration (UF) to separate the polymers, is a new technology to selectively remove or recover hazardous and valuable metal ions. Future directions in PF must include rapid development, testing, and characterization of new metal-binding polymers. Thus, the authors are building upon and adapting the combinatorial chemistry approach developed for rapid molecule generation for the drug industry to the rapid development of new chelating polymers. The authors have focused on four areas including the development of: (1) synthetic procedures, (2) small ultrafiltration equipment compatible with organic- and aqueous-based combinatorial synthesis, (3) rapid assay techniques, and (4) polymer characterization techniques.'

Introducing Dynamic Combinatorial Chemistry: Probing the Substrate Selectivity of Acetylcholinesterase

Science.gov (United States)

Angelin, Marcus; Larsson, Rikard; Vongvilai, Pornrapee; Ramstrom, Olof

2010-01-01

In this laboratory experiment, college students are introduced to dynamic combinatorial chemistry (DCC) and apply it to determine the substrate selectivity of acetylcholinesterase (AChE). Initially, the students construct a chemical library of dynamically interchanging thioesters and thiols. Then, AChE is added and allowed to select and hydrolyze…

Study and development of the data transfer for the NA50 experiment: transputer network of the multiplicity detector

International Nuclear Information System (INIS)

Capony, V.

1996-01-01

This thesis presents the works performed for the experiment NA50 at CERN, in he framework of the development of its multiplicity detector. The two first chapters describe the physical aims of the experiment and the apparatus used. The remaining part of this document shows the data readout device, developed for the multiplicity detector. Built on a T8 transputer network, this system is able to treat 8 Mbytes of data at each SPS accelerator cycle. It integrates an on-line event-builder. A filtering algorithm estimates the validity of the information and allows the flagging of all the data. The last function of this transputers network is to transfer data from the detector to the data acquisition system. Our system is able to control a data rate transfer of 35 Gbytes per day. (author)

First steps in combinatorial optimization on graphons: matchings

Czech Academy of Sciences Publication Activity Database

Doležal, Martin; Hladký, J.; Hu, P.; Piguet, Diana

2017-01-01

Roč. 61, August (2017), s. 359-365 ISSN 1571-0653 R&D Projects: GA ČR GA16-07378S; GA ČR GJ16-07822Y EU Projects: European Commission(XE) 628974 - PAECIDM Institutional support: RVO:67985840 ; RVO:67985807 Keywords : graphon * graph limits * matching * combinatorial optimization Subject RIV: BA - General Mathematics ; BA - General Mathematics (UIVT-O) OBOR OECD: Pure mathematics ; Pure mathematics (UIVT-O) http://www.sciencedirect.com/science/article/pii/S1571065317301452

First steps in combinatorial optimization on graphons: matchings

Czech Academy of Sciences Publication Activity Database

Doležal, Martin; Hladký, J.; Hu, P.; Piguet, Diana

2017-01-01

Roč. 61, August (2017), s. 359-365 ISSN 1571-0653 R&D Projects: GA ČR GA16-07378S; GA ČR GJ16-07822Y EU Projects: European Commission(XE) 628974 - PAECIDM Institutional support: RVO:67985840 ; RVO:67985807 Keywords : graphon * graph limits * matching * combinatorial optimization Subject RIV: BA - General Mathematics; BA - General Mathematics (UIVT-O) OBOR OECD: Pure mathematics; Pure mathematics (UIVT-O) http://www.sciencedirect.com/science/article/pii/S1571065317301452

Transfer Pricing

DEFF Research Database (Denmark)

Nielsen, Søren Bo

2014-01-01

Against a background of rather mixed evidence about transfer pricing practices in multinational enterprises (MNEs) and varying attitudes on the part of tax authorities, this paper explores how multiple aims in transfer pricing can be pursued across four different transfer pricing regimes. A MNE h...

D- production by multiple charge-transfer collisions in metal-vapor targets. [1 to 50 keV D/sup +/

Energy Technology Data Exchange (ETDEWEB)

Schlachter, A.S.

1977-09-01

A beam of D/sup -/ions can be produced by multiple charge-transfer collisions of a D/sup +/ beam in a thick metal-vapor target. Cross sections and equilibrium charge-state fractions are presented and discussed.

Dynamical System Approaches to Combinatorial Optimization

DEFF Research Database (Denmark)

Starke, Jens

2013-01-01

of large times as an asymptotically stable point of the dynamics. The obtained solutions are often not globally optimal but good approximations of it. Dynamical system and neural network approaches are appropriate methods for distributed and parallel processing. Because of the parallelization......Several dynamical system approaches to combinatorial optimization problems are described and compared. These include dynamical systems derived from penalty methods; the approach of Hopfield and Tank; self-organizing maps, that is, Kohonen networks; coupled selection equations; and hybrid methods...... thereof can be used as models for many industrial problems like manufacturing planning and optimization of flexible manufacturing systems. This is illustrated for an example in distributed robotic systems....

Method and apparatus for combinatorial chemistry

Science.gov (United States)

Foote, Robert S [Oak Ridge, TN

2012-06-05

A method and apparatus are provided for performing light-directed reactions in spatially addressable channels within a plurality of channels. One aspect of the invention employs photoactivatable reagents in solutions disposed into spatially addressable flow streams to control the parallel synthesis of molecules immobilized within the channels. The reagents may be photoactivated within a subset of channels at the site of immobilized substrate molecules or at a light-addressable site upstream from the substrate molecules. The method and apparatus of the invention find particularly utility in the synthesis of biopolymer arrays, e.g., oligonucleotides, peptides and carbohydrates, and in the combinatorial synthesis of small molecule arrays for drug discovery.

Two is better than one; toward a rational design of combinatorial therapy.

Science.gov (United States)

Chen, Sheng-Hong; Lahav, Galit

2016-12-01

Drug combination is an appealing strategy for combating the heterogeneity of tumors and evolution of drug resistance. However, the rationale underlying combinatorial therapy is often not well established due to lack of understandings of the specific pathways responding to the drugs, and their temporal dynamics following each treatment. Here we present several emerging trends in harnessing properties of biological systems for the optimal design of drug combinations, including the type of drugs, specific concentration, sequence of addition and the temporal schedule of treatments. We highlight recent studies showing different approaches for efficient design of drug combinations including single-cell signaling dynamics, adaption and pathway crosstalk. Finally, we discuss novel and feasible approaches that can facilitate the optimal design of combinatorial therapy. Copyright © 2016 Elsevier Ltd. All rights reserved.

Geometric Generalisation of Surrogate Model-Based Optimisation to Combinatorial and Program Spaces

Directory of Open Access Journals (Sweden)

Yong-Hyuk Kim

2014-01-01

Full Text Available Surrogate models (SMs can profitably be employed, often in conjunction with evolutionary algorithms, in optimisation in which it is expensive to test candidate solutions. The spatial intuition behind SMs makes them naturally suited to continuous problems, and the only combinatorial problems that have been previously addressed are those with solutions that can be encoded as integer vectors. We show how radial basis functions can provide a generalised SM for combinatorial problems which have a geometric solution representation, through the conversion of that representation to a different metric space. This approach allows an SM to be cast in a natural way for the problem at hand, without ad hoc adaptation to a specific representation. We test this adaptation process on problems involving binary strings, permutations, and tree-based genetic programs.

Discovery of Cationic Polymers for Non-viral Gene Delivery using Combinatorial Approaches

Science.gov (United States)

Barua, Sutapa; Ramos, James; Potta, Thrimoorthy; Taylor, David; Huang, Huang-Chiao; Montanez, Gabriela; Rege, Kaushal

2015-01-01

Gene therapy is an attractive treatment option for diseases of genetic origin, including several cancers and cardiovascular diseases. While viruses are effective vectors for delivering exogenous genes to cells, concerns related to insertional mutagenesis, immunogenicity, lack of tropism, decay and high production costs necessitate the discovery of non-viral methods. Significant efforts have been focused on cationic polymers as non-viral alternatives for gene delivery. Recent studies have employed combinatorial syntheses and parallel screening methods for enhancing the efficacy of gene delivery, biocompatibility of the delivery vehicle, and overcoming cellular level barriers as they relate to polymer-mediated transgene uptake, transport, transcription, and expression. This review summarizes and discusses recent advances in combinatorial syntheses and parallel screening of cationic polymer libraries for the discovery of efficient and safe gene delivery systems. PMID:21843141

Machine learning meliorates computing and robustness in discrete combinatorial optimization problems.

Directory of Open Access Journals (Sweden)

Fushing Hsieh

2016-11-01

Full Text Available Discrete combinatorial optimization problems in real world are typically defined via an ensemble of potentially high dimensional measurements pertaining to all subjects of a system under study. We point out that such a data ensemble in fact embeds with system's information content that is not directly used in defining the combinatorial optimization problems. Can machine learning algorithms extract such information content and make combinatorial optimizing tasks more efficient? Would such algorithmic computations bring new perspectives into this classic topic of Applied Mathematics and Theoretical Computer Science? We show that answers to both questions are positive. One key reason is due to permutation invariance. That is, the data ensemble of subjects' measurement vectors is permutation invariant when it is represented through a subject-vs-measurement matrix. An unsupervised machine learning algorithm, called Data Mechanics (DM, is applied to find optimal permutations on row and column axes such that the permuted matrix reveals coupled deterministic and stochastic structures as the system's information content. The deterministic structures are shown to facilitate geometry-based divide-and-conquer scheme that helps optimizing task, while stochastic structures are used to generate an ensemble of mimicries retaining the deterministic structures, and then reveal the robustness pertaining to the original version of optimal solution. Two simulated systems, Assignment problem and Traveling Salesman problem, are considered. Beyond demonstrating computational advantages and intrinsic robustness in the two systems, we propose brand new robust optimal solutions. We believe such robust versions of optimal solutions are potentially more realistic and practical in real world settings.

Probing nuclear shell structure beyond the N=40 subshell using multiple Coulomb excitation and transfer experiments

Energy Technology Data Exchange (ETDEWEB)

Hellgartner, Stefanie Christine

2015-11-13

In this work, the N=40 subshell closure is investigated with two complementary methods using a radioactive {sup 72}Zn ISOLDE beam: One- and two-neutron transfer reactions and multiple Coulomb excitation. In the one-neutron transfer reaction, two new levels of {sup 73}Zn were discovered. The two-neutron transfer channel allowed to study the differential cross section of the ground state and the 2{sup +}{sub 1} state of {sup 74}Zn. In the Coulomb excitation experiment, the measured B(E2) values and quadrupole moments of {sup 72}Zn showed that the yrast states 0{sup +}{sub 1}, 2{sup +}{sub 1} and 4{sup +}{sub 1} are moderately collective. Contrary, the 0{sup +}{sub 2} state has a different structure, since it features a stronger closed N=40 configuration compared to the ground state.

Estimating side-chain order in methyl-protonated, perdeuterated proteins via multiple-quantum relaxation violated coherence transfer NMR spectroscopy

International Nuclear Information System (INIS)

Sun Hechao; Godoy-Ruiz, Raquel; Tugarinov, Vitali

2012-01-01

Relaxation violated coherence transfer NMR spectroscopy (Tugarinov et al. in J Am Chem Soc 129:1743–1750, 2007) is an established experimental tool for quantitative estimation of the amplitudes of side-chain motions in methyl-protonated, highly deuterated proteins. Relaxation violated coherence transfer experiments monitor the build-up of methyl proton multiple-quantum coherences that can be created in magnetically equivalent spin-systems as long as their transverse magnetization components relax with substantially different rates. The rate of this build-up is a reporter of the methyl-bearing side-chain mobility. Although the build-up of multiple-quantum 1 H coherences is monitored in these experiments, the decay of the methyl signal during relaxation delays occurs when methyl proton magnetization is in a single-quantum state. We describe a relaxation violated coherence transfer approach where the relaxation of multiple-quantum 1 H– 13 C methyl coherences during the relaxation delay period is quantified. The NMR experiment and the associated fitting procedure that models the time-dependence of the signal build-up, are applicable to the characterization of side-chain order in [ 13 CH 3 ]-methyl-labeled, highly deuterated protein systems up to ∼100 kDa in molecular weight. The feasibility of extracting reliable measures of side-chain order is experimentally verified on methyl-protonated, perdeuterated samples of an 8.5-kDa ubiquitin at 10°C and an 82-kDa Malate Synthase G at 37°C.

Efficient Discovery of Nonlinear Dependencies in a Combinatorial Catalyst Data Set

Czech Academy of Sciences Publication Activity Database

Cawse, J.N.; Baerns, M.; Holeňa, Martin

2004-01-01

Roč. 44, č. 3 (2004), s. 143-146 ISSN 0095-2338 Source of funding: V - iné verejné zdroje Keywords : combinatorial catalysis * genetic algorithms * nonlinear dependency * data analysis * high-order interactions Subject RIV: IN - Informatics, Computer Science Impact factor: 2.810, year: 2004

A combinatorial framework to quantify peak/pit asymmetries in complex dynamics

NARCIS (Netherlands)

Hasson, Uri; Iacovacci, Jacopo; Davis, Ben; Flanagan, Ryan; Tagliazucchi, E.; Laufs, Helmut; Lacasa, Lucas

2018-01-01

We explore a combinatorial framework which efficiently quantifies the asymmetries between minima and maxima in local fluctuations of time series. We first showcase its performance by applying it to a battery of synthetic cases. We find rigorous results on some canonical dynamical models (stochastic

Sentence Processing in an Artificial Language: Learning and Using Combinatorial Constraints

Science.gov (United States)

Amato, Michael S.; MacDonald, Maryellen C.

2010-01-01

A study combining artificial grammar and sentence comprehension methods investigated the learning and online use of probabilistic, nonadjacent combinatorial constraints. Participants learned a small artificial language describing cartoon monsters acting on objects. Self-paced reading of sentences in the artificial language revealed comprehenders'…

Predictions of flow and heat transfer in multiple impinging jets with an elliptic-blending second-moment closure

NARCIS (Netherlands)

Thielen, L.; Hanjalić, K.; Jonker, H.; Manceau, R.

2005-01-01

We present numerical computations of flow and heat transfer in multiple jets impinging normally on a flat heated surface, obtained with a new second-moment turbulence closure combined with an elliptic blending model of non-viscous wall blocking effect. This model provides the mean velocity and

Dynamic evolution of Geranium mitochondrial genomes through multiple horizontal and intracellular gene transfers.

Science.gov (United States)

Park, Seongjun; Grewe, Felix; Zhu, Andan; Ruhlman, Tracey A; Sabir, Jamal; Mower, Jeffrey P; Jansen, Robert K

2015-10-01

The exchange of genetic material between cellular organelles through intracellular gene transfer (IGT) or between species by horizontal gene transfer (HGT) has played an important role in plant mitochondrial genome evolution. The mitochondrial genomes of Geraniaceae display a number of unusual phenomena including highly accelerated rates of synonymous substitutions, extensive gene loss and reduction in RNA editing. Mitochondrial DNA sequences assembled for 17 species of Geranium revealed substantial reduction in gene and intron content relative to the ancestor of the Geranium lineage. Comparative analyses of nuclear transcriptome data suggest that a number of these sequences have been functionally relocated to the nucleus via IGT. Evidence for rampant HGT was detected in several Geranium species containing foreign organellar DNA from diverse eudicots, including many transfers from parasitic plants. One lineage has experienced multiple, independent HGT episodes, many of which occurred within the past 5.5 Myr. Both duplicative and recapture HGT were documented in Geranium lineages. The mitochondrial genome of Geranium brycei contains at least four independent HGT tracts that are absent in its nearest relative. Furthermore, G. brycei mitochondria carry two copies of the cox1 gene that differ in intron content, providing insight into contrasting hypotheses on cox1 intron evolution. © 2015 The Authors. New Phytologist © 2015 New Phytologist Trust.

Causal gene identification using combinatorial V-structure search.

Science.gov (United States)

Cai, Ruichu; Zhang, Zhenjie; Hao, Zhifeng

2013-07-01

With the advances of biomedical techniques in the last decade, the costs of human genomic sequencing and genomic activity monitoring are coming down rapidly. To support the huge genome-based business in the near future, researchers are eager to find killer applications based on human genome information. Causal gene identification is one of the most promising applications, which may help the potential patients to estimate the risk of certain genetic diseases and locate the target gene for further genetic therapy. Unfortunately, existing pattern recognition techniques, such as Bayesian networks, cannot be directly applied to find the accurate causal relationship between genes and diseases. This is mainly due to the insufficient number of samples and the extremely high dimensionality of the gene space. In this paper, we present the first practical solution to causal gene identification, utilizing a new combinatorial formulation over V-Structures commonly used in conventional Bayesian networks, by exploring the combinations of significant V-Structures. We prove the NP-hardness of the combinatorial search problem under a general settings on the significance measure on the V-Structures, and present a greedy algorithm to find sub-optimal results. Extensive experiments show that our proposal is both scalable and effective, particularly with interesting findings on the causal genes over real human genome data. Copyright © 2013 Elsevier Ltd. All rights reserved.

A combinatorial approach to the design of vaccines.

Science.gov (United States)

Martínez, Luis; Milanič, Martin; Legarreta, Leire; Medvedev, Paul; Malaina, Iker; de la Fuente, Ildefonso M

2015-05-01

We present two new problems of combinatorial optimization and discuss their applications to the computational design of vaccines. In the shortest λ-superstring problem, given a family S1,...,S(k) of strings over a finite alphabet, a set Τ of "target" strings over that alphabet, and an integer λ, the task is to find a string of minimum length containing, for each i, at least λ target strings as substrings of S(i). In the shortest λ-cover superstring problem, given a collection X1,...,X(n) of finite sets of strings over a finite alphabet and an integer λ, the task is to find a string of minimum length containing, for each i, at least λ elements of X(i) as substrings. The two problems are polynomially equivalent, and the shortest λ-cover superstring problem is a common generalization of two well known combinatorial optimization problems, the shortest common superstring problem and the set cover problem. We present two approaches to obtain exact or approximate solutions to the shortest λ-superstring and λ-cover superstring problems: one based on integer programming, and a hill-climbing algorithm. An application is given to the computational design of vaccines and the algorithms are applied to experimental data taken from patients infected by H5N1 and HIV-1.

Combinatorial therapy discovery using mixed integer linear programming.

Science.gov (United States)

Pang, Kaifang; Wan, Ying-Wooi; Choi, William T; Donehower, Lawrence A; Sun, Jingchun; Pant, Dhruv; Liu, Zhandong

2014-05-15

Combinatorial therapies play increasingly important roles in combating complex diseases. Owing to the huge cost associated with experimental methods in identifying optimal drug combinations, computational approaches can provide a guide to limit the search space and reduce cost. However, few computational approaches have been developed for this purpose, and thus there is a great need of new algorithms for drug combination prediction. Here we proposed to formulate the optimal combinatorial therapy problem into two complementary mathematical algorithms, Balanced Target Set Cover (BTSC) and Minimum Off-Target Set Cover (MOTSC). Given a disease gene set, BTSC seeks a balanced solution that maximizes the coverage on the disease genes and minimizes the off-target hits at the same time. MOTSC seeks a full coverage on the disease gene set while minimizing the off-target set. Through simulation, both BTSC and MOTSC demonstrated a much faster running time over exhaustive search with the same accuracy. When applied to real disease gene sets, our algorithms not only identified known drug combinations, but also predicted novel drug combinations that are worth further testing. In addition, we developed a web-based tool to allow users to iteratively search for optimal drug combinations given a user-defined gene set. Our tool is freely available for noncommercial use at http://www.drug.liuzlab.org/. zhandong.liu@bcm.edu Supplementary data are available at Bioinformatics online.

AS3MT-mediated tolerance to arsenic evolved by multiple independent horizontal gene transfers from bacteria to eukaryotes

DEFF Research Database (Denmark)

Palmgren, Michael; Engström, Karin; Hallström, Björn M.

2017-01-01

the evolutionary origin of AS3MT and assessed the ability of different genotypes to produce methylated arsenic metabolites. Phylogenetic analysis suggests that multiple, independent horizontal gene transfers between different bacteria, and from bacteria to eukaryotes, increased tolerance to environmental arsenic...

A Quantitative and Combinatorial Approach to Non-Linear Meanings of Multiplication

Science.gov (United States)

Tillema, Erik; Gatza, Andrew

2016-01-01

We provide a conceptual analysis of how combinatorics problems have the potential to support students to establish non-linear meanings of multiplication (NLMM). The problems we analyze we have used in a series of studies with 6th, 8th, and 10th grade students. We situate the analysis in prior work on students' quantitative and multiplicative…

A Combinatorial Proof of a Result on Generalized Lucas Polynomials

Directory of Open Access Journals (Sweden)

Laugier Alexandre

2016-09-01

Full Text Available We give a combinatorial proof of an elementary property of generalized Lucas polynomials, inspired by [1]. These polynomials in s and t are defined by the recurrence relation 〈n〉 = s〈n-1〉+t〈n-2〉 for n ≥ 2. The initial values are 〈0〉 = 2; 〈1〉= s, respectively.

Combinatorial interpretation of Haldane-Wu fractional exclusion statistics.

Science.gov (United States)

Aringazin, A K; Mazhitov, M I

2002-08-01

Assuming that the maximal allowed number of identical particles in a state is an integer parameter, q, we derive the statistical weight and analyze the associated equation that defines the statistical distribution. The derived distribution covers Fermi-Dirac and Bose-Einstein ones in the particular cases q=1 and q--> infinity (n(i)/q-->1), respectively. We show that the derived statistical weight provides a natural combinatorial interpretation of Haldane-Wu fractional exclusion statistics, and present exact solutions of the distribution equation.

Combinatorial Models for Assembly and Decomposition of Products

OpenAIRE

A. N. Bojko

2015-01-01

The paper discusses the most popular combinatorial models that are used for the synthesis of design solutions at the stage of the assembly process flow preparation. It shows that while assembling the product the relations of parts can be represented as a structure of preferences, which is formed on the basis of objective design restrictions put in at the stage of the product design. This structure is a binary preference relation pre-order. Its symmetrical part is equivalence and describes the...

Mixture-based combinatorial libraries from small individual peptide libraries: a case study on α1-antitrypsin deficiency.

Science.gov (United States)

Chang, Yi-Pin; Chu, Yen-Ho

2014-05-16

The design, synthesis and screening of diversity-oriented peptide libraries using a "libraries from libraries" strategy for the development of inhibitors of α1-antitrypsin deficiency are described. The major buttress of the biochemical approach presented here is the use of well-established solid-phase split-and-mix method for the generation of mixture-based libraries. The combinatorial technique iterative deconvolution was employed for library screening. While molecular diversity is the general consideration of combinatorial libraries, exquisite design through systematic screening of small individual libraries is a prerequisite for effective library screening and can avoid potential problems in some cases. This review will also illustrate how large peptide libraries were designed, as well as how a conformation-sensitive assay was developed based on the mechanism of the conformational disease. Finally, the combinatorially selected peptide inhibitor capable of blocking abnormal protein aggregation will be characterized by biophysical, cellular and computational methods.

Editorial: Cologne/Twente workshop on graphs and combinatorial optimization CTW 2007

NARCIS (Netherlands)

Faigle, U.; Hurink, Johann L.

2010-01-01

The 6th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2007) was held at the University of Twente, The Netherlands, 29-31 May, 2007. The CTW started as a series of biennial meetings at the Universities of Cologne in Germany and Twente in the Netherlands. Ever increasing

Towards single embryo transfer? Modelling clinical outcomes of potential treatment choices using multiple data sources: predictive models and patient perspectives.

Science.gov (United States)

Roberts, Sa; McGowan, L; Hirst, Wm; Brison, Dr; Vail, A; Lieberman, Ba

2010-07-01

In vitro fertilisation (IVF) treatments involve an egg retrieval process, fertilisation and culture of the resultant embryos in the laboratory, and the transfer of embryos back to the mother over one or more transfer cycles. The first transfer is usually of fresh embryos and the remainder may be cryopreserved for future frozen cycles. Most commonly in UK practice two embryos are transferred (double embryo transfer, DET). IVF techniques have led to an increase in the number of multiple births, carrying an increased risk of maternal and infant morbidity. The UK Human Fertilisation and Embryology Authority (HFEA) has adopted a multiple birth minimisation strategy. One way of achieving this would be by increased use of single embryo transfer (SET). To collate cohort data from treatment centres and the HFEA; to develop predictive models for live birth and twinning probabilities from fresh and frozen embryo transfers and predict outcomes from treatment scenarios; to understand patients' perspectives and use the modelling results to investigate the acceptability of twin reduction policies. A multidisciplinary approach was adopted, combining statistical modelling with qualitative exploration of patients' perspectives: interviews were conducted with 27 couples at various stages of IVF treatment at both UK NHS and private clinics; datasets were collated of over 90,000 patients from the HFEA registry and nearly 9000 patients from five clinics, both over the period 2000-5; models were developed to determine live birth and twin outcomes and predict the outcomes of policies for selecting patients for SET or DET in the fresh cycle following egg retrieval and fertilisation, and the predictions were used in simulations of treatments; two focus groups were convened, one NHS and one web based on a patient organisation's website, to present the results of the statistical analyses and explore potential treatment policies. The statistical analysis revealed no characteristics that

Hierarchical Bayesian mixture modelling for antigen-specific T-cell subtyping in combinatorially encoded flow cytometry studies

DEFF Research Database (Denmark)

Lin, Lin; Chan, Cliburn; Hadrup, Sine R

2013-01-01

subtype identification in this novel, general model framework, and provide a detailed example using simulated data. We then describe application to a data set from an experimental study of antigen-specific T-cell subtyping using combinatorially encoded assays in human blood samples. Summary comments...... profiling in many biological areas, traditional flow cytometry measures relative levels of abundance of marker proteins using fluorescently labeled tags that identify specific markers by a single-color. One specific and important recent development in this area is the use of combinatorial marker assays...

Particle Swarm Optimization applied to combinatorial problem aiming the fuel recharge problem solution in a nuclear reactor

International Nuclear Information System (INIS)

Meneses, Anderson Alvarenga de Moura; Schirru, Roberto

2005-01-01

This work focuses on the usage the Artificial Intelligence technique Particle Swarm Optimization (PSO) to optimize the fuel recharge at a nuclear reactor. This is a combinatorial problem, in which the search of the best feasible solution is done by minimizing a specific objective function. However, in this first moment it is possible to compare the fuel recharge problem with the Traveling Salesman Problem (TSP), since both of them are combinatorial, with one advantage: the evaluation of the TSP objective function is much more simple. Thus, the proposed methods have been applied to two TSPs: Oliver 30 and Rykel 48. In 1995, KENNEDY and EBERHART presented the PSO technique to optimize non-linear continued functions. Recently some PSO models for discrete search spaces have been developed for combinatorial optimization. Although all of them having different formulation from the ones presented here. In this paper, we use the PSO theory associated with to the Random Keys (RK)model, used in some optimizations with Genetic Algorithms. The Particle Swarm Optimization with Random Keys (PSORK) results from this association, which combines PSO and RK. The adaptations and changings in the PSO aim to allow the usage of the PSO at the nuclear fuel recharge. This work shows the PSORK being applied to the proposed combinatorial problem and the obtained results. (author)

Complexity and Tractability Islands for Combinatorial Auctions on Discrete Intervals with Gaps

NARCIS (Netherlands)

Döcker, J.; Dorn, B.; Endriss, U.; Krüger, D.; Kaminka, G.A.; Fox, M.; Bouquet, P.; Hüllermeyer, E.; Dignum, V.; Dignum, F.; van Harmelen, F.

2016-01-01

Combinatorial auctions are mechanisms for allocating bundles of goods to agents who each have preferences over these goods. Finding an economically efficient allocation, the so-called winner determination problem, is computationally intractable in the general case, which is why it is important to

A dynamical systems model for combinatorial cancer therapy enhances oncolytic adenovirus efficacy by MEK-inhibition.

Science.gov (United States)

Bagheri, Neda; Shiina, Marisa; Lauffenburger, Douglas A; Korn, W Michael

2011-02-01

Oncolytic adenoviruses, such as ONYX-015, have been tested in clinical trials for currently untreatable tumors, but have yet to demonstrate adequate therapeutic efficacy. The extent to which viruses infect targeted cells determines the efficacy of this approach but many tumors down-regulate the Coxsackievirus and Adenovirus Receptor (CAR), rendering them less susceptible to infection. Disrupting MAPK pathway signaling by pharmacological inhibition of MEK up-regulates CAR expression, offering possible enhanced adenovirus infection. MEK inhibition, however, interferes with adenovirus replication due to resulting G1-phase cell cycle arrest. Therefore, enhanced efficacy will depend on treatment protocols that productively balance these competing effects. Predictive understanding of how to attain and enhance therapeutic efficacy of combinatorial treatment is difficult since the effects of MEK inhibitors, in conjunction with adenovirus/cell interactions, are complex nonlinear dynamic processes. We investigated combinatorial treatment strategies using a mathematical model that predicts the impact of MEK inhibition on tumor cell proliferation, ONYX-015 infection, and oncolysis. Specifically, we fit a nonlinear differential equation system to dedicated experimental data and analyzed the resulting simulations for favorable treatment strategies. Simulations predicted enhanced combinatorial therapy when both treatments were applied simultaneously; we successfully validated these predictions in an ensuing explicit test study. Further analysis revealed that a CAR-independent mechanism may be responsible for amplified virus production and cell death. We conclude that integrated computational and experimental analysis of combinatorial therapy provides a useful means to identify treatment/infection protocols that yield clinically significant oncolysis. Enhanced oncolytic therapy has the potential to dramatically improve non-surgical cancer treatment, especially in locally advanced

COGEDIF - automatic TORT and DORT input generation from MORSE combinatorial geometry models

International Nuclear Information System (INIS)

Castelli, R.A.; Barnett, D.A.

1992-01-01

COGEDIF is an interactive utility which was developed to automate the preparation of two and three dimensional geometrical inputs for the ORNL-TORT and DORT discrete ordinates programs from complex three dimensional models described using the MORSE combinatorial geometry input description. The program creates either continuous or disjoint mesh input based upon the intersections of user defined meshing planes and the MORSE body definitions. The composition overlay of the combinatorial geometry is used to create the composition mapping of the discretized geometry based upon the composition found at the centroid of each of the mesh cells. This program simplifies the process of using discrete orthogonal mesh cells to represent non-orthogonal geometries in large models which require mesh sizes of the order of a million cells or more. The program was specifically written to take advantage of the new TORT disjoint mesh option which was developed at ORNL

From combinatorial optimization to real algebraic geometry and back

Directory of Open Access Journals (Sweden)

Janez Povh

2014-12-01

Full Text Available In this paper, we explain the relations between combinatorial optimization and real algebraic geometry with a special focus to the quadratic assignment problem. We demonstrate how to write a quadratic optimization problem over discrete feasible set as a linear optimization problem over the cone of completely positive matrices. The latter formulation enables a hierarchy of approximations which rely on results from polynomial optimization, a sub-eld of real algebraic geometry.

Indirect Optimization of Three-Dimensional Multiple-Impulse Moon-to-Earth Transfers

Science.gov (United States)

Shen, Hong-Xin; Casalino, Lorenzo

2014-11-01

This paper illustrates an indirect method to optimize multiple-impulse trajectories from circular lunar orbit to Earth. Optimization is performed in the circular restricted three-body problem, and the necessary optimality conditions are found through optimal control theory. In order to overcome the difficulty of initial adjoints estimation, a homotopic approach, which is based on an auxiliary optimization problem with known solution, is developed; this approach proves to be robust and efficient. Examples are presented for a range of lunar orbit orientations to assess the impact on velocity impulse requirements. Optimization results for trajectories with different number of impulses are also compared. The developed procedure can support fast and accurate evaluation of the transfer costs for Moon-to-Earth trajectories both in nominal conditions and for contingency plans.

Combinatorial discovery of new methanol-tolerant non-noble metal cathode electrocatalysts for direct methanol fuel cells.

Science.gov (United States)

Yu, Jong-Sung; Kim, Min-Sik; Kim, Jung Ho

2010-12-14

Combinatorial synthesis and screening were used to identify methanol-tolerant non-platinum cathode electrocatalysts for use in direct methanol fuel cells (DMFCs). Oxygen reduction consumes protons at the surface of DMFC cathode catalysts. In combinatorial screening, this pH change allows one to differentiate active catalysts using fluorescent acid-base indicators. Combinatorial libraries of carbon-supported catalyst compositions containing Ru, Mo, W, Sn, and Se were screened. Ternary and quaternary compositions containing Ru, Sn, Mo, Se were more active than the "standard" Alonso-Vante catalyst, Ru(3)Mo(0.08)Se(2), when tested in liquid-feed DMFCs. Physical characterization of the most active catalysts by powder X-ray diffraction, gas adsorption, and X-ray photoelectron spectroscopy revealed that the predominant crystalline phase was hexagonal close-packed (hcp) ruthenium, and showed a surface mostly covered with oxide. The best new catalyst, Ru(7.0)Sn(1.0)Se(1.0), was significantly more active than Ru(3)Se(2)Mo(0.08), even though the latter contained smaller particles.

Template-based combinatorial enumeration of virtual compound libraries for lipids.

Science.gov (United States)

Sud, Manish; Fahy, Eoin; Subramaniam, Shankar

2012-09-25

A variety of software packages are available for the combinatorial enumeration of virtual libraries for small molecules, starting from specifications of core scaffolds with attachments points and lists of R-groups as SMILES or SD files. Although SD files include atomic coordinates for core scaffolds and R-groups, it is not possible to control 2-dimensional (2D) layout of the enumerated structures generated for virtual compound libraries because different packages generate different 2D representations for the same structure. We have developed a software package called LipidMapsTools for the template-based combinatorial enumeration of virtual compound libraries for lipids. Virtual libraries are enumerated for the specified lipid abbreviations using matching lists of pre-defined templates and chain abbreviations, instead of core scaffolds and lists of R-groups provided by the user. 2D structures of the enumerated lipids are drawn in a specific and consistent fashion adhering to the framework for representing lipid structures proposed by the LIPID MAPS consortium. LipidMapsTools is lightweight, relatively fast and contains no external dependencies. It is an open source package and freely available under the terms of the modified BSD license.

Combinatorial One-Pot Synthesis of Poly-N-acetyllactosamine Oligosaccharides with Leloir-Glycosyltransferases

Czech Academy of Sciences Publication Activity Database

Rech, C.; Rosencrantz, R. R.; Křenek, Karel; Pelantová, Helena; Bojarová, Pavla; Roemer, Ch. E.; Hanisch, F.-G.; Křen, Vladimír; Elling, L.

2011-01-01

Roč. 353, č. 13 (2011), s. 2492-2500 ISSN 1615-4150 R&D Projects: GA MŠk OC09045 Institutional research plan: CEZ:AV0Z50200510 Keywords : combinatorial chemistry * biocatalysis * carbohydrates Subject RIV: CC - Organic Chemistry Impact factor: 6.048, year: 2011

A model-based combinatorial optimisation approach for energy-efficient processing of microalgae

NARCIS (Netherlands)

Slegers, P.M.; Koetzier, B.J.; Fasaei, F.; Wijffels, R.H.; Straten, van G.; Boxtel, van A.J.B.

2014-01-01

The analyses of algae biorefinery performance are commonly based on fixed performance data for each processing step. In this work, we demonstrate a model-based combinatorial approach to derive the design-specific upstream energy consumption and biodiesel yield in the production of biodiesel from

Combinatorial synthesis of oxazol-thiazole bis-heterocyclic compounds.

Science.gov (United States)

Murru, Siva; Nefzi, Adel

2014-01-13

A combinatorial library of novel oxazol-thiazole bis-heterocycles was synthesized in good to excellent overall yields with high purity using a solution and solid-phase parallel synthesis approach. Oxazole amino acids, prepared from serine methyl ester and amino acids via coupling and cyclodehydration, were treated with Fmoc-NCS and α-haloketones for the parallel synthesis of diverse bis-heterocycles. Fmoc-isothiocyanate is used as a traceless reagent for thiazole formation. Oxazole diversity can be achieved by using variety of amino acids, whereas thiazole diversity is produced with various haloketones.

Proceedings of the 8th Nordic Combinatorial Conference

DEFF Research Database (Denmark)

Geil, Olav; Andersen, Lars Døvling

The Nordic Combinatorial Conferences were initiated in 1981 by mathematicians from Stavanger. Held approximately every three years since then, the conferences have been able to sustain the interest from combinatorialists all over the Nordic countries. In 2004 the 8th conference is held in Aalborg......, Denmark. We are pleased that so many people have chosen to attend, and that lectures were offered from more participants than we had originally reserved time for. We asked two mathematicians to give special lectures and are happy that both accepted immediately. Andries Brouwer from the Technical...

Estimating meme fitness in adaptive memetic algorithms for combinatorial problems.

Science.gov (United States)

Smith, J E

2012-01-01

Among the most promising and active research areas in heuristic optimisation is the field of adaptive memetic algorithms (AMAs). These gain much of their reported robustness by adapting the probability with which each of a set of local improvement operators is applied, according to an estimate of their current value to the search process. This paper addresses the issue of how the current value should be estimated. Assuming the estimate occurs over several applications of a meme, we consider whether the extreme or mean improvements should be used, and whether this aggregation should be global, or local to some part of the solution space. To investigate these issues, we use the well-established COMA framework that coevolves the specification of a population of memes (representing different local search algorithms) alongside a population of candidate solutions to the problem at hand. Two very different memetic algorithms are considered: the first using adaptive operator pursuit to adjust the probabilities of applying a fixed set of memes, and a second which applies genetic operators to dynamically adapt and create memes and their functional definitions. For the latter, especially on combinatorial problems, credit assignment mechanisms based on historical records, or on notions of landscape locality, will have limited application, and it is necessary to estimate the value of a meme via some form of sampling. The results on a set of binary encoded combinatorial problems show that both methods are very effective, and that for some problems it is necessary to use thousands of variables in order to tease apart the differences between different reward schemes. However, for both memetic algorithms, a significant pattern emerges that reward based on mean improvement is better than that based on extreme improvement. This contradicts recent findings from adapting the parameters of operators involved in global evolutionary search. The results also show that local reward schemes

Dynamic Hierarchical Energy-Efficient Method Based on Combinatorial Optimization for Wireless Sensor Networks.

Science.gov (United States)

Chang, Yuchao; Tang, Hongying; Cheng, Yongbo; Zhao, Qin; Yuan, Baoqing Li andXiaobing

2017-07-19

Routing protocols based on topology control are significantly important for improving network longevity in wireless sensor networks (WSNs). Traditionally, some WSN routing protocols distribute uneven network traffic load to sensor nodes, which is not optimal for improving network longevity. Differently to conventional WSN routing protocols, we propose a dynamic hierarchical protocol based on combinatorial optimization (DHCO) to balance energy consumption of sensor nodes and to improve WSN longevity. For each sensor node, the DHCO algorithm obtains the optimal route by establishing a feasible routing set instead of selecting the cluster head or the next hop node. The process of obtaining the optimal route can be formulated as a combinatorial optimization problem. Specifically, the DHCO algorithm is carried out by the following procedures. It employs a hierarchy-based connection mechanism to construct a hierarchical network structure in which each sensor node is assigned to a special hierarchical subset; it utilizes the combinatorial optimization theory to establish the feasible routing set for each sensor node, and takes advantage of the maximum-minimum criterion to obtain their optimal routes to the base station. Various results of simulation experiments show effectiveness and superiority of the DHCO algorithm in comparison with state-of-the-art WSN routing algorithms, including low-energy adaptive clustering hierarchy (LEACH), hybrid energy-efficient distributed clustering (HEED), genetic protocol-based self-organizing network clustering (GASONeC), and double cost function-based routing (DCFR) algorithms.

Asymmetric proteome equalization of the skeletal muscle proteome using a combinatorial hexapeptide library.

Directory of Open Access Journals (Sweden)

Jenny Rivers

Full Text Available Immobilized combinatorial peptide libraries have been advocated as a strategy for equalization of the dynamic range of a typical proteome. The technology has been applied predominantly to blood plasma and other biological fluids such as urine, but has not been used extensively to address the issue of dynamic range in tissue samples. Here, we have applied the combinatorial library approach to the equalization of a tissue where there is also a dramatic asymmetry in the range of abundances of proteins; namely, the soluble fraction of skeletal muscle. We have applied QconCAT and label-free methodology to the quantification of the proteins that bind to the beads as the loading is progressively increased. Although some equalization is achieved, and the most abundant proteins no longer dominate the proteome analysis, at high protein loadings a new asymmetry of protein expression is reached, consistent with the formation of complex assembles of heat shock proteins, cytoskeletal elements and other proteins on the beads. Loading at different ionic strength values leads to capture of different subpopulations of proteins, but does not completely eliminate the bias in protein accumulation. These assemblies may impair the broader utility of combinatorial library approaches to the equalization of tissue proteomes. However, the asymmetry in equalization is manifest at either low and high ionic strength values but manipulation of the solvent conditions may extend the capacity of the method.

High-throughput combinatorial chemical bath deposition: The case of doping Cu (In, Ga) Se film with antimony

Science.gov (United States)

Yan, Zongkai; Zhang, Xiaokun; Li, Guang; Cui, Yuxing; Jiang, Zhaolian; Liu, Wen; Peng, Zhi; Xiang, Yong

2018-01-01

The conventional methods for designing and preparing thin film based on wet process remain a challenge due to disadvantages such as time-consuming and ineffective, which hinders the development of novel materials. Herein, we present a high-throughput combinatorial technique for continuous thin film preparation relied on chemical bath deposition (CBD). The method is ideally used to prepare high-throughput combinatorial material library with low decomposition temperatures and high water- or oxygen-sensitivity at relatively high-temperature. To check this system, a Cu(In, Ga)Se (CIGS) thin films library doped with 0-19.04 at.% of antimony (Sb) was taken as an example to evaluate the regulation of varying Sb doping concentration on the grain growth, structure, morphology and electrical properties of CIGS thin film systemically. Combined with the Energy Dispersive Spectrometer (EDS), X-ray Photoelectron Spectroscopy (XPS), automated X-ray Diffraction (XRD) for rapid screening and Localized Electrochemical Impedance Spectroscopy (LEIS), it was confirmed that this combinatorial high-throughput system could be used to identify the composition with the optimal grain orientation growth, microstructure and electrical properties systematically, through accurately monitoring the doping content and material composition. According to the characterization results, a Sb2Se3 quasi-liquid phase promoted CIGS film-growth model has been put forward. In addition to CIGS thin film reported here, the combinatorial CBD also could be applied to the high-throughput screening of other sulfide thin film material systems.

Combinatorial identities for Stirling numbers the unpublished notes of H. W. Gould

CERN Document Server

Quaintance, Jocelyn

2016-01-01

This book is a unique work which provides an in-depth exploration into the mathematical expertise, philosophy, and knowledge of H W Gould. It is written in a style that is accessible to the reader with basic mathematical knowledge, and yet contains material that will be of interest to the specialist in enumerative combinatorics. This book begins with exposition on the combinatorial and algebraic techniques that Professor Gould uses for proving binomial identities. These techniques are then applied to develop formulas which relate Stirling numbers of the second kind to Stirling numbers of the first kind. Professor Gould's techniques also provide connections between both types of Stirling numbers and Bernoulli numbers. Professor Gould believes his research success comes from his intuition on how to discover combinatorial identities.This book will appeal to a wide audience and may be used either as lecture notes for a beginning graduate level combinatorics class, or as a research supplement for the specialist in...

Bimonthly assessment of magnetization transfer magnetic resonance imaging parameters in multiple sclerosis: a 14-month, multicentre, follow-up study

NARCIS (Netherlands)

Mesaros, S.; Rocca, M.A.; Sormani, M.P.; Valsasina, P.; Markowitz, C.; De Stefano, N.; Montalban, X.; Barkhof, F.; Ranjeva, J.P.; Sailer, M.; Kappos, L.; Comi, G.; Filippi, M.

2010-01-01

This study was performed to assess the temporal evolution of damage within lesions and the normal-appearing white matter, measured using frequent magnetization transfer (MT) MRI, in relapsing-remitting multiple sclerosis (RRMS). The relationship of MT ratio (MTR) changes with measures of lesion

Performance analysis of demodulation with diversity -- A combinatorial approach I: Symmetric function theoretical methods

OpenAIRE

Jean-Louis Dornstetter; Daniel Krob; Jean-Yves Thibon; Ekaterina A. Vassilieva

2002-01-01

This paper is devoted to the presentation of a combinatorial approach, based on the theory of symmetric functions, for analyzing the performance of a family of demodulation methods used in mobile telecommunications.

Data Mining and Machine Learning Tools for Combinatorial Material Science of All-Oxide Photovoltaic Cells.

Science.gov (United States)

Yosipof, Abraham; Nahum, Oren E; Anderson, Assaf Y; Barad, Hannah-Noa; Zaban, Arie; Senderowitz, Hanoch

2015-06-01

Growth in energy demands, coupled with the need for clean energy, are likely to make solar cells an important part of future energy resources. In particular, cells entirely made of metal oxides (MOs) have the potential to provide clean and affordable energy if their power conversion efficiencies are improved. Such improvements require the development of new MOs which could benefit from combining combinatorial material sciences for producing solar cells libraries with data mining tools to direct synthesis efforts. In this work we developed a data mining workflow and applied it to the analysis of two recently reported solar cell libraries based on Titanium and Copper oxides. Our results demonstrate that QSAR models with good prediction statistics for multiple solar cells properties could be developed and that these models highlight important factors affecting these properties in accord with experimental findings. The resulting models are therefore suitable for designing better solar cells. © 2015 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Combinatorial Pharmacophore-Based 3D-QSAR Analysis and Virtual Screening of FGFR1 Inhibitors

Directory of Open Access Journals (Sweden)

Nannan Zhou

2015-06-01

Full Text Available The fibroblast growth factor/fibroblast growth factor receptor (FGF/FGFR signaling pathway plays crucial roles in cell proliferation, angiogenesis, migration, and survival. Aberration in FGFRs correlates with several malignancies and disorders. FGFRs have proved to be attractive targets for therapeutic intervention in cancer, and it is of high interest to find FGFR inhibitors with novel scaffolds. In this study, a combinatorial three-dimensional quantitative structure-activity relationship (3D-QSAR model was developed based on previously reported FGFR1 inhibitors with diverse structural skeletons. This model was evaluated for its prediction performance on a diverse test set containing 232 FGFR inhibitors, and it yielded a SD value of 0.75 pIC50 units from measured inhibition affinities and a Pearson’s correlation coefficient R2 of 0.53. This result suggests that the combinatorial 3D-QSAR model could be used to search for new FGFR1 hit structures and predict their potential activity. To further evaluate the performance of the model, a decoy set validation was used to measure the efficiency of the model by calculating EF (enrichment factor. Based on the combinatorial pharmacophore model, a virtual screening against SPECS database was performed. Nineteen novel active compounds were successfully identified, which provide new chemical starting points for further structural optimization of FGFR1 inhibitors.

Intrinsic information carriers in combinatorial dynamical systems

Science.gov (United States)

Harmer, Russ; Danos, Vincent; Feret, Jérôme; Krivine, Jean; Fontana, Walter

2010-09-01

Many proteins are composed of structural and chemical features—"sites" for short—characterized by definite interaction capabilities, such as noncovalent binding or covalent modification of other proteins. This modularity allows for varying degrees of independence, as the behavior of a site might be controlled by the state of some but not all sites of the ambient protein. Independence quickly generates a startling combinatorial complexity that shapes most biological networks, such as mammalian signaling systems, and effectively prevents their study in terms of kinetic equations—unless the complexity is radically trimmed. Yet, if combinatorial complexity is key to the system's behavior, eliminating it will prevent, not facilitate, understanding. A more adequate representation of a combinatorial system is provided by a graph-based framework of rewrite rules where each rule specifies only the information that an interaction mechanism depends on. Unlike reactions, which deal with molecular species, rules deal with patterns, i.e., multisets of molecular species. Although the stochastic dynamics induced by a collection of rules on a mixture of molecules can be simulated, it appears useful to capture the system's average or deterministic behavior by means of differential equations. However, expansion of the rules into kinetic equations at the level of molecular species is not only impractical, but conceptually indefensible. If rules describe bona fide patterns of interaction, molecular species are unlikely to constitute appropriate units of dynamics. Rather, we must seek aggregate variables reflective of the causal structure laid down by the rules. We call these variables "fragments" and the process of identifying them "fragmentation." Ideally, fragments are aspects of the system's microscopic population that the set of rules can actually distinguish on average; in practice, it may only be feasible to identify an approximation to this. Most importantly, fragments are

Intrinsic information carriers in combinatorial dynamical systems.

Science.gov (United States)

Harmer, Russ; Danos, Vincent; Feret, Jérôme; Krivine, Jean; Fontana, Walter

2010-09-01

Many proteins are composed of structural and chemical features--"sites" for short--characterized by definite interaction capabilities, such as noncovalent binding or covalent modification of other proteins. This modularity allows for varying degrees of independence, as the behavior of a site might be controlled by the state of some but not all sites of the ambient protein. Independence quickly generates a startling combinatorial complexity that shapes most biological networks, such as mammalian signaling systems, and effectively prevents their study in terms of kinetic equations-unless the complexity is radically trimmed. Yet, if combinatorial complexity is key to the system's behavior, eliminating it will prevent, not facilitate, understanding. A more adequate representation of a combinatorial system is provided by a graph-based framework of rewrite rules where each rule specifies only the information that an interaction mechanism depends on. Unlike reactions, which deal with molecular species, rules deal with patterns, i.e., multisets of molecular species. Although the stochastic dynamics induced by a collection of rules on a mixture of molecules can be simulated, it appears useful to capture the system's average or deterministic behavior by means of differential equations. However, expansion of the rules into kinetic equations at the level of molecular species is not only impractical, but conceptually indefensible. If rules describe bona fide patterns of interaction, molecular species are unlikely to constitute appropriate units of dynamics. Rather, we must seek aggregate variables reflective of the causal structure laid down by the rules. We call these variables "fragments" and the process of identifying them "fragmentation." Ideally, fragments are aspects of the system's microscopic population that the set of rules can actually distinguish on average; in practice, it may only be feasible to identify an approximation to this. Most importantly, fragments are

Strategies for Efficient Charge Separation and Transfer in Artificial Photosynthesis of Solar Fuels.

Science.gov (United States)

Xu, Yuxing; Li, Ailong; Yao, Tingting; Ma, Changtong; Zhang, Xianwen; Shah, Jafar Hussain; Han, Hongxian

2017-11-23

Converting sunlight to solar fuels by artificial photosynthesis is an innovative science and technology for renewable energy. Light harvesting, photogenerated charge separation and transfer (CST), and catalytic reactions are the three primary steps in the processes involved in the conversion of solar energy to chemical energy (SE-CE). Among the processes, CST is the key "energy pump and delivery" step in determining the overall solar-energy conversion efficiency. Efficient CST is always high priority in designing and assembling artificial photosynthesis systems for solar-fuel production. This Review not only introduces the fundamental strategies for CST but also the combinatory application of these strategies to five types of the most-investigated semiconductor-based artificial photosynthesis systems: particulate, Z-scheme, hybrid, photoelectrochemical, and photovoltaics-assisted systems. We show that artificial photosynthesis systems with high SE-CE efficiency can be rationally designed and constructed through combinatory application of these strategies, setting a promising blueprint for the future of solar fuels. © 2017 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

Combinatorial nanomedicines for colon cancer therapy.

Science.gov (United States)

Anitha, A; Maya, S; Sivaram, Amal J; Mony, U; Jayakumar, R

2016-01-01

Colon cancer is one of the major causes of cancer deaths worldwide. Even after surgical resection and aggressive chemotherapy, 50% of colorectal carcinoma patients develop recurrent disease. Thus, the rationale of developing new therapeutic approaches to improve the current chemotherapeutic regimen would be highly recommended. There are reports on the effectiveness of combination chemotherapy in colon cancer and it has been practiced in clinics for long time. These approaches are associated with toxic side effects. Later, the drug delivery research had shown the potential of nanoencapsulation techniques and active targeting as an effective method to improve the effectiveness of chemotherapy with less toxicity. This current focus article provides a brief analysis of the ongoing research in the colon cancer area using the combinatorial nanomedicines and its outcome. © 2015 Wiley Periodicals, Inc.

A combinatorial proof of Postnikov's identity and a generalized enumeration of labeled trees

OpenAIRE

Seo, Seunghyun

2004-01-01

In this paper, we give a simple combinatorial explanation of a formula of A. Postnikov relating bicolored rooted trees to bicolored binary trees. We also present generalized formulas for the number of labeled k-ary trees, rooted labeled trees, and labeled plane trees.

Parameter Estimation of Permanent Magnet Synchronous Motor Using Orthogonal Projection and Recursive Least Squares Combinatorial Algorithm

Directory of Open Access Journals (Sweden)

Iman Yousefi

2015-01-01

Full Text Available This paper presents parameter estimation of Permanent Magnet Synchronous Motor (PMSM using a combinatorial algorithm. Nonlinear fourth-order space state model of PMSM is selected. This model is rewritten to the linear regression form without linearization. Noise is imposed to the system in order to provide a real condition, and then combinatorial Orthogonal Projection Algorithm and Recursive Least Squares (OPA&RLS method is applied in the linear regression form to the system. Results of this method are compared to the Orthogonal Projection Algorithm (OPA and Recursive Least Squares (RLS methods to validate the feasibility of the proposed method. Simulation results validate the efficacy of the proposed algorithm.

Combinatorial Algorithms for Portfolio Optimization Problems - Case of Risk Moderate Investor

Science.gov (United States)

Juarna, A.

2017-03-01

Portfolio optimization problem is a problem of finding optimal combination of n stocks from N ≥ n available stocks that gives maximal aggregate return and minimal aggregate risk. In this paper given N = 43 from the IDX (Indonesia Stock Exchange) group of the 45 most-traded stocks, known as the LQ45, with p = 24 data of monthly returns for each stock, spanned over interval 2013-2014. This problem actually is a combinatorial one where its algorithm is constructed based on two considerations: risk moderate type of investor and maximum allowed correlation coefficient between every two eligible stocks. The main outputs resulted from implementation of the algorithms is a multiple curve of three portfolio’s attributes, e.g. the size, the ratio of return to risk, and the percentage of negative correlation coefficient for every two chosen stocks, as function of maximum allowed correlation coefficient between each two stocks. The output curve shows that the portfolio contains three stocks with ratio of return to risk at 14.57 if the maximum allowed correlation coefficient between every two eligible stocks is negative and contains 19 stocks with maximum allowed correlation coefficient 0.17 to get maximum ratio of return to risk at 25.48.

Performance analysis of demodulation with diversity -- A combinatorial approach I: Symmetric function theoretical methods

Directory of Open Access Journals (Sweden)

Jean-Louis Dornstetter

2002-12-01

Full Text Available This paper is devoted to the presentation of a combinatorial approach, based on the theory of symmetric functions, for analyzing the performance of a family of demodulation methods used in mobile telecommunications.

Multichannel transfer function with dimensionality reduction

KAUST Repository

Kim, Han Suk; Schulze, Jü rgen P.; Cone, Angela C.; Sosinsky, Gina E.; Martone, Maryann E.

2010-01-01

. Our new method provides a framework to combine multiple approaches and pushes the boundary of gradient-based transfer functions to multiple channels, while still keeping the dimensionality of transfer functions to a manageable level, i.e., a maximum

Ranked solutions to a class of combinatorial optimizations—with applications in mass spectrometry based peptide sequencing and a variant of directed paths in random media

Science.gov (United States)

Doerr, Timothy P.; Alves, Gelio; Yu, Yi-Kuo

2005-08-01

Typical combinatorial optimizations are NP-hard; however, for a particular class of cost functions the corresponding combinatorial optimizations can be solved in polynomial time using the transfer matrix technique or, equivalently, the dynamic programming approach. This suggests a way to efficiently find approximate solutions-find a transformation that makes the cost function as similar as possible to that of the solvable class. After keeping many high-ranking solutions using the approximate cost function, one may then re-assess these solutions with the full cost function to find the best approximate solution. Under this approach, it is important to be able to assess the quality of the solutions obtained, e.g., by finding the true ranking of the kth best approximate solution when all possible solutions are considered exhaustively. To tackle this statistical issue, we provide a systematic method starting with a scaling function generated from the finite number of high-ranking solutions followed by a convergent iterative mapping. This method, useful in a variant of the directed paths in random media problem proposed here, can also provide a statistical significance assessment for one of the most important proteomic tasks-peptide sequencing using tandem mass spectrometry data. For directed paths in random media, the scaling function depends on the particular realization of randomness; in the mass spectrometry case, the scaling function is spectrum-specific.

LDRD final report : robust analysis of large-scale combinatorial applications.

Energy Technology Data Exchange (ETDEWEB)

Carr, Robert D.; Morrison, Todd (University of Colorado, Denver, CO); Hart, William Eugene; Benavides, Nicolas L. (Santa Clara University, Santa Clara, CA); Greenberg, Harvey J. (University of Colorado, Denver, CO); Watson, Jean-Paul; Phillips, Cynthia Ann

2007-09-01

Discrete models of large, complex systems like national infrastructures and complex logistics frameworks naturally incorporate many modeling uncertainties. Consequently, there is a clear need for optimization techniques that can robustly account for risks associated with modeling uncertainties. This report summarizes the progress of the Late-Start LDRD 'Robust Analysis of Largescale Combinatorial Applications'. This project developed new heuristics for solving robust optimization models, and developed new robust optimization models for describing uncertainty scenarios.

Advances in bio-inspired computing for combinatorial optimization problems

CERN Document Server

Pintea, Camelia-Mihaela

2013-01-01

Advances in Bio-inspired Combinatorial Optimization Problems' illustrates several recent bio-inspired efficient algorithms for solving NP-hard problems.Theoretical bio-inspired concepts and models, in particular for agents, ants and virtual robots are described. Large-scale optimization problems, for example: the Generalized Traveling Salesman Problem and the Railway Traveling Salesman Problem, are solved and their results are discussed.Some of the main concepts and models described in this book are: inner rule to guide ant search - a recent model in ant optimization, heterogeneous sensitive a

IVF policy and global/local politics: the making of multiple-embryo transfer regulation in Taiwan.

Science.gov (United States)

Wu, Chia-Ling

2012-08-01

This paper analyzes the regulatory trajectory of multiple-embryo transfer in in-vitro fertilization (IVF) in Taiwan. Taking a latecomer to policy-making as the case, it argues the importance of conceptualizing the global/local dynamics in policy-making for assisted reproductive technology (ART). The conceptual framework is built upon recent literature on standardization, science policy, and global assemblage. I propose three interrelated features that reveal the "global in the local": (1) the power relationships among stakeholders, (2) the selected global form that involved actors drew upon, and (3) the re-contextualized assemblage made of local networks. Data included archives, interviews, and participant observation. In different historical periods the specific stakeholders selected different preferred global forms for Taiwan, such as Britain's code of ethics in the 1990s, the American guideline in the early 2000s, and the European trend in the mid-2000s. The global is heterogeneous. The failure to transfer the British regulation, the revision of the American guideline by adding one more embryo than it specified, and the gap between the cited European trend and the "no more than four" in Taiwan's 2007 Human Reproduction Law all show that the local network further transforms the selected global form, confining it to rhetoric only or tailoring it to local needs. Overall, Taiwanese practitioners successfully maintained their medical autonomy to build a 'flexible standardization'. Multiple pregnancy remains the most common health risk of IVF in Taiwan. Copyright © 2012 Elsevier Ltd. All rights reserved.

Dimensional feature weighting utilizing multiple kernel learning for single-channel talker location discrimination using the acoustic transfer function.

Science.gov (United States)

Takashima, Ryoichi; Takiguchi, Tetsuya; Ariki, Yasuo

2013-02-01

This paper presents a method for discriminating the location of the sound source (talker) using only a single microphone. In a previous work, the single-channel approach for discriminating the location of the sound source was discussed, where the acoustic transfer function from a user's position is estimated by using a hidden Markov model of clean speech in the cepstral domain. In this paper, each cepstral dimension of the acoustic transfer function is newly weighted, in order to obtain the cepstral dimensions having information that is useful for classifying the user's position. Then, this paper proposes a feature-weighting method for the cepstral parameter using multiple kernel learning, defining the base kernels for each cepstral dimension of the acoustic transfer function. The user's position is trained and classified by support vector machine. The effectiveness of this method has been confirmed by sound source (talker) localization experiments performed in different room environments.

Multiple mechanisms generate a universal scaling with dissipation for the air-water gas transfer velocity

Science.gov (United States)

Katul, Gabriel; Liu, Heping

2017-02-01

A large corpus of field and laboratory experiments support the finding that the water side transfer velocity kL of sparingly soluble gases near air-water interfaces scales as kL˜(νɛ)1/4, where ν is the kinematic water viscosity and ɛ is the mean turbulent kinetic energy dissipation rate. Originally predicted from surface renewal theory, this scaling appears to hold for marine and coastal systems and across many environmental conditions. It is shown that multiple approaches to representing the effects of turbulence on kL lead to this expression when the Kolmogorov microscale is assumed to be the most efficient transporting eddy near the interface. The approaches considered range from simplified surface renewal schemes with distinct models for renewal durations, scaling and dimensional considerations, and a new structure function approach derived using analogies between scalar and momentum transfer. The work offers a new perspective as to why the aforementioned 1/4 scaling is robust.

A combinatorial method for the vanishing of the Poisson brackets of an integrable Lotka-Volterra system

International Nuclear Information System (INIS)

Itoh, Yoshiaki

2009-01-01

The combinatorial method is useful to obtain conserved quantities for some nonlinear integrable systems, as an alternative to the Lax representation method. Here we extend the combinatorial method and introduce an elementary geometry to show the vanishing of the Poisson brackets of the Hamiltonian structure for a Lotka-Volterra system of competing species. We associate a set of points on a circle with a set of species of the Lotka-Volterra system, where the dominance relations between points are given by the dominance relations between the species. We associate each term of the conserved quantities with a subset of points on the circle, which simplifies to show the vanishing of the Poisson brackets

Solving Minimal Covering Location Problems with Single and Multiple Node Coverage

Directory of Open Access Journals (Sweden)

Darko DRAKULIĆ

2016-12-01

Full Text Available Location science represents a very attractiveresearch field in combinatorial optimization and it is in expansion in last five decades. The main objective of location problems is determining the best position for facilities in a given set of nodes.Location science includes techniques for modelling problemsand methods for solving them. This paper presents results of solving two types of minimal covering location problems, with single and multiple node coverage, by using CPLEX optimizer and Particle Swarm Optimization method.

Mechanisms Underlying the Delayed Activation of the Cap1 Transcription Factor in Candida albicans following Combinatorial Oxidative and Cationic Stress Important for Phagocytic Potency.

Science.gov (United States)

Kos, Iaroslava; Patterson, Miranda J; Znaidi, Sadri; Kaloriti, Despoina; da Silva Dantas, Alessandra; Herrero-de-Dios, Carmen M; d'Enfert, Christophe; Brown, Alistair J P; Quinn, Janet

2016-03-29

Following phagocytosis, microbes are exposed to an array of antimicrobial weapons that include reactive oxygen species (ROS) and cationic fluxes. This is significant as combinations of oxidative and cationic stresses are much more potent than the corresponding single stresses, triggering the synergistic killing of the fungal pathogenCandida albicansby "stress pathway interference." Previously we demonstrated that combinatorial oxidative plus cationic stress triggers a dramatic increase in intracellular ROS levels compared to oxidative stress alone. Here we show that activation of Cap1, the major regulator of antioxidant gene expression inC. albicans, is significantly delayed in response to combinatorial stress treatments and to high levels of H2O2 Cap1 is normally oxidized in response to H2O2; this masks the nuclear export sequence, resulting in the rapid nuclear accumulation of Cap1 and the induction of Cap1-dependent genes. Here we demonstrate that following exposure of cells to combinatorial stress or to high levels of H2O2, Cap1 becomes trapped in a partially oxidized form, Cap1(OX-1) Notably, Cap1-dependent gene expression is not induced when Cap1 is in this partially oxidized form. However, while Cap1(OX-1)readily accumulates in the nucleus and binds to target genes following high-H2O2stress, the nuclear accumulation of Cap1(OX-1)following combinatorial H2O2and NaCl stress is delayed due to a cationic stress-enhanced interaction with the Crm1 nuclear export factor. These findings define novel mechanisms that delay activation of the Cap1 transcription factor, thus preventing the rapid activation of the stress responses vital for the survival ofC. albicanswithin the host. Combinatorial stress-mediated synergistic killing represents a new unchartered area in the field of stress signaling. This phenomenon contrasts starkly with "stress cross-protection," where exposure to one stress protects against subsequent exposure to a different stress. Previously we

Multiple and dependent scattering by densely packed discrete spheres: Comparison of radiative transfer and Maxwell theory

International Nuclear Information System (INIS)

Ma, L.X.; Tan, J.Y.; Zhao, J.M.; Wang, F.Q.; Wang, C.A.

2017-01-01

The radiative transfer equation (RTE) has been widely used to deal with multiple scattering of light by sparsely and randomly distributed discrete particles. However, for densely packed particles, the RTE becomes questionable due to strong dependent scattering effects. This paper examines the accuracy of RTE by comparing with the exact electromagnetic theory. For an imaginary spherical volume filled with randomly distributed, densely packed spheres, the RTE is solved by the Monte Carlo method combined with the Percus–Yevick hard model to consider the dependent scattering effect, while the electromagnetic calculation is based on the multi-sphere superposition T-matrix method. The Mueller matrix elements of the system with different size parameters and volume fractions of spheres are obtained using both methods. The results verify that the RTE fails to deal with the systems with a high-volume fraction due to the dependent scattering effects. Apart from the effects of forward interference scattering and coherent backscattering, the Percus–Yevick hard sphere model shows good accuracy in accounting for the far-field interference effects for medium or smaller size parameters (up to 6.964 in this study). For densely packed discrete spheres with large size parameters (equals 13.928 in this study), the improvement of dependent scattering correction tends to deteriorate. The observations indicate that caution must be taken when using RTE in dealing with the radiative transfer in dense discrete random media even though the dependent scattering correction is applied. - Highlights: • The Muller matrix of randomly distributed, densely packed spheres are investigated. • The effects of multiple scattering and dependent scattering are analyzed. • The accuracy of radiative transfer theory for densely packed spheres is discussed. • Dependent scattering correction takes effect at medium size parameter or smaller. • Performance of dependent scattering correction

Rapid mapping of protein functional epitopes by combinatorial alanine scanning

OpenAIRE

Weiss, GA; Watanabe, CK; Zhong, A; Goddard, A; Sidhu, SS

2000-01-01

A combinatorial alanine-scanning strategy was used to determine simultaneously the functional contributions of 19 side chains buried at the interface between human growth hormone and the extracellular domain of its receptor. A phage-displayed protein library was constructed in which the 19 side chains were preferentially allowed to vary only as the wild type or alanine. The library pool was subjected to binding selections to isolate functional clones, and DNA sequencing was used to determine ...

Crossover versus Mutation: A Comparative Analysis of the Evolutionary Strategy of Genetic Algorithms Applied to Combinatorial Optimization Problems

Directory of Open Access Journals (Sweden)

E. Osaba

2014-01-01

Full Text Available Since their first formulation, genetic algorithms (GAs have been one of the most widely used techniques to solve combinatorial optimization problems. The basic structure of the GAs is known by the scientific community, and thanks to their easy application and good performance, GAs are the focus of a lot of research works annually. Although throughout history there have been many studies analyzing various concepts of GAs, in the literature there are few studies that analyze objectively the influence of using blind crossover operators for combinatorial optimization problems. For this reason, in this paper a deep study on the influence of using them is conducted. The study is based on a comparison of nine techniques applied to four well-known combinatorial optimization problems. Six of the techniques are GAs with different configurations, and the remaining three are evolutionary algorithms that focus exclusively on the mutation process. Finally, to perform a reliable comparison of these results, a statistical study of them is made, performing the normal distribution z-test.

Crossover versus Mutation: A Comparative Analysis of the Evolutionary Strategy of Genetic Algorithms Applied to Combinatorial Optimization Problems

Science.gov (United States)

Osaba, E.; Carballedo, R.; Diaz, F.; Onieva, E.; de la Iglesia, I.; Perallos, A.

2014-01-01

Since their first formulation, genetic algorithms (GAs) have been one of the most widely used techniques to solve combinatorial optimization problems. The basic structure of the GAs is known by the scientific community, and thanks to their easy application and good performance, GAs are the focus of a lot of research works annually. Although throughout history there have been many studies analyzing various concepts of GAs, in the literature there are few studies that analyze objectively the influence of using blind crossover operators for combinatorial optimization problems. For this reason, in this paper a deep study on the influence of using them is conducted. The study is based on a comparison of nine techniques applied to four well-known combinatorial optimization problems. Six of the techniques are GAs with different configurations, and the remaining three are evolutionary algorithms that focus exclusively on the mutation process. Finally, to perform a reliable comparison of these results, a statistical study of them is made, performing the normal distribution z-test. PMID:25165731

Combinatorial investigation of Pt-Ru-Sn alloys as an anode electrocatalysts for direct alcohol fuel cells

Energy Technology Data Exchange (ETDEWEB)

Chu, Young Hwan [Department of New Energy.Resource Engineering, College of Science and Engineering, Sangji University, 124, Sangjidae-gil, Wonju-si, Gangwon-Do 220-702 (Korea); Shul, Yong Gun [Department of Chemical and Biomolecular Engineering, Yonsei University, 134, Shinchon-Dong, Seodaemun-Gu, Seoul 120-749 (Korea)

2010-10-15

Low-temperature direct alcohol fuel cells fed with different kinds of alcohol (methanol, ethanol and 2-propanol) have been investigated by employing ternary electrocatalysts (Pt-Ru-Sn) as anode catalysts. Combinatorial chemistry has been applied to screen the 66-PtRuSn-anode arrays at the same time to reduce cost, time, and effort when we select the optimum composition of electrocatalysts for DAFCs (Direct Alcohol Fuel Cells). PtRuSn (80:20:0) showed the lowest onset potential for methanol electro-oxidation, PtRuSn (50:0:50) for ethanol, and PtRuSn (20:70:10) for 2-propanol in CV results respectively, and single cell performance test indicated that Ru is more suitable for direct methanol fuel cell system, Sn for direct ethanol fuel cell system, and 2-propanol could be applied as fuel with low platinum composition anode electrocatalyst. The single cell performance results and electrochemical results (CV) were well matched with the combinatorial electrochemical results. As a result, we could verify the availability of combinatorial chemistry by comparing the results of each extreme electrocatalysts compositions as follows: PtRuSn (80:20:0) for methanol, PtRuSn (50:0:50) for ethanol and PtRuSn (20:70:10) for 2-propanol. (author)

A complete characterization of the (m,n-cubes and combinatorial applications in imaging, vision and discrete geometry

Directory of Open Access Journals (Sweden)

Daniel Khoshnoudirad

2015-11-01

Full Text Available The aim of this work is to provide a complete characterization of a (m,n-cube. The latter are the pieces of discrete planes appearing in Theoretical Computer Science, Discrete Geometry and Combinatorics. This characterization in three dimensions is the exact equivalent of the preimage for a discrete segment as it has been introduced by McIlroy. Further this characterization, which avoids the redundancies, reduces the combinatorial problem of determining the cardinality of the (m,n-cubes to a new combinatorial problem consisting of determining the volumic regions formed by the crossing of planes. This work can find applications in Imaging, Vision, and pattern recognition for instance.

Combining on-chip synthesis of a focused combinatorial library with computational target prediction reveals imidazopyridine GPCR ligands.

Science.gov (United States)

Reutlinger, Michael; Rodrigues, Tiago; Schneider, Petra; Schneider, Gisbert

2014-01-07

Using the example of the Ugi three-component reaction we report a fast and efficient microfluidic-assisted entry into the imidazopyridine scaffold, where building block prioritization was coupled to a new computational method for predicting ligand-target associations. We identified an innovative GPCR-modulating combinatorial chemotype featuring ligand-efficient adenosine A1/2B and adrenergic α1A/B receptor antagonists. Our results suggest the tight integration of microfluidics-assisted synthesis with computer-based target prediction as a viable approach to rapidly generate bioactivity-focused combinatorial compound libraries with high success rates. Copyright © 2014 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Combinatorial study of WInZnO films deposited by rf magnetron co-sputtering

International Nuclear Information System (INIS)

Oh, Byeong-Yun; Park, Jae-Cheol; Lee, Young-Jun; Cha, Sang-Jun; Kim, Joo-Hyung; Kim, Kwang-Young; Kim, Tae-Won; Heo, Gi-Seok

2011-01-01

The compositional dependence of co-sputtered tungsten indium zinc oxide (WInZnO) film properties was first investigated by means of a combinatorial technique. Indium zinc oxide (IZO) and WO 3 targets were used with different target power. W composition ratio [W/(In+Zn+W)] was varied between 3 and 30 at% and film thickness was reduced as the sample position moved toward WO 3 target. Furthermore, the optical bandgap energy increased gradually, which might be affected by the reduction in film thickness. All the WInZnO films showed an amorphous phase regardless of the W/(In+Zn+W) ratio. As the W/(In+Zn+W) ratio in WInZnO films increased, the carrier concentration was restricted, causing the increase in electrical resistivity. W cations worked as oxygen binders in determining the electronic properties, resulting in suppressing the formation of oxygen vacancies. Consequentially, W metal cations were effectively incorporated into the WInZnO films as a suppressor against the oxygen vacancies and the carrier generation by employing the combinatorial technique. - Graphical abstract: The film thickness and the sheet resistance (R s ) with respect to the sample position of WInZnO films, which is compositionally graded by rf power for each target, are exhibited. Highlights: → The compositional dependence of co-sputtered WInZnO film properties is first investigated. → W cations work as oxygen binders in determining the electronic properties. → All the WInZnO films show an amorphous phase regardless of the W/(In+Zn+W) ratio. → W metal cations are effectively incorporated into the WInZnO films by the combinatorial technique.

Gaussian variable neighborhood search for the file transfer scheduling problem

Directory of Open Access Journals (Sweden)

Dražić Zorica

2016-01-01

Full Text Available This paper presents new modifications of Variable Neighborhood Search approach for solving the file transfer scheduling problem. To obtain better solutions in a small neighborhood of a current solution, we implement two new local search procedures. As Gaussian Variable Neighborhood Search showed promising results when solving continuous optimization problems, its implementation in solving the discrete file transfer scheduling problem is also presented. In order to apply this continuous optimization method to solve the discrete problem, mapping of uncountable set of feasible solutions into a finite set is performed. Both local search modifications gave better results for the large size instances, as well as better average performance for medium and large size instances. One local search modification achieved significant acceleration of the algorithm. The numerical experiments showed that the results obtained by Gaussian modifications are comparable with the results obtained by standard VNS based algorithms, developed for combinatorial optimization. In some cases Gaussian modifications gave even better results. [Projekat Ministarstava nauke Republike Srbije, br. 174010

Single agent and synergistic combinatorial efficacy of first-in-class small molecule imipridone ONC201 in hematological malignancies.

Science.gov (United States)

Prabhu, Varun V; Talekar, Mala K; Lulla, Amriti R; Kline, C Leah B; Zhou, Lanlan; Hall, Junior; Van den Heuvel, A Pieter J; Dicker, David T; Babar, Jawad; Grupp, Stephan A; Garnett, Mathew J; McDermott, Ultan; Benes, Cyril H; Pu, Jeffrey J; Claxton, David F; Khan, Nadia; Oster, Wolfgang; Allen, Joshua E; El-Deiry, Wafik S

2018-01-01

ONC201, founding member of the imipridone class of small molecules, is currently being evaluated in advancer cancer clinical trials. We explored single agent and combinatorial efficacy of ONC201 in preclinical models of hematological malignancies. ONC201 demonstrated (GI50 1-8 µM) dose- and time-dependent efficacy in acute myeloid leukemia (AML), acute lymphoblastic leukemia (ALL), chronic myelogenous leukemia (CML), chronic lymphocytic leukemia (CLL), diffuse large B-cell lymphoma (DLBCL), mantle cell lymphoma (MCL), Burkitt's lymphoma, anaplastic large cell lymphoma (ALCL), cutaneous T-cell lymphoma (CTCL), Hodgkin's lymphoma (nodular sclerosis) and multiple myeloma (MM) cell lines including cells resistant to standard of care (dexamethasone in MM) and primary samples. ONC201 induced caspase-dependent apoptosis that involved activation of the integrated stress response (ATF4/CHOP) pathway, inhibition of Akt phosphorylation, Foxo3a activation, downregulation of cyclin D1, IAP and Bcl-2 family members. ONC201 synergistically reduced cell viability in combination with cytarabine and 5-azacytidine in AML cells. ONC201 combined with cytarabine in a Burkitt's lymphoma xenograft model induced tumor growth inhibition that was superior to either agent alone. ONC201 synergistically combined with bortezomib in MM, MCL and ALCL cells and with ixazomib or dexamethasone in MM cells. ONC201 combined with bortezomib in a Burkitt's lymphoma xenograft model reduced tumor cell density and improved CHOP induction compared to either agent alone. These results serve as a rationale for ONC201 single-agent trials in relapsed/refractory acute leukemia, non-Hodgkin's lymphoma, MM and combination trial with dexamethasone in MM, provide pharmacodynamic biomarkers and identify further synergistic combinatorial regimens that can be explored in the clinic.

Dissection of combinatorial control by the Met4 transcriptional complex.

Science.gov (United States)

Lee, Traci A; Jorgensen, Paul; Bognar, Andrew L; Peyraud, Caroline; Thomas, Dominique; Tyers, Mike

2010-02-01

Met4 is the transcriptional activator of the sulfur metabolic network in Saccharomyces cerevisiae. Lacking DNA-binding ability, Met4 must interact with proteins called Met4 cofactors to target promoters for transcription. Two types of DNA-binding cofactors (Cbf1 and Met31/Met32) recruit Met4 to promoters and one cofactor (Met28) stabilizes the DNA-bound Met4 complexes. To dissect this combinatorial system, we systematically deleted each category of cofactor(s) and analyzed Met4-activated transcription on a genome-wide scale. We defined a core regulon for Met4, consisting of 45 target genes. Deletion of both Met31 and Met32 eliminated activation of the core regulon, whereas loss of Met28 or Cbf1 interfered with only a subset of targets that map to distinct sectors of the sulfur metabolic network. These transcriptional dependencies roughly correlated with the presence of Cbf1 promoter motifs. Quantitative analysis of in vivo promoter binding properties indicated varying levels of cooperativity and interdependency exists between members of this combinatorial system. Cbf1 was the only cofactor to remain fully bound to target promoters under all conditions, whereas other factors exhibited different degrees of regulated binding in a promoter-specific fashion. Taken together, Met4 cofactors use a variety of mechanisms to allow differential transcription of target genes in response to various cues.

Discovery of Antibiotics-derived Polymers for Gene Delivery using Combinatorial Synthesis and Cheminformatics Modeling

Science.gov (United States)

Potta, Thrimoorthy; Zhen, Zhuo; Grandhi, Taraka Sai Pavan; Christensen, Matthew D.; Ramos, James; Breneman, Curt M.; Rege, Kaushal

2014-01-01

We describe the combinatorial synthesis and cheminformatics modeling of aminoglycoside antibiotics-derived polymers for transgene delivery and expression. Fifty-six polymers were synthesized by polymerizing aminoglycosides with diglycidyl ether cross-linkers. Parallel screening resulted in identification of several lead polymers that resulted in high transgene expression levels in cells. The role of polymer physicochemical properties in determining efficacy of transgene expression was investigated using Quantitative Structure-Activity Relationship (QSAR) cheminformatics models based on Support Vector Regression (SVR) and ‘building block’ polymer structures. The QSAR model exhibited high predictive ability, and investigation of descriptors in the model, using molecular visualization and correlation plots, indicated that physicochemical attributes related to both, aminoglycosides and diglycidyl ethers facilitated transgene expression. This work synergistically combines combinatorial synthesis and parallel screening with cheminformatics-based QSAR models for discovery and physicochemical elucidation of effective antibiotics-derived polymers for transgene delivery in medicine and biotechnology. PMID:24331709

Combinatorial chemistry has matured in the last three decades: dedicated to Professor Árpád Furka on the occasion of his 80th birthday.

Science.gov (United States)

Dibó, Gábor

2012-02-01

Combinatorial chemistry was introduced in the 1980s. It provided the possibility to produce new compounds in practically unlimited number. New strategies and technologies have also been developed that made it possible to screen very large number of compounds and to identify useful components in mixtures containing millions of different substances. This dramatically changed the drug discovery process and the way of thinking of synthetic chemists. In addition, combinatorial strategies became useful in areas such as pharmaceutical research, agrochemistry, catalyst design, and materials research. Prof. Árpád Furka is one of the pioneers of combinatorial chemistry.

Combinatorial development of antibacterial Zr-Cu-Al-Ag thin film metallic glasses.

Science.gov (United States)

Liu, Yanhui; Padmanabhan, Jagannath; Cheung, Bettina; Liu, Jingbei; Chen, Zheng; Scanley, B Ellen; Wesolowski, Donna; Pressley, Mariyah; Broadbridge, Christine C; Altman, Sidney; Schwarz, Udo D; Kyriakides, Themis R; Schroers, Jan

2016-05-27

Metallic alloys are normally composed of multiple constituent elements in order to achieve integration of a plurality of properties required in technological applications. However, conventional alloy development paradigm, by sequential trial-and-error approach, requires completely unrelated strategies to optimize compositions out of a vast phase space, making alloy development time consuming and labor intensive. Here, we challenge the conventional paradigm by proposing a combinatorial strategy that enables parallel screening of a multitude of alloys. Utilizing a typical metallic glass forming alloy system Zr-Cu-Al-Ag as an example, we demonstrate how glass formation and antibacterial activity, two unrelated properties, can be simultaneously characterized and the optimal composition can be efficiently identified. We found that in the Zr-Cu-Al-Ag alloy system fully glassy phase can be obtained in a wide compositional range by co-sputtering, and antibacterial activity is strongly dependent on alloy compositions. Our results indicate that antibacterial activity is sensitive to Cu and Ag while essentially remains unchanged within a wide range of Zr and Al. The proposed strategy not only facilitates development of high-performing alloys, but also provides a tool to unveil the composition dependence of properties in a highly parallel fashion, which helps the development of new materials by design.

Electron pumping of the ground state of 21Ne. Transfers and multiple diffusion processes

International Nuclear Information System (INIS)

Stoeckel, F.; Lombardi, M.

1978-01-01

The electron-pumping process of the ground state of 21 Ne has been studied. It is demonstrated how in a neon cell at a pressure of 10 -4 to 10 -2 torr, a high frequency discharge can create a nuclear spin alignment in the fundamental level (I=3/2) when the excited levels are themselves aligned. The nuclear alignment is observed by monitoring the change of the linear polarization of several optical transitions during the magnetic resonance of the fundamental level. Various transfers of the alignments are investigated and a detailed study of the influence of the multiple diffusion is carried out. The multiple diffusion produces a depolarization and a relaxation of the nuclear spin. A theoretical calculation has been made for a two-level system with a J=1 radiative level and a J=0 ground state. Experimentally a relaxation time of the nuclear alignment varying from 37 ms to 240 ms is observed when the neon pressure decreases from 10 -2 to 10 -4 torr [fr

Multichannel transfer function with dimensionality reduction

KAUST Repository

Kim, Han Suk

2010-01-17

The design of transfer functions for volume rendering is a difficult task. This is particularly true for multi-channel data sets, where multiple data values exist for each voxel. In this paper, we propose a new method for transfer function design. Our new method provides a framework to combine multiple approaches and pushes the boundary of gradient-based transfer functions to multiple channels, while still keeping the dimensionality of transfer functions to a manageable level, i.e., a maximum of three dimensions, which can be displayed visually in a straightforward way. Our approach utilizes channel intensity, gradient, curvature and texture properties of each voxel. The high-dimensional data of the domain is reduced by applying recently developed nonlinear dimensionality reduction algorithms. In this paper, we used Isomap as well as a traditional algorithm, Principle Component Analysis (PCA). Our results show that these dimensionality reduction algorithms significantly improve the transfer function design process without compromising visualization accuracy. In this publication we report on the impact of the dimensionality reduction algorithms on transfer function design for confocal microscopy data.

Exact combinatorial reliability analysis of dynamic systems with sequence-dependent failures

International Nuclear Information System (INIS)

Xing Liudong; Shrestha, Akhilesh; Dai Yuanshun

2011-01-01

Many real-life fault-tolerant systems are subjected to sequence-dependent failure behavior, in which the order in which the fault events occur is important to the system reliability. Such systems can be modeled by dynamic fault trees (DFT) with priority-AND (pAND) gates. Existing approaches for the reliability analysis of systems subjected to sequence-dependent failures are typically state-space-based, simulation-based or inclusion-exclusion-based methods. Those methods either suffer from the state-space explosion problem or require long computation time especially when results with high degree of accuracy are desired. In this paper, an analytical method based on sequential binary decision diagrams is proposed. The proposed approach can analyze the exact reliability of non-repairable dynamic systems subjected to the sequence-dependent failure behavior. Also, the proposed approach is combinatorial and is applicable for analyzing systems with any arbitrary component time-to-failure distributions. The application and advantages of the proposed approach are illustrated through analysis of several examples. - Highlights: → We analyze the sequence-dependent failure behavior using combinatorial models. → The method has no limitation on the type of time-to-failure distributions. → The method is analytical and based on sequential binary decision diagrams (SBDD). → The method is computationally more efficient than existing methods.

Approaches towards the automated interpretation and prediction of electrospray tandem mass spectra of non-peptidic combinatorial compounds.

Science.gov (United States)

Klagkou, Katerina; Pullen, Frank; Harrison, Mark; Organ, Andy; Firth, Alistair; Langley, G John

2003-01-01

Combinatorial chemistry is widely used within the pharmaceutical industry as a means of rapid identification of potential drugs. With the growth of combinatorial libraries, mass spectrometry (MS) became the key analytical technique because of its speed of analysis, sensitivity, accuracy and ability to be coupled with other analytical techniques. In the majority of cases, electrospray mass spectrometry (ES-MS) has become the default ionisation technique. However, due to the absence of fragment ions in the resulting spectra, tandem mass spectrometry (MS/MS) is required to provide structural information for the identification of an unknown analyte. This work discusses the first steps of an investigation into the fragmentation pathways taking place in electrospray tandem mass spectrometry. The ultimate goal for this project is to set general fragmentation rules for non-peptidic, pharmaceutical, combinatorial compounds. As an aid, an artificial intelligence (AI) software package is used to facilitate interpretation of the spectra. This initial study has focused on determining the fragmentation rules for some classes of compound types that fit the remit as outlined above. Based on studies carried out on several combinatorial libraries of these compounds, it was established that different classes of drug molecules follow unique fragmentation pathways. In addition to these general observations, the specific ionisation processes and the fragmentation pathways involved in the electrospray mass spectra of these systems were explored. The ultimate goal will be to incorporate our findings into the computer program and allow identification of an unknown, non-peptidic compound following insertion of its ES-MS/MS spectrum into the AI package. The work herein demonstrates the potential benefit of such an approach in addressing the issue of high-throughput, automated MS/MS data interpretation. Copyright 2003 John Wiley & Sons, Ltd.

A NEW HEURISTIC ALGORITHM FOR MULTIPLE TRAVELING SALESMAN PROBLEM

Directory of Open Access Journals (Sweden)

F. NURIYEVA

2017-06-01

Full Text Available The Multiple Traveling Salesman Problem (mTSP is a combinatorial optimization problem in NP-hard class. The mTSP aims to acquire the minimum cost for traveling a given set of cities by assigning each of them to a different salesman in order to create m number of tours. This paper presents a new heuristic algorithm based on the shortest path algorithm to find a solution for the mTSP. The proposed method has been programmed in C language and its performance analysis has been carried out on the library instances. The computational results show the efficiency of this method.

Novel Combinatory Approaches to Repair Visual System after Optic Nerve Damage

Science.gov (United States)

2014-09-01

Novel Combinatory Approaches to Repair Visual System After Optic Nerve Damage 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6...biological functions such as metabolism, growth, cell cycle, and survival ( Cardone et al., 1998; Diehl, Cheng, Roussel, & Sherr, 1998; Hers, Vincent...of injured adult sensory neurons. The Journal of Neuroscience, 21, 7161–7170. Cardone , M. H., Roy, N., Stennicke, H. R., Salvesen, G. S., Franke, T. F

Combinatorial control of messenger RNAs by Pumilio, Nanos and Brain Tumor Proteins.

Science.gov (United States)

Arvola, René M; Weidmann, Chase A; Tanaka Hall, Traci M; Goldstrohm, Aaron C

2017-11-02

Eukaryotes possess a vast array of RNA-binding proteins (RBPs) that affect mRNAs in diverse ways to control protein expression. Combinatorial regulation of mRNAs by RBPs is emerging as the rule. No example illustrates this as vividly as the partnership of 3 Drosophila RBPs, Pumilio, Nanos and Brain Tumor, which have overlapping functions in development, stem cell maintenance and differentiation, fertility and neurologic processes. Here we synthesize 30 y of research with new insights into their molecular functions and mechanisms of action. First, we provide an overview of the key properties of each RBP. Next, we present a detailed analysis of their collaborative regulatory mechanism using a classic example of the developmental morphogen, hunchback, which is spatially and temporally regulated by the trio during embryogenesis. New biochemical, structural and functional analyses provide insights into RNA recognition, cooperativity, and regulatory mechanisms. We integrate these data into a model of combinatorial RNA binding and regulation of translation and mRNA decay. We then use this information, transcriptome wide analyses and bioinformatics predictions to assess the global impact of Pumilio, Nanos and Brain Tumor on gene regulation. Together, the results support pervasive, dynamic post-transcriptional control.

Combinatorial delivery of small interfering RNAs reduces RNAi efficacy by selective incorporation into RISC

Science.gov (United States)

Castanotto, Daniela; Sakurai, Kumi; Lingeman, Robert; Li, Haitang; Shively, Louise; Aagaard, Lars; Soifer, Harris; Gatignol, Anne; Riggs, Arthur; Rossi, John J.

2007-01-01

Despite the great potential of RNAi, ectopic expression of shRNA or siRNAs holds the inherent risk of competition for critical RNAi components, thus altering the regulatory functions of some cellular microRNAs. In addition, specific siRNA sequences can potentially hinder incorporation of other siRNAs when used in a combinatorial approach. We show that both synthetic siRNAs and expressed shRNAs compete against each other and with the endogenous microRNAs for transport and for incorporation into the RNA induced silencing complex (RISC). The same siRNA sequences do not display competition when expressed from a microRNA backbone. We also show that TAR RNA binding protein (TRBP) is one of the sensors for selection and incorporation of the guide sequence of interfering RNAs. These findings reveal that combinatorial siRNA approaches can be problematic and have important implications for the methodology of expression and use of therapeutic interfering RNAs. PMID:17660190

Legal Aspects of Iatrogenic Multiple Pregnancy

Directory of Open Access Journals (Sweden)

Jacques Milliez

2009-01-01

Full Text Available During Assisted Reproductive Technology (ART procedures, the transfer of a single embryodramatically reduces the rate of multiple pregnancy. Proper information, therefore, should bedelivered to patients before embryo transfer. In many countries, regulations limit, according toage of the patient, the number of embryos to be transferred. Selective fetal reduction should not beconsidered as a suitable alternative to a single embryo transfer policy. The international federationof obstetricians and gynaecologists (FIGO recommendations on Multifetal reduction outline thatthe priority should be a careful planning and monitoring of infertility treatment for the reduction oravoidance of multiple pregnancy.

Generating an Automated Test Suite by Variable Strength Combinatorial Testing for Web Services

Directory of Open Access Journals (Sweden)

Yin Li

2016-09-01

Full Text Available Testing Web Services has become the spotlight of software engineering as an important means to assure the quality of Web application. Due to lacking of graphic interface and source code, Web services need an automated testing method, which is an important part in efficiently designing and generating test suite. However, the existing testing methods may lead to the redundancy of test suite and the decrease of fault-detecting ability since it cannot handle scenarios where the strengths of the different interactions are not uniform. With the purpose of solving this problem, firstly the formal tree model based on WSDL is constructed and the actual interaction relationship of each node is made sufficient consideration into, then the combinatorial testing is proposed to generate variable strength combinatorial test suite based on One-test-at-a-time strategy. At last test cases are minimized according to constraint rules. The results show that compared with conventional random testing, the proposed approach can detect more errors with the same amount of test cases which turning out to be more ideal than existing ones in size.

Secretory Overexpression of Bacillus thermocatenulatus Lipase in Saccharomyces cerevisiae Using Combinatorial Library Strategy.

Science.gov (United States)

Kajiwara, Shota; Yamada, Ryosuke; Ogino, Hiroyasu

2018-04-10

Simple and cost-effective lipase expression host microorganisms are highly desirable. A combinatorial library strategy is used to improve the secretory expression of lipase from Bacillus thermocatenulatus (BTL2) in the culture supernatant of Saccharomyces cerevisiae. A plasmid library including expression cassettes composed of sequences encoding one of each 15 promoters, 15 secretion signals, and 15 terminators derived from yeast species, S. cerevisiae, Pichia pastoris, and Hansenula polymorpha, is constructed. The S. cerevisiae transformant YPH499/D4, comprising H. polymorpha GAP promoter, S. cerevisiae SAG1 secretion signal, and P. pastoris AOX1 terminator, is selected by high-throughput screening. This transformant expresses BTL2 extra-cellularly with a 130-fold higher than the control strain, comprising S. cerevisiae PGK1 promoter, S. cerevisiae α-factor secretion signal, and S. cerevisiae PGK1 terminator, after cultivation for 72 h. This combinatorial library strategy holds promising potential for application in the optimization of the secretory expression of proteins in yeast. © 2018 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Seven-Tesla Magnetization Transfer Imaging to Detect Multiple Sclerosis White Matter Lesions.

Science.gov (United States)

Chou, I-Jun; Lim, Su-Yin; Tanasescu, Radu; Al-Radaideh, Ali; Mougin, Olivier E; Tench, Christopher R; Whitehouse, William P; Gowland, Penny A; Constantinescu, Cris S

2018-03-01

Fluid-attenuated inversion recovery (FLAIR) imaging at 3 Tesla (T) field strength is the most sensitive modality for detecting white matter lesions in multiple sclerosis. While 7T FLAIR is effective in detecting cortical lesions, it has not been fully optimized for visualization of white matter lesions and thus has not been used for delineating lesions in quantitative magnetic resonance imaging (MRI) studies of the normal appearing white matter in multiple sclerosis. Therefore, we aimed to evaluate the sensitivity of 7T magnetization-transfer-weighted (MT w ) images in the detection of white matter lesions compared with 3T-FLAIR. Fifteen patients with clinically isolated syndrome, 6 with multiple sclerosis, and 10 healthy participants were scanned with 7T 3-dimensional (D) MT w and 3T-2D-FLAIR sequences on the same day. White matter lesions visible on either sequence were delineated. Of 662 lesions identified on 3T-2D-FLAIR images, 652 were detected on 7T-3D-MT w images (sensitivity, 98%; 95% confidence interval, 97% to 99%). The Spearman correlation coefficient between lesion loads estimated by the two sequences was .910. The intrarater and interrater reliability for 7T-3D-MT w images was good with an intraclass correlation coefficient (ICC) of 98.4% and 81.8%, which is similar to that for 3T-2D-FLAIR images (ICC 96.1% and 96.7%). Seven-Tesla MT w sequences detected most of the white matter lesions identified by FLAIR at 3T. This suggests that 7T-MT w imaging is a robust alternative for detecting demyelinating lesions in addition to 3T-FLAIR. Future studies need to compare the roles of optimized 7T-FLAIR and of 7T-MT w imaging. © 2017 The Authors. Journal of Neuroimaging published by Wiley Periodicals, Inc. on behalf of American Society of Neuroimaging.

HOXA1 and TALE proteins display cross-regulatory interactions and form a combinatorial binding code on HOXA1 targets.

Science.gov (United States)

De Kumar, Bony; Parker, Hugo J; Paulson, Ariel; Parrish, Mark E; Pushel, Irina; Singh, Narendra Pratap; Zhang, Ying; Slaughter, Brian D; Unruh, Jay R; Florens, Laurence; Zeitlinger, Julia; Krumlauf, Robb

2017-09-01

Hoxa1 has diverse functional roles in differentiation and development. We identify and characterize properties of regions bound by HOXA1 on a genome-wide basis in differentiating mouse ES cells. HOXA1-bound regions are enriched for clusters of consensus binding motifs for HOX, PBX, and MEIS, and many display co-occupancy of PBX and MEIS. PBX and MEIS are members of the TALE family and genome-wide analysis of multiple TALE members (PBX, MEIS, TGIF, PREP1, and PREP2) shows that nearly all HOXA1 targets display occupancy of one or more TALE members. The combinatorial binding patterns of TALE proteins define distinct classes of HOXA1 targets, which may create functional diversity. Transgenic reporter assays in zebrafish confirm enhancer activities for many HOXA1-bound regions and the importance of HOX-PBX and TGIF motifs for their regulation. Proteomic analyses show that HOXA1 physically interacts on chromatin with PBX, MEIS, and PREP family members, but not with TGIF, suggesting that TGIF may have an independent input into HOXA1-bound regions. Therefore, TALE proteins appear to represent a wide repertoire of HOX cofactors, which may coregulate enhancers through distinct mechanisms. We also discover extensive auto- and cross-regulatory interactions among the Hoxa1 and TALE genes, indicating that the specificity of HOXA1 during development may be regulated though a complex cross-regulatory network of HOXA1 and TALE proteins. This study provides new insight into a regulatory network involving combinatorial interactions between HOXA1 and TALE proteins. © 2017 De Kumar et al.; Published by Cold Spring Harbor Laboratory Press.

Determinants of oxygen and carbon dioxide transfer during extracorporeal membrane oxygenation in an experimental model of multiple organ dysfunction syndrome.

Science.gov (United States)

Park, Marcelo; Costa, Eduardo Leite Vieira; Maciel, Alexandre Toledo; Silva, Débora Prudêncio E; Friedrich, Natalia; Barbosa, Edzangela Vasconcelos Santos; Hirota, Adriana Sayuri; Schettino, Guilherme; Azevedo, Luciano Cesar Pontes

2013-01-01

Extracorporeal membrane oxygenation (ECMO) has gained renewed interest in the treatment of respiratory failure since the advent of the modern polymethylpentene membranes. Limited information exists, however, on the performance of these membranes in terms of gas transfers during multiple organ failure (MOF). We investigated determinants of oxygen and carbon dioxide transfer as well as biochemical alterations after the circulation of blood through the circuit in a pig model under ECMO support before and after induction of MOF. A predefined sequence of blood and sweep flows was tested before and after the induction of MOF with fecal peritonitis and saline lavage lung injury. In the multivariate analysis, oxygen transfer had a positive association with blood flow (slope = 66, Pmembrane PaCO(2) (slope = -0.96, P = 0.001) and SatO(2) (slope = -1.7, Ptransfer had a positive association with blood flow (slope = 17, Pmembrane PaCO(2) (slope = 1.2, Ptransfers were significantly determined by blood flow. Oxygen transfer was modulated by the pre-membrane SatO(2) and CO(2), while carbon dioxide transfer was affected by the gas flow, pre-membrane CO(2) and hemoglobin.

Metal-ion induced amplification of three receptors from dynamic combinatorial libraries of peptide-hydrazones

NARCIS (Netherlands)

Roberts, Sarah L.; Furlan, Ricardo L.E.; Otto, Sijbren; Sanders, Jeremy K.M.

2003-01-01

Three building blocks of general structure (MeO)2CH–aromatic linker–Pro–amino acid–NHNH2 have been prepared and tested in acid-catalysed dynamic combinatorial libraries. Exposure of these libraries to LiI and NaI led to the amplification of three macrocyclic pseudopeptide receptors. The receptors

A Meinardus Theorem with Multiple Singularities

Science.gov (United States)

Granovsky, Boris L.; Stark, Dudley

2012-09-01

Meinardus proved a general theorem about the asymptotics of the number of weighted partitions, when the Dirichlet generating function for weights has a single pole on the positive real axis. Continuing (Granovsky et al., Adv. Appl. Math. 41:307-328, 2008), we derive asymptotics for the numbers of three basic types of decomposable combinatorial structures (or, equivalently, ideal gas models in statistical mechanics) of size n, when their Dirichlet generating functions have multiple simple poles on the positive real axis. Examples to which our theorem applies include ones related to vector partitions and quantum field theory. Our asymptotic formula for the number of weighted partitions disproves the belief accepted in the physics literature that the main term in the asymptotics is determined by the rightmost pole.

WORKSHOP ON NEW DEVELOPMENTS IN CHEMICAL SEPARATIONS FROM COMBINATORIAL CHEMISTRY AND RELATED SYNTHETIC STRATEGIES

Energy Technology Data Exchange (ETDEWEB)

Weber, Stephen G. [University of Pittsburgh, Pittsburgh, Pennsylvania

1998-08-22

The power of combinatorial chemistry and related high throughput synthetic strategies is currently being pursued as a fruitful way to develop molecules and materials with new properties. The strategy is motivated, for example in the pharmaceutical industry, by the difficulty of designing molecules to bind to specific sites on target biomolecules. By synthesizing a variety of similar structures, and then finding the one that has the most potent activity, new so-called lead structures will be found rapidly. Existing lead structures can be optimized. This relatively new approach has many implications for separation science. The most obvious is the call for more separations power: higher resolution, lower concentrations, higher speed. This pressure butresses the traditional directions of research into the development of more useful separations. The advent of chip-based, electroosmotically pumped systems1 will certainly accelerate progress in this traditional direction. The progress in combinatorial chemistry and related synthetic strategies gives rise to two other, broadly significant possibilities for large changes in separation science. One possibility results from the unique requirements of the synthesis of a huge number of products simultaneously. Can syntheses and separations be designed to work together to create strategies that lead to mixtures containing only desired products but without side products? The other possibility results from the need for molecular selectivity in separations. Can combinatorial syntheses and related strategies be used in the development of better separations media? A workshop in two parts was held. In one half-day session, pedagogical presentations educated across the barriers of discipline and scale. In the second half-day session, the participants broke into small groups to flesh out new ideas. A panel summarized the breakout discussions.

Combinatorial enzyme technology: Conversion of pectin to oligo species and its effect on microbial growth

Science.gov (United States)

Plant cell wall polysaccharides, which consist of polymeric backbones with various types of substitution, were studied using the concept of combinatorial enzyme technology for conversion of agricultural fibers to functional products. Using citrus pectin as the starting substrate, an active oligo spe...

Design of diversity and focused combinatorial libraries in drug discovery.

Science.gov (United States)

Young, S Stanley; Ge, Nanxiang

2004-05-01

Using well-characterized chemical reactions and readily available monomers, chemists are able to create sets of compounds, termed libraries, which are useful in drug discovery processes. The design of combinatorial chemical libraries can be complex and there has been much information recently published offering suggestions on how the design process can be carried out. This review focuses on literature with the goal of organizing current thinking. At this point in time, it is clear that benchmarking of current suggested methods is required as opposed to further new methods.

Tailored Polymer-Supported Templates in Dynamic Combinatorial Libraries : Simultaneous Selection, Amplification and Isolation of Synthetic Receptors

NARCIS (Netherlands)

Besenius, Pol; Cormack, Peter A.G.; Liu, Jingyuan; Otto, Sijbren; Sanders, Jeremy K.M.; Sherrington, David C.

2008-01-01

The thermodynamically controlled synthesis and isolation of macrocyclic receptors from dynamic combinatorial libraries has been achieved in a single step using a polymer-supported template. The templates were cinchona alkaloids which show interesting enantio- and diastereoselective molecular

Combinatorial formulas for Kazhdan-Lusztig polynomials with respect to W-graph ideals

OpenAIRE

Wang, Qi

2017-01-01

In \\cite{y1} Yin generalized the definition of $W$-graph ideal $E_J$ in weighted Coxeter groups and introduced the weighted Kazhdan-Lusztig polynomials $ \\left \\{ P_{x,y} \\mid x,y\\in E_J\\right \\}$, where $J$ is a subset of simple generators $S$. In this paper, we study the combinatorial formulas for those polynomials, which extend the results of Deodhar \\cite{v3} and Tagawa \\cite{h1}.

Principles of Linguistic Composition Below and Beyond the Clause—Elements of a semantic combinatorial system

DEFF Research Database (Denmark)

Bundgaard, Peer

2006-01-01

beyond the scope of the clause. To this end it exposes two major principles of semantic combination that are active through all levels of linguistic composition: viz. frame-schematic structure and narrative structure. These principles are considered as being components of a semantic combinatorial system...

What Diagrams Argue in Late Imperial Chinese Combinatorial Texts.

Science.gov (United States)

Bréard, Andrea

2015-01-01

Attitudes towards diagrammatic reasoning and visualization in mathematics were seldom spelled out in texts from pre-modern China, although illustrations figure prominently in mathematical literature since the eleventh century. Taking the sums of finite series and their combinatorial interpretation as a case study, this article investigates the epistemological function of illustrations from the eleventh to the nineteenth century that encode either the mathematical objects themselves or represent their related algorithms. It particularly focuses on the two illustrations given in Wang Lai's (1768-1813) Mathematical Principles of Sequential Combinations, arguing that they reflect a specific mode of nineteenth-century mathematical argumentative practice and served as a heuristic model for later authors.

Fabrication and characterization of thin-film phosphor combinatorial libraries

Science.gov (United States)

Mordkovich, V. Z.; Jin, Zhengwu; Yamada, Y.; Fukumura, T.; Kawasaki, M.; Koinuma, H.

2002-05-01

The laser molecular beam epitaxy method was employed to fabricate thin-film combinatorial libraries of ZnO-based phosphors on different substrates. Fabrication of both pixel libraries, on the example of Fe-doped ZnO, and spread libraries, on the example of Eu-doped ZnO, has been demonstrated. Screening of the Fe-doped ZnO libraries led to the discovery of weak green cathodoluminescence with the maximum efficiency at the Fe content of 0.58 mol %. Screening of the Eu-doped ZnO libraries led to the discovery of unusual reddish-violet cathodoluminescence which is observed in a broad range of Eu concentration. No photoluminescence was registered in either system.

Controlling energy transfer between multiple dopants within a single nanoparticle

Science.gov (United States)

DiMaio, Jeffrey R.; Sabatier, Clément; Kokuoz, Baris; Ballato, John

2008-01-01

Complex core-shell architectures are implemented within LaF3 nanoparticles to allow for a tailored degree of energy transfer (ET) between different rare earth dopants. By constraining specific dopants to individual shells, their relative distance to one another can be carefully controlled. Core-shell LaF3 nanoparticles doped with Tb3+ and Eu3+ and consisting of up to four layers were synthesized with an outer diameter of ≈10 nm. It is found that by varying the thicknesses of an undoped layer between a Tb3+-doped layer and a Eu3+-doped layer, the degree of ET can be engineered to allow for zero, partial, or total ET from a donor ion to an acceptor ion. More specifically, the ratio of the intensities of the 541-nm Tb3+ and 590 nm Eu3+ peaks was tailored from core-shell configuration that restricts ET is used. Beyond simply controlling ET, which can be limiting when designing materials for optical applications, this approach can be used to obtain truly engineered spectral features from nanoparticles and composites made from them. Further, it allows for a single excitation source to yield multiple discrete emissions from numerous lanthanide dopants that heretofore would have been quenched in a more conventional active optical material. PMID:18250307

Genome-scale regression analysis reveals a linear relationship for promoters and enhancers after combinatorial drug treatment

KAUST Repository

Rapakoulia, Trisevgeni

2017-08-09

Motivation: Drug combination therapy for treatment of cancers and other multifactorial diseases has the potential of increasing the therapeutic effect, while reducing the likelihood of drug resistance. In order to reduce time and cost spent in comprehensive screens, methods are needed which can model additive effects of possible drug combinations. Results: We here show that the transcriptional response to combinatorial drug treatment at promoters, as measured by single molecule CAGE technology, is accurately described by a linear combination of the responses of the individual drugs at a genome wide scale. We also find that the same linear relationship holds for transcription at enhancer elements. We conclude that the described approach is promising for eliciting the transcriptional response to multidrug treatment at promoters and enhancers in an unbiased genome wide way, which may minimize the need for exhaustive combinatorial screens.

Zoledronic acid produces combinatory anti-tumor effects with cisplatin on mesothelioma by increasing p53 expression levels.

Directory of Open Access Journals (Sweden)

Shinya Okamoto

Full Text Available We examined anti-tumor effects of zoledronic acid (ZOL, one of the bisphosphonates agents clinically used for preventing loss of bone mass, on human mesothelioma cells bearing the wild-type p53 gene. ZOL-treated cells showed activation of caspase-3/7, -8 and -9, and increased sub-G1 phase fractions. A combinatory use of ZOL and cisplatin (CDDP, one of the first-line anti-cancer agents for mesothelioma, synergistically or additively produced the cytotoxicity on mesothelioma cells. Moreover, the combination achieved greater anti-tumor effects on mesothelioma developed in the pleural cavity than administration of either ZOL or CDDP alone. ZOL-treated cells as well as CDDP-treated cells induced p53 phosphorylation at Ser 15, a marker of p53 activation, and up-regulated p53 protein expression levels. Down-regulation of p53 levels with siRNA however did not influence the ZOL-mediated cytotoxicity but negated the combinatory effects by ZOL and CDDP. In addition, ZOL treatments augmented cytotoxicity of adenoviruses expressing the p53 gene on mesothelioma. These data demonstrated that ZOL-mediated augmentation of p53, which was not linked with ZOL-induced cytotoxicity, played a role in the combinatory effects with a p53 up-regulating agent, and suggests a possible clinical use of ZOL to mesothelioma with anti-cancer agents.

Accelerated Combinatorial High Throughput Star Polymer Synthesis via a Rapid One-Pot Sequential Aqueous RAFT (rosa-RAFT) Polymerization Scheme.

Science.gov (United States)

Cosson, Steffen; Danial, Maarten; Saint-Amans, Julien Rosselgong; Cooper-White, Justin J

2017-04-01

Advanced polymerization methodologies, such as reversible addition-fragmentation transfer (RAFT), allow unprecedented control over star polymer composition, topology, and functionality. However, using RAFT to produce high throughput (HTP) combinatorial star polymer libraries remains, to date, impracticable due to several technical limitations. Herein, the methodology "rapid one-pot sequential aqueous RAFT" or "rosa-RAFT," in which well-defined homo-, copolymer, and mikto-arm star polymers can be prepared in very low to medium reaction volumes (50 µL to 2 mL) via an "arm-first" approach in air within minutes, is reported. Due to the high conversion of a variety of acrylamide/acrylate monomers achieved during each successive short reaction step (each taking 3 min), the requirement for intermediary purification is avoided, drastically facilitating and accelerating the star synthesis process. The presented methodology enables RAFT to be applied to HTP polymeric bio/nanomaterials discovery pipelines, in which hundreds of complex polymeric formulations can be rapidly produced, screened, and scaled up for assessment in a wide range of applications. © 2017 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Efficiency Intra-Cluster Device-to-Device Relay Selection for Multicast Services Based on Combinatorial Auction

Directory of Open Access Journals (Sweden)

Yong Zhang

2015-12-01

Full Text Available In Long Term Evolution-Advanced (LTE-A networks, Device-to-device (D2D communications can be utilized to enhance the performance of multicast services by leveraging D2D relays to serve nodes with worse channel conditions within a cluster. For traditional D2D relay schemes, D2D links with poor channel condition may be the bottleneck of system sum data rate. In this paper, to optimize the throughput of D2D communications, we introduce an iterative combinatorial auction algorithm for efficient D2D relay selection. In combinatorial auctions, the User Equipments (UEs that fails to correctly receive multicast data from eNodeB (eNB are viewed as bidders that compete for D2D relays, while the eNB is treated as the auctioneer. We also give properties of convergency and low-complexity and present numerical simulations to verify the efficiency of the proposed algorithm.

A combinatorial approach of inclusion complexation and dendrimer synthesization for effective targeting EGFR-TK.

Science.gov (United States)

Shende, Pravin; Patil, Sampada; Gaud, R S

2017-07-01

The aim of the present study was to use a combinatorial approach of inclusion complexation and dendrimer synthesization of gefitinib using solvent-free technique for targeting EGFR-TK to treat Non-Small-Cell Lung Cancer (NSCLC). The inclusion complex of gefitinib with β-cyclodextrin was prepared by trituration method. This complex encapsulated G4 PAMAM dendrimers were synthesized by Michael addition and amidation reactions using green chemistry and then PEGylated by conjugation reaction. FTIR and DSC confirmed the formation of inclusion complex of gefitinib and β-cyclodextrin and PEGylation of G4 PAMAM dendrimers. Gefitinib showed higher solubility, encapsulation efficiency and controlled release profile from PEGylated dendrimers compared to inclusion complex. The PEGylated dendrimers of inclusion complex of gefitinib were found to reduce hemolytic toxicity and lesser GI 50 value on Human lung cancer cell line A-549 by effective targeting EGFR-TK. A combinatorial approach of inclusion complexation and dendrimer synthesization is one of the alternative advanced approaches to treat NSCLC. Copyright © 2017 Elsevier B.V. All rights reserved.

Advanced research and development for plasma processing of polymers with combinatorial plasma-process analyzer

International Nuclear Information System (INIS)

Setsuhara, Yuichi; Cho, Ken; Takenaka, Kosuke; Shiratani, Masaharu; Sekine, Makoto; Hori, Masaru

2010-01-01

A plasma-process analyzer has been developed on the basis of combinatorial method, in which process examinations with continuous variations of plasma-process conditions can be carried out on a substrate holder with an inclined distribution of process parameters. Combinatorial plasma-process analyses have been demonstrated for examinations of plasma-polymer interactions in terms of etching characteristics and surface morphologies in order to show feasibility and effectiveness of the methodology as advanced research and development for next-generation plasma nano processes. The etching properties and surface morphologies have been investigated for polyethylene terephthalate (PET) films exposed to argon-oxygen mixture plasmas. The etching depth data obtained from three independent batches of the experiments showed universal and almost linear dependence with increasing product of (ion saturation current) x (exposure time); i.e. ion dose. Surface roughness of the polymer slightly increased with increasing ion dose, while the mean spacing after plasma exposure was found to decrease monotonically with increasing ion dose but was saturated at the level of approximately 250 nm.

Passive heat transfer augmentation in a cylindrical annulus utilizing multiple perturbations on the inner and outer cylinders

International Nuclear Information System (INIS)

Iyer, S.V.; Vafai, K.

1999-01-01

The study of natural convection flow and heat transfer within a cylindrical annulus has received considerable attention because of its numerous applications, such as in nuclear reactor design, electronic component cooling, thermal storage systems, energy conservation, energy storage, and energy transmission. Here, the effects of multiple geometric perturbations on the inner and outer cylinders of an annulus with impermeable end walls are investigated in this work. A three-dimensional study was done using a numerical scheme based on a Galerkin method of finite element formulation. The nature of the buoyancy-induced flow field has been analyzed in detail. The flow fields for the cases considered were found to be qualitatively similar, and the introduction of each additional perturbation altered the flow field in a regular and recurring manner. The introduction of each perturbation on the outer cylinder causes clockwise and counterclock-wise rotating patterns on either side of the perturbation in the upper circumferential regions of the annulus. The motion of the fluid entrained by these circulatory patterns constitutes the key features of the flow pattern observed in the annulus. It is observed that the presence of multiple perturbations on the inner and outer cylinders substantially increases the overall heat transfer rate as compared to the regular annulus without any perturbation. Key qualitative and quantitative effects of the introduction of perturbations on both the inner and outer cylinders of the annulus are discussed

Serial contrast-enhanced magnetic resonance and magnetization transfer in the study of patients with multiple sclerosis

International Nuclear Information System (INIS)

Rovira, A.; Alonso, J.; Cucurella, G.; Nos, C.; Tintore, M.; Pedraza, S.; Rio, J.; Montalban, X.

1997-01-01

To demonstrate the changes in the magnetization transfer ratio (MTR) of different demyelinating plaques, correlating them with the baseline values in T1-weighted contrast-enhanced magnetic resonance (MR) sequences in order to relate them more closely to the underlying disease. The study was based on 33 demyelinating plaques obtained from six patients clinically diagnosed as having remitting-recurring multiple sclerosis (MS). All the patients underwent two MR studies at a 3 to 5-month interval, including contrast-enhanced T1 and T2- weighted sequences and magnetization transfer images. The latter were used to calculate the MTR for each of the demyelinating plaques included in the study. The statistical analysis of the results obtained revealed statistically significant between initial MTR values and those of subsequent T1-weighted sequences. The MTR demonstrate significant differences between plaques according to contrast-enhanced T1-weigh tes sequences, probably indicating variable degrees of edema, demyelination and tissue destruction. These differences should be taken into account to enable the use of T1-weighted sequences to quantify the lesion load in MS patients. (Author) 35 refs

Combinatorial interpretations of binomial coefficient analogues related to Lucas sequences

OpenAIRE

Sagan, Bruce; Savage, Carla

2009-01-01

Let s and t be variables. Define polynomials {n} in s, t by {0}=0, {1}=1, and {n}=s{n-1}+t{n-2} for n >= 2. If s, t are integers then the corresponding sequence of integers is called a Lucas sequence. Define an analogue of the binomial coefficients by C{n,k}={n}!/({k}!{n-k}!) where {n}!={1}{2}...{n}. It is easy to see that C{n,k} is a polynomial in s and t. The purpose of this note is to give two combinatorial interpretations for this polynomial in terms of statistics on integer partitions in...

Intergenic and intragenic conjugal transfer of multiple antibiotic ...

African Journals Online (AJOL)

Conjugation process was conducted to determine the means of transferring ... In this study, it was surprisingly observed that tetracycline resistant gene was ... among pathogenic bacteria, particularly since antibiotics are indiscriminately used in ...

Combinatorial Drug Screening Identifies Ewing Sarcoma-specific Sensitivities

DEFF Research Database (Denmark)

Radic-Sarikas, Branka; Tsafou, Kalliopi P; Emdal, Kristina B.

2017-01-01

Improvements in survival for Ewing sarcoma pediatric and adolescent patients have been modest over the past 20 years. Combinations of anticancer agents endure as an option to overcome resistance to single treatments caused by compensatory pathways. Moreover, combinations are thought to lessen any...... associated adverse side effects through reduced dosing, which is particularly important in childhood tumors. Using a parallel phenotypic combinatorial screening approach of cells derived from three pediatric tumor types, we identified Ewing sarcoma-specific interactions of a diverse set of targeted agents...... including approved drugs. We were able to retrieve highly synergistic drug combinations specific for Ewing sarcoma and identified signaling processes important for Ewing sarcoma cell proliferation determined by EWS-FLI1 We generated a molecular target profile of PKC412, a multikinase inhibitor with strong...

The Classicist and the Frequentist Approach to Probability within a "TinkerPlots2" Combinatorial Problem

Science.gov (United States)

Prodromou, Theodosia

2012-01-01

This article seeks to address a pedagogical theory of introducing the classicist and the frequentist approach to probability, by investigating important elements in 9th grade students' learning process while working with a "TinkerPlots2" combinatorial problem. Results from this research study indicate that, after the students had seen…

Transfer matrix method for four-flux radiative transfer.

Science.gov (United States)

Slovick, Brian; Flom, Zachary; Zipp, Lucas; Krishnamurthy, Srini

2017-07-20

We develop a transfer matrix method for four-flux radiative transfer, which is ideally suited for studying transport through multiple scattering layers. The model predicts the specular and diffuse reflection and transmission of multilayer composite films, including interface reflections, for diffuse or collimated incidence. For spherical particles in the diffusion approximation, we derive closed-form expressions for the matrix coefficients and show remarkable agreement with numerical Monte Carlo simulations for a range of absorption values and film thicknesses, and for an example multilayer slab.

Transfer buffer containing methanol can be reused multiple times in protein electrotransfer.

Science.gov (United States)

Pettegrew, Colin J; Jayini, Renuka; Islam, M Rafiq

2009-04-01

We investigated the feasibility of repeated use of transfer buffer containing methanol in electrotransfer of proteins from sodium dodecyl sulfate-polyacrylamide gels to polyvinylidene difluoride (PVDF) membrane using a prestained protein marker of broad molecular sizes. Transfer of the antitumor protein p53 in HEK293T cell extracts, using fresh and used transfer buffer, followed by detection with anti-p53 antibody was also performed to test detectability in immunoblot. Results from these experiments indicate that the transfer buffer can be reused at least five times and maintain a similar extent of protein transfer to PVDF membrane. Repeated use of the transfer buffer containing methanol will significantly reduce the volume of hazardous waste generated and its disposal cost as well as its adverse effect on environment.

CCLab--a multi-objective genetic algorithm based combinatorial library design software and an application for histone deacetylase inhibitor design.

Science.gov (United States)

Fang, Guanghua; Xue, Mengzhu; Su, Mingbo; Hu, Dingyu; Li, Yanlian; Xiong, Bing; Ma, Lanping; Meng, Tao; Chen, Yuelei; Li, Jingya; Li, Jia; Shen, Jingkang

2012-07-15

The introduction of the multi-objective optimization has dramatically changed the virtual combinatorial library design, which can consider many objectives simultaneously, such as synthesis cost and drug-likeness, thus may increase positive rates of biological active compounds. Here we described a software called CCLab (Combinatorial Chemistry Laboratory) for combinatorial library design based on the multi-objective genetic algorithm. Tests of the convergence ability and the ratio to re-take the building blocks in the reference library were conducted to assess the software in silico, and then it was applied to a real case of designing a 5×6 HDAC inhibitor library. Sixteen compounds in the resulted library were synthesized, and the histone deactetylase (HDAC) enzymatic assays proved that 14 compounds showed inhibitory ratios more than 50% against tested 3 HDAC enzymes at concentration of 20 μg/mL, with IC(50) values of 3 compounds comparable to SAHA. These results demonstrated that the CCLab software could enhance the hit rates of the designed library and would be beneficial for medicinal chemists to design focused library in drug development (the software can be downloaded at: http://202.127.30.184:8080/drugdesign.html). Copyright © 2012 Elsevier Ltd. All rights reserved.

Combinatorial Dansyl Library and its Applications to pH-Responsive Probes.

Science.gov (United States)

Hong, Seong Cheol; Murale, Dhiraj P; Lee, Jun-Seok

2016-01-01

Herein, we report the first 48-membered, dansyl-based, combinatorial fluorescent library. From the electronic and structural properties of the probes, we analyzed their optical properties and chemical yields, with an average of 49 %. The molecules were examined for their pH responses, and DS-2 and DS-45 showed blue-shifts, whereas DS-7 and DS-40 showed red-shifts in wavelength with increasing pH. Finally, cell permeability was investigated by treating SNU-2292 cells. Our results demonstrate the potential application of this library in biosensors, bio-imaging and pH indicators.

Design and selection of load control strategies using a multiple objective model and evolutionary algorithms

International Nuclear Information System (INIS)

Gomes, Alvaro; Antunes, Carlos Henggeler; Martins, Antonio Gomes

2005-01-01

This paper aims at presenting a multiple objective model to evaluate the attractiveness of the use of demand resources (through load management control actions) by different stakeholders and in diverse structure scenarios in electricity systems. For the sake of model flexibility, the multiple (and conflicting) objective functions of technical, economical and quality of service nature are able to capture distinct market scenarios and operating entities that may be interested in promoting load management activities. The computation of compromise solutions is made by resorting to evolutionary algorithms, which are well suited to tackle multiobjective problems of combinatorial nature herein involving the identification and selection of control actions to be applied to groups of loads. (Author)

Gamma-ray multiplicity measurements and angular momentum transfer in deeply inelastic collisions

International Nuclear Information System (INIS)

Perrin, N.; Peter, J.

1977-01-01

In DIC, the part of the initial orbital angular momentum l which is transferred into internal angular momenta Δl of the fragments depends on the degree of cohesion of the composite system. The (few) measured gamma-rays multiplicities are compared to those observed for similar compound nuclei and for fission fragments. Δl increases with the kinetic energy relaxation. For medium-mass systems, the cohesion varies continuously from the rolling to the sticking situation when the decay time of the composite system increases. The rigid body situation is obtained for a small part of the relaxed events. For heavy systems, rigid rotation seems to be much more common, which will allow to extract information on the deflection function. The time needed to reach the rigid situation is intermediate between those of kinetic energy relaxation and mass asymmetry relaxation. An additional angular momentum can be added in the fragments, due to a bending mode at the scission-point, like in fission. That can explain the observed low anisotropy of the gamma-rays angular distribution

Radical scavenging potentials of single and combinatorial herbal formulations in vitro

Directory of Open Access Journals (Sweden)

Okey A. Ojiako

2016-04-01

Full Text Available Reactive oxygen and nitrogen species (RONS are involved in deleterious/beneficial biological processes. The present study sought to investigate the capacity of single and combinatorial herbal formulations of Acanthus montanus, Emilia coccinea, Hibiscus rosasinensis, and Asystasia gangetica to act as superoxide radicals (SOR, hydrogen peroxide (HP, nitric oxide radical (NOR, hydroxyl radical (HR, and 2,2-diphenyl-1-picrylhydrazyl (DPPH radical antagonists using in vitro models. The herbal extracts were single herbal formulations (SHfs, double herbal formulations (DHfs, triple herbal formulations (THfs, and a quadruple herbal formulation (QHf. The phytochemical composition and radical scavenging capacity index (SCI of the herbal formulations were measured using standard methods. The flavonoids were the most abundant phytochemicals present in the herbal extracts. The SCI50 defined the concentration (μg/mL of herbal formulation required to scavenge 50% of the investigated radicals. The SHfs, DHfs, THfs, and QHf SCI50 against the radicals followed the order HR > SOR > DPPH radical > HP > NOR. Although the various herbal formulations exhibited ambivalent antioxidant activities in terms of their radical scavenging capabilities, a broad survey of the results of the present study showed that combinatorial herbal formulations (DHfs, THfs, and QHf appeared to exhibit lower radical scavenging capacities than those of the SHfs in vitro.

Identification and Interrogation of Combinatorial Histone Modifications

Directory of Open Access Journals (Sweden)

Kelly R Karch

2013-12-01

Full Text Available Histone proteins are dynamically modified to mediate a variety of cellular processes including gene transcription, DNA damage repair, and apoptosis. Regulation of these processes occurs through the recruitment of non-histone proteins to chromatin by specific combinations of histone post-translational modifications (PTMs. Mass spectrometry has emerged as an essential tool to discover and quantify histone PTMs both within and between samples in an unbiased manner. Developments in mass spectrometry that allow for characterization of large histone peptides or intact protein has made it possible to determine which modifications occur simultaneously on a single histone polypeptide. A variety of techniques from biochemistry, biophysics, and chemical biology have been employed to determine the biological relevance of discovered combinatorial codes. This review first describes advancements in the field of mass spectrometry that have facilitated histone PTM analysis and then covers notable approaches to probe the biological relevance of these modifications in their nucleosomal context.

Phthalocyanine-loaded graphene nanoplatform for imaging-guided combinatorial phototherapy

Directory of Open Access Journals (Sweden)

Taratula O

2015-03-01

Full Text Available Olena Taratula,1 Mehulkumar Patel,2 Canan Schumann,1 Michael A Naleway,1 Addison J Pang,1 Huixin He,2 Oleh Taratula1 1Department of Pharmaceutical Sciences, College of Pharmacy, Oregon State University, Portland, OR, USA; 2Department of Chemistry, Rutgers University-Newark, Newark, NJ, USA Abstract: We report a novel cancer-targeted nanomedicine platform for imaging and prospect for future treatment of unresected ovarian cancer tumors by intraoperative multimodal phototherapy. To develop the required theranostic system, novel low-oxygen graphene nanosheets were chemically modified with polypropylenimine dendrimers loaded with phthalocyanine (Pc as a photosensitizer. Such a molecular design prevents fluorescence quenching of the Pc by graphene nanosheets, providing the possibility of fluorescence imaging. Furthermore, the developed nanoplatform was conjugated with poly(ethylene glycol, to improve biocompatibility, and with luteinizing hormone-releasing hormone (LHRH peptide, for tumor-targeted delivery. Notably, a low-power near-infrared (NIR irradiation of single wavelength was used for both heat generation by the graphene nanosheets (photothermal therapy [PTT] and for reactive oxygen species (ROS-production by Pc (photodynamic therapy [PDT]. The combinatorial phototherapy resulted in an enhanced destruction of ovarian cancer cells, with a killing efficacy of 90%–95% at low Pc and low-oxygen graphene dosages, presumably conferring cytotoxicity to the synergistic effects of generated ROS and mild hyperthermia. An animal study confirmed that Pc loaded into the nanoplatform can be employed as a NIR fluorescence agent for imaging-guided drug delivery. Hence, the newly developed Pc-graphene nanoplatform has the significant potential as an effective NIR theranostic probe for imaging and combinatorial phototherapy. Keywords: graphene nanosheets, phthalocyanine, photothermal therapy, photodynamic therapy, theranostic 

Combinatorial therapy of exercise-preconditioning and nanocurcumin formulation supplementation improves cardiac adaptation under hypobaric hypoxia.

Science.gov (United States)

Nehra, Sarita; Bhardwaj, Varun; Bansal, Anju; Saraswat, Deepika

2017-09-26

Chronic hypobaric hypoxia (cHH) mediated cardiac insufficiencies are associated with pathological damage. Sustained redox stress and work load are major causative agents of cardiac insufficiencies under cHH. Despite the advancements made in pharmacological (anti-oxidants, vasodilators) and non-pharmacological therapeutics (acclimatization strategies and schedules), only partial success has been achieved in improving cardiac acclimatization to cHH. This necessitates the need for potent combinatorial therapies to improve cardiac acclimatization at high altitudes. We hypothesize that a combinatorial therapy comprising preconditioning to mild aerobic treadmill exercise and supplementation with nanocurcumin formulation (NCF) consisting of nanocurcumin (NC) and pyrroloquinoline quinone (PQQ) might improve cardiac adaptation at high altitudes. Adult Sprague-Dawley rats pre-conditioned to treadmill exercise and supplemented with NCF were exposed to cHH (7620 m altitude corresponding to pO2~8% at 28±2°C, relative humidity 55%±1%) for 3 weeks. The rat hearts were analyzed for changes in markers of oxidative stress (free radical leakage, lipid peroxidation, manganese-superoxide dismutase [MnSOD] activity), cardiac injury (circulating cardiac troponin I [TnI] and T [cTnT], myocardial creatine kinase [CK-MB]), metabolic damage (lactate dehydrogenase [LDH] and acetyl-coenzyme A levels, lactate and pyruvate levels) and bio-energetic insufficiency (ATP, p-AMPKα). Significant modulations (p≤0.05) in cardiac redox status, metabolic damage, cardiac injury and bio-energetics were observed in rats receiving both NCF supplementation and treadmill exercise-preconditioning compared with rats receiving only one of the treatments. The combinatorial therapeutic strategy showed a tremendous improvement in cardiac acclimatization to cHH compared to either exercise-preconditioning or NCF supplementation alone which was evident from the effective modulation in redox, metabolic, contractile

Human mammary progenitor cell fate decisions are productsof interactions with combinatorial microenvironments

DEFF Research Database (Denmark)

LaBarge, Mark A.; Nelson, Celeste M.; Villadsen, René

2009-01-01

factors, ECM, and other cells, as well as physical properties of the ECM. To understand regulation of fate decisions, therefore, would require a means of understanding carefully choreographed combinatorial interactions. Here we used microenvironment protein microarrays to functionally identify...... combinations of cell-extrinsic mammary gland proteins and ECM molecules that imposed specific cell fates on bipotent human mammary progenitor cells.Micropatterned cell culture surfaces were fabricated to distinguish between the instructive effects of cell-cell versus cell-ECM interactions, as well...

Combinatorial algorithms

CERN Document Server

Hu, T C

2002-01-01

Newly enlarged, updated second edition of a valuable text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discusses binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. 153 black-and-white illus. 23 tables.Newly enlarged, updated second edition of a valuable, widely used text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discussed are binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. New to this edition: Chapter 9

Resolving combinatorial ambiguities in dilepton t t¯ event topologies with constrained M2 variables

Science.gov (United States)

Debnath, Dipsikha; Kim, Doojin; Kim, Jeong Han; Kong, Kyoungchul; Matchev, Konstantin T.

2017-10-01

We advocate the use of on-shell constrained M2 variables in order to mitigate the combinatorial problem in supersymmetry-like events with two invisible particles at the LHC. We show that in comparison to other approaches in the literature, the constrained M2 variables provide superior ansätze for the unmeasured invisible momenta and therefore can be usefully applied to discriminate combinatorial ambiguities. We illustrate our procedure with the example of dilepton t t ¯ events. We critically review the existing methods based on the Cambridge MT 2 variable and MAOS reconstruction of invisible momenta, and show that their algorithm can be simplified without loss of sensitivity, due to a perfect correlation between events with complex solutions for the invisible momenta and events exhibiting a kinematic endpoint violation. Then we demonstrate that the efficiency for selecting the correct partition is further improved by utilizing the M2 variables instead. Finally, we also consider the general case when the underlying mass spectrum is unknown, and no kinematic endpoint information is available.

On language acquisition in speech and sign:development drives combinatorial structure in both modalities

Directory of Open Access Journals (Sweden)

Gary eMorgan

2014-11-01

Full Text Available Languages are composed of a conventionalized system of parts which allow speakers and signers to compose an infinite number of form-meaning mappings through phonological and morphological combinations. This level of linguistic organization distinguishes language from other communicative acts such as gestures. In contrast to signs, gestures are made up of meaning units that are mostly holistic. Children exposed to signed and spoken languages from early in life develop grammatical structure following similar rates and patterns. This is interesting, because signed languages are perceived and articulated in very different ways to their spoken counterparts with many signs displaying surface resemblances to gestures. The acquisition of forms and meanings in child signers and talkers might thus have been a different process. Yet in one sense both groups are faced with a similar problem: 'how do I make a language with combinatorial structure’? In this paper I argue first language development itself enables this to happen and by broadly similar mechanisms across modalities. Combinatorial structure is the outcome of phonological simplifications and productivity in using verb morphology by children in sign and speech.

SDG multiple fault diagnosis by real-time inverse inference

International Nuclear Information System (INIS)

Zhang Zhaoqian; Wu Chongguang; Zhang Beike; Xia Tao; Li Anfeng

2005-01-01

In the past 20 years, one of the qualitative simulation technologies, signed directed graph (SDG) has been widely applied in the field of chemical fault diagnosis. However, the assumption of single fault origin was usually used by many former researchers. As a result, this will lead to the problem of combinatorial explosion and has limited SDG to the realistic application on the real process. This is mainly because that most of the former researchers used forward inference engine in the commercial expert system software to carry out the inverse diagnosis inference on the SDG model which violates the internal principle of diagnosis mechanism. In this paper, we present a new SDG multiple faults diagnosis method by real-time inverse inference. This is a method of multiple faults diagnosis from the genuine significance and the inference engine use inverse mechanism. At last, we give an example of 65t/h furnace diagnosis system to demonstrate its applicability and efficiency

SDG multiple fault diagnosis by real-time inverse inference

Energy Technology Data Exchange (ETDEWEB)

Zhang Zhaoqian; Wu Chongguang; Zhang Beike; Xia Tao; Li Anfeng

2005-02-01

In the past 20 years, one of the qualitative simulation technologies, signed directed graph (SDG) has been widely applied in the field of chemical fault diagnosis. However, the assumption of single fault origin was usually used by many former researchers. As a result, this will lead to the problem of combinatorial explosion and has limited SDG to the realistic application on the real process. This is mainly because that most of the former researchers used forward inference engine in the commercial expert system software to carry out the inverse diagnosis inference on the SDG model which violates the internal principle of diagnosis mechanism. In this paper, we present a new SDG multiple faults diagnosis method by real-time inverse inference. This is a method of multiple faults diagnosis from the genuine significance and the inference engine use inverse mechanism. At last, we give an example of 65t/h furnace diagnosis system to demonstrate its applicability and efficiency.

Two projects in theoretical neuroscience: A convolution-based metric for neural membrane potentials and a combinatorial connectionist semantic network method

Science.gov (United States)

Evans, Garrett Nolan

In this work, I present two projects that both contribute to the aim of discovering how intelligence manifests in the brain. The first project is a method for analyzing recorded neural signals, which takes the form of a convolution-based metric on neural membrane potential recordings. Relying only on integral and algebraic operations, the metric compares the timing and number of spikes within recordings as well as the recordings' subthreshold features: summarizing differences in these with a single "distance" between the recordings. Like van Rossum's (2001) metric for spike trains, the metric is based on a convolution operation that it performs on the input data. The kernel used for the convolution is carefully chosen such that it produces a desirable frequency space response and, unlike van Rossum's kernel, causes the metric to be first order both in differences between nearby spike times and in differences between same-time membrane potential values: an important trait. The second project is a combinatorial syntax method for connectionist semantic network encoding. Combinatorial syntax has been a point on which those who support a symbol-processing view of intelligent processing and those who favor a connectionist view have had difficulty seeing eye-to-eye. Symbol-processing theorists have persuasively argued that combinatorial syntax is necessary for certain intelligent mental operations, such as reasoning by analogy. Connectionists have focused on the versatility and adaptability offered by self-organizing networks of simple processing units. With this project, I show that there is a way to reconcile the two perspectives and to ascribe a combinatorial syntax to a connectionist network. The critical principle is to interpret nodes, or units, in the connectionist network as bound integrations of the interpretations for nodes that they share links with. Nodes need not correspond exactly to neurons and may correspond instead to distributed sets, or assemblies, of

Two-dimensional combinatorial screening enables the bottom-up design of a microRNA-10b inhibitor.

Science.gov (United States)

Velagapudi, Sai Pradeep; Disney, Matthew D

2014-03-21

The RNA motifs that bind guanidinylated kanamycin A (G Kan A) and guanidinylated neomycin B (G Neo B) were identified via two-dimensional combinatorial screening (2DCS). The results of these studies enabled the "bottom-up" design of a small molecule inhibitor of oncogenic microRNA-10b.

Combinatorial Alanine Substitution Enables Rapid Optimization of Cytochrome P450BM3 for Selective Hydroxylation of Large Substrates

KAUST Repository

Lewis, Jared C.; Mantovani, Simone M.; Fu, Yu; Snow, Christopher D.; Komor, Russell S.; Wong , Chi-Huey; Arnold, Frances H.

2010-01-01

Made for each other: Combinatorial alanine substitution of active site residues in a thermostable cytochrome P450BM3 variant was used to generate an enzyme that is active with large substrates. Selective hydroxylation of methoxymethylated

The World of Combinatorial Fuzzy Problems and the Efficiency of Fuzzy Approximation Algorithms

OpenAIRE

Yamakami, Tomoyuki

2015-01-01

We re-examine a practical aspect of combinatorial fuzzy problems of various types, including search, counting, optimization, and decision problems. We are focused only on those fuzzy problems that take series of fuzzy input objects and produce fuzzy values. To solve such problems efficiently, we design fast fuzzy algorithms, which are modeled by polynomial-time deterministic fuzzy Turing machines equipped with read-only auxiliary tapes and write-only output tapes and also modeled by polynomia...

Oligomeric models for estimation of polydimethylsiloxane-water partition ratios with COSMO-RS theory: impact of the combinatorial term on absolute error.

Science.gov (United States)

Parnis, J Mark; Mackay, Donald

2017-03-22

A series of 12 oligomeric models for polydimethylsiloxane (PDMS) were evaluated for their effectiveness in estimating the PDMS-water partition ratio, K PDMS-w . Models ranging in size and complexity from the -Si(CH 3 ) 2 -O- model previously published by Goss in 2011 to octadeca-methyloctasiloxane (CH 3 -(Si(CH 3 ) 2 -O-) 8 CH 3 ) were assessed based on their RMS error with 253 experimental measurements of log K PDMS-w from six published works. The lowest RMS error for log K PDMS-w (0.40 in log K) was obtained with the cyclic oligomer, decamethyl-cyclo-penta-siloxane (D5), (-Si(CH 3 ) 2 -O-) 5 , with the mixing-entropy associated combinatorial term included in the chemical potential calculation. The presence or absence of terminal methyl groups on linear oligomer models is shown to have significant impact only for oligomers containing 1 or 2 -Si(CH 3 ) 2 -O- units. Removal of the combinatorial term resulted in a significant increase in the RMS error for most models, with the smallest increase associated with the largest oligomer studied. The importance of inclusion of the combinatorial term in the chemical potential for liquid oligomer models is discussed.

Combinatorial Optimization Algorithms for Dynamic Multiple Fault Diagnosis in Automotive and Aerospace Applications

Science.gov (United States)

Kodali, Anuradha

In this thesis, we develop dynamic multiple fault diagnosis (DMFD) algorithms to diagnose faults that are sporadic and coupled. Firstly, we formulate a coupled factorial hidden Markov model-based (CFHMM) framework to diagnose dependent faults occurring over time (dynamic case). Here, we implement a mixed memory Markov coupling model to determine the most likely sequence of (dependent) fault states, the one that best explains the observed test outcomes over time. An iterative Gauss-Seidel coordinate ascent optimization method is proposed for solving the problem. A soft Viterbi algorithm is also implemented within the framework for decoding dependent fault states over time. We demonstrate the algorithm on simulated and real-world systems with coupled faults; the results show that this approach improves the correct isolation rate as compared to the formulation where independent fault states are assumed. Secondly, we formulate a generalization of set-covering, termed dynamic set-covering (DSC), which involves a series of coupled set-covering problems over time. The objective of the DSC problem is to infer the most probable time sequence of a parsimonious set of failure sources that explains the observed test outcomes over time. The DSC problem is NP-hard and intractable due to the fault-test dependency matrix that couples the failed tests and faults via the constraint matrix, and the temporal dependence of failure sources over time. Here, the DSC problem is motivated from the viewpoint of a dynamic multiple fault diagnosis problem, but it has wide applications in operations research, for e.g., facility location problem. Thus, we also formulated the DSC problem in the context of a dynamically evolving facility location problem. Here, a facility can be opened, closed, or can be temporarily unavailable at any time for a given requirement of demand points. These activities are associated with costs or penalties, viz., phase-in or phase-out for the opening or closing of a

Uniformly constructing combinatorial solutions, combining a rational function with hyperbolic or trigonometric functions, for the (2+1) dimensional Broer-Kaup-Kupershmidt equation

International Nuclear Information System (INIS)

Liu Qing; Wang Zihua

2010-01-01

According to two dependent rational solutions to a generalized Riccati equation together with the equation itself, a rational-exponent solution to a nonlinear partial differential equation can be constructed. By selecting different parameter values in the rational-exponent solution, many families of combinatorial solutions combined with a rational function such as hyperbolic functions or trigonometric functions, are rapidly derived. This method is applied to the Whitham-Broer-Kaup equation and a series of combinatorial solutions are obtained, showing that this method is a more concise and efficient approach and can uniformly construct many types of combined solutions to nonlinear partial differential equations.

Solution of combinatorial optimization problems by an accelerated hopfield neural network. Kobai kasokugata poppu firudo nyuraru netto ni yoru kumiawase saitekika mondai no kaiho

Energy Technology Data Exchange (ETDEWEB)

Ohori, T.; Yamamoto, H.; Setsu, Nenso; Watanabe, K. (Hokkaido Inst. of Technology, Hokkaido (Japan))

1994-04-20

The accelerated approximate solution of combinatorial optimization problems by symmetry integrating hopfield neural network (NN) has been applied to many combinatorial problems such as the traveling salesman problem, the network planning problem, etc. However, the hopfield NN converges to local minimum solutions very slowly. In this paper, a general inclination model composed by introducing an accelerated parameter to the hopfield model is proposed, and it has been shown that the acceleration parameter can make the model converge to the local minima more quickly. Moreover, simulation experiments for random quadratic combinatorial problems with two and twenty-five variables were carried out. The results show that the acceleration of convergence makes the attraction region of the local minimum change and the accuracy of solution worse. If an initial point is selected around the center of unit hyper cube, solutions with high accuracy not affected by the acceleration parameter can be obtained. 9 refs., 8 figs., 3 tabs.

A new statistical method for transfer coefficient calculations in the framework of the general multiple-compartment model of transport for radionuclides in biological systems.

Science.gov (United States)

Garcia, F; Arruda-Neto, J D; Manso, M V; Helene, O M; Vanin, V R; Rodriguez, O; Mesa, J; Likhachev, V P; Filho, J W; Deppman, A; Perez, G; Guzman, F; de Camargo, S P

1999-10-01

A new and simple statistical procedure (STATFLUX) for the calculation of transfer coefficients of radionuclide transport to animals and plants is proposed. The method is based on the general multiple-compartment model, which uses a system of linear equations involving geometrical volume considerations. By using experimentally available curves of radionuclide concentrations versus time, for each animal compartment (organs), flow parameters were estimated by employing a least-squares procedure, whose consistency is tested. Some numerical results are presented in order to compare the STATFLUX transfer coefficients with those from other works and experimental data.

A new statistical method for transfer coefficient calculations in the framework of the general multiple-compartment model of transport for radionuclides in biological systems

International Nuclear Information System (INIS)

Garcia, F.; Manso, M.V.; Rodriguez, O.; Mesa, J.; Arruda-Neto, J.D.T.; Helene, O.M.; Vanin, V.R.; Likhachev, V.P.; Pereira Filho, J.W.; Deppman, A.; Perez, G.; Guzman, F.; Camargo, S.P. de

1999-01-01

A new and simple statistical procedure (STATFLUX) for the calculation of transfer coefficients of radionuclide transport to animals and plants is proposed. The method is based on the general multiple-compartment model, which uses a system of linear equations involving geometrical volume considerations. By using experimentally available curves of radionuclide concentrations versus time, for each animal compartment (organs), flow parameters were estimated by employing a least-squares procedure, whose consistency is tested. Some numerical results are presented in order to compare the STATFLUX transfer coefficients with those from other works and experimental data. (author)

The role of international policy transfer within the Multiple Streams Approach: the case of smart electricity metering in Australia

OpenAIRE

Lovell, Heather

2016-01-01

This paper draws on Kingdon’s Multiple Streams Approach (MSA) to consider international flows of policy, not just domestic. It is argued that using the MSA in conjunction with international policy transfer and mobility theories allows for a fuller explanation of the development of smart electricity metering policy in Australia. The MSA is based originally on empirical research within a single country - the USA - in the late 1970s, and all three of the ‘streams’ identified as important to poli...

Application of combinatorial biocatalysis for a unique ring expansion of dihydroxymethylzearalenone.

Science.gov (United States)

Rich, Joseph O; Budde, Cheryl L; McConeghey, Luke D; Cotterill, Ian C; Mozhaev, Vadim V; Singh, Sheo B; Goetz, Michael A; Zhao, Annie; Michels, Peter C; Khmelnitsky, Yuri L

2009-06-01

Combinatorial biocatalysis was applied to generate a diverse set of dihydroxymethylzearalenone analogs with modified ring structure. In one representative chemoenzymatic reaction sequence, dihydroxymethylzearalenone was first subjected to a unique enzyme-catalyzed oxidative ring opening reaction that creates two new carboxylic groups on the molecule. These groups served as reaction sites for further derivatization involving biocatalytic ring closure reactions with structurally diverse bifunctional reagents, including different diols and diamines. As a result, a library of cyclic bislactones and bislactams was created, with modified ring structures covering chemical space and structure activity relationships unattainable by conventional synthetic means.

Combinatorial Reductions for the Stanley Depth of I and S/I

Energy Technology Data Exchange (ETDEWEB)

Keller, Mitchel T.; Young, Stephen J.

2017-09-07

We develop combinatorial tools to study the realtionship between the Stanley depth of a monomial ideal I and the Stanley depth of its compliment S/I. Using these results we prove that if S is a polynomial ring with at most 5 indeterminates and I is a square-free monomial ideal, then the Stanley depth of I is strictly larger than the Stanley depth of S/I. Using a computer search, we extend the strict inequality to the case of polynomial rings with at most 7 indeterminates. This partially answers questinos asked by Proescu and Qureshi as well as Herzog.

Higher order energy transfer. Quantum electrodynamical calculations and graphical representation

International Nuclear Information System (INIS)

Jenkins, R.D.

2000-01-01

In Chapter 1, a novel method of calculating quantum electrodynamic amplitudes is formulated using combinatorial theory. This technique is used throughout instead of conventional time-ordered methods. A variety of hyperspaces are discussed to highlight isomorphism between a number of A generalisation of Pascal's triangle is shown to be beneficial in determining the form of hyperspace graphs. Chapter 2 describes laser assisted resonance energy transfer (LARET), a higher order perturbative contribution to the well-known process resonance energy transfer, accommodating an off resonance auxiliary laser field to stimulate the migration. Interest focuses on energy exchanges between two uncorrelated molecular species, as in a system where molecules are randomly oriented. Both phase-weighted and standard isotropic averaging are required for the calculations. Results are discussed in terms of a laser intensity-dependent mechanism. Identifying the applied field regime where LARET should prove experimentally significant, transfer rate increases of up to 30% are predicted. General results for three-center energy transfer are elucidated in chapter 3. Cooperative and accretive mechanistic pathways are identified with theory formulated to elicit their role in a variety of energy transfer phenomena and their relative dominance. In multichromophoric the interplay of such factors is analysed with regard to molecular architectures. The alignments and magnitudes of donor and acceptor transition moments and polarisabilities prove to have profound effects on achievable pooling efficiency for linear configurations. Also optimum configurations are offered. In ionic lattices, although both mechanisms play significant roles in pooling and cutting processes, only the accretive is responsible for sensitisation. The local, microscopic level results are used to gauge the lattice response, encompassing concentration and structural effects. (author)

Standardization of milk mid-infrared spectrometers for the transfer and use of multiple models.

Science.gov (United States)

Grelet, C; Pierna, J A Fernández; Dardenne, P; Soyeurt, H; Vanlierde, A; Colinet, F; Bastin, C; Gengler, N; Baeten, V; Dehareng, F

2017-10-01

An increasing number of models are being developed to provide information from milk Fourier transform mid-infrared (FT-MIR) spectra on fine milk composition, technological properties of milk, or even cows' physiological status. In this context, and to take advantage of these existing models, the purpose of this work was to evaluate whether a spectral standardization method can enable the use of multiple equations within a network of different FT-MIR spectrometers. The piecewise direct standardization method was used, matching "slave" instruments to a common reference, the "master." The effect of standardization on network reproducibility was assessed on 66 instruments from 3 different brands by comparing the spectral variability of the slaves and the master with and without standardization. With standardization, the global Mahalanobis distance from the slave spectra to the master spectra was reduced on average from 2,655.9 to 14.3, representing a significant reduction of noninformative spectral variability. The transfer of models from instrument to instrument was tested using 3 FT-MIR models predicting (1) the quantity of daily methane emitted by dairy cows, (2) the concentration of polyunsaturated fatty acids in milk, and (3) the fresh cheese yield. The differences, in terms of root mean squared error, between master predictions and slave predictions were reduced after standardization on average from 103 to 17 g/d, from 0.0315 to 0.0045 g/100 mL of milk, and from 2.55 to 0.49 g of curd/100 g of milk, respectively. For all the models, standard deviations of predictions among all the instruments were also reduced by 5.11 times for methane, 5.01 times for polyunsaturated fatty acids, and 7.05 times for fresh cheese yield, showing an improvement of prediction reproducibility within the network. Regarding the results obtained, spectral standardization allows the transfer and use of multiple models on all instruments as well as the improvement of spectral and prediction

Evaluation of Closed Adult Nucleus Multiple Ovulation and Embryo Transfer and Conventional Progeny Testing Breeding Schemes for Milk Production from Crossbred Cattle in the Tropics

NARCIS (Netherlands)

Kosgey, I.S.; Kahi, A.K.; Arendonk, van J.A.M.

2005-01-01

The potential benefits of closed adult nucleus multiple ovulation and embryo transfer (MOET) and conventional progeny testing (CNS) schemes, and the logistics of their integration into large-scale continuous production of crossbred cattle were studied by deterministic simulation. The latter was

Combinatorial and geometric aspects of Feynman graphs and Feynman integrals

Energy Technology Data Exchange (ETDEWEB)

Bergbauer, Christoph

2009-06-11

The integrals associated to Feynman graphs must have been a source of frustration for particle physicists ever since. Indeed there is a delicate difference between being able to draw a Feynman graph and being able to compute the associated Feynman integral. Although perturbation theory has brought enormous breakthroughs, many physicists turned to more abstract developments in quantum field theory, looked for other ways to produce perturbational results, or left the field entirely. Nonetheless there is a significant number of physicists, computational and theoretical, who pursue the quest for concepts and algorithms to compute and understand those integrals to higher and higher orders. Their motivation is to help test the validity of the underlying physical theory. For a mathematician, Feynman graphs and their integrals provide a rich subject in their own right, independent of their computability. It was only recently though that the work of Bloch, Esnault and Kreimer has brought a growing interest of mathematicians from various disciplines to the subject. In fact it opened up a completely new direction of research: a motivic interpretation of Feynman graphs that unites their combinatorial, geometric and arithmetic aspects. This idea had been in the air for a while, based on computational results of Broadhurst and Kreimer, and on a theorem of Belkale and Brosnan related to a conjecture of Kontsevich about the generality of the underlying motives. A prerequisite for the motivic approach is a profound understanding of renormalization that was established less recently in a modern language by Connes and Kreimer. This dissertation studies the renormalization of Feynman graphs in position space using an adapted resolution of singularities, and makes two other contributions of mostly combinatorial nature to the subject. I hope this may serve as a reference for somebody who feels comfortable with the traditional position space literature and looks for a transition to the

Combinatorial Pooling Enables Selective Sequencing of the Barley Gene Space

Science.gov (United States)

Lonardi, Stefano; Duma, Denisa; Alpert, Matthew; Cordero, Francesca; Beccuti, Marco; Bhat, Prasanna R.; Wu, Yonghui; Ciardo, Gianfranco; Alsaihati, Burair; Ma, Yaqin; Wanamaker, Steve; Resnik, Josh; Bozdag, Serdar; Luo, Ming-Cheng; Close, Timothy J.

2013-01-01

For the vast majority of species – including many economically or ecologically important organisms, progress in biological research is hampered due to the lack of a reference genome sequence. Despite recent advances in sequencing technologies, several factors still limit the availability of such a critical resource. At the same time, many research groups and international consortia have already produced BAC libraries and physical maps and now are in a position to proceed with the development of whole-genome sequences organized around a physical map anchored to a genetic map. We propose a BAC-by-BAC sequencing protocol that combines combinatorial pooling design and second-generation sequencing technology to efficiently approach denovo selective genome sequencing. We show that combinatorial pooling is a cost-effective and practical alternative to exhaustive DNA barcoding when preparing sequencing libraries for hundreds or thousands of DNA samples, such as in this case gene-bearing minimum-tiling-path BAC clones. The novelty of the protocol hinges on the computational ability to efficiently compare hundred millions of short reads and assign them to the correct BAC clones (deconvolution) so that the assembly can be carried out clone-by-clone. Experimental results on simulated data for the rice genome show that the deconvolution is very accurate, and the resulting BAC assemblies have high quality. Results on real data for a gene-rich subset of the barley genome confirm that the deconvolution is accurate and the BAC assemblies have good quality. While our method cannot provide the level of completeness that one would achieve with a comprehensive whole-genome sequencing project, we show that it is quite successful in reconstructing the gene sequences within BACs. In the case of plants such as barley, this level of sequence knowledge is sufficient to support critical end-point objectives such as map-based cloning and marker-assisted breeding. PMID:23592960

Combinatorial and geometric aspects of Feynman graphs and Feynman integrals

International Nuclear Information System (INIS)

Bergbauer, Christoph

2009-01-01

The integrals associated to Feynman graphs must have been a source of frustration for particle physicists ever since. Indeed there is a delicate difference between being able to draw a Feynman graph and being able to compute the associated Feynman integral. Although perturbation theory has brought enormous breakthroughs, many physicists turned to more abstract developments in quantum field theory, looked for other ways to produce perturbational results, or left the field entirely. Nonetheless there is a significant number of physicists, computational and theoretical, who pursue the quest for concepts and algorithms to compute and understand those integrals to higher and higher orders. Their motivation is to help test the validity of the underlying physical theory. For a mathematician, Feynman graphs and their integrals provide a rich subject in their own right, independent of their computability. It was only recently though that the work of Bloch, Esnault and Kreimer has brought a growing interest of mathematicians from various disciplines to the subject. In fact it opened up a completely new direction of research: a motivic interpretation of Feynman graphs that unites their combinatorial, geometric and arithmetic aspects. This idea had been in the air for a while, based on computational results of Broadhurst and Kreimer, and on a theorem of Belkale and Brosnan related to a conjecture of Kontsevich about the generality of the underlying motives. A prerequisite for the motivic approach is a profound understanding of renormalization that was established less recently in a modern language by Connes and Kreimer. This dissertation studies the renormalization of Feynman graphs in position space using an adapted resolution of singularities, and makes two other contributions of mostly combinatorial nature to the subject. I hope this may serve as a reference for somebody who feels comfortable with the traditional position space literature and looks for a transition to the

Combinatorial pooling enables selective sequencing of the barley gene space.

Directory of Open Access Journals (Sweden)

Stefano Lonardi

2013-04-01

Full Text Available For the vast majority of species - including many economically or ecologically important organisms, progress in biological research is hampered due to the lack of a reference genome sequence. Despite recent advances in sequencing technologies, several factors still limit the availability of such a critical resource. At the same time, many research groups and international consortia have already produced BAC libraries and physical maps and now are in a position to proceed with the development of whole-genome sequences organized around a physical map anchored to a genetic map. We propose a BAC-by-BAC sequencing protocol that combines combinatorial pooling design and second-generation sequencing technology to efficiently approach denovo selective genome sequencing. We show that combinatorial pooling is a cost-effective and practical alternative to exhaustive DNA barcoding when preparing sequencing libraries for hundreds or thousands of DNA samples, such as in this case gene-bearing minimum-tiling-path BAC clones. The novelty of the protocol hinges on the computational ability to efficiently compare hundred millions of short reads and assign them to the correct BAC clones (deconvolution so that the assembly can be carried out clone-by-clone. Experimental results on simulated data for the rice genome show that the deconvolution is very accurate, and the resulting BAC assemblies have high quality. Results on real data for a gene-rich subset of the barley genome confirm that the deconvolution is accurate and the BAC assemblies have good quality. While our method cannot provide the level of completeness that one would achieve with a comprehensive whole-genome sequencing project, we show that it is quite successful in reconstructing the gene sequences within BACs. In the case of plants such as barley, this level of sequence knowledge is sufficient to support critical end-point objectives such as map-based cloning and marker-assisted breeding.

Combinatorial pooling enables selective sequencing of the barley gene space.

Science.gov (United States)

Lonardi, Stefano; Duma, Denisa; Alpert, Matthew; Cordero, Francesca; Beccuti, Marco; Bhat, Prasanna R; Wu, Yonghui; Ciardo, Gianfranco; Alsaihati, Burair; Ma, Yaqin; Wanamaker, Steve; Resnik, Josh; Bozdag, Serdar; Luo, Ming-Cheng; Close, Timothy J

2013-04-01

For the vast majority of species - including many economically or ecologically important organisms, progress in biological research is hampered due to the lack of a reference genome sequence. Despite recent advances in sequencing technologies, several factors still limit the availability of such a critical resource. At the same time, many research groups and international consortia have already produced BAC libraries and physical maps and now are in a position to proceed with the development of whole-genome sequences organized around a physical map anchored to a genetic map. We propose a BAC-by-BAC sequencing protocol that combines combinatorial pooling design and second-generation sequencing technology to efficiently approach denovo selective genome sequencing. We show that combinatorial pooling is a cost-effective and practical alternative to exhaustive DNA barcoding when preparing sequencing libraries for hundreds or thousands of DNA samples, such as in this case gene-bearing minimum-tiling-path BAC clones. The novelty of the protocol hinges on the computational ability to efficiently compare hundred millions of short reads and assign them to the correct BAC clones (deconvolution) so that the assembly can be carried out clone-by-clone. Experimental results on simulated data for the rice genome show that the deconvolution is very accurate, and the resulting BAC assemblies have high quality. Results on real data for a gene-rich subset of the barley genome confirm that the deconvolution is accurate and the BAC assemblies have good quality. While our method cannot provide the level of completeness that one would achieve with a comprehensive whole-genome sequencing project, we show that it is quite successful in reconstructing the gene sequences within BACs. In the case of plants such as barley, this level of sequence knowledge is sufficient to support critical end-point objectives such as map-based cloning and marker-assisted breeding.

The Optimization Based Dynamic and Cyclic Working Strategies for Rechargeable Wireless Sensor Networks with Multiple Base Stations and Wireless Energy Transfer Devices

Science.gov (United States)

Ding, Xu; Han, Jianghong; Shi, Lei

2015-01-01

In this paper, the optimal working schemes for wireless sensor networks with multiple base stations and wireless energy transfer devices are proposed. The wireless energy transfer devices also work as data gatherers while charging sensor nodes. The wireless sensor network is firstly divided into sub networks according to the concept of Voronoi diagram. Then, the entire energy replenishing procedure is split into the pre-normal and normal energy replenishing stages. With the objective of maximizing the sojourn time ratio of the wireless energy transfer device, a continuous time optimization problem for the normal energy replenishing cycle is formed according to constraints with which sensor nodes and wireless energy transfer devices should comply. Later on, the continuous time optimization problem is reshaped into a discrete multi-phased optimization problem, which yields the identical optimality. After linearizing it, we obtain a linear programming problem that can be solved efficiently. The working strategies of both sensor nodes and wireless energy transfer devices in the pre-normal replenishing stage are also discussed in this paper. The intensive simulations exhibit the dynamic and cyclic working schemes for the entire energy replenishing procedure. Additionally, a way of eliminating “bottleneck” sensor nodes is also developed in this paper. PMID:25785305

The optimization based dynamic and cyclic working strategies for rechargeable wireless sensor networks with multiple base stations and wireless energy transfer devices.

Science.gov (United States)

Ding, Xu; Han, Jianghong; Shi, Lei

2015-03-16

In this paper, the optimal working schemes for wireless sensor networks with multiple base stations and wireless energy transfer devices are proposed. The wireless energy transfer devices also work as data gatherers while charging sensor nodes. The wireless sensor network is firstly divided into sub networks according to the concept of Voronoi diagram. Then, the entire energy replenishing procedure is split into the pre-normal and normal energy replenishing stages. With the objective of maximizing the sojourn time ratio of the wireless energy transfer device, a continuous time optimization problem for the normal energy replenishing cycle is formed according to constraints with which sensor nodes and wireless energy transfer devices should comply. Later on, the continuous time optimization problem is reshaped into a discrete multi-phased optimization problem, which yields the identical optimality. After linearizing it, we obtain a linear programming problem that can be solved efficiently. The working strategies of both sensor nodes and wireless energy transfer devices in the pre-normal replenishing stage are also discussed in this paper. The intensive simulations exhibit the dynamic and cyclic working schemes for the entire energy replenishing procedure. Additionally, a way of eliminating "bottleneck" sensor nodes is also developed in this paper.

A Simple Combinatorial Codon Mutagenesis Method for Targeted Protein Engineering.

Science.gov (United States)

Belsare, Ketaki D; Andorfer, Mary C; Cardenas, Frida S; Chael, Julia R; Park, Hyun June; Lewis, Jared C

2017-03-17

Directed evolution is a powerful tool for optimizing enzymes, and mutagenesis methods that improve enzyme library quality can significantly expedite the evolution process. Here, we report a simple method for targeted combinatorial codon mutagenesis (CCM). To demonstrate the utility of this method for protein engineering, CCM libraries were constructed for cytochrome P450 BM3 , pfu prolyl oligopeptidase, and the flavin-dependent halogenase RebH; 10-26 sites were targeted for codon mutagenesis in each of these enzymes, and libraries with a tunable average of 1-7 codon mutations per gene were generated. Each of these libraries provided improved enzymes for their respective transformations, which highlights the generality, simplicity, and tunability of CCM for targeted protein engineering.

The Complement of Binary Klein Quadric as a Combinatorial Grassmannian

Directory of Open Access Journals (Sweden)

Metod Saniga

2015-06-01

Full Text Available Given a hyperbolic quadric of PG(5, 2, there are 28 points off this quadric and 56 lines skew to it. It is shown that the (286; 563-configuration formed by these points and lines is isomorphic to the combinatorial Grassmannian of type G2(8. It is also pointed out that a set of seven points of G2(8 whose labels share a mark corresponds to a Conwell heptad of PG(5, 2. Gradual removal of Conwell heptads from the (286; 563-configuration yields a nested sequence of binomial configurations identical with part of that found to be associated with Cayley-Dickson algebras (arXiv:1405.6888.

Identification of avocado (Persea americana) pulp proteins by nano-LC-MS/MS via combinatorial peptide ligand libraries.

Science.gov (United States)

Esteve, Clara; D'Amato, Alfonsina; Marina, María Luisa; García, María Concepción; Righetti, Pier Giorgio

2012-09-01

Avocado (Persea americana) proteins have been scarcely studied despite their importance, especially in food related allergies. The proteome of avocado pulp was explored in depth by extracting proteins with capture by combinatorial peptide ligand libraries at pH 7.4 and under conditions mimicking reverse-phase capture at pH 2.2. The total number of unique gene products identified amounts to 1012 proteins, of which 174 are in common with the control, untreated sample, 190 are present only in the control and 648 represent the new species detected via combinatorial peptide ligand libraries of all combined eluates and likely represent low-abundance proteins. Among the 1012 proteins, it was possible to identify the already known avocado allergen Pers a 1 and different proteins susceptible to be allergens such as a profilin, a polygalacturonase, a thaumatin-like protein, a glucanase, and an isoflavone reductase like protein. © 2012 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Cathodoluminescence and ion beam analysis of ion-implanted combinatorial materials libraries on thermally grown SiO2

International Nuclear Information System (INIS)

Chen, C.-M.; Pan, H.C.; Zhu, D.Z.; Hu, J.; Li, M.Q.

1999-01-01

A method combining ion implantation and physical masking technique has been used to generate material libraries of various ion-implanted samples. Ion species of C, Ga, N, Pb, Sn, Y have been sequentially implanted to an SiO 2 film grown on a silicon wafer through combinatorial masks and consequently a library of 64 (2 6 ) samples is generated by 6 masking combinations. This approach offers rapid synthesis of samples with potential new compounds formed in the matrix, which may have specific luminescent properties. The depth-resolved cathodoluminescence (CL) measurements revealed some specific optical property in the samples correlated with implanted ion distributions. A marker-based technique is developed for the convenient location of sample site in the analysis of Rutherford backscattering spectrometry (RBS) and proton elastic scattering (PES), intended to characterize rapidly the ion implanted film libraries. These measurements demonstrate the power of nondestructively and rapidly characterizing composition and the inhomogeneity of the combinatorial film libraries, which may determine their physical properties

Statistical physics of hard combinatorial optimization: Vertex cover problem

Science.gov (United States)

Zhao, Jin-Hua; Zhou, Hai-Jun

2014-07-01

Typical-case computation complexity is a research topic at the boundary of computer science, applied mathematics, and statistical physics. In the last twenty years, the replica-symmetry-breaking mean field theory of spin glasses and the associated message-passing algorithms have greatly deepened our understanding of typical-case computation complexity. In this paper, we use the vertex cover problem, a basic nondeterministic-polynomial (NP)-complete combinatorial optimization problem of wide application, as an example to introduce the statistical physical methods and algorithms. We do not go into the technical details but emphasize mainly the intuitive physical meanings of the message-passing equations. A nonfamiliar reader shall be able to understand to a large extent the physics behind the mean field approaches and to adjust the mean field methods in solving other optimization problems.

Discovery of DNA repair inhibitors by combinatorial library profiling

Science.gov (United States)

Moeller, Benjamin J.; Sidman, Richard L.; Pasqualini, Renata; Arap, Wadih

2011-01-01

Small molecule inhibitors of DNA repair are emerging as potent and selective anti-cancer therapies, but the sheer magnitude of the protein networks involved in DNA repair processes poses obstacles to discovery of effective candidate drugs. To address this challenge, we used a subtractive combinatorial selection approach to identify a panel of peptide ligands that bind DNA repair complexes. Supporting the concept that these ligands have therapeutic potential, we show that one selected peptide specifically binds and non-competitively inactivates DNA-PKcs, a protein kinase critical in double-strand DNA break repair. In doing so, this ligand sensitizes BRCA-deficient tumor cells to genotoxic therapy. Our findings establish a platform for large-scale parallel screening for ligand-directed DNA repair inhibitors, with immediate applicability to cancer therapy. PMID:21343400

Bi-objective optimization of a multiple-target active debris removal mission

Science.gov (United States)

Bérend, Nicolas; Olive, Xavier

2016-05-01

The increasing number of space debris in Low-Earth Orbit (LEO) raises the question of future Active Debris Removal (ADR) operations. Typical ADR scenarios rely on an Orbital Transfer Vehicle (OTV) using one of the two following disposal strategies: the first one consists in attaching a deorbiting kit, such as a solid rocket booster, to the debris after rendezvous; with the second one, the OTV captures the debris and moves it to a low-perigee disposal orbit. For multiple-target ADR scenarios, the design of such a mission is very complex, as it involves two optimization levels: one for the space debris sequence, and a second one for the "elementary" orbit transfer strategy from a released debris to the next one in the sequence. This problem can be seen as a Time-Dependant Traveling Salesman Problem (TDTSP) with two objective functions to minimize: the total mission duration and the total propellant consumption. In order to efficiently solve this problem, ONERA has designed, under CNES contract, TOPAS (Tool for Optimal Planning of ADR Sequence), a tool that implements a Branch & Bound method developed in previous work together with a dedicated algorithm for optimizing the "elementary" orbit transfer. A single run of this tool yields an estimation of the Pareto front of the problem, which exhibits the trade-off between mission duration and propellant consumption. We first detail our solution to cope with the combinatorial explosion of complex ADR scenarios with 10 debris. The key point of this approach is to define the orbit transfer strategy through a small set of parameters, allowing an acceptable compromise between the quality of the optimum solution and the calculation cost. Then we present optimization results obtained for various 10 debris removal scenarios involving a 15-ton OTV, using either the deorbiting kit or the disposal orbit strategy. We show that the advantage of one strategy upon the other depends on the propellant margin, the maximum duration allowed

Exact combinatorial approach to finite coagulating systems

Science.gov (United States)

Fronczak, Agata; Chmiel, Anna; Fronczak, Piotr

2018-02-01

This paper outlines an exact combinatorial approach to finite coagulating systems. In this approach, cluster sizes and time are discrete and the binary aggregation alone governs the time evolution of the systems. By considering the growth histories of all possible clusters, an exact expression is derived for the probability of a coagulating system with an arbitrary kernel being found in a given cluster configuration when monodisperse initial conditions are applied. Then this probability is used to calculate the time-dependent distribution for the number of clusters of a given size, the average number of such clusters, and that average's standard deviation. The correctness of our general expressions is proved based on the (analytical and numerical) results obtained for systems with the constant kernel. In addition, the results obtained are compared with the results arising from the solutions to the mean-field Smoluchowski coagulation equation, indicating its weak points. The paper closes with a brief discussion on the extensibility to other systems of the approach presented herein, emphasizing the issue of arbitrary initial conditions.

Electricity price forecast using Combinatorial Neural Network trained by a new stochastic search method

International Nuclear Information System (INIS)

Abedinia, O.; Amjady, N.; Shafie-khah, M.; Catalão, J.P.S.

2015-01-01

Highlights: • Presenting a Combinatorial Neural Network. • Suggesting a new stochastic search method. • Adapting the suggested method as a training mechanism. • Proposing a new forecast strategy. • Testing the proposed strategy on real-world electricity markets. - Abstract: Electricity price forecast is key information for successful operation of electricity market participants. However, the time series of electricity price has nonlinear, non-stationary and volatile behaviour and so its forecast method should have high learning capability to extract the complex input/output mapping function of electricity price. In this paper, a Combinatorial Neural Network (CNN) based forecasting engine is proposed to predict the future values of price data. The CNN-based forecasting engine is equipped with a new training mechanism for optimizing the weights of the CNN. This training mechanism is based on an efficient stochastic search method, which is a modified version of chemical reaction optimization algorithm, giving high learning ability to the CNN. The proposed price forecast strategy is tested on the real-world electricity markets of Pennsylvania–New Jersey–Maryland (PJM) and mainland Spain and its obtained results are extensively compared with the results obtained from several other forecast methods. These comparisons illustrate effectiveness of the proposed strategy.

Economic evaluations of single- versus double-embryo transfer in IVF

NARCIS (Netherlands)

Fiddelers, A. A. A.; Severens, J. L.; Dirksen, C. D.; Dumoulin, J. C. M.; Land, J. A.; Evers, J. L. H.

2007-01-01

Multiple pregnancies lead to complications and induce high costs. The most successful way to decrease multiple pregnancies in IVF is to transfer only one embryo, which might reduce the efficacy of treatment. The objective of this review is to determine which embryo-transfer policy is most

Combinatorial support vector machines approach for virtual screening of selective multi-target serotonin reuptake inhibitors from large compound libraries.

Science.gov (United States)

Shi, Z; Ma, X H; Qin, C; Jia, J; Jiang, Y Y; Tan, C Y; Chen, Y Z

2012-02-01

Selective multi-target serotonin reuptake inhibitors enhance antidepressant efficacy. Their discovery can be facilitated by multiple methods, including in silico ones. In this study, we developed and tested an in silico method, combinatorial support vector machines (COMBI-SVMs), for virtual screening (VS) multi-target serotonin reuptake inhibitors of seven target pairs (serotonin transporter paired with noradrenaline transporter, H(3) receptor, 5-HT(1A) receptor, 5-HT(1B) receptor, 5-HT(2C) receptor, melanocortin 4 receptor and neurokinin 1 receptor respectively) from large compound libraries. COMBI-SVMs trained with 917-1951 individual target inhibitors correctly identified 22-83.3% (majority >31.1%) of the 6-216 dual inhibitors collected from literature as independent testing sets. COMBI-SVMs showed moderate to good target selectivity in misclassifying as dual inhibitors 2.2-29.8% (majority virtual hits correlate with the reported effects of their predicted targets. COMBI-SVM is potentially useful for searching selective multi-target agents without explicit knowledge of these agents. Copyright © 2011 Elsevier Inc. All rights reserved.

Combinatorial events of insertion sequences and ICE in Gram-negative bacteria.

Science.gov (United States)

Toleman, Mark A; Walsh, Timothy R

2011-09-01

The emergence of antibiotic and antimicrobial resistance in Gram-negative bacteria is incremental and linked to genetic elements that function in a so-called 'one-ended transposition' manner, including ISEcp1, ISCR elements and Tn3-like transposons. The power of these elements lies in their inability to consistently recognize one of their own terminal sequences, while recognizing more genetically distant surrogate sequences. This has the effect of mobilizing the DNA sequence found adjacent to their initial location. In general, resistance in Gram-negatives is closely linked to a few one-off events. These include the capture of the class 1 integron by a Tn5090-like transposon; the formation of the 3' conserved segment (3'-CS); and the fusion of the ISCR1 element to the 3'-CS. The structures formed by these rare events have been massively amplified and disseminated in Gram-negative bacteria, but hitherto, are rarely found in Gram-positives. Such events dominate current resistance gene acquisition and are instrumental in the construction of large resistance gene islands on chromosomes and plasmids. Similar combinatorial events appear to have occurred between conjugative plasmids and phages constructing hybrid elements called integrative and conjugative elements or conjugative transposons. These elements are beginning to be closely linked to some of the more powerful resistance mechanisms such as the extended spectrum β-lactamases, metallo- and AmpC type β-lactamases. Antibiotic resistance in Gram-negative bacteria is dominated by unusual combinatorial mistakes of Insertion sequences and gene fusions which have been selected and amplified by antibiotic pressure enabling the formation of extended resistance islands. © 2011 Federation of European Microbiological Societies. Published by Blackwell Publishing Ltd. All rights reserved.

Sequence conservation and combinatorial complexity of Drosophila neural precursor cell enhancers

Directory of Open Access Journals (Sweden)

Kuzin Alexander

2008-08-01

Full Text Available Abstract Background The presence of highly conserved sequences within cis-regulatory regions can serve as a valuable starting point for elucidating the basis of enhancer function. This study focuses on regulation of gene expression during the early events of Drosophila neural development. We describe the use of EvoPrinter and cis-Decoder, a suite of interrelated phylogenetic footprinting and alignment programs, to characterize highly conserved sequences that are shared among co-regulating enhancers. Results Analysis of in vivo characterized enhancers that drive neural precursor gene expression has revealed that they contain clusters of highly conserved sequence blocks (CSBs made up of shorter shared sequence elements which are present in different combinations and orientations within the different co-regulating enhancers; these elements contain either known consensus transcription factor binding sites or consist of novel sequences that have not been functionally characterized. The CSBs of co-regulated enhancers share a large number of sequence elements, suggesting that a diverse repertoire of transcription factors may interact in a highly combinatorial fashion to coordinately regulate gene expression. We have used information gained from our comparative analysis to discover an enhancer that directs expression of the nervy gene in neural precursor cells of the CNS and PNS. Conclusion The combined use EvoPrinter and cis-Decoder has yielded important insights into the combinatorial appearance of fundamental sequence elements required for neural enhancer function. Each of the 30 enhancers examined conformed to a pattern of highly conserved blocks of sequences containing shared constituent elements. These data establish a basis for further analysis and understanding of neural enhancer function.

Combinatorial Integer Labeling Thorems on Finite Sets with an Application to Discrete Systems of Nonlinear Equations

NARCIS (Netherlands)

van der Laan, G.; Talman, A.J.J.; Yang, Z.F.

2007-01-01

Tucker's well-known combinatorial lemma states that for any given symmetric triangulation of the n-dimensional unit cube and for any integer labeling that assigns to each vertex of the triangulation a label from the set f§1;§2; ¢ ¢ ¢ ;§ng with the property that antipodal vertices on the boundary of

Intracellular directed evolution of proteins from combinatorial libraries based on conditional phage replication.

Science.gov (United States)

Brödel, Andreas K; Jaramillo, Alfonso; Isalan, Mark

2017-09-01

Directed evolution is a powerful tool to improve the characteristics of biomolecules. Here we present a protocol for the intracellular evolution of proteins with distinct differences and advantages in comparison with established techniques. These include the ability to select for a particular function from a library of protein variants inside cells, minimizing undesired coevolution and propagation of nonfunctional library members, as well as allowing positive and negative selection logics using basally active promoters. A typical evolution experiment comprises the following stages: (i) preparation of a combinatorial M13 phagemid (PM) library expressing variants of the gene of interest (GOI) and preparation of the Escherichia coli host cells; (ii) multiple rounds of an intracellular selection process toward a desired activity; and (iii) the characterization of the evolved target proteins. The system has been developed for the selection of new orthogonal transcription factors (TFs) but is capable of evolving any gene-or gene circuit function-that can be linked to conditional M13 phage replication. Here we demonstrate our approach using as an example the directed evolution of the bacteriophage λ cI TF against two synthetic bidirectional promoters. The evolved TF variants enable simultaneous activation and repression against their engineered promoters and do not cross-react with the wild-type promoter, thus ensuring orthogonality. This protocol requires no special equipment, allowing synthetic biologists and general users to evolve improved biomolecules within ∼7 weeks.

Delineation of cortical pathology in multiple sclerosis using multi-surface magnetization transfer ratio imaging

Directory of Open Access Journals (Sweden)

David A. Rudko

2016-01-01

Full Text Available The purpose of our study was to evaluate the utility of measurements of cortical surface magnetization transfer ratio (csMTR on the inner, mid and outer cortical boundaries as clinically accessible biomarkers of cortical gray matter pathology in multiple sclerosis (MS. Twenty-five MS patients and 12 matched controls were recruited from the MS Clinic of the Montreal Neurological Institute. Anatomical and magnetization transfer ratio (MTR images were acquired using 3 Tesla MRI at baseline and two-year time-points. MTR maps were smoothed along meshes representing the inner, mid and outer neocortical boundaries. To evaluate csMTR reductions suggestive of sub-pial demyelination in MS patients, a mixed model analysis was carried out at both the individual vertex level and in anatomically parcellated brain regions. Our results demonstrate that focal areas of csMTR reduction are most prevalent along the outer cortical surface in the superior temporal and posterior cingulate cortices, as well as in the cuneus and precentral gyrus. Additionally, age regression analysis identified that reductions of csMTR in MS patients increase with age but appear to hit a plateau in the outer caudal anterior cingulate, as well as in the precentral and postcentral cortex. After correction for the naturally occurring gradient in cortical MTR, the difference in csMTR between the inner and outer cortex in focal areas in the brains of MS patients correlated with clinical disability. Overall, our findings support multi-surface analysis of csMTR as a sensitive marker of cortical sub-pial abnormality indicative of demyelination in MS patients.

A Robust Parallel Algorithm for Combinatorial Compressed Sensing

Science.gov (United States)

Mendoza-Smith, Rodrigo; Tanner, Jared W.; Wechsung, Florian

2018-04-01

In previous work two of the authors have shown that a vector $x \\in \\mathbb{R}^n$ with at most $k Parallel-$\\ell_0$ decoding algorithm, where $\\mathrm{nnz}(A)$ denotes the number of nonzero entries in $A \\in \\mathbb{R}^{m \\times n}$. In this paper we present the Robust-$\\ell_0$ decoding algorithm, which robustifies Parallel-$\\ell_0$ when the sketch $Ax$ is corrupted by additive noise. This robustness is achieved by approximating the asymptotic posterior distribution of values in the sketch given its corrupted measurements. We provide analytic expressions that approximate these posteriors under the assumptions that the nonzero entries in the signal and the noise are drawn from continuous distributions. Numerical experiments presented show that Robust-$\\ell_0$ is superior to existing greedy and combinatorial compressed sensing algorithms in the presence of small to moderate signal-to-noise ratios in the setting of Gaussian signals and Gaussian additive noise.

Geometric differential evolution for combinatorial and programs spaces.

Science.gov (United States)

Moraglio, A; Togelius, J; Silva, S

2013-01-01

Geometric differential evolution (GDE) is a recently introduced formal generalization of traditional differential evolution (DE) that can be used to derive specific differential evolution algorithms for both continuous and combinatorial spaces retaining the same geometric interpretation of the dynamics of the DE search across representations. In this article, we first review the theory behind the GDE algorithm, then, we use this framework to formally derive specific GDE for search spaces associated with binary strings, permutations, vectors of permutations and genetic programs. The resulting algorithms are representation-specific differential evolution algorithms searching the target spaces by acting directly on their underlying representations. We present experimental results for each of the new algorithms on a number of well-known problems comprising NK-landscapes, TSP, and Sudoku, for binary strings, permutations, and vectors of permutations. We also present results for the regression, artificial ant, parity, and multiplexer problems within the genetic programming domain. Experiments show that overall the new DE algorithms are competitive with well-tuned standard search algorithms.

MiYA, an efficient machine-learning workflow in conjunction with the YeastFab assembly strategy for combinatorial optimization of heterologous metabolic pathways in Saccharomyces cerevisiae.

Science.gov (United States)

Zhou, Yikang; Li, Gang; Dong, Junkai; Xing, Xin-Hui; Dai, Junbiao; Zhang, Chong

2018-05-01

Facing boosting ability to construct combinatorial metabolic pathways, how to search the metabolic sweet spot has become the rate-limiting step. We here reported an efficient Machine-learning workflow in conjunction with YeastFab Assembly strategy (MiYA) for combinatorial optimizing the large biosynthetic genotypic space of heterologous metabolic pathways in Saccharomyces cerevisiae. Using β-carotene biosynthetic pathway as example, we first demonstrated that MiYA has the power to search only a small fraction (2-5%) of combinatorial space to precisely tune the expression level of each gene with a machine-learning algorithm of an artificial neural network (ANN) ensemble to avoid over-fitting problem when dealing with a small number of training samples. We then applied MiYA to improve the biosynthesis of violacein. Feed with initial data from a colorimetric plate-based, pre-screened pool of 24 strains producing violacein, MiYA successfully predicted, and verified experimentally, the existence of a strain that showed a 2.42-fold titer improvement in violacein production among 3125 possible designs. Furthermore, MiYA was able to largely avoid the branch pathway of violacein biosynthesis that makes deoxyviolacein, and produces very pure violacein. Together, MiYA combines the advantages of standardized building blocks and machine learning to accelerate the Design-Build-Test-Learn (DBTL) cycle for combinatorial optimization of metabolic pathways, which could significantly accelerate the development of microbial cell factories. Copyright © 2018 International Metabolic Engineering Society. Published by Elsevier Inc. All rights reserved.

Combinatorial microelectrochemistry

International Nuclear Information System (INIS)

Maerkle, Wolfgang; Speiser, Bernd

2005-01-01

Microelectrode steady-state voltammetry is used to monitor on-line the progress of preparative electrolyses. This allows to follow educt and product concentrations as a function of the advance of the electrolysis, end-point detection, calculation of the number of electrons transferred per molecule, and determination of diffusion coefficient ratios for redox couples. The technique is demonstrated by numerical simulation, experiments with mixtures of redox partners, electrolyses in macrocells, and miniaturized electrolyses in vials or the wells of microtiter plates

Multimode Resource-Constrained Multiple Project Scheduling Problem under Fuzzy Random Environment and Its Application to a Large Scale Hydropower Construction Project

Science.gov (United States)

Xu, Jiuping

2014-01-01

This paper presents an extension of the multimode resource-constrained project scheduling problem for a large scale construction project where multiple parallel projects and a fuzzy random environment are considered. By taking into account the most typical goals in project management, a cost/weighted makespan/quality trade-off optimization model is constructed. To deal with the uncertainties, a hybrid crisp approach is used to transform the fuzzy random parameters into fuzzy variables that are subsequently defuzzified using an expected value operator with an optimistic-pessimistic index. Then a combinatorial-priority-based hybrid particle swarm optimization algorithm is developed to solve the proposed model, where the combinatorial particle swarm optimization and priority-based particle swarm optimization are designed to assign modes to activities and to schedule activities, respectively. Finally, the results and analysis of a practical example at a large scale hydropower construction project are presented to demonstrate the practicality and efficiency of the proposed model and optimization method. PMID:24550708

Multimode resource-constrained multiple project scheduling problem under fuzzy random environment and its application to a large scale hydropower construction project.

Science.gov (United States)

Xu, Jiuping; Feng, Cuiying

2014-01-01

This paper presents an extension of the multimode resource-constrained project scheduling problem for a large scale construction project where multiple parallel projects and a fuzzy random environment are considered. By taking into account the most typical goals in project management, a cost/weighted makespan/quality trade-off optimization model is constructed. To deal with the uncertainties, a hybrid crisp approach is used to transform the fuzzy random parameters into fuzzy variables that are subsequently defuzzified using an expected value operator with an optimistic-pessimistic index. Then a combinatorial-priority-based hybrid particle swarm optimization algorithm is developed to solve the proposed model, where the combinatorial particle swarm optimization and priority-based particle swarm optimization are designed to assign modes to activities and to schedule activities, respectively. Finally, the results and analysis of a practical example at a large scale hydropower construction project are presented to demonstrate the practicality and efficiency of the proposed model and optimization method.

Web Transfer Over Satellites Being Improved

Science.gov (United States)

Allman, Mark

1999-01-01

Extensive research conducted by NASA Lewis Research Center's Satellite Networks and Architectures Branch and the Ohio University has demonstrated performance improvements in World Wide Web transfers over satellite-based networks. The use of a new version of the Hypertext Transfer Protocol (HTTP) reduced the time required to load web pages over a single Transmission Control Protocol (TCP) connection traversing a satellite channel. However, an older technique of simultaneously making multiple requests of a given server has been shown to provide even faster transfer time. Unfortunately, the use of multiple simultaneous requests has been shown to be harmful to the network in general. Therefore, we are developing new mechanisms for the HTTP protocol which may allow a single request at any given time to perform as well as, or better than, multiple simultaneous requests. In the course of study, we also demonstrated that the time for web pages to load is at least as short via a satellite link as it is via a standard 28.8-kbps dialup modem channel. This demonstrates that satellites are a viable means of accessing the Internet.

Dendritic Cytoskeletal Architecture Is Modulated by Combinatorial Transcriptional Regulation in Drosophila melanogaster.

Science.gov (United States)

Das, Ravi; Bhattacharjee, Shatabdi; Patel, Atit A; Harris, Jenna M; Bhattacharya, Surajit; Letcher, Jamin M; Clark, Sarah G; Nanda, Sumit; Iyer, Eswar Prasad R; Ascoli, Giorgio A; Cox, Daniel N

2017-12-01

Transcription factors (TFs) have emerged as essential cell autonomous mediators of subtype specific dendritogenesis; however, the downstream effectors of these TFs remain largely unknown, as are the cellular events that TFs control to direct morphological change. As dendritic morphology is largely dictated by the organization of the actin and microtubule (MT) cytoskeletons, elucidating TF-mediated cytoskeletal regulatory programs is key to understanding molecular control of diverse dendritic morphologies. Previous studies in Drosophila melanogaster have demonstrated that the conserved TFs Cut and Knot exert combinatorial control over aspects of dendritic cytoskeleton development, promoting actin and MT-based arbor morphology, respectively. To investigate transcriptional targets of Cut and/or Knot regulation, we conducted systematic neurogenomic studies, coupled with in vivo genetic screens utilizing multi-fluor cytoskeletal and membrane marker reporters. These analyses identified a host of putative Cut and/or Knot effector molecules, and a subset of these putative TF targets converge on modulating dendritic cytoskeletal architecture, which are grouped into three major phenotypic categories, based upon neuromorphometric analyses: complexity enhancer, complexity shifter, and complexity suppressor. Complexity enhancer genes normally function to promote higher order dendritic growth and branching with variable effects on MT stabilization and F-actin organization, whereas complexity shifter and complexity suppressor genes normally function in regulating proximal-distal branching distribution or in restricting higher order branching complexity, respectively, with spatially restricted impacts on the dendritic cytoskeleton. Collectively, we implicate novel genes and cellular programs by which TFs distinctly and combinatorially govern dendritogenesis via cytoskeletal modulation. Copyright © 2017 by the Genetics Society of America.

Combinatorial study of zinc tin oxide thin-film transistors

Science.gov (United States)

McDowell, M. G.; Sanderson, R. J.; Hill, I. G.

2008-01-01

Groups of thin-film transistors using a zinc tin oxide semiconductor layer have been fabricated via a combinatorial rf sputtering technique. The ZnO :SnO2 ratio of the film varies as a function of position on the sample, from pure ZnO to SnO2, allowing for a study of zinc tin oxide transistor performance as a function of channel stoichiometry. The devices were found to have mobilities ranging from 2to12cm2/Vs, with two peaks in mobility in devices at ZnO fractions of 0.80±0.03 and 0.25±0.05, and on/off ratios as high as 107. Transistors composed predominantly of SnO2 were found to exhibit light sensitivity which affected both the on/off ratios and threshold voltages of these devices.

Comparative analysis on flexibility requirements of typical Cryogenic Transfer lines

Science.gov (United States)

Jadon, Mohit; Kumar, Uday; Choukekar, Ketan; Shah, Nitin; Sarkar, Biswanath

2017-04-01

The cryogenic systems and their applications; primarily in large Fusion devices, utilize multiple cryogen transfer lines of various sizes and complexities to transfer cryogenic fluids from plant to the various user/ applications. These transfer lines are composed of various critical sections i.e. tee section, elbows, flexible components etc. The mechanical sustainability (under failure circumstances) of these transfer lines are primary requirement for safe operation of the system and applications. The transfer lines need to be designed for multiple design constraints conditions like line layout, support locations and space restrictions. The transfer lines are subjected to single load and multiple load combinations, such as operational loads, seismic loads, leak in insulation vacuum loads etc. [1]. The analytical calculations and flexibility analysis using professional software are performed for the typical transfer lines without any flexible component, the results were analysed for functional and mechanical load conditions. The failure modes were identified along the critical sections. The same transfer line was then refurbished with the flexible components and analysed for failure modes. The flexible components provide additional flexibility to the transfer line system and make it safe. The results obtained from the analytical calculations were compared with those obtained from the flexibility analysis software calculations. The optimization of the flexible component’s size and selection was performed and components were selected to meet the design requirements as per code.

Improving the bulk data transfer experience

Energy Technology Data Exchange (ETDEWEB)

Guok, Chin; Guok, Chin; Lee, Jason R.; Berket, Karlo

2008-05-07

Scientific computations and collaborations increasingly rely on the network to provide high-speed data transfer, dissemination of results, access to instruments, support for computational steering, etc. The Energy Sciences Network is establishing a science data network to provide user driven bandwidth allocation. In a shared network environment, some reservations may not be granted due to the lack of available bandwidth on any single path. In many cases, the available bandwidth across multiple paths would be sufficient to grant the reservation. In this paper we investigate how to utilize the available bandwidth across multiple paths in the case of bulk data transfer.

An improved superconducting neural circuit and its application for a neural network solving a combinatorial optimization problem

International Nuclear Information System (INIS)

Onomi, T; Nakajima, K

2014-01-01

We have proposed a superconducting Hopfield-type neural network for solving the N-Queens problem which is one of combinatorial optimization problems. The sigmoid-shape function of a neuron output is represented by the output of coupled SQUIDs gate consisting of a single-junction and a double-junction SQUIDs. One of the important factors for an improvement of the network performance is an improvement of a threshold characteristic of a neuron circuit. In this paper, we report an improved design of coupled SQUID gates for a superconducting neural network. A step-like function with a steep threshold at a rising edge is desirable for a neuron circuit to solve a combinatorial optimization problem. A neuron circuit is composed of two coupled SQUIDs gates with a cascade connection in order to obtain such characteristics. The designed neuron circuit is fabricated by a 2.5 kA/cm 2 Nb/AlOx/Nb process. The operation of a fabricated neuron circuit is experimentally demonstrated. Moreover, we discuss about the performance of the neural network using the improved neuron circuits and delayed negative self-connections.

Towards combinatorial spectroscopy: the case of minor milk fatty acids determination.

Science.gov (United States)

Stefanov, I; Baeten, V; De Baets, B; Fievez, V

2013-08-15

Chemometrical models for determination of milk fatty acids (FA) are typically developed using spectral data from a single spectroscopy technique, e.g., mid-infrared spectroscopy in milk control. Such models perform poorly in determining minor components and are highly dependent on the spectral data source and on the type of matrix. In milk fat, the unsuccessful determination of minor (fatty acids lower than 1.0 g/100g in total fat) FA is often the result of: (1) the molecular structure similarity between the minor and the major FA within the milk fat matrix (thus the chemical signature specific to individual fatty acids has restricted specificity), and (2) the low signal intensity (detection limit) for specific vibrational modes. To overcome these limitations, data from different types of spectroscopy techniques, which brings additional chemical information in relation to the variation of the FA, could be included in the regression models to improve quantification. Here, Fourier transform (FT) Raman spectra were concatenated with attenuated total reflectance FT infrared (ATR/FTIR) spectra. The new combinatorial models showed up to 25% decrease in the root mean squared error of cross-validation (RMSECV) values, accompanied with a higher Rcv(2) for most individual FA or sums of FA groups, as compared to regression models based on Raman only or ATR/FTIR only spectra. In addition, improved models included less PLS components indicating an increased robustness. Interpretation of the most contributing regression coefficients indicated the value of newly combined spectral regions as carriers of specific chemical information. Although requiring additional spectroscopy instrumentation and prolonged acquisition time, this new combinatorial approach can be automated and is sufficient for semi-routine determination of the milk FA profile. Copyright © 2013 Elsevier B.V. All rights reserved.

Concept of combinatorial de novo design of drug-like molecules by particle swarm optimization.

Science.gov (United States)

Hartenfeller, Markus; Proschak, Ewgenij; Schüller, Andreas; Schneider, Gisbert

2008-07-01

We present a fast stochastic optimization algorithm for fragment-based molecular de novo design (COLIBREE, Combinatorial Library Breeding). The search strategy is based on a discrete version of particle swarm optimization. Molecules are represented by a scaffold, which remains constant during optimization, and variable linkers and side chains. Different linkers represent virtual chemical reactions. Side-chain building blocks were obtained from pseudo-retrosynthetic dissection of large compound databases. Here, ligand-based design was performed using chemically advanced template search (CATS) topological pharmacophore similarity to reference ligands as fitness function. A weighting scheme was included for particle swarm optimization-based molecular design, which permits the use of many reference ligands and allows for positive and negative design to be performed simultaneously. In a case study, the approach was applied to the de novo design of potential peroxisome proliferator-activated receptor subtype-selective agonists. The results demonstrate the ability of the technique to cope with large combinatorial chemistry spaces and its applicability to focused library design. The technique was able to perform exploitation of a known scheme and at the same time explorative search for novel ligands within the framework of a given molecular core structure. It thereby represents a practical solution for compound screening in the early hit and lead finding phase of a drug discovery project.

Combinatorial Libraries on Rigid Scaffolds: Solid Phase Synthesis of Variably Substituted Pyrazoles and Isoxazoles

Directory of Open Access Journals (Sweden)

Eduard R. Felder

1997-01-01

Full Text Available The synthesis of combinatorial compound libraries has become a powerful lead finding tool in modern drug discovery. The ability to synthesize rapidly, in high yield, new chemical entities with low molecular weight on a solid support has a recognized strategic relevance (“small molecule libraries”. We designed and validated a novel solid phase synthesis scheme, suitable to generate diversity on small heterocycles of the pyrazole and isoxazole type. Appropriate conditions were worked out for each reaction, and a variety of more or less reactive agents (building blocks was utilized for discrete conversions, in order to exploit the system’s breadth of applicability. Four sequential reaction steps were validated, including the loading of the support with an acetyl bearing moiety, a Claisen condensation, an a-alkylation and a cyclization of a b-diketone with monosubstituted hydrazines. In a second stage, the reaction sequence was applied in a split and mix approach, in order to prepare a combinatorial library built-up from 4 acetyl carboxylic acids (R1, 35 carboxylic esters (R2 and 41 hydrazines (R4 (and 1 hydroxylamine to yield a total of 11,760 compounds divided into 41 pyrazole sublibraries with 140 pairs of regioisomers and 1 isoxazole sublibrary of equal size.

Ranked solutions to a class of combinatorial optimizations - with applications in mass spectrometry based peptide sequencing

Science.gov (United States)

Doerr, Timothy; Alves, Gelio; Yu, Yi-Kuo

2006-03-01

Typical combinatorial optimizations are NP-hard; however, for a particular class of cost functions the corresponding combinatorial optimizations can be solved in polynomial time. This suggests a way to efficiently find approximate solutions - - find a transformation that makes the cost function as similar as possible to that of the solvable class. After keeping many high-ranking solutions using the approximate cost function, one may then re-assess these solutions with the full cost function to find the best approximate solution. Under this approach, it is important to be able to assess the quality of the solutions obtained, e.g., by finding the true ranking of kth best approximate solution when all possible solutions are considered exhaustively. To tackle this statistical issue, we provide a systematic method starting with a scaling function generated from the fininte number of high- ranking solutions followed by a convergent iterative mapping. This method, useful in a variant of the directed paths in random media problem proposed here, can also provide a statistical significance assessment for one of the most important proteomic tasks - - peptide sequencing using tandem mass spectrometry data.